Home
last modified time | relevance | path

Searched refs:loop_tree_ (Results 1 – 4 of 4) sorted by relevance

/third_party/node/deps/v8/src/compiler/
Dloop-analysis.cc74 loop_tree_(loop_tree),
114 for (LoopTree::Loop* loop : loop_tree_->outer_loops_) { in Print()
127 LoopTree* loop_tree_; member in v8::internal::compiler::LoopFinderImpl
135 return static_cast<int>(loop_tree_->node_to_loop_num_.size()); in num_nodes()
262 loop_tree_->NewLoop(); in CreateLoopInfo()
270 loop_tree_->node_to_loop_num_[node->id()] = loop_num; in SetLoopMark()
362 int LoopNum(Node* node) { return loop_tree_->node_to_loop_num_[node->id()]; } in LoopNum()
395 DCHECK(loops_found_ == static_cast<int>(loop_tree_->all_loops_.size())); in FinishLoopTree()
438 loop_tree_->loop_nodes_.reserve(count); in FinishLoopTree()
439 for (LoopTree::Loop* loop : loop_tree_->outer_loops_) { in FinishLoopTree()
[all …]
Dloop-peeling.cc138 for (Node* node : loop_tree_->HeaderNodes(loop)) { in Peel()
143 copier.CopyNodes(graph_, tmp_zone_, dead, loop_tree_->BodyNodes(loop), in Peel()
149 Node* loop_node = loop_tree_->GetLoopControl(loop); in Peel()
163 for (Node* node : loop_tree_->HeaderNodes(loop)) { in Peel()
183 for (Node* node : loop_tree_->HeaderNodes(loop)) { in Peel()
193 for (Node* exit : loop_tree_->ExitNodes(loop)) { in Peel()
230 for (Node* node : loop_tree_->HeaderNodes(loop)) { in PeelInnerLoops()
262 for (LoopTree::Loop* loop : loop_tree_->outer_loops()) { in PeelInnerLoopsOfTree()
Dloop-peeling.h42 loop_tree_(loop_tree), in LoopPeeler()
47 return LoopFinder::HasMarkedExits(loop_tree_, loop); in CanPeel()
59 LoopTree* const loop_tree_; variable
Dloop-analysis.h180 static bool HasMarkedExits(LoopTree* loop_tree_, const LoopTree::Loop* loop);