/php-src/.github/actions/build-libmysqlclient/ |
H A D | action.yml | 33 make -j$(/usr/bin/nproc) >/dev/null
|
/php-src/.github/actions/test-linux/ |
H A D | action.yml | 50 … ${{ inputs.idleCpu == 'true' && '-j$(($(/usr/bin/nproc) - 1))' || '-j$(/usr/bin/nproc)' }} \
|
/php-src/.github/actions/test-macos/ |
H A D | action.yml | 26 -j$(($(sysctl -n hw.ncpu) - 1)) \
|
/php-src/.github/workflows/ |
H A D | nightly.yml | 99 run: make -j$(/usr/bin/nproc) >/dev/null 190 run: make -j$(/usr/bin/nproc) >/dev/null 323 run: make -j$(/usr/bin/nproc) >/dev/null 380 run: make -j$(/usr/bin/nproc) >/dev/null 838 make -j$(/usr/bin/nproc) 845 make -j$(/usr/bin/nproc) 851 make -j$(/usr/bin/nproc) 857 make -j$(/usr/bin/nproc) 865 make -j$(/usr/bin/nproc) 871 make -j$(/usr/bin/nproc) [all …]
|
H A D | push.yml | 128 run: make -j$(/usr/bin/nproc) >/dev/null 180 make -j$(sysctl -n hw.logicalcpu) >/dev/null 268 run: make -j$(/usr/bin/nproc) >/dev/null
|
/php-src/ |
H A D | README.md | 65 Build PHP. To speed up the build, specify the maximum number of jobs using `-j`:
|
/php-src/TSRM/ |
H A D | TSRM.c | 255 int j; in tsrm_update_active_threads() local 258 for (j=p->count; j<id_count; j++) { in tsrm_update_active_threads() 259 if (resource_types_table[j].fast_offset) { in tsrm_update_active_threads() 260 p->storage[j] = (void *) (((char*)p) + resource_types_table[j].fast_offset); in tsrm_update_active_threads() 262 p->storage[j] = (void *) malloc(resource_types_table[j].size); in tsrm_update_active_threads() 264 if (resource_types_table[j].ctor) { in tsrm_update_active_threads() 265 resource_types_table[j].ctor(p->storage[j]); in tsrm_update_active_threads()
|
/php-src/Zend/Optimizer/ |
H A D | block_pass.c | 77 uint32_t i, j; in strip_nops() local 92 i = j = b->start + 1; in strip_nops() 95 if (i != j) { in strip_nops() 98 j++; in strip_nops() 103 while (j < i) { in strip_nops() 105 j++; in strip_nops() 1052 int i, j; in assemble_code_blocks() local 1059 map[i] = j; in assemble_code_blocks() 1076 j++; in assemble_code_blocks() 1079 if (i != j) { in assemble_code_blocks() [all …]
|
H A D | compact_literals.c | 309 j = 0; in zend_optimizer_compact_literals() 328 j++; in zend_optimizer_compact_literals() 340 j++; in zend_optimizer_compact_literals() 352 j++; in zend_optimizer_compact_literals() 368 j++; in zend_optimizer_compact_literals() 388 j += 2; in zend_optimizer_compact_literals() 408 j++; in zend_optimizer_compact_literals() 435 j++; in zend_optimizer_compact_literals() 440 j++; in zend_optimizer_compact_literals() 455 j++; in zend_optimizer_compact_literals() [all …]
|
H A D | dfa_pass.c | 119 int j; in zend_ssa_remove_nops() local 200 for (j = 0; j < ssa->vars_count; j++) { in zend_ssa_remove_nops() 201 if (ssa->vars[j].definition >= 0) { in zend_ssa_remove_nops() 202 ssa->vars[j].definition -= shiftlist[ssa->vars[j].definition]; in zend_ssa_remove_nops() 204 if (ssa->vars[j].use_chain >= 0) { in zend_ssa_remove_nops() 205 ssa->vars[j].use_chain -= shiftlist[ssa->vars[j].use_chain]; in zend_ssa_remove_nops() 229 for (j = 0; j < op_array->last_try_catch; j++) { in zend_ssa_remove_nops() 230 op_array->try_catch_array[j].try_op -= shiftlist[op_array->try_catch_array[j].try_op]; in zend_ssa_remove_nops() 231 op_array->try_catch_array[j].catch_op -= shiftlist[op_array->try_catch_array[j].catch_op]; in zend_ssa_remove_nops() 233 op_array->try_catch_array[j].finally_op -= shiftlist[op_array->try_catch_array[j].finally_op]; in zend_ssa_remove_nops() [all …]
|
H A D | escape_analysis.c | 59 static zend_always_inline void union_find_unite(int *parent, int *size, int i, int j) /* {{{ */ in union_find_unite() argument 62 int r2 = union_find_root(parent, j); in union_find_unite() 81 int i, j; in zend_build_equi_escape_sets() local 97 for (j = 0; j < ssa->cfg.blocks[p->block].predecessors_count; j++) { in zend_build_equi_escape_sets() 98 union_find_unite(parent, size, i, p->sources[j]); in zend_build_equi_escape_sets()
|
H A D | nop_removal.c | 37 int j; in zend_optimizer_nop_removal() local 84 for (j = 0; j < op_array->last_try_catch; j++) { in zend_optimizer_nop_removal() 85 op_array->try_catch_array[j].try_op -= shiftlist[op_array->try_catch_array[j].try_op]; in zend_optimizer_nop_removal() 86 op_array->try_catch_array[j].catch_op -= shiftlist[op_array->try_catch_array[j].catch_op]; in zend_optimizer_nop_removal() 87 if (op_array->try_catch_array[j].finally_op) { in zend_optimizer_nop_removal() 88 op_array->try_catch_array[j].finally_op -= shiftlist[op_array->try_catch_array[j].finally_op]; in zend_optimizer_nop_removal() 89 op_array->try_catch_array[j].finally_end -= shiftlist[op_array->try_catch_array[j].finally_end]; in zend_optimizer_nop_removal()
|
H A D | scdf.c | 161 int j, end = block->start + block->len; in scdf_solve() local 162 for (j = block->start; j < end; j++) { in scdf_solve() 163 opline = &scdf->op_array->opcodes[j]; in scdf_solve() 164 zend_bitset_excl(scdf->instr_worklist, j); in scdf_solve() 166 scdf->handlers.visit_instr(scdf, opline, &ssa->ops[j]); in scdf_solve() 175 j--; in scdf_solve() 177 scdf->handlers.mark_feasible_successors(scdf, i, block, opline, &ssa->ops[j-1]); in scdf_solve()
|
H A D | ssa_integrity.c | 345 int j; in ssa_verify_integrity() local 346 for (j = i + 1; j < num_sources; j++) { in ssa_verify_integrity() 347 if (phi->sources[j] == source && phi->use_chains[j]) { in ssa_verify_integrity() 363 int s, j; in ssa_verify_integrity() local 374 for (j = block->start; j < block->start + block->len; j++) { in ssa_verify_integrity() 375 if (cfg->map[j] != i) { in ssa_verify_integrity() 401 for (j = 0; j < block->predecessors_count; j++) { in ssa_verify_integrity() 402 if (predecessors[j] >= 0) { in ssa_verify_integrity() 404 zend_basic_block *prev_block = &cfg->blocks[predecessors[j]]; in ssa_verify_integrity() 409 FAIL("Block %d successors missing %d\n", predecessors[j], i); in ssa_verify_integrity() [all …]
|
H A D | zend_cfg.c | 124 for (j = 0; j < op_array->last_try_catch; j++) { in zend_mark_reachable_blocks() 211 for (j = b->start; j < b->start + b->len; j++) { in zend_mark_reachable_blocks() 450 for (j = 0; j < op_array->last_try_catch; j++) { in zend_build_cfg() 495 for (j = 0; j < blocks_count; j++) { in zend_build_cfg() 630 for (j = 0; j < cfg->blocks_count; j++) { in zend_cfg_build_predecessors() 697 for (j = 1; j < blocks_count; j++) { in zend_cfg_compute_dominators_tree() 726 for (j = 1; j < blocks_count; j++) { in zend_cfg_compute_dominators_tree() 747 for (j = 0; j < blocks_count; j++) { in zend_cfg_compute_dominators_tree() 812 for (j = blocks[i].children; j >= 0; j = blocks[j].next_child) { in zend_cfg_identify_loops() 818 for (j = 0; j < blocks[i].successors_count; j++) { in zend_cfg_identify_loops() [all …]
|
H A D | zend_dfg.c | 259 int j; in zend_build_dfg() local 269 for (j = 0; j < blocks_count; j++) { in zend_build_dfg() 278 end = opline + blocks[j].len; in zend_build_dfg() 279 b_use = DFG_BITSET(use, set_size, j); in zend_build_dfg() 280 b_def = DFG_BITSET(def, set_size, j); in zend_build_dfg() 295 for (j = 0; j < blocks_count; j++) { in zend_build_dfg() 296 zend_bitset_incl(worklist, j); in zend_build_dfg() 302 zend_bitset_excl(worklist, j); in zend_build_dfg() 307 if (blocks[j].successors_count != 0) { in zend_build_dfg() 308 …zend_bitset_copy(DFG_BITSET(out, set_size, j), DFG_BITSET(in, set_size, blocks[j].successors[0]), … in zend_build_dfg() [all …]
|
H A D | zend_dump.c | 872 j = cfg->blocks[j].next_child; in zend_dump_block_info() 875 j = cfg->blocks[j].next_child; in zend_dump_block_info() 894 for (j = 0; j < cfg->blocks[n].predecessors_count; j++) { in zend_dump_block_header() 1166 int j; in zend_dump_dominators() local 1171 for (j = 0; j < cfg->blocks_count; j++) { in zend_dump_dominators() 1181 int j; in zend_dump_ssa_variables() local 1188 for (j = 0; j < ssa->vars_count; j++) { in zend_dump_ssa_variables() 1225 int j; in zend_dump_dfg() local 1230 for (j = 0; j < cfg->blocks_count; j++) { in zend_dump_dfg() 1241 int j; in zend_dump_phi_placement() local [all …]
|
H A D | zend_inference.c | 230 for (j = 0; j < ssa->vars_count; j++) { 238 for (j = 0; j < ssa->vars_count; j++) { 246 for (j = 0; j < ssa->vars_count; j++) { 459 for (j = 0; j < ssa->vars_count; j++) { in zend_ssa_find_sccs() 467 for (j = 0; j < ssa->vars_count; j++) { in zend_ssa_find_sccs() 475 for (j = 0; j < ssa->vars_count; j++) { in zend_ssa_find_sccs() 1755 j = next_scc_var[j]; in zend_infer_ranges_warmup() 1855 for (j = 0; j < ssa->vars_count; j++) { in zend_infer_ranges() 1903 for (j = scc_var[scc]; j >= 0; j = next_scc_var[j]) { in zend_infer_ranges() 1919 for (j = scc_var[scc]; j >= 0; j = next_scc_var[j]) { in zend_infer_ranges() [all …]
|
H A D | zend_ssa.c | 246 for (j = 0; j < blocks_count; j++) { in place_essa_pis() 878 for (j = 0; j < blocks[succ].predecessors_count; j++) { in zend_ssa_rename() 887 for (j = 0; j < blocks[succ].predecessors_count; j++) in zend_ssa_rename() 925 j = blocks[j].next_child; in zend_ssa_rename() 987 for (j = 0; j < blocks_count; j++) { in zend_build_ssa() 1023 for (j = 0; j < blocks_count; j++) { in zend_build_ssa() 1067 for (j = 0; j < op_array->last_var; j++) { in zend_build_ssa() 1068 var[j] = j; in zend_build_ssa() 1394 for (j = 0; j < predecessors_count; j++) { in zend_ssa_remove_phi_source() 1466 for (j = 0; j < next_block->predecessors_count; j++) { in zend_ssa_remove_predecessor() [all …]
|
H A D | zend_ssa.h | 210 int j; in zend_ssa_next_use_phi() local 211 for (j = 0; j < ssa->cfg.blocks[p->block].predecessors_count; j++) { in zend_ssa_next_use_phi() 212 if (p->sources[j] == var) { in zend_ssa_next_use_phi() 213 return p->use_chains[j]; in zend_ssa_next_use_phi()
|
/php-src/Zend/ |
H A D | bench.php | 234 $j = $l << 1; 235 while ($j <= $ir) { 236 if (($j < $ir) && ($ra[$j] < $ra[$j+1])) { 237 $j++; 239 if ($rra < $ra[$j]) { 240 $ra[$i] = $ra[$j]; 241 $j += ($i = $j); 243 $j = $ir + 1; 271 for ($j=0; $j<$cols; $j++) { 281 for ($j=0; $j<$cols; $j++) { [all …]
|
H A D | micro_bench.php | 213 $f = false; $j = 0; 215 $x = $f ?: $j + 1; 228 $f = false; $j = 0; 230 $x = $f ? $f : $j + 1;
|
/php-src/Zend/tests/assert/ |
H A D | expect_015.phpt | 39 for ($i = 0, $j = 100; $i < $j; $i++, --$j) { 40 $s[$i] = $a[$j]; 200 for ($i = 0, $j = 100; $i < $j; $i++, --$j) { 201 $s[$i] = $a[$j];
|
/php-src/Zend/tests/ |
H A D | bug40809.phpt | 24 for ($j=0;$j<$num_increments;$j++) {
|
H A D | bug44069.phpt | 13 for($j = 1; $j <= 10; $j++)
|