Lines Matching refs:index
40 /* The outer vectors should be indexed by block index. The inner vectors store phi information
206 ctx.program->blocks[succ_idx].linear_preds[i] = pred->index;
229 branch.target[0] = succ.index;
230 branch.target[1] = succ.index;
231 } else if (branch.target[0] == block->index) {
232 branch.target[0] = succ.index;
233 } else if (branch.target[0] == succ.index) {
234 assert(branch.target[1] == block->index);
235 branch.target[1] = succ.index;
237 } else if (branch.target[1] == block->index) {
239 bool falls_through = block->index < succ.index;
240 for (unsigned j = block->index + 1; falls_through && j < succ.index; j++) {
241 assert(ctx.program->blocks[j].index == j);
246 branch.target[1] = succ.index;
249 if (block->index >= branch.target[0])
251 for (unsigned j = block->index + 1; j < branch.target[0]; j++) {
265 pred.linear_succs[1] = succ.index;
267 branch.target[0] = succ.index;
277 if (pred.linear_succs[i] == block->index)
278 pred.linear_succs[i] = succ.index;
281 if (succ.linear_preds[i] == block->index)
282 succ.linear_preds[i] = pred.index;
306 if (!ctx.logical_phi_info[block.index].empty()) {
312 for (const auto& successor_phi_info : ctx.linear_phi_info[block.index]) {
357 ctx.blocks_incoming_exec_used[block.index] = exec_write_used;