max 64 MMgc/GC.cpp #ifndef max // good grief
max 507 MMgc/GC.cpp timeMaxStartIncrementalMark = max(timeMaxStartIncrementalMark, elapsed);
max 508 MMgc/GC.cpp timeMaxStartIncrementalMarkLastCollection = max(timeMaxStartIncrementalMarkLastCollection, elapsed);
max 514 MMgc/GC.cpp timeMaxFinalRootAndStackScan = max(timeMaxFinalRootAndStackScan, elapsed);
max 515 MMgc/GC.cpp timeMaxFinalRootAndStackScanLastCollection = max(timeMaxFinalRootAndStackScanLastCollection, elapsed);
max 522 MMgc/GC.cpp timeMaxReapZCT = max(timeMaxReapZCT, elapsed);
max 523 MMgc/GC.cpp timeMaxReapZCTLastCollection = max(timeMaxReapZCTLastCollection, elapsed);
max 528 MMgc/GC.cpp timeMaxIncrementalMark = max(timeMaxIncrementalMark, elapsed);
max 529 MMgc/GC.cpp timeMaxIncrementalMarkLastCollection = max(timeMaxIncrementalMarkLastCollection, elapsed);
max 536 MMgc/GC.cpp timeMaxFinalizeAndSweep = max(timeMaxFinalizeAndSweep, elapsed);
max 537 MMgc/GC.cpp timeMaxFinalizeAndSweepLastCollection = max(timeMaxFinalizeAndSweepLastCollection, elapsed);
max 92 core/MathClass.h double max(double x, double y, const Atom* argv, uint32_t argc);
max 108 core/MathUtils.h static double max(double x, double y) { return (x > y) ? x : y; }
max 130 core/avmplusList.h uint32 max;
max 135 core/avmplusList.h AvmAssert(index < max);
max 147 core/avmplusList.h uint32 max;
max 152 core/avmplusList.h AvmAssert(index < max);
max 164 core/avmplusList.h uint32 max;
max 169 core/avmplusList.h AvmAssert(index < max);
max 180 core/avmplusList.h using ListBase<T, kElementType, ListAllocPolicy>::max;
max 198 core/avmplusList.h max = 0;
max 219 core/avmplusList.h max = 0;
max 224 core/avmplusList.h if (len >= max) {
max 241 core/avmplusList.h return max;
max 257 core/avmplusList.h AvmAssert(index < max);
max 268 core/avmplusList.h if (len >= max) {
max 350 core/avmplusList.h if(cap > max) {
max 370 core/avmplusList.h max = cap;
max 392 core/avmplusList.h if (max == 0)
max 394 core/avmplusList.h else if(max > 15)
max 395 core/avmplusList.h newMax = max * 3/2;
max 397 core/avmplusList.h newMax = max * 2;
max 58 core/avmplusStack.h max = kInitialCapacity;
max 66 core/avmplusStack.h if (len >= max) {
max 91 core/avmplusStack.h int max;
max 95 core/avmplusStack.h int newMax = max * 5 / 4;
max 102 core/avmplusStack.h max = newMax;
max 347 core/builtin.cpp double const ret = obj->max(
max 1107 extensions/JavaGlue.cpp int max = jni->GetArrayLength(arr);
max 1108 extensions/JavaGlue.cpp for(int i=0; i<max; i++)
max 1132 extensions/JavaGlue.cpp int max = jni->GetArrayLength(arr);
max 1133 extensions/JavaGlue.cpp for(int i=0; i<max; i++)
max 1615 nanojit/Assembler.cpp int32_t max = _activation.tos < NJ_MAX_STACK_ENTRY ? _activation.tos : NJ_MAX_STACK_ENTRY;
max 1616 nanojit/Assembler.cpp for (int32_t i = _activation.lowwatermark; i < max; i++) {
max 1689 other-licenses/zlib/deflate.c uInt max; /* maximum length of run */
max 1709 other-licenses/zlib/deflate.c max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH;
max 1715 other-licenses/zlib/deflate.c } while (++run < max);
max 42 other-licenses/zlib/inftrees.c unsigned min, max; /* minimum and maximum code lengths */
max 114 other-licenses/zlib/inftrees.c for (max = MAXBITS; max >= 1; max--)
max 115 other-licenses/zlib/inftrees.c if (count[max] != 0) break;
max 116 other-licenses/zlib/inftrees.c if (root > max) root = max;
max 117 other-licenses/zlib/inftrees.c if (max == 0) { /* no symbols to code at all */
max 137 other-licenses/zlib/inftrees.c if (left > 0 && (type == CODES || max != 1))
max 255 other-licenses/zlib/inftrees.c if (len == max) break;
max 271 other-licenses/zlib/inftrees.c while (curr + drop < max) {
max 943 pcre/pcre_compile.cpp int max = -1;
max 958 pcre/pcre_compile.cpp if (*p == '}') max = min; else
max 962 pcre/pcre_compile.cpp max = 0;
max 963 pcre/pcre_compile.cpp while((digitab[*p] & ctype_digit) != 0) max = max * 10 + *p++ - '0';
max 964 pcre/pcre_compile.cpp if (max < 0 || max > 65535)
max 969 pcre/pcre_compile.cpp if (max < min)
max 981 pcre/pcre_compile.cpp *maxp = max;
max 2127 pcre/pcre_dfa_exec.cpp int max = GET2(ecode, 3);
max 2128 pcre/pcre_dfa_exec.cpp if (++count >= max && max != 0) /* Max 0 => no limit */
max 555 pcre/pcre_exec.cpp int max;
max 1850 pcre/pcre_exec.cpp max = rep_max[c]; /* zero for max => infinity */
max 1851 pcre/pcre_exec.cpp if (max == 0) max = INT_MAX;
max 1858 pcre/pcre_exec.cpp max = GET2(ecode, 3);
max 1859 pcre/pcre_exec.cpp if (max == 0) max = INT_MAX;
max 1887 pcre/pcre_exec.cpp if (min == max) continue;
max 1897 pcre/pcre_exec.cpp if (fi >= max || !match_ref(offset, eptr, length, md, ims))
max 1909 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 1955 pcre/pcre_exec.cpp max = rep_max[c]; /* zero for max => infinity */
max 1956 pcre/pcre_exec.cpp if (max == 0) max = INT_MAX;
max 1963 pcre/pcre_exec.cpp max = GET2(ecode, 3);
max 1964 pcre/pcre_exec.cpp if (max == 0) max = INT_MAX;
max 1969 pcre/pcre_exec.cpp min = max = 1;
max 2008 pcre/pcre_exec.cpp if (min == max) continue;
max 2023 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 2043 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 2061 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2088 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2129 pcre/pcre_exec.cpp max = rep_max[c]; /* zero for max => infinity */
max 2130 pcre/pcre_exec.cpp if (max == 0) max = INT_MAX;
max 2137 pcre/pcre_exec.cpp max = GET2(ecode, 3);
max 2138 pcre/pcre_exec.cpp if (max == 0) max = INT_MAX;
max 2143 pcre/pcre_exec.cpp min = max = 1;
max 2159 pcre/pcre_exec.cpp if (min == max) continue;
max 2170 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 2182 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2281 pcre/pcre_exec.cpp min = max = GET2(ecode, 1);
max 2292 pcre/pcre_exec.cpp max = GET2(ecode, 1);
max 2300 pcre/pcre_exec.cpp max = INT_MAX;
max 2307 pcre/pcre_exec.cpp max = INT_MAX;
max 2314 pcre/pcre_exec.cpp max = 1;
max 2327 pcre/pcre_exec.cpp max = rep_max[c]; /* zero for max => infinity */
max 2328 pcre/pcre_exec.cpp if (max == 0) max = INT_MAX;
max 2373 pcre/pcre_exec.cpp if (min == max) continue;
max 2381 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 2401 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2456 pcre/pcre_exec.cpp DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
max 2457 pcre/pcre_exec.cpp max, eptr));
max 2464 pcre/pcre_exec.cpp if (min == max) continue;
max 2471 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject ||
max 2480 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2502 pcre/pcre_exec.cpp if (min == max) continue;
max 2509 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject || fc != *eptr++)
max 2517 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2563 pcre/pcre_exec.cpp min = max = GET2(ecode, 1);
max 2570 pcre/pcre_exec.cpp max = GET2(ecode, 1);
max 2578 pcre/pcre_exec.cpp max = INT_MAX;
max 2585 pcre/pcre_exec.cpp max = INT_MAX;
max 2592 pcre/pcre_exec.cpp max = 1;
max 2599 pcre/pcre_exec.cpp max = GET2(ecode, 1);
max 2612 pcre/pcre_exec.cpp max = rep_max[c]; /* zero for max => infinity */
max 2613 pcre/pcre_exec.cpp if (max == 0) max = INT_MAX;
max 2631 pcre/pcre_exec.cpp DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
max 2632 pcre/pcre_exec.cpp max, eptr));
max 2659 pcre/pcre_exec.cpp if (min == max) continue;
max 2674 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject || fc == d)
max 2686 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject || fc == md->lcc[*eptr++])
max 2704 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2726 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2768 pcre/pcre_exec.cpp if (min == max) continue;
max 2782 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject || fc == d)
max 2794 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject || fc == *eptr++)
max 2812 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2833 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 2857 pcre/pcre_exec.cpp min = max = GET2(ecode, 1);
max 2865 pcre/pcre_exec.cpp max = GET2(ecode, 1);
max 2873 pcre/pcre_exec.cpp max = INT_MAX;
max 2880 pcre/pcre_exec.cpp max = INT_MAX;
max 2887 pcre/pcre_exec.cpp max = 1;
max 2894 pcre/pcre_exec.cpp max = GET2(ecode, 1);
max 2907 pcre/pcre_exec.cpp max = rep_max[c]; /* zero for max => infinity */
max 2908 pcre/pcre_exec.cpp if (max == 0) max = INT_MAX;
max 3417 pcre/pcre_exec.cpp if (min == max) continue;
max 3435 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 3446 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 3461 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 3474 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 3487 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 3509 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
max 3538 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject ||
max 3710 pcre/pcre_exec.cpp if (fi >= max || eptr >= md->end_subject ||
max 3848 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 3859 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 3874 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 3887 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 3900 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 3930 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 3983 pcre/pcre_exec.cpp if (max < INT_MAX)
max 3987 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 3996 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4011 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4028 pcre/pcre_exec.cpp c = max - min;
max 4035 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4057 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4095 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4120 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4131 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4142 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4161 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4181 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4192 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4227 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4237 pcre/pcre_exec.cpp c = max - min;
max 4244 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4263 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4273 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4283 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4294 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4305 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4314 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4323 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4332 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4341 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 4350 pcre/pcre_exec.cpp for (i = min; i < max; i++)
max 627 pcre/pcretest.cpp int max = -1;
max 642 pcre/pcretest.cpp mid = (mid == max - 1)? max : (max > 0)? (min + max)/2 : mid*2;
max 654 pcre/pcretest.cpp max = mid;
max 139 platform/win32/Vtune.cpp size_t max = VMPI_strlen(cstr);
max 140 platform/win32/Vtune.cpp char* to = (char*)malloc((max+1)*sizeof(char));
max 141 platform/win32/Vtune.cpp VMPI_strncpy(to,cstr,max);
max 142 platform/win32/Vtune.cpp to[max]='\0';
max 354 utils/abcasm/src/abcasm/AssemblerCore.java slot_id = Math.max(t.getIntAttr("slot_id") + 1, slot_id);
max 151 vprof/vprof.cpp f(((double)e->sum)/((double)e->count)), (long long int)e->min, (long long int)e->max, (long long int)e->sum, (long long int)e->count);
max 192 vprof/vprof.cpp e->max = MAX (e->max, value);
max 235 vprof/vprof.cpp e->max = value;
max 262 vprof/vprof.cpp e->max = MAX (e->max, value);
max 289 vprof/vprof.cpp e->max = MAX (e->max, value);
max 326 vprof/vprof.cpp e->max = value;
max 371 vprof/vprof.cpp e->max = MAX (e->max, value);
max 232 vprof/vprof.h int64_t max;
max 252 vprof/vprof.h #define _MAX ((entry_t)vprofID)->max