6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-06-23 01:24:30 +00:00
Code Issues Projects Releases Wiki Activity

Minor tweaks, eliminate useless integer pruning optimziation, turn on

Browse Source 
timers by default


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@10993 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2004-01-28 02:41:32 +00:00
parent 239644dc3b
commit a88a55cf10
1 changed files with 6 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
lib/Analysis/DataStructure/DataStructure.cpp
View File

@ -35,7 +35,7 @@ namespace {
cl::desc("Make DSA less aggressive when cloning graphs")); cl::desc("Make DSA less aggressive when cloning graphs"));
}; };
#if 0 #if 1
#define TIME_REGION(VARNAME, DESC) \ #define TIME_REGION(VARNAME, DESC) \
NamedRegionTimer VARNAME(DESC) NamedRegionTimer VARNAME(DESC)
#else #else
@ -104,7 +104,7 @@ void DSNode::assertOK() const {
assert(ParentGraph && "Node has no parent?"); assert(ParentGraph && "Node has no parent?");
const DSGraph::ScalarMapTy &SM = ParentGraph->getScalarMap(); const DSGraph::ScalarMapTy &SM = ParentGraph->getScalarMap();
for (unsigned i = 0, e = Globals.size(); i != e; ++i) { for (unsigned i = 0, e = Globals.size(); i != e; ++i) {
assert(SM.find(Globals[i]) != SM.end()); assert(SM.count(Globals[i]));
assert(SM.find(Globals[i])->second.getNode() == this); assert(SM.find(Globals[i])->second.getNode() == this);
} }
} }
@ -1637,6 +1637,8 @@ void DSGraph::removeDeadNodes(unsigned Flags) {
} }
++I; ++I;
} else { } else {
DSNode *N = I->second.getNode();
#if 0
// Check to see if this is a worthless node generated for non-pointer // Check to see if this is a worthless node generated for non-pointer
// values, such as integers. Consider an addition of long types: A+B. // values, such as integers. Consider an addition of long types: A+B.
// Assuming we can track all uses of the value in this context, and it is // Assuming we can track all uses of the value in this context, and it is
@ -1647,13 +1649,13 @@ void DSGraph::removeDeadNodes(unsigned Flags) {
// uninteresting for data structure analysis. If we run across one of // uninteresting for data structure analysis. If we run across one of
// these, prune the scalar pointing to it. // these, prune the scalar pointing to it.
// //
DSNode *N = I->second.getNode();
if (N->getNodeFlags() == DSNode::UnknownNode && !isa<Argument>(I->first)) if (N->getNodeFlags() == DSNode::UnknownNode && !isa<Argument>(I->first))
ScalarMap.erase(I++); ScalarMap.erase(I++);
else { else {
#endif
N->markReachableNodes(Alive); N->markReachableNodes(Alive);
++I; ++I;
} //}
} }
} }