llvm-svn: 34382

llvm-svn: 34342

llvm-svn: 32698

is 'unsigned'.

llvm-svn: 32279

llvm-svn: 32251

llvm-svn: 32113

a #include of iostream.

llvm-svn: 31800

llvm-svn: 31561

llvm-svn: 31500

llvm-svn: 31153

llvm-svn: 29911

llvm-svn: 29471

llvm-svn: 29434

llvm-svn: 29220

llvm-svn: 28973

that still fails (because all the register spill weights are inf), just grab
one.

llvm-svn: 28262

llvm-svn: 28219

the use follows def immediately, it doesn't make sense to spill it and
hope it will be easier to allocate for this LI.

llvm-svn: 28217

llvm-svn: 27133

llvm-svn: 26328

llvm-svn: 25515

llvm-svn: 25031

do it. :)

    <_sabre_> excuses excuses

llvm-svn: 24471

asserts.

llvm-svn: 24445

llvm-svn: 23400

This fixes PR621 and Regression/CodeGen/X86/2005-08-30-RegAllocAliasProblem.ll

llvm-svn: 23158

Use this information to avoid doing expensive interval intersections for
registers that could not possible be interesting.  This speeds up linscan
on ia64 compiling kc++ in release mode from taking 7.82s to 4.8s(!), total
itanium llc time on this program is 27.3s now.  This marginally speeds up
PPC and X86, but they appear to be limited by other parts of linscan, not
this code.

On this program, on itanium, live intervals now takes 41% of llc time.

llvm-svn: 22986

number of regs (e.g. most riscs), many functions won't need to use callee
clobbered registers.  Do a speculative check to see if we can get a free
register without processing the fixed list (which has all of these).  This
saves a lot of time on machines with lots of callee clobbered regs (e.g.
ppc and itanium, also x86).

This reduces ppc llc compile time from 184s -> 172s on kc++.  This is probably
worth FAR FAR more on itanium though.

llvm-svn: 22972

we spill out of the fast path.  The scan of active_ and the calls to
updateSpillWeights don't need to happen unless a spill occurs.  This reduces
debug llc time of kc++ with ppc from 187.3s to 183.2s.

llvm-svn: 22971

add some comments.  This loop really needs to be reevaluated!

llvm-svn: 22966

llvm-svn: 21420

llvm-svn: 19791

llvm-svn: 19385

llvm-svn: 18955

20%, shaving 0.1s off hbd compile time on my g5.  Yay.

llvm-svn: 18592

* Do not put fixed registers into the unhandled set.  This means they will
  never find their way into the inactive, active, or handled sets, so we
  can simplify a bunch of code.

llvm-svn: 17945

intersecting an interval.

llvm-svn: 17939

search physreg intervals every time we access it.  This takes another
half second off of linscan.

llvm-svn: 17937

the iterator hints we have to speed up overlaps().  This speeds linscan up
by about .2s (out of 8.7) on 175.vpr for PPC.

llvm-svn: 17935

* Eliminate the releaseMemory method, this is not an analysis
* Change the fixed, active, and inactive lists of intervals to maintain an
  iterator for the current position in the interval.  This allows us to do
  constant time increments of the iterator instead of having to do a binary
  search to find our liverange in our liveinterval all of the time, which
  substantially speeds up cases where LiveIntervals have many LiveRanges
  - which is very common for physical registers.  On targets with many
  physregs, this can make a noticable difference.

  With a release build of LLC for PPC, this halves the time in
  processInactiveIntervals and processActiveIntervals, from 1.5s to .75s.

  This also lays the ground for more to come.

llvm-svn: 17933