Lines Matching refs:i
111 int i; in scdf_solve() local
112 while ((i = zend_bitset_pop_first(scdf->phi_var_worklist, scdf->phi_var_worklist_len)) >= 0) { in scdf_solve()
113 zend_ssa_phi *phi = ssa->vars[i].definition_phi; in scdf_solve()
120 while ((i = zend_bitset_pop_first(scdf->instr_worklist, scdf->instr_worklist_len)) >= 0) { in scdf_solve()
121 int block_num = ssa->cfg.map[i]; in scdf_solve()
124 zend_op *opline = &scdf->op_array->opcodes[i]; in scdf_solve()
125 zend_ssa_op *ssa_op = &ssa->ops[i]; in scdf_solve()
131 if (i == block->start + block->len - 1) { in scdf_solve()
141 while ((i = zend_bitset_pop_first(scdf->block_worklist, scdf->block_worklist_len)) >= 0) { in scdf_solve()
143 zend_basic_block *block = &ssa->cfg.blocks[i]; in scdf_solve()
144 zend_ssa_block *ssa_block = &ssa->blocks[i]; in scdf_solve()
146 DEBUG_PRINT("Pop block %d from worklist\n", i); in scdf_solve()
147 zend_bitset_incl(scdf->executable_blocks, i); in scdf_solve()
159 scdf_mark_edge_feasible(scdf, i, block->successors[0]); in scdf_solve()
171 scdf_mark_edge_feasible(scdf, i, block->successors[0]); in scdf_solve()
177 scdf->handlers.mark_feasible_successors(scdf, i, block, opline, &ssa->ops[j-1]); in scdf_solve()
188 uint32_t i; in kept_alive_by_live_range() local
191 for (i = 0; i < op_array->last_live_range; i++) { in kept_alive_by_live_range()
192 zend_live_range *live_range = &op_array->live_range[i]; in kept_alive_by_live_range()
209 int i; in scdf_remove_unreachable_blocks() local
212 for (i = 0; i < ssa->cfg.blocks_count; i++) { in scdf_remove_unreachable_blocks()
213 if (!zend_bitset_in(scdf->executable_blocks, i) in scdf_remove_unreachable_blocks()
214 && (ssa->cfg.blocks[i].flags & ZEND_BB_REACHABLE) in scdf_remove_unreachable_blocks()
215 && !kept_alive_by_live_range(scdf, i)) { in scdf_remove_unreachable_blocks()
216 removed_ops += ssa->cfg.blocks[i].len; in scdf_remove_unreachable_blocks()
217 zend_ssa_remove_block(scdf->op_array, ssa, i); in scdf_remove_unreachable_blocks()
