mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-23 17:29:19 +00:00
c9b1e25493
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 |
||
|---|---|---|
| .. | ||
| 2006-06-03-IncorrectIDFPhis.ll | ||
| 2006-06-12-MultipleExitsSameBlock.ll | ||
| 2006-07-09-NoDominator.ll | ||
| 2006-10-31-UnreachableBlock-2.ll | ||
| 2006-10-31-UnreachableBlock.ll | ||
| 2007-07-12-LICM-2.ll | ||
| 2007-07-12-LICM-3.ll | ||
| 2007-07-12-LICM.ll | ||
| basictest.ll | ||
| indirectbr.ll | ||
| invoke-dest.ll | ||
| lit.local.cfg | ||
| unreachable-use.ll | ||
| unused-phis.ll | ||