summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2005-03-22 01:42:59 +0000
committerChris Lattner <sabre@nondot.org>2005-03-22 01:42:59 +0000
commite05c633099b728e77d6b2760749f6bba9cf61942 (patch)
tree8ec5b7b65885d743e7bcdf5bb67616190473b615 /llvm/lib/Analysis/DataStructure/DataStructure.cpp
parentd0949a00beb4d7b922118cc1e81716ad84881aba (diff)
downloadbcm5719-llvm-e05c633099b728e77d6b2760749f6bba9cf61942.tar.gz
bcm5719-llvm-e05c633099b728e77d6b2760749f6bba9cf61942.zip
Don't use operator[], use the new method instead, which is faster. This speeds
up the TD pass about 30% for povray and perlbmk. It's still not clear why copying a 5MB set of graphs turns into a 25MB set of graphs though :( llvm-svn: 20762
Diffstat (limited to 'llvm/lib/Analysis/DataStructure/DataStructure.cpp')
-rw-r--r--llvm/lib/Analysis/DataStructure/DataStructure.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/llvm/lib/Analysis/DataStructure/DataStructure.cpp b/llvm/lib/Analysis/DataStructure/DataStructure.cpp
index b190b9205c2..3d3b0d36cc6 100644
--- a/llvm/lib/Analysis/DataStructure/DataStructure.cpp
+++ b/llvm/lib/Analysis/DataStructure/DataStructure.cpp
@@ -1273,7 +1273,7 @@ void DSGraph::cloneInto(const DSGraph &G, unsigned CloneFlags) {
for (DSScalarMap::const_iterator I = G.ScalarMap.begin(),
E = G.ScalarMap.end(); I != E; ++I) {
DSNodeHandle &MappedNode = OldNodeMap[I->second.getNode()];
- DSNodeHandle &H = ScalarMap[I->first];
+ DSNodeHandle &H = ScalarMap.getRawEntryRef(I->first);
DSNode *MappedNodeN = MappedNode.getNode();
H.mergeWith(DSNodeHandle(MappedNodeN,
I->second.getOffset()+MappedNode.getOffset()));
OpenPOWER on IntegriCloud