RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-03-04 19:07:26 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

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.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37668 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson 2007-06-19 23:23:54 +00:00
parent 52471b102c
commit 4f703ec0a1
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
lib/Transforms/Scalar/GVNPRE.cpp
View File

@ -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<Value*, uint32_t> valueNumbering;
DenseMap<Value*, uint32_t> valueNumbering;
std::map<Expression, uint32_t> expressionNumbering;
std::set<Expression> 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<Value*, uint32_t>::iterator VI = valueNumbering.find(V);
DenseMap<Value*, uint32_t>::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<Value*, uint32_t>::iterator VI = valueNumbering.find(V);
DenseMap<Value*, uint32_t>::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<Value*, uint32_t>::iterator VI = valueNumbering.find(V);
DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V);
if (VI != valueNumbering.end())
valueNumbering.erase(VI);
valueNumbering.insert(std::make_pair(V, num));