/php-src/sapi/fpm/fpm/events/ |
H A D | kqueue.c | 116 int ret, i; in fpm_event_kqueue_wait() local 137 for (i = 0; i < ret; i++) { in fpm_event_kqueue_wait() 138 if (kevents[i].udata) { in fpm_event_kqueue_wait() 139 struct fpm_event_s *ev = (struct fpm_event_s *)kevents[i].udata; in fpm_event_kqueue_wait()
|
/php-src/ext/openssl/ |
H A D | openssl.c | 666 for (i = 0; i < X509_NAME_entry_count(name); i++) { in php_openssl_add_assoc_name_entry() 881 for (i = 0; i < sk_CONF_VALUE_num(sktmp); i++) { in php_openssl_add_oid_section() 2037 for (i = 0; i < num; i++) { in openssl_x509v3_subjectAltName() 2171 for (i = 0; i < X509_PURPOSE_get_count(); i++) { in PHP_FUNCTION() 2200 for (i = 0; i < X509_get_ext_count(cert); i++) { in PHP_FUNCTION() 2827 for (i = 0; i < cert_num; i++) { in PHP_FUNCTION() 5750 for (i = 0; i < sk_X509_num(certs); i++) { in PHP_FUNCTION() 6391 for (i = 0; i < sk_X509_num(certs); i++) { in PHP_FUNCTION() 7152 for (i=0; i<nkeys; i++) { in PHP_FUNCTION() 7170 for (i=0; i<nkeys; i++) { in PHP_FUNCTION() [all …]
|
/php-src/ext/odbc/ |
H A D | php_odbc.c | 226 for (int i = 0; i < res->numcols; i++) { in odbc_result_free() local 695 for(i = 0; i < result->numcols; i++) { in odbc_bindcols() 988 for (i=0;i<result->numparams;i++) { in PHP_FUNCTION() 1053 for(i = 0; i < result->numparams; i++) { in PHP_FUNCTION() 1441 for(i = 0; i < result->numcols; i++) { in php_odbc_fetch_hash() 1603 for(i = 0; i < result->numcols; i++) { in PHP_FUNCTION() 1780 for(i = 0; i < result->numcols; i++) { in PHP_FUNCTION() 1990 for (i = 0; i < result->numcols; i++) { in PHP_FUNCTION() 1999 for(i = 0; i < result->numcols; i++) { in PHP_FUNCTION() 2478 for(i = 0; i < result->numcols; i++) { [all …]
|
/php-src/ |
H A D | UPGRADING | 25 previously skipped if the path looked like it was referring to a file, i.e. 224 modifier ("i"), the expression locks out mixing of ASCII and non-ASCII
|
/php-src/ext/pgsql/ |
H A D | pgsql.c | 283 if (i>2 && (message[i-2] == '\r' || message[i-2] == '\n') && message[i-1] == '.') { in _php_pgsql_trim_message() 284 --i; in _php_pgsql_trim_message() 286 while (i>1 && (message[i-1] == '\r' || message[i-1] == '\n')) { in _php_pgsql_trim_message() 287 --i; in _php_pgsql_trim_message() 392 for (i = 1; i < len-1; i++) { in _php_pgsql_identifier_is_escaped() 393 if (identifier[i] == '"' && (identifier[++i] != '"' || i == len-1)) { in _php_pgsql_identifier_is_escaped() 1055 for (i = 0; i < num_params; i++) { in _php_pgsql_free_params() 1484 for (int i = 0; i < num_rows; i++) { in get_field_name() local 1837 for (i = 0, num_fields = PQnfields(pgsql_result); i < num_fields; i++) { in php_pgsql_fetch_hash() 4302 for (i = 0; i < num_rows; i++) { in php_pgsql_meta_data() [all …]
|
/php-src/ext/pgsql/tests/ |
H A D | gh13519.phpt | 13 for ($i = 0; $i < 3; $i ++) { 17 for ($i = 0; $i < 3; $i ++) {
|
/php-src/ext/opcache/jit/ir/ |
H A D | ir_x86.dasc | 3515 for (i = IR_REG_GP_FIRST; i <= IR_REG_GP_LAST; i++) { 3540 for (i = IR_REG_FP_FIRST; i <= IR_REG_FP_LAST; i++) { 3587 for (i = ctx->gp_reg_params; i < IR_REG_INT_ARGS; i++) { 3597 for (i = ctx->fp_reg_params; i < IR_REG_FP_ARGS; i++) { 3626 for (i = 0; i < IR_REG_NUM; i++) { 3656 for (i = IR_REG_GP_LAST; i >= IR_REG_GP_FIRST; i--) { 3667 for (i = IR_REG_GP_LAST; i >= IR_REG_GP_FIRST; i--) { 8222 for (i = 0; i <= (max.i64 - min.i64); i++) { 8332 for (i = 0; i <= (max.i64 - min.i64); i++) { 9898 for (i = bb->start, insn = ctx->ir_base + i, rule = ctx->rules + i; i <= bb->end;) { [all …]
|
H A D | ir_sccp.c | 660 for (i = 2; i <= n; i++) { in ir_sccp_remove_unfeasible_merge_inputs() 669 for (i = 2; i <= n; i++) { in ir_sccp_remove_unfeasible_merge_inputs() 679 i = 1; in ir_sccp_remove_unfeasible_merge_inputs() 689 i++; in ir_sccp_remove_unfeasible_merge_inputs() 692 j = i; in ir_sccp_remove_unfeasible_merge_inputs() 697 i--; in ir_sccp_remove_unfeasible_merge_inputs() 723 i++; in ir_sccp_remove_unfeasible_merge_inputs() 1319 for (i = 0; i < count; i++) { in ir_try_remove_empty_diamond() 1361 for (i = 0; i < count; i++) { in ir_try_remove_empty_diamond() 2402 for (i = 1; i < ctx->insns_count; i++) { in ir_sccp() [all …]
|
H A D | ir_private.h | 354 for (i = 0; i < len; i++) { in ir_bitset_empty() 376 for (i = 0; i < len; i++) { in ir_bitset_intersection() 377 set1[i] &= set2[i]; in ir_bitset_intersection() 385 for (i = 0; i < len; i++) { in ir_bitset_union() 386 set1[i] |= set2[i]; in ir_bitset_union() 394 for (i = 0; i < len; i++) { in ir_bitset_difference() 395 set1[i] = set1[i] & ~set2[i]; in ir_bitset_difference() 403 for (i = 0; i < len; i++) { in ir_bitset_is_subset() 404 if (set1[i] & ~set2[i]) { in ir_bitset_is_subset() 415 for (i = 0; i < len; i++) { in ir_bitset_first() [all …]
|
H A D | ir_cfg.c | 305 for (i = 0; i < bb->predecessors_count; i++, p++) { in ir_remove_predecessor() 328 i = 1; in ir_remove_merge_input() 341 i--; in ir_remove_merge_input() 940 for (; i < j; i++) { in ir_find_loops() 1206 for (i = 0; i < edges_count; i++) { in ir_dump_cfg_freq_graph() 1219 for (i = 0; i < edges_count; i++) { in ir_dump_edges() 1238 i = chains[i].next; in ir_dump_chains() 1515 for (e = edges, i = edges_count; i > 0; e++, i--) { in ir_schedule_blocks_bottom_up() 1569 for (i = 0; i < ctx->entries_count; i++) { in ir_schedule_blocks_bottom_up() 1607 for (e = edges, i = edges_count; i > 0; e++, i--) { in ir_schedule_blocks_bottom_up() [all …]
|
H A D | ir_gcm.c | 360 for (i = 0; i < clones_count; i++) { in ir_split_partially_dead_node() 378 for (i = 1; i < clones_count; i++) { in ir_split_partially_dead_node() 390 for (i = 0; i < clones_count; i++) { in ir_split_partially_dead_node() 813 for (i = 1; i != 0; i = _next[i]) { in ir_schedule() 841 i = _next[i]; in ir_schedule() 848 i = _next[i]; in ir_schedule() 864 i = _next[i]; in ir_schedule() 928 i = _next[i]; in ir_schedule() 944 for (i = 1; i != 0; i = _next[i]) { in ir_schedule() 955 for (i = 1; i != 0; i = _next[i]) { in ir_schedule() [all …]
|
H A D | ir_aarch64.dasc | 1608 for (i = 0; i < IR_REG_NUM; i++) { 1674 for (i = ctx->gp_reg_params; i < IR_REG_INT_ARGS; i++) { 1697 for (i = ctx->fp_reg_params; i < IR_REG_FP_ARGS; i++) { 1724 for (i = 0; i < IR_REG_NUM; i++) { 4499 for (i = 0; i <= (max.i64 - min.i64); i++) { 4556 for (i = 0; i <= (max.i64 - min.i64); i++) { 5371 for (i = 0, p = &ctx->use_edges[use_list->refs]; i < n; i++, p++) { 5481 for (i = 0, p = &ctx->use_edges[use_list->refs]; i < n; i++, p++) { 5550 for (i = bb->start, insn = ctx->ir_base + i, rule = ctx->rules + i; i <= bb->end;) { 6149 for (i = 0; i < ctx->deoptimization_exits; i++) { [all …]
|
H A D | ir.c | 1072 for (i = 1, p = insn->ops + i; i <= (count|3); i++, p++) { 1135 for (i = IR_UNUSED + 1, insn = ctx->ir_base + i; i < ctx->insns_count;) { 1155 for (i = IR_UNUSED + 1, use_list = &lists[i]; i < ctx->insns_count; i++, use_list++) { 1310 for (i = 0, p = &ctx->use_edges[use_list->refs]; i < n; i++, p++) { 1324 for (i = 0, p = &ctx->use_edges[use_list->refs]; i < n; i++, p++) { 1399 for (i = 0; i < l->len; i++) { 1953 for (i = 1; i < n; i++) { 1966 for (i = 0; i < n; i++) { 2244 for (i = 0; i < merge->inputs_count; i++) { 2353 for (i = 0; i < count; i++) { [all …]
|
H A D | ir_ra.c | 414 for (i = ctx->vregs_count; i > 0; i--) { in ir_hint_propagation() 907 for (i = 0; i < ctx->entries_count; i++) { in ir_compute_live_ranges() 989 for (i = ctx->insns_count - 1; i > 0; i--) { in ir_compute_live_sets() 1490 for (i = 0; i < ctx->entries_count; i++) { in ir_compute_live_ranges() 1661 for (i = 1; i < ctx->insns_count; i++) { in ir_vregs_coalesce() 1672 for (i = 1; i < ctx->insns_count; i++) { in ir_vregs_coalesce() 1988 for (i = 1; i < ctx->insns_count; rule++, i++) { in ir_coalesce() 2027 for (i = 1, n = 1; i <= ctx->vregs_count; i++) { in ir_coalesce() 2041 for (i = n + 1; i <= n + IR_REG_NUM + 2; i++) { in ir_coalesce() 3879 for (i = 1; i <= ctx->vregs_count; i++) { in assign_regs() [all …]
|
H A D | ir_check.c | 91 ir_ref i, j, n, *p, use; in ir_check() local 97 for (i = IR_UNUSED + 1, insn = ctx->ir_base + i; i < ctx->insns_count;) { in ir_check() 129 && use >= i in ir_check() 197 fprintf(stderr, "ir_base[%d].ops[%d] -> %d, %d doesn't dominate %d\n", i, j, use, use, i); in ir_check() 216 && use >= i in ir_check() 250 && !ir_check_use_list(ctx, use, i)) { in ir_check() 270 i, ir_type_name[type]); in ir_check() 297 ir_use_list *use_list = &ctx->use_lists[i]; in ir_check() 302 if (!ir_check_input_list(ctx, i, use)) { in ir_check() 366 i, ir_op_name[insn->op], count); in ir_check() [all …]
|
/php-src/ext/dom/ |
H A D | node.c | 1667 for (size_t i = 0; i < count; i++) { \
|
/php-src/ext/mbstring/ |
H A D | mbstring.c | 569 for (i = 0; i < len && start[i] != quote; ++i) { in php_mb_rfc1867_substring_conf() 1380 for (size_t i = 0; i < n; i++) { in PHP_FUNCTION() local 3035 for (size_t i = 0; i < out_len; i++) { in trim_each_wchar() local 3228 for (size_t i = 0; i < length; i++) { in init_candidate_array() local 3262 for (size_t i = 0; i < length; i++) { in start_string() local 3293 for (size_t i = 0; i < length; i++) { in count_demerits() local 3335 for (size_t i = 0; i < length; i++) { in count_demerits() local 4555 for (i = 0; to_r[i]; i++) { in PHP_FUNCTION() 4745 for (i = 0; i < n; i++) { in PHP_FUNCTION() 4811 for (i = 0; i < n; i++) { in PHP_FUNCTION() [all …]
|
/php-src/Zend/ |
H A D | zend_alloc.c | 903 int i = 0; 945 uint32_t i = 0; local 968 if (i >= free_tail || i == ZEND_MM_PAGES) { 1272 uint32_t i = 1; local 1275 chunk->map[page_num+i] = ZEND_MM_NRUN(bin_num, i); 1276 i++; 1974 for (i = 0; i < ZEND_MM_BINS; i++) { 2055 i++; 2125 i++; 2162 uint32_t i, j; local [all …]
|
H A D | zend_strtod.c | 821 (i) int i; in i2b() 1024 for(i = b->maxwds; n1 > i; i <<= 1) 1028 for(i = 0; i < n; i++) 1538 for(i = 0; (j = s[i]) !=0; i++) 1854 for(i = 0; decimalpoint[i]; ++i) { 1877 for(i = 1; decimalpoint[i]; ++i) { 1975 for(i = 0; decimalpoint[i+1]; ++i); 2655 for(i = 1; i < nz; i++) 3015 for(i = 0; i < nd0; ++i) 3054 i = Emin - i; [all …]
|
H A D | zend.c | 175 if (i >= 0 && i <= 1000000) { in ZEND_INI_MH() 375 int i; in print_hash() local 377 for (i = 0; i < indent; i++) { in print_hash() 383 for (i = 0; i < indent; i++) { in print_hash() 414 for (i = 0; i < indent; i++) { in print_hash() 426 int i = 0; in print_flat_hash() local 429 if (i++ > 0) { in print_flat_hash() 1714 for (uint32_t i = 0; i < EG(num_errors); i++) { in zend_emit_recorded_errors() local 1726 for (uint32_t i = 0; i < EG(num_errors); i++) { in zend_free_recorded_errors() local 1922 int i; in zend_execute_scripts() local [all …]
|
/php-src/ext/dom/lexbor/lexbor/html/tree/ |
H A D | active_formatting.c | 72 for (size_t i = 0; i < tree->active_formatting->length; i++) { in lxb_html_tree_active_formatting_find_by_node() local 73 if (list[i] == node) { in lxb_html_tree_active_formatting_find_by_node() 75 *return_pos = i; in lxb_html_tree_active_formatting_find_by_node()
|
H A D | open_elements.c | 152 for (size_t i = 0; i < tree->open_elements->length; i++) { in lxb_html_tree_open_elements_find_by_node() local 153 if (list[i] == node) { in lxb_html_tree_open_elements_find_by_node() 155 *return_pos = i; in lxb_html_tree_open_elements_find_by_node() 204 for (size_t i = 0; i < tree->open_elements->length; i++) { in lxb_html_tree_open_elements_find() local 205 node = list[i]; in lxb_html_tree_open_elements_find() 209 *return_index = i; in lxb_html_tree_open_elements_find()
|
/php-src/ext/dom/lexbor/lexbor/html/tree/insertion_mode/ |
H A D | in_table_text.c | 83 for (size_t i = 0; i < lexbor_array_obj_length(pt_list); i++) { in lxb_html_tree_insertion_mode_in_table_text() local 84 text = lexbor_array_obj_get(pt_list, i); in lxb_html_tree_insertion_mode_in_table_text() 98 for (size_t i = 0; i < lexbor_array_obj_length(pt_list); i++) { in lxb_html_tree_insertion_mode_in_table_text() local 99 text = lexbor_array_obj_get(pt_list, i); in lxb_html_tree_insertion_mode_in_table_text() 122 for (size_t i = 0; i < lexbor_array_obj_length(pt_list); i++) { in lxb_html_tree_insertion_mode_in_table_text_erase() local 123 text = lexbor_array_obj_get(pt_list, i); in lxb_html_tree_insertion_mode_in_table_text_erase()
|
H A D | initial.c | 292 size_t size, i; in lxb_html_tree_insertion_mode_initial_doctype_ckeck_public() local 299 for (i = 0; i < size; i++) { in lxb_html_tree_insertion_mode_initial_doctype_ckeck_public() 300 str = &lxb_html_tree_insertion_mode_initial_doctype_public_is[i]; in lxb_html_tree_insertion_mode_initial_doctype_ckeck_public() 314 for (i = 0; i < size; i++) { in lxb_html_tree_insertion_mode_initial_doctype_ckeck_public() 315 str = &lxb_html_tree_insertion_mode_initial_doctype_public_start[i]; in lxb_html_tree_insertion_mode_initial_doctype_ckeck_public() 339 for (size_t i = 0; i < size; i++) { in lxb_html_tree_insertion_mode_initial_doctype_ckeck_system() local 340 str = &lxb_html_tree_insertion_mode_initial_doctype_system_is[i]; in lxb_html_tree_insertion_mode_initial_doctype_ckeck_system() 364 for (size_t i = 0; i < size; i++) { in lxb_html_tree_insertion_mode_initial_doctype_ckeck_pubsys() local 365 str = &lxb_html_tree_insertion_mode_initial_doctype_sys_pub_start[i]; in lxb_html_tree_insertion_mode_initial_doctype_ckeck_pubsys() 399 for (size_t i = 0; i < size; i++) { in lxb_html_tree_insertion_mode_initial_doctype_check_limq() local [all …]
|
/php-src/ext/dom/lexbor/lexbor/html/ |
H A D | tree.c | 590 for (size_t i = 0; i < len; i++) { in lxb_html_tree_adjust_svg_attributes() local 591 adjust = &lxb_html_tree_res_attr_adjust_svg_map[i]; in lxb_html_tree_adjust_svg_attributes() 631 for (size_t i = 0; i < len; i++) { in lxb_html_tree_adjust_foreign_attributes() local 632 adjust = &lxb_html_tree_res_attr_adjust_foreign_map[i]; in lxb_html_tree_adjust_foreign_attributes() 1324 for (size_t i = 0; i < tree->open_elements->length; i++) { in lxb_html_tree_check_scope_element() local 1325 node = tree->open_elements->list[i]; in lxb_html_tree_check_scope_element()
|