Home
last modified time | relevance | path

Searched refs:block_num (Results 1 – 6 of 6) sorted by relevance

/PHP-8.0/ext/opcache/Optimizer/
H A Dzend_dfg.h35 #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 Ddfa_pass.c736 int block_num = 0; in zend_dfa_optimize_jmps() local
738 for (block_num = 1; block_num < ssa->cfg.blocks_count; block_num++) { in zend_dfa_optimize_jmps()
750 block_num = 0; in zend_dfa_optimize_jmps()
751 while (block_num < ssa->cfg.blocks_count in zend_dfa_optimize_jmps()
753 block_num++; in zend_dfa_optimize_jmps()
756 int next_block_num = block_num + 1; in zend_dfa_optimize_jmps()
1022 if (block_num > 0) { in zend_dfa_optimize_jmps()
1026 block_num--; in zend_dfa_optimize_jmps()
1027 } while (block_num >= 0 in zend_dfa_optimize_jmps()
1029 if (block_num >= 0) { in zend_dfa_optimize_jmps()
[all …]
H A Dscdf.c121 int block_num = ssa->cfg.map[i]; in scdf_solve() local
122 if (zend_bitset_in(scdf->executable_blocks, block_num)) { in scdf_solve()
123 zend_basic_block *block = &ssa->cfg.blocks[block_num]; in scdf_solve()
133 scdf_mark_edge_feasible(scdf, block_num, block->successors[0]); in scdf_solve()
135 scdf->handlers.mark_feasible_successors(scdf, block_num, block, opline, ssa_op); in scdf_solve()
H A Dscdf.h44 struct _scdf_ctx *scdf, int block_num, zend_basic_block *block,
H A Dsccp.c1887 int block_num, zend_basic_block *block, in sccp_mark_feasible_successors() argument
1899 scdf_mark_edge_feasible(scdf, block_num, block->successors[0]); in sccp_mark_feasible_successors()
1900 scdf_mark_edge_feasible(scdf, block_num, block->successors[1]); in sccp_mark_feasible_successors()
1909 scdf_mark_edge_feasible(scdf, block_num, block->successors[s]); in sccp_mark_feasible_successors()
1925 scdf_mark_edge_feasible(scdf, block_num, block->successors[0]); in sccp_mark_feasible_successors()
1926 scdf_mark_edge_feasible(scdf, block_num, block->successors[1]); in sccp_mark_feasible_successors()
1937 scdf_mark_edge_feasible(scdf, block_num, block->successors[0]); in sccp_mark_feasible_successors()
1938 scdf_mark_edge_feasible(scdf, block_num, block->successors[1]); in sccp_mark_feasible_successors()
1987 scdf_mark_edge_feasible(scdf, block_num, target); in sccp_mark_feasible_successors()
1993 scdf_mark_edge_feasible(scdf, block_num, target); in sccp_mark_feasible_successors()
[all …]
H A Dzend_cfg.c664 int *postnum, int *cur, const zend_cfg *cfg, int block_num) /* {{{ */ in compute_postnum_recursive() argument
667 zend_basic_block *block = &cfg->blocks[block_num]; in compute_postnum_recursive()
668 if (postnum[block_num] != -1) { in compute_postnum_recursive()
672 postnum[block_num] = -2; /* Marker for "currently visiting" */ in compute_postnum_recursive()
676 postnum[block_num] = (*cur)++; in compute_postnum_recursive()

Completed in 76 milliseconds