From 4f703ec0a1778a49df08d2e76e2b309bbfa50f0d Mon Sep 17 00:00:00 2001 From: Owen Anderson Date: Tue, 19 Jun 2007 23:23:54 +0000 Subject: [PATCH] Use a DenseMap instead of an std::map for the value numbering. This reduces the time to optimize lencod on a PPC Debug build from ~300s to ~140s. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37668 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Transforms/Scalar/GVNPRE.cpp | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/lib/Transforms/Scalar/GVNPRE.cpp b/lib/Transforms/Scalar/GVNPRE.cpp index 61bc3673cf5..e261d7895fc 100644 --- a/lib/Transforms/Scalar/GVNPRE.cpp +++ b/lib/Transforms/Scalar/GVNPRE.cpp @@ -25,6 +25,7 @@ #include "llvm/Function.h" #include "llvm/Analysis/Dominators.h" #include "llvm/Analysis/PostDominators.h" +#include "llvm/ADT/DenseMap.h" #include "llvm/ADT/DepthFirstIterator.h" #include "llvm/ADT/Statistic.h" #include "llvm/Support/CFG.h" @@ -78,7 +79,7 @@ namespace { }; private: - std::map valueNumbering; + DenseMap valueNumbering; std::map expressionNumbering; std::set maximalExpressions; @@ -217,7 +218,7 @@ ValueTable::Expression::ExpressionOpcode ValueTable::getOpcode(CmpInst* C) { uint32_t ValueTable::lookup_or_add(Value* V) { maximalValues.insert(V); - std::map::iterator VI = valueNumbering.find(V); + DenseMap::iterator VI = valueNumbering.find(V); if (VI != valueNumbering.end()) return VI->second; @@ -255,7 +256,7 @@ uint32_t ValueTable::lookup_or_add(Value* V) { } uint32_t ValueTable::lookup(Value* V) { - std::map::iterator VI = valueNumbering.find(V); + DenseMap::iterator VI = valueNumbering.find(V); if (VI != valueNumbering.end()) return VI->second; else @@ -265,7 +266,7 @@ uint32_t ValueTable::lookup(Value* V) { } void ValueTable::add(Value* V, uint32_t num) { - std::map::iterator VI = valueNumbering.find(V); + DenseMap::iterator VI = valueNumbering.find(V); if (VI != valueNumbering.end()) valueNumbering.erase(VI); valueNumbering.insert(std::make_pair(V, num)); -- 2.34.1