summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Transforms/Scalar/GVN.cpp
diff options
context:
space:
mode:
authorDavid Green <david.green@arm.com>2018-05-27 12:11:21 +0000
committerDavid Green <david.green@arm.com>2018-05-27 12:11:21 +0000
commit3034281b437d681664b72ddbab9178cfcf1f608e (patch)
tree65a24350743429c4b921b47422b7d86f6806d8aa /llvm/lib/Transforms/Scalar/GVN.cpp
parent958a1f8d871b08e20b0ba71e5fab24957bba9c86 (diff)
downloadbcm5719-llvm-3034281b437d681664b72ddbab9178cfcf1f608e.tar.gz
bcm5719-llvm-3034281b437d681664b72ddbab9178cfcf1f608e.zip
[UnrollAndJam] Add a new Unroll and Jam pass
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 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: 333358
Diffstat (limited to 'llvm/lib/Transforms/Scalar/GVN.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud