6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-20 14:29:27 +00:00
Code Issues Projects Releases Wiki Activity

Do not revisit nodes in the SCC traversal. This speeds up the BU pass a bit.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@19968 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-02-01 17:35:52 +00:00
parent b9a47d1e3f
commit f189bcec00
1 changed files with 29 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -40,9 +40,13 @@ bool BUDataStructures::runOnModule(Module &M) {
GlobalsGraph = new DSGraph(LocalDSA.getGlobalsGraph()); GlobalsGraph = new DSGraph(LocalDSA.getGlobalsGraph());
GlobalsGraph->setPrintAuxCalls(); GlobalsGraph->setPrintAuxCalls();
std::vector<Function*> Stack;
hash_map<Function*, unsigned> ValMap;
unsigned NextID = 1;
Function *MainFunc = M.getMainFunction(); Function *MainFunc = M.getMainFunction();
if (MainFunc) if (MainFunc)
calculateReachableGraphs(MainFunc); calculateGraphs(MainFunc, Stack, NextID, ValMap);
// Calculate the graphs for any functions that are unreachable from main... // Calculate the graphs for any functions that are unreachable from main...
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
@ -52,7 +56,7 @@ bool BUDataStructures::runOnModule(Module &M) {
std::cerr << "*** Function unreachable from main: " std::cerr << "*** Function unreachable from main: "
<< I->getName() << "\n"; << I->getName() << "\n";
#endif #endif
calculateReachableGraphs(I); // Calculate all graphs... calculateGraphs(I, Stack, NextID, ValMap); // Calculate all graphs.
} }
NumCallEdges += ActualCallees.size(); NumCallEdges += ActualCallees.size();
@ -69,10 +73,6 @@ bool BUDataStructures::runOnModule(Module &M) {
} }
void BUDataStructures::calculateReachableGraphs(Function *F) { void BUDataStructures::calculateReachableGraphs(Function *F) {
std::vector<Function*> Stack;
hash_map<Function*, unsigned> ValMap;
unsigned NextID = 1;
calculateGraphs(F, Stack, NextID, ValMap);
} }
DSGraph &BUDataStructures::getOrCreateGraph(Function *F) { DSGraph &BUDataStructures::getOrCreateGraph(Function *F) {
@ -253,7 +253,29 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) {
DSGraph::ReturnNodesTy &ReturnNodes = Graph.getReturnNodes(); DSGraph::ReturnNodesTy &ReturnNodes = Graph.getReturnNodes();
// Loop over all of the resolvable call sites // Print out multi-call sites.
bool Printed = false;
for (std::list<DSCallSite>::iterator I = TempFCs.begin(), E = TempFCs.end();
I != E; ++I) {
if (!I->isDirectCall()) {
DSNode *Node = I->getCalleeNode();
if (Node->getGlobals().size() > 1) {
if (!Printed)
std::cerr << "In Fns: " << Graph.getFunctionNames() << "\n";
std::cerr << " calls " << Node->getGlobals().size()
<< " fns from site: " << *I->getCallSite().getInstruction();
unsigned NumToPrint = Node->getGlobals().size();
if (NumToPrint > 5) NumToPrint = 5;
std::cerr << " Fns =";
for (unsigned i = 0; i != NumToPrint; ++i)
std::cerr << " " << Node->getGlobals()[i]->getName();
std::cerr << "\n";
}
}
}
// Loop over all of the resolvable call sites.
DSCallSiteIterator I = DSCallSiteIterator::begin(TempFCs); DSCallSiteIterator I = DSCallSiteIterator::begin(TempFCs);
DSCallSiteIterator E = DSCallSiteIterator::end(TempFCs); DSCallSiteIterator E = DSCallSiteIterator::end(TempFCs);