Searched refs:linear_succs (Results 1 – 12 of 12) sorted by relevance
174 if (block->linear_succs.size() != 1 || in try_remove_merge_block()175 !(ctx.program->blocks[block->linear_succs[0]].kind & block_kind_merge)) in try_remove_merge_block()191 assert(block->linear_succs.size() == 2); in try_remove_invert_block()193 if (block->linear_succs[0] != block->linear_succs[1]) in try_remove_invert_block()200 unsigned succ_idx = block->linear_succs[0]; in try_remove_invert_block()204 pred->linear_succs[0] = succ_idx; in try_remove_invert_block()215 block->linear_succs.clear(); in try_remove_invert_block()225 Block& succ = ctx.program->blocks[block->linear_succs[0]]; in try_remove_simple_block()263 pred.linear_succs[0] = pred.linear_succs[1]; in try_remove_simple_block()264 pred.linear_succs[1] = succ.index; in try_remove_simple_block()[all …]
916 ctx.loop.emplace_back(&ctx.program->blocks[block->linear_succs[0]], num_exec_masks, needs, in add_branch_code()960 assert(ctx.program->blocks[ctx.program->blocks[block->linear_succs[1]].linear_succs[0]].kind & in add_branch_code()962 assert(ctx.program->blocks[ctx.program->blocks[block->linear_succs[0]].linear_succs[0]].kind & in add_branch_code()977 block->linear_succs[1], block->linear_succs[0]); in add_branch_code()984 branch.target[0] = block->linear_succs[0]; in add_branch_code()986 branch.target[0] = block->linear_succs[1]; in add_branch_code()987 branch.target[1] = block->linear_succs[0]; in add_branch_code()1003 assert(block->linear_succs.size() == 2); in add_branch_code()1025 block->linear_succs[1], block->linear_succs[0]); in add_branch_code()1039 block->linear_succs[1], block->linear_succs[0]); in add_branch_code()[all …]
205 for (unsigned succ : program->blocks[block->logical_preds[i]].linear_succs) in init_any_pred_defined()244 for (unsigned succ : program->blocks[j].linear_succs) in init_any_pred_defined()
204 for (unsigned succ : block.linear_succs) in print_asm_llvm()
638 for (unsigned j = 0; j + 1 < block.linear_succs.size(); j++) in validate_ir()639 check_block(block.linear_succs[j] < block.linear_succs[j + 1], in validate_ir()648 check_block(program->blocks[pred].linear_succs.size() == 1, in validate_ir()
517 block.linear_succs.size() == 1 && in collect_preasm_stats()
2046 block->linear_succs.push_back(discard_block->index); in lower_to_hw_instr()2242 assert(block->linear_succs[0] == target); in lower_to_hw_instr()2246 assert(block->linear_succs[1] == target); in lower_to_hw_instr()2257 assert(block->linear_succs[1] == target); in lower_to_hw_instr()
1887 std::vector<unsigned> linear_succs; member
11437 program->blocks[idx].linear_succs.emplace_back(BB.index); in cleanup_cfg()
110 program->blocks[0].linear_succs.push_back(1);162 program->blocks[0].linear_succs.push_back(1);
133 prog->blocks[idx].linear_succs.emplace_back(BB.index); in finish_program()139 if (block.linear_succs.size() == 0) { in finish_program()
378 program->blocks[0].linear_succs.push_back(1);