[llvm-commits] [llvm] r149857 - /llvm/trunk/lib/Transforms/Vectorize/BBVectorize.cpp

[Sebastian Pop]

Author: spop
Date: Sun Feb  5 23:29:32 2012
New Revision: 149857

URL: http://llvm.org/viewvc/llvm-project?rev=149857&view=rev
Log:
fix indentation

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

Modified: llvm/trunk/lib/Transforms/Vectorize/BBVectorize.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/Vectorize/BBVectorize.cpp?rev=149857&r1=149856&r2=149857&view=diff
==============================================================================
--- llvm/trunk/lib/Transforms/Vectorize/BBVectorize.cpp (original)
+++ llvm/trunk/lib/Transforms/Vectorize/BBVectorize.cpp Sun Feb  5 23:29:32 2012
@@ -194,7 +194,7 @@
                       AliasSetTracker &WriteSet, Instruction *I,
                       Instruction *J, bool UpdateUsers = true,
                       std::multimap<Value *, Value *> *LoadMoveSet = 0);
-  
+
     void computePairsConnectedTo(
                       std::multimap<Value *, Value *> &CandidatePairs,
                       std::vector<Value *> &PairableInsts,
@@ -628,10 +628,10 @@
           // An aligned load or store is possible only if the instruction
           // with the lower offset has an alignment suitable for the
           // vector type.
-  
+
           unsigned BottomAlignment = IAlignment;
           if (OffsetInElmts < 0) BottomAlignment = JAlignment;
-  
+
           Type *VType = getVecTypeForPair(aType);
           unsigned VecAlignment = TD->getPrefTypeAlignment(VType);
           if (BottomAlignment < VecAlignment)
@@ -1152,11 +1152,11 @@
         }
         if (!CanAdd) continue;
 
-	// To check for non-trivial cycles formed by the addition of the
-	// current pair we've formed a list of all relevant pairs, now use a
-	// graph walk to check for a cycle. We start from the current pair and
-	// walk the use tree to see if we again reach the current pair. If we
-	// do, then the current pair is rejected.
+        // To check for non-trivial cycles formed by the addition of the
+        // current pair we've formed a list of all relevant pairs, now use a
+        // graph walk to check for a cycle. We start from the current pair and
+        // walk the use tree to see if we again reach the current pair. If we
+        // do, then the current pair is rejected.
 
         // FIXME: It may be more efficient to use a topological-ordering
         // algorithm to improve the cycle check. This should be investigated.
@@ -1468,7 +1468,7 @@
       if (LEE->getOperand(0) == HEE->getOperand(0)) {
         if (LowIndx == 0 && HighIndx == 1)
           return LEE->getOperand(0);
- 
+
         std::vector<Constant*> Mask(2);
         Mask[0] = ConstantInt::get(Type::getInt32Ty(Context), LowIndx);
         Mask[1] = ConstantInt::get(Type::getInt32Ty(Context), HighIndx);