Home
last modified time | relevance | path

Searched refs:linear_preds (Results 1 – 19 of 19) sorted by relevance

/external/mesa3d/src/amd/compiler/tests/
Dtest_assembler.cpp57 program->blocks[1].linear_preds.push_back(0u);
86 program->blocks[2].linear_preds.push_back(0u);
87 program->blocks[2].linear_preds.push_back(1u);
118 program->blocks[1].linear_preds.push_back(0u);
119 program->blocks[2].linear_preds.push_back(0u);
120 program->blocks[2].linear_preds.push_back(1u);
147 program->blocks[0].linear_preds.push_back(0u);
148 program->blocks[1].linear_preds.push_back(0u);
176 program->blocks[0].linear_preds.push_back(0u);
177 program->blocks[1].linear_preds.push_back(0u);
[all …]
Dhelpers.cpp127 for (unsigned idx : BB.linear_preds) in finish_program()
/external/mesa3d/src/amd/compiler/
Daco_ssa_elimination.cpp58 …tor<unsigned>& preds = phi->opcode == aco_opcode::p_phi ? block.logical_preds : block.linear_preds; in collect_phi_info()
174 assert(block->linear_preds.size() == 2); in try_remove_invert_block()
176 Block *pred = &ctx.program->blocks[block->linear_preds[i]]; in try_remove_invert_block()
178 ctx.program->blocks[succ_idx].linear_preds[i] = pred->index; in try_remove_invert_block()
187 block->linear_preds.clear(); in try_remove_invert_block()
196 Block& pred = ctx.program->blocks[block->linear_preds[0]]; in try_remove_simple_block()
251 for (unsigned i = 0; i < succ.linear_preds.size(); i++) in try_remove_simple_block()
252 if (succ.linear_preds[i] == block->index) in try_remove_simple_block()
253 succ.linear_preds[i] = pred.index; in try_remove_simple_block()
256 block->linear_preds.clear(); in try_remove_simple_block()
[all …]
Daco_lower_phis.cpp64 size_t pred = block.linear_preds.size(); in get_ssa()
72 Operand op = get_ssa(program, block.linear_preds[0], state, false); in get_ssa()
84 ops[i] = get_ssa(program, block.linear_preds[i], state, false); in get_ssa()
178 assert(block->logical_preds.size() == block->linear_preds.size()); in lower_divergent_bool_phi()
238 unsigned num_preds = block->linear_preds.size(); in lower_divergent_bool_phi()
249 phi->operands[i] = get_ssa(program, block->linear_preds[i], state, false); in lower_divergent_bool_phi()
Daco_spill.cpp190 block->linear_preds[i]; in next_uses_per_block()
209 std::vector<unsigned>& preds = temp.is_linear() ? block->linear_preds : block->logical_preds; in next_uses_per_block()
371 assert(block->linear_preds[0] == block_idx - 1); in init_live_in_vars()
471 for (unsigned pred : block->linear_preds) { in init_live_in_vars()
514 if (block->linear_preds.size() == 1 && !(block->kind & block_kind_loop_exit)) { in init_live_in_vars()
516 unsigned pred_idx = block->linear_preds[0]; in init_live_in_vars()
539 pred_idx = block->linear_preds[0]; in init_live_in_vars()
567 …std::vector<unsigned>& preds = pair.first.is_linear() ? block->linear_preds : block->logical_preds; in init_live_in_vars()
604 …r<unsigned>& preds = phi->opcode == aco_opcode::p_phi ? block->logical_preds : block->linear_preds; in init_live_in_vars()
656 for (unsigned pred : block->linear_preds) { in init_live_in_vars()
[all …]
Daco_dominance.cpp70 for (unsigned pred_idx : block.linear_preds) { in dominator_tree()
Daco_dead_code_analysis.cpp73 for (unsigned pred_idx : block.linear_preds) in process_block()
Daco_validate.cpp400 …check(instr->operands.size() == block.linear_preds.size(), "Number of Operands does not match numb… in validate_ir()
494 for (unsigned j = 0; j + 1 < block.linear_preds.size(); j++) in validate_ir()
495 …check_block(block.linear_preds[j] < block.linear_preds[j + 1], "linear predecessors must be sorted… in validate_ir()
504 if (block.linear_preds.size() > 1) { in validate_ir()
505 for (unsigned pred : block.linear_preds) in validate_ir()
Daco_live_var_analysis.cpp212 std::vector<unsigned>& preds = rc.is_linear() ? block->linear_preds : block->logical_preds; in process_live_temps_per_block()
234 : block->linear_preds; in process_live_temps_per_block()
Daco_lower_to_cssa.cpp71 std::vector<unsigned>& preds = is_logical ? block.logical_preds : block.linear_preds; in collect_phi_info()
Daco_insert_NOPs.cpp233 for (unsigned lin_pred : block->linear_preds) { in handle_raw_hazard_internal()
781 for (unsigned b : program->blocks[idx].linear_preds) in mitigate_hazards()
796 for (unsigned b : block.linear_preds) in mitigate_hazards()
Daco_opt_value_numbering.cpp467 ctx.exec_id -= program->blocks[loop_headers.back()].linear_preds.size(); in value_numbering()
468 ctx.exec_id -= block.linear_preds.size(); in value_numbering()
Daco_register_allocation.cpp1585 std::vector<unsigned>& preds = val.is_linear() ? block->linear_preds : block->logical_preds; in handle_live_in()
1968 …std::vector<unsigned>& preds = pc.first.getTemp().is_linear() ? block.linear_preds : block.logical… in register_allocation()
2406 for (unsigned pred_idx : succ.linear_preds) { in register_allocation()
2417 …or<unsigned> preds = phi->definitions[0].getTemp().is_linear() ? succ.linear_preds : succ.logical_… in register_allocation()
2428 …ctor<unsigned> preds = instr->opcode == aco_opcode::p_phi ? succ.logical_preds : succ.linear_preds; in register_allocation()
2456 if (block.linear_preds.size() <= 1) in register_allocation()
2471 for (unsigned& pred_index : block.linear_preds) { in register_allocation()
Daco_print_ir.cpp854 for (unsigned pred : block->linear_preds) in aco_print_block()
Daco_insert_exec_mask.cpp375 std::vector<unsigned>& preds = block->linear_preds; in add_coupling_code()
479 std::vector<unsigned>& header_preds = header->linear_preds; in add_coupling_code()
Daco_insert_waitcnt.cpp981 for (unsigned b : current.linear_preds) in insert_wait_states()
Daco_instruction_selection.cpp104 succ->linear_preds.emplace_back(pred_idx); in add_linear_edge()
9318 std::vector<unsigned>& preds = logical ? ctx->block->logical_preds : ctx->block->linear_preds; in visit_phi()
9366 Block *linear_else = &ctx->program->blocks[ctx->block->linear_preds[1]]; in visit_phi()
9367 Block *invert = &ctx->program->blocks[linear_else->linear_preds[0]]; in visit_phi()
9370 unsigned then_block = invert->linear_preds[0]; in visit_phi()
9720 for (unsigned i = 1; all_same && (i < block.linear_preds.size()); i++) in create_continue_phis()
9721 all_same = vals[block.linear_preds[i] - first] == vals[block.linear_preds[0] - first]; in create_continue_phis()
9725 val = vals[block.linear_preds[0] - first]; in create_continue_phis()
9728 aco_opcode::p_linear_phi, Format::PSEUDO, block.linear_preds.size(), 1)); in create_continue_phis()
9729 for (unsigned i = 0; i < block.linear_preds.size(); i++) in create_continue_phis()
[all …]
Daco_ir.h1484 std::vector<unsigned> linear_preds; member
Daco_lower_to_hw_instr.cpp1751 for (unsigned pred : block->linear_preds) { in lower_to_hw_instr()
1887 discard_block->linear_preds.push_back(block->index); in lower_to_hw_instr()