23 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()
25                     LazyCallGraph::Edge::Kind EK) {  in addEdge()
39     Edges.emplace_back(LazyCallGraph::Edge(F, EK));  in addEdge()
45                            SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in findReferences()
51       addEdge(Edges, EdgeIndexMap, *F, LazyCallGraph::Edge::Ref);  in findReferences()
81             addEdge(Edges, EdgeIndexMap, *Callee, LazyCallGraph::Edge::Call);  in Node()
96 void LazyCallGraph::Node::insertEdgeInternal(Function &Target, Edge::Kind EK) {  in insertEdgeInternal()
104 void LazyCallGraph::Node::insertEdgeInternal(Node &TargetN, Edge::Kind EK) {  in insertEdgeInternal()
109 void LazyCallGraph::Node::setEdgeKind(Function &TargetF, Edge::Kind EK) {  in setEdgeKind()
118   Edges[IndexMapI->second] = Edge();  in removeEdgeInternal()
134         EntryEdges.emplace_back(F, Edge::Ref);  in LazyCallGraph()
149   for (const Edge &E : EntryEdges)  in LazyCallGraph()
196     for (Edge &E : *N)  in verify()
233       for (Edge &E : N) {  in verify()
276     SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchInternalEdgeToCall()
293     SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchInternalEdgeToCall()
347       for (Edge &E : N.calls()) {  in switchInternalEdgeToCall()
377     SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchInternalEdgeToCall()
408         for (Edge &E : N) {  in switchInternalEdgeToCall()
472   SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchInternalEdgeToCall()
494   SourceN.setEdgeKind(TargetN.getFunction(), Edge::Ref);  in switchInternalEdgeToRef()
684   SourceN.setEdgeKind(TargetN.getFunction(), Edge::Call);  in switchOutgoingEdgeToCall()
704   SourceN.setEdgeKind(TargetN.getFunction(), Edge::Ref);  in switchOutgoingEdgeToRef()
717   SourceN.insertEdgeInternal(TargetN, Edge::Ref);  in insertInternalRefEdge()
726                                                Edge::Kind EK) {  in insertOutgoingEdge()
859         for (Edge &E : N) {  in insertIncomingRefEdge()
889   SourceN.insertEdgeInternal(TargetN, Edge::Ref);  in insertIncomingRefEdge()
921       for (Edge &E : N) {  in removeOutgoingEdge()
1195       for (Edge &E : N) {  in removeInternalRefEdge()
1229 void LazyCallGraph::insertEdge(Node &SourceN, Function &Target, Edge::Kind EK) {  in insertEdge()
1251     for (Edge &E : EntryEdges)  in updateGraphPtrs()
1258       for (Edge &E : N->Edges)  in updateGraphPtrs()
1404       for (Edge &E : N) {  in connectRefSCC()
1520   for (const LazyCallGraph::Edge &E : N)  in printNode()
1567   for (const LazyCallGraph::Edge &E : N) {  in printNodeDOT()