summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/ValueTracking.cpp
diff options
context:
space:
mode:
authorCraig Topper <craig.topper@intel.com>2017-08-08 16:29:35 +0000
committerCraig Topper <craig.topper@intel.com>2017-08-08 16:29:35 +0000
commitb498a23f0e757e50e504b5b9591e69e605f4fc12 (patch)
tree017d7f34206b5d285afc56086f9a38f0f64aadfe /llvm/lib/Analysis/ValueTracking.cpp
parent5a497136be8397ae18c5a83da064fb6b4f682aa3 (diff)
downloadbcm5719-llvm-b498a23f0e757e50e504b5b9591e69e605f4fc12.tar.gz
bcm5719-llvm-b498a23f0e757e50e504b5b9591e69e605f4fc12.zip
[KnownBits][ValueTracking] Move the math for calculating known bits for add/sub into a static method in KnownBits object
I want to reuse this code in SimplifyDemandedBits handling of Add/Sub. This will make that easier. Wonder if we should use it in SelectionDAG's computeKnownBits too. Differential Revision: https://reviews.llvm.org/D36433 llvm-svn: 310378
Diffstat (limited to 'llvm/lib/Analysis/ValueTracking.cpp')
-rw-r--r--llvm/lib/Analysis/ValueTracking.cpp42
1 files changed, 1 insertions, 41 deletions
diff --git a/llvm/lib/Analysis/ValueTracking.cpp b/llvm/lib/Analysis/ValueTracking.cpp
index 34568713a05..5372d9dc7c2 100644
--- a/llvm/lib/Analysis/ValueTracking.cpp
+++ b/llvm/lib/Analysis/ValueTracking.cpp
@@ -275,47 +275,7 @@ static void computeKnownBitsAddSub(bool Add, const Value *Op0, const Value *Op1,
computeKnownBits(Op0, LHSKnown, Depth + 1, Q);
computeKnownBits(Op1, Known2, Depth + 1, Q);
- // Carry in a 1 for a subtract, rather than a 0.
- uint64_t CarryIn = 0;
- if (!Add) {
- // Sum = LHS + ~RHS + 1
- std::swap(Known2.Zero, Known2.One);
- CarryIn = 1;
- }
-
- APInt PossibleSumZero = ~LHSKnown.Zero + ~Known2.Zero + CarryIn;
- APInt PossibleSumOne = LHSKnown.One + Known2.One + CarryIn;
-
- // Compute known bits of the carry.
- APInt CarryKnownZero = ~(PossibleSumZero ^ LHSKnown.Zero ^ Known2.Zero);
- APInt CarryKnownOne = PossibleSumOne ^ LHSKnown.One ^ Known2.One;
-
- // Compute set of known bits (where all three relevant bits are known).
- APInt LHSKnownUnion = LHSKnown.Zero | LHSKnown.One;
- APInt RHSKnownUnion = Known2.Zero | Known2.One;
- APInt CarryKnownUnion = CarryKnownZero | CarryKnownOne;
- APInt Known = LHSKnownUnion & RHSKnownUnion & CarryKnownUnion;
-
- assert((PossibleSumZero & Known) == (PossibleSumOne & Known) &&
- "known bits of sum differ");
-
- // Compute known bits of the result.
- KnownOut.Zero = ~PossibleSumOne & Known;
- KnownOut.One = PossibleSumOne & Known;
-
- // Are we still trying to solve for the sign bit?
- if (!Known.isSignBitSet()) {
- if (NSW) {
- // Adding two non-negative numbers, or subtracting a negative number from
- // a non-negative one, can't wrap into negative.
- if (LHSKnown.isNonNegative() && Known2.isNonNegative())
- KnownOut.makeNonNegative();
- // Adding two negative numbers, or subtracting a non-negative number from
- // a negative one, can't wrap into non-negative.
- else if (LHSKnown.isNegative() && Known2.isNegative())
- KnownOut.makeNegative();
- }
- }
+ KnownOut = KnownBits::computeForAddSub(Add, NSW, LHSKnown, Known2);
}
static void computeKnownBitsMul(const Value *Op0, const Value *Op1, bool NSW,
OpenPOWER on IntegriCloud