[llvm-commits] [llvm] r76523 - /llvm/trunk/lib/Analysis/ScalarEvolution.cpp

[Dan Gohman]

Author: djg
Date: Mon Jul 20 19:38:55 2009
New Revision: 76523

URL: http://llvm.org/viewvc/llvm-project?rev=76523&view=rev
Log:
Whitespace cleanups.

Modified:
    llvm/trunk/lib/Analysis/ScalarEvolution.cpp

Modified: llvm/trunk/lib/Analysis/ScalarEvolution.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/ScalarEvolution.cpp?rev=76523&r1=76522&r2=76523&view=diff

==============================================================================
--- llvm/trunk/lib/Analysis/ScalarEvolution.cpp (original)
+++ llvm/trunk/lib/Analysis/ScalarEvolution.cpp Mon Jul 20 19:38:55 2009
@@ -568,8 +568,8 @@
 /// BinomialCoefficient - Compute BC(It, K).  The result has width W.
 /// Assume, K > 0.
 static const SCEV *BinomialCoefficient(const SCEV *It, unsigned K,
-                                      ScalarEvolution &SE,
-                                      const Type* ResultTy) {
+                                       ScalarEvolution &SE,
+                                       const Type* ResultTy) {
   // Handle the simplest case efficiently.
   if (K == 1)
     return SE.getTruncateOrZeroExtend(It, ResultTy);
@@ -686,7 +686,7 @@
 /// where BC(It, k) stands for binomial coefficient.
 ///
 const SCEV *SCEVAddRecExpr::evaluateAtIteration(const SCEV *It,
-                                               ScalarEvolution &SE) const {
+                                                ScalarEvolution &SE) const {
   const SCEV *Result = getStart();
   for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
     // The computation is correct in the face of overflow provided that the