[llvm-commits] CVS: llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp DataStructure.cpp TopDownClosure.cpp
Chris Lattner
lattner at cs.uiuc.edu
Thu Nov 7 01:07:07 PST 2002
Changes in directory llvm/lib/Analysis/DataStructure:
BottomUpClosure.cpp updated: 1.33 -> 1.34
DataStructure.cpp updated: 1.48 -> 1.49
TopDownClosure.cpp updated: 1.20 -> 1.21
---
Log message:
Instead of using a bool that constant has to be explained, use a self
explanitory enum instead.
---
Diffs of the changes:
Index: llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp
diff -u llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.33 llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.34
--- llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.33 Thu Nov 7 00:31:54 2002
+++ llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp Thu Nov 7 01:06:20 2002
@@ -93,7 +93,7 @@
DEBUG(std::cerr << "\t[BU] Self Inlining: " << F.getName() << "\n");
// Handle self recursion by resolving the arguments and return value
- Graph->mergeInGraph(Call, *Graph, true);
+ Graph->mergeInGraph(Call, *Graph, DSGraph::StripAllocaBit);
// Erase the entry in the callees vector
Callees.erase(Callees.begin()+c--);
@@ -120,7 +120,7 @@
CallSitesForFunc.back().setCallee(0);
// Handle self recursion by resolving the arguments and return value
- Graph->mergeInGraph(Call, GI, true);
+ Graph->mergeInGraph(Call, GI, DSGraph::StripAllocaBit);
// Erase the entry in the Callees vector
Callees.erase(Callees.begin()+c--);
Index: llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.48 llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.49
--- llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.48 Thu Nov 7 00:31:54 2002
+++ llvm/lib/Analysis/DataStructure/DataStructure.cpp Thu Nov 7 01:06:20 2002
@@ -526,7 +526,7 @@
DSNodeHandle DSGraph::cloneInto(const DSGraph &G,
std::map<Value*, DSNodeHandle> &OldValMap,
std::map<const DSNode*, DSNode*> &OldNodeMap,
- bool StripAllocas) {
+ AllocaBit StripAllocas) {
assert(OldNodeMap.empty() && "Returned OldNodeMap should be empty!");
unsigned FN = Nodes.size(); // First new node...
@@ -544,11 +544,10 @@
for (unsigned i = FN, e = Nodes.size(); i != e; ++i)
Nodes[i]->remapLinks(OldNodeMap);
- // Remove local markers as specified
- unsigned char StripBits = StripAllocas ? DSNode::AllocaNode : 0;
- if (StripBits)
+ // Remove alloca markers as specified
+ if (StripAllocas == StripAllocaBit)
for (unsigned i = FN, e = Nodes.size(); i != e; ++i)
- Nodes[i]->NodeType &= ~StripBits;
+ Nodes[i]->NodeType &= ~DSNode::AllocaNode;
// Copy the value map... and merge all of the global nodes...
for (std::map<Value*, DSNodeHandle>::const_iterator I = G.ScalarMap.begin(),
@@ -580,7 +579,7 @@
/// graph.
///
void DSGraph::mergeInGraph(DSCallSite &CS, const DSGraph &Graph,
- bool StripAllocas) {
+ AllocaBit StripAllocas) {
std::map<Value*, DSNodeHandle> OldValMap;
DSNodeHandle RetVal;
std::map<Value*, DSNodeHandle> *ScalarMap = &OldValMap;
Index: llvm/lib/Analysis/DataStructure/TopDownClosure.cpp
diff -u llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.20 llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.21
--- llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.20 Thu Nov 7 00:31:54 2002
+++ llvm/lib/Analysis/DataStructure/TopDownClosure.cpp Thu Nov 7 01:06:20 2002
@@ -177,7 +177,7 @@
// Strip scalars but not allocas since they are alive in callee.
//
DSNodeHandle RetVal = Graph->cloneInto(CG, OldValMap, OldNodeMap,
- /*StripAllocas*/ false);
+ DSGraph::KeepAllocaBit);
ResolveCallSite(*Graph, DSCallSite(CallSiteInCG, OldNodeMap));
}
More information about the llvm-commits
mailing list