max                96 exif/exif.c    #ifndef max
max              2377 exif/exif.c    	value_ptr = safe_emalloc(max(byte_count, 4), 1, 0);
max              4458 gd/gd.c        			str_bbox.urx = max(str_bbox.urx, max(x1, max(x2, max(x3, x4))));
max              4459 gd/gd.c        			str_bbox.ury = max(str_bbox.ury, max(y1, max(y2, max(y3, y4))));
max              2963 gd/libgd/gd.c  	if( dst > max ) {
max              2965 gd/libgd/gd.c  		return dst + (src << 1) - (dst * src / max) - max;
max              2968 gd/libgd/gd.c  		return dst * src / max;
max               947 interbase/ibase_query.c 		res = emalloc(sizeof(ibase_result)+sizeof(ibase_array)*max(0,ib_query->out_array_cnt-1));
max               189 interbase/php_ibase_includes.h #ifndef max
max              2135 mbstring/oniguruma/regcomp.c   *max = 0;
max              2141 mbstring/oniguruma/regcomp.c 	*max = distance_add(*max, tmax);
max              2148 mbstring/oniguruma/regcomp.c       if (r == 0 && *max < tmax) *max = tmax;
max              2155 mbstring/oniguruma/regcomp.c       *max = sn->end - sn->s;
max              2163 mbstring/oniguruma/regcomp.c       *max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max              2173 mbstring/oniguruma/regcomp.c     *max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max              2183 mbstring/oniguruma/regcomp.c 	*max = ONIG_INFINITE_DISTANCE;
max              2191 mbstring/oniguruma/regcomp.c 	if (*max < tmax) *max = tmax;
max              2199 mbstring/oniguruma/regcomp.c       r = get_max_match_length(NCALL(node).target, max, env);
max              2201 mbstring/oniguruma/regcomp.c       *max = ONIG_INFINITE_DISTANCE;
max              2210 mbstring/oniguruma/regcomp.c 	r = get_max_match_length(qn->target, max, env);
max              2211 mbstring/oniguruma/regcomp.c 	if (r == 0 && *max != 0) {
max              2213 mbstring/oniguruma/regcomp.c 	    *max = distance_multiply(*max, qn->upper);
max              2215 mbstring/oniguruma/regcomp.c 	    *max = ONIG_INFINITE_DISTANCE;
max              2228 mbstring/oniguruma/regcomp.c 	  *max = en->max_len;
max              2230 mbstring/oniguruma/regcomp.c 	  r = get_max_match_length(en->target, max, env);
max              2232 mbstring/oniguruma/regcomp.c 	    en->max_len = *max;
max              2240 mbstring/oniguruma/regcomp.c 	r = get_max_match_length(en->target, max, env);
max              3721 mbstring/oniguruma/regcomp.c   OnigDistance max;  /* max byte length */
max              3810 mbstring/oniguruma/regcomp.c   if (mm->max == ONIG_INFINITE_DISTANCE) return 0;
max              3812 mbstring/oniguruma/regcomp.c   d = mm->max - mm->min;
max              3840 mbstring/oniguruma/regcomp.c   return (a->min == b->min && a->max == b->max) ? 1 : 0;
max              3848 mbstring/oniguruma/regcomp.c   mml->max = max;
max              3854 mbstring/oniguruma/regcomp.c   mml->min = mml->max = 0;
max              3861 mbstring/oniguruma/regcomp.c   to->max = from->max;
max              3868 mbstring/oniguruma/regcomp.c   to->max = distance_add(to->max, from->max);
max              3876 mbstring/oniguruma/regcomp.c   to->max = distance_add(to->max, len);
max              3884 mbstring/oniguruma/regcomp.c   if (to->max < from->max) to->max = from->max;
max              4214 mbstring/oniguruma/regcomp.c   if (add->value == 0 || to->mmd.max < add->mmd.min) {
max              4265 mbstring/oniguruma/regcomp.c   concat_opt_anc_info(&tanc, &to->anc, &add->anc, to->len.max, add->len.max);
max              4268 mbstring/oniguruma/regcomp.c   if (add->exb.len > 0 && to->len.max == 0) {
max              4270 mbstring/oniguruma/regcomp.c 			to->len.max, add->len.max);
max              4274 mbstring/oniguruma/regcomp.c   if (add->map.value > 0 && to->len.max == 0) {
max              4275 mbstring/oniguruma/regcomp.c     if (add->map.mmd.max == 0)
max              4282 mbstring/oniguruma/regcomp.c   if (add->len.max != 0)
max              4299 mbstring/oniguruma/regcomp.c     if (add->len.max > 0) {
max              4300 mbstring/oniguruma/regcomp.c       if (to->expr.len > (int )add->len.max)
max              4301 mbstring/oniguruma/regcomp.c 	to->expr.len = add->len.max;
max              4303 mbstring/oniguruma/regcomp.c       if (to->expr.mmd.max == 0)
max              4391 mbstring/oniguruma/regcomp.c         int n, max;
max              4405 mbstring/oniguruma/regcomp.c           max = ONIGENC_MBC_MAXLEN_DIST(env->enc) * n;
max              4408 mbstring/oniguruma/regcomp.c           max = slen;
max              4410 mbstring/oniguruma/regcomp.c         set_mml(&opt->len, slen, max);
max              4427 mbstring/oniguruma/regcomp.c 	OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max              4429 mbstring/oniguruma/regcomp.c 	set_mml(&opt->len, min, max);
max              4445 mbstring/oniguruma/regcomp.c       int i, min, max;
max              4447 mbstring/oniguruma/regcomp.c       max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max              4449 mbstring/oniguruma/regcomp.c       if (max == 1) {
max              4473 mbstring/oniguruma/regcomp.c       set_mml(&opt->len, min, max);
max              4480 mbstring/oniguruma/regcomp.c       OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max              4481 mbstring/oniguruma/regcomp.c       set_mml(&opt->len, min, max);
max              4526 mbstring/oniguruma/regcomp.c       OnigDistance min, max, tmin, tmax;
max              4537 mbstring/oniguruma/regcomp.c       r = get_max_match_length(nodes[backs[0]], &max, env->scan_env);
max              4545 mbstring/oniguruma/regcomp.c 	if (max < tmax) max = tmax;
max              4547 mbstring/oniguruma/regcomp.c       if (r == 0) set_mml(&opt->len, min, max);
max              4567 mbstring/oniguruma/regcomp.c       OnigDistance min, max;
max              4575 mbstring/oniguruma/regcomp.c 	if (env->mmd.max == 0 &&
max              4609 mbstring/oniguruma/regcomp.c 	max = (nopt.len.max > 0 ? ONIG_INFINITE_DISTANCE : 0);
max              4611 mbstring/oniguruma/regcomp.c 	max = distance_multiply(nopt.len.max, qn->upper);
max              4613 mbstring/oniguruma/regcomp.c       set_mml(&opt->len, min, max);
max              4636 mbstring/oniguruma/regcomp.c 	  OnigDistance min, max;
max              4639 mbstring/oniguruma/regcomp.c 	  max = ONIG_INFINITE_DISTANCE;
max              4641 mbstring/oniguruma/regcomp.c 	  if (IS_EFFECT_MAX_FIXED(en)) max = en->max_len;
max              4642 mbstring/oniguruma/regcomp.c 	  set_mml(&opt->len, min, max);
max              4713 mbstring/oniguruma/regcomp.c   reg->dmax = e->mmd.max;
max              4732 mbstring/oniguruma/regcomp.c   reg->dmax       = m->mmd.max;
max              4774 mbstring/oniguruma/regcomp.c     reg->anchor_dmax = opt.len.max;
max              4795 mbstring/oniguruma/regcomp.c     if (opt.len.max == 0)
max              1016 oci8/oci8.c    	PHP_FALIAS(max,			  oci_collection_max,				arginfo_oci_collection_max_method)
max               261 oci8/oci8_collection.c 	PHP_OCI_CALL_RETURN(*max, OCICollMax, (connection->env, collection->collection));
max              2317 oci8/oci8_interface.c 	long max;
max              2332 oci8/oci8_interface.c 	if (php_oci_collection_max(collection, &max TSRMLS_CC)) {
max              2335 oci8/oci8_interface.c 	RETURN_LONG(max);
max                50 oci8/php_oci8_int.h #if defined(max)
max              1288 pcre/pcrelib/pcre_compile.c int max = -1;
max              1303 pcre/pcrelib/pcre_compile.c if (*p == CHAR_RIGHT_CURLY_BRACKET) max = min; else
max              1307 pcre/pcrelib/pcre_compile.c     max = 0;
max              1308 pcre/pcrelib/pcre_compile.c     while(IS_DIGIT(*p)) max = max * 10 + *p++ - CHAR_0;
max              1309 pcre/pcrelib/pcre_compile.c     if (max < 0 || max > 65535)
max              1314 pcre/pcrelib/pcre_compile.c     if (max < min)
max              1326 pcre/pcrelib/pcre_compile.c *maxp = max;
max               615 pcre/pcrelib/pcre_exec.c int max;
max              2701 pcre/pcrelib/pcre_exec.c       max = rep_max[c];                 /* zero for max => infinity */
max              2702 pcre/pcrelib/pcre_exec.c       if (max == 0) max = INT_MAX;
max              2709 pcre/pcrelib/pcre_exec.c       max = GET2(ecode, 1 + IMM2_SIZE);
max              2710 pcre/pcrelib/pcre_exec.c       if (max == 0) max = INT_MAX;
max              2753 pcre/pcrelib/pcre_exec.c     if (min == max) continue;
max              2764 pcre/pcrelib/pcre_exec.c         if (fi >= max) RRETURN(MATCH_NOMATCH);
max              2781 pcre/pcrelib/pcre_exec.c       for (i = min; i < max; i++)
max              2841 pcre/pcrelib/pcre_exec.c         max = rep_max[c];                 /* zero for max => infinity */
max              2842 pcre/pcrelib/pcre_exec.c         if (max == 0) max = INT_MAX;
max              2849 pcre/pcrelib/pcre_exec.c         max = GET2(ecode, 1 + IMM2_SIZE);
max              2850 pcre/pcrelib/pcre_exec.c         if (max == 0) max = INT_MAX;
max              2855 pcre/pcrelib/pcre_exec.c         min = max = 1;
max              2906 pcre/pcrelib/pcre_exec.c       if (min == max) continue;
max              2920 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              2943 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              2972 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              3001 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              3055 pcre/pcrelib/pcre_exec.c         max = rep_max[c];                 /* zero for max => infinity */
max              3056 pcre/pcrelib/pcre_exec.c         if (max == 0) max = INT_MAX;
max              3063 pcre/pcrelib/pcre_exec.c         max = GET2(ecode, 1 + IMM2_SIZE);
max              3064 pcre/pcrelib/pcre_exec.c         if (max == 0) max = INT_MAX;
max              3069 pcre/pcrelib/pcre_exec.c         min = max = 1;
max              3089 pcre/pcrelib/pcre_exec.c       if (min == max) continue;
max              3100 pcre/pcrelib/pcre_exec.c           if (fi >= max) RRETURN(MATCH_NOMATCH);
max              3117 pcre/pcrelib/pcre_exec.c         for (i = min; i < max; i++)
max              3247 pcre/pcrelib/pcre_exec.c     min = max = GET2(ecode, 1);
max              3261 pcre/pcrelib/pcre_exec.c     max = GET2(ecode, 1);
max              3270 pcre/pcrelib/pcre_exec.c     max = INT_MAX;
max              3278 pcre/pcrelib/pcre_exec.c     max = INT_MAX;
max              3286 pcre/pcrelib/pcre_exec.c     max = 1;
max              3305 pcre/pcrelib/pcre_exec.c     max = rep_max[c];                 /* zero for max => infinity */
max              3306 pcre/pcrelib/pcre_exec.c     if (max == 0) max = INT_MAX;
max              3348 pcre/pcrelib/pcre_exec.c         if (min == max) continue;
max              3356 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              3376 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              3428 pcre/pcrelib/pcre_exec.c     DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
max              3429 pcre/pcrelib/pcre_exec.c       max, (char *)eptr));
max              3460 pcre/pcrelib/pcre_exec.c       if (min == max) continue;
max              3467 pcre/pcrelib/pcre_exec.c           if (fi >= max) RRETURN(MATCH_NOMATCH);
max              3481 pcre/pcrelib/pcre_exec.c         for (i = min; i < max; i++)
max              3519 pcre/pcrelib/pcre_exec.c       if (min == max) continue;
max              3527 pcre/pcrelib/pcre_exec.c           if (fi >= max) RRETURN(MATCH_NOMATCH);
max              3540 pcre/pcrelib/pcre_exec.c         for (i = min; i < max; i++)
max              3620 pcre/pcrelib/pcre_exec.c     min = max = GET2(ecode, 1);
max              3629 pcre/pcrelib/pcre_exec.c     max = GET2(ecode, 1);
max              3638 pcre/pcrelib/pcre_exec.c     max = INT_MAX;
max              3646 pcre/pcrelib/pcre_exec.c     max = INT_MAX;
max              3654 pcre/pcrelib/pcre_exec.c     max = 1;
max              3662 pcre/pcrelib/pcre_exec.c     max = GET2(ecode, 1);
max              3681 pcre/pcrelib/pcre_exec.c     max = rep_max[c];                 /* zero for max => infinity */
max              3682 pcre/pcrelib/pcre_exec.c     if (max == 0) max = INT_MAX;
max              3697 pcre/pcrelib/pcre_exec.c     DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
max              3698 pcre/pcrelib/pcre_exec.c       max, (char *)eptr));
max              3745 pcre/pcrelib/pcre_exec.c       if (min == max) continue;
max              3757 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              3775 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              3798 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              3823 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              3881 pcre/pcrelib/pcre_exec.c       if (min == max) continue;
max              3893 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              3911 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              3933 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              3958 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              3987 pcre/pcrelib/pcre_exec.c     min = max = GET2(ecode, 1);
max              3995 pcre/pcrelib/pcre_exec.c     max = GET2(ecode, 1);
max              4003 pcre/pcrelib/pcre_exec.c     max = INT_MAX;
max              4010 pcre/pcrelib/pcre_exec.c     max = INT_MAX;
max              4017 pcre/pcrelib/pcre_exec.c     max = 1;
max              4024 pcre/pcrelib/pcre_exec.c     max = GET2(ecode, 1);
max              4037 pcre/pcrelib/pcre_exec.c     max = rep_max[c];                 /* zero for max => infinity */
max              4038 pcre/pcrelib/pcre_exec.c     if (max == 0) max = INT_MAX;
max              4828 pcre/pcrelib/pcre_exec.c     if (min == max) continue;
max              4846 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              4863 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              4883 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              4900 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              4917 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              4935 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              4953 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              4972 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              4992 pcre/pcrelib/pcre_exec.c             if (fi >= max) RRETURN(MATCH_NOMATCH);
max              5024 pcre/pcrelib/pcre_exec.c           if (fi >= max) RRETURN(MATCH_NOMATCH);
max              5052 pcre/pcrelib/pcre_exec.c           if (fi >= max) RRETURN(MATCH_NOMATCH);
max              5226 pcre/pcrelib/pcre_exec.c           if (fi >= max) RRETURN(MATCH_NOMATCH);
max              5414 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5429 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5449 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5464 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5479 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5494 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5512 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5530 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5548 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5587 pcre/pcrelib/pcre_exec.c         for (i = min; i < max; i++)
max              5639 pcre/pcrelib/pcre_exec.c           if (max < INT_MAX)
max              5641 pcre/pcrelib/pcre_exec.c             for (i = min; i < max; i++)
max              5667 pcre/pcrelib/pcre_exec.c             for (i = min; i < max; i++)
max              5691 pcre/pcrelib/pcre_exec.c           if (max < INT_MAX)
max              5693 pcre/pcrelib/pcre_exec.c             for (i = min; i < max; i++)
max              5714 pcre/pcrelib/pcre_exec.c           c = max - min;
max              5724 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5752 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5794 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5823 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5838 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5853 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5868 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5883 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5898 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5940 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              5963 pcre/pcrelib/pcre_exec.c           c = max - min;
max              5973 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6000 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6019 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6038 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6056 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6074 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6087 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6100 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6113 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6126 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max              6139 pcre/pcrelib/pcre_exec.c           for (i = min; i < max; i++)
max                10 pdo_mysql/get_error_codes.php 			$maxlen = max($maxlen, strlen($matches[1]));
max               373 phar/phar.php  		$p = max(79 - $l, 40);     // minimum length for paragraph
max               401 phar/phar.php  					$ls = max($ls, strlen($opt));
max               449 phar/phar.php  				$l = max($l, strlen($name));
max              2019 phar/phar.php  			$l = max(strlen($which), $l);
max              2073 phar/phar.php  			$klen = max($klen, strlen($k));
max                46 soap/interop/test.utility.php     $d = max(min(strlen(count($m1)?$m1[1]:'0'),strlen(count($m2)?$m2[1]:'0')),2);
max              13212 sqlite3/libsqlite/sqlite3.c   int max;
max              13220 sqlite3/libsqlite/sqlite3.c     max = va_arg(ap, int);
max              13231 sqlite3/libsqlite/sqlite3.c     if( val<min || val>max || (nextC!=0 && nextC!=*zDate) ){
max              83548 sqlite3/libsqlite/sqlite3.c     int max;
max              83559 sqlite3/libsqlite/sqlite3.c     max = sqlite3_user_data(context)!=0;
max              83561 sqlite3/libsqlite/sqlite3.c     if( (max && cmp<0) || (!max && cmp>0) ){
max              83737 sqlite3/libsqlite/sqlite3.c     FUNCTION(max,               -1, 1, 1, minmaxFunc       ),
max              83738 sqlite3/libsqlite/sqlite3.c     FUNCTION(max,                0, 1, 1, 0                ),
max              83739 sqlite3/libsqlite/sqlite3.c     AGGREGATE(max,               1, 1, 1, minmaxStep,      minMaxFinalize ),
max              1032 standard/array.c 		zval **max, result;
max              1035 standard/array.c 		max = args[0];
max              1038 standard/array.c 			is_smaller_or_equal_function(&result, *args[i], *max TSRMLS_CC);
max              1040 standard/array.c 				max = args[i];
max              1044 standard/array.c 		RETVAL_ZVAL(*max, 1, 0);
max              3290 standard/basic_functions.c 	PHP_FE(max,																arginfo_max)
max               250 standard/html_tables/html_table_gen.php $maxencnum = max(array_map(function($e) { return $e['enumid']; }, $encodings));
max               737 standard/html_tables/html_table_gen.php $numelems = max(pow(2, ceil(log(1.5*count($origdp))/log(2))),16);
max               293 standard/rand.c 	long max;
max               297 standard/rand.c 	if (argc != 0 && zend_parse_parameters(argc TSRMLS_CC, "ll", &min, &max) == FAILURE)
max               302 standard/rand.c 		RAND_RANGE(number, min, max, PHP_RAND_MAX);
max               314 standard/rand.c 	long max;
max               319 standard/rand.c 		if (zend_parse_parameters(argc TSRMLS_CC, "ll", &min, &max) == FAILURE) {
max               321 standard/rand.c 		} else if (max < min) {
max               322 standard/rand.c 			php_error_docref(NULL TSRMLS_CC, E_WARNING, "max(%ld) is smaller than min(%ld)", max, min);
max               341 standard/rand.c 		RAND_RANGE(number, min, max, PHP_MT_RAND_MAX);
max              2960 standard/string.c 	*max = 0;
max              2964 standard/string.c 			if (l > *max) {
max              2965 standard/string.c 				*max = l;
max              2979 standard/string.c 	int pos1, pos2, max;
max              2981 standard/string.c 	php_similar_str(txt1, len1, txt2, len2, &pos1, &pos2, &max);
max              2982 standard/string.c 	if ((sum = max)) {
max              2987 standard/string.c 		if ((pos1 + max < len1) && (pos2 + max < len2)) {
max              2988 standard/string.c 			sum += php_similar_char(txt1 + pos1 + max, len1 - pos1 - max,
max              2989 standard/string.c 									txt2 + pos2 + max, len2 - pos2 - max);
max               262 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               263 standard/var_unserializer.c #define UNSERIALIZE_PASSTHRU rval, p, max, var_hash TSRMLS_CC
max               272 standard/var_unserializer.c 		if (!php_var_unserialize(&key, p, max, NULL TSRMLS_CC)) {
max               286 standard/var_unserializer.c 		if (!php_var_unserialize(&data, p, max, var_hash TSRMLS_CC)) {
max               347 standard/var_unserializer.c 	if (datalen < 0 || (*p) + datalen >= max) {
max               348 standard/var_unserializer.c 		zend_error(E_WARNING, "Insufficient data for unserializing - %ld required, %ld present", datalen, (long)(max - (*p)));
max               412 standard/var_unserializer.c 	limit = max;
max               585 standard/var_unserializer.c 	maxlen = max - YYCURSOR;
max               781 standard/var_unserializer.c 	maxlen = max - YYCURSOR;
max               829 standard/var_unserializer.c 	maxlen = max - YYCURSOR;
max                96 wddx/wddx.c    	int top, max;
max               179 wddx/wddx.c    	stack->max = STACK_BLOCK_SIZE;
max               191 wddx/wddx.c    	if (stack->top >= stack->max) {		/* we need to allocate more memory */
max               193 wddx/wddx.c    				   (sizeof(void **) * (stack->max += STACK_BLOCK_SIZE)));
max               302 zip/lib/zip_open.c     unsigned int min, max, j;
max               306 zip/lib/zip_open.c 	max = cd->entry[0].offset;
max               310 zip/lib/zip_open.c 	min = max = 0;
max               322 zip/lib/zip_open.c 	if (j > max)
max               323 zip/lib/zip_open.c 	    max = j;
max               324 zip/lib/zip_open.c 	if (max > cd->offset) {
max               345 zip/lib/zip_open.c     return max - min;
max               353 zlib/zlib.c    	buffer.size = (max && (max < Z->avail_in)) ? max : Z->avail_in;
max               356 zlib/zlib.c    		if ((max && (max <= buffer.used)) || !(buffer.aptr = erealloc_recoverable(buffer.data, buffer.size))) {