aboutsummaryrefslogtreecommitdiff
path: root/lib/Analysis/DataStructure/DataStructure.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2004-01-28 02:11:49 +0000
committerChris Lattner <sabre@nondot.org>2004-01-28 02:11:49 +0000
commit239644dc3b9775af6f1b029e3f0f06f974e9bfd9 (patch)
tree811e4ec3944da5d72639b86cb63c17e8f4dccf35 /lib/Analysis/DataStructure/DataStructure.cpp
parent00948c05b26fc865e212eb293afeae692a44e6bb (diff)
Further reduce the number of nodes cloned with getClonedNH, using merge instead.
This reduces the number of nodes allocated, then immediately merged and DNE'd from 2193852 to 1298049. unfortunately this only speeds DSA up by ~1.5s (of 53s), because it's spending most of its time waddling through the scalar map :( git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@10992 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/DataStructure.cpp')
-rw-r--r--lib/Analysis/DataStructure/DataStructure.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp
index c0be41331c..881e8d6d4c 100644
--- a/lib/Analysis/DataStructure/DataStructure.cpp
+++ b/lib/Analysis/DataStructure/DataStructure.cpp
@@ -1070,7 +1070,7 @@ void DSGraph::updateFromGlobalGraph() {
if (InlinedGlobals.count(GV) == 0) { // GNode is not up-to-date
ScalarMapTy::iterator It = GlobalsGraph->ScalarMap.find(GV);
if (It != GlobalsGraph->ScalarMap.end())
- RC.getClonedNH(It->second);
+ RC.merge(I->second, It->second);
}
// Merging global nodes leaves behind unused nodes: get rid of them now.