entries in the correct order, fixing several fixmes.

llvm-svn: 29902

llvm-svn: 29901

llvm-svn: 29896

paves the way for future changes, increases coallescing opportunities (in
theory, not witnessed in practice), and eliminates the really expensive
LiveIntervals::overlapsAliases method.

llvm-svn: 29890

llvm-svn: 29888

information and exception handling.

llvm-svn: 29881

llvm-svn: 29879

right section.

llvm-svn: 29871

llvm-svn: 29865

instructions which define each value#) to simplify and improve the coallescer.
In particular, this patch:

1. Implements iterative coallescing.
2. Reverts an unsafe hack from handlePhysRegDef, superceeding it with a
   better solution.
3. Implements PR865, "coallescing" away the second copy in code like:

   A = B
   ...
   B = A

This also includes changes to symbolically print registers in intervals
when possible.

llvm-svn: 29862

does emit linkable .o files in very simple cases.

llvm-svn: 29850

defines each value# tracked by the interval.  This will be used to improve
coallescing.

llvm-svn: 29830

llvm-svn: 29805

*** Register mapping ***
  reg 1024 -> %reg1028
  reg 1026 -> EAX
  reg 1027 -> %reg1028

instead of:

*** Register mapping ***
  reg 1024 -> reg 1028
  reg 1026 -> reg 15
  reg 1027 -> reg 1028

llvm-svn: 29803

llvm-svn: 29799

llvm-svn: 29796

    MOV R0, R1
    MOV R1, R0

the second machine instruction is removed. Added a regression test.

llvm-svn: 29792

This reduces selectiondag time on kc++ from 5.43s to 4.98s (9%).  More
significantly, this speeds up the default ppc scheduler from ~1571ms to 1063ms,
a 33% speedup.

llvm-svn: 29743

llvm-svn: 29740

llvm-svn: 29730

llvm-svn: 29711

the creation of canonical VTLists.

llvm-svn: 29709

llvm-svn: 29687

of value-type nodes.  This avoids having to do mallocs for std::vectors of
valuetypes when a node returns more than one type.

llvm-svn: 29685

llvm-svn: 29677

kimwitu, but seems like a good idea from a "avoid performance cliffs" standpoint :)

llvm-svn: 29675

Rafael Espindola for pointing this out.

llvm-svn: 29669

the number of relocations in object files, shrinkifying them.

llvm-svn: 29650

llvm-svn: 29648

doesn't significantly improve performance but it helps a small amount.

llvm-svn: 29642

speedup in isel time.

llvm-svn: 29640

llvm-svn: 29631

RegNodes, and ValueNodes maps into the CSEMap.

llvm-svn: 29626

llvm-svn: 29621

make a temporary vector.

llvm-svn: 29618

instead of a vector of operands.

llvm-svn: 29616

in the start of an array and a count of operands where applicable.  In many
cases, the number of operands is known, so this static array can be allocated
on the stack, avoiding the heap.  In many other cases, a SmallVector can be
used, which has the same benefit in the common cases.

I updated a lot of code calling getNode that takes a vector, but ran out of
time.  The rest of the code should be updated, and these methods should be
removed.

We should also do the same thing to eliminate the methods that take a
vector of MVT::ValueTypes.

It would be extra nice to convert the dagiselemitter to avoid creating vectors
for operands when calling getTargetNode.

llvm-svn: 29566

method that took std::vector<SDOperand> to take a pointer to a first operand
and #operands.

This speeds up isel on kc++ by about 3%.

llvm-svn: 29561

eliminates a bunch of std::map's in the SelectionDAG, replacing them with a
home-grown hashtable.

This is still a work in progress: not all the maps have been moved over and the
hashtable never resizes.  That said, this still speeds up llc 20% on kimwitu++
with -fast -regalloc=local using a release build.

llvm-svn: 29550

llvm-svn: 29546