4 Commits

Author	SHA1	Message	Date
Andrew Trick	fb2ba3e1cb	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. llvm-svn: 159183	2012-06-26 04:11:38 +00:00
Chad Rosier	388769427d	Reinstate r146578; it doesn't appear to be the cause of some recent execution- ... time regressions. In general, it is beneficial to compile-time. Original commit message: Fix for bug #11429: Wrong behaviour for switches. Small improvement for code size heuristics. llvm-svn: 147175	2011-12-22 21:06:36 +00:00
Chad Rosier	1b7e2baf47	Speculatively revert r146578 to determine if it is the cause of a number of ... performance regressions (both execution-time and compile-time) on our nightly testers. Original commit message: Fix for bug #11429: Wrong behaviour for switches. Small improvement for code size heuristics. llvm-svn: 147131	2011-12-22 02:40:57 +00:00
Stepan Dyatkovskiy	d7b2bb3bdd	Fix for bug #11429: Wrong behaviour for switches. Small improvement for code size heuristics. ... llvm-svn: 146578	2011-12-14 19:19:17 +00:00