mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-04 18:06:49 +00:00
cf71fe4229
The motivating example is this for (j = n; j > 1; j = i) { i = j / 2; } The signed division is safely to be changed to an unsigned division (j is known to be larger than 1 from the loop guard) and later turned into a single shift without considering the sign bit. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@263406 91177308-0d34-0410-b5e6-96231b3b80d8 |
||
---|---|---|
.. | ||
2010-09-02-Trunc.ll | ||
2010-09-26-MergeConstantRange.ll | ||
basic.ll | ||
conflict.ll | ||
crash.ll | ||
icmp.ll | ||
non-null.ll | ||
range.ll | ||
sdiv.ll | ||
select.ll |