Searched refs:candidate (Results 1 – 4 of 4) sorted by relevance
118 HInstruction* candidate = phi->InputAt(0); in Run() local123 DCHECK_NE(phi, candidate); in Run()129 if (input != candidate && input != phi) { in Run()130 candidate = nullptr; in Run()136 if (candidate == nullptr) { in Run()152 phi->ReplaceWith(candidate); in Run()
429 LiveRange* candidate = FindRangeAtOrAfter(position, range_search_start_); in Covers() local430 range_search_start_ = candidate; in Covers()431 return (candidate != nullptr && candidate->GetStart() <= position); in Covers()436 LiveRange* candidate = FindRangeAtOrAfter(position, first_range_); in CoversSlow() local437 return candidate != nullptr && candidate->GetStart() <= position; in CoversSlow()
1870 for (BasicBlock* candidate = iter.Next(); candidate != nullptr; candidate = iter.Next()) { in SelectTopologicalSortOrderFallBack() local1871 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() local2011 if (candidate == nullptr) { in ComputeTopologicalSortOrder()2026 if (candidate->hidden || // Hidden, or in ComputeTopologicalSortOrder()[all …]
1304 BasicBlock* candidate = mir_graph_->GetBasicBlock(dfs_id); in SpecialMIR2LIR() local1305 if (candidate->block_type == kDalvikByteCode) { in SpecialMIR2LIR()1306 bb = candidate; in SpecialMIR2LIR()