n 128 .ext/include/x86_64-linux/ruby/config.h #define DEPRECATED_BY(n,x) __attribute__ ((__deprecated__("by "#n))) x
n 897 addr2line.c int ch, n;
n 963 addr2line.c for (n = 0;; ++fmt) {
n 964 addr2line.c n = n * 10 + ch - '0';
n 970 addr2line.c dwidth = n;
n 972 addr2line.c width = n;
n 984 addr2line.c n = *p++;
n 985 addr2line.c if (num & (1 << (n - 1))) {
n 987 addr2line.c for (; (n = *p) > ' '; ++p)
n 988 addr2line.c PCHAR(n);
n 1074 addr2line.c n = (int)strlen (p);
n 1076 addr2line.c for (n = 0; n < dwidth && p[n]; n++)
n 1079 addr2line.c width -= n;
n 1084 addr2line.c while (n--)
n 1149 addr2line.c p = ksprintn(nbuf, num, base, &n, upper);
n 1162 addr2line.c width -= tmp + imax(dwidth, n);
n 1163 addr2line.c dwidth -= n;
n 66 array.c long tmp_n = (n); \
n 74 array.c RARRAY(ary)->as.heap.len = (n); \
n 78 array.c ARY_SET_EMBED_LEN((ary), (n)); \
n 81 array.c ARY_SET_HEAP_LEN((ary), (n)); \
n 83 array.c assert(RARRAY_LEN(ary) == (n)); \
n 88 array.c RARRAY(ary)->as.heap.ptr += (n); \
n 93 array.c ARY_SET_EMBED_LEN((ary), RARRAY_LEN(ary)+(n)); \
n 96 array.c RARRAY(ary)->as.heap.len += (n); \
n 106 array.c RARRAY(ary)->as.heap.aux.capa = (n); \
n 505 array.c ary = rb_ary_new2(n);
n 507 array.c va_start(ar, n);
n 508 array.c for (i=0; i<n; i++) {
n 513 array.c ARY_SET_LEN(ary, n);
n 522 array.c ary = rb_ary_new2(n);
n 523 array.c if (n > 0 && elts) {
n 524 array.c ary_memcpy(ary, 0, n, elts);
n 525 array.c ARY_SET_LEN(ary, n);
n 872 array.c long n;
n 877 array.c n = NUM2LONG(nv);
n 879 array.c if (n > len) {
n 880 array.c n = len;
n 882 array.c else if (n < 0) {
n 886 array.c offset = len - n;
n 888 array.c return ary_make_partial(ary, rb_cArray, offset, n);
n 951 array.c long n;
n 953 array.c n = RARRAY_LEN(ary);
n 954 array.c if (n == 0) return Qnil;
n 956 array.c n * 3 < ARY_CAPA(ary) &&
n 959 array.c ary_resize_capa(ary, n * 2);
n 961 array.c --n;
n 962 array.c ARY_SET_LEN(ary, n);
n 963 array.c return RARRAY_AREF(ary, n);
n 1057 array.c long n;
n 1065 array.c n = RARRAY_LEN(result);
n 1069 array.c ary_mem_clear(ary, 0, n);
n 1071 array.c ARY_INCREASE_PTR(ary, n);
n 1076 array.c MEMMOVE(ptr, ptr+n, VALUE, RARRAY_LEN(ary)-n);
n 1084 array.c ARY_INCREASE_LEN(ary, -n);
n 2318 array.c long n = 1;
n 2321 array.c case 1: n = NUM2LONG(argv[0]);
n 2325 array.c rb_ary_rotate(ary, n);
n 2392 array.c int n;
n 2395 array.c n = rb_cmpint(retval, a, b);
n 2397 array.c return n;
n 2406 array.c int n;
n 2418 array.c n = rb_cmpint(retval, a, b);
n 2421 array.c return n;
n 3277 array.c if (!NIL_P(result)) return rb_ary_subseq(result, 0, n);
n 3278 array.c result = rb_ary_new2(n);
n 3279 array.c args[0] = result; args[1] = (VALUE)n;
n 3893 array.c VALUE n;
n 3898 array.c n = rb_hash(RARRAY_AREF(ary, i));
n 3899 array.c h = rb_hash_uint(h, NUM2LONG(n));
n 4419 array.c long n;
n 4429 array.c n = p - RARRAY_CONST_PTR(ary);
n 4430 array.c if (RARRAY_LEN(ary) == n) {
n 4433 array.c ary_resize_smaller(ary, n);
n 4480 array.c long i, n = 0;
n 4490 array.c if (RTEST(rb_yield(v))) n++;
n 4501 array.c if (rb_equal(RARRAY_AREF(ary, i), obj)) n++;
n 4505 array.c return LONG2NUM(n);
n 4758 array.c long n, len, i, j, k, idx[10];
n 4781 array.c n = NUM2LONG(nv);
n 4782 array.c if (n < 0) rb_raise(rb_eArgError, "negative sample number");
n 4783 array.c if (n > len) n = len;
n 4784 array.c if (n <= numberof(idx)) {
n 4785 array.c for (i = 0; i < n; ++i) {
n 4791 array.c if (len < k && n <= numberof(idx)) {
n 4792 array.c for (i = 0; i < n; ++i) {
n 4796 array.c if (n > len) n = len;
n 4797 array.c switch (n) {
n 4819 array.c if (n <= numberof(idx)) {
n 4822 array.c for (i=1; i<n; i++) {
n 4831 array.c result = rb_ary_new_capa(n);
n 4833 array.c for (i=0; i<n; i++) {
n 4843 array.c for (i=0; i<n; i++) {
n 4852 array.c ARY_SET_LEN(result, n);
n 4861 array.c VALUE n = Qnil;
n 4863 array.c n = RARRAY_AREF(args, 0);
n 4866 array.c if (n == Qnil) return DBL2NUM(INFINITY);
n 4867 array.c mul = NUM2LONG(n);
n 4869 array.c n = LONG2FIX(mul);
n 4870 array.c return rb_funcallv(rb_ary_length(self), '*', 1, &n);
n 4896 array.c long n, i;
n 4903 array.c n = -1;
n 4906 array.c n = NUM2LONG(nv);
n 4907 array.c if (n <= 0) return Qnil;
n 4910 array.c while (RARRAY_LEN(ary) > 0 && (n < 0 || 0 < n--)) {
n 4918 array.c #define tmpbuf(n, size) rb_str_tmp_new((n)*(size))
n 4920 array.c #define tmpary(n) rb_ary_tmp_new(n)
n 4960 array.c const char *const unused = memchr(&used[i], 0, n-i);
n 4975 array.c for (i = 0; i < n; ++i) {
n 5022 array.c long n = RARRAY_LEN(ary);
n 5023 array.c long k = (args && (RARRAY_LEN(args) > 0)) ? NUM2LONG(RARRAY_AREF(args, 0)) : n;
n 5025 array.c return descending_factorial(n, k);
n 5060 array.c long r, n, i;
n 5062 array.c n = RARRAY_LEN(ary); /* Array length */
n 5065 array.c r = NIL_P(num) ? n : NUM2LONG(num); /* Permutation size from argument */
n 5067 array.c if (r < 0 || n < r) {
n 5080 array.c long *p = ALLOCV_N(long, t0, r+roomof(n, sizeof(long)));
n 5085 array.c MEMZERO(used, char, n); /* initialize array */
n 5087 array.c permute0(n, r, p, used, ary0); /* compute and yield permutations */
n 5099 array.c MEMZERO(stack+1, long, n);
n 5102 array.c for (lev++; lev < n; lev++) {
n 5105 array.c if (!yield_indexed_values(values, n, stack+1)) {
n 5111 array.c } while (stack[lev+1]+n == len+lev+1);
n 5118 array.c long n = RARRAY_LEN(ary);
n 5121 array.c return binomial_coefficient(k, n);
n 5152 array.c long i, n, len;
n 5154 array.c n = NUM2LONG(num);
n 5157 array.c if (n < 0 || len < n) {
n 5160 array.c else if (n == 0) {
n 5163 array.c else if (n == 1) {
n 5171 array.c long *stack = ALLOCV_N(long, t0, n+1);
n 5174 array.c combinate0(len, n, stack, ary0);
n 5204 array.c for (i = 0; i < n; ++i) {
n 5212 array.c } while ((i = ++p[--index]) >= n);
n 5219 array.c long n = RARRAY_LEN(ary);
n 5228 array.c return rb_funcallv(LONG2NUM(n), id_power, 1, &v);
n 5257 array.c long r, n, i;
n 5259 array.c n = RARRAY_LEN(ary); /* Array length */
n 5280 array.c rpermute0(n, r, p, ary0); /* compute and yield repeated permutations */
n 5298 array.c for (; i < n; ++i) {
n 5306 array.c } while ((i = ++p[--index]) >= n);
n 5313 array.c long n = RARRAY_LEN(ary);
n 5318 array.c return binomial_coefficient(k, n + k - 1);
n 5351 array.c long n, i, len;
n 5353 array.c n = NUM2LONG(num); /* Combination size from argument */
n 5356 array.c if (n < 0) {
n 5359 array.c else if (n == 0) {
n 5362 array.c else if (n == 1) {
n 5372 array.c long *p = ALLOCV_N(long, t0, n);
n 5376 array.c rcombinate0(len, n, p, n, ary0); /* compute and yield repeated combinations */
n 5407 array.c int n = argc+1; /* How many arrays we're operating on */
n 5408 array.c volatile VALUE t0 = tmpary(n);
n 5409 array.c volatile VALUE t1 = tmpbuf(n, sizeof(int));
n 5420 array.c ARY_SET_LEN(t0, n);
n 5422 array.c for (i = 1; i < n; i++) arrays[i] = Qnil;
n 5423 array.c for (i = 1; i < n; i++) arrays[i] = to_ary(argv[i-1]);
n 5426 array.c for (i = 0; i < n; i++) counters[i] = 0;
n 5431 array.c for (i = 0; i < n; i++) {
n 5438 array.c for (i = 0; i < n; i++) {
n 5453 array.c VALUE subarray = rb_ary_new2(n);
n 5454 array.c for (j = 0; j < n; j++) {
n 5477 array.c m = n-1;
n 5511 array.c long len = NUM2LONG(n);
n 5567 array.c long pos = NUM2LONG(n);
n 5703 array.c long i, n;
n 5714 array.c n = 0;
n 5721 array.c n += FIX2LONG(e); /* should not overflow long type */
n 5722 array.c if (!FIXABLE(n)) {
n 5723 array.c v = rb_big_plus(LONG2NUM(n), v);
n 5724 array.c n = 0;
n 5738 array.c if (n != 0)
n 5739 array.c v = rb_fix_plus(LONG2FIX(n), v);
n 5752 array.c if (n != 0)
n 5753 array.c v = rb_fix_plus(LONG2FIX(n), v);
n 69 bignum.c #define LSHIFTABLE(d, n) ((n) < sizeof(d) * CHAR_BIT)
n 70 bignum.c #define LSHIFTX(d, n) (!LSHIFTABLE(d, n) ? 0 : ((d) << (!LSHIFTABLE(d, n) ? 0 : (n))))
n 103 bignum.c #define bdigit_roomof(n) roomof(n, SIZEOF_BDIGIT)
n 119 bignum.c size_t bdigitz_zero_n = (n); \
n 127 bignum.c while (0 < (n) && (ds)[(n)-1] == 0) \
n 128 bignum.c (n)--; \
n 362 bignum.c assert(n <= 2);
n 364 bignum.c if (n == 2)
n 366 bignum.c if (n == 1)
n 374 bignum.c assert(n == 2);
n 405 bignum.c for (i=0; i<n; i++) {
n 422 bignum.c while (n--) {
n 423 bignum.c num = (num | xds[n]) >> shift;
n 424 bignum.c x = xds[n];
n 425 bignum.c zds[n] = BIGLO(num);
n 444 bignum.c while (n--)
n 445 bignum.c ds[n] = BIGLO(~ds[n]);
n 453 bignum.c for (i = 0; i < n; i++) {
n 463 bignum.c for (; i < n; i++) {
n 604 bignum.c ret = (*ddp) & (((BDIGIT_DBL)1 << n) - 1);
n 605 bignum.c *ddp >>= n;
n 606 bignum.c *numbits_in_dd_p -= n;
n 848 bignum.c integer_pack_take_lowbits(n, &dd, &numbits_in_dd)
n 1431 bignum.c for (i = 0; i < n; i++) {
n 1442 bignum.c BDIGIT_DBL n;
n 1446 bignum.c n = (BDIGIT_DBL)x * y;
n 1447 bignum.c bdigitdbl2bary(zds, 2, n);
n 1454 bignum.c BDIGIT_DBL n;
n 1463 bignum.c n = 0;
n 1465 bignum.c BDIGIT_DBL ee = n + dd * yds[j];
n 1467 bignum.c n = zds[j] + ee;
n 1468 bignum.c zds[j] = BIGLO(n);
n 1469 bignum.c n = BIGDN(n);
n 1472 bignum.c n = 0;
n 1477 bignum.c if (n == 0)
n 1479 bignum.c n += zds[j];
n 1480 bignum.c zds[j] = BIGLO(n);
n 1481 bignum.c n = BIGDN(n);
n 1483 bignum.c return n != 0;
n 1624 bignum.c size_t r, n;
n 1632 bignum.c n = 0;
n 1638 bignum.c if (2 * (xn + r) <= zn - n) {
n 1639 bignum.c tds = zds + n + xn + r;
n 1640 bignum.c mulfunc(tds, tn, xds, xn, yds + n, r, wds, wn);
n 1641 bignum.c BDIGITS_ZERO(zds + n + xn, r);
n 1642 bignum.c bary_add(zds + n, tn,
n 1643 bignum.c zds + n, tn,
n 1651 bignum.c tds = zds + n;
n 1652 bignum.c MEMCPY(wds, zds + n, BDIGIT, xn);
n 1653 bignum.c mulfunc(tds, tn, xds, xn, yds + n, r, wds+xn, wn-xn);
n 1654 bignum.c bary_add(zds + n, tn,
n 1655 bignum.c zds + n, tn,
n 1659 bignum.c n += r;
n 1684 bignum.c size_t n;
n 1709 bignum.c n = yn / 2;
n 1711 bignum.c assert(n < xn);
n 1713 bignum.c if (wn < n) {
n 1720 bignum.c wn = 2*n;
n 1736 bignum.c xds1 = xds + n;
n 1738 bignum.c yds1 = yds + n;
n 1740 bignum.c zds1 = zds + n;
n 1741 bignum.c zds2 = zds + 2*n;
n 1742 bignum.c zds3 = zds + 3*n;
n 1748 bignum.c if (bary_sub(zds0, n, xds, n, xds+n, xn-n)) {
n 1749 bignum.c bary_2comp(zds0, n);
n 1757 bignum.c bary_mul_karatsuba_start(zds1, 2*n, zds0, n, zds0, n, wds, wn);
n 1760 bignum.c if (bary_sub(wds, n, yds, n, yds+n, n)) {
n 1761 bignum.c bary_2comp(wds, n);
n 1767 bignum.c bary_mul_karatsuba_start(zds1, 2*n, zds0, n, wds, n, wds+n, wn-n);
n 1774 bignum.c borrow = !bary_2comp(zds1, 2*n);
n 1778 bignum.c MEMCPY(wds, zds1, BDIGIT, n);
n 1782 bignum.c bary_mul_karatsuba_start(zds0, 2*n, xds0, n, yds0, n, wds+n, wn-n);
n 1786 bignum.c carry1 = bary_add(wds, n, wds, n, zds0, n);
n 1787 bignum.c carry1 = bary_addc(zds2, n, zds2, n, zds1, n, carry1);
n 1791 bignum.c carry2 = bary_add(zds1, n, zds1, n, wds, n);
n 1795 bignum.c MEMCPY(wds, zds2, BDIGIT, n);
n 1799 bignum.c bary_mul_karatsuba_start(zds2, zn-2*n, xds1, xn-n, yds1, n, wds+n, wn-n);
n 1803 bignum.c carry3 = bary_add(zds1, n, zds1, n, zds2, n);
n 1807 bignum.c carry3 = bary_addc(zds2, n, zds2, n, zds3, (4*n < zn ? n : zn-3*n), carry3);
n 1811 bignum.c bary_add(zds2, zn-2*n, zds2, zn-2*n, wds, n);
n 1816 bignum.c bary_add_one(zds2, zn-2*n);
n 1819 bignum.c bary_sub_one(zds3, zn-3*n);
n 1822 bignum.c bary_add(zds3, zn-3*n, zds3, zn-3*n, &c, 1);
n 1864 bignum.c size_t n;
n 1903 bignum.c n = (yn + 2) / 3;
n 1904 bignum.c assert(2*n < xn);
n 1908 bignum.c wnc += (u1n = n+1); /* BITSPERDIG*n+2 bits */
n 1909 bignum.c wnc += (u2n = n+1); /* BITSPERDIG*n+1 bits */
n 1910 bignum.c wnc += (u3n = n+1); /* BITSPERDIG*n+3 bits */
n 1911 bignum.c wnc += (v1n = n+1); /* BITSPERDIG*n+2 bits */
n 1912 bignum.c wnc += (v2n = n+1); /* BITSPERDIG*n+1 bits */
n 1913 bignum.c wnc += (v3n = n+1); /* BITSPERDIG*n+3 bits */
n 1915 bignum.c wnc += (t0n = 2*n); /* BITSPERDIG*2*n bits */
n 1916 bignum.c wnc += (t1n = 2*n+2); /* BITSPERDIG*2*n+4 bits but bary_mul needs u1n+v1n */
n 1917 bignum.c wnc += (t2n = 2*n+2); /* BITSPERDIG*2*n+2 bits but bary_mul needs u2n+v2n */
n 1918 bignum.c wnc += (t3n = 2*n+2); /* BITSPERDIG*2*n+6 bits but bary_mul needs u3n+v3n */
n 1919 bignum.c wnc += (t4n = 2*n); /* BITSPERDIG*2*n bits */
n 1921 bignum.c wnc += (z1n = 2*n+1); /* BITSPERDIG*2*n+5 bits */
n 1922 bignum.c wnc += (z2n = 2*n+1); /* BITSPERDIG*2*n+6 bits */
n 1923 bignum.c wnc += (z3n = 2*n+1); /* BITSPERDIG*2*n+8 bits */
n 1951 bignum.c zzn = 6*n+1;
n 1953 bignum.c x0n = n;
n 1954 bignum.c x1n = n;
n 1955 bignum.c x2n = xn - 2*n;
n 1957 bignum.c x1ds = xds + n;
n 1958 bignum.c x2ds = xds + 2*n;
n 1969 bignum.c y0n = n;
n 1970 bignum.c y1n = n;
n 1971 bignum.c y2n = yn - 2*n;
n 1973 bignum.c y1ds = yds + n;
n 1974 bignum.c y2ds = yds + 2*n;
n 2221 bignum.c BDIGITS_ZERO(zzds + z0n, 4*n - z0n);
n 2222 bignum.c MEMCPY(zzds + 4*n, z4ds, BDIGIT, z4n);
n 2223 bignum.c BDIGITS_ZERO(zzds + 4*n + z4n, zzn - (4*n + z4n));
n 2225 bignum.c bary_add(zzds + n, zzn - n, zzds + n, zzn - n, z1ds, z1n);
n 2227 bignum.c bary_sub(zzds + n, zzn - n, zzds + n, zzn - n, z1ds, z1n);
n 2229 bignum.c bary_add(zzds + 2*n, zzn - 2*n, zzds + 2*n, zzn - 2*n, z2ds, z2n);
n 2231 bignum.c bary_sub(zzds + 2*n, zzn - 2*n, zzds + 2*n, zzn - 2*n, z2ds, z2n);
n 2233 bignum.c bary_add(zzds + 3*n, zzn - 3*n, zzds + 3*n, zzn - 3*n, z3ds, z3n);
n 2235 bignum.c bary_sub(zzds + 3*n, zzn - 3*n, zzds + 3*n, zzn - 3*n, z3ds, z3n);
n 2318 bignum.c if ( ds[rb_genrand_ulong_limited(n / 2) + n / 4]) c++;
n 2319 bignum.c if (c <= 1 && ds[rb_genrand_ulong_limited(n / 2) + n / 4]) c++;
n 2320 bignum.c if (c <= 1 && ds[rb_genrand_ulong_limited(n / 2) + n / 4]) c++;
n 3042 bignum.c long n = BIGNUM_LEN(x);
n 3046 bignum.c BARY_TRUNC(ds, n);
n 3048 bignum.c if (n != 0 && BIGNUM_NEGATIVE_P(x)) {
n 3049 bignum.c VALUE z = bignew_1(CLASS_OF(x), n, 0);
n 3050 bignum.c MEMCPY(BDIGITS(z), ds, BDIGIT, n);
n 3051 bignum.c bary_2comp(BDIGITS(z), n);
n 3055 bignum.c *n_ret = n;
n 3085 bignum.c size_t n = BIGNUM_LEN(x);
n 3093 bignum.c BARY_TRUNC(ds, n);
n 3095 bignum.c if (n == 0) return INT2FIX(0);
n 3098 bignum.c if (sizeof(long)/SIZEOF_BDIGIT < n)
n 3101 bignum.c int i = (int)n;
n 3108 bignum.c if (1 < n)
n 3122 bignum.c rb_big_resize(x, n);
n 3149 bignum.c digits[0] = n;
n 3152 bignum.c digits[i] = BIGLO(n);
n 3153 bignum.c n = BIGDN(n);
n 3170 bignum.c if (n < 0) {
n 3171 bignum.c u = 1 + (VALUE)(-(n + 1)); /* u = -n avoiding overflow */
n 3175 bignum.c u = n;
n 3187 bignum.c if (POSFIXABLE(n)) return LONG2FIX(n);
n 3188 bignum.c return rb_uint2big(n);
n 3194 bignum.c if (FIXABLE(n)) return LONG2FIX(n);
n 3195 bignum.c return rb_int2big(n);
n 4035 bignum.c if (len > 0 && len <= (n)) goto bad; \
n 4036 bignum.c str += (n); \
n 4037 bignum.c len -= (n); \
n 4398 bignum.c digits[0] = n;
n 4401 bignum.c digits[i] = BIGLO(n);
n 4402 bignum.c n = BIGDN(n);
n 4419 bignum.c if (n < 0) {
n 4420 bignum.c u = 1 + (unsigned LONG_LONG)(-(n + 1)); /* u = -n avoiding overflow */
n 4424 bignum.c u = n;
n 4436 bignum.c if (POSFIXABLE(n)) return LONG2FIX(n);
n 4437 bignum.c return rb_ull2big(n);
n 4443 bignum.c if (FIXABLE(n)) return LONG2FIX(n);
n 4444 bignum.c return rb_ll2big(n);
n 4458 bignum.c digits[i] = BIGLO(RSHIFT(n ,BITSPERDIG*i));
n 4474 bignum.c if (n < 0) {
n 4475 bignum.c u = 1 + (uint128_t)(-(n + 1)); /* u = -n avoiding overflow */
n 4479 bignum.c u = n;
n 5394 bignum.c int n;
n 5414 bignum.c n = FIX2INT(rel);
n 5417 bignum.c case big_op_gt: return n > 0 ? Qtrue : Qfalse;
n 5418 bignum.c case big_op_ge: return n >= 0 ? Qtrue : Qfalse;
n 5419 bignum.c case big_op_lt: return n < 0 ? Qtrue : Qfalse;
n 5420 bignum.c case big_op_le: return n <= 0 ? Qtrue : Qfalse;
n 5505 bignum.c long n = BIGNUM_LEN(z);
n 5507 bignum.c if (!n) return INT2FIX(-1);
n 5510 bignum.c if (bary_add_one(ds, n)) {
n 5516 bignum.c bary_neg(ds, n);
n 5517 bignum.c if (bary_add_one(ds, n))
n 5519 bignum.c bary_neg(ds, n);
n 5763 bignum.c long n;
n 5766 bignum.c n = FIX2LONG(y);
n 5767 bignum.c if ((n > 0) != BIGNUM_SIGN(x)) {
n 5768 bignum.c if (n < 0) {
n 5769 bignum.c n = -n;
n 5771 bignum.c return bigsub_int(x, n);
n 5773 bignum.c if (n < 0) {
n 5774 bignum.c n = -n;
n 5776 bignum.c return bigadd_int(x, n);
n 5792 bignum.c long n;
n 5795 bignum.c n = FIX2LONG(y);
n 5796 bignum.c if ((n > 0) != BIGNUM_SIGN(x)) {
n 5797 bignum.c if (n < 0) {
n 5798 bignum.c n = -n;
n 5800 bignum.c return bigadd_int(x, n);
n 5802 bignum.c if (n < 0) {
n 5803 bignum.c n = -n;
n 5805 bignum.c return bigsub_int(x, n);
n 6094 bignum.c if (n < 0)
n 6095 bignum.c return big_lshift(x, 1+(unsigned long)(-(n+1)));
n 6096 bignum.c else if (n > 0)
n 6097 bignum.c return big_rshift(x, (unsigned long)n);
n 41 ccan/list/list.h struct list_node n;
n 46 ccan/list/list.h #define list_debug_node(n, loc) ((void)loc, n)
n 60 ccan/list/list.h #define LIST_HEAD_INIT(name) { { &name.n, &name.n } }
n 91 ccan/list/list.h h->n.next = h->n.prev = &h->n;
n 103 ccan/list/list.h n->next = n->prev = n;
n 123 ccan/list/list.h #define list_add_after(h, p, n) list_add_after_(h, p, n, LIST_LOC)
n 129 ccan/list/list.h n->next = p->next;
n 130 ccan/list/list.h n->prev = p;
n 131 ccan/list/list.h p->next->prev = n;
n 132 ccan/list/list.h p->next = n;
n 149 ccan/list/list.h #define list_add(h, n) list_add_(h, n, LIST_LOC)
n 154 ccan/list/list.h list_add_after_(h, &h->n, n, abortstr);
n 172 ccan/list/list.h #define list_add_before(h, p, n) list_add_before_(h, p, n, LIST_LOC)
n 178 ccan/list/list.h n->next = p;
n 179 ccan/list/list.h n->prev = p->prev;
n 180 ccan/list/list.h p->prev->next = n;
n 181 ccan/list/list.h p->prev = n;
n 195 ccan/list/list.h #define list_add_tail(h, n) list_add_tail_(h, n, LIST_LOC)
n 200 ccan/list/list.h list_add_before_(h, &h->n, n, abortstr);
n 216 ccan/list/list.h return h->n.next == &h->n;
n 236 ccan/list/list.h return h->n.next == &h->n;
n 254 ccan/list/list.h #define list_del(n) list_del_(n, LIST_LOC)
n 257 ccan/list/list.h (void)list_debug_node(n, abortstr);
n 258 ccan/list/list.h n->next->prev = n->prev;
n 259 ccan/list/list.h n->prev->next = n->next;
n 262 ccan/list/list.h n->next = n->prev = NULL;
n 280 ccan/list/list.h #define list_del_init(n) list_del_init_(n, LIST_LOC)
n 283 ccan/list/list.h list_del_(n, abortstr);
n 284 ccan/list/list.h list_node_init(n);
n 307 ccan/list/list.h for (i = h->n.next; i != n; i = i->next)
n 308 ccan/list/list.h assert(i != &h->n);
n 314 ccan/list/list.h list_del(n);
n 335 ccan/list/list.h #define list_swap(o, n) list_swap_(o, n, LIST_LOC)
n 341 ccan/list/list.h *n = *o;
n 342 ccan/list/list.h n->next->prev = n;
n 343 ccan/list/list.h n->prev->next = n;
n 363 ccan/list/list.h #define list_entry(n, type, member) container_of(n, type, member)
n 386 ccan/list/list.h return (const char *)h->n.next - off;
n 408 ccan/list/list.h struct list_node *n;
n 412 ccan/list/list.h n = h->n.next;
n 413 ccan/list/list.h list_del(n);
n 414 ccan/list/list.h return (const char *)n - off;
n 438 ccan/list/list.h return (const char *)h->n.prev - off;
n 575 ccan/list/list.h struct list_node *from_tail = list_debug(from, abortstr)->n.prev;
n 576 ccan/list/list.h struct list_node *to_tail = list_debug(to, abortstr)->n.prev;
n 579 ccan/list/list.h to->n.prev = from_tail;
n 580 ccan/list/list.h from_tail->next = &to->n;
n 581 ccan/list/list.h to_tail->next = &from->n;
n 582 ccan/list/list.h from->n.prev = to_tail;
n 585 ccan/list/list.h list_del(&from->n);
n 607 ccan/list/list.h struct list_node *from_tail = list_debug(from, abortstr)->n.prev;
n 608 ccan/list/list.h struct list_node *to_head = list_debug(to, abortstr)->n.next;
n 611 ccan/list/list.h to->n.next = &from->n;
n 612 ccan/list/list.h from->n.prev = &to->n;
n 617 ccan/list/list.h list_del(&from->n);
n 623 ccan/list/list.h for (i = list_node_to_off_(list_debug(h, LIST_LOC)->n.dir, \
n 625 ccan/list/list.h list_node_from_off_((void *)i, (off)) != &(h)->n; \
n 630 ccan/list/list.h for (i = list_node_to_off_(list_debug(h, LIST_LOC)->n.dir, \
n 634 ccan/list/list.h list_node_from_off_(i, (off)) != &(h)->n; \
n 722 ccan/list/list.h ((type *)list_node_from_off_((n), (off)))
n 731 ccan/list/list.h list_add((h), list_node_from_off_((n), (off)))
n 734 ccan/list/list.h list_del(list_node_from_off_((n), (off)))
n 737 ccan/list/list.h list_del_from(h, list_node_from_off_((n), (off)))
n 769 ccan/list/list.h if (n == &h->n)
n 771 ccan/list/list.h return (char *)n - off;
n 32 compile.c #define FIXNUM_INC(n, i) ((n)+(INT2FIX(i)&~FIXNUM_FLAG))
n 33 compile.c #define FIXNUM_OR(n, i) ((n)|INT2FIX(i))
n 361 compile.c #define ERROR_ARGS_AT(n) iseq, nd_line(n),
n 1999 compile.c VALUE n = OPERAND_AT(nobj, 0);
n 2001 compile.c LABEL *nl = (LABEL *)n;
n 2004 compile.c OPERAND_AT(dobj, 0) = n;
n 5303 compile.c NODE *n = node;
n 5304 compile.c while (n) {
n 5305 compile.c COMPILE(ret, "values item", n->nd_head);
n 5306 compile.c n = n->nd_next;
n 6513 compile.c size_t n = rb_call_info_kw_arg_bytes(len);
n 6515 compile.c kw_arg = xmalloc(n);
n 7086 compile.c #define IBF_W(b, type, n) (type *)(VALUE)ibf_dump_write(dump, (b), sizeof(type) * (n))
n 7088 compile.c #define IBF_WP(b, type, n) ibf_dump_write(dump, (b), sizeof(type) * (n))
n 7089 compile.c #define IBF_R(val, type, n) (type *)ibf_load_alloc(load, IBF_OFFSET(val), sizeof(type) * (n))
n 43 complex.c f_##n(VALUE x, VALUE y)\
n 50 complex.c f_##n(VALUE x)\
n 52 complex.c return rb_funcall(x, id_##n, 0);\
n 57 complex.c f_##n(VALUE x, VALUE y)\
n 59 complex.c return rb_funcall(x, id_##n, 1, y);\
n 64 complex.c m_##n(VALUE x)\
n 66 complex.c return rb_funcall(rb_mMath, id_##n, 1, x);\
n 71 complex.c m_##n(VALUE x, VALUE y)\
n 73 complex.c return rb_funcall(rb_mMath, id_##n, 2, x, y);\
n 476 complex.c m_##n##_bang(VALUE x)\
n 478 complex.c return rb_math_##n(x);\
n 483 complex.c m_##n##_bang(VALUE x, VALUE y)\
n 485 complex.c return rb_math_##n(x, y);\
n 811 complex.c VALUE r, n;
n 814 complex.c n = f_mul(bdat->real, f_add(ONE, f_mul(r, r)));
n 817 complex.c (*func)(self, n),
n 818 complex.c (*func)(f_negate(f_mul(self, r)), n));
n 821 complex.c f_mul(adat->imag, r)), n),
n 823 complex.c f_mul(adat->real, r)), n));
n 826 complex.c VALUE r, n;
n 829 complex.c n = f_mul(bdat->imag, f_add(ONE, f_mul(r, r)));
n 832 complex.c (*func)(f_mul(self, r), n),
n 833 complex.c (*func)(f_negate(self), n));
n 836 complex.c adat->imag), n),
n 838 complex.c adat->real), n));
n 936 complex.c long n;
n 940 complex.c n = FIX2LONG(other) - 1;
n 942 complex.c while (n) {
n 948 complex.c q = n / 2;
n 949 complex.c r = n % 2;
n 958 complex.c n = q;
n 961 complex.c n--;
n 1226 complex.c VALUE n;
n 1229 complex.c n = rb_hash(dat->real);
n 1230 complex.c h[0] = NUM2LONG(n);
n 1231 complex.c n = rb_hash(dat->imag);
n 1232 complex.c h[1] = NUM2LONG(n);
n 281 cont.c size_t n = (cont->vm_stack_slen + cont->vm_stack_clen);
n 283 cont.c size_t n = cont->saved_thread.stack_size;
n 285 cont.c size += n * sizeof(*cont->vm_stack);
n 794 cont.c E(k) = E(l) = E(m) = E(n) = E(o) =
n 798 cont.c E(k) = E(l) = E(m) = E(n) = E(o) =
n 1220 dir.c #define GLOB_ALLOC_N(type, n) ((type *)malloc(sizeof(type) * (n)))
n 1976 dir.c size_t n;
n 1987 dir.c n = root - start;
n 1988 dir.c buf = GLOB_ALLOC_N(char, n + 1);
n 1990 dir.c MEMCPY(buf, start, char, n);
n 1991 dir.c buf[n] = '\0';
n 1998 dir.c status = glob_helper(buf, n, 0, path_unknown, &list, &list + 1,
n 158 enc/big5.c return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) : \
n 123 enc/cp949.c return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) : \
n 229 enc/emacs_mule.c OnigCodePoint n;
n 232 enc/emacs_mule.c n = (OnigCodePoint )*p++;
n 233 enc/emacs_mule.c if (len == 1) return n;
n 238 enc/emacs_mule.c n <<= 8; n += c;
n 240 enc/emacs_mule.c return n;
n 230 enc/euc_jp.c OnigCodePoint n;
n 233 enc/euc_jp.c n = (OnigCodePoint )*p++;
n 234 enc/euc_jp.c if (len == 1) return n;
n 239 enc/euc_jp.c n <<= 8; n += c;
n 241 enc/euc_jp.c return n;
n 101 enc/euc_kr.c return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) : \
n 137 enc/euc_tw.c return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) : \
n 151 enc/gb18030.c return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) : \
n 170 enc/gb18030.c OnigCodePoint n;
n 173 enc/gb18030.c n = (OnigCodePoint )(*p++);
n 174 enc/gb18030.c if (len == 1) return n;
n 179 enc/gb18030.c n <<= 8; n += c;
n 181 enc/gb18030.c return n;
n 123 enc/gbk.c return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) : \
n 41 enc/jis/props.h return onigenc_with_ascii_strnicmp(ONIG_ENCODING_ASCII, str, str + n, s, n);
n 115 enc/jis/props.h for (; n > 0;)
n 121 enc/jis/props.h n--;
n 246 enc/shift_jis.c OnigCodePoint n;
n 250 enc/shift_jis.c n = c;
n 251 enc/shift_jis.c if (len == 1) return n;
n 256 enc/shift_jis.c n <<= 8; n += c;
n 258 enc/shift_jis.c return n;
n 186 enc/trans/escape.c int n = 0;
n 189 enc/trans/escape.c o[n++] = '"';
n 191 enc/trans/escape.c o[n++] = s[0];
n 192 enc/trans/escape.c return n;
n 199 enc/trans/escape.c int n = 0;
n 202 enc/trans/escape.c o[n++] = '"';
n 205 enc/trans/escape.c o[n++] = '"';
n 208 enc/trans/escape.c return n;
n 68981 enc/trans/utf8_mac.c size_t n = 0;
n 68983 enc/trans/utf8_mac.c o[n++] = buf_shift(sp);
n 68986 enc/trans/utf8_mac.c return n;
n 68992 enc/trans/utf8_mac.c size_t n = 0;
n 68994 enc/trans/utf8_mac.c o[n++] = buf_shift(sp);
n 68996 enc/trans/utf8_mac.c return n;
n 69018 enc/trans/utf8_mac.c size_t n = 0;
n 69029 enc/trans/utf8_mac.c buf[n++] = getBT1(next_info);
n 69030 enc/trans/utf8_mac.c buf[n++] = getBT2(next_info);
n 69032 enc/trans/utf8_mac.c buf[n++] = getBT3(next_info);
n 69034 enc/trans/utf8_mac.c buf_push(sp, buf, n);
n 69065 enc/trans/utf8_mac.c ssize_t n = 0;
n 69069 enc/trans/utf8_mac.c n = from_utf8_mac_finish(sp, o, osize);
n 69072 enc/trans/utf8_mac.c n = from_utf8_mac_finish(sp, o, osize);
n 69073 enc/trans/utf8_mac.c o[n++] = *s++;
n 69074 enc/trans/utf8_mac.c o[n++] = *s++;
n 69075 enc/trans/utf8_mac.c o[n++] = *s++;
n 69076 enc/trans/utf8_mac.c o[n++] = *s++;
n 69077 enc/trans/utf8_mac.c return n;
n 69081 enc/trans/utf8_mac.c n += buf_apply(sp, o);
n 69082 enc/trans/utf8_mac.c return n;
n 75 enc/unicode.c int n;
n 90 enc/unicode.c int n;
n 107 enc/unicode.c return (c >> (2 - n) * 7) & 127;
n 113 enc/unicode.c return bits_of(c[n / 3], n % 3);
n 147 enc/unicode.c #define SpecialsLengthExtract(n) ((n)>>SpecialsLengthOffset)
n 148 enc/unicode.c #define SpecialsCodepointExtract(n) ((n)&((1<<SpecialsLengthOffset)-1))
n 149 enc/unicode.c #define SpecialsLengthEncode(n) ((n)<<SpecialsLengthOffset)
n 152 enc/unicode.c #define OnigSpecialIndexEncode(n) ((n)<<OnigSpecialIndexShift)
n 153 enc/unicode.c #define OnigSpecialIndexDecode(n) (((n)&OnigSpecialIndexMask)>>OnigSpecialIndexShift)
n 163 enc/unicode.c #define I(n) OnigSpecialIndexEncode(n)
n 164 enc/unicode.c #define L(n) SpecialsLengthEncode(n)
n 295 enc/unicode.c if (OnigCodePointCount(to->n) == 1) {
n 306 enc/unicode.c for (i = 0; i < OnigCodePointCount(to->n); i++) {
n 332 enc/unicode.c for (j = 0; j < OnigCodePointCount(p11->to.n); j++) {
n 371 enc/unicode.c for (j = 0; j < OnigCodePointCount(p11->to.n); j++) {
n 397 enc/unicode.c for (j = 0; j < OnigCodePointCount(CaseUnfold_12[i].to.n); j++) {
n 402 enc/unicode.c for (k = 0; k < OnigCodePointCount(CaseUnfold_12[i].to.n); k++) {
n 416 enc/unicode.c for (j = 0; j < OnigCodePointCount(CaseUnfold_12_Locale[i].to.n); j++) {
n 421 enc/unicode.c for (k = 0; k < OnigCodePointCount(CaseUnfold_12_Locale[i].to.n); k++) {
n 436 enc/unicode.c for (j = 0; j < OnigCodePointCount(CaseUnfold_13[i].to.n); j++) {
n 441 enc/unicode.c for (k = 0; k < OnigCodePointCount(CaseUnfold_13[i].to.n); k++) {
n 455 enc/unicode.c #define CodePointListValidP(x) (OnigCodePointCount((x)->n) <= numberof((x)->code))
n 462 enc/unicode.c int n, i, j, k, len;
n 467 enc/unicode.c n = 0;
n 500 enc/unicode.c if (OnigCodePointCount(to->n) == 1) {
n 506 enc/unicode.c n++;
n 511 enc/unicode.c for (i = 0; i < OnigCodePointCount(to->n); i++) {
n 513 enc/unicode.c items[n].byte_len = len;
n 514 enc/unicode.c items[n].code_len = 1;
n 515 enc/unicode.c items[n].code[0] = to->code[i];
n 516 enc/unicode.c n++;
n 525 enc/unicode.c for (fn = 0; fn < OnigCodePointCount(to->n); fn++) {
n 528 enc/unicode.c for (i = 0; i < OnigCodePointCount(z3->n); i++) {
n 531 enc/unicode.c ncs[fn] = OnigCodePointCount(z3->n) + 1;
n 540 enc/unicode.c items[n].byte_len = len;
n 541 enc/unicode.c items[n].code_len = 2;
n 542 enc/unicode.c items[n].code[0] = cs[0][i];
n 543 enc/unicode.c items[n].code[1] = cs[1][j];
n 544 enc/unicode.c n++;
n 550 enc/unicode.c for (i = 0; i < OnigCodePointCount(z2->n); i++) {
n 553 enc/unicode.c items[n].byte_len = len;
n 554 enc/unicode.c items[n].code_len = 1;
n 555 enc/unicode.c items[n].code[0] = z2->code[i];
n 556 enc/unicode.c n++;
n 564 enc/unicode.c items[n].byte_len = len;
n 565 enc/unicode.c items[n].code_len = 3;
n 566 enc/unicode.c items[n].code[0] = cs[0][i];
n 567 enc/unicode.c items[n].code[1] = cs[1][j];
n 568 enc/unicode.c items[n].code[2] = cs[2][k];
n 569 enc/unicode.c n++;
n 576 enc/unicode.c for (i = 0; i < OnigCodePointCount(z2->n); i++) {
n 579 enc/unicode.c items[n].byte_len = len;
n 580 enc/unicode.c items[n].code_len = 1;
n 581 enc/unicode.c items[n].code[0] = z2->code[i];
n 582 enc/unicode.c n++;
n 594 enc/unicode.c for (i = 0; i < OnigCodePointCount(to->n); i++) {
n 595 enc/unicode.c items[n].byte_len = len;
n 596 enc/unicode.c items[n].code_len = 1;
n 597 enc/unicode.c items[n].code[0] = to->code[i];
n 598 enc/unicode.c n++;
n 612 enc/unicode.c && OnigCodePointCount(to->n) == 1) {
n 622 enc/unicode.c for (i = 0; i < OnigCodePointCount(z2->n); i++) {
n 623 enc/unicode.c items[n].byte_len = len;
n 624 enc/unicode.c items[n].code_len = 1;
n 625 enc/unicode.c items[n].code[0] = z2->code[i];
n 626 enc/unicode.c n++;
n 634 enc/unicode.c && OnigCodePointCount(to->n) == 1) {
n 644 enc/unicode.c for (i = 0; i < OnigCodePointCount(z2->n); i++) {
n 645 enc/unicode.c items[n].byte_len = len;
n 646 enc/unicode.c items[n].code_len = 1;
n 647 enc/unicode.c items[n].code[0] = z2->code[i];
n 648 enc/unicode.c n++;
n 655 enc/unicode.c return n;
n 725 enc/unicode.c && (OnigCaseFoldFlags(folded->n)&ONIGENC_CASE_IS_TITLECASE)) { /* but already Titlecase */
n 728 enc/unicode.c else if (flags&OnigCaseFoldFlags(folded->n)) { /* needs and data availability match */
n 733 enc/unicode.c if (flags&OnigCaseFoldFlags(folded->n)&ONIGENC_CASE_SPECIALS) { /* special */
n 734 enc/unicode.c OnigCodePoint *SpecialsStart = CaseMappingSpecials + OnigSpecialIndexDecode(folded->n);
n 736 enc/unicode.c if (OnigCaseFoldFlags(folded->n)&ONIGENC_CASE_IS_TITLECASE) { /* swapCASE available */
n 743 enc/unicode.c if (OnigCaseFoldFlags(folded->n)&ONIGENC_CASE_TITLECASE) { /* Titlecase available */
n 749 enc/unicode.c if (OnigCaseFoldFlags(folded->n)&ONIGENC_CASE_DOWN_SPECIAL) {
n 760 enc/unicode.c count = OnigCodePointCount(folded->n);
n 778 enc/unicode.c if (flags&OnigCaseFoldFlags(folded->n)) { /* needs and data availability match */
n 780 enc/unicode.c if (flags&OnigCaseFoldFlags(folded->n)&ONIGENC_CASE_TITLECASE)
n 275 enc/utf_8.c OnigCodePoint n;
n 281 enc/utf_8.c n = c & ((1 << (6 - len)) - 1);
n 284 enc/utf_8.c n = (n << 6) | (c & ((1 << 6) - 1));
n 286 enc/utf_8.c return n;
n 1010 encoding.c int n = ONIGENC_PRECISE_MBC_ENC_LEN(enc, (UChar*)p, (UChar*)e);
n 1011 encoding.c if (MBCLEN_CHARFOUND_P(n) && MBCLEN_CHARFOUND_LEN(n) <= e-p)
n 1012 encoding.c return MBCLEN_CHARFOUND_LEN(n);
n 1022 encoding.c int n;
n 1025 encoding.c n = ONIGENC_PRECISE_MBC_ENC_LEN(enc, (UChar*)p, (UChar*)e);
n 1026 encoding.c if (e-p < n)
n 1027 encoding.c return ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(n-(int)(e-p));
n 1028 encoding.c return n;
n 1078 encoding.c int n = ONIGENC_CODE_TO_MBCLEN(enc,c);
n 1079 encoding.c if (n == 0) {
n 1082 encoding.c return n;
n 354 enum.c if (!FIXNUM_P(size)) return n;
n 356 enum.c return ((unsigned long)n > limit) ? (long)limit : n;
n 364 enum.c return ((unsigned long)n > FIX2ULONG(size));
n 643 enum.c long i, n;
n 663 enum.c n = 0;
n 667 enum.c n += FIX2LONG(e); /* should not overflow long type */
n 668 enum.c if (!FIXABLE(n)) {
n 669 enum.c v = rb_big_plus(LONG2NUM(n), v);
n 670 enum.c n = 0;
n 678 enum.c if (n != 0)
n 679 enum.c v = rb_fix_plus(LONG2FIX(n), v);
n 683 enum.c if (n != 0)
n 684 enum.c v = rb_fix_plus(LONG2FIX(n), v);
n 948 enum.c long n;
n 969 enum.c RARRAY_ASET(data->buf, data->n*2, v);
n 970 enum.c RARRAY_ASET(data->buf, data->n*2+1, i);
n 971 enum.c data->n++;
n 972 enum.c if (data->n == SORT_BY_BUFSIZE) {
n 974 enum.c data->n = 0;
n 1091 enum.c data->n = 0;
n 1095 enum.c if (data->n) {
n 1096 enum.c rb_ary_resize(buf, data->n*2);
n 1220 enum.c long n;
n 1259 enum.c long n;
n 1269 enum.c if (data->curlen <= data->n)
n 1272 enum.c n = data->n;
n 1321 enum.c if (store_index <= n && n <= store_index+num_pivots)
n 1324 enum.c if (n < store_index) {
n 1335 enum.c data->curlen = data->n;
n 1336 enum.c rb_ary_resize(data->buf, data->n * eltsize);
n 1379 enum.c data.n = NUM2LONG(num);
n 1380 enum.c if (data.n < 0)
n 1381 enum.c rb_raise(rb_eArgError, "negative size (%ld)", data.n);
n 1382 enum.c if (data.n == 0)
n 1384 enum.c if (LONG_MAX/4/(by ? 2 : 1) < data.n)
n 1386 enum.c data.bufmax = data.n * 4;
n 1692 enum.c int n;
n 1699 enum.c n = OPTIMIZED_CMP(i, memo->min, memo->cmp_opt);
n 1700 enum.c if (n < 0) {
n 1703 enum.c n = OPTIMIZED_CMP(j, memo->max, memo->cmp_opt);
n 1704 enum.c if (n > 0) {
n 1714 enum.c int n;
n 1726 enum.c n = OPTIMIZED_CMP(j, i, memo->cmp_opt);
n 1727 enum.c if (n == 0)
n 1729 enum.c else if (n < 0) {
n 1744 enum.c int n;
n 1751 enum.c n = rb_cmpint(rb_yield_values(2, i, memo->min), i, memo->min);
n 1752 enum.c if (n < 0) {
n 1755 enum.c n = rb_cmpint(rb_yield_values(2, j, memo->max), j, memo->max);
n 1756 enum.c if (n > 0) {
n 1766 enum.c int n;
n 1778 enum.c n = rb_cmpint(rb_yield_values(2, j, i), j, i);
n 1779 enum.c if (n == 0)
n 1781 enum.c else if (n < 0) {
n 2034 enum.c int n;
n 2049 enum.c n = rb_cmpint(rb_funcall(vj, id_cmp, 1, vi), vj, vi);
n 2050 enum.c if (n == 0) {
n 2054 enum.c else if (n < 0) {
n 2144 enum.c long n = MEMO_CAST(memo)->u3.cnt++;
n 2146 enum.c return rb_yield_values(2, rb_enum_values_pack(argc, argv), INT2NUM(n));
n 2292 enum.c VALUE n, size;
n 2299 enum.c n = rb_funcall(size, '+', 1, LONG2NUM(slice_size-1));
n 2300 enum.c return rb_funcall(n, id_div, 1, LONG2FIX(slice_size));
n 2322 enum.c long size = NUM2LONG(n);
n 2328 enum.c RETURN_SIZED_ENUMERATOR(obj, 1, &n, enum_each_slice_size);
n 2365 enum.c VALUE n, size;
n 2372 enum.c n = rb_funcall(size, '+', 1, LONG2NUM(1 - cons_size));
n 2373 enum.c return (rb_cmpint(rb_funcall(n, id_cmp, 1, LONG2FIX(0)), n, LONG2FIX(0)) == -1) ? LONG2FIX(0) : n;
n 2400 enum.c long size = NUM2LONG(n);
n 2405 enum.c RETURN_SIZED_ENUMERATOR(obj, 1, &n, enum_each_cons_size);
n 2451 enum.c long n = memo->u3.cnt++;
n 2460 enum.c if (RARRAY_LEN(e) <= n) {
n 2464 enum.c rb_ary_push(tmp, RARRAY_AREF(e, n));
n 2624 enum.c long len = NUM2LONG(n);
n 2702 enum.c long len = NUM2LONG(n);
n 2773 enum.c VALUE n = Qnil;
n 2779 enum.c n = RARRAY_AREF(args, 0);
n 2781 enum.c if (n == Qnil) return DBL2NUM(INFINITY);
n 2782 enum.c mul = NUM2LONG(n);
n 2813 enum.c long n, i, len;
n 2819 enum.c n = -1;
n 2822 enum.c n = NUM2LONG(nv);
n 2823 enum.c if (n <= 0) return Qnil;
n 2830 enum.c while (n < 0 || 0 < --n) {
n 3569 enum.c long n;
n 3580 enum.c long n = memo->n;
n 3594 enum.c n += FIX2LONG(i); /* should not overflow long type */
n 3595 enum.c if (!FIXABLE(n)) {
n 3596 enum.c v = rb_big_plus(LONG2NUM(n), v);
n 3597 enum.c n = 0;
n 3609 enum.c if (n != 0) {
n 3610 enum.c v = rb_fix_plus(LONG2FIX(n), v);
n 3611 enum.c n = 0;
n 3663 enum.c memo->n = n;
n 3755 enum.c memo.n = 0;
n 3781 enum.c if (memo.n != 0)
n 3782 enum.c memo.v = rb_fix_plus(LONG2FIX(memo.n), memo.v);
n 1856 enumerator.c long len = NUM2LONG(n);
n 1868 enumerator.c lazy_take_func, n);
n 1870 enumerator.c return lazy_set_method(lazy, rb_ary_new3(1, n), lazy_take_size);
n 1927 enumerator.c long len = NUM2LONG(n);
n 1933 enumerator.c lazy_drop_func, n),
n 1934 enumerator.c rb_ary_new3(1, n), lazy_drop_size);
n 1431 error.c if (!st_lookup(syserr_tbl, n, &error)) {
n 1435 error.c switch (n) {
n 1451 error.c rb_define_const(error, "Errno", INT2NUM(n));
n 1452 error.c st_add_direct(syserr_tbl, n, error);
n 1465 error.c if (!st_lookup(syserr_tbl, n, &error)) {
n 1468 error.c snprintf(name, sizeof(name), "E%03d", n);
n 1469 error.c error = set_syserr(n, name);
n 2129 error.c int n = errno;
n 2132 error.c if (n == 0) {
n 2135 error.c return rb_syserr_new(n, mesg);
n 2141 error.c int n = errno;
n 2145 error.c if (n == 0) {
n 2149 error.c return rb_syserr_new_str(n, mesg);
n 2157 error.c return rb_syserr_new_str(n, arg);
n 2163 error.c return rb_class_new_instance(1, &arg, get_syserr(n));
n 2194 error.c int n = errno;
n 2197 error.c rb_syserr_fail_path_in(func_name, n, path);
n 2206 error.c if (n == 0) {
n 2214 error.c rb_exc_raise(rb_class_new_instance(2, args, get_syserr(n)));
n 237 eval.c rb_iseq_t *iseq = (rb_iseq_t *)n;
n 240 eval.c if (!n) return 0;
n 274 eval.c VALUE v = (VALUE)n;
n 296 eval.c if (!ruby_executable_node(n, &status)) {
n 300 eval.c return ruby_cleanup(ruby_exec_node(n));
n 307 eval.c ruby_init_stack((void *)&n);
n 308 eval.c return ruby_exec_internal(n);
n 679 eval.c int n;
n 696 eval.c n = 0;
n 702 eval.c n = 1;
n 705 eval.c mesg = rb_check_funcall(exc, idException, n, argv+1);
n 75 eval_intern.h #define select(n, r, w, e, t) select_large_fdset((n), (r), (w), (e), (t))
n 3 ext/-test-/bignum/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 9 ext/-test-/bug_reporter/bug_reporter.c int n = (int)(uintptr_t)ptr;
n 10 ext/-test-/bug_reporter/bug_reporter.c fprintf(out, "Sample bug reporter: %d\n", n);
n 3 ext/-test-/class/init.c #define init(n) {void Init_##n(VALUE mod); Init_##n(mod);}
n 3 ext/-test-/debug/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 22 ext/-test-/exception/dataerror.c VALUE n = rb_str_new_cstr("[Bug #9167] error");
n 23 ext/-test-/exception/dataerror.c return TypedData_Wrap_Struct(klass, &dataerror_type, (void *)n);
n 3 ext/-test-/exception/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 3 ext/-test-/file/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(module);}
n 3 ext/-test-/float/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 3 ext/-test-/hash/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 3 ext/-test-/integer/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 3 ext/-test-/iter/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 3 ext/-test-/method/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 39 ext/-test-/printf/printf.c int n = 0;
n 47 ext/-test-/printf/printf.c n = NUM2INT(num);
n 88 ext/-test-/printf/printf.c result = rb_enc_sprintf(rb_usascii_encoding(), format, n);
n 3 ext/-test-/proc/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 3 ext/-test-/string/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 32 ext/-test-/string/qsort.c long l, b = 0, n, s = 1;
n 44 ext/-test-/string/qsort.c (((n = NUM2INT(len)) < 0) ?
n 46 ext/-test-/string/qsort.c (b + n * s > l))) {
n 47 ext/-test-/string/qsort.c n = (l - b) / s;
n 52 ext/-test-/string/qsort.c ruby_qsort(RSTRING_PTR(str) + b, n, s,
n 6 ext/-test-/struct/duplicate.c const char *n = NIL_P(name) ? 0 : StringValueCStr(name);
n 8 ext/-test-/struct/duplicate.c return rb_struct_define(n, m, m, NULL);
n 14 ext/-test-/struct/duplicate.c const char *n = StringValueCStr(name);
n 16 ext/-test-/struct/duplicate.c return rb_struct_define_under(obj, n, m, m, NULL);
n 3 ext/-test-/struct/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 3 ext/-test-/symbol/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 3 ext/-test-/time/init.c #define init(n) {void Init_##n(VALUE klass); Init_##n(klass);}
n 3 ext/-test-/win32/console/init.c #define init(n) {void Init_##n(VALUE m); Init_##n(m);}
n 67 ext/bigdecimal/bigdecimal.c #define ENTER(n) volatile VALUE RB_UNUSED_VAR(vStack[n]);int iStack=0
n 92 ext/bigdecimal/bigdecimal.c #define DECIMAL_SIZE_OF_BITS(n) (((n) * 3010 + 9998) / 9999)
n 595 ext/bigdecimal/bigdecimal.c SIGNED_VALUE n;
n 597 ext/bigdecimal/bigdecimal.c n = FIX2INT(v);
n 598 ext/bigdecimal/bigdecimal.c if (n < 0) {
n 601 ext/bigdecimal/bigdecimal.c return n;
n 1519 ext/bigdecimal/bigdecimal.c if (NIL_P(n)) { /* div in Float sense */
n 1529 ext/bigdecimal/bigdecimal.c ix = GetPositiveInt(n);
n 1555 ext/bigdecimal/bigdecimal.c VALUE b,n;
n 1557 ext/bigdecimal/bigdecimal.c rb_scan_args(argc, argv, "11", &b, &n);
n 1559 ext/bigdecimal/bigdecimal.c return BigDecimal_div2(self, b, n);
n 1567 ext/bigdecimal/bigdecimal.c SIGNED_VALUE mx = GetPositiveInt(n);
n 1597 ext/bigdecimal/bigdecimal.c SIGNED_VALUE mx = GetPositiveInt(n);
n 1615 ext/bigdecimal/bigdecimal.c SIGNED_VALUE mx = GetPositiveInt(n);
n 1659 ext/bigdecimal/bigdecimal.c size_t mx, n;
n 1664 ext/bigdecimal/bigdecimal.c n = GetPositiveInt(nFig) + VpDblFig() + BASE_FIG;
n 1665 ext/bigdecimal/bigdecimal.c if (mx <= n) mx = n;
n 2110 ext/bigdecimal/bigdecimal.c #define BigMath_exp(x, n) BigMath_s_exp(rb_mBigMath, (x), (n))
n 2111 ext/bigdecimal/bigdecimal.c #define BigMath_log(x, n) BigMath_s_log(rb_mBigMath, (x), (n))
n 2212 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "1"));
n 2215 ext/bigdecimal/bigdecimal.c log_x = BigMath_log(x->obj, SSIZET2NUM(n+1));
n 2216 ext/bigdecimal/bigdecimal.c multiplied = BigDecimal_mult2(exp->obj, log_x, SSIZET2NUM(n+1));
n 2217 ext/bigdecimal/bigdecimal.c y = BigMath_exp(multiplied, SSIZET2NUM(n));
n 2240 ext/bigdecimal/bigdecimal.c ssize_t mp, ma, n;
n 2247 ext/bigdecimal/bigdecimal.c n = NIL_P(prec) ? (ssize_t)(x->Prec*VpBaseFig()) : NUM2SSIZET(prec);
n 2250 ext/bigdecimal/bigdecimal.c y = VpCreateRbObject(n, "0#");
n 2289 ext/bigdecimal/bigdecimal.c exp = GetVpValueWithPrec(vexp, n, 1);
n 2312 ext/bigdecimal/bigdecimal.c y = VpCreateRbObject(n, "#0");
n 2337 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "1"));
n 2340 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "0"));
n 2345 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "1"));
n 2357 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "0"));
n 2361 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "-0"));
n 2366 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "-0"));
n 2370 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "0"));
n 2374 ext/bigdecimal/bigdecimal.c y = VpCreateRbObject(n, "0#");
n 2398 ext/bigdecimal/bigdecimal.c return rmpd_power_by_big_decimal(x, exp, n);
n 2403 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "1"));
n 2407 ext/bigdecimal/bigdecimal.c y = VpCreateRbObject(n, "0#");
n 2417 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "-0"));
n 2420 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "0"));
n 2425 ext/bigdecimal/bigdecimal.c y = VpCreateRbObject(n, "0#");
n 2435 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "-0"));
n 2438 ext/bigdecimal/bigdecimal.c return ToValue(VpCreateRbObject(n, "0"));
n 2457 ext/bigdecimal/bigdecimal.c VpMidRound(y, VpGetRoundMode(), n);
n 2759 ext/bigdecimal/bigdecimal.c ssize_t prec, n, i;
n 2830 ext/bigdecimal/bigdecimal.c n = prec + rmpd_double_figures();
n 2844 ext/bigdecimal/bigdecimal.c ssize_t m = n - vabs(ey - ed);
n 2890 ext/bigdecimal/bigdecimal.c ssize_t prec, n, i;
n 2988 ext/bigdecimal/bigdecimal.c n = prec + rmpd_double_figures();
n 2989 ext/bigdecimal/bigdecimal.c RB_GC_GUARD(vn) = SSIZET2NUM(n);
n 3008 ext/bigdecimal/bigdecimal.c ssize_t m = n - vabs(ey - ed);
n 3512 ext/bigdecimal/bigdecimal.c rmpd_set_thread_local_precision_limit(n);
n 3546 ext/bigdecimal/bigdecimal.c switch (n) {
n 3564 ext/bigdecimal/bigdecimal.c if (VpIsRoundMode(n)) {
n 3565 ext/bigdecimal/bigdecimal.c rmpd_set_thread_local_rounding_mode(n);
n 3566 ext/bigdecimal/bigdecimal.c return n;
n 3858 ext/bigdecimal/bigdecimal.c SIGNED_VALUE m = e+n;
n 3861 ext/bigdecimal/bigdecimal.c if (n > 0) {
n 3870 ext/bigdecimal/bigdecimal.c else if (n < 0) {
n 4064 ext/bigdecimal/bigdecimal.c size_t n;
n 4078 ext/bigdecimal/bigdecimal.c n = (a->Prec < c->MaxPrec) ? (a->Prec) : (c->MaxPrec);
n 4079 ext/bigdecimal/bigdecimal.c c->Prec = n;
n 4080 ext/bigdecimal/bigdecimal.c memcpy(c->frac, a->frac, n * sizeof(BDIGIT));
n 4085 ext/bigdecimal/bigdecimal.c VpInternalRound(c, n, (n>0) ? a->frac[n-1] : 0, a->frac[n]);
n 4110 ext/bigdecimal/bigdecimal.c size_t n, na, nb, i;
n 4165 ext/bigdecimal/bigdecimal.c n = Min(na, nb);
n 4166 ext/bigdecimal/bigdecimal.c for (i=0; i < n; ++i) {
n 4693 ext/bigdecimal/bigdecimal.c size_t i, n, ind_a, ind_b, ind_c, ind_r;
n 4787 ext/bigdecimal/bigdecimal.c n = ind_b;
n 4788 ext/bigdecimal/bigdecimal.c for (i = 0; i <= n; ++i) {
n 4822 ext/bigdecimal/bigdecimal.c n = ind_b;
n 4823 ext/bigdecimal/bigdecimal.c for (i = 0; i <= n; ++i) {
n 5177 ext/bigdecimal/bigdecimal.c size_t n;
n 5182 ext/bigdecimal/bigdecimal.c n = BASE1;
n 5183 ext/bigdecimal/bigdecimal.c while ((a->frac[0] / n) == 0) {
n 5185 ext/bigdecimal/bigdecimal.c n /= 10;
n 5193 ext/bigdecimal/bigdecimal.c size_t i, n, ZeroSup;
n 5212 ext/bigdecimal/bigdecimal.c n = a->Prec;
n 5213 ext/bigdecimal/bigdecimal.c for (i = 0; i < n; ++i) {
n 5276 ext/bigdecimal/bigdecimal.c size_t i, n, ZeroSup;
n 5291 ext/bigdecimal/bigdecimal.c n = a->Prec;
n 5292 ext/bigdecimal/bigdecimal.c for (i = 0; i < n; ++i) {
n 5324 ext/bigdecimal/bigdecimal.c size_t i, n;
n 5335 ext/bigdecimal/bigdecimal.c n = a->Prec;
n 5346 ext/bigdecimal/bigdecimal.c for (i = 0; i < n; ++i) {
n 5748 ext/bigdecimal/bigdecimal.c SIGNED_VALUE n, e;
n 5776 ext/bigdecimal/bigdecimal.c n = (SIGNED_VALUE)y->MaxPrec;
n 5777 ext/bigdecimal/bigdecimal.c if (x->MaxPrec > (size_t)n) n = (ssize_t)x->MaxPrec;
n 5781 ext/bigdecimal/bigdecimal.c r = VpAlloc((n + n) * (BASE_FIG + 2), "#1");
n 5794 ext/bigdecimal/bigdecimal.c n = e / 2;
n 5795 ext/bigdecimal/bigdecimal.c if (e - n * 2 != 0) {
n 5797 ext/bigdecimal/bigdecimal.c n = (e + 1) / 2;
n 5800 ext/bigdecimal/bigdecimal.c y->exponent += n;
n 5801 ext/bigdecimal/bigdecimal.c n = (SIGNED_VALUE)((DBLE_FIG + BASE_FIG - 1) / BASE_FIG);
n 5802 ext/bigdecimal/bigdecimal.c y->MaxPrec = Min((size_t)n , y_prec);
n 5804 ext/bigdecimal/bigdecimal.c n = (SIGNED_VALUE)(y_prec * BASE_FIG);
n 5805 ext/bigdecimal/bigdecimal.c if (n < (SIGNED_VALUE)maxnr) n = (SIGNED_VALUE)maxnr;
n 5816 ext/bigdecimal/bigdecimal.c } while (++nr < n);
n 5862 ext/bigdecimal/bigdecimal.c ssize_t n,i,ix,ioffset, exptoadd;
n 5883 ext/bigdecimal/bigdecimal.c n = (ssize_t)BASE_FIG - ioffset - 1;
n 5884 ext/bigdecimal/bigdecimal.c for (shifter = 1, i = 0; i < n; ++i) shifter *= 10;
n 5985 ext/bigdecimal/bigdecimal.c for (i = 0; i <= n; ++i) div *= 10;
n 6184 ext/bigdecimal/bigdecimal.c if (n == 0) {
n 6189 ext/bigdecimal/bigdecimal.c if (n < 0) {
n 6190 ext/bigdecimal/bigdecimal.c n = -n;
n 6191 ext/bigdecimal/bigdecimal.c if (sign < 0) sign = (n % 2) ? -1 : 1;
n 6195 ext/bigdecimal/bigdecimal.c if (sign < 0) sign = (n % 2) ? -1 : 1;
n 6205 ext/bigdecimal/bigdecimal.c if (n == 0) {
n 6209 ext/bigdecimal/bigdecimal.c if (n > 0) {
n 6210 ext/bigdecimal/bigdecimal.c VpSetInf(y, (n % 2 == 0 || VpIsPosInf(x)) ? 1 : -1);
n 6213 ext/bigdecimal/bigdecimal.c VpSetZero(y, (n % 2 == 0 || VpIsPosInf(x)) ? 1 : -1);
n 6221 ext/bigdecimal/bigdecimal.c if ((n % 2) == 0) goto Exit;
n 6226 ext/bigdecimal/bigdecimal.c if (n > 0) sign = 1;
n 6227 ext/bigdecimal/bigdecimal.c else if (n < 0) {
n 6229 ext/bigdecimal/bigdecimal.c n = -n;
n 6243 ext/bigdecimal/bigdecimal.c --n;
n 6244 ext/bigdecimal/bigdecimal.c while (n > 0) {
n 6247 ext/bigdecimal/bigdecimal.c while (ss = s, (s += s) <= (size_t)n) {
n 6251 ext/bigdecimal/bigdecimal.c n -= (SIGNED_VALUE)ss;
n 6265 ext/bigdecimal/bigdecimal.c printf(" n=%"PRIdVALUE"\n", n);
n 235 ext/bigdecimal/bigdecimal.h VP_EXPORT size_t VpSetPrecLimit(size_t n);
n 238 ext/bigdecimal/bigdecimal.h VP_EXPORT int VpIsRoundMode(unsigned short n);
n 240 ext/bigdecimal/bigdecimal.h VP_EXPORT unsigned short VpSetRoundMode(unsigned short n);
n 273 ext/bigdecimal/bigdecimal.h VP_EXPORT int VpPower(Real *y, Real *x, SIGNED_VALUE n);
n 150 ext/date/date_core.c #define DIV(n,d) ((n)<0 ? NDIV((n),(d)) : (n)/(d))
n 151 ext/date/date_core.c #define MOD(n,d) ((n)<0 ? NMOD((n),(d)) : (n)%(d))
n 617 ext/date/date_core.c if (n > 0) {
n 625 ext/date/date_core.c *rjd = (rjd2 - MOD((rjd2 - k) + 1, 7)) + 7 * n;
n 821 ext/date/date_core.c if (n < 0) {
n 829 ext/date/date_core.c c_jd_to_nth_kday(rjd2 + n * 7, sg, &ry2, &rm2, &rn2, &rk2);
n 832 ext/date/date_core.c n = rn2;
n 834 ext/date/date_core.c c_nth_kday_to_jd(y, m, n, k, sg, rjd, ns);
n 836 ext/date/date_core.c if (y != ry2 || m != *rm || n != *rn || k != *rk)
n 948 ext/date/date_core.c if (FIXNUM_P(n))
n 949 ext/date/date_core.c return rb_rational_new2(n, day_in_nanoseconds);
n 950 ext/date/date_core.c return f_quo(n, day_in_nanoseconds);
n 966 ext/date/date_core.c if (FIXNUM_P(n))
n 967 ext/date/date_core.c return rb_rational_new2(n, INT2FIX(SECOND_IN_NANOSECONDS));
n 968 ext/date/date_core.c return f_quo(n, INT2FIX(SECOND_IN_NANOSECONDS));
n 975 ext/date/date_core.c return ns_to_day(INT2FIX(n));
n 1060 ext/date/date_core.c VALUE n = sec_to_ns(s);
n 1063 ext/date/date_core.c *f = f_mod(n, INT2FIX(1));
n 1064 ext/date/date_core.c return f_floor(n);
n 2139 ext/date/date_core.c c_nth_kday_to_jd(FIX2INT(y), m, n, k, sg, &jd, ns);
n 2150 ext/date/date_core.c c_nth_kday_to_jd(*ry, m, n, k, style, rjd, ns);
n 2312 ext/date/date_core.c r = c_valid_nth_kday_p(FIX2INT(y), m, n, k, sg, rm, rn, rk, &jd, ns);
n 2325 ext/date/date_core.c r = c_valid_nth_kday_p(*ry, m, n, k, style, rm, rn, rk, rjd, ns);
n 2339 ext/date/date_core.c long n;
n 2341 ext/date/date_core.c n = FIX2LONG(vof);
n 2342 ext/date/date_core.c if (n != -1 && n != 0 && n != 1)
n 2344 ext/date/date_core.c *rof = (int)n * DAY_IN_SECONDS;
n 2349 ext/date/date_core.c double n;
n 2351 ext/date/date_core.c n = RFLOAT_VALUE(vof) * DAY_IN_SECONDS;
n 2352 ext/date/date_core.c if (n < -DAY_IN_SECONDS || n > DAY_IN_SECONDS)
n 2354 ext/date/date_core.c *rof = (int)round(n);
n 2355 ext/date/date_core.c if (*rof != n)
n 2370 ext/date/date_core.c long n;
n 2378 ext/date/date_core.c n = FIX2LONG(vs);
n 2379 ext/date/date_core.c if (n < -DAY_IN_SECONDS || n > DAY_IN_SECONDS)
n 2381 ext/date/date_core.c *rof = (int)n;
n 2389 ext/date/date_core.c n = FIX2LONG(vn);
n 2396 ext/date/date_core.c n = FIX2LONG(vn);
n 2397 ext/date/date_core.c if (n < -DAY_IN_SECONDS || n > DAY_IN_SECONDS)
n 2400 ext/date/date_core.c *rof = (int)n;
n 2406 ext/date/date_core.c long n;
n 2410 ext/date/date_core.c n = FIX2LONG(vs);
n 2411 ext/date/date_core.c if (n < -DAY_IN_SECONDS || n > DAY_IN_SECONDS)
n 2413 ext/date/date_core.c *rof = (int)n;
n 2818 ext/date/date_core.c int m, n, k, ry, rm, rn, rk;
n 2823 ext/date/date_core.c n = NUM2INT(argv[2]);
n 2831 ext/date/date_core.c if (!valid_nth_kday_p(y, m, n, k, sg,
n 3213 ext/date/date_core.c if (argc > n)\
n 3223 ext/date/date_core.c if (argc > n)\
n 3562 ext/date/date_core.c int m, n, k;
n 3569 ext/date/date_core.c n = 1;
n 3580 ext/date/date_core.c n = NUM2INT(vn);
n 3591 ext/date/date_core.c if (!valid_nth_kday_p(y, m, n, k, sg,
n 3838 ext/date/date_core.c long j, n = 0;
n 3842 ext/date/date_core.c n++;
n 3843 ext/date/date_core.c if (n > eno) {
n 3844 ext/date/date_core.c eno = n;
n 5152 ext/date/date_core.c NUM2INT(n), NUM2INT(k), m_virtual_sg(dat), /* !=m_sg() */
n 5836 ext/date/date_core.c VALUE n, sf, r;
n 5838 ext/date/date_core.c n = f_sub(m_nth(adat), m_nth(bdat));
n 5842 ext/date/date_core.c canonicalize_jd(n, d);
n 5862 ext/date/date_core.c if (f_zero_p(n))
n 5865 ext/date/date_core.c r = f_mul(n, INT2FIX(CM_PERIOD));
n 5926 ext/date/date_core.c VALUE n;
n 5928 ext/date/date_core.c rb_scan_args(argc, argv, "01", &n);
n 5930 ext/date/date_core.c n = INT2FIX(1);
n 5931 ext/date/date_core.c return d_lite_plus(self, n);
n 5943 ext/date/date_core.c VALUE n;
n 5945 ext/date/date_core.c rb_scan_args(argc, argv, "01", &n);
n 5947 ext/date/date_core.c n = INT2FIX(1);
n 5948 ext/date/date_core.c return d_lite_minus(self, n);
n 6041 ext/date/date_core.c VALUE n;
n 6043 ext/date/date_core.c rb_scan_args(argc, argv, "01", &n);
n 6045 ext/date/date_core.c n = INT2FIX(1);
n 6046 ext/date/date_core.c return d_lite_rshift(self, n);
n 6058 ext/date/date_core.c VALUE n;
n 6060 ext/date/date_core.c rb_scan_args(argc, argv, "01", &n);
n 6062 ext/date/date_core.c n = INT2FIX(1);
n 6063 ext/date/date_core.c return d_lite_lshift(self, n);
n 6075 ext/date/date_core.c VALUE n;
n 6077 ext/date/date_core.c rb_scan_args(argc, argv, "01", &n);
n 6079 ext/date/date_core.c n = INT2FIX(1);
n 6080 ext/date/date_core.c return d_lite_rshift(self, f_mul(n, INT2FIX(12)));
n 6092 ext/date/date_core.c VALUE n;
n 6094 ext/date/date_core.c rb_scan_args(argc, argv, "01", &n);
n 6096 ext/date/date_core.c n = INT2FIX(1);
n 6097 ext/date/date_core.c return d_lite_lshift(self, f_mul(n, INT2FIX(12)));
n 7553 ext/date/date_core.c int m, n, k, h, min, s, rof;
n 7561 ext/date/date_core.c n = 1;
n 7583 ext/date/date_core.c n = NUM2INT(vn);
n 7594 ext/date/date_core.c if (!valid_nth_kday_p(y, m, n, k, sg,
n 8326 ext/date/date_core.c if (n > 0) p += snprintf(p, fmt+sizeof(fmt)-p, ".%%%ldN", n);
n 8345 ext/date/date_core.c long n = 0;
n 8349 ext/date/date_core.c n = NUM2LONG(argv[0]);
n 8352 ext/date/date_core.c iso8601_timediv(self, n));
n 8384 ext/date/date_core.c long n = 0;
n 8388 ext/date/date_core.c n = NUM2LONG(argv[0]);
n 8391 ext/date/date_core.c iso8601_timediv(self, n));
n 8806 ext/date/date_core.c int y, m, n, k, rj, ns;
n 8808 ext/date/date_core.c c_jd_to_nth_kday(j, sg, &y, &m, &n, &k);
n 8809 ext/date/date_core.c c_nth_kday_to_jd(y, m, n, k, sg, &rj, &ns);
n 1980 ext/date/date_parse.c VALUE s, n;
n 1985 ext/date/date_parse.c n = str2num(s);
n 1986 ext/date/date_parse.c if (f_ge_p(n, INT2FIX(1)) &&
n 1987 ext/date/date_parse.c f_le_p(n, INT2FIX(31)))
n 1988 ext/date/date_parse.c set_hash("mday", n);
n 1991 ext/date/date_parse.c n = str2num(s);
n 1992 ext/date/date_parse.c if (f_ge_p(n, INT2FIX(0)) &&
n 1993 ext/date/date_parse.c f_le_p(n, INT2FIX(24)))
n 1994 ext/date/date_parse.c set_hash("hour", n);
n 65 ext/date/date_strftime.c #define BIT_OF(n) (1U<<(n))
n 94 ext/date/date_strftime.c #define NEEDS(n) do if (s >= endp || (n) >= endp - s - 1) goto err; while (0)
n 289 ext/date/date_strftime.c long n;
n 296 ext/date/date_strftime.c n = 1;
n 298 ext/date/date_strftime.c n *= 10;
n 299 ext/date/date_strftime.c if (n != 1)
n 300 ext/date/date_strftime.c subsec = mul(subsec, INT2FIX(n));
n 102 ext/date/date_strptime.c *n = LONG2NUM(v);
n 110 ext/date/date_strptime.c *n = rb_cstr_to_inum(s2, 10, 0);
n 131 ext/date/date_strptime.c l = read_digits(&str[si], &n, w); \
n 137 ext/date/date_strptime.c #define READ_DIGITS_MAX(n) READ_DIGITS(n, LONG_MAX)
n 237 ext/date/date_strptime.c VALUE n;
n 240 ext/date/date_strptime.c READ_DIGITS(n, 2)
n 242 ext/date/date_strptime.c READ_DIGITS_MAX(n)
n 243 ext/date/date_strptime.c set_hash("_cent", n);
n 258 ext/date/date_strptime.c VALUE n;
n 262 ext/date/date_strptime.c READ_DIGITS(n, 1);
n 264 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 266 ext/date/date_strptime.c if (!valid_range_p(n, 1, 31))
n 268 ext/date/date_strptime.c set_hash("mday", n);
n 278 ext/date/date_strptime.c VALUE n;
n 281 ext/date/date_strptime.c READ_DIGITS(n, 4)
n 283 ext/date/date_strptime.c READ_DIGITS_MAX(n)
n 284 ext/date/date_strptime.c set_hash("cwyear", n);
n 290 ext/date/date_strptime.c VALUE n;
n 292 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 293 ext/date/date_strptime.c if (!valid_range_p(n, 0, 99))
n 295 ext/date/date_strptime.c set_hash("cwyear",n);
n 298 ext/date/date_strptime.c INT2FIX(f_ge_p(n, INT2FIX(69)) ? 19 : 20));
n 305 ext/date/date_strptime.c VALUE n;
n 309 ext/date/date_strptime.c READ_DIGITS(n, 1);
n 311 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 313 ext/date/date_strptime.c if (!valid_range_p(n, 0, 24))
n 315 ext/date/date_strptime.c set_hash("hour", n);
n 322 ext/date/date_strptime.c VALUE n;
n 326 ext/date/date_strptime.c READ_DIGITS(n, 1);
n 328 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 330 ext/date/date_strptime.c if (!valid_range_p(n, 1, 12))
n 332 ext/date/date_strptime.c set_hash("hour", n);
n 338 ext/date/date_strptime.c VALUE n;
n 340 ext/date/date_strptime.c READ_DIGITS(n, 3);
n 341 ext/date/date_strptime.c if (!valid_range_p(n, 1, 366))
n 343 ext/date/date_strptime.c set_hash("yday", n);
n 350 ext/date/date_strptime.c VALUE n;
n 361 ext/date/date_strptime.c READ_DIGITS(n, c == 'L' ? 3 : 9)
n 363 ext/date/date_strptime.c READ_DIGITS_MAX(n)
n 365 ext/date/date_strptime.c n = f_negate(n);
n 367 ext/date/date_strptime.c rb_rational_new2(n,
n 375 ext/date/date_strptime.c VALUE n;
n 377 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 378 ext/date/date_strptime.c if (!valid_range_p(n, 0, 59))
n 380 ext/date/date_strptime.c set_hash("min", n);
n 386 ext/date/date_strptime.c VALUE n;
n 388 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 389 ext/date/date_strptime.c if (!valid_range_p(n, 1, 12))
n 391 ext/date/date_strptime.c set_hash("mon", n);
n 418 ext/date/date_strptime.c VALUE n;
n 425 ext/date/date_strptime.c READ_DIGITS_MAX(n);
n 427 ext/date/date_strptime.c n = f_negate(n);
n 429 ext/date/date_strptime.c rb_rational_new2(n,
n 445 ext/date/date_strptime.c VALUE n;
n 447 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 448 ext/date/date_strptime.c if (!valid_range_p(n, 0, 60))
n 450 ext/date/date_strptime.c set_hash("sec", n);
n 456 ext/date/date_strptime.c VALUE n;
n 463 ext/date/date_strptime.c READ_DIGITS_MAX(n);
n 465 ext/date/date_strptime.c n = f_negate(n);
n 466 ext/date/date_strptime.c set_hash("seconds", n);
n 477 ext/date/date_strptime.c VALUE n;
n 479 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 480 ext/date/date_strptime.c if (!valid_range_p(n, 0, 53))
n 482 ext/date/date_strptime.c set_hash(c == 'U' ? "wnum0" : "wnum1", n);
n 488 ext/date/date_strptime.c VALUE n;
n 490 ext/date/date_strptime.c READ_DIGITS(n, 1);
n 491 ext/date/date_strptime.c if (!valid_range_p(n, 1, 7))
n 493 ext/date/date_strptime.c set_hash("cwday", n);
n 499 ext/date/date_strptime.c VALUE n;
n 501 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 502 ext/date/date_strptime.c if (!valid_range_p(n, 1, 53))
n 504 ext/date/date_strptime.c set_hash("cweek", n);
n 514 ext/date/date_strptime.c VALUE n;
n 516 ext/date/date_strptime.c READ_DIGITS(n, 1);
n 517 ext/date/date_strptime.c if (!valid_range_p(n, 0, 6))
n 519 ext/date/date_strptime.c set_hash("wday", n);
n 533 ext/date/date_strptime.c VALUE n;
n 542 ext/date/date_strptime.c READ_DIGITS(n, 4)
n 544 ext/date/date_strptime.c READ_DIGITS_MAX(n)
n 546 ext/date/date_strptime.c n = f_negate(n);
n 547 ext/date/date_strptime.c set_hash("year", n);
n 553 ext/date/date_strptime.c VALUE n;
n 556 ext/date/date_strptime.c READ_DIGITS(n, 2);
n 557 ext/date/date_strptime.c if (!valid_range_p(n, 0, 99))
n 560 ext/date/date_strptime.c n = f_negate(n);
n 561 ext/date/date_strptime.c set_hash("year", n);
n 564 ext/date/date_strptime.c INT2FIX(f_ge_p(n, INT2FIX(69)) ? 19 : 20));
n 30 ext/dbm/dbm.c # define TOO_LONG(n) ((long)(+(DSIZE_TYPE)(n)) != (n))
n 511 ext/dbm/dbm.c long i, n;
n 515 ext/dbm/dbm.c n = dbmp->di_size;
n 538 ext/dbm/dbm.c if (n > 0) dbmp->di_size = n - RARRAY_LEN(ary);
n 238 ext/digest/md5/md5.c #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
n 64 ext/digest/rmd160/rmd160.c #define ROL(x, n) (((x) << (n)) | ((x) >> (32-(n))))
n 159 ext/digest/sha2/sha2.c (w)[0] += (sha2_word64)(n); \
n 160 ext/digest/sha2/sha2.c if ((w)[0] < (n)) { \
n 928 ext/etc/constdefs.h (FIXNUM_MAX < (n) ? ULL2NUM(n) : \
n 929 ext/etc/constdefs.h FIXNUM_MIN > (LONG_LONG)(n) ? LL2NUM(n) : \
n 930 ext/etc/constdefs.h LONG2FIX(n))
n 933 ext/etc/constdefs.h (FIXNUM_MAX < (n) ? ULONG2NUM(n) : \
n 934 ext/etc/constdefs.h FIXNUM_MIN > (long)(n) ? LONG2NUM(n) : \
n 935 ext/etc/constdefs.h LONG2FIX(n))
n 932 ext/etc/etc.c int n;
n 950 ext/etc/etc.c for (n=64; n <= 16384; n *= 2) {
n 951 ext/etc/etc.c size = CPU_ALLOC_SIZE(n);
n 77 ext/gdbm/gdbm.c #define TOO_LONG(n) ((long)(+(int)(n)) != (long)(n))
n 618 ext/gdbm/gdbm.c int status = 0, n;
n 622 ext/gdbm/gdbm.c n = dbmp->di_size;
n 639 ext/gdbm/gdbm.c if (n > 0) dbmp->di_size = n - (int)RARRAY_LEN(ary);
n 84 ext/io/wait/wait.c ioctl_arg n;
n 91 ext/io/wait/wait.c if (ioctl(fptr->fd, FIONREAD, &n)) return INT2FIX(0);
n 92 ext/io/wait/wait.c if (n > 0) return ioctl_arg2num(n);
n 4307 ext/nkf/nkf-utf8/nkf.c #define mime_input_buf(n) mime_input_state.buf[(n)&MIME_BUF_MASK]
n 36 ext/nkf/nkf-utf8/nkf.h #define NKF_INT32_C(n) (n##L)
n 39 ext/nkf/nkf-utf8/nkf.h #define NKF_INT32_C(n) (n)
n 37 ext/objspace/object_tracing.c st_data_t n;
n 40 ext/objspace/object_tracing.c if (st_lookup(tbl, (st_data_t)str, &n)) {
n 41 ext/objspace/object_tracing.c st_insert(tbl, (st_data_t)str, n+1);
n 58 ext/objspace/object_tracing.c st_data_t n;
n 60 ext/objspace/object_tracing.c st_lookup(tbl, (st_data_t)str, &n);
n 61 ext/objspace/object_tracing.c if (n == 1) {
n 66 ext/objspace/object_tracing.c st_insert(tbl, (st_data_t)str, n-1);
n 261 ext/objspace/objspace.c struct dynamic_symbol_counts *counts = (struct dynamic_symbol_counts *)n;
n 334 ext/objspace/objspace.c size_t *nodes = (size_t *)n;
n 394 ext/objspace/objspace.c #define COUNT_NODE(n) case n: node = ID2SYM(rb_intern(#n)); break;
n 200 ext/objspace/objspace_dump.c size_t n, i;
n 311 ext/objspace/objspace_dump.c if ((n = rb_obj_gc_flags(obj, flags, sizeof(flags))) > 0) {
n 313 ext/objspace/objspace_dump.c for (i=0; i<n; i++) {
n 315 ext/objspace/objspace_dump.c if (i != n-1) dump_append(dc, ", ");
n 204 ext/openssl/openssl_missing.h IMPL_KEY_ACCESSOR3(RSA, key, n, e, d, (n == obj->n || e == obj->e || (obj->d && d == obj->d)))
n 160 ext/openssl/ossl_bn.c long n = FIX2LONG(str);
n 161 ext/openssl/ossl_bn.c unsigned long un = labs(n);
n 172 ext/openssl/ossl_bn.c if (n < 0) BN_set_negative(bn, 1);
n 34 ext/openssl/ossl_pkey.c rb_ary_store(ary, 1, INT2NUM(n));
n 1035 ext/openssl/ossl_pkey_ec.c int n;
n 1047 ext/openssl/ossl_pkey_ec.c for (n = 0; n < crv_len; n++) {
n 1048 ext/openssl/ossl_pkey_ec.c const char *sname = OBJ_nid2sn(curves[n].nid);
n 1049 ext/openssl/ossl_pkey_ec.c const char *comment = curves[n].comment;
n 537 ext/openssl/ossl_pkey_rsa.c BIGNUM *n, *e, *d, *p, *q, *dmp1, *dmq1, *iqmp;
n 540 ext/openssl/ossl_pkey_rsa.c RSA_get0_key(rsa, &n, &e, &d);
n 545 ext/openssl/ossl_pkey_rsa.c rb_hash_aset(hash, rb_str_new2("n"), ossl_bn_new(n));
n 692 ext/openssl/ossl_pkey_rsa.c DEF_OSSL_PKEY_BN(cRSA, rsa, n);
n 113 ext/openssl/ossl_rand.c int n = NUM2INT(len);
n 116 ext/openssl/ossl_rand.c str = rb_str_new(0, n);
n 117 ext/openssl/ossl_rand.c ret = RAND_bytes((unsigned char *)RSTRING_PTR(str), n);
n 146 ext/openssl/ossl_rand.c int n = NUM2INT(len);
n 148 ext/openssl/ossl_rand.c str = rb_str_new(0, n);
n 149 ext/openssl/ossl_rand.c if (RAND_pseudo_bytes((unsigned char *)RSTRING_PTR(str), n) < 1) {
n 187 ext/openssl/ossl_rand.c int n = NUM2INT(len);
n 191 ext/openssl/ossl_rand.c if (RAND_egd_bytes(StringValueCStr(filename), n) == -1) {
n 294 ext/pathname/pathname.c int n;
n 297 ext/pathname/pathname.c n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
n 299 ext/pathname/pathname.c return rb_block_call(rb_cIO, rb_intern("foreach"), 1+n, args, 0, 0);
n 302 ext/pathname/pathname.c return rb_funcall2(rb_cIO, rb_intern("foreach"), 1+n, args);
n 320 ext/pathname/pathname.c int n;
n 323 ext/pathname/pathname.c n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
n 324 ext/pathname/pathname.c return rb_funcall2(rb_cIO, rb_intern("read"), 1+n, args);
n 340 ext/pathname/pathname.c int n;
n 343 ext/pathname/pathname.c n = rb_scan_args(argc, argv, "02", &args[1], &args[2]);
n 344 ext/pathname/pathname.c return rb_funcall2(rb_cIO, rb_intern("binread"), 1+n, args);
n 361 ext/pathname/pathname.c int n;
n 364 ext/pathname/pathname.c n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
n 365 ext/pathname/pathname.c return rb_funcall2(rb_cIO, rb_intern("write"), 1+n, args);
n 382 ext/pathname/pathname.c int n;
n 385 ext/pathname/pathname.c n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
n 386 ext/pathname/pathname.c return rb_funcall2(rb_cIO, rb_intern("binwrite"), 1+n, args);
n 404 ext/pathname/pathname.c int n;
n 407 ext/pathname/pathname.c n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
n 408 ext/pathname/pathname.c return rb_funcall2(rb_cIO, rb_intern("readlines"), 1+n, args);
n 422 ext/pathname/pathname.c int n;
n 425 ext/pathname/pathname.c n = rb_scan_args(argc, argv, "02", &args[1], &args[2]);
n 426 ext/pathname/pathname.c return rb_funcall2(rb_cIO, rb_intern("sysopen"), 1+n, args);
n 603 ext/pathname/pathname.c int n;
n 606 ext/pathname/pathname.c n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
n 608 ext/pathname/pathname.c return rb_block_call(rb_cFile, rb_intern("open"), 1+n, args, 0, 0);
n 611 ext/pathname/pathname.c return rb_funcall2(rb_cFile, rb_intern("open"), 1+n, args);
n 1007 ext/pathname/pathname.c int n;
n 1009 ext/pathname/pathname.c n = rb_scan_args(argc, argv, "11", &args[0], &args[1]);
n 1011 ext/pathname/pathname.c return rb_block_call(rb_cDir, rb_intern("glob"), n, args, glob_i, klass);
n 1016 ext/pathname/pathname.c ary = rb_funcall2(rb_cDir, rb_intern("glob"), n, args);
n 90 ext/racc/cparse/cparse.c return NUM2LONG(n);
n 334 ext/racc/cparse/cparse.c return NUM2LONG(n);
n 157 ext/readline/readline.c int n;
n 164 ext/readline/readline.c if (PeekConsoleInput((HANDLE)_get_osfhandle(p->fd), &ir, 1, &n)) {
n 165 ext/readline/readline.c if (n == 1) {
n 170 ext/readline/readline.c ReadConsoleInput((HANDLE)_get_osfhandle(p->fd), &ir, 1, &n);
n 168 ext/ripper/ripper.c # define BITSTACK_PUSH(stack, n) (((stack) = ((stack)<<1)|((n)&1)), SHOW_BITSTACK(stack, #stack"(push)"))
n 172 ext/ripper/ripper.c # define BITSTACK_SET(stack, n) ((stack)=(n), SHOW_BITSTACK(stack, #stack"(set)"))
n 174 ext/ripper/ripper.c #define COND_PUSH(n) BITSTACK_PUSH(cond_stack, (n))
n 178 ext/ripper/ripper.c #define COND_SET(n) BITSTACK_SET(cond_stack, (n))
n 180 ext/ripper/ripper.c #define CMDARG_PUSH(n) BITSTACK_PUSH(cmdarg_stack, (n))
n 184 ext/ripper/ripper.c #define CMDARG_SET(n) BITSTACK_SET(cmdarg_stack, (n))
n 265 ext/ripper/ripper.c if (tbl->pos < n) rb_bug("vtable_pop: unreachable");
n 266 ext/ripper/ripper.c tbl->pos -= n;
n 389 ext/ripper/ripper.c #define intern_cstr(n,l,en) rb_intern3(n,l,en)
n 391 ext/ripper/ripper.c #define intern_cstr(n,l,en) rb_intern3(n,l,en)
n 394 ext/ripper/ripper.c #define STR_NEW(p,n) rb_enc_str_new((p),(n),current_enc)
n 397 ext/ripper/ripper.c #define STR_NEW3(p,n,e,func) parser_str_new((p),(n),(e),(func),current_enc)
n 482 ext/ripper/ripper.c #define reduce_nodes(n) reduce_nodes_gen(parser,(n))
n 499 ext/ripper/ripper.c #define new_evstr(n) new_evstr_gen(parser,(n))
n 501 ext/ripper/ripper.c #define evstr2dstr(n) evstr2dstr_gen(parser,(n))
n 535 ext/ripper/ripper.c #define rb_backref_error(n) rb_backref_error_gen(parser,(n))
n 586 ext/ripper/ripper.c return RB_TYPE_P(n, T_NODE) && nd_type(RNODE(n)) == NODE_RIPPER;
n 660 ext/ripper/ripper.c #define SIGN_EXTEND(x,n) (((1<<(n)-1)^((x)&~(~0<<(n))))-(1<<(n)-1))
n 690 ext/ripper/ripper.c #define dispatch0(n) ripper_dispatch0(parser, TOKEN_PASTE(ripper_id_, n))
n 691 ext/ripper/ripper.c #define dispatch1(n,a) ripper_dispatch1(parser, TOKEN_PASTE(ripper_id_, n), (a))
n 692 ext/ripper/ripper.c #define dispatch2(n,a,b) ripper_dispatch2(parser, TOKEN_PASTE(ripper_id_, n), (a), (b))
n 693 ext/ripper/ripper.c #define dispatch3(n,a,b,c) ripper_dispatch3(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c))
n 694 ext/ripper/ripper.c #define dispatch4(n,a,b,c,d) ripper_dispatch4(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d))
n 695 ext/ripper/ripper.c #define dispatch5(n,a,b,c,d,e) ripper_dispatch5(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e))
n 696 ext/ripper/ripper.c #define dispatch7(n,a,b,c,d,e,f,g) ripper_dispatch7(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e), (f), (g))
n 795 ext/ripper/ripper.c # define WARN_ARGS(fmt,n) parser->value, id_warn, n, rb_usascii_str_new_lit(fmt)
n 796 ext/ripper/ripper.c # define WARN_ARGS_L(l,fmt,n) WARN_ARGS(fmt,n)
n 798 ext/ripper/ripper.c # define WARNING_ARGS(fmt,n) parser->value, id_warning, n, rb_usascii_str_new_lit(fmt)
n 799 ext/ripper/ripper.c # define WARNING_ARGS_L(l, fmt,n) WARNING_ARGS(fmt,n)
n 808 ext/ripper/ripper.c # define WARN_ARGS(fmt,n) WARN_ARGS_L(ruby_sourceline,fmt,n)
n 811 ext/ripper/ripper.c # define WARNING_ARGS(fmt,n) WARN_ARGS(fmt,n)
n 812 ext/ripper/ripper.c # define WARNING_ARGS_L(l,fmt,n) WARN_ARGS_L(l,fmt,n)
n 10981 ext/ripper/ripper.c # define tokspace(n) parser_tokspace(parser, (n))
n 10987 ext/ripper/ripper.c # define tokadd_string(f,t,p,n,e) parser_tokadd_string(parser,(f),(t),(p),(n),(e))
n 10988 ext/ripper/ripper.c # define parse_string(n) parser_parse_string(parser,(n))
n 10990 ext/ripper/ripper.c # define here_document(n) parser_here_document(parser,(n))
n 10992 ext/ripper/ripper.c # define heredoc_restore(n) parser_heredoc_restore(parser,(n))
n 11245 ext/ripper/ripper.c VALUE lines = rb_ary_tmp_new_fill(n);
n 11261 ext/ripper/ripper.c int n;
n 11270 ext/ripper/ripper.c n = ruby_sourceline;
n 11273 ext/ripper/ripper.c } while (--n);
n 11290 ext/ripper/ripper.c n = yyparse((void*)parser);
n 11499 ext/ripper/ripper.c str = rb_enc_str_new(p, n, enc);
n 11514 ext/ripper/ripper.c #define peek_n(c,n) (lex_p+(n) < lex_pend && (c) == (unsigned char)lex_p[n])
n 11516 ext/ripper/ripper.c #define peekc_n(n) (lex_p+(n) < lex_pend ? (unsigned char)lex_p[n] : -1)
n 11630 ext/ripper/ripper.c tokidx += n;
n 11636 ext/ripper/ripper.c return &tokenbuf[tokidx-n];
n 11663 ext/ripper/ripper.c #define tokcopy(n) memcpy(tokspace(n), lex_p - (n), (n))
n 12392 ext/ripper/ripper.c int n = TAB_WIDTH * (col / TAB_WIDTH + 1);
n 12393 ext/ripper/ripper.c if (n > width) break;
n 12394 ext/ripper/ripper.c col = n;
n 12463 ext/ripper/ripper.c long n;
n 12468 ext/ripper/ripper.c n = lex_pend - (p + len);
n 12469 ext/ripper/ripper.c if (n < 0) return FALSE;
n 12470 ext/ripper/ripper.c if (n > 0 && p[len] != '\n') {
n 12472 ext/ripper/ripper.c if (n <= 1 || p[len+1] != '\n') return FALSE;
n 12790 ext/ripper/ripper.c long i, n = RARRAY_LEN(lines);
n 12791 ext/ripper/ripper.c for (i = 0; i < n; ++i) {
n 12950 ext/ripper/ripper.c long n = 0;
n 13003 ext/ripper/ripper.c n = end - beg;
n 13004 ext/ripper/ripper.c str_copy(name, beg, n);
n 13006 ext/ripper/ripper.c for (i = 0; i < n; ++i) {
n 13010 ext/ripper/ripper.c if (STRNCASECMP(p->name, s, n) == 0 && !p->name[n]) {
n 13011 ext/ripper/ripper.c n = vend - vbeg;
n 13013 ext/ripper/ripper.c n = (*p->length)(parser, vbeg, n);
n 13015 ext/ripper/ripper.c str_copy(val, vbeg, n);
n 13106 ext/ripper/ripper.c #define IS_LABEL_SUFFIX(n) (peek_n(':',(n)) && !peek_n(':', (n)+1))
n 13576 ext/ripper/ripper.c unsigned long n = ruby_scan_digits(tok()+1, toklen()-1, 10, &len, &overflow);
n 13582 ext/ripper/ripper.c if (overflow || n > nth_ref_max) {
n 13588 ext/ripper/ripper.c return (int)n;
n 14532 ext/ripper/ripper.c NODE *n = (rb_node_newnode)(type, a0, a1, a2);
n 14533 ext/ripper/ripper.c nd_set_line(n, ruby_sourceline);
n 14534 ext/ripper/ripper.c return n;
n 15432 ext/ripper/ripper.c NODE **n = &node, *n1 = node;
n 15434 ext/ripper/ripper.c *n = n1 = n1->nd_body;
n 15442 ext/ripper/ripper.c NODE **n = &node, *n1 = node;
n 15444 ext/ripper/ripper.c *n = n1 = n1->nd_body;
n 16746 ext/ripper/ripper.c #define HEAPCNT(n, size) ((n) * (size) / sizeof(YYSTYPE))
n 16748 ext/ripper/ripper.c #define ADD2HEAP(n, c, p) ((parser->heap = (n))->u1.node = (p), \
n 16749 ext/ripper/ripper.c (n)->u3.cnt = (c), (p))
n 16755 ext/ripper/ripper.c NODE *n = NEWHEAP();
n 16758 ext/ripper/ripper.c return ADD2HEAP(n, cnt, ptr);
n 16765 ext/ripper/ripper.c NODE *n = NEWHEAP();
n 16768 ext/ripper/ripper.c return ADD2HEAP(n, cnt, ptr);
n 16774 ext/ripper/ripper.c NODE *n;
n 16777 ext/ripper/ripper.c if (ptr && (n = parser->heap) != NULL) {
n 16779 ext/ripper/ripper.c if (n->u1.node == ptr) {
n 16780 ext/ripper/ripper.c n->u1.node = ptr = xrealloc(ptr, size);
n 16781 ext/ripper/ripper.c if (n->u3.cnt) n->u3.cnt = cnt;
n 16784 ext/ripper/ripper.c } while ((n = n->u2.node) != NULL);
n 16786 ext/ripper/ripper.c n = NEWHEAP();
n 16788 ext/ripper/ripper.c return ADD2HEAP(n, cnt, ptr);
n 16794 ext/ripper/ripper.c NODE **prev = &parser->heap, *n;
n 16796 ext/ripper/ripper.c while ((n = *prev) != NULL) {
n 16797 ext/ripper/ripper.c if (n->u1.node == ptr) {
n 16798 ext/ripper/ripper.c *prev = n->u2.node;
n 16799 ext/ripper/ripper.c rb_gc_force_recycle((VALUE)n);
n 16802 ext/ripper/ripper.c prev = &n->u2.node;
n 114 ext/ripper/ripper.y # define BITSTACK_PUSH(stack, n) (((stack) = ((stack)<<1)|((n)&1)), SHOW_BITSTACK(stack, #stack"(push)"))
n 118 ext/ripper/ripper.y # define BITSTACK_SET(stack, n) ((stack)=(n), SHOW_BITSTACK(stack, #stack"(set)"))
n 120 ext/ripper/ripper.y #define COND_PUSH(n) BITSTACK_PUSH(cond_stack, (n))
n 124 ext/ripper/ripper.y #define COND_SET(n) BITSTACK_SET(cond_stack, (n))
n 126 ext/ripper/ripper.y #define CMDARG_PUSH(n) BITSTACK_PUSH(cmdarg_stack, (n))
n 130 ext/ripper/ripper.y #define CMDARG_SET(n) BITSTACK_SET(cmdarg_stack, (n))
n 211 ext/ripper/ripper.y if (tbl->pos < n) rb_bug("vtable_pop: unreachable");
n 212 ext/ripper/ripper.y tbl->pos -= n;
n 335 ext/ripper/ripper.y #define intern_cstr(n,l,en) rb_intern3(n,l,en)
n 337 ext/ripper/ripper.y #define intern_cstr(n,l,en) rb_intern3(n,l,en)
n 340 ext/ripper/ripper.y #define STR_NEW(p,n) rb_enc_str_new((p),(n),current_enc)
n 343 ext/ripper/ripper.y #define STR_NEW3(p,n,e,func) parser_str_new((p),(n),(e),(func),current_enc)
n 428 ext/ripper/ripper.y #define reduce_nodes(n) reduce_nodes_gen(parser,(n))
n 445 ext/ripper/ripper.y #define new_evstr(n) new_evstr_gen(parser,(n))
n 447 ext/ripper/ripper.y #define evstr2dstr(n) evstr2dstr_gen(parser,(n))
n 481 ext/ripper/ripper.y #define rb_backref_error(n) rb_backref_error_gen(parser,(n))
n 532 ext/ripper/ripper.y return RB_TYPE_P(n, T_NODE) && nd_type(RNODE(n)) == NODE_RIPPER;
n 606 ext/ripper/ripper.y #define SIGN_EXTEND(x,n) (((1<<(n)-1)^((x)&~(~0<<(n))))-(1<<(n)-1))
n 636 ext/ripper/ripper.y #define dispatch0(n) ripper_dispatch0(parser, TOKEN_PASTE(ripper_id_, n))
n 637 ext/ripper/ripper.y #define dispatch1(n,a) ripper_dispatch1(parser, TOKEN_PASTE(ripper_id_, n), (a))
n 638 ext/ripper/ripper.y #define dispatch2(n,a,b) ripper_dispatch2(parser, TOKEN_PASTE(ripper_id_, n), (a), (b))
n 639 ext/ripper/ripper.y #define dispatch3(n,a,b,c) ripper_dispatch3(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c))
n 640 ext/ripper/ripper.y #define dispatch4(n,a,b,c,d) ripper_dispatch4(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d))
n 641 ext/ripper/ripper.y #define dispatch5(n,a,b,c,d,e) ripper_dispatch5(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e))
n 642 ext/ripper/ripper.y #define dispatch7(n,a,b,c,d,e,f,g) ripper_dispatch7(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e), (f), (g))
n 741 ext/ripper/ripper.y # define WARN_ARGS(fmt,n) parser->value, id_warn, n, rb_usascii_str_new_lit(fmt)
n 742 ext/ripper/ripper.y # define WARN_ARGS_L(l,fmt,n) WARN_ARGS(fmt,n)
n 744 ext/ripper/ripper.y # define WARNING_ARGS(fmt,n) parser->value, id_warning, n, rb_usascii_str_new_lit(fmt)
n 745 ext/ripper/ripper.y # define WARNING_ARGS_L(l, fmt,n) WARNING_ARGS(fmt,n)
n 754 ext/ripper/ripper.y # define WARN_ARGS(fmt,n) WARN_ARGS_L(ruby_sourceline,fmt,n)
n 757 ext/ripper/ripper.y # define WARNING_ARGS(fmt,n) WARN_ARGS(fmt,n)
n 758 ext/ripper/ripper.y # define WARNING_ARGS_L(l,fmt,n) WARN_ARGS_L(l,fmt,n)
n 5232 ext/ripper/ripper.y # define tokspace(n) parser_tokspace(parser, (n))
n 5238 ext/ripper/ripper.y # define tokadd_string(f,t,p,n,e) parser_tokadd_string(parser,(f),(t),(p),(n),(e))
n 5239 ext/ripper/ripper.y # define parse_string(n) parser_parse_string(parser,(n))
n 5241 ext/ripper/ripper.y # define here_document(n) parser_here_document(parser,(n))
n 5243 ext/ripper/ripper.y # define heredoc_restore(n) parser_heredoc_restore(parser,(n))
n 5496 ext/ripper/ripper.y VALUE lines = rb_ary_tmp_new_fill(n);
n 5512 ext/ripper/ripper.y int n;
n 5521 ext/ripper/ripper.y n = ruby_sourceline;
n 5524 ext/ripper/ripper.y } while (--n);
n 5541 ext/ripper/ripper.y n = yyparse((void*)parser);
n 5750 ext/ripper/ripper.y str = rb_enc_str_new(p, n, enc);
n 5765 ext/ripper/ripper.y #define peek_n(c,n) (lex_p+(n) < lex_pend && (c) == (unsigned char)lex_p[n])
n 5767 ext/ripper/ripper.y #define peekc_n(n) (lex_p+(n) < lex_pend ? (unsigned char)lex_p[n] : -1)
n 5881 ext/ripper/ripper.y tokidx += n;
n 5887 ext/ripper/ripper.y return &tokenbuf[tokidx-n];
n 5914 ext/ripper/ripper.y #define tokcopy(n) memcpy(tokspace(n), lex_p - (n), (n))
n 6643 ext/ripper/ripper.y int n = TAB_WIDTH * (col / TAB_WIDTH + 1);
n 6644 ext/ripper/ripper.y if (n > width) break;
n 6645 ext/ripper/ripper.y col = n;
n 6714 ext/ripper/ripper.y long n;
n 6719 ext/ripper/ripper.y n = lex_pend - (p + len);
n 6720 ext/ripper/ripper.y if (n < 0) return FALSE;
n 6721 ext/ripper/ripper.y if (n > 0 && p[len] != '\n') {
n 6723 ext/ripper/ripper.y if (n <= 1 || p[len+1] != '\n') return FALSE;
n 7041 ext/ripper/ripper.y long i, n = RARRAY_LEN(lines);
n 7042 ext/ripper/ripper.y for (i = 0; i < n; ++i) {
n 7201 ext/ripper/ripper.y long n = 0;
n 7254 ext/ripper/ripper.y n = end - beg;
n 7255 ext/ripper/ripper.y str_copy(name, beg, n);
n 7257 ext/ripper/ripper.y for (i = 0; i < n; ++i) {
n 7261 ext/ripper/ripper.y if (STRNCASECMP(p->name, s, n) == 0 && !p->name[n]) {
n 7262 ext/ripper/ripper.y n = vend - vbeg;
n 7264 ext/ripper/ripper.y n = (*p->length)(parser, vbeg, n);
n 7266 ext/ripper/ripper.y str_copy(val, vbeg, n);
n 7357 ext/ripper/ripper.y #define IS_LABEL_SUFFIX(n) (peek_n(':',(n)) && !peek_n(':', (n)+1))
n 7827 ext/ripper/ripper.y unsigned long n = ruby_scan_digits(tok()+1, toklen()-1, 10, &len, &overflow);
n 7833 ext/ripper/ripper.y if (overflow || n > nth_ref_max) {
n 7839 ext/ripper/ripper.y return (int)n;
n 8783 ext/ripper/ripper.y NODE *n = (rb_node_newnode)(type, a0, a1, a2);
n 8784 ext/ripper/ripper.y nd_set_line(n, ruby_sourceline);
n 8785 ext/ripper/ripper.y return n;
n 9683 ext/ripper/ripper.y NODE **n = &node, *n1 = node;
n 9685 ext/ripper/ripper.y *n = n1 = n1->nd_body;
n 9693 ext/ripper/ripper.y NODE **n = &node, *n1 = node;
n 9695 ext/ripper/ripper.y *n = n1 = n1->nd_body;
n 10997 ext/ripper/ripper.y #define HEAPCNT(n, size) ((n) * (size) / sizeof(YYSTYPE))
n 10999 ext/ripper/ripper.y #define ADD2HEAP(n, c, p) ((parser->heap = (n))->u1.node = (p), \
n 11000 ext/ripper/ripper.y (n)->u3.cnt = (c), (p))
n 11006 ext/ripper/ripper.y NODE *n = NEWHEAP();
n 11009 ext/ripper/ripper.y return ADD2HEAP(n, cnt, ptr);
n 11016 ext/ripper/ripper.y NODE *n = NEWHEAP();
n 11019 ext/ripper/ripper.y return ADD2HEAP(n, cnt, ptr);
n 11025 ext/ripper/ripper.y NODE *n;
n 11028 ext/ripper/ripper.y if (ptr && (n = parser->heap) != NULL) {
n 11030 ext/ripper/ripper.y if (n->u1.node == ptr) {
n 11031 ext/ripper/ripper.y n->u1.node = ptr = xrealloc(ptr, size);
n 11032 ext/ripper/ripper.y if (n->u3.cnt) n->u3.cnt = cnt;
n 11035 ext/ripper/ripper.y } while ((n = n->u2.node) != NULL);
n 11037 ext/ripper/ripper.y n = NEWHEAP();
n 11039 ext/ripper/ripper.y return ADD2HEAP(n, cnt, ptr);
n 11045 ext/ripper/ripper.y NODE **prev = &parser->heap, *n;
n 11047 ext/ripper/ripper.y while ((n = *prev) != NULL) {
n 11048 ext/ripper/ripper.y if (n->u1.node == ptr) {
n 11049 ext/ripper/ripper.y *prev = n->u2.node;
n 11050 ext/ripper/ripper.y rb_gc_force_recycle((VALUE)n);
n 11053 ext/ripper/ripper.y prev = &n->u2.node;
n 28 ext/sdbm/_sdbm.c #define memset(s,c,n) bzero((s), (n)) /* only when c is zero */
n 29 ext/sdbm/_sdbm.c #define memcpy(s1,s2,n) bcopy((s2), (s1), (n))
n 30 ext/sdbm/_sdbm.c #define memcmp(s1,s2,n) bcmp((s1),(s2),(n))
n 153 ext/sdbm/_sdbm.c register size_t n;
n 160 ext/sdbm/_sdbm.c n = strlen(file) * 2 + strlen(DIRFEXT) + strlen(PAGFEXT) + 2;
n 162 ext/sdbm/_sdbm.c if ((dirname = malloc(n)) == NULL)
n 668 ext/sdbm/_sdbm.c register int n;
n 673 ext/sdbm/_sdbm.c off = ((n = GET_SHORT(ino,0)) > 0) ? GET_SHORT(ino,n) : PBLKSIZ;
n 674 ext/sdbm/_sdbm.c free = off - (n + 1) * (int)sizeof(short);
n 685 ext/sdbm/_sdbm.c register int n;
n 689 ext/sdbm/_sdbm.c off = ((n = GET_SHORT(ino,0)) > 0) ? GET_SHORT(ino,n) : PBLKSIZ;
n 696 ext/sdbm/_sdbm.c PUT_SHORT(ino,n + 1,off);
n 703 ext/sdbm/_sdbm.c PUT_SHORT(ino,n + 2,off);
n 714 ext/sdbm/_sdbm.c register int n;
n 718 ext/sdbm/_sdbm.c if ((n = GET_SHORT(ino,0)) == 0)
n 721 ext/sdbm/_sdbm.c if ((i = seepair(pag, n, key.dptr, key.dsize)) == 0)
n 761 ext/sdbm/_sdbm.c register int n;
n 765 ext/sdbm/_sdbm.c if ((n = GET_SHORT(ino,0)) == 0)
n 768 ext/sdbm/_sdbm.c if ((i = seepair(pag, n, key.dptr, key.dsize)) == 0)
n 777 ext/sdbm/_sdbm.c if (i < n - 1) {
n 787 ext/sdbm/_sdbm.c m = GET_SHORT(ino,i + 1) - GET_SHORT(ino,n);
n 814 ext/sdbm/_sdbm.c while (i < n - 1) {
n 835 ext/sdbm/_sdbm.c for (i = 1; i < n; i += 2) {
n 850 ext/sdbm/_sdbm.c register int n;
n 859 ext/sdbm/_sdbm.c n = GET_SHORT(ino,0);
n 860 ext/sdbm/_sdbm.c for (ino++; n > 0; ino += 2) {
n 871 ext/sdbm/_sdbm.c n -= 2;
n 888 ext/sdbm/_sdbm.c register int n;
n 892 ext/sdbm/_sdbm.c if ((n = GET_SHORT(ino,0)) < 0 || n > PBLKSIZ / (int)sizeof(short))
n 895 ext/sdbm/_sdbm.c if (n > 0) {
n 897 ext/sdbm/_sdbm.c for (ino++; n > 0; ino += 2) {
n 902 ext/sdbm/_sdbm.c n -= 2;
n 928 ext/sdbm/_sdbm.c register unsigned long n = 0;
n 932 ext/sdbm/_sdbm.c #define HASHC n = *str++ + 65599 * n
n 949 ext/sdbm/_sdbm.c n = ((*str++) & 255) + 65587L * n;
n 951 ext/sdbm/_sdbm.c return n;
n 515 ext/sdbm/init.c int status = 0, n;
n 519 ext/sdbm/init.c n = dbmp->di_size;
n 541 ext/sdbm/init.c if (n > 0) dbmp->di_size = n - RARRAY_LENINT(ary);
n 533 ext/socket/basicsocket.c int n;
n 553 ext/socket/basicsocket.c (n = (int)BLOCKING_REGION_FD(func, &arg)) < 0) {
n 559 ext/socket/basicsocket.c return INT2FIX(n);
n 19 ext/socket/constdefs.c (FIXNUM_MAX < (n) ? ULL2NUM(n) : \
n 20 ext/socket/constdefs.c FIXNUM_MIN > (LONG_LONG)(n) ? LL2NUM(n) : \
n 21 ext/socket/constdefs.c LONG2FIX(n))
n 24 ext/socket/constdefs.c (FIXNUM_MAX < (n) ? ULONG2NUM(n) : \
n 25 ext/socket/constdefs.c FIXNUM_MIN > (long)(n) ? LONG2NUM(n) : \
n 26 ext/socket/constdefs.c LONG2FIX(n))
n 664 ext/socket/option.c # define inet_ntop(f,a,n,l) rb_w32_inet_ntop(f,a,n,l)
n 427 ext/socket/socket.c int fd, n;
n 433 ext/socket/socket.c n = rsock_connect(fd, (struct sockaddr*)RSTRING_PTR(addr), RSTRING_SOCKLEN(addr), 0);
n 434 ext/socket/socket.c if (n < 0) {
n 438 ext/socket/socket.c return INT2FIX(n);
n 447 ext/socket/socket.c int n;
n 453 ext/socket/socket.c n = connect(fptr->fd, (struct sockaddr*)RSTRING_PTR(addr), RSTRING_SOCKLEN(addr));
n 454 ext/socket/socket.c if (n < 0) {
n 470 ext/socket/socket.c return INT2FIX(n);
n 151 ext/socket/udpsocket.c int n;
n 161 ext/socket/udpsocket.c n = (int)BLOCKING_REGION_FD(rsock_sendto_blocking, &arg->sarg);
n 162 ext/socket/udpsocket.c if (n >= 0) {
n 163 ext/socket/udpsocket.c return INT2FIX(n);
n 921 ext/stringio/stringio.c int n;
n 933 ext/stringio/stringio.c RSTRING_END(ptr->string), &n, enc);
n 935 ext/stringio/stringio.c ptr->pos += n;
n 989 ext/stringio/stringio.c long n, limit = 0;
n 1018 ext/stringio/stringio.c if (ptr->pos >= (n = RSTRING_LEN(ptr->string))) {
n 1030 ext/stringio/stringio.c else if ((n = RSTRING_LEN(str)) == 0) {
n 1046 ext/stringio/stringio.c else if (n == 1) {
n 1053 ext/stringio/stringio.c if (n < e - s) {
n 1055 ext/stringio/stringio.c for (p = s; p + n <= e; ++p) {
n 1056 ext/stringio/stringio.c if (MEMCMP(p, RSTRING_PTR(str), char, n) == 0) {
n 1057 ext/stringio/stringio.c e = p + n;
n 1065 ext/stringio/stringio.c bm_init_skip(skip, p, n);
n 1066 ext/stringio/stringio.c if ((pos = bm_search(p, n, s, e - s, skip)) >= 0) {
n 1067 ext/stringio/stringio.c e = s + pos + n;
n 117 ext/tk/stubs.c int n;
n 131 ext/tk/stubs.c for (n = '9'; n > '0'; n--) {
n 132 ext/tk/stubs.c tcl_name[TCL_INDEX] = n;
n 162 ext/tk/stubs.c int n;
n 179 ext/tk/stubs.c for (n = '9'; n > '0'; n--) {
n 180 ext/tk/stubs.c tk_name[TK_INDEX] = n;
n 57 ext/tk/tcltklib.c #define RbTk_ALLOC_N(type, n) (type *)ckalloc((int)(sizeof(type) * (n)))
n 905 ext/win32ole/win32ole.c UINT n = len;
n 907 ext/win32ole/win32ole.c &dw, cp, pm, &n, NULL, &size);
n 912 ext/win32ole/win32ole.c n = len;
n 914 ext/win32ole/win32ole.c &dw, cp, pm, &n, pw, &size);
n 1107 ext/win32ole/win32ole.c long i = n;
n 2100 ext/win32ole/win32ole.c ULONG n = 0;
n 2103 ext/win32ole/win32ole.c n = OLE_RELEASE(pole->pDispatch);
n 2105 ext/win32ole/win32ole.c return n;
n 2136 ext/win32ole/win32ole.c ULONG n = 0;
n 2141 ext/win32ole/win32ole.c n = OLE_RELEASE(pole->pDispatch);
n 2144 ext/win32ole/win32ole.c return INT2NUM(n);
n 2564 ext/win32ole/win32ole.c int n;
n 2655 ext/win32ole/win32ole.c n = op.dp.cArgs - i + cNamedArgs - 1;
n 2656 ext/win32ole/win32ole.c VariantInit(&realargs[n]);
n 2657 ext/win32ole/win32ole.c VariantInit(&op.dp.rgvarg[n]);
n 2660 ext/win32ole/win32ole.c ole_variant2variant(param, &op.dp.rgvarg[n]);
n 2662 ext/win32ole/win32ole.c ole_val2variant(param, &realargs[n]);
n 2663 ext/win32ole/win32ole.c op.dp.rgvarg[n] = realargs[n];
n 2664 ext/win32ole/win32ole.c V_VT(&op.dp.rgvarg[n]) = VT_RECORD | VT_BYREF;
n 2666 ext/win32ole/win32ole.c ole_val2variant(param, &realargs[n]);
n 2667 ext/win32ole/win32ole.c V_VT(&op.dp.rgvarg[n]) = VT_VARIANT | VT_BYREF;
n 2668 ext/win32ole/win32ole.c V_VARIANTREF(&op.dp.rgvarg[n]) = &realargs[n];
n 2689 ext/win32ole/win32ole.c n = op.dp.cArgs - i + cNamedArgs - 1;
n 2691 ext/win32ole/win32ole.c ole_val2variant(param, &op.dp.rgvarg[n]);
n 2719 ext/win32ole/win32ole.c n = op.dp.cArgs - i + cNamedArgs - 1;
n 2720 ext/win32ole/win32ole.c if (V_VT(&op.dp.rgvarg[n]) != VT_RECORD) {
n 2721 ext/win32ole/win32ole.c VariantClear(&op.dp.rgvarg[n]);
n 2730 ext/win32ole/win32ole.c n = op.dp.cArgs - i + cNamedArgs - 1;
n 2732 ext/win32ole/win32ole.c ole_val2variant2(param, &op.dp.rgvarg[n]);
n 2744 ext/win32ole/win32ole.c n = op.dp.cArgs - i + cNamedArgs - 1;
n 2745 ext/win32ole/win32ole.c if (V_VT(&op.dp.rgvarg[n]) != VT_RECORD) {
n 2746 ext/win32ole/win32ole.c VariantClear(&op.dp.rgvarg[n]);
n 2756 ext/win32ole/win32ole.c n = op.dp.cArgs - i + cNamedArgs - 1;
n 2759 ext/win32ole/win32ole.c ole_val2variant(param, &realargs[n]);
n 2761 ext/win32ole/win32ole.c V_VT(&realargs[n]) == VT_RECORD ) {
n 2762 ext/win32ole/win32ole.c olerecord_set_ivar(param, V_RECORDINFO(&realargs[n]), V_RECORD(&realargs[n]));
n 3294 ext/win32ole/win32ole.c long n;
n 3303 ext/win32ole/win32ole.c n = RSTRING_LEN(mid);
n 3304 ext/win32ole/win32ole.c if(mname[n-1] == '=') {
n 3306 ext/win32ole/win32ole.c argv[0] = rb_enc_associate(rb_str_subseq(mid, 0, n-1), cWIN32OLE_enc);
n 129 ext/win32ole/win32ole_param.c return oleparam_ole_param_from_index(self, pmethod->pTypeInfo, pmethod->index, n);
n 152 ext/win32ole/win32ole_param.c idx = FIX2INT(n);
n 459 ext/win32ole/win32ole_record.c size_t n = strlen(StringValueCStr(name));
n 460 ext/win32ole/win32ole_record.c if (n >= LONG_MAX) {
n 363 ext/win32ole/win32ole_variable.c VALUE n = folevariable_name(self);
n 364 ext/win32ole/win32ole_variable.c VALUE detail = rb_sprintf("%"PRIsVALUE"=%"PRIsVALUE, n, v);
n 18 ext/zlib/zlib.c # define VALGRIND_MAKE_MEM_DEFINED(p, n) VALGRIND_MAKE_READABLE((p), (n))
n 21 ext/zlib/zlib.c # define VALGRIND_MAKE_MEM_UNDEFINED(p, n) VALGRIND_MAKE_WRITABLE((p), (n))
n 47 ext/zlib/zlib.c if (n > UINT_MAX) n = UINT_MAX;
n 48 ext/zlib/zlib.c return (uInt)n;
n 50 ext/zlib/zlib.c #define MAX_UINT(n) max_uint(n)
n 52 ext/zlib/zlib.c #define MAX_UINT(n) (uInt)(n)
n 966 ext/zlib/zlib.c uInt n;
n 970 ext/zlib/zlib.c n = z->stream.avail_out;
n 972 ext/zlib/zlib.c z->buf_filled += n - z->stream.avail_out;
n 1765 ext/zlib/zlib.c uInt n;
n 1770 ext/zlib/zlib.c n = z->stream.avail_out;
n 1772 ext/zlib/zlib.c z->buf_filled += n - z->stream.avail_out;
n 1776 ext/zlib/zlib.c n = z->stream.avail_out;
n 1778 ext/zlib/zlib.c z->buf_filled += n - z->stream.avail_out;
n 2438 ext/zlib/zlib.c unsigned int n;
n 2439 ext/zlib/zlib.c n = *(src++) & 0xff;
n 2440 ext/zlib/zlib.c n |= (*(src++) & 0xff) << 8;
n 2441 ext/zlib/zlib.c return n;
n 2447 ext/zlib/zlib.c unsigned long n;
n 2448 ext/zlib/zlib.c n = *(src++) & 0xff;
n 2449 ext/zlib/zlib.c n |= (*(src++) & 0xff) << 8;
n 2450 ext/zlib/zlib.c n |= (*(src++) & 0xff) << 16;
n 2451 ext/zlib/zlib.c n |= (*(src++) & 0xffU) << 24;
n 2452 ext/zlib/zlib.c return n;
n 2458 ext/zlib/zlib.c *(dst++) = n & 0xff;
n 2459 ext/zlib/zlib.c *(dst++) = (n >> 8) & 0xff;
n 2460 ext/zlib/zlib.c *(dst++) = (n >> 16) & 0xff;
n 2461 ext/zlib/zlib.c *dst = (n >> 24) & 0xff;
n 2932 ext/zlib/zlib.c long n;
n 2934 ext/zlib/zlib.c n = gz->z.stream.total_in;
n 2936 ext/zlib/zlib.c n += RSTRING_LEN(gz->z.input);
n 2939 ext/zlib/zlib.c rb_funcall(gz->io, id_seek, 2, rb_int2inum(-n), INT2FIX(1));
n 3993 ext/zlib/zlib.c int n;
n 3999 ext/zlib/zlib.c n = 0;
n 4002 ext/zlib/zlib.c while (n++, *(p++) == '\n') {
n 4003 ext/zlib/zlib.c if (n >= gz->z.buf_filled) {
n 4010 ext/zlib/zlib.c n = 0;
n 4015 ext/zlib/zlib.c str = zstream_shift_buffer(&gz->z, n - 1);
n 4031 ext/zlib/zlib.c char *p = rb_enc_left_char_head(s, s + n, e, gz->enc);
n 4033 ext/zlib/zlib.c if (l < n) {
n 4034 ext/zlib/zlib.c n = rb_enc_precise_mbclen(p, e, gz->enc);
n 4035 ext/zlib/zlib.c if (MBCLEN_NEEDMORE_P(n)) {
n 4036 ext/zlib/zlib.c if ((l = gzfile_fill(gz, l + MBCLEN_NEEDMORE_LEN(n))) > 0) {
n 4040 ext/zlib/zlib.c else if (MBCLEN_CHARFOUND_P(n)) {
n 4041 ext/zlib/zlib.c return l + MBCLEN_CHARFOUND_LEN(n);
n 4044 ext/zlib/zlib.c return n;
n 4055 ext/zlib/zlib.c long rslen, n, limit = -1;
n 4091 ext/zlib/zlib.c else if ((n = gzfile_fill(gz, limit)) <= 0) {
n 4095 ext/zlib/zlib.c if (maxlen > 1 && n >= limit && !GZFILE_IS_FINISHED(gz)) {
n 4096 ext/zlib/zlib.c n = gzreader_charboundary(gz, n);
n 4099 ext/zlib/zlib.c n = limit;
n 4101 ext/zlib/zlib.c dst = zstream_shift_buffer(&gz->z, n);
n 4134 ext/zlib/zlib.c n = rslen;
n 4137 ext/zlib/zlib.c if (n > gz->z.buf_filled) {
n 4140 ext/zlib/zlib.c p = RSTRING_PTR(gz->z.buf) + n - rslen;
n 4147 ext/zlib/zlib.c res = memchr(p, rsptr[0], (filled - n + 1));
n 4149 ext/zlib/zlib.c n = filled;
n 4151 ext/zlib/zlib.c n++;
n 4154 ext/zlib/zlib.c n += (long)(res - p);
n 4157 ext/zlib/zlib.c p++, n++;
n 4160 ext/zlib/zlib.c if (maxlen > 1 && n == limit && (gz->z.buf_filled > n || !ZSTREAM_IS_FINISHED(&gz->z))) {
n 4161 ext/zlib/zlib.c n = gzreader_charboundary(gz, n);
n 4165 ext/zlib/zlib.c dst = gzfile_read(gz, n);
n 104 file.c #define truncate(p, n) rb_w32_utruncate((p), (n))
n 342 file.c #define apply2args(n) (rb_check_arity(argc, n, UNLIMITED_ARGUMENTS), argc-=n)
n 3404 file.c char *n;
n 3406 file.c if (!(n = strrdirsep(root, p, enc))) {
n 3410 file.c p = n;
n 3458 file.c int n = ignored_char_p(s, fend, enc);
n 3459 file.c if (n) {
n 3464 file.c b = s += n;
n 3986 file.c long f = 0, n = -1;
n 4023 file.c n = ntfs_tail(p, end, enc) - p;
n 4025 file.c n = chompdirsep(p, end, enc) - p;
n 4027 file.c for (q = p; q - p < n && *q == '.'; q++);
n 4028 file.c for (e = 0; q - p < n; Inc(q, end, enc)) {
n 4032 file.c else f = n;
n 4038 file.c *alllen = n;
n 4064 file.c long f, n;
n 4079 file.c if ((n = RSTRING_LEN(fname)) == 0 || !*(name = RSTRING_PTR(fname)))
n 4082 file.c p = ruby_enc_find_basename(name, &f, &n, enc);
n 4083 file.c if (n >= 0) {
n 4085 file.c f = n;
n 4090 file.c if (!(f = rmext(p, f, n, fp, RSTRING_LEN(fext), enc))) {
n 4091 file.c f = n;
n 4431 file.c #define NUM2POS(n) NUM2OFFT(n)
n 4434 file.c #define NUM2POS(n) NUM2LONG(n)
n 4487 file.c #define NUM2POS(n) NUM2OFFT(n)
n 4490 file.c #define NUM2POS(n) NUM2LONG(n)
n 4640 file.c n+=1;
n 4641 file.c rb_check_arity(argc, n, n);
n 4642 file.c for (i=1; i<n; i++) {
n 4649 file.c #define CHECK(n) test_check((n), argc, argv)
n 1946 gc.c NODE *n = (NODE *)newobj_of(0, T_NODE, a0, a1, a2, FALSE); /* TODO: node also should be wb protected */
n 1947 gc.c nd_set_type(n, type);
n 1948 gc.c return n;
n 3955 gc.c while (n--) {
n 3965 gc.c long n;
n 3968 gc.c n = end - start;
n 3969 gc.c mark_locations_array(objspace, start, n);
n 3984 gc.c for (i=0; i<n; i++) {
n 6013 gc.c size_t n = 0;
n 6032 gc.c if (RVALUE_WB_UNPROTECTED(obj) == 0 && n<max) flags[n++] = ID_wb_protected;
n 6033 gc.c if (RVALUE_OLD_P(obj) && n<max) flags[n++] = ID_old;
n 6034 gc.c if (RVALUE_UNCOLLECTIBLE(obj) && n<max) flags[n++] = ID_uncollectible;
n 6035 gc.c if (MARKED_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj) && n<max) flags[n++] = ID_marking;
n 6037 gc.c if (MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(obj), obj) && n<max) flags[n++] = ID_marked;
n 6038 gc.c return n;
n 7810 gc.c return objspace_xmalloc0(&rb_objspace, xmalloc2_size(n, size));
n 7887 gc.c return objspace_xmalloc2(&rb_objspace, n, size);
n 7908 gc.c return objspace_xcalloc(&rb_objspace, n, size);
n 7932 gc.c size_t len = size * n;
n 7933 gc.c if (n != 0 && size != len / n) {
n 7942 gc.c return ruby_sized_xrealloc2(ptr, n, size, 0);
n 8439 gc.c st_index_t n;
n 8442 gc.c n = w->wmap2obj->num_entries;
n 8444 gc.c return ULONG2NUM(n);
n 8446 gc.c return ULL2NUM(n);
n 35 goruby.c ssize_t n;
n 40 goruby.c n = write(rw[1], cmd, sizeof(cmd) - 1);
n 42 goruby.c ret = n > 0 ? ruby_options(argc, argv) : NULL;
n 218 hash.c return (n >> (RUBY_SPECIAL_SHIFT + 3) ^ (n << 16)) ^ (n >> 3);
n 267 hash.c if (FLONUM_P(n)) {
n 268 hash.c n ^= (st_data_t)rb_float_value(n);
n 272 hash.c return (st_index_t)rb_num_hash_start((st_index_t)n);
n 550 hash.c int n = rb_proc_arity(proc);
n 552 hash.c if (n != 2 && (n >= 0 || n < -3)) {
n 553 hash.c if (n < 0) n = -n-1;
n 554 hash.c rb_raise(rb_eTypeError, "default_proc takes two arguments (2 for %d)", n);
n 1269 hash.c st_index_t n;
n 1273 hash.c n = RHASH_SIZE(hash);
n 1274 hash.c if (!n) return Qnil;
n 1276 hash.c if (n == RHASH(hash)->ntbl->num_entries) return Qnil;
n 1430 hash.c st_index_t n;
n 1436 hash.c n = RHASH(hash)->ntbl->num_entries;
n 1438 hash.c if (n == RHASH(hash)->ntbl->num_entries) return Qnil;
n 2886 hash.c #define getenv(n) w32_getenv(n)
n 2899 hash.c #define ENVNMATCH(s1, s2, n) (STRNCASECMP((s1), (s2), (n)) == 0)
n 2902 hash.c #define ENVNMATCH(s1, s2, n) (memcmp((s1), (s2), (n)) == 0)
n 3205 hash.c size_t n;
n 3208 hash.c n = lstrlen(name) + 2 + strlen(value) + getenvsize(p);
n 3210 hash.c if (n >= getenvblocksize()) {
n 217 include/ruby/encoding.h #define rb_enc_step_back(s,p,e,n,enc) ((char *)onigenc_step_back((enc),(UChar*)(s),(UChar*)(p),(UChar*)(e),(int)(n)))
n 340 include/ruby/encoding.h void rb_econv_putback(rb_econv_t *ec, unsigned char *p, int n);
n 52 include/ruby/intern.h VALUE rb_ary_new_from_args(long n, ...);
n 53 include/ruby/intern.h VALUE rb_ary_new_from_values(long n, const VALUE *elts);
n 337 include/ruby/intern.h #define rb_fd_clr(n, f) rb_w32_fdclr((n), (f)->fdset)
n 338 include/ruby/intern.h #define rb_fd_isset(n, f) rb_w32_fdisset((n), (f)->fdset)
n 339 include/ruby/intern.h #define rb_fd_copy(d, s, n) rb_w32_fd_copy((d), (s), (n))
n 343 include/ruby/intern.h #define rb_fd_select(n, rfds, wfds, efds, timeout) rb_w32_select((n), (rfds) ? ((rb_fdset_t*)(rfds))->fdset : NULL, (wfds) ? ((rb_fdset_t*)(wfds))->fdset : NULL, (efds) ? ((rb_fdset_t*)(efds))->fdset: NULL, (timeout))
n 353 include/ruby/intern.h #define rb_fd_set(n, f) FD_SET((n), (f))
n 354 include/ruby/intern.h #define rb_fd_clr(n, f) FD_CLR((n), (f))
n 355 include/ruby/intern.h #define rb_fd_isset(n, f) FD_ISSET((n), (f))
n 364 include/ruby/intern.h #define rb_fd_select(n, rfds, wfds, efds, timeout) select((n), (rfds), (wfds), (efds), (timeout))
n 656 include/ruby/intern.h VALUE rb_random_bytes(VALUE rnd, long n);
n 137 include/ruby/oniguruma.h #define OnigCodePointCount(n) ((n)&OnigCodePointMask)
n 138 include/ruby/oniguruma.h #define OnigCaseFoldFlags(n) ((n)&~OnigCodePointMask)
n 296 include/ruby/oniguruma.h onigenc_step_back((enc),(start),(s),(end),(n))
n 298 include/ruby/oniguruma.h #define ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) (n)
n 305 include/ruby/oniguruma.h #define ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(n) (-1-(n))
n 360 include/ruby/oniguruma.h OnigUChar* onigenc_step_back P_((OnigEncoding enc, const OnigUChar* start, const OnigUChar* s, const OnigUChar* end, int n));
n 815 include/ruby/oniguruma.h int onig_region_resize P_((OnigRegion* region, int n));
n 49 include/ruby/ruby.h #define RUBY_MACRO_SELECT(base, n) TOKEN_PASTE(base, n)
n 307 include/ruby/ruby.h rb_long2int_inline(long n)
n 309 include/ruby/ruby.h int i = (int)n;
n 310 include/ruby/ruby.h if ((long)i != n)
n 311 include/ruby/ruby.h rb_out_of_int(n);
n 315 include/ruby/ruby.h #define rb_long2int(n) rb_long2int_inline(n)
n 317 include/ruby/ruby.h #define rb_long2int(n) ((int)(n))
n 1579 include/ruby/ruby.h #define RB_ALLOC_N(type,n) ((type*)ruby_xmalloc2((n),sizeof(type)))
n 1581 include/ruby/ruby.h #define RB_ZALLOC_N(type,n) ((type*)ruby_xcalloc((n),sizeof(type)))
n 1583 include/ruby/ruby.h #define RB_REALLOC_N(var,type,n) ((var)=(type*)ruby_xrealloc2((char*)(var),(n),sizeof(type)))
n 1585 include/ruby/ruby.h #define ALLOC_N(type,n) RB_ALLOC_N(type,n)
n 1587 include/ruby/ruby.h #define ZALLOC_N(type,n) RB_ZALLOC_N(type,n)
n 1589 include/ruby/ruby.h #define REALLOC_N(var,type,n) RB_REALLOC_N(var,type,n)
n 1591 include/ruby/ruby.h #define ALLOCA_N(type,n) ((type*)alloca(sizeof(type)*(n)))
n 1636 include/ruby/ruby.h # define RB_ALLOCV(v, n) rb_alloc_tmp_buffer(&(v), (n))
n 1638 include/ruby/ruby.h rb_alloc_tmp_buffer2(&(v), (n), sizeof(type))))
n 1641 include/ruby/ruby.h # define RB_ALLOCV(v, n) ((n) < RUBY_ALLOCV_LIMIT ? \
n 1642 include/ruby/ruby.h (RB_GC_GUARD(v) = 0, alloca(n)) : \
n 1643 include/ruby/ruby.h rb_alloc_tmp_buffer(&(v), (n)))
n 1645 include/ruby/ruby.h ((type*)(((size_t)(n) < RUBY_ALLOCV_LIMIT / sizeof(type)) ? \
n 1646 include/ruby/ruby.h (RB_GC_GUARD(v) = 0, alloca((n) * sizeof(type))) : \
n 1647 include/ruby/ruby.h rb_alloc_tmp_buffer2(&(v), (n), sizeof(type))))
n 1651 include/ruby/ruby.h #define ALLOCV(v, n) RB_ALLOCV(v, n)
n 1652 include/ruby/ruby.h #define ALLOCV_N(type, v, n) RB_ALLOCV_N(type, v, n)
n 1655 include/ruby/ruby.h #define MEMZERO(p,type,n) memset((p), 0, sizeof(type)*(n))
n 1656 include/ruby/ruby.h #define MEMCPY(p1,p2,type,n) memcpy((p1), (p2), sizeof(type)*(n))
n 1657 include/ruby/ruby.h #define MEMMOVE(p1,p2,type,n) memmove((p1), (p2), sizeof(type)*(n))
n 1658 include/ruby/ruby.h #define MEMCMP(p1,p2,type,n) memcmp((p1), (p2), sizeof(type)*(n))
n 1809 include/ruby/ruby.h VALUE rb_syserr_new_str(int n, VALUE arg);
n 1837 include/ruby/ruby.h VALUE rb_yield_values(int n, ...);
n 1838 include/ruby/ruby.h VALUE rb_yield_values2(int n, const VALUE *argv);
n 2144 include/ruby/ruby.h int st_locale_insensitive_strncasecmp(const char *s1, const char *s2, size_t n);
n 2146 include/ruby/ruby.h #define STRNCASECMP(s1, s2, n) (st_locale_insensitive_strncasecmp((s1), (s2), (n)))
n 2153 include/ruby/ruby.h PRINTF_ARGS(int ruby_snprintf(char *str, size_t n, char const *fmt, ...), 3, 4);
n 2154 include/ruby/ruby.h int ruby_vsnprintf(char *str, size_t n, char const *fmt, va_list ap);
n 2463 include/ruby/ruby.h int ruby_executable_node(void *n, int *status);
n 2464 include/ruby/ruby.h int ruby_run_node(void *n);
n 2496 include/ruby/ruby.h int ruby_exec_node(void *n);
n 137 include/ruby/st.h PUREFUNC(int st_locale_insensitive_strncasecmp(const char *s1, const char *s2, size_t n));
n 50 include/ruby/util.h #define DECIMAL_SIZE_OF_BITS(n) (((n) * 3010 + 9998) / 9999)
n 617 include/ruby/win32.h #define inet_ntop(f,a,n,l) rb_w32_inet_ntop(f,a,n,l)
n 632 include/ruby/win32.h #define select(n, r, w, e, t) rb_w32_select(n, r, w, e, t)
n 641 include/ruby/win32.h #define getsockopt(s, v, n, o, l) rb_w32_getsockopt(s, v, n, o, l)
n 662 include/ruby/win32.h #define setsockopt(s, v, n, o, l) rb_w32_setsockopt(s, v, n, o, l)
n 674 include/ruby/win32.h #define gethostbyname(n) rb_w32_gethostbyname(n)
n 677 include/ruby/win32.h #define gethostname(n, l) rb_w32_gethostname(n, l)
n 680 include/ruby/win32.h #define getprotobyname(n) rb_w32_getprotobyname(n)
n 683 include/ruby/win32.h #define getprotobynumber(n) rb_w32_getprotobynumber(n)
n 686 include/ruby/win32.h #define getservbyname(n, p) rb_w32_getservbyname(n, p)
n 698 include/ruby/win32.h #define getenv(n) rb_w32_getenv(n)
n 701 include/ruby/win32.h #define rename(o, n) rb_w32_rename(o, n)
n 707 include/ruby/win32.h #define dup2(o, n) rb_w32_dup2(o, n)
n 14 inits.c #define CALL(n) {void Init_##n(void); Init_##n();}
n 52 internal.h # define VALGRIND_MAKE_MEM_DEFINED(p, n) VALGRIND_MAKE_READABLE((p), (n))
n 55 internal.h # define VALGRIND_MAKE_MEM_UNDEFINED(p, n) VALGRIND_MAKE_WRITABLE((p), (n))
n 157 internal.h int n = 128;
n 159 internal.h int n = 64;
n 161 internal.h int n = 32;
n 164 internal.h y = x >> 64; if (y) {n -= 64; x = y;}
n 167 internal.h y = x >> 32; if (y) {n -= 32; x = y;}
n 169 internal.h y = x >> 16; if (y) {n -= 16; x = y;}
n 170 internal.h y = x >> 8; if (y) {n -= 8; x = y;}
n 171 internal.h y = x >> 4; if (y) {n -= 4; x = y;}
n 172 internal.h y = x >> 2; if (y) {n -= 2; x = y;}
n 173 internal.h y = x >> 1; if (y) {return n - 2;}
n 174 internal.h return (int)(n - x);
n 187 internal.h int n = 128;
n 189 internal.h int n = 64;
n 191 internal.h int n = 32;
n 194 internal.h y = x >> 64; if (y) {n -= 64; x = y;}
n 197 internal.h y = x >> 32; if (y) {n -= 32; x = y;}
n 199 internal.h y = x >> 16; if (y) {n -= 16; x = y;}
n 200 internal.h y = x >> 8; if (y) {n -= 8; x = y;}
n 201 internal.h y = x >> 4; if (y) {n -= 4; x = y;}
n 202 internal.h y = x >> 2; if (y) {n -= 2; x = y;}
n 203 internal.h y = x >> 1; if (y) {return n - 2;}
n 204 internal.h return (int)(n - x);
n 218 internal.h int n = 128;
n 220 internal.h int n = 64;
n 222 internal.h int n = 32;
n 225 internal.h y = x >> 64; if (y) {n -= 64; x = y;}
n 228 internal.h y = x >> 32; if (y) {n -= 32; x = y;}
n 230 internal.h y = x >> 16; if (y) {n -= 16; x = y;}
n 231 internal.h y = x >> 8; if (y) {n -= 8; x = y;}
n 232 internal.h y = x >> 4; if (y) {n -= 4; x = y;}
n 233 internal.h y = x >> 2; if (y) {n -= 2; x = y;}
n 234 internal.h y = x >> 1; if (y) {return n - 2;}
n 235 internal.h return (int)(n - x);
n 245 internal.h int n = 128;
n 246 internal.h y = x >> 64; if (y) {n -= 64; x = y;}
n 247 internal.h y = x >> 32; if (y) {n -= 32; x = y;}
n 248 internal.h y = x >> 16; if (y) {n -= 16; x = y;}
n 249 internal.h y = x >> 8; if (y) {n -= 8; x = y;}
n 250 internal.h y = x >> 4; if (y) {n -= 4; x = y;}
n 251 internal.h y = x >> 2; if (y) {n -= 2; x = y;}
n 252 internal.h y = x >> 1; if (y) {return n - 2;}
n 253 internal.h return (int)(n - x);
n 531 internal.h #define RRATIONAL_SET_NUM(rat, n) RB_OBJ_WRITE((rat), &((struct RRational *)(rat))->num,(n))
n 843 internal.h if (__builtin_constant_p(n)) { \
n 844 internal.h STATIC_ASSERT(rb_ary_new_from_args, numberof(args_to_new_ary) == (n)); \
n 1018 internal.h #define SIZED_REALLOC_N(var,type,n,old_n) REALLOC_N(var, type, n)
n 1306 io.c long n, r, offset = 0;
n 1311 io.c if ((n = len) <= 0) return n;
n 1328 io.c arg.length = n;
n 1336 io.c if (r == n) return len;
n 1339 io.c n -= r;
n 1455 io.c long n;
n 1471 io.c n = io_fwrite(str, fptr, nosync);
n 1472 io.c if (n == -1L) rb_sys_fail_path(fptr->pathv);
n 1474 io.c return LONG2FIX(n);
n 2082 io.c int n;
n 2084 io.c n = READ_DATA_PENDING_COUNT(fptr);
n 2085 io.c if (n <= 0) return 0;
n 2086 io.c if (n > len) n = (int)len;
n 2087 io.c MEMMOVE(ptr, fptr->rbuf.ptr+fptr->rbuf.off, char, n);
n 2088 io.c fptr->rbuf.off += n;
n 2089 io.c fptr->rbuf.len -= n;
n 2090 io.c return n;
n 2097 io.c long n = len;
n 2101 io.c while (n > 0) {
n 2103 io.c c = rb_read_internal(fptr->fd, ptr+offset, n);
n 2111 io.c if ((n -= c) <= 0) break;
n 2113 io.c return len - n;
n 2116 io.c while (n > 0) {
n 2117 io.c c = read_buffered_data(ptr+offset, n, fptr);
n 2120 io.c if ((n -= c) <= 0) break;
n 2127 io.c return len - n;
n 2373 io.c if (RSTRING_LEN(str) != n) {
n 2375 io.c rb_str_set_len(str, n);
n 2383 io.c long n;
n 2426 io.c n = io_fread(str, bytes, siz - bytes, fptr);
n 2427 io.c if (n == 0 && bytes == 0) {
n 2431 io.c bytes += n;
n 2499 io.c long n, len;
n 2519 io.c n = read_buffered_data(RSTRING_PTR(str), len, fptr);
n 2520 io.c if (n <= 0) {
n 2530 io.c n = arg.len;
n 2531 io.c if (n < 0) {
n 2545 io.c io_set_read_length(str, n);
n 2547 io.c if (n == 0)
n 2637 io.c long n, len;
n 2652 io.c n = read_buffered_data(RSTRING_PTR(str), len, fptr);
n 2653 io.c if (n <= 0) {
n 2660 io.c n = arg.len;
n 2661 io.c if (n < 0) {
n 2671 io.c io_set_read_length(str, n);
n 2673 io.c if (n == 0) {
n 2686 io.c long n;
n 2699 io.c n = write(fptr->fd, RSTRING_PTR(str), RSTRING_LEN(str));
n 2701 io.c if (n == -1) {
n 2714 io.c return LONG2FIX(n);
n 2787 io.c long n, len;
n 2818 io.c n = io_fread(str, 0, len, fptr);
n 2819 io.c io_set_read_length(str, n);
n 2825 io.c if (n == 0) return Qnil;
n 3475 io.c int r, n, cr = 0;
n 3544 io.c (n = MBCLEN_CHARFOUND_LEN(r)) <= fptr->rbuf.len) {
n 3545 io.c str = rb_str_new(fptr->rbuf.ptr+fptr->rbuf.off, n);
n 3546 io.c fptr->rbuf.off += n;
n 3547 io.c fptr->rbuf.len -= n;
n 3648 io.c int r, n;
n 3687 io.c n = MBCLEN_CHARFOUND_LEN(r);
n 3696 io.c fptr->cbuf.off += n;
n 3697 io.c fptr->cbuf.len -= n;
n 3707 io.c (n = MBCLEN_CHARFOUND_LEN(r)) <= fptr->rbuf.len) {
n 3710 io.c fptr->rbuf.off += n;
n 3711 io.c fptr->rbuf.len -= n;
n 3722 io.c more += n = fptr->rbuf.len;
n 3724 io.c while ((n = (int)read_buffered_data(p, more, fptr)) > 0 &&
n 3725 io.c (p += n, (more -= n) > 0)) {
n 3727 io.c if ((n = fptr->rbuf.len) > more) n = more;
n 4652 io.c long n;
n 4667 io.c n = rb_write_internal(fptr->fd, RSTRING_PTR(str), RSTRING_LEN(str));
n 4670 io.c if (n == -1) rb_sys_fail_path(fptr->pathv);
n 4672 io.c return LONG2FIX(n);
n 4698 io.c long n, ilen;
n 4731 io.c n = arg.len;
n 4733 io.c if (n == -1) {
n 4736 io.c io_set_read_length(str, n);
n 4737 io.c if (n == 0 && ilen > 0) {
n 7061 io.c int n;
n 7064 io.c if ((n = rb_enc_mbminlen(enc)) == 1) {
n 7067 io.c return rb_enc_ascget(ptr + ((len - 1) / n) * n, ptr + len, &n, enc) == c;
n 8133 io.c int n = NUM2INT(val);
n 8134 io.c ARGF.last_lineno = ARGF.lineno = n;
n 8393 io.c int max = 0, n;
n 8452 io.c n = rb_thread_fd_select(max, rp, wp, ep, tp);
n 8453 io.c if (n < 0) {
n 8456 io.c if (!pending && n == 0) return Qnil; /* returns nil on timeout */
n 9678 io.c long n;
n 9681 io.c n = RARRAY_LEN(v) + 1;
n 9683 io.c if (n > INT_MAX) {
n 9687 io.c args = rb_ary_tmp_new(n);
n 9690 io.c arg->io = rb_io_open_with_args((int)n, RARRAY_CONST_PTR(args));
n 10130 io.c return rb_thread_fd_select(n, rfds, wfds, efds, timeout);
n 10132 io.c return rb_fd_select(n, rfds, wfds, efds, timeout);
n 10495 io.c VALUE n;
n 10536 io.c n = rb_io_write(stp->dst, buf);
n 10537 io.c numwrote = NUM2LONG(n);
n 11973 io.c switch (n) {
n 11990 io.c switch (n) {
n 1479 iseq.c size_t n;
n 1570 iseq.c for (n = 0; n < size;) {
n 1571 iseq.c n += rb_iseq_disasm_insn(str, code, n, iseq, child);
n 173 iseq.h if (n > catch_table_entries_max) rb_fatal("too large iseq_catch_table - %d", n);
n 175 iseq.h (n - 1) * sizeof(struct iseq_catch_table_entry));
n 349 load.c long n = RSTRING_LEN(p);
n 351 load.c if (n != plen) continue;
n 352 load.c if (n && strncmp(name, s, n)) continue;
n 383 load.c long i, len, elen, n;
n 445 load.c if ((n = RSTRING_LEN(v)) < len) continue;
n 449 load.c if (!(p = loaded_feature_path(f, n, feature, len, type, load_path)))
n 222 marshal.c char *n = RSTRING_PTR(path);
n 229 marshal.c if (n[0] == '#') {
n 256 marshal.c rb_str_buf_cat(buf, s, n);
n 273 marshal.c w_long(n, arg);
n 274 marshal.c w_nbyte(s, n, arg);
n 1130 marshal.c VALUE str, n = LONG2NUM(readable);
n 1132 marshal.c str = load_funcall(arg, arg->src, s_read, 1, &n);
n 1213 marshal.c VALUE str, n = LONG2NUM(len);
n 1215 marshal.c str = load_funcall(arg, arg->src, s_read, 1, &n);
n 1238 marshal.c VALUE tmp, n;
n 1242 marshal.c n = LONG2NUM(read_len);
n 1243 marshal.c tmp = load_funcall(arg, arg->src, s_read, 1, &n);
n 1337 marshal.c st_index_t n = arg->symbols->num_entries;
n 1340 marshal.c st_insert(arg->symbols, (st_data_t)n, (st_data_t)s);
n 1799 marshal.c VALUE n = rb_sym2str(RARRAY_AREF(mem, i));
n 1802 marshal.c if (!rb_str_equal(n, slot)) {
n 1805 marshal.c slot, n);
n 678 math.c return DBL2NUM(ldexp(Get_Double(x), NUM2INT(n)));
n 890 math.c rb_math_##n(VALUE x)\
n 892 math.c return math_##n(rb_mMath, x);\
n 897 math.c rb_math_##n(VALUE x, VALUE y)\
n 899 math.c return math_##n(rb_mMath, x, y);\
n 8 missing/finite.c return !isnan(n) && !isinf(n);
n 11 missing/isinf.c if (IsNANorINF(n) && IsINF(n)) {
n 39 missing/isinf.c return (!finite(n) && !isnan(n));
n 65 missing/isinf.c return memcmp(&n, &pinf, sizeof n) == 0
n 66 missing/isinf.c || memcmp(&n, &ninf, sizeof n) == 0;
n 24 missing/isnan.c return double_ne(n, n);
n 59 missing/langinfo.c #define strstart(s, n) (strncasecmp((s), (n), strlen(n)) == 0)
n 67 missing/langinfo.c int n;
n 80 missing/langinfo.c if ((n = 5, strstart(p, "8859-")) || (n = 9, strstart(p, "ISO-8859-"))) {
n 81 missing/langinfo.c if (digit(p[n])) {
n 82 missing/langinfo.c p += n;
n 13 missing/memmove.c src += n;
n 14 missing/memmove.c dst += n;
n 15 missing/memmove.c for (; n; --n)
n 19 missing/memmove.c for (; n; --n)
n 53 missing/strlcat.c register size_t n = siz;
n 57 missing/strlcat.c while (n-- != 0 && *d != '\0')
n 60 missing/strlcat.c n = siz - dlen;
n 62 missing/strlcat.c if (n == 0)
n 65 missing/strlcat.c if (n != 1) {
n 67 missing/strlcat.c n--;
n 51 missing/strlcpy.c register size_t n = siz;
n 54 missing/strlcpy.c if (n != 0 && --n != 0) {
n 58 missing/strlcpy.c } while (--n != 0);
n 62 missing/strlcpy.c if (n == 0) {
n 274 node.h #define nd_type(n) ((int) (((RNODE(n))->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT))
n 276 node.h RNODE(n)->flags=((RNODE(n)->flags&~NODE_TYPEMASK)|((((unsigned long)(t))<<NODE_TYPESHIFT)&NODE_TYPEMASK))
n 280 node.h #define nd_line(n) (int)(RNODE(n)->flags>>NODE_LSHIFT)
n 282 node.h RNODE(n)->flags=((RNODE(n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT))
n 367 node.h #define NEW_WHILE(c,b,n) NEW_NODE(NODE_WHILE,c,b,n)
n 368 node.h #define NEW_UNTIL(c,b,n) NEW_NODE(NODE_UNTIL,c,b,n)
n 378 node.h #define NEW_RESBODY(a,ex,n) NEW_NODE(NODE_RESBODY,n,ex,a)
n 408 node.h #define NEW_NTH_REF(n) NEW_NODE(NODE_NTH_REF,0,n,0)
n 409 node.h #define NEW_BACK_REF(n) NEW_NODE(NODE_BACK_REF,0,n,0)
n 419 node.h #define NEW_EVSTR(n) NEW_NODE(NODE_EVSTR,0,(n),0)
n 435 node.h #define NEW_ALIAS(n,o) NEW_NODE(NODE_ALIAS,n,o,0)
n 436 node.h #define NEW_VALIAS(n,o) NEW_NODE(NODE_VALIAS,n,o,0)
n 438 node.h #define NEW_CLASS(n,b,s) NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b),(s))
n 440 node.h #define NEW_MODULE(n,b) NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b),0)
n 1853 numeric.c VALUE n, f, h, r;
n 1874 numeric.c n = rb_int_minus(num, r);
n 1877 numeric.c n = rb_int_plus(n, f);
n 1879 numeric.c return n;
n 2200 numeric.c double n = (end - beg)/unit;
n 2211 numeric.c if (n<=0) return 0;
n 2212 numeric.c if (n<1)
n 2213 numeric.c n = 0;
n 2215 numeric.c n = floor(n - err);
n 2218 numeric.c if (n<0) return 0;
n 2219 numeric.c n = floor(n + err);
n 2221 numeric.c return n+1;
n 2231 numeric.c double n = ruby_float_step_size(beg, end, unit, excl);
n 2236 numeric.c if (n) rb_yield(DBL2NUM(beg));
n 2244 numeric.c for (i=0; i<n; i++) {
n 2279 numeric.c double n = ruby_float_step_size(NUM2DBL(from), NUM2DBL(to), NUM2DBL(step), excl);
n 2281 numeric.c if (isinf(n)) return DBL2NUM(n);
n 2282 numeric.c if (POSFIXABLE(n)) return LONG2FIX(n);
n 2283 numeric.c return rb_dbl2big(n);
n 2513 numeric.c LONG_MIN <= (n): \
n 2514 numeric.c LONG_MIN_MINUS_ONE < (n))
n 2774 numeric.c LLONG_MIN <= (n): \
n 2775 numeric.c LLONG_MIN_MINUS_ONE < (n))
n 3002 numeric.c int n;
n 3004 numeric.c switch (n = rb_enc_codelen(code, enc)) {
n 3013 numeric.c str = rb_enc_str_new(0, n, enc);
n 3015 numeric.c if (rb_enc_precise_mbclen(RSTRING_PTR(str), RSTRING_END(str), enc) != n) {
n 3312 numeric.c #define FIT_SQRT_LONG(n) (((n)<SQRT_LONG_MAX)&&((n)>=-SQRT_LONG_MAX))
n 2522 object.c #define M(n) {#n, (unsigned short)idTo_##n}
n 2785 object.c char *n = buf;
n 2789 object.c while (p < end && n < e) prev = *n++ = *p++;
n 2794 object.c if (n == buf || !ISDIGIT(prev)) goto bad;
n 2804 object.c if (n < e) *n++ = prev;
n 2806 object.c *n = '\0';
n 1027 pack.c long i = 0, n = 0, prev = EOF;
n 1038 pack.c n += 3;
n 1047 pack.c n = 0;
n 1052 pack.c n++;
n 1055 pack.c if (n > len) {
n 1058 pack.c n = 0;
n 1067 pack.c if (n > 0) {
n 1079 pack.c int n;
n 1080 pack.c n = ruby_digit36_to_number_table[(unsigned char)c];
n 1081 pack.c if (16 <= n)
n 1082 pack.c n = -1;
n 1083 pack.c return n;
n 2008 pack.c long n;
n 2019 pack.c if (!(uv & 0x20)) { n = 2; uv &= 0x1f; }
n 2020 pack.c else if (!(uv & 0x10)) { n = 3; uv &= 0x0f; }
n 2021 pack.c else if (!(uv & 0x08)) { n = 4; uv &= 0x07; }
n 2022 pack.c else if (!(uv & 0x04)) { n = 5; uv &= 0x03; }
n 2023 pack.c else if (!(uv & 0x02)) { n = 6; uv &= 0x01; }
n 2028 pack.c if (n > *lenp) {
n 2030 pack.c n, *lenp);
n 2032 pack.c *lenp = n--;
n 2033 pack.c if (n != 0) {
n 2034 pack.c while (n--) {
n 2037 pack.c *lenp -= n + 1;
n 2046 pack.c n = *lenp - 1;
n 2047 pack.c if (uv < utf8_limits[n]) {
n 168 parse.c # define BITSTACK_PUSH(stack, n) (((stack) = ((stack)<<1)|((n)&1)), SHOW_BITSTACK(stack, #stack"(push)"))
n 172 parse.c # define BITSTACK_SET(stack, n) ((stack)=(n), SHOW_BITSTACK(stack, #stack"(set)"))
n 174 parse.c #define COND_PUSH(n) BITSTACK_PUSH(cond_stack, (n))
n 178 parse.c #define COND_SET(n) BITSTACK_SET(cond_stack, (n))
n 180 parse.c #define CMDARG_PUSH(n) BITSTACK_PUSH(cmdarg_stack, (n))
n 184 parse.c #define CMDARG_SET(n) BITSTACK_SET(cmdarg_stack, (n))
n 265 parse.c if (tbl->pos < n) rb_bug("vtable_pop: unreachable");
n 266 parse.c tbl->pos -= n;
n 389 parse.c #define intern_cstr(n,l,en) rb_intern3(n,l,en)
n 391 parse.c #define intern_cstr(n,l,en) rb_intern3(n,l,en)
n 394 parse.c #define STR_NEW(p,n) rb_enc_str_new((p),(n),current_enc)
n 397 parse.c #define STR_NEW3(p,n,e,func) parser_str_new((p),(n),(e),(func),current_enc)
n 482 parse.c #define reduce_nodes(n) reduce_nodes_gen(parser,(n))
n 499 parse.c #define new_evstr(n) new_evstr_gen(parser,(n))
n 501 parse.c #define evstr2dstr(n) evstr2dstr_gen(parser,(n))
n 535 parse.c #define rb_backref_error(n) rb_backref_error_gen(parser,(n))
n 586 parse.c return RB_TYPE_P(n, T_NODE) && nd_type(RNODE(n)) == NODE_RIPPER;
n 660 parse.c #define SIGN_EXTEND(x,n) (((1<<(n)-1)^((x)&~(~0<<(n))))-(1<<(n)-1))
n 690 parse.c #define dispatch0(n) ripper_dispatch0(parser, TOKEN_PASTE(ripper_id_, n))
n 691 parse.c #define dispatch1(n,a) ripper_dispatch1(parser, TOKEN_PASTE(ripper_id_, n), (a))
n 692 parse.c #define dispatch2(n,a,b) ripper_dispatch2(parser, TOKEN_PASTE(ripper_id_, n), (a), (b))
n 693 parse.c #define dispatch3(n,a,b,c) ripper_dispatch3(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c))
n 694 parse.c #define dispatch4(n,a,b,c,d) ripper_dispatch4(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d))
n 695 parse.c #define dispatch5(n,a,b,c,d,e) ripper_dispatch5(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e))
n 696 parse.c #define dispatch7(n,a,b,c,d,e,f,g) ripper_dispatch7(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e), (f), (g))
n 795 parse.c # define WARN_ARGS(fmt,n) parser->value, id_warn, n, rb_usascii_str_new_lit(fmt)
n 796 parse.c # define WARN_ARGS_L(l,fmt,n) WARN_ARGS(fmt,n)
n 798 parse.c # define WARNING_ARGS(fmt,n) parser->value, id_warning, n, rb_usascii_str_new_lit(fmt)
n 799 parse.c # define WARNING_ARGS_L(l, fmt,n) WARNING_ARGS(fmt,n)
n 808 parse.c # define WARN_ARGS(fmt,n) WARN_ARGS_L(ruby_sourceline,fmt,n)
n 811 parse.c # define WARNING_ARGS(fmt,n) WARN_ARGS(fmt,n)
n 812 parse.c # define WARNING_ARGS_L(l,fmt,n) WARN_ARGS_L(l,fmt,n)
n 10905 parse.c # define tokspace(n) parser_tokspace(parser, (n))
n 10911 parse.c # define tokadd_string(f,t,p,n,e) parser_tokadd_string(parser,(f),(t),(p),(n),(e))
n 10912 parse.c # define parse_string(n) parser_parse_string(parser,(n))
n 10914 parse.c # define here_document(n) parser_here_document(parser,(n))
n 10916 parse.c # define heredoc_restore(n) parser_heredoc_restore(parser,(n))
n 11169 parse.c VALUE lines = rb_ary_tmp_new_fill(n);
n 11185 parse.c int n;
n 11194 parse.c n = ruby_sourceline;
n 11197 parse.c } while (--n);
n 11214 parse.c n = yyparse((void*)parser);
n 11423 parse.c str = rb_enc_str_new(p, n, enc);
n 11438 parse.c #define peek_n(c,n) (lex_p+(n) < lex_pend && (c) == (unsigned char)lex_p[n])
n 11440 parse.c #define peekc_n(n) (lex_p+(n) < lex_pend ? (unsigned char)lex_p[n] : -1)
n 11554 parse.c tokidx += n;
n 11560 parse.c return &tokenbuf[tokidx-n];
n 11587 parse.c #define tokcopy(n) memcpy(tokspace(n), lex_p - (n), (n))
n 12316 parse.c int n = TAB_WIDTH * (col / TAB_WIDTH + 1);
n 12317 parse.c if (n > width) break;
n 12318 parse.c col = n;
n 12387 parse.c long n;
n 12392 parse.c n = lex_pend - (p + len);
n 12393 parse.c if (n < 0) return FALSE;
n 12394 parse.c if (n > 0 && p[len] != '\n') {
n 12396 parse.c if (n <= 1 || p[len+1] != '\n') return FALSE;
n 12714 parse.c long i, n = RARRAY_LEN(lines);
n 12715 parse.c for (i = 0; i < n; ++i) {
n 12874 parse.c long n = 0;
n 12927 parse.c n = end - beg;
n 12928 parse.c str_copy(name, beg, n);
n 12930 parse.c for (i = 0; i < n; ++i) {
n 12934 parse.c if (STRNCASECMP(p->name, s, n) == 0 && !p->name[n]) {
n 12935 parse.c n = vend - vbeg;
n 12937 parse.c n = (*p->length)(parser, vbeg, n);
n 12939 parse.c str_copy(val, vbeg, n);
n 13030 parse.c #define IS_LABEL_SUFFIX(n) (peek_n(':',(n)) && !peek_n(':', (n)+1))
n 13500 parse.c unsigned long n = ruby_scan_digits(tok()+1, toklen()-1, 10, &len, &overflow);
n 13506 parse.c if (overflow || n > nth_ref_max) {
n 13512 parse.c return (int)n;
n 14456 parse.c NODE *n = (rb_node_newnode)(type, a0, a1, a2);
n 14457 parse.c nd_set_line(n, ruby_sourceline);
n 14458 parse.c return n;
n 15356 parse.c NODE **n = &node, *n1 = node;
n 15358 parse.c *n = n1 = n1->nd_body;
n 15366 parse.c NODE **n = &node, *n1 = node;
n 15368 parse.c *n = n1 = n1->nd_body;
n 16670 parse.c #define HEAPCNT(n, size) ((n) * (size) / sizeof(YYSTYPE))
n 16672 parse.c #define ADD2HEAP(n, c, p) ((parser->heap = (n))->u1.node = (p), \
n 16673 parse.c (n)->u3.cnt = (c), (p))
n 16679 parse.c NODE *n = NEWHEAP();
n 16682 parse.c return ADD2HEAP(n, cnt, ptr);
n 16689 parse.c NODE *n = NEWHEAP();
n 16692 parse.c return ADD2HEAP(n, cnt, ptr);
n 16698 parse.c NODE *n;
n 16701 parse.c if (ptr && (n = parser->heap) != NULL) {
n 16703 parse.c if (n->u1.node == ptr) {
n 16704 parse.c n->u1.node = ptr = xrealloc(ptr, size);
n 16705 parse.c if (n->u3.cnt) n->u3.cnt = cnt;
n 16708 parse.c } while ((n = n->u2.node) != NULL);
n 16710 parse.c n = NEWHEAP();
n 16712 parse.c return ADD2HEAP(n, cnt, ptr);
n 16718 parse.c NODE **prev = &parser->heap, *n;
n 16720 parse.c while ((n = *prev) != NULL) {
n 16721 parse.c if (n->u1.node == ptr) {
n 16722 parse.c *prev = n->u2.node;
n 16723 parse.c rb_gc_force_recycle((VALUE)n);
n 16726 parse.c prev = &n->u2.node;
n 114 parse.y # define BITSTACK_PUSH(stack, n) (((stack) = ((stack)<<1)|((n)&1)), SHOW_BITSTACK(stack, #stack"(push)"))
n 118 parse.y # define BITSTACK_SET(stack, n) ((stack)=(n), SHOW_BITSTACK(stack, #stack"(set)"))
n 120 parse.y #define COND_PUSH(n) BITSTACK_PUSH(cond_stack, (n))
n 124 parse.y #define COND_SET(n) BITSTACK_SET(cond_stack, (n))
n 126 parse.y #define CMDARG_PUSH(n) BITSTACK_PUSH(cmdarg_stack, (n))
n 130 parse.y #define CMDARG_SET(n) BITSTACK_SET(cmdarg_stack, (n))
n 211 parse.y if (tbl->pos < n) rb_bug("vtable_pop: unreachable");
n 212 parse.y tbl->pos -= n;
n 335 parse.y #define intern_cstr(n,l,en) rb_intern3(n,l,en)
n 337 parse.y #define intern_cstr(n,l,en) rb_intern3(n,l,en)
n 340 parse.y #define STR_NEW(p,n) rb_enc_str_new((p),(n),current_enc)
n 343 parse.y #define STR_NEW3(p,n,e,func) parser_str_new((p),(n),(e),(func),current_enc)
n 428 parse.y #define reduce_nodes(n) reduce_nodes_gen(parser,(n))
n 445 parse.y #define new_evstr(n) new_evstr_gen(parser,(n))
n 447 parse.y #define evstr2dstr(n) evstr2dstr_gen(parser,(n))
n 481 parse.y #define rb_backref_error(n) rb_backref_error_gen(parser,(n))
n 532 parse.y return RB_TYPE_P(n, T_NODE) && nd_type(RNODE(n)) == NODE_RIPPER;
n 606 parse.y #define SIGN_EXTEND(x,n) (((1<<(n)-1)^((x)&~(~0<<(n))))-(1<<(n)-1))
n 636 parse.y #define dispatch0(n) ripper_dispatch0(parser, TOKEN_PASTE(ripper_id_, n))
n 637 parse.y #define dispatch1(n,a) ripper_dispatch1(parser, TOKEN_PASTE(ripper_id_, n), (a))
n 638 parse.y #define dispatch2(n,a,b) ripper_dispatch2(parser, TOKEN_PASTE(ripper_id_, n), (a), (b))
n 639 parse.y #define dispatch3(n,a,b,c) ripper_dispatch3(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c))
n 640 parse.y #define dispatch4(n,a,b,c,d) ripper_dispatch4(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d))
n 641 parse.y #define dispatch5(n,a,b,c,d,e) ripper_dispatch5(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e))
n 642 parse.y #define dispatch7(n,a,b,c,d,e,f,g) ripper_dispatch7(parser, TOKEN_PASTE(ripper_id_, n), (a), (b), (c), (d), (e), (f), (g))
n 741 parse.y # define WARN_ARGS(fmt,n) parser->value, id_warn, n, rb_usascii_str_new_lit(fmt)
n 742 parse.y # define WARN_ARGS_L(l,fmt,n) WARN_ARGS(fmt,n)
n 744 parse.y # define WARNING_ARGS(fmt,n) parser->value, id_warning, n, rb_usascii_str_new_lit(fmt)
n 745 parse.y # define WARNING_ARGS_L(l, fmt,n) WARNING_ARGS(fmt,n)
n 754 parse.y # define WARN_ARGS(fmt,n) WARN_ARGS_L(ruby_sourceline,fmt,n)
n 757 parse.y # define WARNING_ARGS(fmt,n) WARN_ARGS(fmt,n)
n 758 parse.y # define WARNING_ARGS_L(l,fmt,n) WARN_ARGS_L(l,fmt,n)
n 5232 parse.y # define tokspace(n) parser_tokspace(parser, (n))
n 5238 parse.y # define tokadd_string(f,t,p,n,e) parser_tokadd_string(parser,(f),(t),(p),(n),(e))
n 5239 parse.y # define parse_string(n) parser_parse_string(parser,(n))
n 5241 parse.y # define here_document(n) parser_here_document(parser,(n))
n 5243 parse.y # define heredoc_restore(n) parser_heredoc_restore(parser,(n))
n 5496 parse.y VALUE lines = rb_ary_tmp_new_fill(n);
n 5512 parse.y int n;
n 5521 parse.y n = ruby_sourceline;
n 5524 parse.y } while (--n);
n 5541 parse.y n = yyparse((void*)parser);
n 5750 parse.y str = rb_enc_str_new(p, n, enc);
n 5765 parse.y #define peek_n(c,n) (lex_p+(n) < lex_pend && (c) == (unsigned char)lex_p[n])
n 5767 parse.y #define peekc_n(n) (lex_p+(n) < lex_pend ? (unsigned char)lex_p[n] : -1)
n 5881 parse.y tokidx += n;
n 5887 parse.y return &tokenbuf[tokidx-n];
n 5914 parse.y #define tokcopy(n) memcpy(tokspace(n), lex_p - (n), (n))
n 6643 parse.y int n = TAB_WIDTH * (col / TAB_WIDTH + 1);
n 6644 parse.y if (n > width) break;
n 6645 parse.y col = n;
n 6714 parse.y long n;
n 6719 parse.y n = lex_pend - (p + len);
n 6720 parse.y if (n < 0) return FALSE;
n 6721 parse.y if (n > 0 && p[len] != '\n') {
n 6723 parse.y if (n <= 1 || p[len+1] != '\n') return FALSE;
n 7041 parse.y long i, n = RARRAY_LEN(lines);
n 7042 parse.y for (i = 0; i < n; ++i) {
n 7201 parse.y long n = 0;
n 7254 parse.y n = end - beg;
n 7255 parse.y str_copy(name, beg, n);
n 7257 parse.y for (i = 0; i < n; ++i) {
n 7261 parse.y if (STRNCASECMP(p->name, s, n) == 0 && !p->name[n]) {
n 7262 parse.y n = vend - vbeg;
n 7264 parse.y n = (*p->length)(parser, vbeg, n);
n 7266 parse.y str_copy(val, vbeg, n);
n 7357 parse.y #define IS_LABEL_SUFFIX(n) (peek_n(':',(n)) && !peek_n(':', (n)+1))
n 7827 parse.y unsigned long n = ruby_scan_digits(tok()+1, toklen()-1, 10, &len, &overflow);
n 7833 parse.y if (overflow || n > nth_ref_max) {
n 7839 parse.y return (int)n;
n 8783 parse.y NODE *n = (rb_node_newnode)(type, a0, a1, a2);
n 8784 parse.y nd_set_line(n, ruby_sourceline);
n 8785 parse.y return n;
n 9683 parse.y NODE **n = &node, *n1 = node;
n 9685 parse.y *n = n1 = n1->nd_body;
n 9693 parse.y NODE **n = &node, *n1 = node;
n 9695 parse.y *n = n1 = n1->nd_body;
n 10997 parse.y #define HEAPCNT(n, size) ((n) * (size) / sizeof(YYSTYPE))
n 10999 parse.y #define ADD2HEAP(n, c, p) ((parser->heap = (n))->u1.node = (p), \
n 11000 parse.y (n)->u3.cnt = (c), (p))
n 11006 parse.y NODE *n = NEWHEAP();
n 11009 parse.y return ADD2HEAP(n, cnt, ptr);
n 11016 parse.y NODE *n = NEWHEAP();
n 11019 parse.y return ADD2HEAP(n, cnt, ptr);
n 11025 parse.y NODE *n;
n 11028 parse.y if (ptr && (n = parser->heap) != NULL) {
n 11030 parse.y if (n->u1.node == ptr) {
n 11031 parse.y n->u1.node = ptr = xrealloc(ptr, size);
n 11032 parse.y if (n->u3.cnt) n->u3.cnt = cnt;
n 11035 parse.y } while ((n = n->u2.node) != NULL);
n 11037 parse.y n = NEWHEAP();
n 11039 parse.y return ADD2HEAP(n, cnt, ptr);
n 11045 parse.y NODE **prev = &parser->heap, *n;
n 11047 parse.y while ((n = *prev) != NULL) {
n 11048 parse.y if (n->u1.node == ptr) {
n 11049 parse.y *prev = n->u2.node;
n 11050 parse.y rb_gc_force_recycle((VALUE)n);
n 11053 parse.y prev = &n->u2.node;
n 1049 proc.c int n = (arity < 0) ? ~arity : arity;
n 1054 proc.c for (; n; --n) {
n 2262 proc.c int n = method_arity(method);
n 2263 proc.c return INT2FIX(n);
n 1512 process.c int i, n=0;
n 1517 process.c n++;
n 2655 process.c return sizeof(struct run_exec_dup2_fd_pair) * n;
n 2724 process.c long n, i;
n 2729 process.c n = RARRAY_LEN(ary);
n 2733 process.c for (i = 0; i < n; i++) {
n 2743 process.c qsort(pairs, n, sizeof(struct run_exec_dup2_fd_pair), intcmp); /* hopefully async-signal-safe */
n 2745 process.c qsort(pairs, n, sizeof(struct run_exec_dup2_fd_pair), intrcmp);
n 2748 process.c for (i = 0; i < n; i++) {
n 2752 process.c found = bsearch(&key, pairs, n, sizeof(struct run_exec_dup2_fd_pair), intcmp); /* hopefully async-signal-safe */
n 2757 process.c while (found < pairs+n && found->oldfd == newfd) {
n 2766 process.c for (i = 0; i < n; i++) {
n 2789 process.c for (i = 0; i < n; i++) {
n 3174 process.c for (i = 0; i < n; i++) {
n 6022 process.c int n, nochdir = FALSE, noclose = FALSE;
n 6030 process.c n = rb_daemon(nochdir, noclose);
n 6031 process.c if (n < 0) rb_sys_fail("daemon");
n 6032 process.c return INT2FIX(n);
n 6045 process.c int n;
n 6064 process.c if (!noclose && (n = rb_cloexec_open("/dev/null", O_RDWR, 0)) != -1) {
n 6065 process.c rb_update_max_fd(n);
n 6066 process.c (void)dup2(n, 0);
n 6067 process.c (void)dup2(n, 1);
n 6068 process.c (void)dup2(n, 2);
n 6069 process.c if (n > 2)
n 6070 process.c (void)close (n);
n 7040 process.c #define DIV(n,d) ((n)<0 ? NDIV((n),(d)) : (n)/(d))
n 549 random.c static int n = 0;
n 563 random.c seed[2] ^= getpid() ^ (n++ << 16);
n 615 random.c long n = NUM2ULONG(size);
n 616 random.c VALUE buf = rb_str_new(0, n);
n 617 random.c if (n == 0) return buf;
n 618 random.c if (fill_random_bytes(RSTRING_PTR(buf), n, FALSE)) return Qnil;
n 901 random.c VALUE len = LONG2NUM(n);
n 906 random.c if (l < n)
n 908 random.c else if (l > n)
n 910 random.c if (p) memcpy(p, RSTRING_PTR(v), n);
n 977 random.c return ULL2NUM((LONG_LONG)n+1);
n 979 random.c if (n >= ULONG_MAX) {
n 980 random.c return rb_big_plus(ULONG2NUM(n), INT2FIX(1));
n 982 random.c return ULONG2NUM(n+1);
n 992 random.c const int n = w > 32 ? sizeof(unsigned long) : sizeof(uint32_t);
n 996 random.c (size_t)n >= sizeof(unsigned long) ? ~0UL :
n 998 random.c ~(~0UL << n * CHAR_BIT);
n 1003 random.c obj_random_bytes(obj, &buf, n);
n 1005 random.c bits = (n == sizeof(uint32_t)) ? buf.u32 : buf.ul;
n 1088 random.c bytes = rb_str_new(0, n);
n 1090 random.c for (; n >= SIZEOF_INT32; n -= SIZEOF_INT32) {
n 1098 random.c if (n > 0) {
n 1103 random.c } while (--n);
n 1113 random.c return obj_random_bytes(obj, NULL, n);
n 1115 random.c return genrand_bytes(rnd, n);
n 841 range.c long n = NUM2LONG(ary[0]);
n 843 range.c if (n <= 0) {
n 847 range.c n--;
n 848 range.c ary[0] = INT2NUM(n);
n 867 range.c VALUE n, ary[2];
n 871 range.c rb_scan_args(argc, argv, "1", &n);
n 872 range.c ary[0] = n;
n 873 range.c ary[1] = rb_ary_new2(NUM2LONG(n));
n 42 rational.c f_##n(VALUE x, VALUE y)\
n 49 rational.c f_##n(VALUE x)\
n 51 rational.c return rb_funcall(x, id_##n, 0);\
n 56 rational.c f_##n(VALUE x, VALUE y)\
n 58 rational.c return rb_funcall(x, id_##n, 1, y);\
n 403 rational.c #define RRATIONAL_SET_NUM(rat, n) RB_OBJ_WRITE((rat), &((struct RRational *)(rat))->num,(n))
n 1279 rational.c VALUE n, b, s;
n 1284 rational.c rb_scan_args(argc, argv, "01", &n);
n 1286 rational.c if (!k_integer_p(n))
n 1289 rational.c b = f_expt10(n);
n 1293 rational.c if (f_lt_p(n, ZERO))
n 1306 rational.c if (f_lt_p(n, ONE))
n 1580 rational.c VALUE n;
n 1583 rational.c n = rb_hash(dat->num);
n 1584 rational.c h[0] = NUM2LONG(n);
n 1585 rational.c n = rb_hash(dat->den);
n 1586 rational.c h[1] = NUM2LONG(n);
n 1971 rational.c int n;
n 1973 rational.c f = frexp(RFLOAT_VALUE(self), &n);
n 1975 rational.c n -= DBL_MANT_DIG;
n 1977 rational.c *rn = INT2FIX(n);
n 1984 rational.c VALUE f, n;
n 1986 rational.c float_decode_internal(self, &f, &n);
n 1987 rational.c return rb_assoc_new(f, n);
n 1992 rational.c #define f_lshift(x,n) rb_funcall((x), id_lshift, 1, (n))
n 2013 rational.c VALUE f, n;
n 2015 rational.c float_decode_internal(self, &f, &n);
n 2018 rational.c long ln = FIX2LONG(n);
n 2023 rational.c return f_to_r(f_lshift(f, n));
n 2028 rational.c return f_to_r(f_mul(f, f_expt(INT2FIX(FLT_RADIX), n)));
n 2051 rational.c VALUE a, b, f, n, p, q;
n 2053 rational.c float_decode_internal(flt, &f, &n);
n 2054 rational.c if (f_zero_p(f) || f_positive_p(n))
n 2055 rational.c return rb_rational_new1(f_lshift(f, n));
n 2062 rational.c den = f_lshift(ONE, f_sub(ONE, n));
n 2072 rational.c den = f_expt(INT2FIX(FLT_RADIX), f_sub(ONE, n));
n 105 re.c if (y = memmem(ys, n, xs, m))
n 115 re.c const unsigned char *y = ys, *ye = ys + n;
n 128 re.c if (!(y = memchr(y, *x, n - m + 1)))
n 164 re.c for (; y + m <= ys + n; y += *(qstable + y[m])) {
n 218 re.c for (; y + m <= ys + n; y += qstable[rb_memsearch_qs_utf8_hash(y+m)]) {
n 231 re.c for (n -= m; n >= 0; n -= char_size, y += char_size) {
n 244 re.c for (n -= m; n >= 0; n -= char_size, y += char_size) {
n 256 re.c if (m > n) return -1;
n 257 re.c else if (m == n) {
n 264 re.c const unsigned char *ys = memchr(y, *x, n);
n 273 re.c return rb_memsearch_ss(x0, m, y0, n);
n 276 re.c return rb_memsearch_qs_utf8(x0, m, y0, n);
n 280 re.c return rb_memsearch_wchar(x0, m, y0, n);
n 283 re.c return rb_memsearch_qchar(x0, m, y0, n);
n 285 re.c return rb_memsearch_qs(x0, m, y0, n);
n 410 re.c int n = clen + mbclen(p+clen, pend, enc);
n 411 re.c rb_str_buf_cat(str, p, n);
n 412 re.c p += n;
n 637 re.c ptrdiff_t n;
n 646 re.c n = e - s;
n 647 re.c paren = ALLOCA_N(char, n);
n 648 re.c memcpy(paren, s, n);
n 649 re.c rb_str_resize(str, RSTRING_LEN(str) - n);
n 652 re.c rb_str_buf_cat(str, paren, n);
n 1176 re.c int i = match_backref_number(match, n);
n 1212 re.c int i = match_backref_number(match, n);
n 1247 re.c int i = match_backref_number(match, n);
n 3398 re.c int n = mbclen(s, send, enc);
n 3400 re.c while (n--)
n 3726 re.c VALUE n = rb_str_subseq(str, (long)(name - RSTRING_PTR(str)),
n 3728 re.c if (!rb_enc_compatible(RREGEXP_SRC(regexp), n) ||
n 3730 re.c name_to_backref_error(n);
n 3866 re.c int n;
n 3868 re.c n = match_backref_number(match, nth);
n 3869 re.c return rb_reg_nth_match(n, match);
n 140 regcomp.c int i, n;
n 142 regcomp.c n = 0;
n 144 regcomp.c if (BITSET_AT(bs, i)) n++;
n 146 regcomp.c return n;
n 223 regcomp.c StateCheckNumType n = (StateCheckNumType )num;
n 225 regcomp.c BBUF_ADD(reg, &n, SIZE_STATE_CHECK_NUM);
n 260 regcomp.c MemNumType n = (MemNumType )num;
n 262 regcomp.c BBUF_ADD(reg, &n, SIZE_MEMNUM);
n 424 regcomp.c for (i = 0; i < n; i++) {
n 676 regcomp.c int n;
n 677 regcomp.c n = reg->repeat_range_alloc + REPEAT_RANGE_ALLOC;
n 679 regcomp.c sizeof(OnigRepeatRange) * n);
n 682 regcomp.c reg->repeat_range_alloc = n;
n 1144 regcomp.c int n = qn->upper - qn->lower;
n 1149 regcomp.c for (i = 0; i < n; i++) {
n 1151 regcomp.c (n - i) * tlen + (n - i - 1) * SIZE_OP_PUSH);
n 1526 regcomp.c int n;
n 1530 regcomp.c r = get_char_length_tree(node->target, reg, &n);
n 1534 regcomp.c n = node->char_len;
n 1535 regcomp.c r = add_length(reg, n);
n 1543 regcomp.c int n;
n 1549 regcomp.c r = get_char_length_tree(node->target, reg, &n);
n 1553 regcomp.c n = node->char_len;
n 1554 regcomp.c r = add_length(reg, n);
n 1589 regcomp.c int n = 0;
n 1595 regcomp.c n++;
n 1598 regcomp.c r += (SIZE_OP_PUSH + SIZE_OP_JUMP) * (n - 1);
n 1668 regcomp.c int n, type, len, pos, r = 0;
n 1766 regcomp.c n = br->back_static[0];
n 1770 regcomp.c r = add_mem_num(reg, n);
n 1773 regcomp.c switch (n) {
n 1779 regcomp.c r = add_mem_num(reg, n);
n 1911 regcomp.c int i, pos, n, old_num;
n 1925 regcomp.c n = map[backs[i]].new_val;
n 1926 regcomp.c if (n > 0) {
n 1927 regcomp.c backs[pos] = n;
n 2722 regcomp.c Node* n = NULL_NODE;
n 2736 regcomp.c n = node;
n 2741 regcomp.c n = get_head_value_node(NCAR(node), exact, reg);
n 2755 regcomp.c n = node;
n 2765 regcomp.c n = qn->head_exact;
n 2767 regcomp.c n = get_head_value_node(qn->target, exact, reg);
n 2781 regcomp.c n = get_head_value_node(NENCLOSE(node)->target, exact, reg);
n 2789 regcomp.c n = get_head_value_node(en->target, exact, reg);
n 2797 regcomp.c n = get_head_value_node(NANCHOR(node)->target, exact, reg);
n 2804 regcomp.c return n;
n 3195 regcomp.c int n = onig_name_to_group_numbers(env->reg, cn->name, cn->name_end,
n 3197 regcomp.c if (n <= 0) {
n 3202 regcomp.c else if (n > 1 &&
n 3306 regcomp.c Node* n = get_head_value_node(next_node, 1, reg);
n 3308 regcomp.c if (IS_NOT_NULL(n) && NSTR(n)->s[0] != '\0') {
n 3309 regcomp.c qn->next_head_exact = n;
n 3567 regcomp.c int r, n, len, alt_num;
n 3585 regcomp.c n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(reg->enc, reg->case_fold_flag,
n 3587 regcomp.c if (n < 0) {
n 3588 regcomp.c r = n;
n 3594 regcomp.c varlen = is_case_fold_variable_len(n, items, len);
n 3595 regcomp.c if (n == 0 || varlen == 0) {
n 3619 regcomp.c alt_num *= (n + 1);
n 3636 regcomp.c r = expand_case_fold_string_alt(n, items, p, len, end, reg, &prev_node);
n 3986 regcomp.c int i, n = qn->lower;
n 3995 regcomp.c for (i = 1; i < n && (i+1) * len <= EXPAND_STRING_MAX_LENGTH; i++) {
n 4174 regcomp.c int clen, flen, n, j, k;
n 4183 regcomp.c n = 0;
n 4187 regcomp.c n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(enc, reg->case_fold_flag,
n 4191 regcomp.c for (j = 0; j < n; j++) {
n 4200 regcomp.c for (k = 0; k < n; k++) {
n 4213 regcomp.c n = 0;
n 4217 regcomp.c n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(enc, reg->case_fold_flag,
n 4221 regcomp.c for (j = 0; j < n; j++) {
n 4230 regcomp.c for (k = 0; k < n; k++) {
n 4247 regcomp.c int clen, flen, n, j, k;
n 4256 regcomp.c n = 0;
n 4260 regcomp.c n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(enc, reg->case_fold_flag,
n 4264 regcomp.c for (j = 0; j < n; j++) {
n 4273 regcomp.c for (k = 0; k < n; k++) {
n 4286 regcomp.c n = 0;
n 4290 regcomp.c n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(enc, reg->case_fold_flag,
n 4294 regcomp.c for (j = 0; j < n; j++) {
n 4303 regcomp.c for (k = 0; k < n; k++) {
n 4754 regcomp.c int i, n;
n 4759 regcomp.c n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(enc, case_fold_flag, p, end, items);
n 4760 regcomp.c if (n < 0) return n;
n 4762 regcomp.c for (i = 0; i < n; i++) {
n 4990 regcomp.c int n = onigenc_strlen(env->enc, sn->s, sn->end);
n 4991 regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc) * n;
n 5563 regcomp.c int c, i, n = 0;
n 5566 regcomp.c if (reg->map[i]) n++;
n 5568 regcomp.c fprintf(f, "map: n=%d\n", n);
n 5569 regcomp.c if (n > 0) {
n 6082 regcomp.c OnigCodePoint n, *data;
n 6085 regcomp.c GET_CODE_POINT(n, p);
n 6089 regcomp.c for (low = 0, high = n; low < high; ) {
n 6097 regcomp.c return ((low < n && code >= data[low * 2]) ? 1 : 0);
n 6305 regcomp.c int i, n, arg_type;
n 6395 regcomp.c n = len * mb_len;
n 6396 regcomp.c while (n-- > 0) { fputc(*bp++, f); }
n 6412 regcomp.c n = bitset_on_num((BitSetRef )bp);
n 6414 regcomp.c fprintf(f, ":%d", n);
n 6418 regcomp.c n = bitset_on_num((BitSetRef )bp);
n 6420 regcomp.c fprintf(f, ":%d", n);
n 6437 regcomp.c n = bitset_on_num((BitSetRef )bp);
n 6446 regcomp.c fprintf(f, ":%d:%d:%d", n, (int )code, len);
n 6454 regcomp.c n = bitset_on_num(cc->bs);
n 6455 regcomp.c fprintf(f, ":%"PRIuPTR":%d", (uintptr_t )cc, n);
n 103 regenc.c while (ONIG_IS_NOT_NULL(s) && n-- > 0) {
n 116 regenc.c while (n-- > 0) {
n 125 regenc.c int n = 0;
n 130 regenc.c n++;
n 132 regenc.c return n;
n 138 regenc.c int n = 0;
n 147 regenc.c if (len == 1) return n;
n 154 regenc.c if (len == 1) return n;
n 158 regenc.c n++;
n 679 regenc.c OnigCodePoint n;
n 682 regenc.c n = (OnigCodePoint )(*p++);
n 683 regenc.c if (len == 1) return n;
n 688 regenc.c n <<= 8; n += c;
n 690 regenc.c return n;
n 861 regenc.c while (n-- > 0) {
n 880 regenc.c while (n-- > 0) {
n 220 regenc.h #define OnigEncodingName(n) encoding_##n
n 221 regenc.h #define OnigEncodingDeclare(n) static const OnigEncodingType OnigEncodingName(n)
n 223 regenc.h OnigEncodingDeclare(n); \
n 225 regenc.h ONIG_ENC_REGISTER(OnigEncodingName(n).name, \
n 226 regenc.h &OnigEncodingName(n)); \
n 228 regenc.h OnigEncodingDeclare(n)
n 230 regenc.h #define OnigEncodingName(n) OnigEncoding##n
n 231 regenc.h #define OnigEncodingDeclare(n) const OnigEncodingType OnigEncodingName(n)
n 232 regenc.h #define OnigEncodingDefine(f,n) OnigEncodingDeclare(n)
n 331 regerror.c int n, len;
n 335 regerror.c n = xvsnprintf((char* )buf, bufsize, (const char* )fmt, args);
n 339 regerror.c if (n + need < (size_t )bufsize) {
n 162 regexec.c int n, i;
n 165 regexec.c n = HISTORY_TREE_INIT_ALLOC_SIZE;
n 167 regexec.c (OnigCaptureTreeNode** )xmalloc(sizeof(OnigCaptureTreeNode*) * n);
n 172 regexec.c n = parent->allocated * 2;
n 175 regexec.c sizeof(OnigCaptureTreeNode*) * n);
n 182 regexec.c for (i = parent->allocated; i < n; i++) {
n 185 regexec.c parent->allocated = n;
n 244 regexec.c region->num_regs = n;
n 246 regexec.c if (n < ONIG_NREGION)
n 247 regexec.c n = ONIG_NREGION;
n 250 regexec.c region->beg = (OnigPosition* )xmalloc(n * sizeof(OnigPosition));
n 254 regexec.c region->end = (OnigPosition* )xmalloc(n * sizeof(OnigPosition));
n 260 regexec.c region->allocated = n;
n 262 regexec.c else if (region->allocated < n) {
n 266 regexec.c tmp = (OnigPosition* )xrealloc(region->beg, n * sizeof(OnigPosition));
n 273 regexec.c tmp = (OnigPosition* )xrealloc(region->end, n * sizeof(OnigPosition));
n 281 regexec.c region->allocated = n;
n 292 regexec.c r = onig_region_resize(region, n);
n 529 regexec.c size_t n;
n 536 regexec.c n = stk_end - stk_base;
n 538 regexec.c x = (OnigStackType* )xmalloc(sizeof(OnigStackType) * n * 2);
n 543 regexec.c xmemcpy(x, stk_base, n * sizeof(OnigStackType));
n 544 regexec.c n *= 2;
n 548 regexec.c n *= 2;
n 549 regexec.c if (limit_size != 0 && n > limit_size) {
n 553 regexec.c n = limit_size;
n 555 regexec.c x = (OnigStackType* )xrealloc(stk_base, sizeof(OnigStackType) * n);
n 563 regexec.c *arg_stk_end = x + n;
n 568 regexec.c if (stk_end - stk < (n)) {\
n 1131 regexec.c #define DATA_ENSURE_CHECK(n) (s + (n) <= right_range)
n 1132 regexec.c #define DATA_ENSURE(n) if (s + (n) > right_range) goto fail
n 1135 regexec.c #define DATA_ENSURE_CHECK(n) (s + (n) <= end)
n 1136 regexec.c #define DATA_ENSURE(n) if (s + (n) > end) goto fail
n 1145 regexec.c int n, r;
n 1151 regexec.c n = k->u.mem.num;
n 1152 regexec.c if (n <= ONIG_MAX_CAPTURE_HISTORY_GROUP &&
n 1153 regexec.c BIT_STATUS_AT(reg->capture_history, n) != 0) {
n 1156 regexec.c child->group = n;
n 1356 regexec.c ptrdiff_t n, best_len;
n 1567 regexec.c n = reg->num_repeat + (reg->num_mem + 1) * 2;
n 1569 regexec.c STACK_INIT(alloca_base, xmalloc_base, n, INIT_MATCH_STACK_SIZE);
n 1578 regexec.c n = reg->num_repeat + reg->num_mem * 2;
n 1580 regexec.c STACK_INIT(alloca_base, xmalloc_base, n, INIT_MATCH_STACK_SIZE);
n 1594 regexec.c for (; pp < (repeat_stk + n); pp+=2) {
n 1643 regexec.c n = s - sstart;
n 1644 regexec.c if (n > best_len) {
n 1648 regexec.c if (n > msa->best_len) {
n 1649 regexec.c msa->best_len = n;
n 1656 regexec.c best_len = n;
n 2101 regexec.c n = enclen(encode, s, end);
n 2102 regexec.c DATA_ENSURE(n);
n 2104 regexec.c s += n;
n 2110 regexec.c n = enclen(encode, s, end);
n 2111 regexec.c DATA_ENSURE(n);
n 2112 regexec.c s += n;
n 2119 regexec.c n = enclen(encode, s, end);
n 2120 regexec.c DATA_ENSURE(n);
n 2123 regexec.c s += n;
n 2131 regexec.c n = enclen(encode, s, end);
n 2132 regexec.c if (n > 1) {
n 2133 regexec.c DATA_ENSURE(n);
n 2135 regexec.c s += n;
n 2150 regexec.c n = enclen(encode, s, end);
n 2151 regexec.c DATA_ENSURE(n);
n 2154 regexec.c s += n;
n 2165 regexec.c n = enclen(encode, s, end);
n 2166 regexec.c if (n > 1) {
n 2167 regexec.c DATA_ENSURE(n);
n 2169 regexec.c s += n;
n 2188 regexec.c n = enclen(encode, s, end);
n 2189 regexec.c DATA_ENSURE(n);
n 2192 regexec.c s += n;
n 2206 regexec.c n = enclen(encode, s, end);
n 2207 regexec.c if (n > 1) {
n 2208 regexec.c DATA_ENSURE(n);
n 2210 regexec.c s += n;
n 2551 regexec.c n = pend - pstart;
n 2552 regexec.c DATA_ENSURE(n);
n 2554 regexec.c STRING_CMP(pstart, s, n);
n 2582 regexec.c n = pend - pstart;
n 2583 regexec.c DATA_ENSURE(n);
n 2585 regexec.c STRING_CMP_IC(case_fold_flag, pstart, &s, (int)n, end);
n 2614 regexec.c n = pend - pstart;
n 2615 regexec.c DATA_ENSURE(n);
n 2618 regexec.c STRING_CMP_VALUE(pstart, swork, n, is_fail);
n 2653 regexec.c n = pend - pstart;
n 2654 regexec.c DATA_ENSURE(n);
n 2657 regexec.c STRING_CMP_VALUE_IC(case_fold_flag, pstart, &swork, n, end, is_fail);
n 3129 regexec.c int n = enc->max_enc_len;
n 3138 regexec.c s += n;
n 3768 regexec.c int n;
n 3771 regexec.c n = 0;
n 3773 regexec.c if (++n > THREAD_PASS_LIMIT_COUNT)
n 4080 regexec.c int n;
n 4083 regexec.c n = 0;
n 4085 regexec.c if (++n > THREAD_PASS_LIMIT_COUNT)
n 4495 regexec.c int i, n;
n 4497 regexec.c n = 0;
n 4500 regexec.c n++;
n 4502 regexec.c return n;
n 403 regint.h ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1))
n 406 regint.h if ((n) < (int )BIT_STATUS_BITS_NUM)\
n 407 regint.h (stats) |= (1 << (n));\
n 413 regint.h if ((n) < (int )BIT_STATUS_BITS_NUM)\
n 414 regint.h (stats) |= (1 << (n));\
n 455 regint.h #define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE)
n 524 regint.h int used = (pos) + (int )(n);\
n 526 regint.h xmemcpy((buf)->p + (pos), (bytes), (n));\
n 537 regint.h #define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n))
n 544 regint.h if ((unsigned int )((to)+(n)) > (buf)->alloc) BBUF_EXPAND((buf),(to) + (n));\
n 545 regint.h xmemmove((buf)->p + (to), (buf)->p + (from), (n));\
n 546 regint.h if ((unsigned int )((to)+(n)) > (buf)->used) (buf)->used = (to) + (n);\
n 551 regint.h xmemmove((buf)->p + (to), (buf)->p + (from), (n));\
n 562 regint.h BBUF_WRITE(buf,pos,bytes,n);\
n 565 regint.h BBUF_MOVE_RIGHT((buf),(pos),(pos) + (n),((buf)->used - (pos)));\
n 566 regint.h xmemcpy((buf)->p + (pos), (bytes), (n));\
n 224 regparse.c while (n-- > 0) {
n 881 regparse.c int i, n, *nums;
n 883 regparse.c n = onig_name_to_group_numbers(reg, name, name_end, &nums);
n 884 regparse.c if (n < 0)
n 885 regparse.c return n;
n 886 regparse.c else if (n == 0)
n 888 regparse.c else if (n == 1)
n 892 regparse.c for (i = n - 1; i >= 0; i--) {
n 897 regparse.c return nums[n - 1];
n 1058 regparse.c FreeNode* n = (FreeNode* )node;
n 1061 regparse.c n->next = FreeNodeList;
n 1062 regparse.c FreeNodeList = n;
n 1106 regparse.c FreeNode* n = (FreeNode* )node;
n 1109 regparse.c n->next = FreeNodeList;
n 1110 regparse.c FreeNodeList = n;
n 1122 regparse.c FreeNode* n;
n 1126 regparse.c n = FreeNodeList;
n 1128 regparse.c xfree(n);
n 1218 regparse.c int n, i;
n 1230 regparse.c n = ONIGENC_CODE_RANGE_NUM(ranges);
n 1231 regparse.c for (i = 0; i < n; i++) {
n 1249 regparse.c n = ONIGENC_CODE_RANGE_NUM(ranges);
n 1250 regparse.c if (n == 0) goto is_null;
n 1254 regparse.c bbuf->alloc = n + 1;
n 1255 regparse.c bbuf->used = n + 1;
n 1309 regparse.c Node *n;
n 1311 regparse.c n = onig_node_new_list(x, NULL);
n 1312 regparse.c if (IS_NULL(n)) return NULL_NODE;
n 1318 regparse.c NCDR(list) = n;
n 1321 regparse.c return n;
n 1627 regparse.c Node* n = NULL_NODE;
n 1632 regparse.c n = node_new_str(p, sn->end);
n 1633 regparse.c if (IS_NOT_NULL(n) && (sn->flag & NSTR_RAW) != 0)
n 1634 regparse.c NSTRING_SET_RAW(n);
n 1638 regparse.c return n;
n 1768 regparse.c OnigCodePoint n;
n 1776 regparse.c n = 0;
n 1777 regparse.c BBUF_WRITE_CODE_POINT(bbuf, 0, n);
n 1787 regparse.c OnigCodePoint n, *data;
n 1791 regparse.c n = from; from = to; to = n;
n 1798 regparse.c n = 0;
n 1802 regparse.c GET_CODE_POINT(n, bbuf->p);
n 1807 regparse.c bound = (from == 0) ? 0 : n;
n 1816 regparse.c high = (to == ONIG_LAST_CODE_POINT) ? n : low;
n 1817 regparse.c for (bound = n; high < bound; ) {
n 1829 regparse.c if (n + inc_n > ONIG_MAX_MULTI_BYTE_RANGES_NUM)
n 1847 regparse.c if (high < n) {
n 1848 regparse.c int size = (n - high) * 2 * SIZE_CODE_POINT;
n 1861 regparse.c n += inc_n;
n 1862 regparse.c BBUF_WRITE_CODE_POINT(bbuf, 0, n);
n 1895 regparse.c int r, i, n;
n 1905 regparse.c GET_CODE_POINT(n, data);
n 1907 regparse.c if (n <= 0) goto set_all;
n 1911 regparse.c for (i = 0; i < n; i++) {
n 1998 regparse.c for (i = 0; i < n; i++) {
n 3014 regparse.c for (i = 1; i < n && q < to; i++) {
n 3019 regparse.c if (i >= n) {
n 3049 regparse.c for (i = 1; i < n && q < to; i++) {
n 3054 regparse.c if (i >= n) return 1;
n 4097 regparse.c int n = ONIGENC_CODE_RANGE_NUM(mbr);
n 4100 regparse.c for (i = 0; i < n; i++) {
n 4118 regparse.c for ( ; i < n; i++) {
n 4128 regparse.c for (i = 0; i < n; i++) {
n 4145 regparse.c for (i = 0; i < n; i++) {
n 5416 regparse.c Node* n = str_node_split_last_char(sn, env->enc);
n 5417 regparse.c if (IS_NOT_NULL(n)) {
n 5418 regparse.c qn->target = n;
n 5889 regparse.c OnigCodePoint n, *data;
n 5890 regparse.c GET_CODE_POINT(n, bbuf->p);
n 5892 regparse.c if ((n == 1) && (data[0] == data[1])) {
n 22 ruby-runner.c size_t n = strlen(libpath);
n 23 ruby-runner.c char *e = malloc(sizeof(builddir)+n+1);
n 26 ruby-runner.c memcpy(e+sizeof(builddir), libpath, n+1);
n 655 ruby.c long n;
n 659 ruby.c n = RARRAY_LEN(argv);
n 661 ruby.c while (n > 0) {
n 669 ruby.c n--;
n 707 ruby.c n = RARRAY_LEN(argv) - n;
n 708 ruby.c while (n--) {
n 898 ruby.c long n, argc0 = argc;
n 1179 ruby.c (strncmp((name), s, n = sizeof(name) - 1) == 0 && is_option_end(s[n], (allow_hyphen)) ? \
n 1180 ruby.c (check_envopt(name, (allow_envopt)), s += n, \
n 34 signal.c # define VALGRIND_MAKE_MEM_DEFINED(p, n) VALGRIND_MAKE_READABLE((p), (n))
n 37 signal.c # define VALGRIND_MAKE_MEM_UNDEFINED(p, n) VALGRIND_MAKE_WRITABLE((p), (n))
n 210 siphash.c for (i = 0; i < n; i++) {
n 430 siphash.c #define OR_BYTE(n) (last |= ((uint64_t) end[n]) << ((n) * 8))
n 435 siphash.c if (n >= 4) \
n 436 siphash.c last.hi |= ((uint32_t) end[n]) << ((n) >= 4 ? (n) * 8 - 32 : 0); \
n 438 siphash.c last.lo |= ((uint32_t) end[n]) << ((n) >= 4 ? 0 : (n) * 8); \
n 94 sprintf.c check_pos_arg(posarg, (n)), \
n 95 sprintf.c (posarg = -1, GETNTHARG(n)))
n 105 sprintf.c (!(p = get_num(p, end, enc, &(n))) ? \
n 110 sprintf.c n = 0; \
n 111 sprintf.c GETNUM(n, val); \
n 113 sprintf.c tmp = GETPOSARG(n); \
n 156 sprintf.c rb_raise(rb_eArgError, "numbered(%d) after unnumbered(%d)", n, posarg);
n 159 sprintf.c rb_raise(rb_eArgError, "numbered(%d) after named", n);
n 161 sprintf.c if (n < 1) {
n 162 sprintf.c rb_raise(rb_eArgError, "invalid index - %d$", n);
n 514 sprintf.c int n;
n 572 sprintf.c n = 0;
n 573 sprintf.c GETNUM(n, width);
n 576 sprintf.c rb_raise(rb_eArgError, "value given twice - %d$", n);
n 578 sprintf.c nextvalue = GETPOSARG(n);
n 583 sprintf.c width = n;
n 682 sprintf.c int n;
n 689 sprintf.c c = rb_enc_codepoint_len(RSTRING_PTR(tmp), RSTRING_END(tmp), &n, enc);
n 694 sprintf.c n = rb_enc_codelen(c, enc);
n 696 sprintf.c if (n <= 0) {
n 700 sprintf.c CHECK(n);
n 702 sprintf.c blen += n;
n 705 sprintf.c CHECK(n);
n 707 sprintf.c blen += n;
n 712 sprintf.c CHECK(n);
n 714 sprintf.c blen += n;
n 1061 sprintf.c long n = -FIX2LONG(num);
n 1062 sprintf.c num = LONG2FIX(n);
n 1274 sprintf.c if ((int)n < 1)
n 1278 sprintf.c f._bf._size = f._w = n - 1;
n 1292 sprintf.c if ((int)n < 1)
n 1296 sprintf.c ret = ruby_vsnprintf(str, n, fmt, ap);
n 1312 sprintf.c size_t len, n;
n 1324 sprintf.c MEMCPY(buf, iov->iov_base, char, n = iov->iov_len);
n 1325 sprintf.c buf += n;
n 1326 sprintf.c len -= n;
n 92 st.c #define hash_pos(h,n) ((h) & (n - 1))
n 161 st.c st_index_t n;
n 166 st.c n = next_pow2(size);
n 167 st.c if (n > size)
n 168 st.c return n;
n 1458 st.c #define data_at(n) (st_index_t)((unsigned char)data[(n)])
n 1480 st.c # define UNALIGNED_ADD(n) case SIZEOF_ST_INDEX_T - (n) - 1: \
n 1481 st.c t |= data_at(n) << CHAR_BIT*(SIZEOF_ST_INDEX_T - (n) - 2)
n 1483 st.c # define UNALIGNED_ADD(n) case SIZEOF_ST_INDEX_T - (n) - 1: \
n 1484 st.c t |= data_at(n) << CHAR_BIT*(n)
n 1519 st.c # define UNALIGNED_ADD(n) case (n) + 1: \
n 1520 st.c d |= data_at(n) << CHAR_BIT*(SIZEOF_ST_INDEX_T - (n) - 1)
n 1522 st.c # define UNALIGNED_ADD(n) case (n) + 1: \
n 1523 st.c d |= data_at(n) << CHAR_BIT*(n)
n 1555 st.c # define UNALIGNED_ADD(n) case (n) + 1: \
n 1556 st.c t |= data_at(n) << CHAR_BIT*(SIZEOF_ST_INDEX_T - (n) - 1)
n 1558 st.c # define UNALIGNED_ADD(n) case (n) + 1: \
n 1559 st.c t |= data_at(n) << CHAR_BIT*(n)
n 1666 st.c while (n--) {
n 1717 st.c return (st_index_t)((n>>s1|(n<<s2)) ^ (n>>s2));
n 161 strftime.c #define BIT_OF(n) (1U<<(n))
n 168 strftime.c size_t nlen = len + n * 2;
n 281 strftime.c if (s >= endp || (n) >= endp - s - 1) { \
n 282 strftime.c s = resize_buffer(ftime, s, &start, &endp, (n), maxsize); \
n 801 strftime.c long n;
n 808 strftime.c n = 1;
n 810 strftime.c n *= 10;
n 811 strftime.c if (n != 1)
n 812 strftime.c subsec = mul(subsec, INT2FIX(n));
n 869 strftime.c size_t n;
n 871 strftime.c unsigned long u = ruby_scan_digits(format, format_end-format, 10, &n, &ov);
n 874 strftime.c format += n - 1;
n 90 string.c long tmp_n = (n);\
n 97 string.c STR_SET_EMBED_LEN((str), (n));\
n 100 string.c RSTRING(str)->as.heap.len = (n);\
n 106 string.c long n = RSTRING_LEN(str);\
n 107 string.c n--;\
n 108 string.c STR_SET_EMBED_LEN((str), n);\
n 1401 string.c int n;
n 1408 string.c n = rb_scan_args(argc, argv, "01:", &orig, &opt);
n 1424 string.c if (n == 1) {
n 1430 string.c if (orig == str) n = 0;
n 1441 string.c if (n == 1) {
n 1448 string.c else if (n == 1) {
n 1456 string.c else if (n == 1) {
n 1652 string.c long n = rb_enc_strlen_cr(p, e, enc, &cr);
n 1654 string.c return n;
n 1767 string.c long n, len;
n 1793 string.c n = RSTRING_LEN(str);
n 1794 string.c memcpy(ptr2, RSTRING_PTR(str), n);
n 1795 string.c while (n <= len/2) {
n 1796 string.c memcpy(ptr2 + n, ptr2, n);
n 1797 string.c n *= 2;
n 1799 string.c memcpy(ptr2 + n, ptr2, len-n);
n 1990 string.c for (; n > 0; --n) {
n 2095 string.c int n;
n 2113 string.c n = rb_enc_mbclen(p, e, enc);
n 2114 string.c p += n;
n 3874 string.c int n, ascii;
n 3930 string.c n = rb_str_cmp(beg, end);
n 3931 string.c if (n > 0 || (excl && n == 0)) return beg;
n 5031 string.c long n = RSTRING_LEN(str);
n 5034 string.c if (beg > n || len < 0) return Qnil;
n 5036 string.c beg += n;
n 5039 string.c if (beg + len > n)
n 5040 string.c len = n - beg;
n 5049 string.c if (len > RSTRING_EMBED_LEN_MAX && SHARABLE_SUBSTRING_P(beg, len, n)) {
n 5348 string.c int n = rb_enc_codelen(c, enc);
n 5351 string.c rb_enc_str_buf_cat(str, s, n, enc);
n 5405 string.c int n = rb_enc_precise_mbclen(p, pend, enc);
n 5406 string.c if (!MBCLEN_CHARFOUND_P(n)) {
n 5408 string.c n = rb_enc_mbminlen(enc);
n 5409 string.c if (pend < p + n)
n 5410 string.c n = (int)(pend - p);
n 5411 string.c while (n--) {
n 5418 string.c n = MBCLEN_CHARFOUND_LEN(n);
n 5420 string.c p += n;
n 5433 string.c if (p - n > prev) str_buf_cat(result, prev, p - n - prev);
n 5442 string.c if (p - n > prev) str_buf_cat(result, prev, p - n - prev);
n 5492 string.c int n;
n 5494 string.c n = rb_enc_precise_mbclen(p, pend, enc);
n 5495 string.c if (!MBCLEN_CHARFOUND_P(n)) {
n 5497 string.c n = rb_enc_mbminlen(enc);
n 5498 string.c if (pend < p + n)
n 5499 string.c n = (int)(pend - p);
n 5500 string.c while (n--) {
n 5507 string.c n = MBCLEN_CHARFOUND_LEN(n);
n 5509 string.c p += n;
n 5517 string.c if (p - n > prev) str_buf_cat(result, prev, p - n - prev);
n 5520 string.c prev = p - n;
n 5536 string.c if (p - n > prev) str_buf_cat(result, prev, p - n - prev);
n 5548 string.c if (p - n > prev) str_buf_cat(result, prev, p - n - prev);
n 5607 string.c int n = rb_enc_precise_mbclen(p-1, pend, enc);
n 5608 string.c if (MBCLEN_CHARFOUND_P(n)) {
n 5612 string.c p += MBCLEN_CHARFOUND_LEN(n)-1;
n 5680 string.c int n = rb_enc_precise_mbclen(p-1, pend, enc) - 1;
n 5681 string.c if (MBCLEN_CHARFOUND_P(n)) {
n 5683 string.c p += n;
n 6154 string.c int n;
n 6160 string.c if (rb_enc_ascget(t->p, t->pend, &n, enc) == '\\' && t->p + n < t->pend) {
n 6161 string.c t->p += n;
n 6163 string.c t->now = rb_enc_codepoint_len(t->p, t->pend, &n, enc);
n 6164 string.c t->p += n;
n 6165 string.c if (rb_enc_ascget(t->p, t->pend, &n, enc) == '-' && t->p + n < t->pend) {
n 6166 string.c t->p += n;
n 6168 string.c unsigned int c = rb_enc_codepoint_len(t->p, t->pend, &n, enc);
n 6169 string.c t->p += n;
n 6884 string.c int n = 0;
n 6892 string.c if (*(unsigned char*)s++ == c) n++;
n 6894 string.c return INT2NUM(n);
n 7093 string.c int n;
n 7095 string.c c = rb_enc_codepoint_len(ptr, eptr, &n, enc);
n 7096 string.c ptr += n;
n 7482 string.c long i, len, n;
n 7511 string.c for (i = 0; i < len; i += n) {
n 7512 string.c n = rb_enc_fast_mbclen(ptr + i, ptr + len, enc);
n 7513 string.c substr = rb_str_subseq(str, i, n);
n 7521 string.c for (i = 0; i < len; i += n) {
n 7522 string.c n = rb_enc_mbclen(ptr + i, ptr + len, enc);
n 7523 string.c substr = rb_str_subseq(str, i, n);
n 7580 string.c int n;
n 7613 string.c c = rb_enc_codepoint_len(ptr, end, &n, enc);
n 7618 string.c ptr += n;
n 7920 string.c int n;
n 7921 string.c unsigned int cc = rb_enc_codepoint_len(s, e, &n, enc);
n 7924 string.c s += n;
n 8467 string.c long n, size, llen, rlen, llen2 = 0, rlen2 = 0;
n 8487 string.c n = width - len;
n 8488 string.c llen = (jflag == 'l') ? 0 : ((jflag == 'r') ? n : n/2);
n 8489 string.c rlen = n - llen;
n 9258 string.c int n;
n 9262 string.c n = MBCLEN_CHARFOUND_LEN(c);
n 9265 string.c s += n;
n 548 struct.c long i, n;
n 551 struct.c n = num_members(klass);
n 552 struct.c if (n < argc) {
n 558 struct.c if (n > argc) {
n 559 struct.c rb_mem_clear((VALUE *)RSTRUCT_CONST_PTR(self)+argc, n-argc);
n 573 struct.c long n;
n 576 struct.c n = num_members(klass);
n 578 struct.c if (0 < n && n <= RSTRUCT_EMBED_LEN_MAX) {
n 580 struct.c RBASIC(st)->flags |= n << RSTRUCT_EMBED_LEN_SHIFT;
n 581 struct.c rb_mem_clear((VALUE *)st->as.ary, n);
n 584 struct.c st->as.heap.ptr = ALLOC_N(VALUE, n);
n 585 struct.c rb_mem_clear((VALUE *)st->as.heap.ptr, n);
n 586 struct.c st->as.heap.len = n;
n 949 struct.c return rb_struct_aref(s, LONG2NUM(n));
n 1062 struct.c VALUE n;
n 1069 struct.c n = rb_hash(ptr[i]);
n 1070 struct.c h = rb_hash_uint(h, NUM2LONG(n));
n 3474 thread.c size_t m = howmany(n + 1, NFDBITS) * sizeof(fd_mask);
n 3484 thread.c if (n >= fds->maxfd) fds->maxfd = n + 1;
n 3490 thread.c rb_fd_resize(n, fds);
n 3491 thread.c FD_SET(n, fds->fdset);
n 3497 thread.c if (n >= fds->maxfd) return;
n 3498 thread.c FD_CLR(n, fds->fdset);
n 3504 thread.c if (n >= fds->maxfd) return 0;
n 3505 thread.c return FD_ISSET(n, fds->fdset) != 0; /* "!= 0" avoids FreeBSD PR 91421 */
n 3541 thread.c rb_fd_resize(n - 1, readfds);
n 3545 thread.c rb_fd_resize(n - 1, writefds);
n 3549 thread.c rb_fd_resize(n - 1, exceptfds);
n 3552 thread.c return select(n, r, w, e, timeout);
n 3692 thread.c result = native_fd_select(n, readfds, writefds, exceptfds,
n 1092 thread_pthread.c return rb_fd_select(n, readfds, writefds, exceptfds, timeout);
n 1276 thread_pthread.c size_t n = strlcpy(buff, mesg, sizeof(buff));
n 1277 thread_pthread.c if (n < sizeof(buff)-3) {
n 1278 thread_pthread.c ruby_snprintf(buff, sizeof(buff)-n, "(%d)", fd);
n 1519 thread_pthread.c int n;
n 1526 thread_pthread.c n = snprintf(buf, sizeof(buf), "%s:%d", name, NUM2INT(ptr[1]));
n 1529 thread_pthread.c len = (size_t)n;
n 658 thread_win32.c rb_fd_resize(n - 1, readfds);
n 662 thread_win32.c rb_fd_resize(n - 1, writefds);
n 666 thread_win32.c rb_fd_resize(n - 1, exceptfds);
n 669 thread_win32.c return rb_w32_select_with_thread(n, r, w, e, timeout, th);
n 41 time.c #define DIV(n,d) ((n)<0 ? NDIV((n),(d)) : (n)/(d))
n 42 time.c #define MOD(n,d) ((n)<0 ? NMOD((n),(d)) : (n)%(d))
n 152 time.c if (FIXNUM_P(n)) {
n 153 time.c rb_fix_divmod_fix(n, d, q, r);
n 157 time.c tmp = rb_funcall(n, id_divmod, 1, d);
n 404 time.c wideint_t n, d, q, r;
n 418 time.c n = FIXWV2WINT(wn);
n 419 time.c if (n == 0) {
n 424 time.c q = n / d;
n 425 time.c r = n % d;
n 830 time.c int i, n, x, y;
n 847 time.c n = NUM2INT(v);
n 848 time.c vtm->sec = n % 60; n = n / 60;
n 849 time.c vtm->min = n % 60; n = n / 60;
n 850 time.c vtm->hour = n;
n 859 time.c n = NUM2INT(v);
n 866 time.c if (30*365+7+31+29-1 <= n) {
n 868 time.c if (n < 31*365+8) {
n 871 time.c n -= 30*365+7;
n 876 time.c n -= 1;
n 880 time.c x = n / (365*100 + 24);
n 881 time.c n = n % (365*100 + 24);
n 883 time.c if (30*365+7+31+29-1 <= n) {
n 884 time.c if (n < 31*365+7) {
n 886 time.c n -= 30*365+7;
n 890 time.c n += 1;
n 893 time.c x = n / (365*4 + 1);
n 894 time.c n = n % (365*4 + 1);
n 896 time.c if (365*2+31+29-1 <= n) {
n 897 time.c if (n < 365*2+366) {
n 899 time.c n -= 365*2;
n 903 time.c n -= 1;
n 906 time.c x = n / 365;
n 907 time.c n = n % 365;
n 911 time.c vtm->yday = n+1;
n 920 time.c if (yday_offset[i] < n) {
n 922 time.c vtm->mday = n - yday_offset[i];
n 1387 time.c int n;
n 1419 time.c n = vtmcmp(vtm, &vtm1);
n 1420 time.c if (n == 0) {
n 1424 time.c n = 1;
n 1427 time.c if (n < 0) {
n 1936 time.c int n = 0;
n 1946 time.c n += (s[7] * 10 + s[8] - '0' * 11);
n 1957 time.c n += (s[1] * 10 + s[2] - '0' * 11) * 3600;
n 1958 time.c n += (s[4] * 10 + s[5] - '0' * 11) * 60;
n 1960 time.c n = -n;
n 1961 time.c return INT2FIX(n);
n 3227 time.c int n;
n 3232 time.c n = wcmp(tobj1->timew, tobj2->timew);
n 3237 time.c if (n == 0) return INT2FIX(0);
n 3238 time.c if (n > 0) return INT2FIX(1);
n 3927 time.c return (tobj->vtm.wday == (n)) ? Qtrue : Qfalse;\
n 891 transcode.c int n, j;
n 896 transcode.c n = ec->num_allocated * 2;
n 897 transcode.c REALLOC_N(ec->elems, rb_econv_elem_t, n);
n 898 transcode.c ec->num_allocated = n;
n 933 transcode.c for (i = 0; i < n; i++) {
n 940 transcode.c ec = rb_econv_alloc(n);
n 942 transcode.c for (i = 0; i < n; i++) {
n 1752 transcode.c if (ec->num_trans == 0 || n == 0)
n 1755 transcode.c memcpy(p, TRANSCODING_READBUF(tc) + tc->recognized_len + tc->readagain_len - n, n);
n 1756 transcode.c tc->readagain_len -= n;
n 1895 transcode.c return rb_econv_add_transcoder_at(ec, tr, n);
n 1901 transcode.c return rb_econv_add_converter(ec, "", decorator_name, n);
n 2100 transcode.c int n;
n 2103 transcode.c n = rb_enc_precise_mbclen(start, end, utf8);
n 2104 transcode.c if (MBCLEN_CHARFOUND_P(n) &&
n 2105 transcode.c (size_t)MBCLEN_CHARFOUND_LEN(n) == ec->last_error.error_bytes_len) {
n 2613 transcode.c const char *n;
n 2621 transcode.c n = StringValueCStr(*arg);
n 2624 transcode.c n = rb_enc_name(enc);
n 2627 transcode.c *name_p = n;
n 3061 transcode.c int n, len;
n 3067 transcode.c len = n = RARRAY_LENINT(convpath);
n 3068 transcode.c if (n != 0) {
n 3069 transcode.c VALUE pair = RARRAY_AREF(convpath, n-1);
n 3079 transcode.c n--;
n 3089 transcode.c rb_ary_store(convpath, n + i, rb_str_new_cstr(decorators[i]));
n 4105 transcode.c int n;
n 4112 transcode.c n = rb_econv_putbackable(ec);
n 4114 transcode.c n = NUM2INT(max);
n 4116 transcode.c if (putbackable < n)
n 4117 transcode.c n = putbackable;
n 4120 transcode.c str = rb_str_new(NULL, n);
n 4121 transcode.c rb_econv_putback(ec, (unsigned char *)RSTRING_PTR(str), n);
n 351 util.c size_t high, low, n;
n 368 util.c n = (r - l + size) / size; /* number of elements */
n 369 util.c m = l + size * (n >> 1); /* calculate median value */
n 371 util.c if (n >= 60) {
n 374 util.c if (n >= 200) {
n 375 util.c n = size*(n>>3); /* number of bytes in splitting 8 */
n 377 util.c register char *p1 = l + n;
n 378 util.c register char *p2 = p1 + n;
n 379 util.c register char *p3 = p2 + n;
n 381 util.c p1 = m + n;
n 382 util.c p2 = p1 + n;
n 383 util.c p3 = p2 + n;
n 388 util.c n = size*(n>>2); /* number of bytes in splitting 4 */
n 389 util.c m1 = l + n;
n 390 util.c m3 = m + n;
n 1422 util.c int i, k1, n, n1;
n 1427 util.c n = k >> 5;
n 1429 util.c n = k >> 4;
n 1432 util.c n1 = n + b->wds + 1;
n 1437 util.c for (i = 0; i < n; i++)
n 2941 util.c int n;
n 2952 util.c n = S->wds;
n 2954 util.c /*debug*/ if (b->wds > n)
n 2957 util.c if (b->wds < n)
n 2960 util.c sxe = sx + --n;
n 2962 util.c bxe = bx + n;
n 3001 util.c --n;
n 3002 util.c b->wds = n;
n 3039 util.c bxe = bx + n;
n 3042 util.c --n;
n 3043 util.c b->wds = n;
n 3068 util.c t = rv = rv_alloc(n);
n 75 variable.c st_data_t n;
n 78 variable.c st_lookup(RCLASS_IV_TBL(fc->track), (st_data_t)classpath, &n)) {
n 79 variable.c tmp = rb_str_dup((VALUE)n);
n 180 variable.c st_data_t n;
n 185 variable.c if (!st_lookup(RCLASS_IV_TBL(klass), (st_data_t)classpath, &n)) {
n 187 variable.c if (st_lookup(RCLASS_IV_TBL(klass), (st_data_t)classid, &n)) {
n 188 variable.c VALUE cname = (VALUE)n;
n 199 variable.c if (!st_lookup(RCLASS_IV_TBL(klass), (st_data_t)tmp_classpath, &n)) {
n 204 variable.c path = (VALUE)n;
n 209 variable.c path = (VALUE)n;
n 261 variable.c st_data_t n = (st_data_t)path;
n 267 variable.c (st_data_t)tmp_classpath, &n)) {
n 269 variable.c return (VALUE)n;
n 320 variable.c st_data_t n;
n 323 variable.c if (st_lookup(ivtbl, (st_data_t)classpath, &n)) return (VALUE)n;
n 324 variable.c if (st_lookup(ivtbl, (st_data_t)tmp_classpath, &n)) return (VALUE)n;
n 1049 variable.c return sizeof(struct gen_ivtbl) + n * sizeof(VALUE) - sizeof(VALUE);
n 1056 variable.c struct gen_ivtbl *ivtbl = xrealloc(old, gen_ivtbl_bytes(n));
n 1058 variable.c ivtbl->numiv = n;
n 1059 variable.c for (; len < n; len++) {
n 1210 variable.c size_t n = 0;
n 1214 variable.c n++;
n 1218 variable.c return n;
n 1735 variable.c st_data_t n, v;
n 1758 variable.c n = id;
n 1759 variable.c if (RCLASS_IV_TBL(obj) && st_delete(RCLASS_IV_TBL(obj), &n, &v)) {
n 1990 variable.c st_data_t val, load = 0, n = id;
n 1995 variable.c st_delete(tbl, &n, &load);
n 1998 variable.c n = autoload;
n 1999 variable.c st_delete(RCLASS_IV_TBL(mod), &n, &val);
n 3029 variable.c st_data_t val, n = id;
n 3037 variable.c if (RCLASS_IV_TBL(mod) && st_delete(RCLASS_IV_TBL(mod), &n, &val)) {
n 2644 vm.c int n = (int)backtrace(trace, MAX_NATIVE_TRACE);
n 2645 vm.c char **syms = backtrace_symbols(trace, n);
n 2652 vm.c for (i=0; i<n; i++) {
n 3139 vm.c if ((ophash = rb_hash_aref(ihash, INT2FIX(n))) == Qnil) {
n 3141 vm.c HASH_ASET(ihash, INT2FIX(n), ophash);
n 3144 vm.c valstr = rb_insn_operand_intern(GET_THREAD()->cfp->iseq, insn, n, op, 0, 0, 0, 0);
n 3200 vm.c void (*ruby_vm_collect_usage_func_operand)(int insn, int n, VALUE op) = vm_analysis_operand;
n 3230 vm.c void (*ruby_vm_collect_usage_func_operand)(int insn, int n, VALUE op) = NULL;
n 3257 vm.c valstr = rb_insn_operand_intern(GET_THREAD()->cfp->iseq, insn, n, op, 0, 0, 0, 0);
n 3263 vm.c (*ruby_vm_collect_usage_func_operand)(insn, n, op);
n 542 vm_backtrace.c if (UNLIKELY(lev < 0 || n < 0)) {
n 548 vm_backtrace.c for (i=0; i+lev<bt->backtrace_size && i<n; i++) {
n 572 vm_backtrace.c if (n == 0) {
n 573 vm_backtrace.c n = size;
n 579 vm_backtrace.c r = backtrace_collect(bt, lev, n, location_to_str_dmyarg, 0);
n 619 vm_backtrace.c if (n == 0) {
n 620 vm_backtrace.c n = size;
n 626 vm_backtrace.c r = backtrace_collect(bt, lev, n, location_create, (void *)self);
n 662 vm_backtrace.c return backtrace_to_str_ary(backtrace_object(th), lev, n);
n 668 vm_backtrace.c return backtrace_to_location_ary(backtrace_object(th), lev, n);
n 821 vm_backtrace.c long lev, n;
n 835 vm_backtrace.c n = bt->backtrace_size - lev;
n 847 vm_backtrace.c n = bt->backtrace_size - lev;
n 853 vm_backtrace.c n = len;
n 860 vm_backtrace.c n = NUM2LONG(vn);
n 864 vm_backtrace.c if (n < 0) {
n 865 vm_backtrace.c rb_raise(rb_eArgError, "negative size (%ld)", n);
n 870 vm_backtrace.c lev = n = 0; /* to avoid warning */
n 874 vm_backtrace.c if (n == 0) {
n 879 vm_backtrace.c r = backtrace_to_str_ary(btval, lev, n);
n 882 vm_backtrace.c r = backtrace_to_location_ary(btval, lev, n);
n 23 vm_debug.h #define dpn(n) ruby_debug_print_node(-1, 0, "", (n))
n 443 vm_dump.c int n = 0;
n 449 vm_dump.c trace[n++] = (void *)ip;
n 458 vm_dump.c return n;
n 487 vm_dump.c trace[n++] = (void *)uctx->uc_mcontext->__ss.__rip;
n 488 vm_dump.c trace[n++] = (void *)ip;
n 492 vm_dump.c trace[n++] = (void *)ip;
n 494 vm_dump.c return n;
n 688 vm_dump.c int n = (int)backtrace(trace, MAX_NATIVE_TRACE);
n 690 vm_dump.c rb_dump_backtrace_with_lines(n, trace);
n 692 vm_dump.c char **syms = backtrace_symbols(trace, n);
n 695 vm_dump.c for (i=0; i<n; i++) {
n 681 vm_eval.c int n = 0;
n 694 vm_eval.c args[n++] = rb_name_err_mesg_new(format, obj, argv[0]);
n 695 vm_eval.c args[n++] = argv[0];
n 697 vm_eval.c args[n++] = rb_ary_new4(argc - 1, argv + 1);
n 698 vm_eval.c args[n++] = priv ? Qtrue : Qfalse;
n 700 vm_eval.c return rb_class_new_instance(n, args, exc);
n 828 vm_eval.c if (n > 0) {
n 831 vm_eval.c va_init_list(ar, n);
n 833 vm_eval.c argv = ALLOCA_N(VALUE, n);
n 835 vm_eval.c for (i = 0; i < n; i++) {
n 843 vm_eval.c return rb_call(recv, mid, n, argv, CALL_FCALL);
n 1042 vm_eval.c if (n == 0) {
n 1049 vm_eval.c argv = ALLOCA_N(VALUE, n);
n 1051 vm_eval.c va_init_list(args, n);
n 1052 vm_eval.c for (i=0; i<n; i++) {
n 1057 vm_eval.c return rb_yield_0(n, argv);
n 19 vm_insnhelper.h #define COLLECT_USAGE_OPERAND(insn, n, op) vm_collect_usage_operand((insn), (n), ((VALUE)(op)))
n 33 vm_insnhelper.h #define TOPN(n) (*(GET_SP()-(n)-1))
n 34 vm_insnhelper.h #define POPN(n) (DEC_SP(n))
n 36 vm_insnhelper.h #define STACK_ADDR_FROM_TOP(n) (GET_SP()-(n))
n 80 vm_insnhelper.h #define GET_OPERAND(n) (GET_PC()[(n)])
n 81 vm_insnhelper.h #define ADD_PC(n) (SET_PC(REG_PC + (n)))
n 253 vsnprintf.c #define COPY(n) (void)memcpy((void *)fp->_p, (void *)p, (size_t)(n))
n 352 vsnprintf.c #define to_char(n) (char)((n) + '0')
n 541 vsnprintf.c register int n; /* handy integer (short term usage) */
n 604 vsnprintf.c if ((n = (howmany)) > 0) { \
n 605 vsnprintf.c while (n > PADSIZE) { \
n 607 vsnprintf.c n -= PADSIZE; \
n 609 vsnprintf.c PRINT((with), n); \
n 711 vsnprintf.c n = va_arg(ap, int);
n 712 vsnprintf.c prec = n < 0 ? -1 : n;
n 715 vsnprintf.c n = 0;
n 717 vsnprintf.c n = 10 * n + to_digit(ch);
n 720 vsnprintf.c prec = n < 0 ? -1 : n;
n 732 vsnprintf.c n = 0;
n 734 vsnprintf.c n = 10 * n + to_digit(ch);
n 737 vsnprintf.c width = n;
n 159 win32/file.c const char *n = (const char *)name;
n 160 win32/file.c if (strncmp("CP", n, 2) == 0) {
n 161 win32/file.c int code_page = atoi(n + 2);
n 742 win32/file.c int e = 0, n = MultiByteToWideChar(CP_ACP, 0, mode, -1, NULL, 0);
n 743 win32/file.c if (n > numberof(wmode)) return EINVAL;
n 746 win32/file.c n = rb_long2int(len);
n 747 win32/file.c len = MultiByteToWideChar(CP_UTF8, 0, name, n, NULL, 0);
n 749 win32/file.c len = MultiByteToWideChar(CP_UTF8, 0, name, n, wname, len);
n 35 win32/file.h sizeof(WCHAR)*((n)-MINIMUM_REPARSE_BUFFER_PATH_LEN))
n 107 win32/win32.c #define enough_to_get(n) (--(n) >= 0)
n 108 win32/win32.c #define enough_to_put(n) (--(n) >= 0)
n 448 win32/win32.c if (SHGetSpecialFolderLocation(NULL, n, &pidl) == 0) {
n 1007 win32/win32.c int len, n, bs, quote;
n 1023 win32/win32.c len += n = p - s;
n 1025 win32/win32.c memcpy(q, s, n);
n 1026 win32/win32.c q += n;
n 1038 win32/win32.c len += (n = p - s) + 1;
n 1040 win32/win32.c memcpy(q, s, n);
n 1041 win32/win32.c q += n;
n 1053 win32/win32.c len += (n = p - s) + 1;
n 1056 win32/win32.c memcpy(q, s, n);
n 1059 win32/win32.c q[n] = 0;
n 1062 win32/win32.c q += n;
n 1853 win32/win32.c #define BitOfIsDir(n) ((n) * 2)
n 1854 win32/win32.c #define BitOfIsRep(n) ((n) * 2 + 1)
n 2820 win32/win32.c DWORD n = 0;
n 2823 win32/win32.c if (PeekNamedPipe((HANDLE)sock, NULL, 0, NULL, &n, NULL)) {
n 2824 win32/win32.c ret = (n > 0);
n 2839 win32/win32.c DWORD n = 0;
n 2843 win32/win32.c ret = (PeekConsoleInput((HANDLE)sock, &ir, 1, &n));
n 2854 win32/win32.c DWORD n = 0;
n 2858 win32/win32.c if (PeekConsoleInput((HANDLE)sock, &ir, 1, &n) && n > 0) {
n 2864 win32/win32.c ReadConsoleInput((HANDLE)sock, &ir, 1, &n);