44   LoopTree::Loop* loop;
65   LoopFinderImpl(Graph* graph, LoopTree* loop_tree, TickCounter* tick_counter,  in LoopFinderImpl()
114     for (LoopTree::Loop* loop : loop_tree_->outer_loops_) {  in Print()
127   LoopTree* loop_tree_;
439     for (LoopTree::Loop* loop : loop_tree_->outer_loops_) {  in FinishLoopTree()
468   void SerializeLoop(LoopTree::Loop* loop) {  in SerializeLoop()
487     for (LoopTree::Loop* child : loop->children_) SerializeLoop(child);  in SerializeLoop()
500   LoopTree::Loop* ConnectLoopTree(int loop_num) {  in ConnectLoopTree()
505     LoopTree::Loop* parent = nullptr;  in ConnectLoopTree()
510         LoopTree::Loop* upper = ConnectLoopTree(i);  in ConnectLoopTree()
521   void PrintLoop(LoopTree::Loop* loop) {  in PrintLoop()
535     for (LoopTree::Loop* child : loop->children_) PrintLoop(child);  in PrintLoop()
539 LoopTree* LoopFinder::BuildLoopTree(Graph* graph, TickCounter* tick_counter,  in BuildLoopTree()
541   LoopTree* loop_tree =  in BuildLoopTree()
542       graph->zone()->New<LoopTree>(graph->NodeCount(), graph->zone());  in BuildLoopTree()
675 bool LoopFinder::HasMarkedExits(LoopTree* loop_tree,  in HasMarkedExits()
676                                 const LoopTree::Loop* loop) {  in HasMarkedExits()
711 Node* LoopTree::HeaderNode(const Loop* loop) {  in HeaderNode()