diff options
| author | Chris Lattner <sabre@nondot.org> | 2005-03-21 20:20:49 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2005-03-21 20:20:49 +0000 |
| commit | 040426aee072fda97855f2c65910e20d117e9a74 (patch) | |
| tree | c5f7ec962f87f0213a3ffb45aba39710e88ab0a6 /llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp | |
| parent | 032b364fc4f5d544161a03a41bf2fd784828bc32 (diff) | |
| download | bcm5719-llvm-040426aee072fda97855f2c65910e20d117e9a74.tar.gz bcm5719-llvm-040426aee072fda97855f2c65910e20d117e9a74.zip | |
Fix a major problem where we didn't add call graph edges for call sites with
more than 1 callee. This fixes Analysis/DSGraph/FunctionPointerTable-const.ll
llvm-svn: 20740
Diffstat (limited to 'llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp')
| -rw-r--r-- | llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp | 16 |
1 files changed, 10 insertions, 6 deletions
diff --git a/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp b/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp index e7899c9e56f..5549c8a6722 100644 --- a/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp +++ b/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp @@ -354,11 +354,11 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) { continue; } else { DSGraph *GI; + Instruction *TheCall = CS.getCallSite().getInstruction(); if (CalledFuncs.size() == 1) { Function *Callee = CalledFuncs[0]; - ActualCallees.insert(std::make_pair(CS.getCallSite().getInstruction(), - Callee)); + ActualCallees.insert(std::make_pair(TheCall, Callee)); // Get the data structure graph for the called function. GI = &getDSGraph(*Callee); // Graph to inline @@ -378,12 +378,16 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) { std::cerr << " calls " << CalledFuncs.size() << " fns from site: " << CS.getCallSite().getInstruction() << " " << *CS.getCallSite().getInstruction(); - unsigned NumToPrint = CalledFuncs.size(); - if (NumToPrint > 8) NumToPrint = 8; std::cerr << " Fns ="; + unsigned NumPrinted = 0; + for (std::vector<Function*>::iterator I = CalledFuncs.begin(), - E = CalledFuncs.end(); I != E && NumToPrint; ++I, --NumToPrint) - std::cerr << " " << (*I)->getName(); + E = CalledFuncs.end(); I != E; ++I) { + if (NumPrinted++ < 8) std::cerr << " " << (*I)->getName(); + + // Add the call edges to the call graph. + ActualCallees.insert(std::make_pair(TheCall, *I)); + } std::cerr << "\n"; // See if we already computed a graph for this set of callees. |

