Searched refs:predecessor (Results 1 – 4 of 4) sorted by relevance
2 Handling of pi nodes when replacing a predecessor
2 Regression test for incorrect update of pi node users when removing a predecessor block
1298 uint32_t predecessor = *p; in ir_schedule_blocks_bottom_up() local1303 if (predecessor < b) { in ir_schedule_blocks_bottom_up()1304 if (!ir_bitset_in(visited, predecessor)) { in ir_schedule_blocks_bottom_up()1305 b = predecessor; in ir_schedule_blocks_bottom_up()1309 } else if (b != predecessor && ctx->cfg_blocks[predecessor].loop_header != b) { in ir_schedule_blocks_bottom_up()1311 IR_ASSERT(b == predecessor || ctx->cfg_blocks[predecessor].loop_header == b); in ir_schedule_blocks_bottom_up()1698 uint32_t predecessor = b - 1; in ir_schedule_blocks_top_down() local1700 ir_bitqueue_del(&blocks, predecessor); in ir_schedule_blocks_top_down()1702 list[count] = predecessor; in ir_schedule_blocks_top_down()
39 int predecessor = cfg->predecessors[block->predecessor_offset + i]; in will_rejoin() local40 if (predecessor == exclude) { in will_rejoin()47 if (DFG_ISSET(dfg->def, dfg->size, predecessor, var)) { in will_rejoin()53 if (dominates(cfg->blocks, other_successor, predecessor)) { in will_rejoin()
Completed in 14 milliseconds