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
..
llvm	Enable the new LoopInfo algorithm by default.	2012-06-26 04:11:38 +00:00
llvm-c	Fix typos found by http://github.com/lyda/misspell-check	2012-06-02 10:20:22 +00:00