reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
258 iterator begin() { return iterator(Edges.begin(), Edges.end()); } 258 iterator begin() { return iterator(Edges.begin(), Edges.end()); } 259 iterator end() { return iterator(Edges.end(), Edges.end()); } 259 iterator end() { return iterator(Edges.end(), Edges.end()); } 261 Edge &operator[](int i) { return Edges[i]; } 264 auto &E = Edges[EdgeIndexMap.find(&N)->second]; 273 auto &E = Edges[EI->second]; 278 return call_iterator(Edges.begin(), Edges.end()); 278 return call_iterator(Edges.begin(), Edges.end()); 280 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } 280 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } 287 for (auto &E : Edges)lib/Analysis/LazyCallGraph.cpp
44 EdgeIndexMap.insert({&TargetN, Edges.size()}); 45 Edges.emplace_back(TargetN, EK); 49 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); 57 Edges[IndexMapI->second] = Edge(); 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), 1400 SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()}); 1403 Edge &E = SourceN->Edges[InsertResult.first->second]; 1409 SourceN->Edges.emplace_back(TargetN, Edge::Call); 1433 SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()}); 1439 SourceN->Edges.emplace_back(TargetN, Edge::Ref);