Home
last modified time | relevance | path

Searched refs:linear_succs (Results 1 – 9 of 9) sorted by relevance

/external/mesa3d/src/amd/compiler/
Daco_ssa_elimination.cpp148 if (block->linear_succs.size() != 1 || in try_remove_merge_block()
149 !(ctx.program->blocks[block->linear_succs[0]].kind & block_kind_merge)) in try_remove_merge_block()
164 assert(block->linear_succs.size() == 2); in try_remove_invert_block()
166 if (block->linear_succs[0] != block->linear_succs[1]) in try_remove_invert_block()
173 unsigned succ_idx = block->linear_succs[0]; in try_remove_invert_block()
177 pred->linear_succs[0] = succ_idx; in try_remove_invert_block()
188 block->linear_succs.clear(); in try_remove_invert_block()
197 Block& succ = ctx.program->blocks[block->linear_succs[0]]; in try_remove_simple_block()
235 pred.linear_succs[0] = pred.linear_succs[1]; in try_remove_simple_block()
236 pred.linear_succs[1] = succ.index; in try_remove_simple_block()
[all …]
Daco_insert_exec_mask.cpp927 ctx.loop.emplace_back(&ctx.program->blocks[block->linear_succs[0]], in add_branch_code()
978 …assert(ctx.program->blocks[ctx.program->blocks[block->linear_succs[1]].linear_succs[0]].kind & blo… in add_branch_code()
979 …assert(ctx.program->blocks[ctx.program->blocks[block->linear_succs[0]].linear_succs[0]].kind & blo… in add_branch_code()
991 …f(s2)), bld.exec(ctx.info[idx].exec.back().first), block->linear_succs[1], block->linear_succs[0]); in add_branch_code()
998 branch->target[0] = block->linear_succs[0]; in add_branch_code()
1000 branch->target[0] = block->linear_succs[1]; in add_branch_code()
1001 branch->target[1] = block->linear_succs[0]; in add_branch_code()
1018 assert(block->linear_succs.size() == 2); in add_branch_code()
1038 …z, bld.hint_vcc(bld.def(s2)), bld.exec(then_mask), block->linear_succs[1], block->linear_succs[0]); in add_branch_code()
1056 …z, bld.hint_vcc(bld.def(s2)), bld.exec(else_mask), block->linear_succs[1], block->linear_succs[0]); in add_branch_code()
[all …]
Daco_print_asm.cpp156 for (unsigned succ : block.linear_succs) in print_asm()
Daco_validate.cpp498 for (unsigned j = 0; j + 1 < block.linear_succs.size(); j++) in validate_ir()
499 …check_block(block.linear_succs[j] < block.linear_succs[j + 1], "linear successors must be sorted",… in validate_ir()
506 …check_block(program->blocks[pred].linear_succs.size() == 1, "linear critical edges are not allowed… in validate_ir()
Daco_lower_to_hw_instr.cpp1888 block->linear_succs.push_back(discard_block->index); in lower_to_hw_instr()
1954 assert(block->linear_succs[0] == branch->target[0]); in lower_to_hw_instr()
1958 assert(block->linear_succs[1] == branch->target[0]); in lower_to_hw_instr()
1969 assert(block->linear_succs[1] == branch->target[0]); in lower_to_hw_instr()
Daco_ir.h1486 std::vector<unsigned> linear_succs; member
Daco_register_allocation.cpp2402 for (unsigned succ_idx : block.linear_succs) { in register_allocation()
Daco_instruction_selection.cpp11034 program->blocks[idx].linear_succs.emplace_back(BB.index); in cleanup_cfg()
/external/mesa3d/src/amd/compiler/tests/
Dhelpers.cpp128 program->blocks[idx].linear_succs.emplace_back(BB.index); in finish_program()
134 if (block.linear_succs.size() == 0) { in finish_program()