max 1968 array.c if (max > 0) rb_enc_copy(result, RARRAY_AREF(ary, 0));
max 1969 array.c for (i=0; i<max; i++) {
max 4651 array.c #define RAND_UPTO(max) (long)rb_random_ulong_limited((randgen), (max)-1)
max 169 compar.c if (RTEST(cmp_gt(x, max))) return Qfalse;
max 2913 compile.c const int max = 0x100;
max 2917 compile.c for (i=0; i<max && node; i++, len++, node = node->nd_next) {
max 1590 enum.c VALUE max;
max 1601 enum.c if (memo->max == Qundef) {
max 1602 enum.c memo->max = i;
max 1605 enum.c if (OPTIMIZED_CMP(i, memo->max, memo->cmp_opt) > 0) {
max 1606 enum.c memo->max = i;
max 1620 enum.c if (memo->max == Qundef) {
max 1621 enum.c memo->max = i;
max 1624 enum.c cmp = rb_yield_values(2, i, memo->max);
max 1625 enum.c if (rb_cmpint(cmp, i, memo->max) > 0) {
max 1626 enum.c memo->max = i;
max 1668 enum.c m->max = Qundef;
max 1677 enum.c result = m->max;
max 1684 enum.c VALUE max;
max 1696 enum.c memo->max = j;
max 1703 enum.c n = OPTIMIZED_CMP(j, memo->max, memo->cmp_opt);
max 1705 enum.c memo->max = j;
max 1748 enum.c memo->max = j;
max 1755 enum.c n = rb_cmpint(rb_yield_values(2, j, memo->max), j, memo->max);
max 1757 enum.c memo->max = j;
max 1829 enum.c return rb_assoc_new(m->min, m->max);
max 2003 enum.c VALUE max;
max 2015 enum.c memo->max = i2;
max 2024 enum.c memo->max = i2;
max 2095 enum.c m->max = Qnil;
max 2102 enum.c return rb_assoc_new(m->min, m->max);
max 37 ext/bigdecimal/bigdecimal.c (a) == -1 ? (b) < -(max) : \
max 39 ext/bigdecimal/bigdecimal.c ((b) > 0 ? (max) / (a) < (b) : (min) / (a) > (b)) : \
max 40 ext/bigdecimal/bigdecimal.c ((b) > 0 ? (min) / (a) < (b) : (max) / (a) > (b)))
max 6166 ext/date/date_core.c RETURN_ENUMERATOR(self, 1, &max);
max 6169 ext/date/date_core.c while (FIX2INT(d_lite_cmp(date, max)) <= 0) {
max 6032 gc.c if (RVALUE_WB_UNPROTECTED(obj) == 0 && n<max) flags[n++] = ID_wb_protected;
max 6033 gc.c if (RVALUE_OLD_P(obj) && n<max) flags[n++] = ID_old;
max 6034 gc.c if (RVALUE_UNCOLLECTIBLE(obj) && n<max) flags[n++] = ID_uncollectible;
max 6035 gc.c if (MARKED_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj) && n<max) flags[n++] = ID_marking;
max 6037 gc.c if (MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(obj), obj) && n<max) flags[n++] = ID_marked;
max 3301 hash.c int max;
max 3304 hash.c for (max = i; environ[max]; max++) ;
max 3305 hash.c tmpenv = ALLOC_N(char*, max+2);
max 3306 hash.c for (j=0; j<max; j++) /* copy environment */
max 3308 hash.c tmpenv[max] = 0;
max 550 id_table.c int p, min = 0, max = num;
max 558 id_table.c max = num/2;
max 569 id_table.c p = min + (max - min) / 2;
max 571 id_table.c if (min >= max) {
max 576 id_table.c assert(p < max);
max 579 id_table.c if (kp > key) max = p;
max 590 id_table.c assert(min == max);
max 297 include/ruby/intern.h rb_check_arity(int argc, int min, int max)
max 299 include/ruby/intern.h if ((argc < min) || (max != UNLIMITED_ARGUMENTS && argc > max))
max 300 include/ruby/intern.h rb_error_arity(argc, min, max);
max 657 include/ruby/intern.h VALUE rb_random_int(VALUE rnd, VALUE max);
max 1603 include/ruby/ruby.h rb_mul_size_overflow(size_t a, size_t b, size_t max, size_t *c)
max 1607 include/ruby/ruby.h if (c2 > max) return 1;
max 1610 include/ruby/ruby.h if (b != 0 && a > max / b) return 1;
max 1625 include/ruby/ruby.h size_t size, max = LONG_MAX - sizeof(VALUE) + 1;
max 1626 include/ruby/ruby.h if (RB_UNLIKELY(rb_mul_size_overflow(count, elsize, max, &size))) {
max 5842 io.c int max = (int)max_file_descriptor;
max 5847 io.c maxhint = max = ret;
max 5854 io.c if (max < maxhint)
max 5855 io.c max = maxhint;
max 5856 io.c for (fd = lowfd; fd <= max; fd++) {
max 5866 io.c if (max < fd + CONTIGUOUS_CLOSED_FDS)
max 5867 io.c max = fd + CONTIGUOUS_CLOSED_FDS;
max 8393 io.c int max = 0, n;
max 8406 io.c if (max < fptr->fd) max = fptr->fd;
max 8423 io.c if (max < fptr->fd) max = fptr->fd;
max 8437 io.c if (max < fptr->fd) max = fptr->fd;
max 8441 io.c if (max < fptr->fd) max = fptr->fd;
max 8450 io.c max++;
max 8452 io.c n = rb_thread_fd_select(max, rp, wp, ep, tp);
max 908 proc.c *max = iseq->body->param.flags.has_rest == FALSE ?
max 922 proc.c return rb_iseq_min_max_arity(iseq, max);
max 928 proc.c return method_min_max_arity((VALUE)ifunc->data, max);
max 932 proc.c *max = UNLIMITED_ARGUMENTS;
max 949 proc.c return rb_block_min_max_arity(block, max);
max 956 proc.c int max, min = rb_proc_min_max_arity(self, &max);
max 958 proc.c return (proc->is_lambda ? min == max : max != UNLIMITED_ARGUMENTS) ? min : -min-1;
max 964 proc.c int min, max;
max 971 proc.c min = rb_block_min_max_arity(block, &max);
max 981 proc.c return (proc->is_lambda ? min == max : max != UNLIMITED_ARGUMENTS) ? min : -min-1;
max 984 proc.c return max != UNLIMITED_ARGUMENTS ? min : -min-1;
max 2169 proc.c if (!def) return *max = 0;
max 2173 proc.c *max = UNLIMITED_ARGUMENTS;
max 2176 proc.c return *max = check_argc(def->body.cfunc.argc);
max 2178 proc.c *max = UNLIMITED_ARGUMENTS;
max 2181 proc.c return *max = 1;
max 2183 proc.c return *max = 0;
max 2185 proc.c return rb_method_entry_min_max_arity(def->body.alias.original_me, max);
max 2187 proc.c return rb_proc_min_max_arity(def->body.proc, max);
max 2190 proc.c return rb_iseq_min_max_arity(iseq, max);
max 2194 proc.c return *max = 0;
max 2196 proc.c *max = UNLIMITED_ARGUMENTS;
max 2201 proc.c *max = UNLIMITED_ARGUMENTS;
max 2204 proc.c *max = UNLIMITED_ARGUMENTS;
max 2212 proc.c *max = UNLIMITED_ARGUMENTS;
max 2222 proc.c int max, min = rb_method_entry_min_max_arity(me, &max);
max 2223 proc.c return min == max ? min : -min-1;
max 2295 proc.c return rb_method_entry_min_max_arity(data->me, max);
max 1138 random.c long max = FIX2LONG(vmax);
max 1139 random.c if (!max) return Qnil;
max 1140 random.c if (max < 0) {
max 1142 random.c max = -max;
max 1144 random.c r = random_ulong_limited(obj, rnd, (unsigned long)max - 1);
max 1156 random.c long max = FIX2LONG(vmax);
max 1157 random.c if (max == -1) return Qnil;
max 1158 random.c r = random_ulong_limited(obj, rnd, max);
max 1214 random.c long max;
max 1219 random.c if ((max = FIX2LONG(vmax) - excl) >= 0) {
max 1220 random.c unsigned long r = random_ulong_limited(obj, rnd, (unsigned long)max);
max 1235 random.c double max = RFLOAT_VALUE(v), mid = 0.5, r;
max 1236 random.c if (isinf(max)) {
max 1238 random.c max = float_value(rb_to_float(end)) / 2.0;
max 1240 random.c mid = max + min;
max 1241 random.c max -= min;
max 1243 random.c else if (isnan(max)) {
max 1247 random.c if (max > 0.0) {
max 1250 random.c return rb_float_new(+(+(+(r - 0.5) * max) * scale) + mid);
max 1252 random.c v = rb_float_new(r * max);
max 1254 random.c else if (max == 0.0 && !excl) {
max 1336 random.c const double max = float_value(v);
max 1337 random.c if (max < 0.0) {
max 1342 random.c if (max > 0.0) r *= max;
max 2277 regcomp.c *max = 0;
max 2283 regcomp.c *max = distance_add(*max, tmax);
max 2290 regcomp.c if (r == 0 && *max < tmax) *max = tmax;
max 2297 regcomp.c *max = sn->end - sn->s;
max 2302 regcomp.c *max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 2307 regcomp.c *max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 2317 regcomp.c *max = ONIG_INFINITE_DISTANCE;
max 2325 regcomp.c if (*max < tmax) *max = tmax;
max 2333 regcomp.c r = get_max_match_length(NCALL(node)->target, max, env);
max 2335 regcomp.c *max = ONIG_INFINITE_DISTANCE;
max 2344 regcomp.c r = get_max_match_length(qn->target, max, env);
max 2345 regcomp.c if (r == 0 && *max != 0) {
max 2347 regcomp.c *max = distance_multiply(*max, qn->upper);
max 2349 regcomp.c *max = ONIG_INFINITE_DISTANCE;
max 2362 regcomp.c *max = en->max_len;
max 2364 regcomp.c r = get_max_match_length(en->target, max, env);
max 2366 regcomp.c en->max_len = *max;
max 2375 regcomp.c r = get_max_match_length(en->target, max, env);
max 4317 regcomp.c OnigDistance max; /* max byte length */
max 4406 regcomp.c if (mm->max == ONIG_INFINITE_DISTANCE) return 0;
max 4408 regcomp.c d = mm->max - mm->min;
max 4436 regcomp.c return (a->min == b->min && a->max == b->max) ? 1 : 0;
max 4444 regcomp.c mml->max = max;
max 4450 regcomp.c mml->min = mml->max = 0;
max 4457 regcomp.c to->max = from->max;
max 4464 regcomp.c to->max = distance_add(to->max, from->max);
max 4472 regcomp.c to->max = distance_add(to->max, len);
max 4480 regcomp.c if (to->max < from->max) to->max = from->max;
max 4809 regcomp.c if (add->value == 0 || to->mmd.max < add->mmd.min) {
max 4860 regcomp.c concat_opt_anc_info(&tanc, &to->anc, &add->anc, to->len.max, add->len.max);
max 4863 regcomp.c if (add->exb.len > 0 && to->len.max == 0) {
max 4865 regcomp.c to->len.max, add->len.max);
max 4869 regcomp.c if (add->map.value > 0 && to->len.max == 0) {
max 4870 regcomp.c if (add->map.mmd.max == 0)
max 4877 regcomp.c if (add->len.max != 0)
max 4894 regcomp.c if (add->len.max > 0) {
max 4895 regcomp.c if (to->expr.len > (int )add->len.max)
max 4896 regcomp.c to->expr.len = (int )add->len.max;
max 4898 regcomp.c if (to->expr.mmd.max == 0)
max 4987 regcomp.c OnigDistance max;
max 4991 regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc) * n;
max 5004 regcomp.c max = slen;
max 5007 regcomp.c set_mml(&opt->len, slen, max);
max 5024 regcomp.c OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 5026 regcomp.c set_mml(&opt->len, min, max);
max 5042 regcomp.c int i, min, max;
max 5045 regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 5047 regcomp.c if (max == 1) {
max 5073 regcomp.c set_mml(&opt->len, min, max);
max 5080 regcomp.c OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc);
max 5081 regcomp.c set_mml(&opt->len, min, max);
max 5126 regcomp.c OnigDistance min, max, tmin, tmax;
max 5137 regcomp.c r = get_max_match_length(nodes[backs[0]], &max, env->scan_env);
max 5145 regcomp.c if (max < tmax) max = tmax;
max 5147 regcomp.c if (r == 0) set_mml(&opt->len, min, max);
max 5167 regcomp.c OnigDistance min, max;
max 5175 regcomp.c if (env->mmd.max == 0 &&
max 5210 regcomp.c max = (nopt.len.max > 0 ? ONIG_INFINITE_DISTANCE : 0);
max 5212 regcomp.c max = distance_multiply(nopt.len.max, qn->upper);
max 5214 regcomp.c set_mml(&opt->len, min, max);
max 5237 regcomp.c OnigDistance min, max;
max 5240 regcomp.c max = ONIG_INFINITE_DISTANCE;
max 5242 regcomp.c if (IS_ENCLOSE_MAX_FIXED(en)) max = en->max_len;
max 5243 regcomp.c set_mml(&opt->len, min, max);
max 5324 regcomp.c reg->dmax = e->mmd.max;
max 5343 regcomp.c reg->dmax = m->mmd.max;
max 5387 regcomp.c reg->anchor_dmax = opt.len.max;
max 5408 regcomp.c if (opt.len.max == 0)
max 6147 string.c unsigned int now, max;
max 6182 string.c t->max = c;
max 6189 string.c if (t->now == t->max) {
max 6194 string.c if (t->now < t->max) {
max 6199 string.c return t->max;
max 6253 string.c trsrc.max = trrepl.max = 0;
max 6303 string.c long offset, max = RSTRING_LEN(str);
max 6305 string.c char *buf = ALLOC_N(char, max), *t = buf;
max 6343 string.c while (t - buf + tlen >= max) {
max 6345 string.c max *= 2;
max 6346 string.c REALLOC_N(buf, char, max);
max 6363 string.c RSTRING(str)->as.heap.aux.capa = max;
max 6384 string.c int clen, tlen, max = (int)(RSTRING_LEN(str) * 1.2);
max 6386 string.c char *buf = ALLOC_N(char, max), *t = buf;
max 6416 string.c while (t - buf + tlen >= max) {
max 6418 string.c max *= 2;
max 6419 string.c REALLOC_N(buf, char, max);
max 6439 string.c RSTRING(str)->as.heap.aux.capa = max;
max 6524 string.c tr.gen = tr.now = tr.max = 0;
max 3511 thread.c size_t size = howmany(max, NFDBITS) * sizeof(fd_mask);
max 3514 thread.c dst->maxfd = max;
max 3756 thread.c rb_fd_resize(max - 1, read);
max 3759 thread.c rb_fd_resize(max - 1, write);
max 3762 thread.c rb_fd_resize(max - 1, except);
max 3764 thread.c return do_select(max, read, write, except, timeout);
max 1068 thread_pthread.c int max, min;
max 1070 thread_pthread.c max = sched_get_priority_max(policy);
max 1076 thread_pthread.c else if (max < priority) {
max 1077 thread_pthread.c priority = max;
max 912 thread_sync.c long max;
max 914 thread_sync.c max = NUM2LONG(vmax);
max 915 thread_sync.c if (max <= 0) {
max 967 thread_sync.c long max = NUM2LONG(vmax), diff = 0;
max 970 thread_sync.c if (max <= 0) {
max 973 thread_sync.c if ((unsigned long)max > GET_SZQUEUE_ULONGMAX(self)) {
max 974 thread_sync.c diff = max - GET_SZQUEUE_ULONGMAX(self);
max 4107 transcode.c VALUE str, max;
max 4109 transcode.c rb_scan_args(argc, argv, "01", &max);
max 4111 transcode.c if (NIL_P(max))
max 4114 transcode.c n = NUM2INT(max);
max 225 vm_insnhelper.c if (min == max) {
max 228 vm_insnhelper.c else if (max == UNLIMITED_ARGUMENTS) {
max 232 vm_insnhelper.c err_mess = rb_sprintf("wrong number of arguments (given %d, expected %d..%d)", argc, min, max);
max 240 vm_insnhelper.c rb_exc_raise(rb_arity_error_new(argc, min, max));
max 1526 vm_trace.c if (expected_index >= max) return PJRR_FULL; /* failed */
max 2698 win32/win32.c max = min(src->fd_count, (UINT)max);
max 2699 win32/win32.c if ((UINT)dst->capa < (UINT)max) {
max 2705 win32/win32.c max * sizeof(src->fd_array[0]));