6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-08-15 22:28:18 +00:00
Code Issues Projects Releases Wiki Activity

Remove obsolete code

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4218 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2002-10-17 04:58:10 +00:00
parent 19db0492b8
commit 3cc061c0e9
2 changed files with 0 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
lib/Analysis/DataStructure/BottomUpClosure.cpp
View File

@@ -113,9 +113,6 @@ DSGraph &BUDataStructures::calculateGraph(Function &F) {
#if 0 #if 0
// Populate the GlobalsGraph with globals from this one. // Populate the GlobalsGraph with globals from this one.
Graph->GlobalsGraph->cloneGlobals(*Graph, /*cloneCalls*/ false); Graph->GlobalsGraph->cloneGlobals(*Graph, /*cloneCalls*/ false);
// Save a copy of the original call nodes for the top-down pass
Graph->saveOrigFunctionCalls();
#endif #endif
// Start resolving calls... // Start resolving calls...
@@ -123,16 +120,6 @@ DSGraph &BUDataStructures::calculateGraph(Function &F) {
DEBUG(std::cerr << " [BU] Inlining: " << F.getName() << "\n"); DEBUG(std::cerr << " [BU] Inlining: " << F.getName() << "\n");
#if 0
// Add F to the PendingCallers list of each direct callee for use in the
// top-down pass so we don't have to compute this again. We don't want
// to do it for indirect callees inlined later, so remember which calls
// are in the original FCs set.
std::set<const DSNode*> directCallees;
for (unsigned i = 0; i < FCs.size(); ++i)
directCallees.insert(FCs[i][1]); // ptr to function node
#endif
bool Inlined; bool Inlined;
do { do {
Inlined = false; Inlined = false;
@@ -209,12 +196,6 @@ DSGraph &BUDataStructures::calculateGraph(Function &F) {
// //
MergeGlobalNodes(*Graph, OldValMap); MergeGlobalNodes(*Graph, OldValMap);
#if 0
// If this was an original call, add F to the PendingCallers list
if (directCallees.find(Call[1]) != directCallees.end())
GI.addCaller(F);
#endif
// Erase the entry in the Callees vector // Erase the entry in the Callees vector
Callees.erase(Callees.begin()+c--); Callees.erase(Callees.begin()+c--);
@@ -250,13 +231,6 @@ DSGraph &BUDataStructures::calculateGraph(Function &F) {
} }
} while (Inlined && !FCs.empty()); } while (Inlined && !FCs.empty());
#if 0
// Copy any unresolved call nodes into the Globals graph and
// filter out unresolved call nodes inlined from the callee.
if (!FCs.empty())
Graph->GlobalsGraph->cloneCalls(*Graph);
#endif
Graph->maskIncompleteMarkers(); Graph->maskIncompleteMarkers();
Graph->markIncompleteNodes(); Graph->markIncompleteNodes();
Graph->removeTriviallyDeadNodes(false); Graph->removeTriviallyDeadNodes(false);

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

@@ -447,15 +447,6 @@ DSNodeHandle DSGraph::cloneInto(const DSGraph &G,
// Copy the function calls list... // Copy the function calls list...
CopyFunctionCallsList(G.FunctionCalls, FunctionCalls, OldNodeMap); CopyFunctionCallsList(G.FunctionCalls, FunctionCalls, OldNodeMap);
#if 0
if (CopyOrigCalls)
CopyFunctionCallsList(G.OrigFunctionCalls, OrigFunctionCalls, OldNodeMap);
// Copy the list of unresolved callers
if (CopyCallers)
PendingCallers.insert(G.PendingCallers.begin(), G.PendingCallers.end());
#endif
// Return the returned node pointer... // Return the returned node pointer...
return DSNodeHandle(OldNodeMap[G.RetNode.getNode()], G.RetNode.getOffset()); return DSNodeHandle(OldNodeMap[G.RetNode.getNode()], G.RetNode.getOffset());
} }