fix long lines

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@36031 91177308-0d34-0410-b5e6-96231b3b80d8

6 files changed, 20 insertions, 18 deletions

diff --git a/lib/Transforms/Scalar/GCSE.cpp b/lib/Transforms/Scalar/GCSE.cpp
index 5ef6d97..f4727d4 100644
--- a/lib/Transforms/Scalar/GCSE.cpp
+++ b/lib/Transforms/Scalar/GCSE.cpp
@@ -73,7 +73,7 @@ bool GCSE::runOnFunction(Function &F) {
   // Check for value numbers of arguments.  If the value numbering
   // implementation can prove that an incoming argument is a constant or global
   // value address, substitute it, making the argument dead.
-  for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); AI != E; ++AI)
+  for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); AI != E;++AI)
     if (!AI->use_empty()) {
       VN.getEqualNumberNodes(AI, EqualValues);
       if (!EqualValues.empty()) {
diff --git a/lib/Transforms/Scalar/InstructionCombining.cpp b/lib/Transforms/Scalar/InstructionCombining.cpp
index c63ba68..eff1de7 100644
--- a/lib/Transforms/Scalar/InstructionCombining.cpp
+++ b/lib/Transforms/Scalar/InstructionCombining.cpp
@@ -5523,8 +5523,8 @@ Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
       }
     }
   } else {  // Not a ICMP_EQ/ICMP_NE
-            // If the LHS is a cast from an integral value of the same size, then 
-            // since we know the RHS is a constant, try to simlify.
+            // If the LHS is a cast from an integral value of the same size, 
+            // then since we know the RHS is a constant, try to simlify.
     if (CastInst *Cast = dyn_cast<CastInst>(LHSI)) {
       Value *CastOp = Cast->getOperand(0);
       const Type *SrcTy = CastOp->getType();
@@ -6231,7 +6231,7 @@ static bool CanEvaluateInDifferentType(Value *V, const IntegerType *Ty,
           MaskedValueIsZero(I->getOperand(0),
             APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth)) &&
           CI->getLimitedValue(BitWidth) < BitWidth) {
-        return CanEvaluateInDifferentType(I->getOperand(0), Ty, NumCastsRemoved);
+        return CanEvaluateInDifferentType(I->getOperand(0), Ty,NumCastsRemoved);
       }
     }
     break;
@@ -6645,7 +6645,7 @@ Instruction *InstCombiner::visitZExt(ZExtInst &CI) {
         Value *Sh = ConstantInt::get(In->getType(),
                                     In->getType()->getPrimitiveSizeInBits()-1);
         In = InsertNewInstBefore(BinaryOperator::createLShr(In, Sh,
-                                                        In->getName()+".lobit"), 
+                                                        In->getName()+".lobit"),
                                  CI);
         if (In->getType() != CI.getType())
           In = CastInst::createIntegerCast(In, CI.getType(),
@@ -6654,7 +6654,7 @@ Instruction *InstCombiner::visitZExt(ZExtInst &CI) {
         if (ICI->getPredicate() == ICmpInst::ICMP_SGT) {
           Constant *One = ConstantInt::get(In->getType(), 1);
           In = InsertNewInstBefore(BinaryOperator::createXor(In, One,
-                                                          In->getName()+".not"), 
+                                                          In->getName()+".not"),
                                    CI);
         }
 
@@ -6742,7 +6742,7 @@ Instruction *InstCombiner::visitSExt(SExtInst &CI) {
         Value *Sh = ConstantInt::get(In->getType(),
                                      In->getType()->getPrimitiveSizeInBits()-1);
         In = InsertNewInstBefore(BinaryOperator::createAShr(In, Sh,
-                                                        In->getName()+".lobit"), 
+                                                        In->getName()+".lobit"),
                                  CI);
         if (In->getType() != CI.getType())
           In = CastInst::createIntegerCast(In, CI.getType(),
@@ -7484,7 +7484,7 @@ Instruction *InstCombiner::visitCallInst(CallInst &CI) {
           for (unsigned i = 0; i != 16; ++i) {
             if (isa<UndefValue>(Mask->getOperand(i)))
               continue;
-            unsigned Idx =cast<ConstantInt>(Mask->getOperand(i))->getZExtValue();
+            unsigned Idx=cast<ConstantInt>(Mask->getOperand(i))->getZExtValue();
             Idx &= 31;  // Match the hardware behavior.
             
             if (ExtractedElts[Idx] == 0) {
@@ -9331,7 +9331,8 @@ Instruction *InstCombiner::visitInsertElementInst(InsertElementInst &IE) {
     if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
         EI->getOperand(0)->getType() == IE.getType()) {
       unsigned NumVectorElts = IE.getType()->getNumElements();
-      unsigned ExtractedIdx=cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
+      unsigned ExtractedIdx =
+        cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
       unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
       
       if (ExtractedIdx >= NumVectorElts) // Out of range extract.
diff --git a/lib/Transforms/Scalar/LICM.cpp b/lib/Transforms/Scalar/LICM.cpp
index 482ac77..1d7bde5 100644
--- a/lib/Transforms/Scalar/LICM.cpp
+++ b/lib/Transforms/Scalar/LICM.cpp
@@ -240,7 +240,7 @@ bool LICM::runOnLoop(Loop *L, LPPassManager &LPM) {
   for (std::vector<BasicBlock*>::const_iterator I = L->getBlocks().begin(),
          E = L->getBlocks().end(); I != E; ++I)
     if (LI->getLoopFor(*I) == L)        // Ignore blocks in subloops...
-      CurAST->add(**I);                     // Incorporate the specified basic block
+      CurAST->add(**I);                 // Incorporate the specified basic block
 
   // We want to visit all of the instructions in this loop... that are not parts
   // of our subloops (they have already had their invariants hoisted out of
diff --git a/lib/Transforms/Scalar/LoopRotation.cpp b/lib/Transforms/Scalar/LoopRotation.cpp
index 783056d..b9db3f6 100644
--- a/lib/Transforms/Scalar/LoopRotation.cpp
+++ b/lib/Transforms/Scalar/LoopRotation.cpp
@@ -315,7 +315,7 @@ bool LoopRotate::rotateLoop(Loop *Lp, LPPassManager &LPM) {
       // Used inside Exit Block. Since we are in LCSSA form, U must be PHINode.
       assert (U->getParent() == Exit 
               && "Need to propagate new PHI into Exit blocks");
-      assert (isa<PHINode>(U) && "Use in Exit Block that is not PHINode");        
+      assert (isa<PHINode>(U) && "Use in Exit Block that is not PHINode");
 
       PHINode *UPhi = cast<PHINode>(U);
 
@@ -372,7 +372,7 @@ void LoopRotate::updateExitBlock() {
     Value *V = PN->getIncomingValueForBlock(OrigHeader);
     if (isa<Instruction>(V) && 
         (ILoopHeaderInfo = findReplacementData(cast<Instruction>(V)))) {
-      assert (ILoopHeaderInfo->PreHeader && "Missing New Preheader Instruction");
+      assert(ILoopHeaderInfo->PreHeader && "Missing New Preheader Instruction");
       PN->addIncoming(ILoopHeaderInfo->PreHeader, OrigPreHeader);
     } else {
       PN->addIncoming(V, OrigPreHeader);
diff --git a/lib/Transforms/Scalar/PredicateSimplifier.cpp b/lib/Transforms/Scalar/PredicateSimplifier.cpp
index bd60a9b..175ddef 100644
--- a/lib/Transforms/Scalar/PredicateSimplifier.cpp
+++ b/lib/Transforms/Scalar/PredicateSimplifier.cpp
@@ -339,7 +339,7 @@ namespace {
             for (iterator B = begin(); I->To == n; --I) {
               if (I->Subtree->DominatedBy(Subtree)) {
                 LatticeVal LV = static_cast<LatticeVal>(I->LV & R);
-                assert(validPredicate(LV) && "Invalid union of lattice values.");
+                assert(validPredicate(LV) && "Invalid union of lattice values");
                 I->LV = LV;
               }
               if (I == B) break;
@@ -2119,7 +2119,8 @@ namespace {
 
     TargetData *TD = &getAnalysis<TargetData>();
 
-    Forest->updateDFSNumbers(); // XXX: should only act when numbers are out of date
+    // XXX: should only act when numbers are out of date
+    Forest->updateDFSNumbers();
 
     DOUT << "Entering Function: " << F.getName() << "\n";
 
diff --git a/lib/Transforms/Scalar/SCCP.cpp b/lib/Transforms/Scalar/SCCP.cpp
index cdcdcc6..16e7a8e 100644
--- a/lib/Transforms/Scalar/SCCP.cpp
+++ b/lib/Transforms/Scalar/SCCP.cpp
@@ -925,9 +925,9 @@ void SCCPSolver::visitInsertElementInst(InsertElementInst &I) {
                                                     IdxState.getConstant()));
   else if (ValState.isUndefined() && EltState.isConstant() &&
            IdxState.isConstant()) 
-    markConstant(&I, ConstantExpr::getInsertElement(UndefValue::get(I.getType()),
-                                                    EltState.getConstant(),
-                                                    IdxState.getConstant()));
+    markConstant(&I,ConstantExpr::getInsertElement(UndefValue::get(I.getType()),
+                                                   EltState.getConstant(),
+                                                   IdxState.getConstant()));
 #endif
 }
 
@@ -1365,7 +1365,7 @@ bool SCCP::runOnFunction(Function &F) {
   Solver.MarkBlockExecutable(F.begin());
 
   // Mark all arguments to the function as being overdefined.
-  for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); AI != E; ++AI)
+  for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); AI != E;++AI)
     Solver.markOverdefined(AI);
 
   // Solve for constants.