forked from OSchip/llvm-project
d60ae33d29
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.
llvm-svn: 263406
|
||
|---|---|---|
| .. | ||
| 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 | ||