llvm-svn: 37715

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

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

llvm-svn: 37705

TargetLowering to SelectionDAG so that they have more convenient
access to the current DAG, in preparation for the ValueType routines
being changed from standalone functions to members of SelectionDAG for
the pre-legalize vector type changes.

llvm-svn: 37704

llvm-svn: 37703

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

std::set is really really terrible. Switch to SmallPtrSet to reduce compile time. For Duraid's example. The overall isel time is reduced from 0.6255 sec to 0.1876 sec.

llvm-svn: 37701

llvm-svn: 37700

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

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

Have internal df_iterator's use SmallPtrSet instead of std::set.  This provides compile time speedups to any pass using df_iterator.

llvm-svn: 37694

llvm-svn: 37693

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

llvm-svn: 37691

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

llvm-svn: 37686

(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: 37676

only one ImmutablePass in a group.

llvm-svn: 37675

llvm-svn: 37674

llvm-svn: 37673

llvm-svn: 37672