78 void LazyCallGraph::Node::insertEdgeInternal(Function &Callee) {  in insertEdgeInternal()  argument
79   if (Node *N = G->lookup(Callee))  in insertEdgeInternal()
82   CalleeIndexMap.insert(std::make_pair(&Callee, Callees.size()));  in insertEdgeInternal()
83   Callees.push_back(&Callee);  in insertEdgeInternal()
91 void LazyCallGraph::Node::removeEdgeInternal(Function &Callee) {  in removeEdgeInternal()  argument
92   auto IndexMapI = CalleeIndexMap.find(&Callee);  in removeEdgeInternal()
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()
560       for (auto &Callee : N->Callees)  in updateGraphPtrs()  local
561         if (!Callee.isNull())  in updateGraphPtrs()
562           if (Node *CalleeN = Callee.dyn_cast<Node *>())  in updateGraphPtrs()