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
326   CallerN.removeEdgeInternal(CalleeN.getFunction());  in removeInterSCCEdge()
328   assert(G->SCCMap.lookup(&CallerN) == this &&  in removeInterSCCEdge()
367       DEBUG(dbgs() << "LCG: Update removing " << CallerN.getFunction().getName()  in removeInterSCCEdge()
457 LazyCallGraph::SCC::removeIntraSCCEdge(Node &CallerN,  in removeIntraSCCEdge()  argument
460   CallerN.removeEdgeInternal(CalleeN.getFunction());  in removeIntraSCCEdge()
466   if (&CallerN == &CalleeN)  in removeIntraSCCEdge()
531 void LazyCallGraph::insertEdge(Node &CallerN, Function &Callee) {  in insertEdge()  argument
535   return CallerN.insertEdgeInternal(Callee);  in insertEdge()
538 void LazyCallGraph::removeEdge(Node &CallerN, Function &Callee) {  in removeEdge()  argument
542   return CallerN.removeEdgeInternal(Callee);  in removeEdge()