Lines Matching defs:successor
34 * blocks with successor/predecessor edges connecting them.
74 bblock_t::add_successor(void *mem_ctx, bblock_t *successor,
77 successor->parents.push_tail(::link(mem_ctx, this, kind));
78 children.push_tail(::link(mem_ctx, successor, kind));
290 * (which is represented as the "next" successor), or disabled (if it
292 * iteration, which is represented as the "cur_while" successor).
324 * end of the loop which is why the successor is not the top-level
420 /* Remove block from all of its predecessors' successor lists. */
421 foreach_list_typed_safe (bblock_link, successor, link,
423 if (block == successor->block) {
424 successor->link.remove();
425 ralloc_free(successor);
429 /* Add removed-block's successors to its predecessors' successor lists. */
430 foreach_list_typed (bblock_link, successor, link, &block->children) {
431 if (!successor->block->is_successor_of(predecessor->block,
432 successor->kind)) {
434 successor->block,
435 successor->kind));
440 foreach_list_typed_safe (bblock_link, successor, link, &block->children) {
443 &successor->block->parents) {
452 if (!predecessor->block->is_predecessor_of(successor->block,
454 successor->block->parents.push_tail(link(mem_ctx,