mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 20:23:11 +01:00
3248675f42
This is a simple implementation of the unroll-and-jam classical loop
optimisation.
The basic idea is that we take an outer loop of the form:
for i..
ForeBlocks(i)
for j..
SubLoopBlocks(i, j)
AftBlocks(i)
Instead of doing normal inner or outer unrolling, we unroll as follows:
for i... i+=2
ForeBlocks(i)
ForeBlocks(i+1)
for j..
SubLoopBlocks(i, j)
SubLoopBlocks(i+1, j)
AftBlocks(i)
AftBlocks(i+1)
Remainder Loop
So we have unrolled the outer loop, then jammed the two inner loops into
one. This can lead to a simpler inner loop if memory accesses can be shared
between the now jammed loops.
To do this we have to prove that this is all safe, both for the memory
accesses (using dependence analysis) and that ForeBlocks(i+1) can move before
AftBlocks(i) and SubLoopBlocks(i, j).
Differential Revision: https://reviews.llvm.org/D41953
llvm-svn: 336062
|
||
|---|---|---|
| .. | ||
| Transforms | ||
| Analysis.h | ||
| BitReader.h | ||
| BitWriter.h | ||
| Comdat.h | ||
| Core.h | ||
| DataTypes.h | ||
| DebugInfo.h | ||
| Disassembler.h | ||
| DisassemblerTypes.h | ||
| ErrorHandling.h | ||
| ExecutionEngine.h | ||
| Initialization.h | ||
| IRReader.h | ||
| Linker.h | ||
| LinkTimeOptimizer.h | ||
| lto.h | ||
| module.modulemap | ||
| Object.h | ||
| OrcBindings.h | ||
| Support.h | ||
| Target.h | ||
| TargetMachine.h | ||
| Types.h | ||