aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorBill Wendling <isanbard@gmail.com>2009-01-04 06:19:11 +0000
committerBill Wendling <isanbard@gmail.com>2009-01-04 06:19:11 +0000
commitd3d69781d31641faa3dd44a9c40ada1ad57dc873 (patch)
treeca10066292aad65042fbd686e253ee80886c1aae
parent2c8a1522dbe6f14b728e83b9c555bef27233cc91 (diff)
downloadexternal_llvm-d3d69781d31641faa3dd44a9c40ada1ad57dc873.zip
external_llvm-d3d69781d31641faa3dd44a9c40ada1ad57dc873.tar.gz
external_llvm-d3d69781d31641faa3dd44a9c40ada1ad57dc873.tar.bz2
Revert this transform. It was causing some dramatic slowdowns in a few tests. See PR3266.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@61623 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r--lib/Transforms/Scalar/InstructionCombining.cpp31
1 files changed, 0 insertions, 31 deletions
diff --git a/lib/Transforms/Scalar/InstructionCombining.cpp b/lib/Transforms/Scalar/InstructionCombining.cpp
index 39c48c3..b1474cc 100644
--- a/lib/Transforms/Scalar/InstructionCombining.cpp
+++ b/lib/Transforms/Scalar/InstructionCombining.cpp
@@ -4880,37 +4880,6 @@ Instruction *InstCombiner::visitXor(BinaryOperator &I) {
if (FCmpInst *FCI = dyn_cast<FCmpInst>(Op0))
return new FCmpInst(FCI->getInversePredicate(),
FCI->getOperand(0), FCI->getOperand(1));
-
- // xor (or (cmp x,m),(cmp y,n)),true --> and (!cmp x,m),(!cmp y,n)
- //
- // Proof:
- // Let A = (cmp x,m)
- // Let B = (cmp y,n)
- // Let C = (or A, B)
- // C true implies that either A, B, or both are true.
- //
- // (xor C, true) is true only if C is false. We can then apply de
- // Morgan's law. QED.
- BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0);
- if (Op0I) {
- Value *A, *B;
- if (match(Op0I, m_Or(m_Value(A), m_Value(B)))) {
- ICmpInst *AOp = dyn_cast<ICmpInst>(A);
- ICmpInst *BOp = dyn_cast<ICmpInst>(B);
-
- if (AOp && BOp) {
- ICmpInst *NewA = new ICmpInst(AOp->getInversePredicate(),
- AOp->getOperand(0),
- AOp->getOperand(1));
- InsertNewInstBefore(NewA, I);
- ICmpInst *NewB = new ICmpInst(BOp->getInversePredicate(),
- BOp->getOperand(0),
- BOp->getOperand(1));
- InsertNewInstBefore(NewB, I);
- return BinaryOperator::CreateAnd(NewA, NewB);
- }
- }
- }
}
// fold (xor(zext(cmp)), 1) and (xor(sext(cmp)), -1) to ext(!cmp).