Eliminate a redundant check. This speeds up optimization of 253.perlbmk from 13.5 seconds to 10.9 seconds.
llvm-svn: 37683
diff --git a/llvm/lib/Transforms/Scalar/GVNPRE.cpp b/llvm/lib/Transforms/Scalar/GVNPRE.cpp
index ef70f67..b1b096e 100644
--- a/llvm/lib/Transforms/Scalar/GVNPRE.cpp
+++ b/llvm/lib/Transforms/Scalar/GVNPRE.cpp
@@ -887,13 +887,9 @@
// 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);