Home
last modified time | relevance | path

Searched refs:phi (Results 1 – 25 of 28) sorted by relevance

12

/PHP-8.3/Zend/Optimizer/
H A Dzend_ssa.c109 phi->pi = from; in add_pi()
127 return phi; in add_pi()
816 var[phi->var] = phi->ssa_var; in zend_ssa_rename()
818 phi = phi->next; in zend_ssa_rename()
1111 ssa_vars[phi->ssa_var].var = phi->var; in zend_ssa_compute_use_def_chains()
1112 ssa_vars[phi->ssa_var].definition_phi = phi; in zend_ssa_compute_use_def_chains()
1123 ssa_vars[phi->sources[0]].phi_use_chain = phi; in zend_ssa_compute_use_def_chains()
1149 ssa_vars[phi->sources[j]].phi_use_chain = phi; in zend_ssa_compute_use_def_chains()
1153 phi = phi->next; in zend_ssa_compute_use_def_chains()
1451 for (phi = next_ssa_block->phis; phi; phi = phi->next) { in zend_ssa_remove_predecessor()
[all …]
H A Dscdf.c74 zend_ssa_phi *phi; in scdf_mark_edge_feasible() local
75 for (phi = ssa_block->phis; phi; phi = phi->next) { in scdf_mark_edge_feasible()
77 scdf->handlers.visit_phi(scdf, phi); in scdf_mark_edge_feasible()
113 ZEND_ASSERT(phi); in scdf_solve()
115 scdf->handlers.visit_phi(scdf, phi); in scdf_solve()
149 zend_ssa_phi *phi; in scdf_solve() local
150 for (phi = ssa_block->phis; phi; phi = phi->next) { in scdf_solve()
152 scdf->handlers.visit_phi(scdf, phi); in scdf_solve()
231 for (zend_ssa_phi *phi = ssa->blocks[block_num].phis; phi; phi = phi->next) { in cleanup_loop_var_free_block() local
232 zend_ssa_remove_uses_of_var(ssa, phi->ssa_var); in cleanup_loop_var_free_block()
[all …]
H A Dssa_integrity.c35 zend_ssa_phi *phi; in is_in_phi_use_chain() local
37 if (phi == check) { in is_in_phi_use_chain()
118 zend_ssa_phi *phi; in ssa_verify_integrity() local
174 phi = var->phi_use_chain; in ssa_verify_integrity()
176 while (phi && second_phi) { in ssa_verify_integrity()
177 phi = zend_ssa_next_use_phi(ssa, var - ssa->vars, phi); in ssa_verify_integrity()
183 if (phi == second_phi) { in ssa_verify_integrity()
189 FOREACH_PHI_USE(var, phi) { in ssa_verify_integrity()
331 FOREACH_PHI(phi) { in ssa_verify_integrity()
347 if (phi->sources[j] == source && phi->use_chains[j]) { in ssa_verify_integrity()
[all …]
H A Dzend_ssa.h264 #define NUM_PHI_SOURCES(phi) \ argument
265 ((phi)->pi >= 0 ? 1 : (ssa->cfg.blocks[(phi)->block].predecessors_count))
277 #define FOREACH_PHI_USE(var, phi) do { \ argument
280 for (phi = (var)->phi_use_chain; phi; phi = next_phi) { \
281 next_phi = zend_ssa_next_use_phi(ssa, _var_num, phi);
286 #define FOREACH_PHI_SOURCE(phi, source) do { \ argument
287 zend_ssa_phi *_phi = (phi); \
288 int _i, _end = NUM_PHI_SOURCES(phi); \
296 #define FOREACH_PHI(phi) do { \ argument
299 phi = ssa->blocks[_i].phis; \
[all …]
H A Ddce.c315 FOREACH_PHI_SOURCE(phi, source) { in add_phi_sources_to_worklists()
464 FOREACH_PHI_SOURCE(phi, source) { in get_common_phi_source()
465 if (source == phi->ssa_var) { in get_common_phi_source()
483 if (phi->pi < 0) { in try_remove_trivial_phi()
488 zend_ssa_remove_phi(ssa, phi); in try_remove_trivial_phi()
523 zend_ssa_phi *phi; in dce_optimize_op_array() local
550 FOREACH_PHI(phi) { in dce_optimize_op_array()
551 if (phi->var >= op_array->last_var in dce_optimize_op_array()
643 FOREACH_PHI_SOURCE(phi, source) { in dce_optimize_op_array()
649 FOREACH_PHI(phi) { in dce_optimize_op_array()
[all …]
H A Dscdf.h42 struct _scdf_ctx *scdf, zend_ssa_phi *phi);
59 zend_ssa_phi *phi; in scdf_add_to_worklist() local
63 FOREACH_PHI_USE(var, phi) { in scdf_add_to_worklist()
64 zend_bitset_incl(scdf->phi_var_worklist, phi->ssa_var); in scdf_add_to_worklist()
H A Dsccp.c1992 ZEND_ASSERT(phi->ssa_var >= 0); in sccp_visit_phi()
1993 if (!IS_BOT(&ctx->values[phi->ssa_var])) { in sccp_visit_phi()
1994 zend_basic_block *block = &ssa->cfg.blocks[phi->block]; in sccp_visit_phi()
2003 if (phi->pi >= 0) { in sccp_visit_phi()
2004 ZEND_ASSERT(phi->sources[0] >= 0); in sccp_visit_phi()
2005 if (scdf_is_edge_feasible(scdf, phi->pi, phi->block)) { in sccp_visit_phi()
2006 …join_phi_values(&result, &ctx->values[phi->sources[0]], ssa->vars[phi->ssa_var].escape_state != ES… in sccp_visit_phi()
2010 ZEND_ASSERT(phi->sources[i] >= 0); in sccp_visit_phi()
2013 scp_dump_value(&ctx->values[phi->sources[i]]); in sccp_visit_phi()
2016 …join_phi_values(&result, &ctx->values[phi->sources[i]], ssa->vars[phi->ssa_var].escape_state != ES… in sccp_visit_phi()
[all …]
H A Ddfa_pass.c575 zend_ssa_phi *phi; in replace_predecessor() local
603 for (phi = ssa->blocks[block_id].phis; phi; phi = phi->next) { in replace_predecessor()
604 if (phi->pi >= 0) { in replace_predecessor()
605 if (phi->pi == old_pred || phi->pi == new_pred) { in replace_predecessor()
607 ssa, phi->ssa_var, phi->sources[0], /* update_types */ 0); in replace_predecessor()
608 zend_ssa_remove_phi(ssa, phi); in replace_predecessor()
612 phi->sources + old_pred_idx, in replace_predecessor()
613 phi->sources + old_pred_idx + 1, in replace_predecessor()
H A Dzend_inference.c265 zend_ssa_phi *phi; member
271 zend_ssa_phi *phi; in zend_scc_next() local
284 case 9: phi = iterator->phi; goto state_9; in zend_scc_next()
286 case 10: phi = iterator->phi; goto state_10; in zend_scc_next()
356 while (phi) { in zend_scc_next()
360 iterator->phi = phi; in zend_scc_next()
364 phi = zend_ssa_next_use_phi(ssa, var, phi); in zend_scc_next()
370 while (phi) { in zend_scc_next()
374 iterator->phi = phi; in zend_scc_next()
378 phi = phi->sym_use_chain; in zend_scc_next()
[all …]
/PHP-8.3/ext/opcache/jit/
H A Dzend_jit_trace.c1479 ssa_vars[phi->ssa_var].var = phi->var; in zend_jit_trace_build_tssa()
1480 ssa_vars[phi->ssa_var].definition_phi = phi; in zend_jit_trace_build_tssa()
1483 phi = phi->next; in zend_jit_trace_build_tssa()
1630 phi = phi->next; in zend_jit_trace_build_tssa()
2620 phi = phi->next; in zend_jit_trace_build_tssa()
2806 phi = phi->next; in zend_jit_trace_allocate_registers()
3104 phi = phi->next; in zend_jit_trace_allocate_registers()
3215 phi = phi->next; in zend_jit_trace_allocate_registers()
3426 phi = phi->next; in zend_jit_trace_allocate_registers()
4259 phi = phi->next; in zend_jit_trace()
[all …]
H A Dzend_jit.c201 phi = zend_ssa_next_use_phi(ssa, var, phi); in zend_ssa_is_last_use()
202 } while (phi); in zend_ssa_is_last_use()
1714 zend_ssa_phi *phi; in zend_jit_compute_liveness() local
1760 for (phi = ssa->blocks[succ].phis; phi; phi = phi->next) { in zend_jit_compute_liveness()
1764 if (phi->pi == i && phi->sources[0] >= 0) { in zend_jit_compute_liveness()
1860 for (phi = ssa->blocks[i].phis; phi; phi = phi->next) { in zend_jit_compute_liveness()
2602 while (phi) { in zend_jit_allocate_registers()
2608 phi = zend_ssa_next_use_phi(ssa, i, phi); in zend_jit_allocate_registers()
2631 phi = zend_ssa_next_use_phi(ssa, i, phi); in zend_jit_allocate_registers()
2895 while (phi) { in zend_jit()
[all …]
/PHP-8.3/ext/opcache/tests/
H A Dphi_use_chain.phpt2 Check that phi use chains are correctly maintained when removing blocks
/PHP-8.3/Zend/tests/
H A Dlive_range_phi_leak.phpt2 Missing live range if part of phi
H A Dunreachable_phi_cycle.phpt2 Unreachable phi cycle
/PHP-8.3/Zend/tests/match/
H A Dmatch_of_phi_optimization.phpt2 Unreachable code elimination when match argument is a phi node
/PHP-8.3/ext/standard/html_tables/
H A Dents_html401.txt144 phi 03C6
H A Dents_xhtml.txt176 phi 03C6
H A Dents_html5.txt1605 phi 003C6
/PHP-8.3/ext/standard/tests/strings/
H A Dget_html_translation_table_basic7.phpt238 [φ] => &phi;
H A Dget_html_translation_table_basic2.phpt410 string(5) "&phi;"
919 string(5) "&phi;"
1426 string(5) "&phi;"
H A Dhtml_entity_decode_html4.phpt159 "&phi;",
H A Dget_html_translation_table_basic1.phpt397 string(5) "&phi;"
H A Dhtmlentities_html4.phpt215 &phi; U+003C6
H A Dget_html_translation_table_basic5.phpt1209 [φ] => &phi;
H A Dhtml_entity_decode_html5.phpt1610 "&phi;",
3744 &phi; => φ cf86

Completed in 114 milliseconds

12