[llvm-commits] CVS: llvm/lib/Transforms/Scalar/GCSE.cpp

[Chris Lattner]

Changes in directory llvm/lib/Transforms/Scalar:

GCSE.cpp updated: 1.39 -> 1.40

---
Log message:

Add support for replacement of formal arguments with simpler expressions.


---
Diffs of the changes:  (+23 -2)

Index: llvm/lib/Transforms/Scalar/GCSE.cpp
diff -u llvm/lib/Transforms/Scalar/GCSE.cpp:1.39 llvm/lib/Transforms/Scalar/GCSE.cpp:1.40
--- llvm/lib/Transforms/Scalar/GCSE.cpp:1.39	Mon Apr 12 00:15:13 2004
+++ llvm/lib/Transforms/Scalar/GCSE.cpp	Sun May 23 16:19:55 2004
@@ -1,4 +1,4 @@
-//===-- GCSE.cpp - SSA based Global Common Subexpr Elimination ------------===//
+//===-- GCSE.cpp - SSA-based Global Common Subexpression Elimination ------===//
 // 
 //                     The LLVM Compiler Infrastructure
 //
@@ -33,6 +33,8 @@
   Statistic<> NumCallRemoved("gcse", "Number of calls removed");
   Statistic<> NumNonInsts   ("gcse", "Number of instructions removed due "
                              "to non-instruction values");
+  Statistic<> NumArgsRepl   ("gcse", "Number of function arguments replaced "
+                             "with constant values");
 
   struct GCSE : public FunctionPass {
     virtual bool runOnFunction(Function &F);
@@ -68,6 +70,25 @@
 
   std::vector<Value*> EqualValues;
 
+  // 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::aiterator AI = F.abegin(), E = F.aend(); AI != E; ++AI)
+    if (!AI->use_empty()) {
+      VN.getEqualNumberNodes(AI, EqualValues);
+      if (!EqualValues.empty()) {
+        for (unsigned i = 0, e = EqualValues.size(); i != e; ++i)
+          if (isa<Constant>(EqualValues[i]) ||
+              isa<GlobalValue>(EqualValues[i])) {
+            AI->replaceAllUsesWith(EqualValues[i]);
+            ++NumArgsRepl;
+            Changed = true;
+            break;
+          }
+        EqualValues.clear();
+      }
+    }
+
   // Traverse the CFG of the function in dominator order, so that we see each
   // instruction after we see its operands.
   for (df_iterator<DominatorTree::Node*> DI = df_begin(DT.getRootNode()),
@@ -161,7 +182,7 @@
   ++NumInstRemoved;   // Keep track of number of insts eliminated
 
   // Update value numbering
-  getAnalysis<ValueNumbering>().deleteInstruction(I);
+  getAnalysis<ValueNumbering>().deleteValue(I);
 
   // If we are not replacing the instruction with a constant, we cannot do
   // anything special.