From 36422d887672dc9a21d9add99c675bdc9e4807dd Mon Sep 17 00:00:00 2001
From: NAKAMURA Takumi <geek4civic@gmail.com>
Date: Tue, 4 Dec 2012 00:49:28 +0000
Subject: Fix whitespace.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@169194 91177308-0d34-0410-b5e6-96231b3b80d8
---
 lib/Transforms/Vectorize/LoopVectorize.cpp | 7 +++----
 1 file changed, 3 insertions(+), 4 deletions(-)

diff --git a/lib/Transforms/Vectorize/LoopVectorize.cpp b/lib/Transforms/Vectorize/LoopVectorize.cpp
index 4dfe906..b720c97 100644
--- a/lib/Transforms/Vectorize/LoopVectorize.cpp
+++ b/lib/Transforms/Vectorize/LoopVectorize.cpp
@@ -1091,7 +1091,7 @@ InnerLoopVectorizer::vectorizeLoop(LoopVectorizationLegality *Legal) {
           // 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 @@ unsigned LoopVectorizationCostModel::expectedCost(unsigned VF) {
        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 @@ unsigned LoopVectorizationCostModel::expectedCost(unsigned VF) {
     // calculate the loop nest level and multiply the cost accordingly.
     if (Legal->blockNeedsPredication(*bb))
       BlockCost *= 2;
-    
+
     Cost += BlockCost;
   }
 
@@ -2265,4 +2265,3 @@ namespace llvm {
     return new LoopVectorize();
   }
 }
-
-- 
cgit v1.1