Searched refs:EdgeIndexMap (Results 1 – 2 of 2) sorted by relevance
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LazyCallGraph.cpp | 42 EdgeIndexMap.try_emplace(&TargetN, Edges.size()); in insertEdgeInternal() 47 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); in setEdgeKind() 51 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal() 52 if (IndexMapI == EdgeIndexMap.end()) in removeEdgeInternal() 56 EdgeIndexMap.erase(IndexMapI); in removeEdgeInternal() 61 DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap, in addEdge() argument 63 if (!EdgeIndexMap.try_emplace(&N, Edges.size()).second) in addEdge() 105 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow() 119 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F), in populateSlow() 127 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F), in populateSlow() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | LazyCallGraph.h | 258 assert(EdgeIndexMap.contains(&N) && "No such edge!"); 259 auto &E = Edges[EdgeIndexMap.find(&N)->second]; 265 auto EI = EdgeIndexMap.find(&N); in lookup() 266 if (EI == EdgeIndexMap.end()) in lookup() 291 DenseMap<Node *, int> EdgeIndexMap; variable
|