Andrew Trick c9b1e25493 Enable the new LoopInfo algorithm by default. ... The primary advantage is that loop optimizations will be applied in a stable order. This helps debugging and unit test creation. It is also a better overall implementation without pathologically bad performance on deep functions. On large functions (llvm-stress --size=200000 | opt -loops) Before: 0.1263s After: 0.0225s On deep functions (after tweaking llvm-stress, thanks Nadav): Before: 0.2281s After: 0.0227s See r158790 for more comments. The loop tree is now consistently generated in forward order, but loop passes are applied in reverse order over the program. If we have a loop optimization that prefers forward order, that can easily be achieved by adding a different type of LoopPassManager. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@159183 91177308-0d34-0410-b5e6-96231b3b80d8		2012-06-26 04:11:38 +00:00
..
2006-06-13-SingleEntryPHI.ll
2006-06-27-DeadSwitchCase.ll
2007-05-09-tl.ll
2007-05-09-Unreachable.ll
2007-07-12-ExitDomInfo.ll
2007-07-13-DomInfo.ll
2007-07-18-DomInfo.ll
2007-08-01-Dom.ll
2007-08-01-LCSSA.ll
2007-10-04-DomFrontier.ll
2008-06-02-DomInfo.ll
2008-06-17-DomFrontier.ll
2008-11-03-Invariant.ll
2010-11-18-LCSSA.ll
2011-06-02-CritSwitch.ll
2011-09-26-EHCrash.ll
2011-11-18-SimpleSwitch.ll	Enable the new LoopInfo algorithm by default.	2012-06-26 04:11:38 +00:00
2011-11-18-TwoSwitches-Threshold.ll	Enable the new LoopInfo algorithm by default.	2012-06-26 04:11:38 +00:00
2011-11-18-TwoSwitches.ll	Enable the new LoopInfo algorithm by default.	2012-06-26 04:11:38 +00:00
2012-04-02-IndirectBr.ll	Fix 12513: Loop unrolling breaks with indirect branches.	2012-04-10 05:14:42 +00:00
2012-04-30-LoopUnswitch-LPad-Crash.ll	Second attempt at PR12573:	2012-04-30 10:44:54 +00:00
2012-05-20-Phi.ll	Do not pass an invalid domtree to SimplifyInstruction from	2012-05-20 01:32:09 +00:00
basictest.ll
crash.ll
infinite-loop.ll
lit.local.cfg
preserve-analyses.ll