Searched refs:BITS_PER_CHAR (Results 1 – 5 of 5) sorted by relevance
38 #ifndef BITS_PER_CHAR39 #define BITS_PER_CHAR (8) macro
66 #if BITS_PER_CHAR != 84303 hibit = (valueT) 1 << (nbytes * BITS_PER_CHAR - 1); in emit_expr_with_reloc()4308 mask = ~(valueT) 0 << (BITS_PER_CHAR * nbytes); in emit_expr_with_reloc()4309 hibit = (valueT) 1 << (nbytes * BITS_PER_CHAR - 1); in emit_expr_with_reloc()4492 unsigned int bits_available = BITS_PER_CHAR * nbytes;4546 if ((width = exp->X_add_number) > (BITS_PER_CHAR * nbytes))4549 width, nbytes, (BITS_PER_CHAR * nbytes));4550 width = BITS_PER_CHAR * nbytes;4577 << ((BITS_PER_CHAR * nbytes) - bits_available));
296 return (con[1] << BITS_PER_CHAR) | con[0];299 (((con[1] << BITS_PER_CHAR) | con[0]) << (2 * BITS_PER_CHAR))300 |((con[3] << BITS_PER_CHAR) | con[2]);
143 unsigned int bits_available = BITS_PER_CHAR * nbytes; in l_cons()179 (unsigned int)(BITS_PER_CHAR * nbytes)) in l_cons()181 …h %lu too big to fit in %d bytes: truncated to %d bits"), width, nbytes, (BITS_PER_CHAR * nbytes)); in l_cons()182 width = BITS_PER_CHAR * nbytes; in l_cons()210 << ((BITS_PER_CHAR * nbytes) - bits_available)); in l_cons()
309 retval <<= BITS_PER_CHAR; in md_chars_to_number()