Lines Matching full:loop_tree_
61 loop_tree_(loop_tree),
100 for (LoopTree::Loop* loop : loop_tree_->outer_loops_) {
113 LoopTree* loop_tree_;
120 return static_cast<int>(loop_tree_->node_to_loop_num_.size());
227 loop_tree_->NewLoop();
229 loop_tree_->node_to_loop_num_[node->id()] = loop_num;
236 loop_tree_->node_to_loop_num_[use->id()] = loop_num;
295 int LoopNum(Node* node) { return loop_tree_->node_to_loop_num_[node->id()]; }
312 DCHECK(loops_found_ == static_cast<int>(loop_tree_->all_loops_.size()));
356 loop_tree_->loop_nodes_.reserve(count);
357 for (LoopTree::Loop* loop : loop_tree_->outer_loops_) {
366 li->loop = &loop_tree_->all_loops_[0];
367 loop_tree_->SetParent(nullptr, li->loop);
382 loop_tree_->loop_nodes_.reserve(count);
389 int loop_num = loop_tree_->LoopNum(loop);
393 loop->header_start_ = static_cast<int>(loop_tree_->loop_nodes_.size());
395 loop_tree_->loop_nodes_.push_back(ni->node);
396 loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;
400 loop->body_start_ = static_cast<int>(loop_tree_->loop_nodes_.size());
402 loop_tree_->loop_nodes_.push_back(ni->node);
403 loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;
409 loop->body_end_ = static_cast<int>(loop_tree_->loop_nodes_.size());
429 li.loop = &loop_tree_->all_loops_[loop_num - 1];
430 loop_tree_->SetParent(parent, li.loop);
439 PrintF(" H#%d", loop_tree_->loop_nodes_[i++]->id());
442 PrintF(" B#%d", loop_tree_->loop_nodes_[i++]->id());
