llvm-svn: 52656

    ,------.
    |      |
    |      v
    |   t2 = phi ... t1 ...
    |      |
    |      v
    |   t1 = ...
    |  ... = ... t1 ...
    |      |
    `------'

where there is a use in a PHI node that's a predecessor to the defining
block. We don't want to mark all predecessors as having the value "alive" in
this case. Also, the assert was too restrictive and didn't handle this case.

llvm-svn: 52655

needs arbitrary-element removal.

llvm-svn: 52654

Add getScaledIntervalSize, which gives a measure of the size of an interval that is independent of the scaling of
the function due to empty index slots.  This is suitable for use in backend heuristics that need to reason about the density
of an interval.

llvm-svn: 52652

llvm-svn: 52651

Use getMBBEndIdx rather than assuming that the end is right after the last instruction in the block.

llvm-svn: 52649

llvm-svn: 52648

llvm-svn: 52647

the value of the element to be erased while the heap is
being updated.

llvm-svn: 52646

in the presence of out-of-loop users of in-loop values and the trip
count is not a known multiple of the unroll count, and to be a bit
simpler overall. This fixes PR2253.

llvm-svn: 52645

Remove option used to debug stack coloring bugs. It's no longer needed since stack coloring is now bug free.

llvm-svn: 52644

llvm-svn: 52643

clear() on each iteration. This avoids allocating and deallocating
all of DenseMap's memory on each iteration.

llvm-svn: 52642

llvm-svn: 52641

llvm-svn: 52640

Instead of adding an isSS field to LiveInterval to denote stack slot. Use top bit of 'reg' instead. If the top bit is set, than the LiveInterval represents a stack slot live interval.

llvm-svn: 52639

multiplicative inverse of a given number. Modify udivrem to allow input and 
output pairs of arguments to overlap. Patch is based on the work by Chandler
Carruth.

llvm-svn: 52638

llvm-svn: 52637

explaining why empty array constants use ValID::createUndef().

llvm-svn: 52636

Tighten the conditions under which we do PRE, remove some unneeded code, and correct our preserved analyses list, since we
do now change the CFG by splitting critical edges during PRE.

llvm-svn: 52631

llvm-svn: 52630

private implementation doesn't really need the convenience.

llvm-svn: 52629

llvm-svn: 52628

copying its return value.

llvm-svn: 52627

llvm-svn: 52626

llvm-svn: 52624

llvm-svn: 52623

Bail out with an error if there is no libcall available
for the given size of integer.

llvm-svn: 52622

llvm-svn: 52621

stores.

llvm-svn: 52620

llvm-svn: 52619

instance variables so they can be allocated just once, and reuse the worklist
as the dead list as well.

llvm-svn: 52618

with more than two nodes.

llvm-svn: 52617

llvm-svn: 52616

ConstantExprs.

llvm-svn: 52615

llvm-svn: 52614

llvm-svn: 52613

llvm-svn: 52612

structures.  Its default threshold is to promote things that are
smaller than 128 bytes, which is sane.  However, it is not sane
to do this for things that turn into 128 *registers*.  Add a cap
on the number of registers introduced, defaulting to 128/4=32.

llvm-svn: 52611

fixes PR2476; patch by Richard Osborne.  The same
problem exists for a bunch of other operators, but
I'm ignoring this because they will be automagically
fixed when the new LegalizeTypes infrastructure lands,
since it already solves this problem centrally.

llvm-svn: 52610