mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 03:33:20 +01:00
45937543a4
Currently IRCE relies on the loops it transforms to be (semantically) of the form: for (i = START; i < END; i++) ... or for (i = START; i > END; i--) ... However, we were not verifying the presence of the START < END entry check (i.e. check before the first iteration). We were only verifying that the backedge was guarded by (i + 1) < END. Usually this would work "fine" since (especially in Java) most loops do actually have the START < END check, but of course that is not guaranteed. llvm-svn: 294375 |
||
---|---|---|
.. | ||
add-metadata-pre-post-loops.ll | ||
bad-loop-structure.ll | ||
bug-loop-varying-upper-limit.ll | ||
bug-mismatched-types.ll | ||
conjunctive-checks.ll | ||
decrementing-loop.ll | ||
low-becount.ll | ||
multiple-access-no-preloop.ll | ||
not-likely-taken.ll | ||
only-lower-check.ll | ||
only-upper-check.ll | ||
single-access-no-preloop.ll | ||
single-access-with-preloop.ll | ||
skip-profitability-checks.ll | ||
unhandled.ll | ||
with-parent-loops.ll |