diff options
| author | Eli Friedman <efriedma@codeaurora.org> | 2018-06-22 22:58:55 +0000 |
|---|---|---|
| committer | Eli Friedman <efriedma@codeaurora.org> | 2018-06-22 22:58:55 +0000 |
| commit | 203eaaf5badb8f697d37c76aaff414846bf626c3 (patch) | |
| tree | 3b5adb888c1afc029249b32ccca0980f605057b6 /lldb/examples/python | |
| parent | 2cbf9730b0201bd8545b7a6e2b087785f248418c (diff) | |
| download | bcm5719-llvm-203eaaf5badb8f697d37c76aaff414846bf626c3.tar.gz bcm5719-llvm-203eaaf5badb8f697d37c76aaff414846bf626c3.zip | |
[LoopReroll] Rewrite induction variable rewriting.
This gets rid of a bunch of weird special cases; instead, just use SCEV
rewriting for everything. In addition to being simpler, this fixes a
bug where we would use the wrong stride in certain edge cases.
The one bit I'm not quite sure about is the trip count handling,
specifically the FIXME about overflow. In general, I think we need to
widen the exit condition, but that's probably not profitable if the new
type isn't legal, so we probably need a check somewhere. That said, I
don't think I'm making the existing problem any worse.
As a followup to this, a bunch of IV-related code in root-finding could
be cleaned up; with SCEV-based rewriting, there isn't any reason to
assume a loop will have exactly one or two PHI nodes.
Differential Revision: https://reviews.llvm.org/D45191
llvm-svn: 335400
Diffstat (limited to 'lldb/examples/python')
0 files changed, 0 insertions, 0 deletions
