diff options
author | Chris Lattner <sabre@nondot.org> | 2006-01-05 07:49:30 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2006-01-05 07:49:30 +0000 |
commit | 2f690c84fa1682a2009423539af16d5f530006f9 (patch) | |
tree | 88e1bcf4be44a119501af3d98f0092df3f87de9b /lib/VMCore/ConstantFold.cpp | |
parent | 63540f5cf1d93ee6a44ba86bb012391be38dee83 (diff) | |
download | external_llvm-2f690c84fa1682a2009423539af16d5f530006f9.zip external_llvm-2f690c84fa1682a2009423539af16d5f530006f9.tar.gz external_llvm-2f690c84fa1682a2009423539af16d5f530006f9.tar.bz2 |
Implement a few symbolic constant folding things. X ? Y : Y is Y.
Fold:
seteq ({ short }* cast (int 1 to { short }*), { short }* null)
setlt ({ short }* cast (int 1 to { short }*), { short }* cast (int 2 to { short }*))
to false/true. These last two commonly occur in the output of compilers that
tag integers, like cozmic's scheme compiler.
Tested by Regression/Assembler/ConstantExprFold.llx
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@25112 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/VMCore/ConstantFold.cpp')
-rw-r--r-- | lib/VMCore/ConstantFold.cpp | 39 |
1 files changed, 32 insertions, 7 deletions
diff --git a/lib/VMCore/ConstantFold.cpp b/lib/VMCore/ConstantFold.cpp index 826b692..40a51cc 100644 --- a/lib/VMCore/ConstantFold.cpp +++ b/lib/VMCore/ConstantFold.cpp @@ -720,6 +720,7 @@ Constant *llvm::ConstantFoldSelectInstruction(const Constant *Cond, if (isa<UndefValue>(V1)) return const_cast<Constant*>(V2); if (isa<UndefValue>(V2)) return const_cast<Constant*>(V1); if (isa<UndefValue>(Cond)) return const_cast<Constant*>(V1); + if (V1 == V2) return const_cast<Constant*>(V1); return 0; } @@ -786,16 +787,27 @@ static int IdxCompare(Constant *C1, Constant *C2, const Type *ElTy) { /// constants (like ConstantInt) to be the simplest, followed by /// GlobalValues, followed by ConstantExpr's (the most complex). /// -static Instruction::BinaryOps evaluateRelation(const Constant *V1, - const Constant *V2) { +static Instruction::BinaryOps evaluateRelation(Constant *V1, Constant *V2) { assert(V1->getType() == V2->getType() && "Cannot compare different types of values!"); if (V1 == V2) return Instruction::SetEQ; if (!isa<ConstantExpr>(V1) && !isa<GlobalValue>(V1)) { + if (!isa<GlobalValue>(V2) && !isa<ConstantExpr>(V2)) { + // We distilled this down to a simple case, use the standard constant + // folder. + ConstantBool *R = dyn_cast<ConstantBool>(ConstantExpr::getSetEQ(V1, V2)); + if (R == ConstantBool::True) return Instruction::SetEQ; + R = dyn_cast<ConstantBool>(ConstantExpr::getSetLT(V1, V2)); + if (R == ConstantBool::True) return Instruction::SetLT; + R = dyn_cast<ConstantBool>(ConstantExpr::getSetGT(V1, V2)); + if (R == ConstantBool::True) return Instruction::SetGT; + + // If we couldn't figure it out, bail. + return Instruction::BinaryOpsEnd; + } + // If the first operand is simple, swap operands. - assert((isa<GlobalValue>(V2) || isa<ConstantExpr>(V2)) && - "Simple cases should have been handled by caller!"); Instruction::BinaryOps SwappedRelation = evaluateRelation(V2, V1); if (SwappedRelation != Instruction::BinaryOpsEnd) return SetCondInst::getSwappedCondition(SwappedRelation); @@ -826,7 +838,7 @@ static Instruction::BinaryOps evaluateRelation(const Constant *V1, } else { // Ok, the LHS is known to be a constantexpr. The RHS can be any of a // constantexpr, a CPR, or a simple constant. - const ConstantExpr *CE1 = cast<ConstantExpr>(V1); + ConstantExpr *CE1 = cast<ConstantExpr>(V1); Constant *CE1Op0 = CE1->getOperand(0); switch (CE1->getOpcode()) { @@ -834,9 +846,21 @@ static Instruction::BinaryOps evaluateRelation(const Constant *V1, // If the cast is not actually changing bits, and the second operand is a // null pointer, do the comparison with the pre-casted value. if (V2->isNullValue() && - CE1->getType()->isLosslesslyConvertibleTo(CE1Op0->getType())) + (isa<PointerType>(CE1->getType()) || CE1->getType()->isIntegral())) return evaluateRelation(CE1Op0, Constant::getNullValue(CE1Op0->getType())); + + // If the dest type is a pointer type, and the RHS is a constantexpr cast + // from the same type as the src of the LHS, evaluate the inputs. This is + // important for things like "seteq (cast 4 to int*), (cast 5 to int*)", + // which happens a lot in compilers with tagged integers. + if (ConstantExpr *CE2 = dyn_cast<ConstantExpr>(V2)) + if (isa<PointerType>(CE1->getType()) && + CE2->getOpcode() == Instruction::Cast && + CE1->getOperand(0)->getType() == CE2->getOperand(0)->getType() && + CE1->getOperand(0)->getType()->isIntegral()) { + return evaluateRelation(CE1->getOperand(0), CE2->getOperand(0)); + } break; case Instruction::GetElementPtr: @@ -977,7 +1001,8 @@ Constant *llvm::ConstantFoldBinaryInstruction(unsigned Opcode, if (SetCondInst::isRelational(Opcode)) { if (isa<UndefValue>(V1) || isa<UndefValue>(V2)) return UndefValue::get(Type::BoolTy); - switch (evaluateRelation(V1, V2)) { + switch (evaluateRelation(const_cast<Constant*>(V1), + const_cast<Constant*>(V2))) { default: assert(0 && "Unknown relational!"); case Instruction::BinaryOpsEnd: break; // Couldn't determine anything about these constants. |