Lines Matching refs:ChainSucc
365 double shortCalls(Chain *ChainPred, Chain *ChainSucc, Edge *Edge) const { in shortCalls() argument
383 Calls += ChainSucc->ShortCalls; in shortCalls()
403 double mergeGain(Chain *ChainPred, Chain *ChainSucc, Edge *Edge) const { in mergeGain() argument
405 double CurScore = ChainPred->Score + ChainSucc->Score; in mergeGain()
408 double LongCalls = ChainPred->Samples + ChainSucc->Samples - in mergeGain()
409 shortCalls(ChainPred, ChainSucc, Edge); in mergeGain()
410 const double MergedSamples = ChainPred->Samples + ChainSucc->Samples; in mergeGain()
411 const double MergedSize = ChainPred->Size + ChainSucc->Size; in mergeGain()
416 Gain /= std::min(ChainPred->Size, ChainSucc->Size); in mergeGain()
463 Chain *ChainSucc = NodeChain[Arc->dst()]; in runPassOne() local
464 if (ChainPred == ChainSucc) in runPassOne()
467 ChainSucc->Nodes.front() == Arc->dst()) in runPassOne()
468 mergeChains(ChainPred, ChainSucc); in runPassOne()
492 Chain *ChainSucc = EdgeIt.first; in runPassTwo() local
495 if (ChainPred == ChainSucc) in runPassTwo()
502 auto ForwardGain = mergeGain(ChainPred, ChainSucc, ChainEdge); in runPassTwo()
503 auto BackwardGain = mergeGain(ChainSucc, ChainPred, ChainEdge); in runPassTwo()
532 Chain *ChainSucc = EdgeIt.first; in runPassTwo() local
535 if (BestChainPred == ChainSucc) in runPassTwo()
539 auto ForwardGain = mergeGain(BestChainPred, ChainSucc, ChainEdge); in runPassTwo()
540 auto BackwardGain = mergeGain(ChainSucc, BestChainPred, ChainEdge); in runPassTwo()