@@ -71,8 +71,7 @@ void scdf_mark_edge_feasible(scdf_ctx *scdf, int from, int to) {
71
71
/* Block is already executable, only a new edge became feasible.
72
72
* Reevaluate phi nodes to account for changed source operands. */
73
73
const zend_ssa_block * ssa_block = & scdf -> ssa -> blocks [to ];
74
- zend_ssa_phi * phi ;
75
- for (phi = ssa_block -> phis ; phi ; phi = phi -> next ) {
74
+ for (const zend_ssa_phi * phi = ssa_block -> phis ; phi ; phi = phi -> next ) {
76
75
zend_bitset_excl (scdf -> phi_var_worklist , phi -> ssa_var );
77
76
scdf -> handlers .visit_phi (scdf , phi );
78
77
}
@@ -109,7 +108,7 @@ void scdf_solve(scdf_ctx *scdf, const char *name) {
109
108
) {
110
109
int i ;
111
110
while ((i = zend_bitset_pop_first (scdf -> phi_var_worklist , scdf -> phi_var_worklist_len )) >= 0 ) {
112
- zend_ssa_phi * phi = ssa -> vars [i ].definition_phi ;
111
+ const zend_ssa_phi * phi = ssa -> vars [i ].definition_phi ;
113
112
ZEND_ASSERT (phi );
114
113
if (zend_bitset_in (scdf -> executable_blocks , phi -> block )) {
115
114
scdf -> handlers .visit_phi (scdf , phi );
@@ -145,12 +144,9 @@ void scdf_solve(scdf_ctx *scdf, const char *name) {
145
144
DEBUG_PRINT ("Pop block %d from worklist\n" , i );
146
145
zend_bitset_incl (scdf -> executable_blocks , i );
147
146
148
- {
149
- zend_ssa_phi * phi ;
150
- for (phi = ssa_block -> phis ; phi ; phi = phi -> next ) {
151
- zend_bitset_excl (scdf -> phi_var_worklist , phi -> ssa_var );
152
- scdf -> handlers .visit_phi (scdf , phi );
153
- }
147
+ for (const zend_ssa_phi * phi = ssa_block -> phis ; phi ; phi = phi -> next ) {
148
+ zend_bitset_excl (scdf -> phi_var_worklist , phi -> ssa_var );
149
+ scdf -> handlers .visit_phi (scdf , phi );
154
150
}
155
151
156
152
if (block -> len == 0 ) {
0 commit comments