Use push_back rather than operator[], which is incorrect in this cases. Unfortunately, this slow the testcase down a little bit,
but only marginally.

llvm-svn: 52700

of after, so that any reallocation it does doesn't get counted for the pass
being timed.  This probably doesn't account for a timing discrepancy I was
looking into, but I'm fixing it anyway.

llvm-svn: 52693

load,store,call,return,bitcast.  This is enough to
make call and return work.

llvm-svn: 52691

In ConstantArray::getAsString(), we know the size of the resultant string in advance so we can pre-allocate it and just fill in
the entries.  This improves the time for the AsmPrinter on InstructionCombining.cpp from 0.4248s to 0.3370s.

llvm-svn: 52690

llvm-svn: 52689

llvm-svn: 52688

llvm-svn: 52687

llvm-svn: 52684

Also add a testcase to reproduce the gcc bootstrap failure in very much reduced form.

llvm-svn: 52677

llvm-svn: 52672

If it's determined safe, remat MOV32r0 (i.e. xor r, r) and others as it is instead of using the longer MOV32ri instruction.

llvm-svn: 52670

llvm-svn: 52664

llvm-svn: 52663

general solution possible, but it's a fairly simple one.
Based on a patch from the OpenGTL project!

llvm-svn: 52662

as a questionable case, but the code isn't actually needed.

llvm-svn: 52657

    ,------.
    |      |
    |      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

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

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

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: 52624

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

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