RBIGNUM_LEN        39 bignum.c       #define BIGZEROP(x) (RBIGNUM_LEN(x) == 0 || \
RBIGNUM_LEN        41 bignum.c       		      (RBIGNUM_LEN(x) == 1 || bigzero_p(x))))
RBIGNUM_LEN        47 bignum.c           for (i = RBIGNUM_LEN(x) - 1; 0 <= i; i--) {
RBIGNUM_LEN        84 bignum.c       	    RBIGNUM(big)->as.heap.len = RBIGNUM_LEN(big);
RBIGNUM_LEN       100 bignum.c       	    if (RBIGNUM_LEN(big) == 0) {
RBIGNUM_LEN       139 bignum.c           VALUE z = bignew_1(CLASS_OF(x), RBIGNUM_LEN(x), RBIGNUM_SIGN(x));
RBIGNUM_LEN       141 bignum.c           MEMCPY(BDIGITS(z), BDIGITS(x), BDIGIT, RBIGNUM_LEN(x));
RBIGNUM_LEN       149 bignum.c           long i = RBIGNUM_LEN(x);
RBIGNUM_LEN       160 bignum.c           } while (i < RBIGNUM_LEN(x));
RBIGNUM_LEN       162 bignum.c       	rb_big_resize(x, RBIGNUM_LEN(x)+1);
RBIGNUM_LEN       164 bignum.c       	ds[RBIGNUM_LEN(x)-1] = 1;
RBIGNUM_LEN       177 bignum.c           long len = RBIGNUM_LEN(x);
RBIGNUM_LEN       189 bignum.c           long len = RBIGNUM_LEN(x);
RBIGNUM_LEN       288 bignum.c       	long len = RBIGNUM_LEN(val);
RBIGNUM_LEN       358 bignum.c           len = RBIGNUM_LEN(val) * SIZEOF_BDIGITS;
RBIGNUM_LEN       847 bignum.c           else if (RBIGNUM_LEN(x) >= LONG_MAX/BITSPERDIG) {
RBIGNUM_LEN       851 bignum.c       	bits = BITSPERDIG*RBIGNUM_LEN(x);
RBIGNUM_LEN       860 bignum.c           long i = RBIGNUM_LEN(x), j = len;
RBIGNUM_LEN      1004 bignum.c           long len = RBIGNUM_LEN(x);
RBIGNUM_LEN      1064 bignum.c           long len = RBIGNUM_LEN(x);
RBIGNUM_LEN      1166 bignum.c           long i = RBIGNUM_LEN(x), lo = 0, bits;
RBIGNUM_LEN      1244 bignum.c           long xlen = RBIGNUM_LEN(x);
RBIGNUM_LEN      1263 bignum.c           if (xlen < RBIGNUM_LEN(y))
RBIGNUM_LEN      1265 bignum.c           if (xlen > RBIGNUM_LEN(y))
RBIGNUM_LEN      1308 bignum.c           if (RBIGNUM_LEN(x) != RBIGNUM_LEN(y)) return Qfalse;
RBIGNUM_LEN      1309 bignum.c           if (MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,RBIGNUM_LEN(y)) != 0) return Qfalse;
RBIGNUM_LEN      1329 bignum.c           if (RBIGNUM_LEN(x) != RBIGNUM_LEN(y)) return Qfalse;
RBIGNUM_LEN      1330 bignum.c           if (MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,RBIGNUM_LEN(y)) != 0) return Qfalse;
RBIGNUM_LEN      1372 bignum.c           i = RBIGNUM_LEN(x);
RBIGNUM_LEN      1389 bignum.c           long i = RBIGNUM_LEN(x);
RBIGNUM_LEN      1392 bignum.c           if (RBIGNUM_LEN(x) < RBIGNUM_LEN(y)) {
RBIGNUM_LEN      1395 bignum.c           else if (RBIGNUM_LEN(x) == RBIGNUM_LEN(y)) {
RBIGNUM_LEN      1408 bignum.c           z = bignew(RBIGNUM_LEN(x), z==0);
RBIGNUM_LEN      1411 bignum.c           for (i = 0, num = 0; i < RBIGNUM_LEN(y); i++) {
RBIGNUM_LEN      1416 bignum.c           while (num && i < RBIGNUM_LEN(x)) {
RBIGNUM_LEN      1421 bignum.c           while (i < RBIGNUM_LEN(x)) {
RBIGNUM_LEN      1442 bignum.c           if (RBIGNUM_LEN(x) > RBIGNUM_LEN(y)) {
RBIGNUM_LEN      1443 bignum.c       	len = RBIGNUM_LEN(x) + 1;
RBIGNUM_LEN      1447 bignum.c       	len = RBIGNUM_LEN(y) + 1;
RBIGNUM_LEN      1451 bignum.c           len = RBIGNUM_LEN(x);
RBIGNUM_LEN      1457 bignum.c           len = RBIGNUM_LEN(y);
RBIGNUM_LEN      1542 bignum.c           j = RBIGNUM_LEN(x) + RBIGNUM_LEN(y) + 1;
RBIGNUM_LEN      1545 bignum.c           for (i = 0; i < RBIGNUM_LEN(x); i++) {
RBIGNUM_LEN      1551 bignum.c       	for (j = 0; j < RBIGNUM_LEN(y); j++) {
RBIGNUM_LEN      1587 bignum.c           bms.z = bignew(RBIGNUM_LEN(x) + RBIGNUM_LEN(y) + 1, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
RBIGNUM_LEN      1590 bignum.c           if (RBIGNUM_LEN(x) + RBIGNUM_LEN(y) > 10000) {
RBIGNUM_LEN      1668 bignum.c           long nx = RBIGNUM_LEN(x), ny = RBIGNUM_LEN(y);
RBIGNUM_LEN      1743 bignum.c           if (RBIGNUM_LEN(x) > 10000 || RBIGNUM_LEN(y) > 10000) {
RBIGNUM_LEN      1989 bignum.c       	ex = (RBIGNUM_LEN(bigtrunc(x)) - 1) * BITSPERDIG;
RBIGNUM_LEN      1990 bignum.c       	ex += bdigbitsize(BDIGITS(x)[RBIGNUM_LEN(x) - 1]);
RBIGNUM_LEN      1998 bignum.c       	    ey = (RBIGNUM_LEN(bigtrunc(y)) - 1) * BITSPERDIG;
RBIGNUM_LEN      1999 bignum.c       	    ey += bdigbitsize(BDIGITS(y)[RBIGNUM_LEN(y) - 1]);
RBIGNUM_LEN      2035 bignum.c           long len = RBIGNUM_LEN(x), k = len / 2, i;
RBIGNUM_LEN      2050 bignum.c           rb_big_realloc(z, (len = 2 * k + RBIGNUM_LEN(a2)) + 1);
RBIGNUM_LEN      2051 bignum.c           while (RBIGNUM_LEN(z) < 2 * k) {
RBIGNUM_LEN      2052 bignum.c       	BDIGITS(z)[RBIGNUM_LEN(z)] = 0;
RBIGNUM_LEN      2053 bignum.c       	RBIGNUM_SET_LEN(z, RBIGNUM_LEN(z)+1);
RBIGNUM_LEN      2055 bignum.c           MEMCPY(BDIGITS(z) + 2 * k, BDIGITS(a2), BDIGIT, RBIGNUM_LEN(a2));
RBIGNUM_LEN      2058 bignum.c           len = RBIGNUM_LEN(a2);
RBIGNUM_LEN      2065 bignum.c       	len = RBIGNUM_LEN(z);
RBIGNUM_LEN      2072 bignum.c       	    BDIGITS(z)[RBIGNUM_LEN(z)] = BIGLO(num);
RBIGNUM_LEN      2073 bignum.c       	    RBIGNUM_SET_LEN(z, RBIGNUM_LEN(z)+1);
RBIGNUM_LEN      2119 bignum.c       	    if ((RBIGNUM_LEN(x) > BIGLEN_LIMIT) ||
RBIGNUM_LEN      2120 bignum.c       		(RBIGNUM_LEN(x) > BIGLEN_LIMIT / yy)) {
RBIGNUM_LEN      2182 bignum.c           if (RBIGNUM_LEN(x) > RBIGNUM_LEN(y)) {
RBIGNUM_LEN      2183 bignum.c       	l1 = RBIGNUM_LEN(y);
RBIGNUM_LEN      2184 bignum.c       	l2 = RBIGNUM_LEN(x);
RBIGNUM_LEN      2190 bignum.c       	l1 = RBIGNUM_LEN(x);
RBIGNUM_LEN      2191 bignum.c       	l2 = RBIGNUM_LEN(y);
RBIGNUM_LEN      2238 bignum.c           if (RBIGNUM_LEN(x) > RBIGNUM_LEN(y)) {
RBIGNUM_LEN      2239 bignum.c       	l1 = RBIGNUM_LEN(y);
RBIGNUM_LEN      2240 bignum.c       	l2 = RBIGNUM_LEN(x);
RBIGNUM_LEN      2246 bignum.c       	l1 = RBIGNUM_LEN(x);
RBIGNUM_LEN      2247 bignum.c       	l2 = RBIGNUM_LEN(y);
RBIGNUM_LEN      2296 bignum.c           if (RBIGNUM_LEN(x) > RBIGNUM_LEN(y)) {
RBIGNUM_LEN      2297 bignum.c       	l1 = RBIGNUM_LEN(y);
RBIGNUM_LEN      2298 bignum.c       	l2 = RBIGNUM_LEN(x);
RBIGNUM_LEN      2304 bignum.c       	l1 = RBIGNUM_LEN(x);
RBIGNUM_LEN      2305 bignum.c       	l2 = RBIGNUM_LEN(y);
RBIGNUM_LEN      2329 bignum.c           if (!RBIGNUM_LEN(x)) return INT2FIX(0);
RBIGNUM_LEN      2330 bignum.c           if (RBIGNUM_LEN(y) > SIZEOF_LONG / SIZEOF_BDIGITS) {
RBIGNUM_LEN      2384 bignum.c           len = RBIGNUM_LEN(x);
RBIGNUM_LEN      2451 bignum.c           if (s1 > RBIGNUM_LEN(x)) {
RBIGNUM_LEN      2462 bignum.c           i = RBIGNUM_LEN(x); j = i - s1;
RBIGNUM_LEN      2513 bignum.c       	if (RBIGNUM_LEN(bigtrunc(y)) > DIGSPERLONG) {
RBIGNUM_LEN      2527 bignum.c           if (s1 >= RBIGNUM_LEN(x)) goto out_of_range;
RBIGNUM_LEN      2555 bignum.c           hash = rb_memhash(BDIGITS(x), sizeof(BDIGIT)*RBIGNUM_LEN(x)) ^ RBIGNUM_SIGN(x);
RBIGNUM_LEN      2614 bignum.c           return LONG2FIX(RBIGNUM_LEN(big)*SIZEOF_BDIGITS);
RBIGNUM_LEN       670 marshal.c      		long len = RBIGNUM_LEN(obj);
RBIGNUM_LEN      1339 marshal.c      		    RBIGNUM_LEN(big) * sizeof(BDIGIT) - len * 2);
RBIGNUM_LEN      1341 marshal.c      	    len = RBIGNUM_LEN(big);
RBIGNUM_LEN       233 random.c                 len = RBIGNUM_LEN(seed) * SIZEOF_BDIGITS;
RBIGNUM_LEN       252 random.c               for (i = RBIGNUM_LEN(seed)-1; 0 <= i; i--) {
RBIGNUM_LEN       327 random.c           digits[RBIGNUM_LEN(big)-1] = digits[RBIGNUM_LEN(big)-2] <= 1 ? 1 : 0;
RBIGNUM_LEN       413 random.c           len = (RBIGNUM_LEN(limit) * SIZEOF_BDIGITS + 3) / 4;
RBIGNUM_LEN       419 random.c            ((i)*2+1 < RBIGNUM_LEN(big) ? \
RBIGNUM_LEN       424 random.c            ((i)*2+1 < RBIGNUM_LEN(big) ? \