75     for (NodeInfo& ni : info_) {  in Print()
76       if (ni.node == nullptr) continue;  in Print()
78         int index = ni.node->id() * width_ + INDEX(i);  in Print()
91       PrintF(" #%d:%s\n", ni.node->id(), ni.node->op()->mnemonic());  in Print()
322     for (NodeInfo& ni : info_) {  in FinishLoopTree()
323       if (ni.node == nullptr) continue;  in FinishLoopTree()
327       int pos = ni.node->id() * width_;  in FinishLoopTree()
345       if (LoopNum(ni.node) == innermost_index) {  in FinishLoopTree()
346         ni.next = innermost->header_list;  in FinishLoopTree()
347         innermost->header_list = ∋  in FinishLoopTree()
349         ni.next = innermost->body_list;  in FinishLoopTree()
350         innermost->body_list = ∋  in FinishLoopTree()
369     for (NodeInfo& ni : info_) {  in FinishSingleLoop()
370       if (ni.node == nullptr || !IsInLoop(ni.node, 1)) continue;  in FinishSingleLoop()
371       if (LoopNum(ni.node) == 1) {  in FinishSingleLoop()
372         ni.next = li->header_list;  in FinishSingleLoop()
373         li->header_list = ∋  in FinishSingleLoop()
375         ni.next = li->body_list;  in FinishSingleLoop()
376         li->body_list = ∋  in FinishSingleLoop()
394     for (NodeInfo* ni = li.header_list; ni != nullptr; ni = ni->next) {  in SerializeLoop()  local
395       loop_tree_->loop_nodes_.push_back(ni->node);  in SerializeLoop()
396       loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;  in SerializeLoop()
401     for (NodeInfo* ni = li.body_list; ni != nullptr; ni = ni->next) {  in SerializeLoop()  local
402       loop_tree_->loop_nodes_.push_back(ni->node);  in SerializeLoop()
403       loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;  in SerializeLoop()
417     NodeInfo& ni = info(li.header);  in ConnectLoopTree()  local
421       if (IsInLoop(ni.node, i)) {  in ConnectLoopTree()