llvm-svn: 37792

llvm-svn: 37789

llvm-svn: 37788

Add support for performing GVNPRE on select instructions.  This fixes test/Transforms/GVNPRE/select.ll.

llvm-svn: 37783

loop.
- Avoid loop unswich for loop header branch.
- While cloning dominators fix typo and handle self dominating blocks.

llvm-svn: 37772

llvm-svn: 37771

to loop unswitch candidate for the loop.

llvm-svn: 37770

Anton's testcase from 35.5s to 34.7s.

llvm-svn: 37769

Use cached information that has already been computed to make clean() simpler and faster.  This is a small speedup on most cases.

llvm-svn: 37761

This saves many lines of code duplication.  No functionality change.

llvm-svn: 37759

llvm-svn: 37751

llvm-svn: 37745

2. When calculating ANTIC_IN, only iterate the changed blocks.  For most average
inputs this is a small speedup, but for cases with unusual CFGs, this can be a significant win.

llvm-svn: 37742

with weak linkage.

llvm-svn: 37723

llvm-svn: 37721

2) Remove some maximal-set computing code that is no longer used.
3) Use a post-order CFG traversal to compute ANTIC_IN instead of a postdom traversal.
This causes the ANTIC_IN calculation to converge much faster.  Thanks to Daniel Berlin for suggesting this.

With this patch, the time to optimize 403.gcc decreased from 17.5s to 7.5s, and Anton's huge
testcase decreased from 62 minutes to 38 seconds.

llvm-svn: 37714

llvm-svn: 37713

llvm-svn: 37712

llvm-svn: 37710

blocks, and optimizing within one basic block.

llvm-svn: 37709

Rework topo_sort so eliminate some behavior that scaled terribly.  This reduces the time to optimize 403.gcc from 18.2s to 17.5s,
and has an even larger effect on larger testcases.

llvm-svn: 37708

Perform fewer set insertions while calculating ANTIC_IN.  This reduces the amount of time to optimize 403.gcc from 21.9s to 18.2s.

llvm-svn: 37707

Remove some code that I was using for collecting performance information that should not have been committed.

llvm-svn: 37706

Avoid excessive calls to find_leader when calculating AVAIL_OUT.  This reduces the time to optimize 403.gcc from 23.5s to 21.9s.

llvm-svn: 37702

Reserve space in vectors before topologically sorting into them.  This improves the time to optimize 403.gcc from 28s to 23.5s.

llvm-svn: 37699

Make a bunch of optimizations for compile time to GVNPRE, including smarter set unions, deferring blocks rather than computing maximal sets, and smarter use of sets.  With these enhancements, the time to optimize 273.perlbmk goes from 5.3s to 2.7s.

llvm-svn: 37698

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

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

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

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