CHAR_BIT           28 bignum.c       #define BITSPERDIG (SIZEOF_BDIGITS*CHAR_BIT)
CHAR_BIT          520 bignum.c           if (len <= (sizeof(long)*CHAR_BIT)) {
CHAR_BIT          842 bignum.c       	bits = (SIZEOF_LONG*CHAR_BIT - 1)/2 + 1;
CHAR_BIT          890 dir.c          #define GLOB_VERBOSE	(1UL << (sizeof(int) * CHAR_BIT - 1))
CHAR_BIT          776 ext/ripper/ripper.c #define nd_term(node) SIGN_EXTEND((node)->u2.id, CHAR_BIT*2)
CHAR_BIT          778 ext/ripper/ripper.c #define nd_paren(node) (char)((node)->u2.id >> CHAR_BIT*2)
CHAR_BIT         11207 ext/ripper/ripper.c 	rb_node_newnode(NODE_STRTERM, (func), (term) | ((paren) << (CHAR_BIT * 2)), 0)
CHAR_BIT          472 ext/ripper/ripper.y #define nd_term(node) SIGN_EXTEND((node)->u2.id, CHAR_BIT*2)
CHAR_BIT          474 ext/ripper/ripper.y #define nd_paren(node) (char)((node)->u2.id >> CHAR_BIT*2)
CHAR_BIT         5807 ext/ripper/ripper.y 	rb_node_newnode(NODE_STRTERM, (func), (term) | ((paren) << (CHAR_BIT * 2)), 0)
CHAR_BIT          803 ext/stringio/stringio.c     for (c = 0; c < (1 << CHAR_BIT); c++) {
CHAR_BIT          906 ext/stringio/stringio.c 		long skip[1 << CHAR_BIT], pos;
CHAR_BIT          235 file.c         #define ST2UINT(val) ((val) & ~(~1UL << (sizeof(val) * CHAR_BIT - 1)))
CHAR_BIT          145 include/ruby/ruby.h # ifndef CHAR_BIT
CHAR_BIT           38 include/ruby/st.h #ifndef CHAR_BIT
CHAR_BIT           67 include/ruby/st.h #define ST_INDEX_BITS (sizeof(st_index_t) * CHAR_BIT)
CHAR_BIT          974 iseq.c             char buff[8 + (sizeof(idx) * CHAR_BIT * 32 / 100)];
CHAR_BIT           26 marshal.c      #define BITSPERSHORT (2*CHAR_BIT)
CHAR_BIT          853 missing/vsnprintf.c 		        prec = sizeof(void*)*CHAR_BIT/4;
CHAR_BIT          282 node.h         #define NODE_LMASK  (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1)
CHAR_BIT         2004 numeric.c          char buf[SIZEOF_VALUE*CHAR_BIT + 2], *b = buf + sizeof buf;
CHAR_BIT         2127 numeric.c      #define SQRT_LONG_MAX ((SIGNED_VALUE)1<<((SIZEOF_LONG*CHAR_BIT-1)/2))
CHAR_BIT         2736 numeric.c          if (width > (SIZEOF_LONG*CHAR_BIT-1)
CHAR_BIT         2737 numeric.c      	|| ((unsigned long)val)>>(SIZEOF_LONG*CHAR_BIT-1-width) > 0) {
CHAR_BIT         2769 numeric.c          if (i >= sizeof(long)*CHAR_BIT-1) {
CHAR_BIT         2811 numeric.c          if (SIZEOF_LONG*CHAR_BIT-1 < i) {
CHAR_BIT          776 parse.c        #define nd_term(node) SIGN_EXTEND((node)->u2.id, CHAR_BIT*2)
CHAR_BIT          778 parse.c        #define nd_paren(node) (char)((node)->u2.id >> CHAR_BIT*2)
CHAR_BIT         11139 parse.c        	rb_node_newnode(NODE_STRTERM, (func), (term) | ((paren) << (CHAR_BIT * 2)), 0)
CHAR_BIT          472 parse.y        #define nd_term(node) SIGN_EXTEND((node)->u2.id, CHAR_BIT*2)
CHAR_BIT          474 parse.y        #define nd_paren(node) (char)((node)->u2.id >> CHAR_BIT*2)
CHAR_BIT         5807 parse.y        	rb_node_newnode(NODE_STRTERM, (func), (term) | ((paren) << (CHAR_BIT * 2)), 0)
CHAR_BIT          111 re.c               VALUE hx, hy, mask = VALUE_MAX >> ((SIZEOF_VALUE - m) * CHAR_BIT);
CHAR_BIT          118 re.c           	hx <<= CHAR_BIT;
CHAR_BIT          119 re.c           	hy <<= CHAR_BIT;
CHAR_BIT          127 re.c           	hy <<= CHAR_BIT;
CHAR_BIT           25 sprintf.c      #define BITSPERDIG (SIZEOF_BDIGITS*CHAR_BIT)
CHAR_BIT         6406 string.c           if (bits >= sizeof(long)*CHAR_BIT) {
CHAR_BIT         1429 win32/win32.c  #define GetBit(bits, i) ((bits)[(i) / CHAR_BIT] &  (1 << (i) % CHAR_BIT))
CHAR_BIT         1430 win32/win32.c  #define SetBit(bits, i) ((bits)[(i) / CHAR_BIT] |= (1 << (i) % CHAR_BIT))
CHAR_BIT         1434 win32/win32.c  #define DIRENT_PER_CHAR (CHAR_BIT / 2)