[llvm-commits] CVS: llvm/lib/Analysis/DataStructure/DataStructure.cpp
Chris Lattner
lattner at cs.uiuc.edu
Tue Jan 27 20:42:01 PST 2004
Changes in directory llvm/lib/Analysis/DataStructure:
DataStructure.cpp updated: 1.141 -> 1.142
---
Log message:
Minor tweaks, eliminate useless integer pruning optimziation, turn on
timers by default
---
Diffs of the changes: (+6 -4)
Index: llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.141 llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.142
--- llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.141 Tue Jan 27 20:11:49 2004
+++ llvm/lib/Analysis/DataStructure/DataStructure.cpp Tue Jan 27 20:41:32 2004
@@ -35,7 +35,7 @@
cl::desc("Make DSA less aggressive when cloning graphs"));
};
-#if 0
+#if 1
#define TIME_REGION(VARNAME, DESC) \
NamedRegionTimer VARNAME(DESC)
#else
@@ -104,7 +104,7 @@
assert(ParentGraph && "Node has no parent?");
const DSGraph::ScalarMapTy &SM = ParentGraph->getScalarMap();
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);
}
}
@@ -1637,6 +1637,8 @@
}
++I;
} else {
+ DSNode *N = I->second.getNode();
+#if 0
// 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.
// Assuming we can track all uses of the value in this context, and it is
@@ -1647,13 +1649,13 @@
// uninteresting for data structure analysis. If we run across one of
// these, prune the scalar pointing to it.
//
- DSNode *N = I->second.getNode();
if (N->getNodeFlags() == DSNode::UnknownNode && !isa<Argument>(I->first))
ScalarMap.erase(I++);
else {
+#endif
N->markReachableNodes(Alive);
++I;
- }
+ //}
}
}
More information about the llvm-commits
mailing list