Searched refs:loop_head_stack_ (Results 1 – 2 of 2) sorted by relevance
122 while (loop_head_stack_->size() != 0u && in Next()123 (*loop_ends_)[loop_head_stack_->back().first] == idx_) { in Next()124 loop_head_stack_->pop_back(); in Next()137 loop_head_stack_->push_back(std::make_pair(idx, false)); // Not recalculating. in Next()159 while (loop_head_stack_->size() != 0u && in Next()160 (*loop_ends_)[loop_head_stack_->back().first] == idx_) { in Next()161 auto top = loop_head_stack_->back(); in Next()164 loop_head_stack_->pop_back(); in Next()169 loop_head_stack_->push_back(std::make_pair(loop_head_idx, true)); in Next()191 loop_head_stack_->push_back(std::make_pair(idx, recalculating)); in Next()
338 loop_head_stack_(mir_graph_->GetTopologicalSortOrderLoopHeadStack()) { in TopologicalSortIterator()353 ArenaVector<std::pair<uint16_t, bool>>* const loop_head_stack_; variable378 loop_head_stack_(mir_graph_->GetTopologicalSortOrderLoopHeadStack()) { in LoopRepeatingTopologicalSortIterator()384 DCHECK_EQ(loop_head_stack_->size(), 0u); in LoopRepeatingTopologicalSortIterator()388 DCHECK_EQ(loop_head_stack_->size(), 0u); in ~LoopRepeatingTopologicalSortIterator()400 ArenaVector<std::pair<uint16_t, bool>>* const loop_head_stack_; variable