wrap some long lines. Major offenders that are left include

gvn, gvnpre, dse, and predsimplify.  To see these, use:

  make check-line-length

llvm-svn: 40738

lib/Transforms/Scalar/CodeGenPrepare.cpp

@@ -396,8 +396,8 @@ static bool OptimizeNoopCopyExpression(CastInst *CI, const TargetLowering &TLI){
 
 /// OptimizeCmpExpression - sink the given CmpInst into user blocks to reduce 
 /// the number of virtual registers that must be created and coalesced.  This is
-/// a clear win except on targets with multiple condition code registers (powerPC),
-/// where it might lose; some adjustment may be wanted there.
+/// a clear win except on targets with multiple condition code registers
+///  (PowerPC), where it might lose; some adjustment may be wanted there.
 ///
 /// Return true if any changes are made.
 static bool OptimizeCmpExpression(CmpInst *CI){

lib/Transforms/Scalar/InstructionCombining.cpp

@@ -7988,7 +7988,8 @@ bool InstCombiner::transformConstExprCastCall(CallSite CS) {
                         &Args[0], Args.size(), Caller->getName(), Caller);
     cast<InvokeInst>(NC)->setCallingConv(II->getCallingConv());
   } else {
-    NC = new CallInst(Callee, Args.begin(), Args.end(), Caller->getName(), Caller);
+    NC = new CallInst(Callee, Args.begin(), Args.end(),
+                      Caller->getName(), Caller);
     if (cast<CallInst>(Caller)->isTailCall())
       cast<CallInst>(NC)->setTailCall();
    cast<CallInst>(NC)->setCallingConv(cast<CallInst>(Caller)->getCallingConv());

lib/Transforms/Scalar/LoopStrengthReduce.cpp

@@ -651,9 +651,10 @@ void BasedUser::RewriteInstructionToUseNewBase(const SCEVHandle &NewBase,
         Instruction *InsertPt = PN->getIncomingBlock(i)->getTerminator();
         Code = InsertCodeForBaseAtPosition(NewBase, Rewriter, InsertPt, L);
 
-        // Adjust the type back to match the PHI. Note that we can't use InsertPt
-        // here because the SCEVExpander may have inserted its instructions after
-        // that point, in its efforts to avoid inserting redundant expressions.
+        // Adjust the type back to match the PHI. Note that we can't use
+        // InsertPt here because the SCEVExpander may have inserted its
+        // instructions after that point, in its efforts to avoid inserting
+        // redundant expressions.
         if (isa<PointerType>(PN->getType())) {
           Code = SCEVExpander::InsertCastOfTo(Instruction::IntToPtr,
                                               Code,

lib/Transforms/Scalar/LoopUnroll.cpp

@@ -41,7 +41,7 @@
 using namespace llvm;
 
 STATISTIC(NumCompletelyUnrolled, "Number of loops completely unrolled");
-STATISTIC(NumUnrolled,           "Number of loops unrolled (completely or otherwise)");
+STATISTIC(NumUnrolled,    "Number of loops unrolled (completely or otherwise)");
 
 namespace {
   cl::opt<unsigned>

lib/Transforms/Scalar/LoopUnswitch.cpp

@@ -425,7 +425,8 @@ static inline void RemapInstruction(Instruction *I,
   }
 }
 
-// CloneDomInfo - NewBB is cloned from Orig basic block. Now clone Dominator Info.
+// CloneDomInfo - NewBB is cloned from Orig basic block. Now clone Dominator
+// Info.
 //
 // If Orig block's immediate dominator is mapped in VM then use corresponding
 // immediate dominator from the map. Otherwise Orig block's dominator is also
@@ -1113,7 +1114,8 @@ void LoopUnswitch::SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L) {
     switch (I->getOpcode()) {
     case Instruction::Select:
       if (ConstantInt *CB = dyn_cast<ConstantInt>(I->getOperand(0))) {
-        ReplaceUsesOfWith(I, I->getOperand(!CB->getZExtValue()+1), Worklist, L, LPM);
+        ReplaceUsesOfWith(I, I->getOperand(!CB->getZExtValue()+1), Worklist, L,
+                          LPM);
         continue;
       }
       break;

lib/Transforms/Scalar/RedundantLoadElimination.cpp

@@ -66,7 +66,8 @@ bool RLE::runOnBasicBlock(BasicBlock &BB) {
   bool MadeChange = false;
   
   // Do a top-down walk on the BB
-  for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ++BBI) {
+  for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); 
+       BBI != BBE; ++BBI) {
     // If we find a store or a free...
     if (LoadInst* L = dyn_cast<LoadInst>(BBI)) {
       // We can't delete volatile loads

lib/Transforms/Scalar/ScalarReplAggregates.cpp

@@ -50,7 +50,7 @@ namespace {
     static char ID; // Pass identification, replacement for typeid
     explicit SROA(signed T = -1) : FunctionPass((intptr_t)&ID) {
       if (T == -1)
-        SRThreshold = 128;
+        SRThreshold = 512;
       else
         SRThreshold = T;
     }