Searched refs:CallerN (Results 1 – 2 of 2) sorted by relevance
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 180 void LazyCallGraph::SCC::insertIntraSCCEdge(Node &CallerN, Node &CalleeN) { in insertIntraSCCEdge() argument
182 CallerN.insertEdgeInternal(CalleeN); in insertIntraSCCEdge()
184 assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC."); in insertIntraSCCEdge()
190 void LazyCallGraph::SCC::insertOutgoingEdge(Node &CallerN, Node &CalleeN) { in insertOutgoingEdge() argument
192 CallerN.insertEdgeInternal(CalleeN); in insertOutgoingEdge()
194 assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC."); in insertOutgoingEdge()
206 LazyCallGraph::SCC::insertIncomingEdge(Node &CallerN, Node &CalleeN) { in insertIncomingEdge() argument
208 CallerN.insertEdgeInternal(CalleeN); in insertIncomingEdge()
212 SCC &CallerC = *G->SCCMap.lookup(&CallerN); in insertIncomingEdge()
324 void LazyCallGraph::SCC::removeInterSCCEdge(Node &CallerN, Node &CalleeN) { in removeInterSCCEdge() argument
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 274 void insertIntraSCCEdge(Node &CallerN, Node &CalleeN);
282 void insertOutgoingEdge(Node &CallerN, Node &CalleeN);
298 SmallVector<SCC *, 1> insertIncomingEdge(Node &CallerN, Node &CalleeN);
310 void removeInterSCCEdge(Node &CallerN, Node &CalleeN);
344 SmallVector<SCC *, 1> removeIntraSCCEdge(Node &CallerN, Node &CalleeN);
|