summaryrefslogtreecommitdiffstats
path: root/llvm/lib
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2008-07-10 00:29:28 +0000
committerChris Lattner <sabre@nondot.org>2008-07-10 00:29:28 +0000
commit67136cff7b4ca58ade2ff7be7bbc0f4b1a66e209 (patch)
tree661c6f5c80d18ae933a345b1c418888ea464ce62 /llvm/lib
parent97c661df7a063c4c5544118a851733a37a62e45e (diff)
downloadbcm5719-llvm-67136cff7b4ca58ade2ff7be7bbc0f4b1a66e209.tar.gz
bcm5719-llvm-67136cff7b4ca58ade2ff7be7bbc0f4b1a66e209.zip
Fix a case where vector comparison constant folding would cause an
infinite recursion. part of PR2529 llvm-svn: 53383
Diffstat (limited to 'llvm/lib')
-rw-r--r--llvm/lib/VMCore/ConstantFold.cpp66
1 files changed, 33 insertions, 33 deletions
diff --git a/llvm/lib/VMCore/ConstantFold.cpp b/llvm/lib/VMCore/ConstantFold.cpp
index 57b6a4e05d1..5167c12d49b 100644
--- a/llvm/lib/VMCore/ConstantFold.cpp
+++ b/llvm/lib/VMCore/ConstantFold.cpp
@@ -1348,43 +1348,43 @@ Constant *llvm::ConstantFoldCompareInstruction(unsigned short pred,
return ConstantInt::get(Type::Int1Ty, R==APFloat::cmpGreaterThan ||
R==APFloat::cmpEqual);
}
- } else if (const ConstantVector *CP1 = dyn_cast<ConstantVector>(C1)) {
- if (const ConstantVector *CP2 = dyn_cast<ConstantVector>(C2)) {
- // If we can constant fold the comparison of each element, constant fold
- // the whole vector comparison.
- SmallVector<Constant*, 4> Elts;
- const Type *InEltTy = CP1->getOperand(0)->getType();
- bool isFP = InEltTy->isFloatingPoint();
- const Type *ResEltTy = InEltTy;
+ } else if (isa<VectorType>(C1->getType())) {
+ SmallVector<Constant*, 16> C1Elts, C2Elts;
+ C1->getVectorElements(C1Elts);
+ C2->getVectorElements(C2Elts);
+
+ // If we can constant fold the comparison of each element, constant fold
+ // the whole vector comparison.
+ SmallVector<Constant*, 4> ResElts;
+ const Type *InEltTy = C1Elts[0]->getType();
+ bool isFP = InEltTy->isFloatingPoint();
+ const Type *ResEltTy = InEltTy;
+ if (isFP)
+ ResEltTy = IntegerType::get(InEltTy->getPrimitiveSizeInBits());
+
+ for (unsigned i = 0, e = C1Elts.size(); i != e; ++i) {
+ // Compare the elements, producing an i1 result or constant expr.
+ Constant *C;
if (isFP)
- ResEltTy = IntegerType::get(InEltTy->getPrimitiveSizeInBits());
-
- for (unsigned i = 0, e = CP1->getNumOperands(); i != e; ++i) {
- // Compare the elements, producing an i1 result or constant expr.
- Constant *C;
- if (isFP)
- C = ConstantExpr::getFCmp(pred, CP1->getOperand(i),
- CP2->getOperand(i));
- else
- C = ConstantExpr::getICmp(pred, CP1->getOperand(i),
- CP2->getOperand(i));
+ C = ConstantExpr::getFCmp(pred, C1Elts[i], C2Elts[i]);
+ else
+ C = ConstantExpr::getICmp(pred, C1Elts[i], C2Elts[i]);
- // If it is a bool or undef result, convert to the dest type.
- if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) {
- if (CI->isZero())
- Elts.push_back(Constant::getNullValue(ResEltTy));
- else
- Elts.push_back(Constant::getAllOnesValue(ResEltTy));
- } else if (isa<UndefValue>(C)) {
- Elts.push_back(UndefValue::get(ResEltTy));
- } else {
- break;
- }
+ // If it is a bool or undef result, convert to the dest type.
+ if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) {
+ if (CI->isZero())
+ ResElts.push_back(Constant::getNullValue(ResEltTy));
+ else
+ ResElts.push_back(Constant::getAllOnesValue(ResEltTy));
+ } else if (isa<UndefValue>(C)) {
+ ResElts.push_back(UndefValue::get(ResEltTy));
+ } else {
+ break;
}
-
- if (Elts.size() == CP1->getNumOperands())
- return ConstantVector::get(&Elts[0], Elts.size());
}
+
+ if (ResElts.size() == C1Elts.size())
+ return ConstantVector::get(&ResElts[0], ResElts.size());
}
if (C1->getType()->isFloatingPoint()) {
OpenPOWER on IntegriCloud