max 157 compar.c if (RTEST(cmp_gt(x, max))) return Qfalse;
max 2000 hash.c int max;
max 2003 hash.c for (max = i; environ[max]; max++) ;
max 2004 hash.c tmpenv = ALLOC_N(char*, max+2);
max 2005 hash.c for (j=0; j<max; j++) /* copy environment */
max 2007 hash.c tmpenv[max] = 0;
max 4438 io.c int max = max_file_descriptor;
max 4439 io.c if (max < maxhint)
max 4440 io.c max = maxhint;
max 4441 io.c for (fd = lowfd; fd <= max; fd++) {
max 6500 io.c int max = 0, n;
max 6514 io.c if (max < fptr->fd) max = fptr->fd;
max 6531 io.c if (max < fptr->fd) max = fptr->fd;
max 6545 io.c if (max < fptr->fd) max = fptr->fd;
max 6549 io.c if (max < fptr->fd) max = fptr->fd;
max 6558 io.c max++;
max 6560 io.c n = rb_thread_select(max, rp, wp, ep, tp);
max 479 random.c long val, max;
max 489 random.c max = (long)RFLOAT_VALUE(vmax);
max 514 random.c max = 0;
max 520 random.c max = FIX2LONG(vmax);
max 524 random.c if (max == 0) {
max 527 random.c if (max < 0) max = -max;
max 528 random.c val = limited_rand(mt, max-1);
max 2152 regcomp.c *max = 0;
max 2158 regcomp.c *max = distance_add(*max, tmax);
max 2165 regcomp.c if (r == 0 && *max < tmax) *max = tmax;
max 2172 regcomp.c *max = sn->end - sn->s;
max 2177 regcomp.c *max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 2182 regcomp.c *max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 2192 regcomp.c *max = ONIG_INFINITE_DISTANCE;
max 2200 regcomp.c if (*max < tmax) *max = tmax;
max 2208 regcomp.c r = get_max_match_length(NCALL(node)->target, max, env);
max 2210 regcomp.c *max = ONIG_INFINITE_DISTANCE;
max 2219 regcomp.c r = get_max_match_length(qn->target, max, env);
max 2220 regcomp.c if (r == 0 && *max != 0) {
max 2222 regcomp.c *max = distance_multiply(*max, qn->upper);
max 2224 regcomp.c *max = ONIG_INFINITE_DISTANCE;
max 2237 regcomp.c *max = en->max_len;
max 2239 regcomp.c r = get_max_match_length(en->target, max, env);
max 2241 regcomp.c en->max_len = *max;
max 2249 regcomp.c r = get_max_match_length(en->target, max, env);
max 3932 regcomp.c OnigDistance max; /* max byte length */
max 4021 regcomp.c if (mm->max == ONIG_INFINITE_DISTANCE) return 0;
max 4023 regcomp.c d = mm->max - mm->min;
max 4051 regcomp.c return (a->min == b->min && a->max == b->max) ? 1 : 0;
max 4059 regcomp.c mml->max = max;
max 4065 regcomp.c mml->min = mml->max = 0;
max 4072 regcomp.c to->max = from->max;
max 4079 regcomp.c to->max = distance_add(to->max, from->max);
max 4087 regcomp.c to->max = distance_add(to->max, len);
max 4095 regcomp.c if (to->max < from->max) to->max = from->max;
max 4419 regcomp.c if (add->value == 0 || to->mmd.max < add->mmd.min) {
max 4470 regcomp.c concat_opt_anc_info(&tanc, &to->anc, &add->anc, to->len.max, add->len.max);
max 4473 regcomp.c if (add->exb.len > 0 && to->len.max == 0) {
max 4475 regcomp.c to->len.max, add->len.max);
max 4479 regcomp.c if (add->map.value > 0 && to->len.max == 0) {
max 4480 regcomp.c if (add->map.mmd.max == 0)
max 4487 regcomp.c if (add->len.max != 0)
max 4504 regcomp.c if (add->len.max > 0) {
max 4505 regcomp.c if (to->expr.len > (int )add->len.max)
max 4506 regcomp.c to->expr.len = add->len.max;
max 4508 regcomp.c if (to->expr.mmd.max == 0)
max 4596 regcomp.c int max;
max 4600 regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc) * n;
max 4613 regcomp.c max = slen;
max 4616 regcomp.c set_mml(&opt->len, slen, max);
max 4633 regcomp.c OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 4635 regcomp.c set_mml(&opt->len, min, max);
max 4651 regcomp.c int i, min, max;
max 4653 regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 4655 regcomp.c if (max == 1) {
max 4680 regcomp.c set_mml(&opt->len, min, max);
max 4687 regcomp.c OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 4688 regcomp.c set_mml(&opt->len, min, max);
max 4733 regcomp.c OnigDistance min, max, tmin, tmax;
max 4744 regcomp.c r = get_max_match_length(nodes[backs[0]], &max, env->scan_env);
max 4752 regcomp.c if (max < tmax) max = tmax;
max 4754 regcomp.c if (r == 0) set_mml(&opt->len, min, max);
max 4774 regcomp.c OnigDistance min, max;
max 4782 regcomp.c if (env->mmd.max == 0 &&
max 4816 regcomp.c max = (nopt.len.max > 0 ? ONIG_INFINITE_DISTANCE : 0);
max 4818 regcomp.c max = distance_multiply(nopt.len.max, qn->upper);
max 4820 regcomp.c set_mml(&opt->len, min, max);
max 4843 regcomp.c OnigDistance min, max;
max 4846 regcomp.c max = ONIG_INFINITE_DISTANCE;
max 4848 regcomp.c if (IS_ENCLOSE_MAX_FIXED(en)) max = en->max_len;
max 4849 regcomp.c set_mml(&opt->len, min, max);
max 4920 regcomp.c reg->dmax = e->mmd.max;
max 4939 regcomp.c reg->dmax = m->mmd.max;
max 4981 regcomp.c reg->anchor_dmax = opt.len.max;
max 5002 regcomp.c if (opt.len.max == 0)
max 4550 string.c unsigned int now, max;
max 4572 string.c t->max = c;
max 4577 string.c else if (++t->now < t->max) {
max 4582 string.c return t->max;
max 4631 string.c trsrc.max = trrepl.max = 0;
max 4678 string.c int clen, tlen, max = RSTRING_LEN(str);
max 4680 string.c char *buf = ALLOC_N(char, max), *t = buf;
max 4712 string.c while (t - buf + tlen >= max) {
max 4714 string.c max *= 2;
max 4715 string.c REALLOC_N(buf, char, max);
max 4725 string.c RSTRING(str)->as.heap.aux.capa = max;
max 4745 string.c int clen, tlen, max = RSTRING_LEN(str) * 1.2;
max 4747 string.c char *buf = ALLOC_N(char, max), *t = buf;
max 4776 string.c while (t - buf + tlen >= max) {
max 4778 string.c max *= 2;
max 4779 string.c REALLOC_N(buf, char, max);
max 4793 string.c RSTRING(str)->as.heap.aux.capa = max;
max 4860 string.c tr.gen = tr.now = tr.max = 0;
max 2215 thread.c int size = howmany(max, NFDBITS) * sizeof(fd_mask);
max 2218 thread.c dst->maxfd = max;
max 2486 thread.c return do_select(max, read, write, except, timeout);
max 531 thread_pthread.c int max, min;
max 533 thread_pthread.c max = sched_get_priority_max(policy);
max 539 thread_pthread.c else if (max < priority) {
max 540 thread_pthread.c priority = max;
max 3772 transcode.c VALUE str, max;
max 3774 transcode.c rb_scan_args(argc, argv, "01", &max);
max 3776 transcode.c if (NIL_P(max))
max 3779 transcode.c n = NUM2INT(max);