1870   for (BasicBlock* candidate = iter.Next(); candidate != nullptr; candidate = iter.Next()) {  in SelectTopologicalSortOrderFallBack()  local
1871     if (candidate->hidden ||                            // Hidden, or  in SelectTopologicalSortOrderFallBack()
1872         candidate->visited ||                           // already processed, or  in SelectTopologicalSortOrderFallBack()
1873         (*visited_cnt_values)[candidate->id] == 0u ||   // no processed predecessors, or  in SelectTopologicalSortOrderFallBack()
1875          !current_loop->IsBitSet(candidate->id))) {  in SelectTopologicalSortOrderFallBack()
1879     tmp_stack->push_back(candidate->id);  in SelectTopologicalSortOrderFallBack()
1905       fall_back = candidate;  in SelectTopologicalSortOrderFallBack()
2010         BasicBlock* candidate = iter.Next();  in ComputeTopologicalSortOrder()  local
2011         if (candidate == nullptr) {  in ComputeTopologicalSortOrder()
2026         if (candidate->hidden ||                            // Hidden, or  in ComputeTopologicalSortOrder()
2027             candidate->visited ||                           // already processed, or  in ComputeTopologicalSortOrder()
2028             visited_cnt_values[candidate->id] == 0u ||      // no processed predecessors, or  in ComputeTopologicalSortOrder()
2030              !loop_head_reachable_from[loop_head_stack.back()]->IsBitSet(candidate->id))) {  in ComputeTopologicalSortOrder()
2034         for (BasicBlockId pred_id : candidate->predecessors) {  in ComputeTopologicalSortOrder()
2037           if (pred_bb != candidate && !pred_bb->visited &&  in ComputeTopologicalSortOrder()
2038               !pred_bb->dominators->IsBitSet(candidate->id)) {  in ComputeTopologicalSortOrder()
2039             candidate = nullptr;  // Set candidate to null to indicate failure.  in ComputeTopologicalSortOrder()
2043         if (candidate != nullptr) {  in ComputeTopologicalSortOrder()
2044           bb = candidate;  in ComputeTopologicalSortOrder()