llvm-svn: 37697

 1. Make SmallPtrSet::erase faster in the small case by replacing a memmove
    with a pointer copy.
 2. Fix a bug where the null terminator at the end of the array in the small
    case was not copied

llvm-svn: 37696

Use schedulePass() to accomodate these requirement instead of directly
assigning a manager to new CallGraph PassManager.

llvm-svn: 37695

transformation.  Also, keep track of which end of the integer interval overflows
occur on.  This fixes Transforms/InstCombine/2007-06-21-DivCompareMiscomp.ll
and rdar://5278853, a miscompilation of perl.

llvm-svn: 37692

Change lots of sets from std::set to SmallPtrSet.  This reduces the time required to optimize 253.perlbmk from 10.9s to 5.3s.

llvm-svn: 37690

from LoopSimplify.cpp to Dominator.cpp

llvm-svn: 37689

llvm-svn: 37688

TargetLowering::getNumRegisters and similar, to avoid confusion with
the actual number of elements for vector types.

llvm-svn: 37687

(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))
(sub x, (select cc, 0, c)) -> (select cc, x, (sub, x, c))

llvm-svn: 37685

Eliminate a redundant check.  This speeds up optimization of 253.perlbmk from 13.5 seconds to 10.9 seconds.

llvm-svn: 37683

llvm-svn: 37681

routine.

llvm-svn: 37679

Split runOnFunction into many smaller functions.  This make it easier to get accurate performance analysis of GVNPRE.

llvm-svn: 37678

llvm-svn: 37673

llvm-svn: 37670

llvm-svn: 37669

Use a DenseMap instead of an std::map for the value numbering.  This reduces the time to optimize lencod on a PPC Debug build from ~300s to ~140s.

llvm-svn: 37668

Make dependsOnInvoke much more specific in what it tests, which in turn make it much faster to run.  This reduces the time to optimize lencondwith a debug build on PPC from ~450s to ~300s.

llvm-svn: 37667

llvm-svn: 37666

llvm-svn: 37665

Avoid if-converting simple block that ends with unconditional branch or fallthrough unless it branches / falls to the 'false' block. Not profitable, may end up increasing code size.

llvm-svn: 37660

llvm-svn: 37659

deleteValueFromRecords and loosen the types to all it to accept
Value* instead of just Instruction*, since this is what
ScalarEvolution uses internally anyway. This allows more flexibility
for future uses.

llvm-svn: 37657

for needing the DAG node to print pre-legalize extended value types, and
to get better debug messages with target-specific nodes.

llvm-svn: 37656

Handle constants in phi nodes properly.  This fixes test/Transforms/GVNPRE/2007-06-18-ConstantInPhi.ll

llvm-svn: 37655

llvm-svn: 37651

llvm-svn: 37650

llvm-svn: 37649

Be careful to erase values from all of the appropriate sets when they're not needed anymore.  This fixes a few more memory-related issues.

llvm-svn: 37647

Thanks to Nicholas for valgrinding this.

llvm-svn: 37646

Refactor GVNPRE to use a much smart method of uniquing value sets, and centralize a lot of the value numbering information.  No functionality change.

llvm-svn: 37645

with a general target hook to identify rematerializable instructions. Some
instructions are only rematerializable with specific operands, such as loads
from constant pools, while others are always rematerializable. This hook
allows both to be identified as being rematerializable with the same
mechanism.

llvm-svn: 37644

llvm-svn: 37643

Anton for half of this patch.

llvm-svn: 37641

llvm-svn: 37640

Look for VECTOR_SHUFFLE that's identity operation on either LHS or RHS. This can happen before DAGCombiner catches it.

llvm-svn: 37636

llvm-svn: 37634

llvm-svn: 37633

llvm-svn: 37630

by making it non-recursive

llvm-svn: 37629