Searched refs:linear_preds (Results 1 - 23 of 23) sorted by relevance

/xsrc/external/mit/MesaLib/dist/src/amd/compiler/tests/
H A 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
[all...]
H A Dtest_insert_nops.cpp111 program->blocks[1].linear_preds.push_back(0);
163 program->blocks[1].linear_preds.push_back(0);
H A Dtest_optimizer_postRA.cpp379 program->blocks[1].linear_preds.push_back(0);
H A Dhelpers.cpp132 for (unsigned idx : BB.linear_preds)
/xsrc/external/mit/MesaLib/dist/src/amd/compiler/
H A Daco_ssa_elimination.cpp72 phi->opcode == aco_opcode::p_phi ? block.logical_preds : block.linear_preds;
201 assert(block->linear_preds.size() == 2);
203 Block* pred = &ctx.program->blocks[block->linear_preds[i]];
205 ctx.program->blocks[succ_idx].linear_preds[i] = pred->index;
214 block->linear_preds.clear();
224 Block& pred = ctx.program->blocks[block->linear_preds[0]];
279 for (unsigned i = 0; i < succ.linear_preds.size(); i++)
280 if (succ.linear_preds[i] == block->index)
281 succ.linear_preds[i] = pred.index;
284 block->linear_preds
[all...]
H A Daco_dominance.cpp68 for (unsigned pred_idx : block.linear_preds) {
H A Daco_lower_phis.cpp72 size_t pred = block.linear_preds.size();
79 op = get_ssa(program, block.linear_preds[0], state, false);
94 ops[i] = get_ssa(program, block.linear_preds[i], state, false);
218 if (program->blocks[start].linear_preds.size() > 1)
234 if (program->blocks[start].linear_preds.size() > 1) {
259 block->linear_preds.size() == block->logical_preds.size();
294 unsigned num_preds = block->linear_preds.size();
306 phi->operands[i] = get_ssa(program, block->linear_preds[i], state, false);
H A Daco_dead_code_analysis.cpp76 for (unsigned pred_idx : block.linear_preds)
H A Daco_spill.cpp225 instr->opcode == aco_opcode::p_phi ? block->logical_preds[i] : block->linear_preds[i];
247 std::vector<unsigned>& preds = temp.is_linear() ? block->linear_preds : block->logical_preds;
471 for (unsigned pred : block.linear_preds)
492 assert(block->linear_preds[0] == block_idx - 1);
596 if (block->linear_preds.size() == 1 && !(block->kind & block_kind_loop_exit)) {
598 unsigned pred_idx = block->linear_preds[0];
628 pred_idx = block->linear_preds[0];
656 pair.first.is_linear() ? block->linear_preds : block->logical_preds;
699 phi->opcode == aco_opcode::p_phi ? block->logical_preds : block->linear_preds;
757 if (block->linear_preds
[all...]
H A Daco_optimizer_postRA.cpp65 if ((block->kind & block_kind_loop_header) || block->linear_preds.empty()) {
69 unsigned first_pred = block->linear_preds[0];
72 std::next(block->linear_preds.begin()), block->linear_preds.end(),
H A Daco_live_var_analysis.cpp210 for (unsigned pred_idx : block->linear_preds)
216 std::vector<unsigned>& preds = rc.is_linear() ? block->linear_preds : block->logical_preds;
238 insn->opcode == aco_opcode::p_phi ? block->logical_preds : block->linear_preds;
H A Daco_statistics.cpp487 for (unsigned pred : block.linear_preds)
516 block.logical_preds.empty() && block.linear_preds.size() == 1 &&
518 program->blocks[block.linear_preds[0]].kind & (block_kind_branch | block_kind_invert);
H A Daco_validate.cpp465 check(instr->operands.size() == block.linear_preds.size(),
642 for (unsigned j = 0; j + 1 < block.linear_preds.size(); j++)
643 check_block(block.linear_preds[j] < block.linear_preds[j + 1],
656 if (block.linear_preds.size() > 1) {
657 for (unsigned pred : block.linear_preds)
H A Daco_lower_to_cssa.cpp93 phi->opcode == aco_opcode::p_phi ? block.logical_preds : block.linear_preds;
199 : ctx.program->blocks[block_idx].linear_preds;
H A Daco_opt_value_numbering.cpp458 ctx.exec_id -= program->blocks[loop_headers.back()].linear_preds.size();
459 ctx.exec_id -= block.linear_preds.size();
H A Daco_insert_NOPs.cpp261 for (unsigned lin_pred : block->linear_preds) {
862 for (unsigned b : program->blocks[idx].linear_preds)
877 for (unsigned b : block.linear_preds)
H A Daco_register_allocation.cpp2032 pc.first.getTemp().is_linear() ? block.linear_preds : block.logical_preds;
2065 std::vector<unsigned>& preds = val.is_linear() ? block->linear_preds : block->logical_preds;
2156 phi->opcode == aco_opcode::p_phi ? loop_header.logical_preds : loop_header.linear_preds;
2247 instr->opcode == aco_opcode::p_phi ? block.logical_preds : block.linear_preds;
2852 if (block.linear_preds.size() <= 1)
2867 for (unsigned& pred_index : block.linear_preds) {
H A Daco_insert_exec_mask.cpp409 std::vector<unsigned>& preds = block->linear_preds;
521 std::vector<unsigned>& header_preds = header->linear_preds;
H A Daco_insert_waitcnt.cpp799 for (unsigned b : current.linear_preds)
H A Daco_print_ir.cpp812 for (unsigned pred : block->linear_preds)
H A Daco_instruction_selection.cpp106 succ->linear_preds.emplace_back(pred_idx);
9847 std::vector<unsigned>& preds = logical ? ctx->block->logical_preds : ctx->block->linear_preds;
9898 Block* linear_else = &ctx->program->blocks[ctx->block->linear_preds[1]];
9899 Block* invert = &ctx->program->blocks[linear_else->linear_preds[0]];
9902 unsigned then_block = invert->linear_preds[0];
10198 for (unsigned i = 1; all_same && (i < block.linear_preds.size()); i++)
10199 all_same = vals[block.linear_preds[i] - first] == vals[block.linear_preds[0] - first];
10203 val = vals[block.linear_preds[0] - first];
10206 aco_opcode::p_linear_phi, Format::PSEUDO, block.linear_preds
[all...]
H A Daco_lower_to_hw_instr.cpp1894 for (unsigned pred : block->linear_preds) {
2045 discard_block->linear_preds.push_back(block->index);
H A Daco_ir.h1885 std::vector<unsigned> linear_preds; member in struct:aco::Block

Completed in 50 milliseconds