Lines Matching refs:Jump

160 class Jump;
189 std::vector<Jump *> OutJumps;
191 std::vector<Jump *> InJumps;
200 class Jump { class
202 Jump(const Jump &) = delete;
203 Jump(Jump &&) = default;
204 Jump &operator=(const Jump &) = delete;
205 Jump &operator=(Jump &&) = default;
215 explicit Jump(Block *Source, Block *Target, uint64_t ExecutionCount) in Jump() function in __anon97d149770111::Jump
308 explicit ChainEdge(Jump *Jump) in ChainEdge() argument
309 : SrcChain(Jump->Source->CurChain), DstChain(Jump->Target->CurChain), in ChainEdge()
310 Jumps(1, Jump) {} in ChainEdge()
312 const std::vector<Jump *> &jumps() const { return Jumps; } in jumps()
321 void appendJump(Jump *Jump) { Jumps.push_back(Jump); } in appendJump() argument
358 std::vector<Jump *> Jumps;
517 for (auto &Jump : Block.OutJumps) { in initialize() local
518 auto SuccBlock = Jump->Target; in initialize()
523 CurEdge->appendJump(Jump); in initialize()
527 AllEdges.emplace_back(Jump); in initialize()
659 const std::vector<Jump *> &Jumps) const { in extTSPScore()
669 for (auto &Jump : Jumps) { in extTSPScore() local
670 const auto SrcBlock = Jump->Source; in extTSPScore()
671 const auto DstBlock = Jump->Target; in extTSPScore()
673 DstBlock->EstimatedAddr, Jump->ExecutionCount); in extTSPScore()
726 for (auto &Jump : ChainSucc->blocks().front()->InJumps) { in getBestMergeGain() local
727 const auto SrcBlock = Jump->Source; in getBestMergeGain()
735 for (auto &Jump : ChainSucc->blocks().back()->OutJumps) { in getBestMergeGain() local
736 const auto DstBlock = Jump->Source; in getBestMergeGain()
763 const std::vector<Jump *> &Jumps, in computeMergeGain()
897 std::vector<Jump> AllJumps;