Home
last modified time | relevance | path

Searched refs:predecessor (Results 1 – 4 of 4) sorted by relevance

/php-src/Zend/tests/
H A Dreplace_pred_pi_node.phpt2 Handling of pi nodes when replacing a predecessor
H A Dremove_predecessor_of_pi_node.phpt2 Regression test for incorrect update of pi node users when removing a predecessor block
/php-src/ext/opcache/jit/ir/
H A Dir_cfg.c1283 uint32_t predecessor = *p; in ir_schedule_blocks_bottom_up() local
1288 if (predecessor < b) { in ir_schedule_blocks_bottom_up()
1289 if (!ir_bitset_in(visited, predecessor)) { in ir_schedule_blocks_bottom_up()
1290 b = predecessor; in ir_schedule_blocks_bottom_up()
1294 } else if (b != predecessor && ctx->cfg_blocks[predecessor].loop_header != b) { in ir_schedule_blocks_bottom_up()
1296 IR_ASSERT(b == predecessor || ctx->cfg_blocks[predecessor].loop_header == b); in ir_schedule_blocks_bottom_up()
1683 uint32_t predecessor = b - 1; in ir_schedule_blocks_top_down() local
1685 ir_bitqueue_del(&blocks, predecessor); in ir_schedule_blocks_top_down()
1687 list[count] = predecessor; in ir_schedule_blocks_top_down()
/php-src/Zend/Optimizer/
H A Dzend_ssa.c39 int predecessor = cfg->predecessors[block->predecessor_offset + i]; in will_rejoin() local
40 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 19 milliseconds