Home
last modified time | relevance | path

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

/llvm-project-15.0.7/bolt/lib/Passes/
H A DHFSortPlus.cpp516 Chain *BestChainPred = BestEdge->predChain(); in runPassTwo() local
518 if (BestChainPred == BestChainSucc || BestEdge->gain() <= 0.0) in runPassTwo()
522 for (std::pair<Chain *, Edge *> EdgeIt : BestChainPred->Edges) in runPassTwo()
528 mergeChains(BestChainPred, BestChainSucc); in runPassTwo()
531 for (auto EdgeIt : BestChainPred->Edges) { in runPassTwo()
535 if (BestChainPred == ChainSucc) in runPassTwo()
539 auto ForwardGain = mergeGain(BestChainPred, ChainSucc, ChainEdge); in runPassTwo()
540 auto BackwardGain = mergeGain(ChainSucc, BestChainPred, ChainEdge); in runPassTwo()
541 ChainEdge->setMergeGain(BestChainPred, ForwardGain, BackwardGain); in runPassTwo()
H A DExtTSPReorderAlgorithm.cpp606 Chain *BestChainPred = nullptr; in mergeChainPairs() local
626 compareChainPairs(ChainPred, ChainSucc, BestChainPred, in mergeChainPairs()
629 BestChainPred = ChainPred; in mergeChainPairs()
640 mergeChains(BestChainPred, BestChainSucc, BestGain.mergeOffset(), in mergeChainPairs()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DCodeLayout.cpp595 Chain *BestChainPred = nullptr; in mergeChainPairs() local
619 compareChainPairs(ChainPred, ChainSucc, BestChainPred, in mergeChainPairs()
622 BestChainPred = ChainPred; in mergeChainPairs()
633 mergeChains(BestChainPred, BestChainSucc, BestGain.mergeOffset(), in mergeChainPairs()