Searched refs:CalleeN (Results 1 – 2 of 2) sorted by relevance
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 86 void LazyCallGraph::Node::insertEdgeInternal(Node &CalleeN) { in insertEdgeInternal() argument
87 CalleeIndexMap.insert(std::make_pair(&CalleeN.getFunction(), Callees.size())); in insertEdgeInternal()
88 Callees.push_back(&CalleeN); in insertEdgeInternal()
180 void LazyCallGraph::SCC::insertIntraSCCEdge(Node &CallerN, Node &CalleeN) { in insertIntraSCCEdge() argument
182 CallerN.insertEdgeInternal(CalleeN); in insertIntraSCCEdge()
185 assert(G->SCCMap.lookup(&CalleeN) == this && "Callee 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()
196 SCC &CalleeC = *G->SCCMap.lookup(&CalleeN); in insertOutgoingEdge()
206 LazyCallGraph::SCC::insertIncomingEdge(Node &CallerN, Node &CalleeN) { in insertIncomingEdge() argument
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 183 void insertEdgeInternal(Node &CalleeN);
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);
|