Lines Matching defs:succ
226 Block& succ = ctx.program->blocks[block->linear_succs[0]];
229 branch.target[0] = succ.index;
230 branch.target[1] = succ.index;
232 branch.target[0] = succ.index;
233 } else if (branch.target[0] == succ.index) {
235 branch.target[1] = succ.index;
238 /* check if there is a fall-through path from block to succ */
239 bool falls_through = block->index < succ.index;
240 for (unsigned j = block->index + 1; falls_through && j < succ.index; j++) {
246 branch.target[1] = succ.index;
265 pred.linear_succs[1] = succ.index;
267 branch.target[0] = succ.index;
278 pred.linear_succs[i] = succ.index;
280 for (unsigned i = 0; i < succ.linear_preds.size(); i++)
281 if (succ.linear_preds[i] == block->index)
282 succ.linear_preds[i] = pred.index;