commit 0a7d0ad95fc1162f8266a48b88e223e24dcd4a90
author NAKAMURA Takumi <geek4civic@gmail.com> Tue Sep 22 11:15:07 2015 +0000
committer NAKAMURA Takumi <geek4civic@gmail.com> Tue Sep 22 11:15:07 2015 +0000
tree 0c855160dad1cae23ca578887359ea9924aafcdc
parent a9cb538a74b511aa56e4237dbdfca57e8dcc57cc

Untabify.

llvm-svn: 248264

llvm/lib/Transforms/Scalar/Float2Int.cpp

diff --git a/llvm/lib/Transforms/Scalar/Float2Int.cpp b/llvm/lib/Transforms/Scalar/Float2Int.cpp
index a366851..35bff06 100644
--- a/llvm/lib/Transforms/Scalar/Float2Int.cpp
+++ b/llvm/lib/Transforms/Scalar/Float2Int.cpp
@@ -232,7 +232,7 @@
       if (Instruction *OI = dyn_cast<Instruction>(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<ConstantFP>(O)) {      
         // Not an instruction or ConstantFP? we can't do anything.
@@ -304,7 +304,7 @@
     for (Value *O : I->operands()) {
       if (Instruction *OI = dyn_cast<Instruction>(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<ConstantFP>(O)) {
         // Work out if the floating point number can be losslessly represented
@@ -323,7 +323,7 @@
         // we're in fast math mode.
         if (!F.isFinite() ||
             (F.isZero() && F.isNegative() && isa<FPMathOperator>(I) &&
-	     !I->hasNoSignedZeros())) {
+             !I->hasNoSignedZeros())) {
           seen(I, badRange());
           Abort = true;
           break;