Searched refs:logical_succs (Results 1 – 10 of 10) sorted by relevance
87 if (block->logical_succs.empty()) { in compute_live_out()110 if (block->logical_succs.back() != block->linear_succs.back()) { in compute_live_out()111 for (unsigned t : ctx.program->live.live_in[block->logical_succs.back()]) { in compute_live_out()116 assert(block->logical_succs[0] == block->linear_succs[0]); in compute_live_out()134 if (block->logical_succs.size() == 1 && block->logical_succs[0] >= ctx.handled_once) { in compute_live_out()135 Block& succ = ctx.program->blocks[block->logical_succs[0]]; in compute_live_out()
984 for (unsigned j = 0; j + 1 < block.logical_succs.size(); j++) in validate_cfg()985 check_block(block.logical_succs[j] < block.logical_succs[j + 1], in validate_cfg()994 check_block(program->blocks[pred].logical_succs.size() == 1, in validate_cfg()
162 : ctx.program->blocks[block_idx].logical_succs; in is_live_out()
114 assert(block->logical_succs.empty()); in reset_block()
1918 edge_vec logical_succs; member
11576 program->blocks[idx].logical_succs.emplace_back(BB.index); in cleanup_cfg()
181 program->blocks[0].logical_succs.push_back(1);203 program->blocks[1].logical_succs.push_back(2);228 program->blocks[2].logical_succs.push_back(3);1773 program->blocks[0].logical_succs.push_back(1);
450 program->blocks[0].logical_succs.push_back(1);
167 prog->blocks[idx].logical_succs.emplace_back(BB.index); in finish_program()
1457 program->blocks[0].logical_succs.push_back(1);