Lines Matching refs:successors
361 * successors:
363 for (unsigned i = 0; i < ARRAY_SIZE(block->successors); i++) {
364 if (!block->successors[i])
366 struct ir3_legalize_block_data *pbd = block->successors[i]->data;
449 if (!block->successors[0])
459 if (block->successors[1] == NULL) {
461 return block->successors[0];
472 if (block->successors[0]->index <= block->index)
474 return block->successors[0];
487 * fall through to any of the physical successors of this block. But we can
491 * TODO: we really ought to have unlimited numbers of physical successors,
525 for (unsigned i = 0; i < ARRAY_SIZE(old_target->successors); i++) {
526 if (old_target->successors[i]) {
527 struct ir3_block *succ = old_target->successors[i];
546 /* update current blocks successors to reflect the retargetting: */
547 if (cur_block->successors[0] == old_target) {
548 cur_block->successors[0] = new_target;
550 assert(cur_block->successors[1] == old_target);
551 cur_block->successors[1] = new_target;
730 if (block->successors[1]) {
745 br1->cat0.target = block->successors[1];
748 br2->cat0.target = block->successors[0];
759 br1->cat0.target = block->successors[1];
765 br2->cat0.target = block->successors[0];
784 } else if (block->successors[0]) {
789 jmp->cat0.target = block->successors[0];
823 for (unsigned i = 0; i < 2 && block->successors[i]; i++) {
824 if (block->successors[i]->start_ip <= block->end_ip)
855 /* We don't update predecessors/successors, so we have to do this