Be a bit more efficient when processing the active and inactive
authorAlkis Evlogimenos <alkis@evlogimenos.com>
Wed, 1 Sep 2004 22:52:29 +0000 (22:52 +0000)
committerAlkis Evlogimenos <alkis@evlogimenos.com>
Wed, 1 Sep 2004 22:52:29 +0000 (22:52 +0000)
commited543731fb385b55750d0c514d130a810339d739
treecbe8c69e8c7a8ab5a116bb85be5aa0d4415ac934
parent2e58a410896ffbee3d856b113c3718bc4a5462e8
Be a bit more efficient when processing the active and inactive
lists. Instead of scanning the vector backwards, scan it forward and
swap each element we want to erase. Then at the end erase all removed
intervals at once. This doesn't save much: 0.08s out of 4s when
compiling 176.gcc.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@16136 91177308-0d34-0410-b5e6-96231b3b80d8
lib/CodeGen/RegAllocIterativeScan.cpp
lib/CodeGen/RegAllocLinearScan.cpp