1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-25 14:02:52 +02:00
llvm-mirror/test/Transforms/InstSimplify
Philip Reames 0d08416c1f [InstSimplify] sgt on i1s also encodes implication
Follow on to http://reviews.llvm.org/D13074, implementing something pointed out by Sanjoy. His truth table from his comment on that bug summarizes things well:
LHS | RHS | LHS >=s RHS | LHS implies RHS
0 | 0 | 1 (0 >= 0) | 1
0 | 1 | 1 (0 >= -1) | 1
1 | 0 | 0 (-1 >= 0) | 0
1 | 1 | 1 (-1 >= -1) | 1

The key point is that an "i1 1" is the value "-1", not "1".

Differential Revision: http://reviews.llvm.org/D13756

llvm-svn: 251597
2015-10-29 03:19:10 +00:00
..
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
AndOrXor.ll
apint-or.ll Merge or combine tests and convert to FileCheck. 2015-09-08 18:36:56 +00:00
assume.ll
bswap.ll Extend known bits to understand @llvm.bswap 2015-10-06 20:20:45 +00:00
call-callconv.ll
call.ll
compare.ll [InstSimplify] add nuw %x, C2 must be at least C2 2015-08-20 23:01:41 +00:00
dead-code-removal.ll
exact-nsw-nuw.ll
fast-math.ll
fdiv.ll
floating-point-arithmetic.ll
floating-point-compare.ll
fold-builtin-fma.ll
gep.ll
implies.ll [InstSimplify] sgt on i1s also encodes implication 2015-10-29 03:19:10 +00:00
load.ll
maxmin.ll
noalias-ptr.ll
past-the-end.ll
phi.ll
ptr_diff.ll
reassociate.ll
rem.ll
select.ll
shift-128-kb.ll Handle non-constant shifts in computeKnownBits, and use computeKnownBits for constant folding in InstCombine/Simplify 2015-10-23 20:37:08 +00:00
shr-nop.ll Fix CHECK directives that weren't checking. 2015-08-31 21:10:35 +00:00
undef.ll
vector_gep.ll
vector_ptr_bitcast.ll