Searched refs:BITSPERDIG (Results 1 - 3 of 3) sorted by relevance

/macosx-10.9.5/ruby-104/ruby/
H A Drandom.c264 #define BITSPERDIG (SIZEOF_BDIGITS*CHAR_BIT) macro
265 #define BIGRAD ((BDIGIT_DBL)1 << BITSPERDIG)
267 #define BIGUP(x) ((BDIGIT_DBL)(x) << BITSPERDIG)
268 #define BIGDN(x) RSHIFT((x),BITSPERDIG)
279 VALUE x = rb_big_new(roomof(64, BITSPERDIG), 1);
280 VALUE m = rb_big_new(roomof(53, BITSPERDIG), 1);
286 #if BITSPERDIG < 32
287 xd[i++] = (BDIGIT)(b >> BITSPERDIG);
290 #if BITSPERDIG < 32
291 xd[i++] = (BDIGIT)(a >> BITSPERDIG);
429 buf[j] <<= BITSPERDIG; local
[all...]
H A Dbignum.c37 #define BITSPERDIG (SIZEOF_BDIGITS*CHAR_BIT) macro
38 #define BIGRAD ((BDIGIT_DBL)1 << BITSPERDIG)
44 #define BIGUP(x) ((BDIGIT_DBL)(x) << BITSPERDIG)
45 #define BIGDN(x) RSHIFT((x),BITSPERDIG)
390 l |= ((unsigned long)*ds << (j * BITSPERDIG));
558 #define BNEG(b) (RSHIFT(((BDIGIT*)(b))[QUAD_SIZE/SIZEOF_BDIGITS-1],BITSPERDIG-1) != 0)
728 len = (len/BITSPERDIG)+1;
1001 * where B is BITSPERDIG (i.e. BDIGITS*CHAR_BIT) and n_0 is
1038 else if (RBIGNUM_LEN(x) >= LONG_MAX/BITSPERDIG) {
1042 bits = BITSPERDIG*RBIGNUM_LE
[all...]
H A Dsprintf.c25 #define BITSPERDIG (SIZEOF_BDIGITS*CHAR_BIT) macro
26 #define EXTENDSIGN(n, l) (((~0 << (n)) >> (((n)*(l)) % BITSPERDIG)) & ~(~0 << (n)))

Completed in 137 milliseconds