diff options
| author | Chris Lattner <sabre@nondot.org> | 2005-03-22 01:42:59 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2005-03-22 01:42:59 +0000 |
| commit | 3bc703ba22e8e04b4120dad6dffdf63bb373083c (patch) | |
| tree | ffc33834ec0e236f3079811e908117fbbe239b0f /lib/Analysis/DataStructure/DataStructure.cpp | |
| parent | 54fdcb24808bc7c66109efd9e4e3206ee4af3967 (diff) | |
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 :(
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20762 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/DataStructure.cpp')
| -rw-r--r-- | lib/Analysis/DataStructure/DataStructure.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp index b190b9205c..3d3b0d36cc 100644 --- a/lib/Analysis/DataStructure/DataStructure.cpp +++ b/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())); |