commit d7e58640a5660d44ac12d1b0175bf6fe32db5b8d
author Tobias Grosser <grosser@fim.uni-passau.de> Wed Apr 10 06:55:45 2013 +0000
committer Tobias Grosser <grosser@fim.uni-passau.de> Wed Apr 10 06:55:45 2013 +0000
tree 1a962a720f331027d10cfb2c758a0e5496db9c13
parent 0ee50f6ee46902a568eaa3d8baaa2e99f892fb07

Update formatting to latest version of clang-format

llvm-svn: 179160

polly/lib/Analysis/ScopDetection.cpp

diff --git a/polly/lib/Analysis/ScopDetection.cpp b/polly/lib/Analysis/ScopDetection.cpp
index f0bbf3d7..e2f2ec5 100644
--- a/polly/lib/Analysis/ScopDetection.cpp
+++ b/polly/lib/Analysis/ScopDetection.cpp
@@ -150,8 +150,8 @@
   return InvalidRegions.find(R)->second;
 }
 
-bool ScopDetection::isValidCFG(BasicBlock &BB,
-                               DetectionContext &Context) const {
+bool
+ScopDetection::isValidCFG(BasicBlock &BB, DetectionContext &Context) const {
   Region &RefRegion = Context.CurRegion;
   TerminatorInst *TI = BB.getTerminator();
 
@@ -176,8 +176,7 @@
   // Only Constant and ICmpInst are allowed as condition.
   if (!(isa<Constant>(Condition) || isa<ICmpInst>(Condition)))
     INVALID(AffFunc, "Condition in BB '" + BB.getName() +
-                     "' neither "
-                     "constant nor an icmp instruction");
+                         "' neither constant nor an icmp instruction");
 
   // Allow perfectly nested conditions.
   assert(Br->getNumSuccessors() == 2 && "Unexpected number of successors");
@@ -316,8 +315,8 @@
   return true;
 }
 
-bool ScopDetection::hasScalarDependency(Instruction &Inst,
-                                        Region &RefRegion) const {
+bool
+ScopDetection::hasScalarDependency(Instruction &Inst, Region &RefRegion) const {
   for (Instruction::use_iterator UI = Inst.use_begin(), UE = Inst.use_end();
        UI != UE; ++UI)
     if (Instruction *Use = dyn_cast<Instruction>(*UI))
@@ -410,7 +409,7 @@
   if (!isAffineExpr(&Context.CurRegion, LoopCount, *SE))
     INVALID(LoopBound,
             "Non affine loop bound '"
-            << *LoopCount << "' in loop: " << L->getHeader()->getName());
+                << *LoopCount << "' in loop: " << L->getHeader()->getName());
 
   return true;
 }
@@ -438,7 +437,8 @@
       if (LastValidRegion)
         delete LastValidRegion;
 
-      // Store this region, because it is the greatest valid (encountered so far)
+      // Store this region, because it is the greatest valid (encountered so
+      // far).
       LastValidRegion = ExpandedRegion;
 
       // Create and test the next greater region (if any)
@@ -456,7 +456,7 @@
   }
 
   DEBUG(if (LastValidRegion)
-        dbgs() << "\tto " << LastValidRegion->getNameStr() << "\n";
+            dbgs() << "\tto " << LastValidRegion->getNameStr() << "\n";
         else dbgs() << "\tExpanding " << R.getNameStr() << " failed\n";);
 
   return LastValidRegion;