values 29 ext/mt-random/mt-lib.c s ^= SCM_BIGNUM(init)->values[i];
values 252 ext/mt-random/mt-random.c return genrand_int_small(mt, SCM_BIGNUM(n)->values[0]);
values 255 ext/mt-random/mt-random.c && SCM_BIGNUM(n)->values[0] == 0
values 256 ext/mt-random/mt-random.c && SCM_BIGNUM(n)->values[1] == 1) {
values 246 ext/net/netlib.c u_long values[BN_SIZE];
values 251 ext/net/netlib.c for (i = 0; i < BN_SIZE; i++) values[BN_SIZE-i-1] = ntohl(*p++);
values 252 ext/net/netlib.c bn = Scm_MakeBignumFromUIArray(1, values, BN_SIZE);
values 562 ext/uvector/uvector.c return SCM_BIGNUM(x)->values[0];
values 564 ext/uvector/uvector.c return ~(SCM_BIGNUM(x)->values[0]) + 1;
values 104 src/bignum.c for (i=0; i<b->size; i++) b->values[i] = 0;
values 145 src/bignum.c b->values[0] = (unsigned long)LONG_MAX+1;
values 149 src/bignum.c b->values[0] = -val;
values 153 src/bignum.c b->values[0] = val;
values 162 src/bignum.c b->values[0] = val;
values 168 src/bignum.c ScmObj Scm_MakeBignumFromUIArray(int sign, u_long *values, int size)
values 174 src/bignum.c for (i=0; i<size; i++) b->values[i] = values[i];
values 178 src/bignum.c if ((b->values[i] = values[i]) != 0) nonzerop = TRUE;
values 181 src/bignum.c if (values[size-1] <= LONG_MAX) b->sign = 1;
values 217 src/bignum.c for (i=0; i<b->size; i++) c->values[i] = b->values[i];
values 230 src/bignum.c if (b->values[i] == 0) size--;
values 237 src/bignum.c if (b->sign > 0 && b->values[0] <= (u_long)SCM_SMALL_INT_MAX) {
values 238 src/bignum.c return SCM_MAKE_INT(b->values[0]);
values 240 src/bignum.c if (b->sign < 0 && b->values[0] <= (u_long)-SCM_SMALL_INT_MIN) {
values 241 src/bignum.c return SCM_MAKE_INT(-b->values[0]);
values 253 src/bignum.c if (b->values[0] > LONG_MAX || b->size >= 2) {
values 257 src/bignum.c return (long)b->values[0];
values 260 src/bignum.c if (b->values[0] > (u_long)LONG_MAX+1 || b->size >= 2) {
values 264 src/bignum.c return -(long)b->values[0];
values 285 src/bignum.c return b->values[0];
values 308 src/bignum.c if (b->size > 2 || b->values[1] > LONG_MAX) {
values 312 src/bignum.c r.lo = b->values[0];
values 313 src/bignum.c if (b->size == 2) r.hi = b->values[1];
values 316 src/bignum.c if (b->size > 2 || b->values[1] > (u_long)LONG_MAX + 1) {
values 321 src/bignum.c r.lo = b->values[0];
values 322 src/bignum.c if (b->size == 2) r.hi = b->values[1];
values 332 src/bignum.c r = b->values[0];
values 333 src/bignum.c } else if (b->size > 2 || b->values[1] > LONG_MAX) {
values 337 src/bignum.c r = ((int64_t)b->values[1] << 32) + (uint64_t)b->values[0];
values 341 src/bignum.c r = -(int64_t)b->values[0];
values 342 src/bignum.c } else if (b->size > 2 || (b->values[1] > LONG_MAX && b->values[0] > 0)) {
values 346 src/bignum.c r = -(((int64_t)b->values[1] << 32) + (uint64_t)b->values[0]);
values 370 src/bignum.c r.lo = b->values[0];
values 371 src/bignum.c if (b->size == 2) r.hi = b->values[1];
values 385 src/bignum.c r = (((uint64_t)b->values[1]) << 32) + (uint64_t)b->values[0];
values 387 src/bignum.c r = (uint64_t)b->values[0];
values 411 src/bignum.c case 1: r = (double)b->values[0]; break;
values 413 src/bignum.c r = ldexp((double)b->values[1], WORD_BITS) + (double)b->values[0];
values 416 src/bignum.c r = ldexp((double)b->values[b->size-1], WORD_BITS*(b->size-1))
values 417 src/bignum.c + ldexp((double)b->values[b->size-2], WORD_BITS*(b->size-2))
values 418 src/bignum.c + ldexp((double)b->values[b->size-3], WORD_BITS*(b->size-3));
values 447 src/bignum.c if (bx->values[i] < by->values[i]) return (bx->sign > 0) ? -1 : 1;
values 448 src/bignum.c if (bx->values[i] > by->values[i]) return (bx->sign > 0) ? 1 : -1;
values 461 src/bignum.c if (bx->values[i] < by->values[i]) return -1;
values 462 src/bignum.c if (bx->values[i] > by->values[i]) return 1;
values 482 src/bignum.c if (osize < ysize && by->values[ysize-1] > 1) {
values 486 src/bignum.c if (off->values[osize-1] > by->values[ysize-1]) return 1;
values 487 src/bignum.c if (off->values[osize-1] < by->values[ysize-1]-1) return -1;
values 494 src/bignum.c if (bx->values[xsize-1] > by->values[ysize-1]) return 1;
values 496 src/bignum.c if (bx->values[xsize-1] < by->values[ysize-1]-1) return -1;
values 499 src/bignum.c u_long xx = bx->values[xsize-1], oo = off->values[osize-1];
values 501 src/bignum.c if (c > 0 || w > by->values[ysize-1]) return 1;
values 502 src/bignum.c if (w < by->values[ysize-1] - 1) return -1;
values 513 src/bignum.c if (br->values[i]) return 1;
values 516 src/bignum.c if (br->values[i] < by->values[i]) return -1;
values 517 src/bignum.c if (br->values[i] > by->values[i]) return 1;
values 530 src/bignum.c if (x->values[xsize-1] == SCM_ULONG_MAX) return xsize+1;
values 533 src/bignum.c if (y->values[ysize-1] == SCM_ULONG_MAX) return ysize+1;
values 546 src/bignum.c unsigned long x = ~br->values[i];
values 547 src/bignum.c UADD(br->values[i], c, x, 0);
values 571 src/bignum.c UADD(br->values[i], c, 0, 0);
values 574 src/bignum.c y = by->values[i];
values 575 src/bignum.c UADD(br->values[i], c, 0, y);
values 579 src/bignum.c x = bx->values[i];
values 580 src/bignum.c UADD(br->values[i], c, x, 0);
values 583 src/bignum.c x = bx->values[i];
values 584 src/bignum.c y = by->values[i];
values 585 src/bignum.c UADD(br->values[i], c, x, y);
values 603 src/bignum.c USUB(br->values[i], c, 0, 0);
values 606 src/bignum.c y = by->values[i];
values 607 src/bignum.c USUB(br->values[i], c, 0, y);
values 611 src/bignum.c x = bx->values[i];
values 612 src/bignum.c USUB(br->values[i], c, x, 0);
values 615 src/bignum.c x = bx->values[i];
values 616 src/bignum.c y = by->values[i];
values 617 src/bignum.c USUB(br->values[i], c, x, y);
values 669 src/bignum.c UADD(br->values[i], c, bx->values[i], yabs);
values 674 src/bignum.c USUB(br->values[i], c, bx->values[i], yabs);
values 678 src/bignum.c br->values[rsize-1] = c;
values 760 src/bignum.c br->size = 0; br->values[0] = 0;
values 763 src/bignum.c br->values[i-nwords] = bx->values[i];
values 770 src/bignum.c x = (bx->values[i+1]<<(WORD_BITS-nbits))|(bx->values[i]>>nbits);
values 771 src/bignum.c br->values[i-nwords] = x;
values 773 src/bignum.c br->values[i-nwords] = bx->values[i]>>nbits;
values 792 src/bignum.c if (br->size > i+nwords) br->values[i+nwords] = bx->values[i];
values 794 src/bignum.c for (i = nwords-1; i>=0; i--) br->values[i] = 0;
values 797 src/bignum.c br->values[bx->size+nwords] =
values 798 src/bignum.c bx->values[bx->size-1]>>(WORD_BITS-nbits);
values 801 src/bignum.c x = (bx->values[i]<<nbits)|(bx->values[i-1]>>(WORD_BITS-nbits));
values 802 src/bignum.c if (br->size > i+nwords) br->values[i+nwords] = x;
values 804 src/bignum.c br->values[nwords] = bx->values[0]<<nbits;
values 805 src/bignum.c for (i = nwords-1; i>=0; i--) br->values[i] = 0;
values 825 src/bignum.c x = bx->values[i];
values 829 src/bignum.c r0 = br->values[i+off];
values 831 src/bignum.c br->values[i+off] = r1;
values 833 src/bignum.c r0 = br->values[i+off+1];
values 835 src/bignum.c br->values[i+off+1] = r1;
values 838 src/bignum.c r0 = br->values[j];
values 840 src/bignum.c br->values[j] = r1;
values 852 src/bignum.c bignum_mul_word(br, bx, by->values[i], i);
values 867 src/bignum.c br->values[0] = 0;
values 942 src/bignum.c int d = div_normalization_factor(divisor->values[divisor->size-1]);
values 946 src/bignum.c #define DIGIT(num, n) (((n)%2)? HI((num)->values[(n)/2]) : LO((num)->values[(n)/2]))
values 949 src/bignum.c ((LO((num)->values[(n)/2+1])<<HALF_BITS)|HI((num)->values[(n)/2])): \
values 950 src/bignum.c (num)->values[(n)/2])
values 953 src/bignum.c (num->values[(n)/2] = (num->values[(n)/2] & LOMASK)|((v) << HALF_BITS)) :\
values 954 src/bignum.c (num->values[(n)/2] = (num->values[(n)/2] & HIMASK)|((v) & LOMASK)))
values 957 src/bignum.c ((num->values[(n)/2] = LO(num->values[(n)/2])|((v)<<HALF_BITS)), \
values 958 src/bignum.c (num->values[(n)/2+1] = (num->values[(n)/2+1] & HIMASK)|HI(v))) : \
values 959 src/bignum.c (num->values[(n)/2] = (v)))
values 1041 src/bignum.c u_long *pu = dividend->values;
values 1074 src/bignum.c rr = br->values[0];
values 1143 src/bignum.c z->values[i] = x->values[i] & y->values[i];
values 1146 src/bignum.c for (; i < xsize; i++) z->values[i] = x->values[i];
values 1148 src/bignum.c for (; i < ysize; i++) z->values[i] = y->values[i];
values 1194 src/bignum.c z->values[i] = x->values[i] | y->values[i];
values 1197 src/bignum.c for (; i < xsize; i++) z->values[i] = x->values[i];
values 1199 src/bignum.c for (; i < ysize; i++) z->values[i] = y->values[i];
values 1268 src/bignum.c for (; q->values[q->size-1] == 0 && q->size > 0; q->size--)
values 1282 src/bignum.c Scm_Printf(out, "%08x ", b->values[i]);
values 1299 src/bignum.c b->values[0] = init;
values 1313 src/bignum.c r->values[0] = c;
values 1315 src/bignum.c if (r->values[rsize-1] == 0) {
values 1317 src/bignum.c acc->values[i] = r->values[i];
values 1325 src/bignum.c rr->values[i] = r->values[i];
values 2001 src/gauche.h unsigned long values[1]; /* variable length */
values 2041 src/gauche.h SCM_EXTERN ScmObj Scm_MakeBignumFromUIArray(int sign, u_long *values, int size);
values 135 src/hash.c u += SCM_BIGNUM(obj)->values[i];
values 197 src/hash.c return SCM_BIGNUM(r)->values[0];
values 243 src/number.c unsigned long values[2];
values 244 src/number.c values[0] = dd.components.mant1;
values 245 src/number.c values[1] = dd.components.mant0;
values 247 src/number.c values[1] += (1L<<20); /* hidden bit */
values 249 src/number.c f = Scm_NormalizeBignum(SCM_BIGNUM(Scm_MakeBignumFromUIArray(1, values, 2)));
values 678 src/number.c return (SCM_BIGNUM(obj)->values[0] & 1);
values 1812 src/number.c return Scm_MakeInteger(SCM_INT_VALUE(x)&SCM_BIGNUM(y)->values[0]);
values 1817 src/number.c return Scm_MakeInteger(SCM_INT_VALUE(y)&SCM_BIGNUM(x)->values[0]);
values 85 src/system.c || SCM_BIGNUM(i)->values[0] > LONG_MAX) {