6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-25 13:24:46 +00:00
Code Issues Projects Releases Wiki Activity

speed up steens by using spliceFrom, improve its precision by realizing that

Browse Source 
an incomplete node cannot alias a complete node.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20882 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2005-03-27 21:56:55 +00:00
parent 267a1b02a2
commit 40ee8ce28b
1 changed files with 10 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
lib/Analysis/DataStructure/Steensgaard.cpp
View File

@@ -124,7 +124,7 @@ bool Steens::runOnModule(Module &M) {
//
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
if (!I->isExternal())
ResultGraph->cloneInto(LDS.getDSGraph(*I));
ResultGraph->spliceFrom(LDS.getDSGraph(*I));
ResultGraph->removeTriviallyDeadNodes();
@@ -191,13 +191,18 @@ AliasAnalysis::AliasResult Steens::alias(const Value *V1, unsigned V1Size,
DSGraph::ScalarMapTy &GSM = ResultGraph->getScalarMap();
DSGraph::ScalarMapTy::iterator I = GSM.find(const_cast<Value*>(V1));
DSGraph::ScalarMapTy::iterator J = GSM.find(const_cast<Value*>(V2));
if (I != GSM.end() && !I->second.isNull() &&
I->second.getNode()->isComplete()) {
J != GSM.end() && !J->second.isNull()) {
DSNodeHandle &V1H = I->second;
DSGraph::ScalarMapTy::iterator J=GSM.find(const_cast<Value*>(V2));
if (J != GSM.end() && !J->second.isNull() &&
DSNodeHandle &V2H = J->second;
// If at least one of the nodes is complete, we can say something about
// this. If one is complete and the other isn't, then they are obviously
// different nodes. If they are both complete, we can't say anything
// useful.
if (I->second.getNode()->isComplete() ||
J->second.getNode()->isComplete()) {
DSNodeHandle &V2H = J->second;
// If the two pointers point to different data structure graph nodes, they
// cannot alias!
if (V1H.getNode() != V2H.getNode())