mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-11-01 00:11:00 +00:00
7e79b3898d
1. Update an obsolete comment.
2. Make the sorting by base an explicit (though still N^2) step, so
that the code is more clear on what it is doing.
3. Partition uses so that uses inside the loop are handled before uses
outside the loop.
Note that none of these changes currently changes the code inserted by LSR,
but they are a stepping stone to getting there.
This code is the result of some crazy pair programming with Nate. :)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@29493 91177308-0d34-0410-b5e6-96231b3b80d8
|
||
|---|---|---|
| .. | ||
| ADCE.cpp | ||
| BasicBlockPlacement.cpp | ||
| CondPropagate.cpp | ||
| ConstantProp.cpp | ||
| CorrelatedExprs.cpp | ||
| DCE.cpp | ||
| DeadStoreElimination.cpp | ||
| GCSE.cpp | ||
| IndVarSimplify.cpp | ||
| InstructionCombining.cpp | ||
| LICM.cpp | ||
| LoopStrengthReduce.cpp | ||
| LoopUnroll.cpp | ||
| LoopUnswitch.cpp | ||
| LowerGC.cpp | ||
| LowerPacked.cpp | ||
| Makefile | ||
| Reassociate.cpp | ||
| Reg2Mem.cpp | ||
| ScalarReplAggregates.cpp | ||
| SCCP.cpp | ||
| SimplifyCFG.cpp | ||
| TailDuplication.cpp | ||
| TailRecursionElimination.cpp | ||