| /third_party/mesa3d/src/amd/compiler/tests/ |
| D | test_assembler.cpp | 57 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 …]
|
| D | test_insert_nops.cpp | 111 program->blocks[1].linear_preds.push_back(0);
163 program->blocks[1].linear_preds.push_back(0);
|
| D | test_optimizer_postRA.cpp | 379 program->blocks[1].linear_preds.push_back(0);
|
| D | helpers.cpp | 132 for (unsigned idx : BB.linear_preds) in finish_program()
|
| /third_party/mesa3d/src/amd/compiler/ |
| D | aco_ssa_elimination.cpp | 72 phi->opcode == aco_opcode::p_phi ? block.logical_preds : block.linear_preds; in collect_phi_info()
201 assert(block->linear_preds.size() == 2); in try_remove_invert_block()
203 Block* pred = &ctx.program->blocks[block->linear_preds[i]]; in try_remove_invert_block()
205 ctx.program->blocks[succ_idx].linear_preds[i] = pred->index; in try_remove_invert_block()
214 block->linear_preds.clear(); in try_remove_invert_block()
224 Block& pred = ctx.program->blocks[block->linear_preds[0]]; in try_remove_simple_block()
279 for (unsigned i = 0; i < succ.linear_preds.size(); i++) in try_remove_simple_block()
280 if (succ.linear_preds[i] == block->index) in try_remove_simple_block()
281 succ.linear_preds[i] = pred.index; in try_remove_simple_block()
284 block->linear_preds.clear(); in try_remove_simple_block()
[all …]
|
| D | aco_lower_phis.cpp | 72 size_t pred = block.linear_preds.size(); in get_ssa()
79 op = get_ssa(program, block.linear_preds[0], state, false); in get_ssa()
94 ops[i] = get_ssa(program, block.linear_preds[i], state, false); in get_ssa()
218 if (program->blocks[start].linear_preds.size() > 1) in init_any_pred_defined()
234 if (program->blocks[start].linear_preds.size() > 1) { in init_any_pred_defined()
259 block->linear_preds.size() == block->logical_preds.size(); in lower_divergent_bool_phi()
294 unsigned num_preds = block->linear_preds.size(); in lower_divergent_bool_phi()
306 phi->operands[i] = get_ssa(program, block->linear_preds[i], state, false); in lower_divergent_bool_phi()
|
| D | aco_spill.cpp | 225 instr->opcode == aco_opcode::p_phi ? block->logical_preds[i] : block->linear_preds[i]; in next_uses_per_block()
247 std::vector<unsigned>& preds = temp.is_linear() ? block->linear_preds : block->logical_preds; in next_uses_per_block()
471 for (unsigned pred : block.linear_preds) in get_live_in_demand()
492 assert(block->linear_preds[0] == block_idx - 1); in init_live_in_vars()
596 if (block->linear_preds.size() == 1 && !(block->kind & block_kind_loop_exit)) { in init_live_in_vars()
598 unsigned pred_idx = block->linear_preds[0]; in init_live_in_vars()
628 pred_idx = block->linear_preds[0]; in init_live_in_vars()
656 pair.first.is_linear() ? block->linear_preds : block->logical_preds; in init_live_in_vars()
699 phi->opcode == aco_opcode::p_phi ? block->logical_preds : block->linear_preds; in init_live_in_vars()
757 if (block->linear_preds.size() == 0) in add_coupling_code()
[all …]
|
| D | aco_optimizer_postRA.cpp | 65 if ((block->kind & block_kind_loop_header) || block->linear_preds.empty()) { in reset_block()
69 unsigned first_pred = block->linear_preds[0]; in reset_block()
72 std::next(block->linear_preds.begin()), block->linear_preds.end(), in reset_block()
|
| D | aco_dominance.cpp | 68 for (unsigned pred_idx : block.linear_preds) { in dominator_tree()
|
| D | aco_live_var_analysis.cpp | 210 for (unsigned pred_idx : block->linear_preds) in process_live_temps_per_block()
216 std::vector<unsigned>& preds = rc.is_linear() ? block->linear_preds : block->logical_preds; in process_live_temps_per_block()
238 insn->opcode == aco_opcode::p_phi ? block->logical_preds : block->linear_preds; in process_live_temps_per_block()
|
| D | aco_dead_code_analysis.cpp | 76 for (unsigned pred_idx : block.linear_preds) in process_block()
|
| D | aco_statistics.cpp | 487 for (unsigned pred : block.linear_preds) in collect_preasm_stats()
516 block.logical_preds.empty() && block.linear_preds.size() == 1 && in collect_preasm_stats()
518 program->blocks[block.linear_preds[0]].kind & (block_kind_branch | block_kind_invert); in collect_preasm_stats()
|
| D | aco_validate.cpp | 455 check(instr->operands.size() == block.linear_preds.size(), in validate_ir()
632 for (unsigned j = 0; j + 1 < block.linear_preds.size(); j++) in validate_ir()
633 check_block(block.linear_preds[j] < block.linear_preds[j + 1], in validate_ir()
646 if (block.linear_preds.size() > 1) { in validate_ir()
647 for (unsigned pred : block.linear_preds) in validate_ir()
|
| D | aco_lower_to_cssa.cpp | 93 phi->opcode == aco_opcode::p_phi ? block.logical_preds : block.linear_preds; in collect_parallelcopies()
199 : ctx.program->blocks[block_idx].linear_preds; in intersects()
|
| D | aco_insert_NOPs.cpp | 261 for (unsigned lin_pred : block->linear_preds) { in handle_raw_hazard_internal()
862 for (unsigned b : program->blocks[idx].linear_preds) in mitigate_hazards()
877 for (unsigned b : block.linear_preds) in mitigate_hazards()
|
| D | aco_opt_value_numbering.cpp | 458 ctx.exec_id -= program->blocks[loop_headers.back()].linear_preds.size(); in value_numbering()
459 ctx.exec_id -= block.linear_preds.size(); in value_numbering()
|
| D | aco_register_allocation.cpp | 2032 pc.first.getTemp().is_linear() ? block.linear_preds : block.logical_preds; in get_regs_for_phis()
2065 std::vector<unsigned>& preds = val.is_linear() ? block->linear_preds : block->logical_preds; in handle_live_in()
2156 phi->opcode == aco_opcode::p_phi ? loop_header.logical_preds : loop_header.linear_preds; in handle_loop_phis()
2247 instr->opcode == aco_opcode::p_phi ? block.logical_preds : block.linear_preds; in init_reg_file()
2852 if (block.linear_preds.size() <= 1) in register_allocation()
2867 for (unsigned& pred_index : block.linear_preds) { in register_allocation()
|
| D | aco_insert_exec_mask.cpp | 409 std::vector<unsigned>& preds = block->linear_preds; in add_coupling_code()
521 std::vector<unsigned>& header_preds = header->linear_preds; in add_coupling_code()
|
| D | aco_insert_waitcnt.cpp | 799 for (unsigned b : current.linear_preds) in insert_wait_states()
|
| D | aco_print_ir.cpp | 812 for (unsigned pred : block->linear_preds) in aco_print_block()
|
| D | aco_instruction_selection.cpp | 106 succ->linear_preds.emplace_back(pred_idx); in add_linear_edge()
9851 std::vector<unsigned>& preds = logical ? ctx->block->logical_preds : ctx->block->linear_preds; in visit_phi()
9902 Block* linear_else = &ctx->program->blocks[ctx->block->linear_preds[1]]; in visit_phi()
9903 Block* invert = &ctx->program->blocks[linear_else->linear_preds[0]]; in visit_phi()
9906 unsigned then_block = invert->linear_preds[0]; in visit_phi()
10202 for (unsigned i = 1; all_same && (i < block.linear_preds.size()); i++) in create_continue_phis()
10203 all_same = vals[block.linear_preds[i] - first] == vals[block.linear_preds[0] - first]; in create_continue_phis()
10207 val = vals[block.linear_preds[0] - first]; in create_continue_phis()
10210 aco_opcode::p_linear_phi, Format::PSEUDO, block.linear_preds.size(), 1)); in create_continue_phis()
10211 for (unsigned i = 0; i < block.linear_preds.size(); i++) in create_continue_phis()
[all …]
|
| D | aco_lower_to_hw_instr.cpp | 1894 for (unsigned pred : block->linear_preds) { in emit_set_mode_from_block()
2045 discard_block->linear_preds.push_back(block->index); in lower_to_hw_instr()
|
| D | aco_ir.h | 1885 std::vector<unsigned> linear_preds; member
|