Searched refs:ChainPred (Results 1 – 2 of 2) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | CodeLayout.cpp | 753 for (ChainT *ChainPred : HotChains) { in mergeColdChains()
755 for (const auto &[ChainSucc, Edge] : ChainPred->Edges) { in mergeColdChains()
761 if (ChainPred->numBlocks() + ChainSucc->numBlocks() >= MaxChainSize) in mergeColdChains()
767 const double ChainPredDensity = ChainPred->density(); in extTSPScore()
778 MergeGainT CurGain = getBestMergeGain(ChainPred, ChainSucc, Edge); in extTSPScore()
784 compareChainPairs(ChainPred, ChainSucc, BestChainPred, in extTSPScore()
787 BestChainPred = ChainPred;
851 MergeGainT getBestMergeGain(ChainT *ChainPred, ChainT *ChainSucc, in getBestMergeGain()
853 if (Edge->hasCachedMergeGain(ChainPred, ChainSucc)) in getBestMergeGain()
854 return Edge->getCachedMergeGain(ChainPred, ChainSuc in getBestMergeGain()
794 getBestMergeGain(ChainT * ChainPred,ChainT * ChainSucc,ChainEdge * Edge) const getBestMergeGain() argument
872 computeMergeGain(const ChainT * ChainPred,const ChainT * ChainSucc,const std::vector<JumpT * > & Jumps,size_t MergeOffset,MergeTypeT MergeType) const computeMergeGain() argument
[all...] |
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGFast.cpp | 273 SDep ChainPred; in CopyAndMoveSuccessors() local
280 ChainPred = Pred; in CopyAndMoveSuccessors()
294 if (ChainPred.getSUnit()) { in CopyAndMoveSuccessors()
295 RemovePred(SU, ChainPred); in CopyAndMoveSuccessors()
297 AddPred(LoadSU, ChainPred); in CopyAndMoveSuccessors()
|