llvm-svn: 19360

llvm-svn: 19359

llvm-svn: 19358

CodeGen/Generic/select.ll:castconst.

llvm-svn: 19357

llvm-svn: 19356

int GEP indices on 64-bit archs.

llvm-svn: 19354

llvm-svn: 19353

llvm-svn: 19352

llvm-svn: 19350

llvm-svn: 19349

llvm-svn: 19348

llvm-svn: 19346

llvm-svn: 19345

llvm-svn: 19339

of the code for lowering from LLVM code to a SelectionDAG.

llvm-svn: 19331

llvm-svn: 19330

to go, but it does work for some non-trivial cases now.

llvm-svn: 19329

llvm-svn: 19327

1. If we are two-addressing a commutable instruction and the LHS is not the
   last use of the variable, see if the instruction is the last use of the
   RHS.  If so, commute the instruction, allowing us to avoid a
   register-register copy in many cases for common instructions like ADD, OR,
   AND, etc on X86.
2. If #1 doesn't hold, and if this is an instruction that also existing in
   3-address form, promote the instruction to a 3-address instruction to
   avoid the register-register copy.  We can do this for several common
   instructions in X86, including ADDrr, INC, DEC, etc.

This patch implements test/Regression/CodeGen/X86/commute-two-addr.ll,
overlap-add.ll, and overlap-shift.ll when I check in the X86 support for it.

llvm-svn: 19245

llvm-svn: 18955

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

llvm-svn: 18592

Make only one print method to avoid overloaded virtual warnings when \
compiled with -Woverloaded-virtual

llvm-svn: 18589

Prolang-C/bison in the JIT

llvm-svn: 18477

PR449

llvm-svn: 18306

llvm-svn: 18131

llvm-svn: 18129

llvm-svn: 18064

llvm-svn: 18034

llvm-svn: 18009

* 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

incrementing i.

llvm-svn: 17944

i->start == j->start, then certainly i->end > j->start.

llvm-svn: 17943

intersecting an interval.

llvm-svn: 17939

llvm-svn: 17938

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

llvm-svn: 17937

llvm-svn: 17936

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

llvm-svn: 17934

* 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

llvm-svn: 17932