Sanjay Patel 3e2b1fd515 [InstSimplify] fold sdiv/srem based on compare of dividend and divisor ...

This should bring signed div/rem analysis up to the same level as unsigned. 
We use icmp simplification to determine when the divisor is known greater than the dividend.

Each positive test is followed by a negative test to show that we're not overstepping the boundaries of the known bits.
There are extra tests for the signed-min-value special cases.

Alive proofs:
http://rise4fun.com/Alive/WI5

Differential Revision: https://reviews.llvm.org/D37713

llvm-svn: 313264

2017-09-14 14:59:07 +00:00

..

2010-12-20-Boolean.ll

[InstSimplify] regenerate checks using a script

2016-03-25 20:12:25 +00:00

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

Revert @llvm.assume with operator bundles (r289755-r289757)

2016-12-19 08:22:17 +00:00

addsub.ll

[InstSimplify] Add test cases for mixing add/sub i1 with xor of i1. Seems we can simplify in one direction but not the other.

2017-04-06 05:48:06 +00:00

and-icmps-same-ops.ll

[InstSimplify] fixed (?) to not mutate icmps

2016-12-06 22:09:52 +00:00

AndOrXor.ll

[InstSimplify] Make m_Not work for xor -1, X

2017-05-18 20:27:32 +00:00

assume.ll

[ValueTracking] emit a remark when we detect a conflicting assumption (PR31809)

2017-02-06 18:26:06 +00:00

bitcast-vector-fold.ll

[ConstantFold] Improve the bitcast folding logic for constant vectors.

2016-09-13 14:50:47 +00:00

bitreverse.ll

[ValueTracking] Extend known bits to understand @llvm.bitreverse.

2017-01-17 17:23:51 +00:00

bswap.ll

[InstSimplify] regenerate checks using a script

2016-03-25 20:12:25 +00:00

call-callconv.ll

…

call.ll

InstSimplify: canonicalize is idempotent

2017-09-07 01:21:43 +00:00

cast.ll

[InstSimplify] Fold gep (gep V, C), (xor V, -1) to C-1

2016-08-16 06:13:46 +00:00

compare.ll

[InstCombine] remove unnecessary vector select fold; NFCI

2017-08-30 14:04:57 +00:00

dead-code-removal.ll

…

div.ll

[InstSimplify] fix some test names; NFC

2017-09-11 20:38:31 +00:00

exact-nsw-nuw.ll

[InstSimplify] fold sdiv/srem based on compare of dividend and divisor

2017-09-14 14:59:07 +00:00

fast-math.ll

[InstSimplify] regenerate checks using a script

2016-03-25 20:12:25 +00:00

fdiv.ll

[InstSimplify] add constant folding for fdiv/frem

2017-04-01 19:05:11 +00:00

floating-point-arithmetic.ll

[ValueTracking] Implement SignBitMustBeZero correctly for sqrt.

2017-01-26 00:10:26 +00:00

floating-point-compare.ll

[InstSimplify] regenerate checks; NFC

2017-09-02 14:38:15 +00:00

fold-builtin-fma.ll

…

gep.ll

…

icmp-bool-constant.ll

[InstSimplify] handle all icmp i1 X, C in one place; NFCI

2017-05-17 20:27:55 +00:00

icmp-constant.ll

[InstSimplify] try to eliminate icmp Pred (add nsw X, C1), C2

2017-01-24 17:03:24 +00:00

icmp-ranges.ll

[InstSimplify] use ConstantRange to simplify or-of-icmps

2017-05-07 15:11:40 +00:00

implies.ll

[ValueTracking] Correct lit test comments. NFC.

2016-04-18 19:11:45 +00:00

load-relative-32.ll

Introduce llvm.load.relative intrinsic.

2016-04-22 21:18:02 +00:00

load-relative.ll

Introduce llvm.load.relative intrinsic.

2016-04-22 21:18:02 +00:00

load.ll

[ConstantFolding] Extend FoldReinterpretLoadFromConstPtr to handle negative offsets

2016-07-13 23:33:07 +00:00

maxmin.ll

[InstSimplify] regenerate checks using a script

2016-03-25 20:12:25 +00:00

mul.ll

[InstSimplify] Teach SimplifyMulInst to recognize vectors of i1 as And. Not just scalar i1.

2017-04-06 17:33:37 +00:00

negate.ll

[InstSimplify] fold negation of sign-bit

2016-10-19 21:23:45 +00:00

noalias-ptr.ll

…

or-icmps-same-ops.ll

[InstSimplify] fixed (?) to not mutate icmps

2016-12-06 22:09:52 +00:00

or.ll

[InstSimplify] Use m_APInt instead of m_ConstantInt in ((V + N) & C1) | (V & C2) handling in order to support splat vectors.

2017-05-26 19:03:53 +00:00

past-the-end.ll

[InstSimplify] regenerate checks using a script

2016-03-25 20:12:25 +00:00

phi.ll

[InstSimplify] regenerate checks using a script

2016-03-25 20:12:25 +00:00

pr28725.ll

[ConstantFolding] Use ConstantExpr::getWithOperands

2016-07-29 03:27:31 +00:00

pr33957.ll

[ConstantFolder] Don't try to fold gep when the idx is a vector.

2017-07-27 22:20:44 +00:00

ptr_diff.ll

[InstSimplify] regenerate checks using a script

2016-03-25 20:12:25 +00:00

reassociate.ll

[InstSimplify] regenerate checks using a script

2016-03-25 20:12:25 +00:00

rem.ll

[InstSimplify] fix some test names; NFC

2017-09-11 20:38:31 +00:00

require-dominator.ll

Add unittest for r280760

2016-09-08 16:53:40 +00:00

returned.ll

Pointer-comparison folding should look through returned-argument functions

2016-07-11 03:37:59 +00:00

select.ll

[InstCombine] remove unnecessary vector select fold; NFCI

2017-08-30 14:04:57 +00:00

shift-128-kb.ll

[InstSimplify] regenerate checks using a script

2016-03-25 20:12:25 +00:00

shift-knownbits.ll

[InstCombine / InstSimplify] add and move tests for lshr transforms; NFC

2017-01-13 22:54:12 +00:00

shr-nop.ll

[ValueTracking] improve ComputeNumSignBits for vector constants

2016-06-22 19:20:59 +00:00

shufflevector.ll

InstructionSimplify: Relanding r301766

2017-05-07 18:16:37 +00:00

signed-div-rem.ll

[InstSimplify] fold sdiv/srem based on compare of dividend and divisor

2017-09-14 14:59:07 +00:00

simplify-nested-bitcast.ll

[InstSimplify] Constant fold the new GEP in SimplifyGEPInst.

2017-06-06 10:17:14 +00:00

undef.ll

[InstCombine] replace divide-by-constant checks with asserts; NFC

2016-08-30 17:31:34 +00:00

vec-cmp.ll

[ValueTracking, InstSimplify] extend isKnownNonZero() to handle vector constants

2016-05-24 14:18:49 +00:00

vector_gep.ll

[InstSimplify] Constant fold the new GEP in SimplifyGEPInst.

2017-06-06 10:17:14 +00:00

vector_ptr_bitcast.ll

…