217 struct NodeT {  struct
218   NodeT(const NodeT &) = delete;
219   NodeT(NodeT &&) = default;
220   NodeT &operator=(const NodeT &) = delete;
221   NodeT &operator=(NodeT &&) = default;
223   explicit NodeT(size_t Index, uint64_t Size, uint64_t Count)  in NodeT()  function
229   bool isSuccessor(const NodeT *Other) const;
250   NodeT *ForcedSucc{nullptr};  argument
252   NodeT *ForcedPred{nullptr};  argument
266   explicit JumpT(NodeT *Source, NodeT *Target, uint64_t ExecutionCount)  in JumpT()
270   NodeT *Source;
272   NodeT *Target;
288   explicit ChainT(uint64_t Id, NodeT *Node)  in ChainT()
299     for (NodeT *Node : Nodes) {  in isCold()
329   void merge(ChainT *Other, std::vector<NodeT *> MergedBlocks) {  in merge()
361   std::vector<NodeT *> Nodes;
452 bool NodeT::isSuccessor(const NodeT *Other) const {  in isSuccessor()
459 uint64_t NodeT::outCount() const {  in outCount()
466 uint64_t NodeT::inCount() const {  in inCount()
492 using NodeIter = std::vector<NodeT *>::const_iterator;
493 static std::vector<NodeT *> EmptyList;
515   std::vector<NodeT *> getNodes() const {  in getNodes()
516     std::vector<NodeT *> Result;  in getNodes()
525   const NodeT *getFirstNode() const { return *Begin1; }  in getFirstNode()
561 MergedNodesT mergeNodes(const std::vector<NodeT *> &X,  in mergeNodes()
562                         const std::vector<NodeT *> &Y, size_t MergeOffset,  in mergeNodes()
642         NodeT &PredNode = AllNodes[Edge.src];  in initialize()
643         NodeT &SuccNode = AllNodes[Edge.dst];  in initialize()
661     for (NodeT &Node : AllNodes) {  in initialize()
671     for (NodeT &PredNode : AllNodes) {  in initialize()
674         NodeT *SuccNode = Jump->Target;  in initialize()
696     for (NodeT &Node : AllNodes) {  in mergeForcedPairs()
712     for (NodeT &Node : AllNodes) {  in mergeForcedPairs()
716       NodeT *SuccNode = Node.ForcedSucc;  in mergeForcedPairs()
728     for (NodeT &Node : AllNodes) {  in mergeForcedPairs()
730         const NodeT *CurBlock = &Node;  in mergeForcedPairs()
732           const NodeT *NextBlock = CurBlock->ForcedSucc;  in mergeForcedPairs()
829     Nodes.forEach([&](const NodeT *Node) {  in extTSPScore()
836       const NodeT *SrcBlock = Jump->Source;  in extTSPScore()
837       const NodeT *DstBlock = Jump->Target;  in extTSPScore()
872       NodeT *Node = ChainPred->Nodes[Offset - 1];  in getBestMergeGain()
889       const NodeT *SrcBlock = Jump->Source;  in getBestMergeGain()
898       const NodeT *DstBlock = Jump->Target;  in getBestMergeGain()
911         const NodeT *BB = ChainPred->Nodes[Offset - 1];  in getBestMergeGain()
912         const NodeT *BB2 = ChainPred->Nodes[Offset];  in getBestMergeGain()
1004       for (NodeT *Node : Chain->Nodes)  in concatChains()
1020   std::vector<NodeT> AllNodes;
1085         NodeT &PredNode = AllNodes[Pred];  in initialize()
1086         NodeT &SuccNode = AllNodes[Succ];  in initialize()
1099     for (NodeT &Node : AllNodes) {  in initialize()
1110     for (NodeT &PredNode : AllNodes) {  in initialize()
1112         NodeT *SuccNode = Jump->Target;  in initialize()
1139     for (NodeT &Node : AllNodes) {  in mergeChainPairs()
1305     Nodes.forEach([&](const NodeT *Node) {  in distBasedLocalityGain()
1348         for (NodeT *Node : Chain.Nodes) {  in concatChains()
1371       for (NodeT *Node : Chain->Nodes)  in concatChains()
1390   std::vector<NodeT> AllNodes;