Lines Matching defs:successor
33 * blocks with successor/predecessor edges connecting them.
62 bblock_t::add_successor(void *mem_ctx, bblock_t *successor)
64 successor->parents.push_tail(::link(mem_ctx, this));
65 children.push_tail(::link(mem_ctx, successor));
273 * (which is represented as the "next" successor), or disabled (if it
275 * iteration, which is represented as the "cur_while" successor).
307 * end of the loop which is why the successor is not the top-level
395 /* Remove block from all of its predecessors' successor lists. */
396 foreach_list_typed_safe (bblock_link, successor, link,
398 if (block == successor->block) {
399 successor->link.remove();
400 ralloc_free(successor);
404 /* Add removed-block's successors to its predecessors' successor lists. */
405 foreach_list_typed (bblock_link, successor, link, &block->children) {
406 if (!successor->block->is_successor_of(predecessor->block)) {
408 successor->block));
413 foreach_list_typed_safe (bblock_link, successor, link, &block->children) {
416 &successor->block->parents) {
425 if (!predecessor->block->is_predecessor_of(successor->block)) {
426 successor->block->parents.push_tail(link(mem_ctx,