X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FTransforms%2FScalar%2FFloat2Int.cpp;h=a9a4a24f8e933cf4d0c36721471ada25937de539;hb=cdbb6a49e2f29b3cb3354810a36d240f6a64a972;hp=a366851507820fdad7d01899b0b79c2fd5c46e3b;hpb=c36e746e9802fa1d5c36e6f98c8bc5cb440be59a;p=oota-llvm.git diff --git a/lib/Transforms/Scalar/Float2Int.cpp b/lib/Transforms/Scalar/Float2Int.cpp index a3668515078..a9a4a24f8e9 100644 --- a/lib/Transforms/Scalar/Float2Int.cpp +++ b/lib/Transforms/Scalar/Float2Int.cpp @@ -138,7 +138,7 @@ void Float2Int::findRoots(Function &F, SmallPtrSet &Roots) { Roots.insert(&I); break; case Instruction::FCmp: - if (mapFCmpPred(cast(&I)->getPredicate()) != + if (mapFCmpPred(cast(&I)->getPredicate()) != CmpInst::BAD_ICMP_PREDICATE) Roots.insert(&I); break; @@ -232,9 +232,9 @@ void Float2Int::walkBackwards(const SmallPtrSetImpl &Roots) { if (Instruction *OI = dyn_cast(O)) { // Unify def-use chains if they interfere. ECs.unionSets(I, OI); - if (SeenInsts.find(I)->second != badRange()) + if (SeenInsts.find(I)->second != badRange()) Worklist.push_back(OI); - } else if (!isa(O)) { + } else if (!isa(O)) { // Not an instruction or ConstantFP? we can't do anything. seen(I, badRange()); } @@ -304,7 +304,7 @@ void Float2Int::walkForwards() { for (Value *O : I->operands()) { if (Instruction *OI = dyn_cast(O)) { assert(SeenInsts.find(OI) != SeenInsts.end() && - "def not seen before use!"); + "def not seen before use!"); OpRanges.push_back(SeenInsts.find(OI)->second); } else if (ConstantFP *CF = dyn_cast(O)) { // Work out if the floating point number can be losslessly represented @@ -323,7 +323,7 @@ void Float2Int::walkForwards() { // we're in fast math mode. if (!F.isFinite() || (F.isZero() && F.isNegative() && isa(I) && - !I->hasNoSignedZeros())) { + !I->hasNoSignedZeros())) { seen(I, badRange()); Abort = true; break; @@ -350,7 +350,7 @@ void Float2Int::walkForwards() { // Reduce the operands' ranges to a single range and return. if (!Abort) - seen(I, Op(OpRanges)); + seen(I, Op(OpRanges)); } }