Searched refs:block_num (Results 1 – 6 of 6) sorted by relevance
/php-src/Zend/Optimizer/ |
H A D | zend_dfg.h | 35 #define DFG_BITSET(set, set_size, block_num) \ argument 36 ((set) + ((block_num) * (set_size))) 38 #define DFG_SET(set, set_size, block_num, var_num) \ argument 39 zend_bitset_incl(DFG_BITSET(set, set_size, block_num), (var_num)) 41 #define DFG_ISSET(set, set_size, block_num, var_num) \ argument 42 zend_bitset_in(DFG_BITSET(set, set_size, block_num), (var_num))
|
H A D | scdf.c | 120 int block_num = ssa->cfg.map[i]; in scdf_solve() local 121 if (zend_bitset_in(scdf->executable_blocks, block_num)) { in scdf_solve() 122 zend_basic_block *block = &ssa->cfg.blocks[block_num]; in scdf_solve() 132 scdf_mark_edge_feasible(scdf, block_num, block->successors[0]); in scdf_solve() 134 scdf->handlers.mark_feasible_successors(scdf, block_num, block, opline, ssa_op); in scdf_solve() 227 int block_num = block - cfg->blocks; in cleanup_loop_var_free_block() local 231 for (zend_ssa_phi *phi = ssa->blocks[block_num].phis; phi; phi = phi->next) { in cleanup_loop_var_free_block() 251 zend_ssa_remove_block_from_cfg(ssa, block_num); in cleanup_loop_var_free_block()
|
H A D | dfa_pass.c | 745 int block_num = 0; in zend_dfa_optimize_jmps() local 747 for (block_num = 1; block_num < ssa->cfg.blocks_count; block_num++) { in zend_dfa_optimize_jmps() 759 block_num = 0; in zend_dfa_optimize_jmps() 760 while (block_num < ssa->cfg.blocks_count in zend_dfa_optimize_jmps() 762 block_num++; in zend_dfa_optimize_jmps() 765 int next_block_num = block_num + 1; in zend_dfa_optimize_jmps() 997 if (block_num > 0) { in zend_dfa_optimize_jmps() 1001 block_num--; in zend_dfa_optimize_jmps() 1002 } while (block_num >= 0 in zend_dfa_optimize_jmps() 1004 if (block_num >= 0) { in zend_dfa_optimize_jmps() [all …]
|
H A D | scdf.h | 44 struct _scdf_ctx *scdf, int block_num, zend_basic_block *block,
|
H A D | sccp.c | 1826 int block_num, zend_basic_block *block, in sccp_mark_feasible_successors() argument 1839 scdf_mark_edge_feasible(scdf, block_num, block->successors[0]); in sccp_mark_feasible_successors() 1840 scdf_mark_edge_feasible(scdf, block_num, block->successors[1]); in sccp_mark_feasible_successors() 1853 scdf_mark_edge_feasible(scdf, block_num, block->successors[s]); in sccp_mark_feasible_successors() 1868 scdf_mark_edge_feasible(scdf, block_num, block->successors[0]); in sccp_mark_feasible_successors() 1869 scdf_mark_edge_feasible(scdf, block_num, block->successors[1]); in sccp_mark_feasible_successors() 1880 scdf_mark_edge_feasible(scdf, block_num, block->successors[0]); in sccp_mark_feasible_successors() 1881 scdf_mark_edge_feasible(scdf, block_num, block->successors[1]); in sccp_mark_feasible_successors() 1930 scdf_mark_edge_feasible(scdf, block_num, target); in sccp_mark_feasible_successors() 1936 scdf_mark_edge_feasible(scdf, block_num, target); in sccp_mark_feasible_successors() [all …]
|
H A D | zend_cfg.c | 654 int *postnum, int *cur, const zend_cfg *cfg, int block_num) /* {{{ */ in compute_postnum_recursive() argument 657 zend_basic_block *block = &cfg->blocks[block_num]; in compute_postnum_recursive() 658 if (postnum[block_num] != -1) { in compute_postnum_recursive() 662 postnum[block_num] = -2; /* Marker for "currently visiting" */ in compute_postnum_recursive() 666 postnum[block_num] = (*cur)++; in compute_postnum_recursive()
|
Completed in 28 milliseconds