140   bool SetBackwardMark(Node* to, int loop_num) {  in SetBackwardMark()  argument
141     uint32_t* tp = &backward_[to->id() * width_ + INDEX(loop_num)];  in SetBackwardMark()
143     uint32_t next = prev | BIT(loop_num);  in SetBackwardMark()
149   bool SetForwardMark(Node* to, int loop_num) {  in SetForwardMark()  argument
150     uint32_t* tp = &forward_[to->id() * width_ + INDEX(loop_num)];  in SetForwardMark()
152     uint32_t next = prev | BIT(loop_num);  in SetForwardMark()
173   bool IsInLoop(Node* node, int loop_num) {  in IsInLoop()  argument
174     int offset = node->id() * width_ + INDEX(loop_num);  in IsInLoop()
175     return backward_[offset] & forward_[offset] & BIT(loop_num);  in IsInLoop()
190       int loop_num = -1;  in PropagateBackward()  local
194         loop_num = CreateLoopInfo(node);  in PropagateBackward()
199           loop_num = CreateLoopInfo(merge);  in PropagateBackward()
206         if (loop_num > 0 && i != kAssumedLoopEntryIndex) {  in PropagateBackward()
208           if (SetBackwardMark(input, loop_num)) Queue(input);  in PropagateBackward()
211           if (PropagateBackwardMarks(node, input, loop_num)) Queue(input);  in PropagateBackward()
219     int loop_num = LoopNum(node);  in CreateLoopInfo()  local
220     if (loop_num > 0) return loop_num;  in CreateLoopInfo()
222     loop_num = ++loops_found_;  in CreateLoopInfo()
223     if (INDEX(loop_num) >= width_) ResizeBackwardMarks();  in CreateLoopInfo()
228     SetBackwardMark(node, loop_num);  in CreateLoopInfo()
229     loop_tree_->node_to_loop_num_[node->id()] = loop_num;  in CreateLoopInfo()
235         SetBackwardMark(use, loop_num);  in CreateLoopInfo()
236         loop_tree_->node_to_loop_num_[use->id()] = loop_num;  in CreateLoopInfo()
240     return loop_num;  in CreateLoopInfo()
333             int loop_num = i * 32 + j;  in FinishLoopTree()  local
334             if (loop_num == 0) continue;  in FinishLoopTree()
335             LoopInfo* loop = &loops_[loop_num - 1];  in FinishLoopTree()
339               innermost_index = loop_num;  in FinishLoopTree()
389     int loop_num = loop_tree_->LoopNum(loop);  in SerializeLoop()  local
390     LoopInfo& li = loops_[loop_num - 1];  in SerializeLoop()
396       loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;  in SerializeLoop()
403       loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;  in SerializeLoop()
413   LoopTree::Loop* ConnectLoopTree(int loop_num) {  in ConnectLoopTree()  argument
414     LoopInfo& li = loops_[loop_num - 1];  in ConnectLoopTree()
420       if (i == loop_num) continue;  in ConnectLoopTree()
429     li.loop = &loop_tree_->all_loops_[loop_num - 1];  in ConnectLoopTree()