David Majnemer 54056f1760 ValueTracking: Figure out more bits when looking at add/sub ...

Given something like X01XX + X01XX, we know that the result must look
like X1XXX.

Adapted from a patch by Richard Smith, test-case written by me.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@216250 91177308-0d34-0410-b5e6-96231b3b80d8

2014-08-22 00:40:43 +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

InstSimplify: Simplify (X - (0 - Y)) if the second sub is NUW

2014-07-31 04:49:18 +00:00

apint-or.ll

Move optimization of some cases of (A & C1)|(B & C2) from instcombine to instsimplify. Patch by Rahul Jain, plus some last minute changes by me -- you can blame me for any bugs.

2014-06-19 03:51:46 +00:00

ashr-nop.ll

Move ashr optimization from InstCombineShift to InstSimplify.

2014-07-17 06:28:15 +00:00

assume.ll

Add @llvm.assume, lowering, and some basic properties

2014-07-25 21:13:35 +00:00

call-callconv.ll

…

call.ll

…

compare.ll

ValueTracking: Figure out more bits when looking at add/sub

2014-08-22 00:40:43 +00:00

dead-code-removal.ll

RecursivelyDeleteTriviallyDeadInstructions() could remove

2014-04-26 05:58:11 +00:00

exact-nsw-nuw.ll

…

fast-math.ll

…

fdiv.ll

…

floating-point-arithmetic.ll

…

maxmin.ll

…

past-the-end.ll

…

phi.ll

…

ptr_diff.ll

…

reassociate.ll

…

rem.ll

…

undef.ll

…

vector_gep.ll

…