mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-23 13:02:52 +02:00
5c904052a0
We would eventually catch these via demanded bits and computing known bits in InstCombine, but I think it's better to handle the simple cases as soon as possible as a matter of efficiency. This fold allows further simplifications based on distributed ops transforms. eg: %a = lshr i8 %x, 7 %b = or i8 %a, 2 %c = and i8 %b, 1 InstSimplify can directly fold this now: %a = lshr i8 %x, 7 Differential Revision: https://reviews.llvm.org/D33221 llvm-svn: 303213 |
||
|---|---|---|
| .. | ||
| 2010-12-20-Boolean.ll | ||
| 2011-01-14-Thread.ll | ||
| 2011-02-01-Vector.ll | ||
| 2011-09-05-InsertExtractValue.ll | ||
| 2011-10-27-BinOpCrash.ll | ||
| 2011-11-23-MaskedBitsCrash.ll | ||
| 2013-04-19-ConstantFoldingCrash.ll | ||
| add-mask.ll | ||
| addsub.ll | ||
| and-icmps-same-ops.ll | ||
| AndOrXor.ll | ||
| assume.ll | ||
| bitcast-vector-fold.ll | ||
| bitreverse.ll | ||
| bswap.ll | ||
| call-callconv.ll | ||
| call.ll | ||
| cast.ll | ||
| compare.ll | ||
| dead-code-removal.ll | ||
| div.ll | ||
| exact-nsw-nuw.ll | ||
| fast-math.ll | ||
| fdiv.ll | ||
| floating-point-arithmetic.ll | ||
| floating-point-compare.ll | ||
| fold-builtin-fma.ll | ||
| gep.ll | ||
| icmp-constant.ll | ||
| icmp-ranges.ll | ||
| implies.ll | ||
| load-relative-32.ll | ||
| load-relative.ll | ||
| load.ll | ||
| maxmin.ll | ||
| mul.ll | ||
| negate.ll | ||
| noalias-ptr.ll | ||
| or-icmps-same-ops.ll | ||
| or.ll | ||
| past-the-end.ll | ||
| phi.ll | ||
| pr28725.ll | ||
| ptr_diff.ll | ||
| reassociate.ll | ||
| rem.ll | ||
| require-dominator.ll | ||
| returned.ll | ||
| select.ll | ||
| shift-128-kb.ll | ||
| shift-knownbits.ll | ||
| shr-nop.ll | ||
| shufflevector.ll | ||
| undef.ll | ||
| vec-cmp.ll | ||
| vector_gep.ll | ||
| vector_ptr_bitcast.ll | ||