46                                                      Edge::Kind EK) {  in insertEdgeInternal()  argument
48   Edges.emplace_back(TargetN, EK);  in insertEdgeInternal()
51 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {  in setEdgeKind()  argument
52   Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK);  in setEdgeKind()
67                     LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {  in addEdge()  argument
72   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
993                                                Edge::Kind EK) {  in insertOutgoingEdge()  argument
995   SourceN->insertEdgeInternal(TargetN, EK);  in insertOutgoingEdge()
1489 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()  argument
1493   return SourceN->insertEdgeInternal(TargetN, EK);  in insertEdge()
1617   Edge::Kind EK = getEdgeKind(OriginalFunction, NewFunction);  in addSplitFunction()  local
1622     if (EK == Edge::Kind::Call && E.isCall() && lookupSCC(EN) == OriginalC) {  in addSplitFunction()
1649         int InsertIndex = EK == Edge::Kind::Call ? NewRC->SCCIndices[OriginalC]  in addSplitFunction()
1676   OriginalN->insertEdgeInternal(NewN, EK);  in addSplitFunction()