summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorChandler Carruth <chandlerc@gmail.com>2011-11-27 00:38:03 +0000
committerChandler Carruth <chandlerc@gmail.com>2011-11-27 00:38:03 +0000
commit9ffb97e631d73ff0e1b6ddab782e86ce5871b801 (patch)
tree05ff9a2109b328a9f57820ada1c364dbcc63cca1 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parent4eefd2d52fedf0ed2b36e05b94283c8aeb8284bb (diff)
downloadbcm5719-llvm-9ffb97e631d73ff0e1b6ddab782e86ce5871b801.tar.gz
bcm5719-llvm-9ffb97e631d73ff0e1b6ddab782e86ce5871b801.zip
Introduce a loop block rotation optimization to the new block placement
pass. This is designed to achieve one of the important optimizations that the old code placement pass did, but more simply. This is a somewhat rough and *very* conservative version of the transform. We could get a lot fancier here if there are profitable cases to do so. In particular, this only looks for a single pattern, it insists that the loop backedge being rotated away is the last backedge in the chain, and it doesn't provide any means of doing better in-loop placement due to the rotation. However, it appears that it will handle the important loops I am finding in the LLVM test suite. llvm-svn: 145158
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud