mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-07-26 06:29:20 +00:00
f62c44a38d
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. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37714 91177308-0d34-0410-b5e6-96231b3b80d8 |
||
|---|---|---|
| .. | ||
| ADCE.cpp | ||
| BasicBlockPlacement.cpp | ||
| CodeGenPrepare.cpp | ||
| CondPropagate.cpp | ||
| ConstantProp.cpp | ||
| CorrelatedExprs.cpp | ||
| DCE.cpp | ||
| DeadStoreElimination.cpp | ||
| GCSE.cpp | ||
| GVNPRE.cpp | ||
| IndVarSimplify.cpp | ||
| InstructionCombining.cpp | ||
| LICM.cpp | ||
| LoopRotation.cpp | ||
| LoopStrengthReduce.cpp | ||
| LoopUnroll.cpp | ||
| LoopUnswitch.cpp | ||
| LowerGC.cpp | ||
| LowerPacked.cpp | ||
| Makefile | ||
| PredicateSimplifier.cpp | ||
| Reassociate.cpp | ||
| Reg2Mem.cpp | ||
| ScalarReplAggregates.cpp | ||
| SCCP.cpp | ||
| SimplifyCFG.cpp | ||
| TailDuplication.cpp | ||
| TailRecursionElimination.cpp | ||