aboutsummaryrefslogtreecommitdiff
path: root/clang/lib/Basic/Module.cpp
diff options
context:
space:
mode:
authorRoman Lebedev <lebedev.ri@gmail.com>2020-12-23 22:26:40 +0300
committerRoman Lebedev <lebedev.ri@gmail.com>2020-12-23 22:28:10 +0300
commit2b61e7c68cda16159b186fea1a1b1252b94b7e16 (patch)
treee506b768f50625caafc5267e77d0f44e7d2c91c0 /clang/lib/Basic/Module.cpp
parenta0ddc61c5b95be2585b6b4981cf8634d7a00e4a6 (diff)
downloadllvm-2b61e7c68cda16159b186fea1a1b1252b94b7e16.zip
llvm-2b61e7c68cda16159b186fea1a1b1252b94b7e16.tar.gz
llvm-2b61e7c68cda16159b186fea1a1b1252b94b7e16.tar.bz2
[LoopIdiom] 'left-shift until bittest' idiom: support rewriting loop as countable, allow extra cruft
The current state of the transform is still not enough to support my motivational pattern, because it has one more "induction variable". I have delayed posting this patch, because originally even just rewriting the loop as countable wasn't enough to nicely transform my motivational pattern, because i expected that extra IV to be rewritten afterwards, but it wasn't happening until i fixed that in D91800. So, this patch allows the 'left-shift until bittest' loop idiom as long as the inserted ops are cheap, and lifts any and all extra use checks on the instructions. Reviewed By: craig.topper Differential Revision: https://reviews.llvm.org/D92754
Diffstat (limited to 'clang/lib/Basic/Module.cpp')
0 files changed, 0 insertions, 0 deletions