Home
last modified time | relevance | path

Searched refs:EdgeIt (Results 1 – 4 of 4) sorted by relevance

/llvm-project-15.0.7/bolt/lib/Passes/
H A DHFSortPlus.cpp205 for (auto EdgeIt : Other->Edges) { in mergeEdges() local
206 Chain *const DstChain = EdgeIt.first; in mergeEdges()
207 Edge *const DstEdge = EdgeIt.second; in mergeEdges()
491 for (auto EdgeIt : ChainPred->Edges) { in runPassTwo() local
492 Chain *ChainSucc = EdgeIt.first; in runPassTwo()
493 Edge *ChainEdge = EdgeIt.second; in runPassTwo()
523 Queue.erase(EdgeIt.second); in runPassTwo()
525 Queue.erase(EdgeIt.second); in runPassTwo()
531 for (auto EdgeIt : BestChainPred->Edges) { in runPassTwo() local
532 Chain *ChainSucc = EdgeIt.first; in runPassTwo()
[all …]
H A DExtTSPReorderAlgorithm.cpp368 for (auto EdgeIt : Other->Edges) { in mergeEdges() local
369 Chain *const DstChain = EdgeIt.first; in mergeEdges()
370 Edge *const DstEdge = EdgeIt.second; in mergeEdges()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h148 auto EdgeIt = Edges.find(Edge);
149 if (EdgeIt == Edges.end()) {
151 } else if (EdgeIt->Weight < Edge.Weight) {
153 Edges.erase(EdgeIt);
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DCodeLayout.cpp373 for (auto EdgeIt : Other->Edges) { in mergeEdges() local
374 const auto DstChain = EdgeIt.first; in mergeEdges()
375 const auto DstEdge = EdgeIt.second; in mergeEdges()