forked from OSchip/llvm-project
fd7df0cf38
Handle (x << s) != (y << s) where x != y and the shifts are non-wrapping. Once again, this establishes parity with the corresponing mul fold that already exists. The shift case is more powerful because we don't need to guard against multiplies by zero. |
||
|---|---|---|
| .. | ||
| aarch64.irg.ll | ||
| assume-queries-counter.ll | ||
| assume.ll | ||
| deref-abstract-gc.ll | ||
| deref-bitcast-of-gep.ll | ||
| dereferenceable-and-aligned.ll | ||
| func-ptr-lsb.ll | ||
| gep-negative-issue.ll | ||
| get-pointer-base-with-const-off.ll | ||
| invariant.group.ll | ||
| known-bits-from-operator-constexpr.ll | ||
| known-bits-from-range-md.ll | ||
| known-non-equal.ll | ||
| known-nonnull-at.ll | ||
| known-power-of-two.ll | ||
| knownzero-addrspacecast.ll | ||
| knownzero-shift.ll | ||
| memory-dereferenceable.ll | ||
| monotonic-phi.ll | ||
| non-negative-phi-bits.ll | ||
| numsignbits-from-assume.ll | ||
| pr23011.ll | ||
| select-pattern.ll | ||
| shift-recurrence-knownbits.ll | ||
| signbits-extract-elt.ll | ||