max 1017 Zend/zend.c CG(stack).top = CG(stack).max = 0; \
max 31 Zend/zend_ptr_stack.c stack->top = stack->max = 0;
max 26 Zend/zend_ptr_stack.h int top, max;
max 50 Zend/zend_ptr_stack.h stack->max += PTR_STACK_BLOCK_SIZE; \
max 51 Zend/zend_ptr_stack.h } while (stack->top+count > stack->max); \
max 52 Zend/zend_ptr_stack.h stack->elements = (void **) perealloc(stack->elements, (sizeof(void *) * (stack->max)), stack->persistent); \
max 28 Zend/zend_stack.c stack->max = 0;
max 35 Zend/zend_stack.c if (stack->top >= stack->max) { /* we need to allocate more memory */
max 37 Zend/zend_stack.c (sizeof(void **) * (stack->max += STACK_BLOCK_SIZE)));
max 26 Zend/zend_stack.h int top, max;
max 86 ext/exif/exif.c #ifndef max
max 2367 ext/exif/exif.c value_ptr = safe_emalloc(max(byte_count, 4), 1, 0);
max 100 ext/fileinfo/libmagic/apprentice.c uint32_t max;
max 929 ext/fileinfo/libmagic/apprentice.c if (mset[i].count == mset[i].max) {
max 932 ext/fileinfo/libmagic/apprentice.c mset[i].max += ALLOC_INCR;
max 934 ext/fileinfo/libmagic/apprentice.c erealloc(mset[i].me, sizeof(*mp) * mset[i].max))) ==
max 936 ext/fileinfo/libmagic/apprentice.c file_oomem(ms, sizeof(*mp) * mset[i].max);
max 4331 ext/gd/gd.c str_bbox.urx = max(str_bbox.urx, max(x1, max(x2, max(x3, x4))));
max 4332 ext/gd/gd.c str_bbox.ury = max(str_bbox.ury, max(y1, max(y2, max(y3, y4))));
max 2961 ext/gd/libgd/gd.c if( dst > max ) {
max 2963 ext/gd/libgd/gd.c return dst + (src << 1) - (dst * src / max) - max;
max 2966 ext/gd/libgd/gd.c return dst * src / max;
max 2432 ext/gd/libgd/gd_interpolation.c gdPointF extent[4], min, max, point;
max 2451 ext/gd/libgd/gd_interpolation.c max=extent[0];
max 2458 ext/gd/libgd/gd_interpolation.c if (max.x < extent[i].x)
max 2459 ext/gd/libgd/gd_interpolation.c max.x=extent[i].x;
max 2460 ext/gd/libgd/gd_interpolation.c if (max.y < extent[i].y)
max 2461 ext/gd/libgd/gd_interpolation.c max.y=extent[i].y;
max 2465 ext/gd/libgd/gd_interpolation.c bbox->width = (int) floor(max.x - min.x) - 1;
max 2466 ext/gd/libgd/gd_interpolation.c bbox->height = (int) floor(max.y - min.y);
max 632 ext/gmp/gmp.c const unsigned char *p, *max;
max 641 ext/gmp/gmp.c max = buf + buf_len;
max 644 ext/gmp/gmp.c if (!php_var_unserialize(&zv_ptr, &p, max, &unserialize_data TSRMLS_CC)
max 654 ext/gmp/gmp.c if (!php_var_unserialize(&zv_ptr, &p, max, &unserialize_data TSRMLS_CC)
max 945 ext/interbase/ibase_query.c res = emalloc(sizeof(ibase_result)+sizeof(ibase_array)*max(0,ib_query->out_array_cnt-1));
max 188 ext/interbase/php_ibase_includes.h #ifndef max
max 2152 ext/mbstring/oniguruma/regcomp.c *max = 0;
max 2158 ext/mbstring/oniguruma/regcomp.c *max = distance_add(*max, tmax);
max 2165 ext/mbstring/oniguruma/regcomp.c if (r == 0 && *max < tmax) *max = tmax;
max 2172 ext/mbstring/oniguruma/regcomp.c *max = sn->end - sn->s;
max 2177 ext/mbstring/oniguruma/regcomp.c *max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 2182 ext/mbstring/oniguruma/regcomp.c *max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 2192 ext/mbstring/oniguruma/regcomp.c *max = ONIG_INFINITE_DISTANCE;
max 2200 ext/mbstring/oniguruma/regcomp.c if (*max < tmax) *max = tmax;
max 2208 ext/mbstring/oniguruma/regcomp.c r = get_max_match_length(NCALL(node)->target, max, env);
max 2210 ext/mbstring/oniguruma/regcomp.c *max = ONIG_INFINITE_DISTANCE;
max 2219 ext/mbstring/oniguruma/regcomp.c r = get_max_match_length(qn->target, max, env);
max 2220 ext/mbstring/oniguruma/regcomp.c if (r == 0 && *max != 0) {
max 2222 ext/mbstring/oniguruma/regcomp.c *max = distance_multiply(*max, qn->upper);
max 2224 ext/mbstring/oniguruma/regcomp.c *max = ONIG_INFINITE_DISTANCE;
max 2237 ext/mbstring/oniguruma/regcomp.c *max = en->max_len;
max 2239 ext/mbstring/oniguruma/regcomp.c r = get_max_match_length(en->target, max, env);
max 2241 ext/mbstring/oniguruma/regcomp.c en->max_len = *max;
max 2249 ext/mbstring/oniguruma/regcomp.c r = get_max_match_length(en->target, max, env);
max 3931 ext/mbstring/oniguruma/regcomp.c OnigDistance max; /* max byte length */
max 4020 ext/mbstring/oniguruma/regcomp.c if (mm->max == ONIG_INFINITE_DISTANCE) return 0;
max 4022 ext/mbstring/oniguruma/regcomp.c d = mm->max - mm->min;
max 4050 ext/mbstring/oniguruma/regcomp.c return (a->min == b->min && a->max == b->max) ? 1 : 0;
max 4058 ext/mbstring/oniguruma/regcomp.c mml->max = max;
max 4064 ext/mbstring/oniguruma/regcomp.c mml->min = mml->max = 0;
max 4071 ext/mbstring/oniguruma/regcomp.c to->max = from->max;
max 4078 ext/mbstring/oniguruma/regcomp.c to->max = distance_add(to->max, from->max);
max 4086 ext/mbstring/oniguruma/regcomp.c to->max = distance_add(to->max, len);
max 4094 ext/mbstring/oniguruma/regcomp.c if (to->max < from->max) to->max = from->max;
max 4418 ext/mbstring/oniguruma/regcomp.c if (add->value == 0 || to->mmd.max < add->mmd.min) {
max 4469 ext/mbstring/oniguruma/regcomp.c concat_opt_anc_info(&tanc, &to->anc, &add->anc, to->len.max, add->len.max);
max 4472 ext/mbstring/oniguruma/regcomp.c if (add->exb.len > 0 && to->len.max == 0) {
max 4474 ext/mbstring/oniguruma/regcomp.c to->len.max, add->len.max);
max 4478 ext/mbstring/oniguruma/regcomp.c if (add->map.value > 0 && to->len.max == 0) {
max 4479 ext/mbstring/oniguruma/regcomp.c if (add->map.mmd.max == 0)
max 4486 ext/mbstring/oniguruma/regcomp.c if (add->len.max != 0)
max 4503 ext/mbstring/oniguruma/regcomp.c if (add->len.max > 0) {
max 4504 ext/mbstring/oniguruma/regcomp.c if (to->expr.len > (int )add->len.max)
max 4505 ext/mbstring/oniguruma/regcomp.c to->expr.len = add->len.max;
max 4507 ext/mbstring/oniguruma/regcomp.c if (to->expr.mmd.max == 0)
max 4595 ext/mbstring/oniguruma/regcomp.c int max;
max 4599 ext/mbstring/oniguruma/regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc) * n;
max 4612 ext/mbstring/oniguruma/regcomp.c max = slen;
max 4615 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, slen, max);
max 4632 ext/mbstring/oniguruma/regcomp.c OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 4634 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4650 ext/mbstring/oniguruma/regcomp.c int i, min, max;
max 4652 ext/mbstring/oniguruma/regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 4654 ext/mbstring/oniguruma/regcomp.c if (max == 1) {
max 4679 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4686 ext/mbstring/oniguruma/regcomp.c OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 4687 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4732 ext/mbstring/oniguruma/regcomp.c OnigDistance min, max, tmin, tmax;
max 4743 ext/mbstring/oniguruma/regcomp.c r = get_max_match_length(nodes[backs[0]], &max, env->scan_env);
max 4751 ext/mbstring/oniguruma/regcomp.c if (max < tmax) max = tmax;
max 4753 ext/mbstring/oniguruma/regcomp.c if (r == 0) set_mml(&opt->len, min, max);
max 4773 ext/mbstring/oniguruma/regcomp.c OnigDistance min, max;
max 4781 ext/mbstring/oniguruma/regcomp.c if (env->mmd.max == 0 &&
max 4815 ext/mbstring/oniguruma/regcomp.c max = (nopt.len.max > 0 ? ONIG_INFINITE_DISTANCE : 0);
max 4817 ext/mbstring/oniguruma/regcomp.c max = distance_multiply(nopt.len.max, qn->upper);
max 4819 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4842 ext/mbstring/oniguruma/regcomp.c OnigDistance min, max;
max 4845 ext/mbstring/oniguruma/regcomp.c max = ONIG_INFINITE_DISTANCE;
max 4847 ext/mbstring/oniguruma/regcomp.c if (IS_ENCLOSE_MAX_FIXED(en)) max = en->max_len;
max 4848 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4919 ext/mbstring/oniguruma/regcomp.c reg->dmax = e->mmd.max;
max 4938 ext/mbstring/oniguruma/regcomp.c reg->dmax = m->mmd.max;
max 4980 ext/mbstring/oniguruma/regcomp.c reg->anchor_dmax = opt.len.max;
max 5001 ext/mbstring/oniguruma/regcomp.c if (opt.len.max == 0)
max 1030 ext/oci8/oci8.c PHP_FALIAS(max, oci_collection_max, arginfo_oci_collection_max_method)
max 267 ext/oci8/oci8_collection.c PHP_OCI_CALL_RETURN(*max, OCICollMax, (connection->env, collection->collection));
max 2364 ext/oci8/oci8_interface.c long max;
max 2379 ext/oci8/oci8_interface.c if (php_oci_collection_max(collection, &max TSRMLS_CC)) {
max 2382 ext/oci8/oci8_interface.c RETURN_LONG(max);
max 54 ext/oci8/php_oci8_int.h #if defined(max)
max 69 ext/opcache/Optimizer/optimize_temp_vars_5.c if (i > max) { \
max 70 ext/opcache/Optimizer/optimize_temp_vars_5.c max = i; \
max 83 ext/opcache/Optimizer/optimize_temp_vars_5.c int max = -1;
max 221 ext/opcache/Optimizer/optimize_temp_vars_5.c op_array->T = max + 1;
max 1591 ext/pcre/pcrelib/pcre_compile.c int max = -1;
max 1603 ext/pcre/pcrelib/pcre_compile.c if (*p == CHAR_RIGHT_CURLY_BRACKET) max = min; else
max 1607 ext/pcre/pcrelib/pcre_compile.c max = 0;
max 1610 ext/pcre/pcrelib/pcre_compile.c max = max * 10 + (int)(*p++ - CHAR_0);
max 1611 ext/pcre/pcrelib/pcre_compile.c if (max > 65535)
max 1617 ext/pcre/pcrelib/pcre_compile.c if (max < min)
max 1626 ext/pcre/pcrelib/pcre_compile.c *maxp = max;
max 649 ext/pcre/pcrelib/pcre_exec.c int max;
max 2755 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 2756 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 2763 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1 + IMM2_SIZE);
max 2764 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 2807 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 2818 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 2835 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 2899 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 2900 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 2909 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1 + IMM2_SIZE);
max 2910 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 2915 ext/pcre/pcrelib/pcre_exec.c min = max = 1;
max 2966 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 2980 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3003 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3032 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3064 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3126 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 3127 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 3136 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1 + IMM2_SIZE);
max 3137 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 3142 ext/pcre/pcrelib/pcre_exec.c min = max = 1;
max 3162 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3173 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3190 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3323 ext/pcre/pcrelib/pcre_exec.c min = max = GET2(ecode, 1);
max 3337 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 3346 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 3354 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 3362 ext/pcre/pcrelib/pcre_exec.c max = 1;
max 3381 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 3382 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 3439 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3447 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3467 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3518 ext/pcre/pcrelib/pcre_exec.c DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
max 3519 ext/pcre/pcrelib/pcre_exec.c max, (char *)eptr));
max 3552 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3560 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3575 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3613 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3621 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3634 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3714 ext/pcre/pcrelib/pcre_exec.c min = max = GET2(ecode, 1);
max 3723 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 3732 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 3740 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 3748 ext/pcre/pcrelib/pcre_exec.c max = 1;
max 3756 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 3775 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 3776 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 3791 ext/pcre/pcrelib/pcre_exec.c DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
max 3792 ext/pcre/pcrelib/pcre_exec.c max, (char *)eptr));
max 3839 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3851 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3869 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3892 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3918 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3975 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3987 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4005 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4027 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 4053 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 4082 ext/pcre/pcrelib/pcre_exec.c min = max = GET2(ecode, 1);
max 4090 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 4098 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 4105 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 4112 ext/pcre/pcrelib/pcre_exec.c max = 1;
max 4119 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 4132 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 4133 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 4879 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 4897 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4914 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4934 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4951 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4968 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4986 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5009 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5037 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5059 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5082 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5111 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5145 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5270 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5414 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5429 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5449 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5464 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5479 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5494 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5517 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5544 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5563 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5587 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5626 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5707 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5730 ext/pcre/pcrelib/pcre_exec.c if (max < INT_MAX)
max 5732 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5753 ext/pcre/pcrelib/pcre_exec.c c = max - min;
max 5763 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5794 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5816 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5837 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5852 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5867 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5882 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5897 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5912 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5949 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5972 ext/pcre/pcrelib/pcre_exec.c c = max - min;
max 5982 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6009 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6030 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6051 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6072 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6093 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6106 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6119 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6132 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6145 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6158 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 931 ext/pcre/pcrelib/pcre_jit_compile.c int min, max, i;
max 957 ext/pcre/pcrelib/pcre_jit_compile.c max = 0;
max 970 ext/pcre/pcrelib/pcre_jit_compile.c max++;
max 973 ext/pcre/pcrelib/pcre_jit_compile.c if (next[0] == type && next[1] == *begin && max >= 1)
max 978 ext/pcre/pcrelib/pcre_jit_compile.c for (i = 0; i < max; i++, next_end += 1 + LINK_SIZE)
max 982 ext/pcre/pcrelib/pcre_jit_compile.c if (i == max)
max 987 ext/pcre/pcrelib/pcre_jit_compile.c common->private_data_ptrs[max_end - common->start - LINK_SIZE + 2] = max + 2;
max 2561 ext/pcre/pcrelib/pcre_jit_compile.c SLJIT_UNUSED_ARG(max);
max 2567 ext/pcre/pcrelib/pcre_jit_compile.c if (max < 128) return;
max 2580 ext/pcre/pcrelib/pcre_jit_compile.c if (max < 0xd800) return;
max 2655 ext/pcre/pcrelib/pcre_jit_compile.c SLJIT_UNUSED_ARG(max);
max 2656 ext/pcre/pcrelib/pcre_jit_compile.c SLJIT_ASSERT(min <= max);
max 2664 ext/pcre/pcrelib/pcre_jit_compile.c if (max < 128 && !update_str_ptr) return;
max 2691 ext/pcre/pcrelib/pcre_jit_compile.c else if (min >= 0x800 && max <= 0xffff)
max 2711 ext/pcre/pcrelib/pcre_jit_compile.c else if (max >= 0x800)
max 2712 ext/pcre/pcrelib/pcre_jit_compile.c add_jump(compiler, (max < 0x10000) ? &common->utfreadchar16 : &common->utfreadchar, JUMP(SLJIT_FAST_CALL));
max 2713 ext/pcre/pcrelib/pcre_jit_compile.c else if (max < 128)
max 2739 ext/pcre/pcrelib/pcre_jit_compile.c if (max >= 0x10000)
max 2754 ext/pcre/pcrelib/pcre_jit_compile.c if (max < 0xd800 && !update_str_ptr) return;
max 2761 ext/pcre/pcrelib/pcre_jit_compile.c if (max >= 0xd800)
max 3555 ext/pcre/pcrelib/pcre_jit_compile.c int i, max, from;
max 3567 ext/pcre/pcrelib/pcre_jit_compile.c max = scan_prefix(common, common->start, chars, bytes, MAX_N_CHARS);
max 3569 ext/pcre/pcrelib/pcre_jit_compile.c if (max <= 1)
max 3572 ext/pcre/pcrelib/pcre_jit_compile.c for (i = 0; i < max; i++)
max 3586 ext/pcre/pcrelib/pcre_jit_compile.c for (i = 0; i <= max; i++)
max 3594 ext/pcre/pcrelib/pcre_jit_compile.c if (i < max && bytes[i * MAX_N_BYTES] < 255)
max 3630 ext/pcre/pcrelib/pcre_jit_compile.c for (i = 0; i < max; i++)
max 3643 ext/pcre/pcrelib/pcre_jit_compile.c for (i = max - 1; i > offsets[0]; i--)
max 3694 ext/pcre/pcrelib/pcre_jit_compile.c max -= 1;
max 3700 ext/pcre/pcrelib/pcre_jit_compile.c OP2(SLJIT_SUB, STR_END, 0, STR_END, 0, SLJIT_IMM, IN_UCHARS(max));
max 3706 ext/pcre/pcrelib/pcre_jit_compile.c OP2(SLJIT_SUB, STR_END, 0, STR_END, 0, SLJIT_IMM, IN_UCHARS(max));
max 3779 ext/pcre/pcrelib/pcre_jit_compile.c OP2(SLJIT_ADD, STR_END, 0, STR_END, 0, SLJIT_IMM, IN_UCHARS(max));
max 4752 ext/pcre/pcrelib/pcre_jit_compile.c sljit_uw c, charoffset, max = 256, min = READ_CHAR_MAX;
max 4785 ext/pcre/pcrelib/pcre_jit_compile.c if (c > max) max = c;
max 4797 ext/pcre/pcrelib/pcre_jit_compile.c if (c > max) max = c;
max 4812 ext/pcre/pcrelib/pcre_jit_compile.c if (*other_cases > max) max = *other_cases;
max 4819 ext/pcre/pcrelib/pcre_jit_compile.c max = READ_CHAR_MAX;
max 4866 ext/pcre/pcrelib/pcre_jit_compile.c read_char_range(common, min, max, (cc[-1] & XCL_NOT) != 0);
max 4891 ext/pcre/pcrelib/pcre_jit_compile.c add_jump(compiler, (cc[-1] & XCL_NOT) == 0 ? backtracks : &found, CMP(SLJIT_GREATER, TMP2, 0, SLJIT_IMM, max - min));
max 6057 ext/pcre/pcrelib/pcre_jit_compile.c int min = 0, max = 0;
max 6075 ext/pcre/pcrelib/pcre_jit_compile.c max = 0;
max 6081 ext/pcre/pcrelib/pcre_jit_compile.c max = 0;
max 6087 ext/pcre/pcrelib/pcre_jit_compile.c max = 1;
max 6093 ext/pcre/pcrelib/pcre_jit_compile.c max = GET2(cc, 1 + IMM2_SIZE + 1 + IMM2_SIZE);
max 6146 ext/pcre/pcrelib/pcre_jit_compile.c if (min > 1 || max > 1)
max 6154 ext/pcre/pcrelib/pcre_jit_compile.c if (min > 1 || max > 1)
max 6161 ext/pcre/pcrelib/pcre_jit_compile.c if (max > 1)
max 6163 ext/pcre/pcrelib/pcre_jit_compile.c jump = CMP(SLJIT_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, max);
max 6171 ext/pcre/pcrelib/pcre_jit_compile.c if (max == 0)
max 6227 ext/pcre/pcrelib/pcre_jit_compile.c if (max > 0)
max 6228 ext/pcre/pcrelib/pcre_jit_compile.c add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_GREATER_EQUAL, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, max));
max 6242 ext/pcre/pcrelib/pcre_jit_compile.c else if (max > 0)
max 7819 ext/pcre/pcrelib/pcre_jit_compile.c *max = GET2(cc, (class_len + IMM2_SIZE));
max 7824 ext/pcre/pcrelib/pcre_jit_compile.c SLJIT_ASSERT(*max != 0);
max 7827 ext/pcre/pcrelib/pcre_jit_compile.c if (*max == *min)
max 7838 ext/pcre/pcrelib/pcre_jit_compile.c *max = GET2(cc, 0);
max 7867 ext/pcre/pcrelib/pcre_jit_compile.c int max = -1, min = -1;
max 7880 ext/pcre/pcrelib/pcre_jit_compile.c cc = get_iterator_parameters(common, cc, &opcode, &type, &max, &min, &end);
max 7953 ext/pcre/pcrelib/pcre_jit_compile.c if (opcode == OP_UPTO || (opcode == OP_CRRANGE && max > 0))
max 7954 ext/pcre/pcrelib/pcre_jit_compile.c jump = CMP(SLJIT_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, max);
max 7981 ext/pcre/pcrelib/pcre_jit_compile.c else if (opcode == OP_CRRANGE && max == 0)
max 7991 ext/pcre/pcrelib/pcre_jit_compile.c CMPTO(SLJIT_LESS, TMP1, 0, SLJIT_IMM, max + 1, label);
max 8033 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, tmp_base, tmp_offset, SLJIT_IMM, max);
max 8046 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_SP), POSSESSIVE1, SLJIT_IMM, max);
max 8078 ext/pcre/pcrelib/pcre_jit_compile.c if (max != 0)
max 8080 ext/pcre/pcrelib/pcre_jit_compile.c SLJIT_ASSERT(max - min > 0);
max 8081 ext/pcre/pcrelib/pcre_jit_compile.c OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_SP), POSSESSIVE1, SLJIT_IMM, max - min);
max 8087 ext/pcre/pcrelib/pcre_jit_compile.c if (max == 0)
max 8563 ext/pcre/pcrelib/pcre_jit_compile.c int max = -1, min = -1;
max 8572 ext/pcre/pcrelib/pcre_jit_compile.c cc = get_iterator_parameters(common, cc, &opcode, &type, &max, &min, NULL);
max 8648 ext/pcre/pcrelib/pcre_jit_compile.c if (opcode == OP_CRMINRANGE && max == 0)
max 8651 ext/pcre/pcrelib/pcre_jit_compile.c CMPTO(SLJIT_LESS, TMP1, 0, SLJIT_IMM, max + 2, CURRENT_AS(iterator_backtrack)->matchingpath);
max 10 ext/pdo_mysql/get_error_codes.php $maxlen = max($maxlen, strlen($matches[1]));
max 46 ext/soap/interop/test.utility.php $d = max(min(strlen(count($m1)?$m1[1]:'0'),strlen(count($m2)?$m2[1]:'0')),2);
max 15413 ext/sqlite3/libsqlite/sqlite3.c int max;
max 15421 ext/sqlite3/libsqlite/sqlite3.c max = va_arg(ap, int);
max 15432 ext/sqlite3/libsqlite/sqlite3.c if( val<min || val>max || (nextC!=0 && nextC!=*zDate) ){
max 79201 ext/sqlite3/libsqlite/sqlite3.c i64 max = SQLITE_MAX_MMAP_SIZE;
max 79202 ext/sqlite3/libsqlite/sqlite3.c sqlite3OsFileControlHint(*ppFd, SQLITE_FCNTL_MMAP_SIZE, (void*)&max);
max 97942 ext/sqlite3/libsqlite/sqlite3.c int max;
max 97953 ext/sqlite3/libsqlite/sqlite3.c max = sqlite3_user_data(context)!=0;
max 97955 ext/sqlite3/libsqlite/sqlite3.c if( (max && cmp<0) || (!max && cmp>0) ){
max 98139 ext/sqlite3/libsqlite/sqlite3.c FUNCTION(max, -1, 1, 1, minmaxFunc ),
max 98140 ext/sqlite3/libsqlite/sqlite3.c FUNCTION(max, 0, 1, 1, 0 ),
max 98141 ext/sqlite3/libsqlite/sqlite3.c AGGREGATE2(max, 1, 1, 1, minmaxStep, minMaxFinalize,
max 1021 ext/standard/array.c zval **max, result;
max 1024 ext/standard/array.c max = args[0];
max 1027 ext/standard/array.c is_smaller_or_equal_function(&result, *args[i], *max TSRMLS_CC);
max 1029 ext/standard/array.c max = args[i];
max 1033 ext/standard/array.c RETVAL_ZVAL_FAST(*max);
max 3281 ext/standard/basic_functions.c PHP_FE(max, arginfo_max)
max 253 ext/standard/html_tables/html_table_gen.php $maxencnum = max(array_map(function($e) { return $e['enumid']; }, $encodings));
max 741 ext/standard/html_tables/html_table_gen.php $numelems = max(pow(2, ceil(log(1.5*count($origdp))/log(2))),16);
max 292 ext/standard/rand.c long max;
max 296 ext/standard/rand.c if (argc != 0 && zend_parse_parameters(argc TSRMLS_CC, "ll", &min, &max) == FAILURE)
max 301 ext/standard/rand.c RAND_RANGE(number, min, max, PHP_RAND_MAX);
max 313 ext/standard/rand.c long max;
max 318 ext/standard/rand.c if (zend_parse_parameters(argc TSRMLS_CC, "ll", &min, &max) == FAILURE) {
max 320 ext/standard/rand.c } else if (max < min) {
max 321 ext/standard/rand.c php_error_docref(NULL TSRMLS_CC, E_WARNING, "max(%ld) is smaller than min(%ld)", max, min);
max 340 ext/standard/rand.c RAND_RANGE(number, min, max, PHP_MT_RAND_MAX);
max 3213 ext/standard/string.c *max = 0;
max 3217 ext/standard/string.c if (l > *max) {
max 3218 ext/standard/string.c *max = l;
max 3232 ext/standard/string.c int pos1 = 0, pos2 = 0, max;
max 3234 ext/standard/string.c php_similar_str(txt1, len1, txt2, len2, &pos1, &pos2, &max);
max 3235 ext/standard/string.c if ((sum = max)) {
max 3240 ext/standard/string.c if ((pos1 + max < len1) && (pos2 + max < len2)) {
max 3241 ext/standard/string.c sum += php_similar_char(txt1 + pos1 + max, len1 - pos1 - max,
max 3242 ext/standard/string.c txt2 + pos2 + max, len2 - pos2 - max);
max 293 ext/standard/var_unserializer.c #define UNSERIALIZE_PARAMETER zval **rval, const unsigned char **p, const unsigned char *max, php_unserialize_data_t *var_hash TSRMLS_DC
max 294 ext/standard/var_unserializer.c #define UNSERIALIZE_PASSTHRU rval, p, max, var_hash TSRMLS_CC
max 303 ext/standard/var_unserializer.c if (!php_var_unserialize(&key, p, max, NULL TSRMLS_CC)) {
max 317 ext/standard/var_unserializer.c if (!php_var_unserialize(&data, p, max, var_hash TSRMLS_CC)) {
max 381 ext/standard/var_unserializer.c if (datalen < 0 || (max - (*p)) <= datalen) {
max 382 ext/standard/var_unserializer.c zend_error(E_WARNING, "Insufficient data for unserializing - %ld required, %ld present", datalen, (long)(max - (*p)));
max 463 ext/standard/var_unserializer.c limit = max;
max 637 ext/standard/var_unserializer.c maxlen = max - YYCURSOR;
max 856 ext/standard/var_unserializer.c maxlen = max - YYCURSOR;
max 904 ext/standard/var_unserializer.c maxlen = max - YYCURSOR;
max 96 ext/wddx/wddx.c int top, max;
max 177 ext/wddx/wddx.c stack->max = STACK_BLOCK_SIZE;
max 189 ext/wddx/wddx.c if (stack->top >= stack->max) { /* we need to allocate more memory */
max 191 ext/wddx/wddx.c (sizeof(void **) * (stack->max += STACK_BLOCK_SIZE)));
max 313 ext/zip/lib/zip_open.c zip_uint64_t min, max, j;
max 317 ext/zip/lib/zip_open.c max = cd->entry[0].orig->offset;
max 321 ext/zip/lib/zip_open.c min = max = 0;
max 333 ext/zip/lib/zip_open.c if (j > max)
max 334 ext/zip/lib/zip_open.c max = j;
max 335 ext/zip/lib/zip_open.c if (max > (zip_uint64_t)cd->offset) {
max 361 ext/zip/lib/zip_open.c return (max-min) < ZIP_INT64_MAX ? (zip_int64_t)(max-min) : ZIP_INT64_MAX;
max 365 ext/zlib/zlib.c buffer.size = (max && (max < Z->avail_in)) ? max : Z->avail_in;
max 368 ext/zlib/zlib.c if ((max && (max <= buffer.used)) || !(buffer.aptr = erealloc_recoverable(buffer.data, buffer.size))) {
max 614 main/rfc1867.c int len, max;
max 624 main/rfc1867.c max = bound - self->buf_begin;
max 629 main/rfc1867.c max = self->bytes_in_buffer;
max 633 main/rfc1867.c len = max < bytes-1 ? max : bytes-1;
max 58 sapi/apache_hooks/mod_php5.c int top, max, persistent;
max 123 sapi/apache_hooks/mod_php5.c stack->max = STACK_BLOCK_SIZE;
max 129 sapi/apache_hooks/mod_php5.c if (stack->top >= stack->max) { /* we need to allocate more memory */
max 131 sapi/apache_hooks/mod_php5.c (sizeof(void **) * (stack->max += STACK_BLOCK_SIZE)), stack->persistent);
max 84 sapi/fpm/fpm/events/devpoll.c if (max < 1) {
max 89 sapi/fpm/fpm/events/devpoll.c pollfds = malloc(sizeof(struct pollfd) * max);
max 91 sapi/fpm/fpm/events/devpoll.c zlog(ZLOG_ERROR, "poll: unable to allocate %d events", max);
max 94 sapi/fpm/fpm/events/devpoll.c memset(pollfds, 0, sizeof(struct pollfd) * max);
max 97 sapi/fpm/fpm/events/devpoll.c for (i = 0; i < max; i++) {
max 102 sapi/fpm/fpm/events/devpoll.c active_pollfds = malloc(sizeof(struct pollfd) * max);
max 105 sapi/fpm/fpm/events/devpoll.c zlog(ZLOG_ERROR, "poll: unable to allocate %d events", max);
max 108 sapi/fpm/fpm/events/devpoll.c memset(active_pollfds, 0, sizeof(struct pollfd) * max);
max 111 sapi/fpm/fpm/events/devpoll.c npollfds = max;
max 70 sapi/fpm/fpm/events/epoll.c if (max < 1) {
max 75 sapi/fpm/fpm/events/epoll.c epollfd = epoll_create(max + 1);
max 82 sapi/fpm/fpm/events/epoll.c epollfds = malloc(sizeof(struct epoll_event) * max);
max 84 sapi/fpm/fpm/events/epoll.c zlog(ZLOG_ERROR, "epoll: unable to allocate %d events", max);
max 87 sapi/fpm/fpm/events/epoll.c memset(epollfds, 0, sizeof(struct epoll_event) * max);
max 90 sapi/fpm/fpm/events/epoll.c nepollfds = max;
max 76 sapi/fpm/fpm/events/kqueue.c if (max < 1) {
max 86 sapi/fpm/fpm/events/kqueue.c kevents = malloc(sizeof(struct kevent) * max);
max 88 sapi/fpm/fpm/events/kqueue.c zlog(ZLOG_ERROR, "epoll: unable to allocate %d events", max);
max 92 sapi/fpm/fpm/events/kqueue.c memset(kevents, 0, sizeof(struct kevent) * max);
max 94 sapi/fpm/fpm/events/kqueue.c nkevents = max;
max 76 sapi/fpm/fpm/events/poll.c if (max < 1) {
max 81 sapi/fpm/fpm/events/poll.c pollfds = malloc(sizeof(struct pollfd) * max);
max 83 sapi/fpm/fpm/events/poll.c zlog(ZLOG_ERROR, "poll: unable to allocate %d events", max);
max 86 sapi/fpm/fpm/events/poll.c memset(pollfds, 0, sizeof(struct pollfd) * max);
max 89 sapi/fpm/fpm/events/poll.c for (i = 0; i < max; i++) {
max 94 sapi/fpm/fpm/events/poll.c active_pollfds = malloc(sizeof(struct pollfd) * max);
max 97 sapi/fpm/fpm/events/poll.c zlog(ZLOG_ERROR, "poll: unable to allocate %d events", max);
max 100 sapi/fpm/fpm/events/poll.c memset(active_pollfds, 0, sizeof(struct pollfd) * max);
max 103 sapi/fpm/fpm/events/poll.c npollfds = max;
max 78 sapi/fpm/fpm/events/port.c if (max < 1) {
max 83 sapi/fpm/fpm/events/port.c events = malloc(sizeof(port_event_t) * max);
max 85 sapi/fpm/fpm/events/port.c zlog(ZLOG_ERROR, "port: Unable to allocate %d events", max);
max 89 sapi/fpm/fpm/events/port.c nevents = max;
max 365 sapi/fpm/fpm/fpm_children.c int max;
max 370 sapi/fpm/fpm/fpm_children.c max = wp->config->pm_start_servers;
max 372 sapi/fpm/fpm/fpm_children.c max = wp->running_children + nb_to_spawn;
max 376 sapi/fpm/fpm/fpm_children.c max = 0; /* do not create any child at startup */
max 378 sapi/fpm/fpm/fpm_children.c max = wp->running_children + nb_to_spawn;
max 381 sapi/fpm/fpm/fpm_children.c max = wp->config->pm_max_children;
max 391 sapi/fpm/fpm/fpm_children.c while (fpm_pctl_can_spawn_children() && wp->running_children < max && (fpm_global_config.process_max < 1 || fpm_globals.running_children < fpm_global_config.process_max)) {
max 311 sapi/fpm/fpm/fpm_events.c int max;
max 324 sapi/fpm/fpm/fpm_events.c max = 1; /* only one FD is necessary at startup for the master process signal pipe */
max 328 sapi/fpm/fpm/fpm_events.c max += (wp->config->pm_max_children * 2);
max 332 sapi/fpm/fpm/fpm_events.c if (module->init(max) < 0) {
max 337 sapi/fpm/fpm/fpm_events.c zlog(ZLOG_DEBUG, "event module is %s and %d fds have been reserved", module->name, max);