CHAR_BIT
# ifdef CHAR_BIT
# define BITSPERBYTE CHAR_BIT
return (uintmax_t)a << (b & (sizeof(uintmax_t) * CHAR_BIT - 1));
return a >> (b & (sizeof(uintmax_t) * CHAR_BIT - 1));
#define DIGITS(var) (3 + (2 + CHAR_BIT * sizeof((var))) / 3)
#define SPACE_NEEDED ((int)((sizeof(intmax_t) * CHAR_BIT + 2) / 3 + 2))
ASSERT((sizeof(*pNumber) * CHAR_BIT < WIDTH_64) || (zDeserializeTypeWidth(pType) >= WIDTH_64));
if (sizeof(ulNumber) * CHAR_BIT < WIDTH_64) {
if (sizeof(ulNumber) * CHAR_BIT < WIDTH_64) {
if (sizeof(ulNumber) * CHAR_BIT < WIDTH_64) {
#define QUAD_BITS (sizeof(quad_t) * CHAR_BIT)
#define INT_BITS (sizeof(int) * CHAR_BIT)
#define HALF_BITS (sizeof(int) * CHAR_BIT / 2)
__CTASSERT(CHAR_BIT*sizeof(x) == 64);
__CTASSERT(CHAR_BIT*sizeof(x) == 32);
__CTASSERT(CHAR_BIT*sizeof(x) == 64);
#define BITS (CHAR_BIT * sizeof (unsigned int))
#define NCHARS (1 << CHAR_BIT)
#define BITS_PER_INT (sizeof(int) * CHAR_BIT)
for (i = 1; i < CHAR_BIT*sizeof(*relr); i++, where++) {
__CTASSERT(CHAR_BIT * sizeof n <= (ilog2(crypto_core_OUTPUTBYTES) +
#define _CTYPE_NUM_CHARS (1 << CHAR_BIT)
# define BACKSL (1<<CHAR_BIT)
else if (g->nstates <= CHAR_BIT*sizeof(states1) && !(eflags®_LARGE))
#define SQRT_SIZE_MAX (((size_t)1) << (sizeof(size_t) * CHAR_BIT / 2))
#define BLOOM_BITS (BLOOM_SIZE * CHAR_BIT)
#define BLOOM_DIV (sizeof(size_t) * CHAR_BIT)
#define TYPE_BIT(type) (CHAR_BIT * (ptrdiff_t) sizeof(type))
(/*LINTED*/((type)~(type)0 >> (sizeof(type) * CHAR_BIT - 1)) == (type)-1)
enum { atime_shift = CHAR_BIT * sizeof(time_t) - 2 };
#define LONG_STR_MAX ((CHAR_BIT * sizeof(long)) / 3)
for (i = 1; i < CHAR_BIT*sizeof(*relr); i++, where++) {
cp = &cg_inosused(cgp, 0)[(inosused - 1) / CHAR_BIT];
for ( ; inosused > 0; inosused -= CHAR_BIT, cp--) {
for (i = 1 << (CHAR_BIT - 1); i > 0; i >>= 1) {
cp = &cg_inosused(cgp, 0)[(inosused - 1) / CHAR_BIT];
for ( ; inosused > 0; inosused -= CHAR_BIT, cp--) {
for (i = 1 << (CHAR_BIT - 1); i > 0; i >>= 1) {
inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
blkmapsize = howmany(fs->fs_fpg, CHAR_BIT);
howmany(ffs_fragstoblks(fs, fs->fs_fpg), CHAR_BIT);
for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
howmany(sblock.fs_fpg, CHAR_BIT);
howmany(sblock.fs_fpg, CHAR_BIT) - sizeof(int32_t);
howmany(ffs_fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT);
if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) {
used < (1 << (unsigned)((CHAR_BIT * sizeof(mp_word)) - (2 * DIGIT_BIT))));
mu = *tmpc >> (sizeof(mp_digit) * CHAR_BIT - 1);
mu = *tmpc >> (sizeof(mp_digit) * CHAR_BIT - 1);
carry = *tmpc >> ((mp_digit)(CHAR_BIT * sizeof(mp_digit) - 1));
carry = *tmpc >> ((mp_digit)(CHAR_BIT * sizeof(mp_digit) - 1));
#define MP_WARRAY /*LINTED*/(1U << (((sizeof(mp_word) * CHAR_BIT) - (2 * DIGIT_BIT) + 1)))
for (i = 0; i < CHAR_BIT; i++) { /* Walking zero */
for (i = 0; i < CHAR_BIT; i++) { /* Walking one */
for (i = 0; i < CHAR_BIT; i++) { /* Walking zero */
for (i = 0; i < CHAR_BIT; i++) { /* Walking one */
for (i = 0; i < CHAR_BIT; i++) { /* Walking zero */
for (i = 0; i < CHAR_BIT; i++) { /* Walking one */
key2 = key + keylen / CHAR_BIT;
for (i = 0; i < CHAR_BIT; i++) { /* Walking zero */
for (i = 0; i < CHAR_BIT; i++) { /* Walking one */
#if SIZE_MAX <= UINT32_MAX*(64/CHAR_BIT)
*retval = sizeof(off_t) * CHAR_BIT;
#define FIXPT_MAX ((fixpt_t)((UINTMAX_C(1) << sizeof(fixpt_t) * CHAR_BIT) - 1))
#define BITMAP_SIZE (CHAR_BIT * sizeof(pool_item_bitmap_t))
#define BITMAP_MIN_SIZE (CHAR_BIT * sizeof(((struct pool_item_header *)NULL)->ph_u2))
>> ((sizeof(uintptr_t) - sizeof(uint8_t))) * CHAR_BIT);
BITMAP_MIN_SIZE / CHAR_BIT == sizeof(struct pool_item_header));
if (pp->pr_itemsperpage <= bmapsize * CHAR_BIT) {
(size_t)(fds) : CHAR_BIT * (sz))) { \
nd -= sizeof(smallbits) * CHAR_BIT;
KASSERT(off < (sizeof(uint64_t) * CHAR_BIT));
if (*rtm_type >= sizeof(msgfilter) * CHAR_BIT) {
if (rtm.rtm_type >= sizeof(rop->rocb_msgfilter) * CHAR_BIT)
#define VMEM_MAXORDER (sizeof(vmem_size_t) * CHAR_BIT)
CHAR_BIT*sizeof(int),
CHAR_BIT*sizeof(long),
CHAR_BIT*sizeof(long long),
for (i = 0; i < CHAR_BIT*sizeof(long long); i++) {
if (i < CHAR_BIT*sizeof(int)) {
if (i < CHAR_BIT*sizeof(long)) {
if (i < CHAR_BIT*sizeof(long long)) {
if (i < CHAR_BIT*sizeof(int32_t)) {
if (i < CHAR_BIT*sizeof(int64_t)) {
char str[sizeof(int) * CHAR_BIT + 1];
if (sizeof(float) * CHAR_BIT != 32)
if (sizeof(double) * CHAR_BIT != 64)
const int HTBITS = CHAR_BIT * sizeof(tmp);
char str[sizeof(int) * CHAR_BIT + 1];
((sizeof (int) * CHAR_BIT - 1) * 302 / 1000 + 2)
char flag[1 << CHAR_BIT];
char num[1 + sizeof(n) * CHAR_BIT + 1];
unsigned align_in_bits = align * CHAR_BIT;
v ^= v >> (sizeof(v) * CHAR_BIT - sizeof(v));
acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
howmany(sblock.fs_fpg, CHAR_BIT);
howmany(sblock.fs_fpg, CHAR_BIT) - sizeof(int32_t);
howmany(ffs_fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT);
if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) {
for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
assert(BM_COUNT < (sizeof(uint64_t) * CHAR_BIT));