Home
last modified time | relevance | path

Searched refs:edge_dest (Results 1 – 5 of 5) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DSyntheticCountsUtils.cpp36 if (SCCNodes.count(CGT::edge_dest(E))) in propagateFromSCC()
56 auto Callee = CGT::edge_dest(E.second); in propagateFromSCC()
69 auto Callee = CGT::edge_dest(E.second); in propagateFromSCC()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h410 static NodeRef edge_dest(EdgeRef E) { return E.getDest(); }
412 mapped_iterator<typename GraphT::Edge const *, decltype(&edge_dest)>;
416 return {N->edges_begin(), &edge_dest};
419 return {N->edges_end(), &edge_dest};
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraph.h476 static NodeRef edge_dest(EdgeRef E) { return E.second; }
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DModuleSummaryIndex.h1950 static NodeRef edge_dest(EdgeRef E) { return E.first; }
/freebsd/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp2139 static NodeRef edge_dest(EdgeRef E) { return &E->getDestinationNode(); } in edge_dest() function