211 struct JumpT;
254   std::vector<JumpT *> OutJumps;
256   std::vector<JumpT *> InJumps;
260 struct JumpT {  struct
261   JumpT(const JumpT &) = delete;
262   JumpT(JumpT &&) = default;
263   JumpT &operator=(const JumpT &) = delete;
264   JumpT &operator=(JumpT &&) = default;
266   explicit JumpT(NodeT *Source, NodeT *Target, uint64_t ExecutionCount)  in JumpT()  argument
375   explicit ChainEdge(JumpT *Jump)  in ChainEdge()
385   const std::vector<JumpT *> &jumps() const { return Jumps; }  in jumps()
387   void appendJump(JumpT *Jump) { Jumps.push_back(Jump); }  in appendJump()
437   std::vector<JumpT *> Jumps;
453   for (JumpT *Jump : OutJumps)  in isSuccessor()
461   for (JumpT *Jump : OutJumps)  in outCount()
468   for (JumpT *Jump : InJumps)  in inCount()
538   MergedJumpsT(const std::vector<JumpT *> *Jumps1,  in MergedJumpsT()
539                const std::vector<JumpT *> *Jumps2 = nullptr) {  in MergedJumpsT()
548         for (JumpT *Jump : *Jumps)  in forEach()
553   std::array<const std::vector<JumpT *> *, 2> JumpArray{nullptr, nullptr};
652     for (JumpT &Jump : AllJumps) {  in initialize()
672       for (JumpT *Jump : PredNode.OutJumps) {  in initialize()
835     Jumps.forEach([&](const JumpT *Jump) {  in extTSPScore()
888     for (JumpT *Jump : ChainSucc->Nodes.front()->InJumps) {  in getBestMergeGain()
897     for (JumpT *Jump : ChainSucc->Nodes.back()->OutJumps) {  in getBestMergeGain()
1023   std::vector<JumpT> AllJumps;
1111       for (JumpT *Jump : PredNode.OutJumps) {  in initialize()
1312     Jumps.forEach([&](const JumpT *Jump) {  in distBasedLocalityGain()
1393   std::vector<JumpT> AllJumps;