Lines Matching refs:loop_num
155 bool SetBackwardMark(Node* to, int loop_num) {
156 uint32_t* tp = &backward_[to->id() * width_ + INDEX(loop_num)];
158 uint32_t next = prev | BIT(loop_num);
164 bool SetForwardMark(Node* to, int loop_num) {
165 uint32_t* tp = &forward_[to->id() * width_ + INDEX(loop_num)];
167 uint32_t next = prev | BIT(loop_num);
188 bool IsInLoop(Node* node, int loop_num) {
189 int offset = node->id() * width_ + INDEX(loop_num);
190 return backward_[offset] & forward_[offset] & BIT(loop_num);
206 int loop_num = -1;
210 loop_num = CreateLoopInfo(node);
215 loop_num = CreateLoopInfo(merge);
234 if (SetBackwardMark(input, loop_num) ||
239 // Entry or normal edge. Propagate all marks except loop_num.
242 if (PropagateBackwardMarks(node, input, loop_num) ||
254 int loop_num = LoopNum(node);
255 if (loop_num > 0) return loop_num;
257 loop_num = ++loops_found_;
258 if (INDEX(loop_num) >= width_) ResizeBackwardMarks();
263 SetLoopMarkForLoopHeader(node, loop_num);
264 return loop_num;
267 void SetLoopMark(Node* node, int loop_num) {
269 SetBackwardMark(node, loop_num);
270 loop_tree_->node_to_loop_num_[node->id()] = loop_num;
273 void SetLoopMarkForLoopHeader(Node* node, int loop_num) {
275 SetLoopMark(node, loop_num);
278 SetLoopMark(use, loop_num);
285 SetLoopMark(use, loop_num);
289 SetLoopMark(exit_use, loop_num);
377 void AddNodeToLoop(NodeInfo* node_info, TempLoopInfo* loop, int loop_num) {
378 if (LoopNum(node_info->node) == loop_num) {
417 int loop_num = i * 32 + j;
418 if (loop_num == 0) continue;
419 TempLoopInfo* loop = &loops_[loop_num - 1];
423 innermost_index = loop_num;
469 int loop_num = loop_tree_->LoopNum(loop);
470 TempLoopInfo& li = loops_[loop_num - 1];
476 loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;
483 loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;
493 loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;
500 LoopTree::Loop* ConnectLoopTree(int loop_num) {
501 TempLoopInfo& li = loops_[loop_num - 1];
507 if (i == loop_num) continue;
516 li.loop = &loop_tree_->all_loops_[loop_num - 1];