Home
last modified time | relevance | path

Searched refs:BestChainSucc (Results 1 – 3 of 3) sorted by relevance

/llvm-project-15.0.7/bolt/lib/Passes/
H A DHFSortPlus.cpp517 Chain *BestChainSucc = BestEdge->succChain(); in runPassTwo() local
518 if (BestChainPred == BestChainSucc || BestEdge->gain() <= 0.0) in runPassTwo()
524 for (std::pair<Chain *, Edge *> EdgeIt : BestChainSucc->Edges) in runPassTwo()
528 mergeChains(BestChainPred, BestChainSucc); in runPassTwo()
H A DExtTSPReorderAlgorithm.cpp607 Chain *BestChainSucc = nullptr; in mergeChainPairs() local
627 BestChainSucc))) { in mergeChainPairs()
630 BestChainSucc = ChainSucc; in mergeChainPairs()
640 mergeChains(BestChainPred, BestChainSucc, BestGain.mergeOffset(), in mergeChainPairs()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DCodeLayout.cpp596 Chain *BestChainSucc = nullptr; in mergeChainPairs() local
620 BestChainSucc))) { in mergeChainPairs()
623 BestChainSucc = ChainSucc; in mergeChainPairs()
633 mergeChains(BestChainPred, BestChainSucc, BestGain.mergeOffset(), in mergeChainPairs()