From: Chris Lattner Date: Wed, 4 Jan 2006 02:20:54 +0000 (+0000) Subject: implement constant folding of ==/!= on constant packed, simplify some code. X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=84e1064f4584c20b839b9172c5c26c20b6ffb2fe;p=oota-llvm.git implement constant folding of ==/!= on constant packed, simplify some code. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@25074 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/lib/VMCore/ConstantFold.cpp b/lib/VMCore/ConstantFold.cpp index e6a27155b44..4ac5292190c 100644 --- a/lib/VMCore/ConstantFold.cpp +++ b/lib/VMCore/ConstantFold.cpp @@ -385,6 +385,14 @@ struct ConstantPackedRules return 0; } static Constant *EqualTo(const ConstantPacked *V1, const ConstantPacked *V2) { + for (unsigned i = 0, e = V1->getNumOperands(); i != e; ++i) { + Constant *C = + ConstantExpr::getSetEQ(const_cast(V1->getOperand(i)), + const_cast(V2->getOperand(i))); + if (ConstantBool *CB = dyn_cast(C)) + return CB; + } + // Otherwise, could not decide from any element pairs. return 0; } }; @@ -951,15 +959,15 @@ Constant *llvm::ConstantFoldBinaryInstruction(unsigned Opcode, case Instruction::SetGT: C = ConstRules::get(V1, V2).lessthan(V2, V1);break; case Instruction::SetNE: // V1 != V2 === !(V1 == V2) C = ConstRules::get(V1, V2).equalto(V1, V2); - if (C) return ConstantExpr::get(Instruction::Xor, C, ConstantBool::True); + if (C) return ConstantExpr::getNot(C); break; case Instruction::SetLE: // V1 <= V2 === !(V2 < V1) C = ConstRules::get(V1, V2).lessthan(V2, V1); - if (C) return ConstantExpr::get(Instruction::Xor, C, ConstantBool::True); + if (C) return ConstantExpr::getNot(C); break; case Instruction::SetGE: // V1 >= V2 === !(V1 < V2) C = ConstRules::get(V1, V2).lessthan(V1, V2); - if (C) return ConstantExpr::get(Instruction::Xor, C, ConstantBool::True); + if (C) return ConstantExpr::getNot(C); break; }