reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1025 return insertEdge(get(Source), get(Target), EK); 1025 return insertEdge(get(Source), get(Target), EK); 1033 return removeEdge(get(Source), get(Target)); 1033 return removeEdge(get(Source), get(Target));lib/Analysis/LazyCallGraph.cpp
107 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), 121 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F), 129 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F), 173 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref); 185 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref); 201 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), 1778 printNode(OS, G.get(F)); 1811 printNodeDOT(OS, G.get(F));unittests/Analysis/LazyCallGraphTest.cpp
420 LazyCallGraph::Node &A = CG.get(lookupFunction(*M, "a")); 421 LazyCallGraph::Node &B = CG.get(lookupFunction(*M, "b")); 427 LazyCallGraph::Node &C = CG.get(lookupFunction(*M, "c")); 460 LazyCallGraph::Node &D1 = CG.get(lookupFunction(*M, "d1")); 461 LazyCallGraph::Node &A1 = CG.get(lookupFunction(*M, "a1")); 2125 LazyCallGraph::Node &AN = CG.get(lookupFunction(*M, "a")); 2126 LazyCallGraph::Node &BN = CG.get(lookupFunction(*M, "b")); 2127 LazyCallGraph::Node &CN = CG.get(lookupFunction(*M, "c")); 2128 LazyCallGraph::Node &DN = CG.get(lookupFunction(*M, "d")); 2129 LazyCallGraph::Node &DeadN = CG.get(lookupFunction(*M, "dead"));