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