[llvm-commits] CVS: llvm/lib/Analysis/ScalarEvolution.cpp

[Zhou Sheng]

Changes in directory llvm/lib/Analysis:

ScalarEvolution.cpp updated: 1.108 -> 1.109
---
Log message:

Eliminate unnecessary APInt construction.


---
Diffs of the changes:  (+7 -8)

 ScalarEvolution.cpp |   15 +++++++--------
 1 files changed, 7 insertions(+), 8 deletions(-)


Index: llvm/lib/Analysis/ScalarEvolution.cpp
diff -u llvm/lib/Analysis/ScalarEvolution.cpp:1.108 
llvm/lib/Analysis/ScalarEvolution.cpp:1.109
--- llvm/lib/Analysis/ScalarEvolution.cpp:1.108 Sat Apr  7 12:40:57 2007
+++ llvm/lib/Analysis/ScalarEvolution.cpp       Sat Apr  7 12:48:27 2007
@@ -500,7 +500,7 @@
   // Handle this case efficiently, it is common to have constant iteration
   // counts while computing loop exit values.
   if (SCEVConstant *SC = dyn_cast<SCEVConstant>(V)) {
-    APInt Val = SC->getValue()->getValue();
+    const APInt& Val = SC->getValue()->getValue();
     APInt Result(Val.getBitWidth(), 1);
     for (; NumSteps; --NumSteps)
       Result *= Val-(NumSteps-1);
@@ -1336,7 +1336,7 @@
 /// example, turn {4,+,8} -> 4.    (S umod result) should always equal zero.
 static APInt GetConstantFactor(SCEVHandle S) {
   if (SCEVConstant *C = dyn_cast<SCEVConstant>(S)) {
-    APInt V = C->getValue()->getValue();
+    const APInt& V = C->getValue()->getValue();
     if (!V.isMinValue())
       return V;
     else   // Zero is a multiple of everything.
@@ -2096,23 +2096,22 @@
   }
 
   uint32_t BitWidth = LC->getValue()->getValue().getBitWidth();
-  APInt L(LC->getValue()->getValue());
-  APInt M(MC->getValue()->getValue());
-  APInt N(MC->getValue()->getValue());
+  const APInt& L = LC->getValue()->getValue();
+  const APInt& M = MC->getValue()->getValue();
+  const APInt& N = MC->getValue()->getValue();
   APInt Two(BitWidth, 2);
   APInt Four(BitWidth, 4);
 
   { 
     using namespace APIntOps;
-    APInt C(L);
+    const APInt& C = L;
     // Convert from chrec coefficients to polynomial coefficients AX^2+BX+C
     // The B coefficient is M-N/2
     APInt B(M);
     B -= sdiv(N,Two);
 
     // The A coefficient is N/2
-    APInt A(N);
-    A = A.sdiv(Two);
+    APInt A(N.sdiv(Two));
 
     // Compute the B^2-4ac term.
     APInt SqrtTerm(B);



_______________________________________________
llvm-commits mailing list
llvm-commits@cs.uiuc.edu
http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits