CHAR_BIT 812 addr2line.c #define MAXNBUF (sizeof(intmax_t) * CHAR_BIT + 1)
CHAR_BIT 69 bignum.c #define LSHIFTABLE(d, n) ((n) < sizeof(d) * CHAR_BIT)
CHAR_BIT 76 bignum.c #define BITSPERDIG (SIZEOF_BDIGIT*CHAR_BIT)
CHAR_BIT 99 bignum.c (size_t)(BIGNUM_LEN(x)*SIZEOF_BDIGIT - nlz(BDIGITS(x)[BIGNUM_LEN(x)-1])/CHAR_BIT) : \
CHAR_BIT 159 bignum.c static int nlz(BDIGIT x) { return nlz_int((unsigned int)x) - (SIZEOF_INT-SIZEOF_BDIGIT) * CHAR_BIT; }
CHAR_BIT 161 bignum.c static int nlz(BDIGIT x) { return nlz_long((unsigned long)x) - (SIZEOF_LONG-SIZEOF_BDIGIT) * CHAR_BIT; }
CHAR_BIT 163 bignum.c static int nlz(BDIGIT x) { return nlz_long_long((unsigned LONG_LONG)x) - (SIZEOF_LONG_LONG-SIZEOF_BDIGIT) * CHAR_BIT; }
CHAR_BIT 165 bignum.c static int nlz(BDIGIT x) { return nlz_int128((uint128_t)x) - (SIZEOF_INT128_T-SIZEOF_BDIGIT) * CHAR_BIT; }
CHAR_BIT 516 bignum.c if (wordsize <= nails / CHAR_BIT)
CHAR_BIT 543 bignum.c word_num_partialbits = CHAR_BIT - (int)(nails % CHAR_BIT);
CHAR_BIT 544 bignum.c if (word_num_partialbits == CHAR_BIT)
CHAR_BIT 546 bignum.c word_num_fullbytes = wordsize - (nails / CHAR_BIT);
CHAR_BIT 590 bignum.c if (*dpp < *dep && BITSPERDIG <= (int)sizeof(*ddp) * CHAR_BIT - *numbits_in_dd_p) {
CHAR_BIT 596 bignum.c *numbits_in_dd_p = (int)sizeof(*ddp) * CHAR_BIT;
CHAR_BIT 855 bignum.c *bytep = TAKE_LOWBITS(CHAR_BIT);
CHAR_BIT 933 bignum.c carry >>= CHAR_BIT;
CHAR_BIT 961 bignum.c size_t num_bits = (wordsize * CHAR_BIT - nails) * numwords;
CHAR_BIT 978 bignum.c size_t q1 = numwords / CHAR_BIT;
CHAR_BIT 979 bignum.c size_t r1 = numwords % CHAR_BIT;
CHAR_BIT 985 bignum.c size_t q2 = nails / CHAR_BIT;
CHAR_BIT 986 bignum.c size_t r2 = nails % CHAR_BIT;
CHAR_BIT 996 bignum.c size_t num_digits1 = CHAR_BIT * q3;
CHAR_BIT 1009 bignum.c if (CHAR_BIT * r3 >= r1 * r2) {
CHAR_BIT 1010 bignum.c size_t tmp1 = CHAR_BIT * BITSPERDIG - (CHAR_BIT * r3 - r1 * r2);
CHAR_BIT 1013 bignum.c size_t num_digits2 = num_digits1 + CHAR_BIT - q4;
CHAR_BIT 1018 bignum.c size_t tmp1 = r1 * r2 - CHAR_BIT * r3;
CHAR_BIT 1032 bignum.c if (numwords <= (SIZE_MAX - (BITSPERDIG-1)) / CHAR_BIT / wordsize) {
CHAR_BIT 1068 bignum.c ((u >> (size * CHAR_BIT - 1)) ? -1 : 1);
CHAR_BIT 1070 bignum.c u |= LSHIFTX(BDIGMAX, size * CHAR_BIT);
CHAR_BIT 1132 bignum.c else if (buf[src_size-1] >> (CHAR_BIT-1)) {
CHAR_BIT 1224 bignum.c PUSH_BITS(*bytep, CHAR_BIT);
CHAR_BIT 2262 bignum.c const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
CHAR_BIT 2735 bignum.c const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
CHAR_BIT 3273 bignum.c *nlz_bits_ret = num_leading_zeros % CHAR_BIT;
CHAR_BIT 3274 bignum.c return (de - dp) * SIZEOF_BDIGIT - num_leading_zeros / CHAR_BIT;
CHAR_BIT 3280 bignum.c size_t val_numbits = numbytes * CHAR_BIT - nlz_bits_in_msbyte;
CHAR_BIT 3294 bignum.c static const BDIGIT char_bit[1] = { CHAR_BIT };
CHAR_BIT 3378 bignum.c if (numbytes <= SIZE_MAX / CHAR_BIT) {
CHAR_BIT 3943 bignum.c const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
CHAR_BIT 4558 bignum.c assert(POW2_P(CHAR_BIT));
CHAR_BIT 4570 bignum.c if (1 < sign || CHAR_BIT <= lens[1])
CHAR_BIT 4574 bignum.c if (1 < sign || CHAR_BIT <= lens[1])
CHAR_BIT 4579 bignum.c (lens[1] << (CHAR_BIT*SIZEOF_SIZE_T - bit_length(BITSPERDIG-1)));
CHAR_BIT 4599 bignum.c #define MAX_BASE36_POWER_TABLE_ENTRIES (SIZEOF_SIZE_T * CHAR_BIT + 1)
CHAR_BIT 4684 bignum.c char buf[SIZEOF_BDIGIT_DBL*CHAR_BIT], *p;
CHAR_BIT 4862 bignum.c rb_integer_pack(x, ptr, numwords, 1, CHAR_BIT-word_numbits,
CHAR_BIT 4965 bignum.c const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
CHAR_BIT 5288 bignum.c #if SIZEOF_LONG * CHAR_BIT < DBL_MANT_DIG /* assume FLT_RADIX == 2 */
CHAR_BIT 5335 bignum.c #if SIZEOF_LONG * CHAR_BIT < DBL_MANT_DIG /* assume FLT_RADIX == 2 */
CHAR_BIT 6714 bignum.c static const BDIGIT char_bit[1] = { CHAR_BIT };
CHAR_BIT 6725 bignum.c if (nlz_bits != CHAR_BIT-1) {
CHAR_BIT 6734 bignum.c if (numbytes <= SIZE_MAX / CHAR_BIT) {
CHAR_BIT 6735 bignum.c return SIZET2NUM(numbytes * CHAR_BIT - nlz_bits);
CHAR_BIT 1215 dir.c #define GLOB_VERBOSE (1U << (sizeof(int) * CHAR_BIT - 1))
CHAR_BIT 58 ext/-test-/bignum/mul.c rb_define_const(rb_cInteger, "BITSPERDIG", INT2NUM(SIZEOF_BDIGIT * CHAR_BIT));
CHAR_BIT 2992 ext/bigdecimal/bigdecimal.c char buf[DECIMAL_SIZE_OF_BITS(SIZEOF_VALUE * CHAR_BIT) + 4];
CHAR_BIT 90 ext/date/date_strptime.c if ((4 * l * sizeof(char)) <= (sizeof(long)*CHAR_BIT)) {
CHAR_BIT 366 ext/digest/rmd160/rmd160.c #if SIZEOF_SIZE_T * CHAR_BIT > 32
CHAR_BIT 54 ext/fiddle/fiddle.h #if CHAR_BIT == 8
CHAR_BIT 665 ext/ripper/ripper.c #define nd_term(node) SIGN_EXTEND((node)->u2.id, CHAR_BIT*2)
CHAR_BIT 667 ext/ripper/ripper.c #define nd_paren(node) (char)((node)->u2.id >> CHAR_BIT*2)
CHAR_BIT 12149 ext/ripper/ripper.c rb_node_newnode(NODE_STRTERM, (func), (term) | ((paren) << (CHAR_BIT * 2)), 0)
CHAR_BIT 15007 ext/ripper/ripper.c stack_type mask = (stack_type)1U << (CHAR_BIT * sizeof(stack_type) - 1);
CHAR_BIT 15109 ext/ripper/ripper.c #define LVAR_USED ((ID)1 << (sizeof(ID) * CHAR_BIT - 1))
CHAR_BIT 611 ext/ripper/ripper.y #define nd_term(node) SIGN_EXTEND((node)->u2.id, CHAR_BIT*2)
CHAR_BIT 613 ext/ripper/ripper.y #define nd_paren(node) (char)((node)->u2.id >> CHAR_BIT*2)
CHAR_BIT 6400 ext/ripper/ripper.y rb_node_newnode(NODE_STRTERM, (func), (term) | ((paren) << (CHAR_BIT * 2)), 0)
CHAR_BIT 9258 ext/ripper/ripper.y stack_type mask = (stack_type)1U << (CHAR_BIT * sizeof(stack_type) - 1);
CHAR_BIT 9360 ext/ripper/ripper.y #define LVAR_USED ((ID)1 << (sizeof(ID) * CHAR_BIT - 1))
CHAR_BIT 121 ext/socket/rubysocket.h (((((socklen_t)1) << (sizeof(socklen_t) * CHAR_BIT - 2)) - 1) * 2 + 1))
CHAR_BIT 958 ext/stringio/stringio.c for (c = 0; c < (1 << CHAR_BIT); c++) {
CHAR_BIT 1063 ext/stringio/stringio.c long skip[1 << CHAR_BIT], pos;
CHAR_BIT 460 file.c #define ST2UINT(val) ((val) & ~(~1UL << (sizeof(val) * CHAR_BIT - 1)))
CHAR_BIT 136 hash.c ul &= (1UL << (sizeof(long)*CHAR_BIT-1)) - 1;
CHAR_BIT 195 include/ruby/ruby.h # ifndef CHAR_BIT
CHAR_BIT 828 include/ruby/ruby.h #if defined ENUM_OVER_INT || SIZEOF_INT*CHAR_BIT>12+19+1
CHAR_BIT 28 include/ruby/st.h #ifndef CHAR_BIT
CHAR_BIT 60 include/ruby/st.h #define ST_INDEX_BITS (sizeof(st_index_t) * CHAR_BIT)
CHAR_BIT 156 internal.h # if 64 < SIZEOF_INT * CHAR_BIT
CHAR_BIT 158 internal.h # elif 32 < SIZEOF_INT * CHAR_BIT
CHAR_BIT 163 internal.h # if 64 < SIZEOF_INT * CHAR_BIT
CHAR_BIT 166 internal.h # if 32 < SIZEOF_INT * CHAR_BIT
CHAR_BIT 182 internal.h if (x == 0) return SIZEOF_LONG * CHAR_BIT;
CHAR_BIT 186 internal.h # if 64 < SIZEOF_LONG * CHAR_BIT
CHAR_BIT 188 internal.h # elif 32 < SIZEOF_LONG * CHAR_BIT
CHAR_BIT 193 internal.h # if 64 < SIZEOF_LONG * CHAR_BIT
CHAR_BIT 196 internal.h # if 32 < SIZEOF_LONG * CHAR_BIT
CHAR_BIT 213 internal.h if (x == 0) return SIZEOF_LONG_LONG * CHAR_BIT;
CHAR_BIT 217 internal.h # if 64 < SIZEOF_LONG_LONG * CHAR_BIT
CHAR_BIT 219 internal.h # elif 32 < SIZEOF_LONG_LONG * CHAR_BIT
CHAR_BIT 224 internal.h # if 64 < SIZEOF_LONG_LONG * CHAR_BIT
CHAR_BIT 227 internal.h # if 32 < SIZEOF_LONG_LONG * CHAR_BIT
CHAR_BIT 409 internal.h (sizeof(x) <= SIZEOF_INT ? SIZEOF_INT * CHAR_BIT - nlz_int((unsigned int)(x)) : \
CHAR_BIT 410 internal.h sizeof(x) <= SIZEOF_LONG ? SIZEOF_LONG * CHAR_BIT - nlz_long((unsigned long)(x)) : \
CHAR_BIT 411 internal.h sizeof(x) <= SIZEOF_LONG_LONG ? SIZEOF_LONG_LONG * CHAR_BIT - nlz_long_long((unsigned LONG_LONG)(x)) : \
CHAR_BIT 412 internal.h SIZEOF_INT128_T * CHAR_BIT - nlz_int128((uint128_t)(x)))
CHAR_BIT 415 internal.h (sizeof(x) <= SIZEOF_INT ? SIZEOF_INT * CHAR_BIT - nlz_int((unsigned int)(x)) : \
CHAR_BIT 416 internal.h sizeof(x) <= SIZEOF_LONG ? SIZEOF_LONG * CHAR_BIT - nlz_long((unsigned long)(x)) : \
CHAR_BIT 417 internal.h SIZEOF_LONG_LONG * CHAR_BIT - nlz_long_long((unsigned LONG_LONG)(x)))
CHAR_BIT 420 internal.h (sizeof(x) <= SIZEOF_INT ? SIZEOF_INT * CHAR_BIT - nlz_int((unsigned int)(x)) : \
CHAR_BIT 421 internal.h SIZEOF_LONG * CHAR_BIT - nlz_long((unsigned long)(x)))
CHAR_BIT 31 marshal.c #define BITSPERSHORT (2*CHAR_BIT)
CHAR_BIT 16 missing/ffs.c #if 32 < SIZEOF_INT * CHAR_BIT
CHAR_BIT 279 node.h #define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1)
CHAR_BIT 767 numeric.c char buf[float_dig + (decimal_mant + CHAR_BIT - 1) / CHAR_BIT + 10];
CHAR_BIT 3152 numeric.c char buf[SIZEOF_VALUE*CHAR_BIT + 1], *const e = buf + sizeof buf, *b = e;
CHAR_BIT 3310 numeric.c #define SQRT_LONG_MAX ((SIGNED_VALUE)1<<((SIZEOF_LONG*CHAR_BIT-1)/2))
CHAR_BIT 4185 numeric.c if (width > (SIZEOF_LONG*CHAR_BIT-1)
CHAR_BIT 4186 numeric.c || ((unsigned long)val)>>(SIZEOF_LONG*CHAR_BIT-1-width) > 0) {
CHAR_BIT 4231 numeric.c if (i >= sizeof(long)*CHAR_BIT-1) {
CHAR_BIT 4290 numeric.c if (SIZEOF_LONG*CHAR_BIT-1 <= i) {
CHAR_BIT 665 parse.c #define nd_term(node) SIGN_EXTEND((node)->u2.id, CHAR_BIT*2)
CHAR_BIT 667 parse.c #define nd_paren(node) (char)((node)->u2.id >> CHAR_BIT*2)
CHAR_BIT 12073 parse.c rb_node_newnode(NODE_STRTERM, (func), (term) | ((paren) << (CHAR_BIT * 2)), 0)
CHAR_BIT 14931 parse.c stack_type mask = (stack_type)1U << (CHAR_BIT * sizeof(stack_type) - 1);
CHAR_BIT 15033 parse.c #define LVAR_USED ((ID)1 << (sizeof(ID) * CHAR_BIT - 1))
CHAR_BIT 611 parse.y #define nd_term(node) SIGN_EXTEND((node)->u2.id, CHAR_BIT*2)
CHAR_BIT 613 parse.y #define nd_paren(node) (char)((node)->u2.id >> CHAR_BIT*2)
CHAR_BIT 6400 parse.y rb_node_newnode(NODE_STRTERM, (func), (term) | ((paren) << (CHAR_BIT * 2)), 0)
CHAR_BIT 9258 parse.y stack_type mask = (stack_type)1U << (CHAR_BIT * sizeof(stack_type) - 1);
CHAR_BIT 9360 parse.y #define LVAR_USED ((ID)1 << (sizeof(ID) * CHAR_BIT - 1))
CHAR_BIT 277 random.c #define SIZEOF_INT32 (31/CHAR_BIT + 1)
CHAR_BIT 561 random.c seed[0] ^= (uint32_t)((time_t)tv.tv_sec >> SIZEOF_INT * CHAR_BIT);
CHAR_BIT 566 random.c seed[2] ^= (uint32_t)((VALUE)&seed >> SIZEOF_INT * CHAR_BIT);
CHAR_BIT 991 random.c const int w = sizeof(limit) * CHAR_BIT - nlz_long(limit);
CHAR_BIT 998 random.c ~(~0UL << n * CHAR_BIT);
CHAR_BIT 1095 random.c r >>= CHAR_BIT;
CHAR_BIT 1102 random.c r >>= CHAR_BIT;
CHAR_BIT 1489 random.c #if SIZEOF_ST_INDEX_T*CHAR_BIT > 4*8
CHAR_BIT 1493 random.c #if SIZEOF_ST_INDEX_T*CHAR_BIT > 8*8
CHAR_BIT 1497 random.c #if SIZEOF_ST_INDEX_T*CHAR_BIT > 12*8
CHAR_BIT 275 rational.c const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
CHAR_BIT 123 re.c VALUE hx, hy, mask = VALUE_MAX >> ((SIZEOF_VALUE - m) * CHAR_BIT);
CHAR_BIT 133 re.c hx <<= CHAR_BIT;
CHAR_BIT 134 re.c hy <<= CHAR_BIT;
CHAR_BIT 142 re.c hy <<= CHAR_BIT;
CHAR_BIT 883 sprintf.c 1, CHAR_BIT-numbits, INTEGER_PACK_BIG_ENDIAN);
CHAR_BIT 917 sprintf.c 1, CHAR_BIT-numbits, INTEGER_PACK_2COMP | INTEGER_PACK_BIG_ENDIAN);
CHAR_BIT 1481 st.c t |= data_at(n) << CHAR_BIT*(SIZEOF_ST_INDEX_T - (n) - 2)
CHAR_BIT 1484 st.c t |= data_at(n) << CHAR_BIT*(n)
CHAR_BIT 1491 st.c t >>= (CHAR_BIT * align) - CHAR_BIT;
CHAR_BIT 1493 st.c t <<= (CHAR_BIT * align);
CHAR_BIT 1499 st.c sl = CHAR_BIT * (SIZEOF_ST_INDEX_T-align);
CHAR_BIT 1500 st.c sr = CHAR_BIT * align;
CHAR_BIT 1520 st.c d |= data_at(n) << CHAR_BIT*(SIZEOF_ST_INDEX_T - (n) - 1)
CHAR_BIT 1523 st.c d |= data_at(n) << CHAR_BIT*(n)
CHAR_BIT 1556 st.c t |= data_at(n) << CHAR_BIT*(SIZEOF_ST_INDEX_T - (n) - 1)
CHAR_BIT 1559 st.c t |= data_at(n) << CHAR_BIT*(n)
CHAR_BIT 1589 st.c #if SIZEOF_ST_INDEX_T*CHAR_BIT > 12*8
CHAR_BIT 1592 st.c #if SIZEOF_ST_INDEX_T*CHAR_BIT > 8*8
CHAR_BIT 1595 st.c #if SIZEOF_ST_INDEX_T*CHAR_BIT > 4*8
CHAR_BIT 1601 st.c #if SIZEOF_ST_INDEX_T*CHAR_BIT > 4*8
CHAR_BIT 1604 st.c #if SIZEOF_ST_INDEX_T*CHAR_BIT > 8*8
CHAR_BIT 1607 st.c #if SIZEOF_ST_INDEX_T*CHAR_BIT > 12*8
CHAR_BIT 8438 string.c if (bits < (int)sizeof(long)*CHAR_BIT) {
CHAR_BIT 989 vsnprintf.c prec = (int)(sizeof(void*)*CHAR_BIT/4);
CHAR_BIT 1850 win32/win32.c #define GetBit(bits, i) ((bits)[(i) / CHAR_BIT] & (1 << (i) % CHAR_BIT))
CHAR_BIT 1851 win32/win32.c #define SetBit(bits, i) ((bits)[(i) / CHAR_BIT] |= (1 << (i) % CHAR_BIT))
CHAR_BIT 1855 win32/win32.c #define DIRENT_PER_CHAR (CHAR_BIT / 2)