summaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorPhilip Reames <listmail@philipreames.com>2021-11-05 15:35:53 -0700
committerPhilip Reames <listmail@philipreames.com>2021-11-05 15:36:47 -0700
commitd24a0e88576dca1c475a7f48d4361136a46f9b72 (patch)
tree4d8c796590a41d75d6acc4358988cb62c18f217b /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parent3c7960cba19ed926b8e86b4c619e81c0f7da4d15 (diff)
[SCEV] Use constant range of RHS to prove NUW on narrow IV in trip count logic
The basic idea here is that given a zero extended narrow IV, we can prove the inner IV to be NUW if we can prove there's a value the inner IV must take before overflow which must exit the loop. Differential Revision: https://reviews.llvm.org/D109457
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions