Searched refs:candidate (Results 1 – 2 of 2) sorted by relevance
90 HInstruction* candidate = phi->InputAt(0); in Run() local92 DCHECK_NE(phi, candidate); in Run()98 if (input != candidate && input != phi) { in Run()99 candidate = nullptr; in Run()105 if (candidate == nullptr) { in Run()121 phi->ReplaceWith(candidate); in Run()
1549 for (BasicBlock* candidate = iter.Next(); candidate != nullptr; candidate = iter.Next()) { in SelectTopologicalSortOrderFallBack() local1550 if (candidate->hidden || // Hidden, or in SelectTopologicalSortOrderFallBack()1551 candidate->visited || // already processed, or in SelectTopologicalSortOrderFallBack()1552 (*visited_cnt_values)[candidate->id] == 0u || // no processed predecessors, or in SelectTopologicalSortOrderFallBack()1554 !current_loop->IsBitSet(candidate->id))) { in SelectTopologicalSortOrderFallBack()1558 tmp_stack->push_back(candidate->id); in SelectTopologicalSortOrderFallBack()1584 fall_back = candidate; in SelectTopologicalSortOrderFallBack()1698 BasicBlock* candidate = iter.Next(); in ComputeTopologicalSortOrder() local1699 if (candidate == nullptr) { in ComputeTopologicalSortOrder()1714 if (candidate->hidden || // Hidden, or in ComputeTopologicalSortOrder()[all …]