max 992 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 96 ext/exif/exif.c #ifndef max
max 2377 ext/exif/exif.c value_ptr = safe_emalloc(max(byte_count, 4), 1, 0);
max 4297 ext/gd/gd.c str_bbox.urx = max(str_bbox.urx, max(x1, max(x2, max(x3, x4))));
max 4298 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 2429 ext/gd/libgd/gd_interpolation.c gdPointF extent[4], min, max, point;
max 2448 ext/gd/libgd/gd_interpolation.c max=extent[0];
max 2455 ext/gd/libgd/gd_interpolation.c if (max.x < extent[i].x)
max 2456 ext/gd/libgd/gd_interpolation.c max.x=extent[i].x;
max 2457 ext/gd/libgd/gd_interpolation.c if (max.y < extent[i].y)
max 2458 ext/gd/libgd/gd_interpolation.c max.y=extent[i].y;
max 2462 ext/gd/libgd/gd_interpolation.c bbox->width = (int) floor(max.x - min.x) - 1;
max 2463 ext/gd/libgd/gd_interpolation.c bbox->height = (int) floor(max.y - min.y);
max 947 ext/interbase/ibase_query.c res = emalloc(sizeof(ibase_result)+sizeof(ibase_array)*max(0,ib_query->out_array_cnt-1));
max 189 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 3932 ext/mbstring/oniguruma/regcomp.c OnigDistance max; /* max byte length */
max 4021 ext/mbstring/oniguruma/regcomp.c if (mm->max == ONIG_INFINITE_DISTANCE) return 0;
max 4023 ext/mbstring/oniguruma/regcomp.c d = mm->max - mm->min;
max 4051 ext/mbstring/oniguruma/regcomp.c return (a->min == b->min && a->max == b->max) ? 1 : 0;
max 4059 ext/mbstring/oniguruma/regcomp.c mml->max = max;
max 4065 ext/mbstring/oniguruma/regcomp.c mml->min = mml->max = 0;
max 4072 ext/mbstring/oniguruma/regcomp.c to->max = from->max;
max 4079 ext/mbstring/oniguruma/regcomp.c to->max = distance_add(to->max, from->max);
max 4087 ext/mbstring/oniguruma/regcomp.c to->max = distance_add(to->max, len);
max 4095 ext/mbstring/oniguruma/regcomp.c if (to->max < from->max) to->max = from->max;
max 4419 ext/mbstring/oniguruma/regcomp.c if (add->value == 0 || to->mmd.max < add->mmd.min) {
max 4470 ext/mbstring/oniguruma/regcomp.c concat_opt_anc_info(&tanc, &to->anc, &add->anc, to->len.max, add->len.max);
max 4473 ext/mbstring/oniguruma/regcomp.c if (add->exb.len > 0 && to->len.max == 0) {
max 4475 ext/mbstring/oniguruma/regcomp.c to->len.max, add->len.max);
max 4479 ext/mbstring/oniguruma/regcomp.c if (add->map.value > 0 && to->len.max == 0) {
max 4480 ext/mbstring/oniguruma/regcomp.c if (add->map.mmd.max == 0)
max 4487 ext/mbstring/oniguruma/regcomp.c if (add->len.max != 0)
max 4504 ext/mbstring/oniguruma/regcomp.c if (add->len.max > 0) {
max 4505 ext/mbstring/oniguruma/regcomp.c if (to->expr.len > (int )add->len.max)
max 4506 ext/mbstring/oniguruma/regcomp.c to->expr.len = add->len.max;
max 4508 ext/mbstring/oniguruma/regcomp.c if (to->expr.mmd.max == 0)
max 4596 ext/mbstring/oniguruma/regcomp.c int max;
max 4600 ext/mbstring/oniguruma/regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc) * n;
max 4613 ext/mbstring/oniguruma/regcomp.c max = slen;
max 4616 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, slen, max);
max 4633 ext/mbstring/oniguruma/regcomp.c OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 4635 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4651 ext/mbstring/oniguruma/regcomp.c int i, min, max;
max 4653 ext/mbstring/oniguruma/regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 4655 ext/mbstring/oniguruma/regcomp.c if (max == 1) {
max 4680 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4687 ext/mbstring/oniguruma/regcomp.c OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 4688 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4733 ext/mbstring/oniguruma/regcomp.c OnigDistance min, max, tmin, tmax;
max 4744 ext/mbstring/oniguruma/regcomp.c r = get_max_match_length(nodes[backs[0]], &max, env->scan_env);
max 4752 ext/mbstring/oniguruma/regcomp.c if (max < tmax) max = tmax;
max 4754 ext/mbstring/oniguruma/regcomp.c if (r == 0) set_mml(&opt->len, min, max);
max 4774 ext/mbstring/oniguruma/regcomp.c OnigDistance min, max;
max 4782 ext/mbstring/oniguruma/regcomp.c if (env->mmd.max == 0 &&
max 4816 ext/mbstring/oniguruma/regcomp.c max = (nopt.len.max > 0 ? ONIG_INFINITE_DISTANCE : 0);
max 4818 ext/mbstring/oniguruma/regcomp.c max = distance_multiply(nopt.len.max, qn->upper);
max 4820 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4843 ext/mbstring/oniguruma/regcomp.c OnigDistance min, max;
max 4846 ext/mbstring/oniguruma/regcomp.c max = ONIG_INFINITE_DISTANCE;
max 4848 ext/mbstring/oniguruma/regcomp.c if (IS_ENCLOSE_MAX_FIXED(en)) max = en->max_len;
max 4849 ext/mbstring/oniguruma/regcomp.c set_mml(&opt->len, min, max);
max 4920 ext/mbstring/oniguruma/regcomp.c reg->dmax = e->mmd.max;
max 4939 ext/mbstring/oniguruma/regcomp.c reg->dmax = m->mmd.max;
max 4981 ext/mbstring/oniguruma/regcomp.c reg->anchor_dmax = opt.len.max;
max 5002 ext/mbstring/oniguruma/regcomp.c if (opt.len.max == 0)
max 1016 ext/oci8/oci8.c PHP_FALIAS(max, oci_collection_max, arginfo_oci_collection_max_method)
max 261 ext/oci8/oci8_collection.c PHP_OCI_CALL_RETURN(*max, OCICollMax, (connection->env, collection->collection));
max 2317 ext/oci8/oci8_interface.c long max;
max 2332 ext/oci8/oci8_interface.c if (php_oci_collection_max(collection, &max TSRMLS_CC)) {
max 2335 ext/oci8/oci8_interface.c RETURN_LONG(max);
max 50 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 1314 ext/pcre/pcrelib/pcre_compile.c int max = -1;
max 1329 ext/pcre/pcrelib/pcre_compile.c if (*p == CHAR_RIGHT_CURLY_BRACKET) max = min; else
max 1333 ext/pcre/pcrelib/pcre_compile.c max = 0;
max 1334 ext/pcre/pcrelib/pcre_compile.c while(IS_DIGIT(*p)) max = max * 10 + (int)(*p++ - CHAR_0);
max 1335 ext/pcre/pcrelib/pcre_compile.c if (max < 0 || max > 65535)
max 1340 ext/pcre/pcrelib/pcre_compile.c if (max < min)
max 1352 ext/pcre/pcrelib/pcre_compile.c *maxp = max;
max 633 ext/pcre/pcrelib/pcre_exec.c int max;
max 2691 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 2692 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 2699 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1 + IMM2_SIZE);
max 2700 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 2743 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 2754 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 2771 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 2831 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 2832 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 2839 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1 + IMM2_SIZE);
max 2840 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 2845 ext/pcre/pcrelib/pcre_exec.c min = max = 1;
max 2896 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 2910 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 2933 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 2962 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 2991 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3045 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 3046 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 3053 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1 + IMM2_SIZE);
max 3054 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 3059 ext/pcre/pcrelib/pcre_exec.c min = max = 1;
max 3079 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3090 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3107 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3237 ext/pcre/pcrelib/pcre_exec.c min = max = GET2(ecode, 1);
max 3251 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 3260 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 3268 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 3276 ext/pcre/pcrelib/pcre_exec.c max = 1;
max 3295 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 3296 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 3338 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3346 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3366 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3418 ext/pcre/pcrelib/pcre_exec.c DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
max 3419 ext/pcre/pcrelib/pcre_exec.c max, (char *)eptr));
max 3453 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3462 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3477 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3518 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3526 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3539 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3619 ext/pcre/pcrelib/pcre_exec.c min = max = GET2(ecode, 1);
max 3628 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 3637 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 3645 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 3653 ext/pcre/pcrelib/pcre_exec.c max = 1;
max 3661 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 3680 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 3681 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 3696 ext/pcre/pcrelib/pcre_exec.c DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
max 3697 ext/pcre/pcrelib/pcre_exec.c max, (char *)eptr));
max 3744 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3756 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3774 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3797 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3822 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3880 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 3892 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3910 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 3932 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3957 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 3986 ext/pcre/pcrelib/pcre_exec.c min = max = GET2(ecode, 1);
max 3994 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 4002 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 4009 ext/pcre/pcrelib/pcre_exec.c max = INT_MAX;
max 4016 ext/pcre/pcrelib/pcre_exec.c max = 1;
max 4023 ext/pcre/pcrelib/pcre_exec.c max = GET2(ecode, 1);
max 4036 ext/pcre/pcrelib/pcre_exec.c max = rep_max[c]; /* zero for max => infinity */
max 4037 ext/pcre/pcrelib/pcre_exec.c if (max == 0) max = INT_MAX;
max 4775 ext/pcre/pcrelib/pcre_exec.c if (min == max) continue;
max 4793 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4810 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4830 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4847 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4864 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4882 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4900 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4919 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4939 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4961 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 4994 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5028 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5153 ext/pcre/pcrelib/pcre_exec.c if (fi >= max) RRETURN(MATCH_NOMATCH);
max 5297 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5312 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5332 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5347 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5362 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5377 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5395 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5413 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5431 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5450 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 5550 ext/pcre/pcrelib/pcre_exec.c if (max < INT_MAX)
max 5552 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5578 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5602 ext/pcre/pcrelib/pcre_exec.c if (max < INT_MAX)
max 5604 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5625 ext/pcre/pcrelib/pcre_exec.c c = max - min;
max 5635 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5666 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5688 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5709 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5724 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5739 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5754 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5769 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5784 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5826 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5849 ext/pcre/pcrelib/pcre_exec.c c = max - min;
max 5859 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5886 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5907 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5928 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 5970 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5983 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 5996 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 6022 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
max 6035 ext/pcre/pcrelib/pcre_exec.c for (i = min; i < max; i++)
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 13212 ext/sqlite3/libsqlite/sqlite3.c int max;
max 13220 ext/sqlite3/libsqlite/sqlite3.c max = va_arg(ap, int);
max 13231 ext/sqlite3/libsqlite/sqlite3.c if( val<min || val>max || (nextC!=0 && nextC!=*zDate) ){
max 83548 ext/sqlite3/libsqlite/sqlite3.c int max;
max 83559 ext/sqlite3/libsqlite/sqlite3.c max = sqlite3_user_data(context)!=0;
max 83561 ext/sqlite3/libsqlite/sqlite3.c if( (max && cmp<0) || (!max && cmp>0) ){
max 83737 ext/sqlite3/libsqlite/sqlite3.c FUNCTION(max, -1, 1, 1, minmaxFunc ),
max 83738 ext/sqlite3/libsqlite/sqlite3.c FUNCTION(max, 0, 1, 1, 0 ),
max 83739 ext/sqlite3/libsqlite/sqlite3.c AGGREGATE(max, 1, 1, 1, minmaxStep, minMaxFinalize ),
max 1020 ext/standard/array.c zval **max, result;
max 1023 ext/standard/array.c max = args[0];
max 1026 ext/standard/array.c is_smaller_or_equal_function(&result, *args[i], *max TSRMLS_CC);
max 1028 ext/standard/array.c max = args[i];
max 1032 ext/standard/array.c RETVAL_ZVAL(*max, 1, 0);
max 3310 ext/standard/basic_functions.c PHP_FE(max, arginfo_max)
max 250 ext/standard/html_tables/html_table_gen.php $maxencnum = max(array_map(function($e) { return $e['enumid']; }, $encodings));
max 737 ext/standard/html_tables/html_table_gen.php $numelems = max(pow(2, ceil(log(1.5*count($origdp))/log(2))),16);
max 293 ext/standard/rand.c long max;
max 297 ext/standard/rand.c if (argc != 0 && zend_parse_parameters(argc TSRMLS_CC, "ll", &min, &max) == FAILURE)
max 302 ext/standard/rand.c RAND_RANGE(number, min, max, PHP_RAND_MAX);
max 314 ext/standard/rand.c long max;
max 319 ext/standard/rand.c if (zend_parse_parameters(argc TSRMLS_CC, "ll", &min, &max) == FAILURE) {
max 321 ext/standard/rand.c } else if (max < min) {
max 322 ext/standard/rand.c php_error_docref(NULL TSRMLS_CC, E_WARNING, "max(%ld) is smaller than min(%ld)", max, min);
max 341 ext/standard/rand.c RAND_RANGE(number, min, max, PHP_MT_RAND_MAX);
max 3188 ext/standard/string.c *max = 0;
max 3192 ext/standard/string.c if (l > *max) {
max 3193 ext/standard/string.c *max = l;
max 3207 ext/standard/string.c int pos1 = 0, pos2 = 0, max;
max 3209 ext/standard/string.c php_similar_str(txt1, len1, txt2, len2, &pos1, &pos2, &max);
max 3210 ext/standard/string.c if ((sum = max)) {
max 3215 ext/standard/string.c if ((pos1 + max < len1) && (pos2 + max < len2)) {
max 3216 ext/standard/string.c sum += php_similar_char(txt1 + pos1 + max, len1 - pos1 - max,
max 3217 ext/standard/string.c txt2 + pos2 + max, len2 - pos2 - max);
max 287 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 288 ext/standard/var_unserializer.c #define UNSERIALIZE_PASSTHRU rval, p, max, var_hash TSRMLS_CC
max 297 ext/standard/var_unserializer.c if (!php_var_unserialize(&key, p, max, NULL TSRMLS_CC)) {
max 311 ext/standard/var_unserializer.c if (!php_var_unserialize(&data, p, max, var_hash TSRMLS_CC)) {
max 372 ext/standard/var_unserializer.c if (datalen < 0 || (*p) + datalen >= max) {
max 373 ext/standard/var_unserializer.c zend_error(E_WARNING, "Insufficient data for unserializing - %ld required, %ld present", datalen, (long)(max - (*p)));
max 442 ext/standard/var_unserializer.c limit = max;
max 615 ext/standard/var_unserializer.c maxlen = max - YYCURSOR;
max 834 ext/standard/var_unserializer.c maxlen = max - YYCURSOR;
max 882 ext/standard/var_unserializer.c maxlen = max - YYCURSOR;
max 96 ext/wddx/wddx.c int top, max;
max 179 ext/wddx/wddx.c stack->max = STACK_BLOCK_SIZE;
max 191 ext/wddx/wddx.c if (stack->top >= stack->max) { /* we need to allocate more memory */
max 193 ext/wddx/wddx.c (sizeof(void **) * (stack->max += STACK_BLOCK_SIZE)));
max 302 ext/zip/lib/zip_open.c unsigned int min, max, j;
max 306 ext/zip/lib/zip_open.c max = cd->entry[0].offset;
max 310 ext/zip/lib/zip_open.c min = max = 0;
max 322 ext/zip/lib/zip_open.c if (j > max)
max 323 ext/zip/lib/zip_open.c max = j;
max 324 ext/zip/lib/zip_open.c if (max > cd->offset) {
max 345 ext/zip/lib/zip_open.c return max - min;
max 353 ext/zlib/zlib.c buffer.size = (max && (max < Z->avail_in)) ? max : Z->avail_in;
max 356 ext/zlib/zlib.c if ((max && (max <= buffer.used)) || !(buffer.aptr = erealloc_recoverable(buffer.data, buffer.size))) {
max 606 main/rfc1867.c int len, max;
max 616 main/rfc1867.c max = bound - self->buf_begin;
max 621 main/rfc1867.c max = self->bytes_in_buffer;
max 625 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);