From: Owen Anderson <resistor@mac.com>
Date: Thu, 21 Jun 2007 01:59:05 +0000 (+0000)
Subject: Eliminate a redundant check.  This speeds up optimization of 253.perlbmk from 13... 
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=58e087b6e30aa9e0228ef1f49c31770aa1141161;p=oota-llvm.git

Eliminate a redundant check.  This speeds up optimization of 253.perlbmk from 13.5 seconds to 10.9 seconds.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37683 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/Transforms/Scalar/GVNPRE.cpp b/lib/Transforms/Scalar/GVNPRE.cpp
index ef70f679bcf..b1b096e3504 100644
--- a/lib/Transforms/Scalar/GVNPRE.cpp
+++ b/lib/Transforms/Scalar/GVNPRE.cpp
@@ -887,13 +887,9 @@ bool GVNPRE::buildsets_anticin(BasicBlock* BB,
     // However, for opaques, such as constants within PHI nodes, it is
     // possible that they have not yet received a number.  Make sure they do
     // so now.
-    uint32_t valNum = 0;
-    if (isa<BinaryOperator>(*I) || isa<CmpInst>(*I))
-      valNum = VN.lookup(*I);
-    else
-      valNum = VN.lookup_or_add(*I);
-    if (find_leader(anticIn, valNum) == 0)
-      val_insert(anticIn, *I);
+    if (!isa<BinaryOperator>(*I) && !isa<CmpInst>(*I))
+      VN.lookup_or_add(*I);
+    val_insert(anticIn, *I);
   }
       
   clean(anticIn);