diff options
| author | Chandler Carruth <chandlerc@gmail.com> | 2014-04-30 10:48:36 +0000 |
|---|---|---|
| committer | Chandler Carruth <chandlerc@gmail.com> | 2014-04-30 10:48:36 +0000 |
| commit | 5217c945225ba9d5c393e56e2a1e2eeed914c4b3 (patch) | |
| tree | 41d4e3357f76b78912d2ddf776f401ad522b4ffd /llvm/lib | |
| parent | 8b530e10a12ae315120d3ac30e7982c34fbff7f6 (diff) | |
| download | bcm5719-llvm-5217c945225ba9d5c393e56e2a1e2eeed914c4b3.tar.gz bcm5719-llvm-5217c945225ba9d5c393e56e2a1e2eeed914c4b3.zip | |
[LCG] Add the really, *really* boring edge insertion case: adding an
edge entirely within an existing SCC. Shockingly, making the connected
component more connected is ... a total snooze fest. =]
Anyways, its wired up, and I even added a test case to make sure it
pretty much sorta works. =D
llvm-svn: 207631
Diffstat (limited to 'llvm/lib')
| -rw-r--r-- | llvm/lib/Analysis/LazyCallGraph.cpp | 23 |
1 files changed, 19 insertions, 4 deletions
diff --git a/llvm/lib/Analysis/LazyCallGraph.cpp b/llvm/lib/Analysis/LazyCallGraph.cpp index dd940a98f3b..6c4574f867c 100644 --- a/llvm/lib/Analysis/LazyCallGraph.cpp +++ b/llvm/lib/Analysis/LazyCallGraph.cpp @@ -76,11 +76,16 @@ LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F) } void LazyCallGraph::Node::insertEdgeInternal(Function &Callee) { - CalleeIndexMap.insert(std::make_pair(&Callee, Callees.size())); if (Node *N = G->lookup(Callee)) - Callees.push_back(N); - else - Callees.push_back(&Callee); + return insertEdgeInternal(*N); + + CalleeIndexMap.insert(std::make_pair(&Callee, Callees.size())); + Callees.push_back(&Callee); +} + +void LazyCallGraph::Node::insertEdgeInternal(Node &CalleeN) { + CalleeIndexMap.insert(std::make_pair(&CalleeN.getFunction(), Callees.size())); + Callees.push_back(&CalleeN); } void LazyCallGraph::Node::removeEdgeInternal(Function &Callee) { @@ -157,6 +162,16 @@ void LazyCallGraph::SCC::insert(Node &N) { G->SCCMap[&N] = this; } +void LazyCallGraph::SCC::insertIntraSCCEdge(Node &CallerN, Node &CalleeN) { + // First insert it into the caller. + CallerN.insertEdgeInternal(CalleeN); + + assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC."); + assert(G->SCCMap.lookup(&CalleeN) == this && "Callee must be in this SCC."); + + // Nothing changes about this SCC or any other. +} + void LazyCallGraph::SCC::removeInterSCCEdge(Node &CallerN, Node &CalleeN) { // First remove it from the node. CallerN.removeEdgeInternal(CalleeN.getFunction()); |

