Searched refs:ChainEdge (Results 1 – 3 of 3) sorted by relevance
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | CodeLayout.cpp | 162 class ChainEdge;
246 ChainEdge *getEdge(Chain *Other) const { in getEdge()
301 class ChainEdge { class
303 ChainEdge(const ChainEdge &) = delete;
304 ChainEdge(ChainEdge &&) = default;
305 ChainEdge &operator=(const ChainEdge &) = delete;
306 ChainEdge &operator=(ChainEdge &&) = default;
308 explicit ChainEdge(Jump *Jump) in ChainEdge() function in __anon97d149770111::ChainEdge
323 void moveJumps(ChainEdge *Other) { in moveJumps()
603 auto ChainEdge = EdgeIter.second; in mergeChainPairs() local
[all …]
|
| /llvm-project-15.0.7/bolt/lib/Passes/ |
| H A D | HFSortPlus.cpp | 493 Edge *ChainEdge = EdgeIt.second; in runPassTwo() local
498 if (ChainEdge->gain() != -1.0) in runPassTwo()
502 auto ForwardGain = mergeGain(ChainPred, ChainSucc, ChainEdge); in runPassTwo()
503 auto BackwardGain = mergeGain(ChainSucc, ChainPred, ChainEdge); in runPassTwo()
504 ChainEdge->setMergeGain(ChainPred, ForwardGain, BackwardGain); in runPassTwo()
505 if (ChainEdge->gain() > 0.0) in runPassTwo()
506 Queue.insert(ChainEdge); in runPassTwo()
533 Edge *ChainEdge = EdgeIt.second; in runPassTwo() local
539 auto ForwardGain = mergeGain(BestChainPred, ChainSucc, ChainEdge); in runPassTwo()
542 if (ChainEdge->gain() > 0.0) in runPassTwo()
[all …]
|
| H A D | ExtTSPReorderAlgorithm.cpp | 614 Edge *ChainEdge = EdgeIter.second; in mergeChainPairs() local
620 MergeGainTy CurGain = mergeGain(ChainPred, ChainSucc, ChainEdge); in mergeChainPairs()
|