[llvm-commits] [llvm] r169194 - /llvm/trunk/lib/Transforms/Vectorize/LoopVectorize.cpp

[NAKAMURA Takumi]

Author: chapuni
Date: Mon Dec  3 18:49:28 2012
New Revision: 169194

URL: http://llvm.org/viewvc/llvm-project?rev=169194&view=rev
Log:
Fix whitespace.

Modified:
    llvm/trunk/lib/Transforms/Vectorize/LoopVectorize.cpp

Modified: llvm/trunk/lib/Transforms/Vectorize/LoopVectorize.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/Vectorize/LoopVectorize.cpp?rev=169194&r1=169193&r2=169194&view=diff
==============================================================================
--- llvm/trunk/lib/Transforms/Vectorize/LoopVectorize.cpp (original)
+++ llvm/trunk/lib/Transforms/Vectorize/LoopVectorize.cpp Mon Dec  3 18:49:28 2012
@@ -1091,7 +1091,7 @@
           // After broadcasting the induction variable we need to make the
           // vector consecutive by adding 0, 1, 2 ...
           Value *ConsecutiveInduction = getConsecutiveVector(Broadcasted);
-           
+
           WidenMap[OldInduction] = ConsecutiveInduction;
           continue;
         }
@@ -2067,7 +2067,7 @@
        be = TheLoop->block_end(); bb != be; ++bb) {
     unsigned BlockCost = 0;
     BasicBlock *BB = *bb;
-    
+
     // For each instruction in the old loop.
     for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; ++it) {
 
@@ -2081,7 +2081,7 @@
     // calculate the loop nest level and multiply the cost accordingly.
     if (Legal->blockNeedsPredication(*bb))
       BlockCost *= 2;
-    
+
     Cost += BlockCost;
   }
 
@@ -2265,4 +2265,3 @@
     return new LoopVectorize();
   }
 }
-