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
208   CallerN.insertEdgeInternal(CalleeN);  in insertIncomingEdge()
210   assert(G->SCCMap.lookup(&CalleeN) == this && "Callee must be in this SCC.");  in insertIncomingEdge()
324 void LazyCallGraph::SCC::removeInterSCCEdge(Node &CallerN, Node &CalleeN) {  in removeInterSCCEdge()  argument
326   CallerN.removeEdgeInternal(CalleeN.getFunction());  in removeInterSCCEdge()
331   SCC &CalleeC = *G->SCCMap.lookup(&CalleeN);  in removeInterSCCEdge()
368                    << " -> " << CalleeN.getFunction().getName()  in removeInterSCCEdge()
458                                        Node &CalleeN) {  in removeIntraSCCEdge()  argument
460   CallerN.removeEdgeInternal(CalleeN.getFunction());  in removeIntraSCCEdge()
466   if (&CallerN == &CalleeN)  in removeIntraSCCEdge()
487   insert(CalleeN);  in removeIntraSCCEdge()
562           if (Node *CalleeN = Callee.dyn_cast<Node *>())  in updateGraphPtrs()  local
563             Worklist.push_back(CalleeN);  in updateGraphPtrs()