From beb216da0a48b89a6050f55e3f2fa58e47452d8c Mon Sep 17 00:00:00 2001
From: Chris Lattner <sabre@nondot.org>
Date: Fri, 21 Mar 2008 21:33:23 +0000
Subject: [PATCH] make gvn marginally faster by reallocating the lastSeenLoad
 map for each basic block.

llvm-svn: 48660
---
 llvm/lib/Transforms/Scalar/GVN.cpp | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/llvm/lib/Transforms/Scalar/GVN.cpp b/llvm/lib/Transforms/Scalar/GVN.cpp
index 077fa67e0bd0..eb91b5a043d1 100644
--- a/llvm/lib/Transforms/Scalar/GVN.cpp
+++ b/llvm/lib/Transforms/Scalar/GVN.cpp
@@ -1287,15 +1287,16 @@ bool GVN::iterateOnFunction(Function &F) {
   DominatorTree &DT = getAnalysis<DominatorTree>();   
   
   SmallVector<Instruction*, 4> toErase;
-  
+  DenseMap<Value*, LoadInst*> lastSeenLoad;
+
   // Top-down walk of the dominator tree
   for (df_iterator<DomTreeNode*> DI = df_begin(DT.getRootNode()),
          E = df_end(DT.getRootNode()); DI != E; ++DI) {
     
     // Get the set to update for this block
     ValueNumberedSet& currAvail = availableOut[DI->getBlock()];     
-    DenseMap<Value*, LoadInst*> lastSeenLoad;
-    
+    lastSeenLoad.clear();
+
     BasicBlock* BB = DI->getBlock();
   
     // A block inherits AVAIL_OUT from its dominator