Searched refs:bit (Results 1 – 9 of 9) sorted by relevance
| /lib/ |
| D | Kconfig.kmemcheck | 81 32-bit reads from 16-bit variables where the upper 16 bits are
86 bool "kmemcheck: allow bit-field manipulation"
90 This option silences warnings that would be generated for bit-field
|
| D | decompress_unlzma.c | 362 int bit; in process_bit0() local
366 bit = match_byte & 0x100; in process_bit0()
367 prob_lit = prob + 0x100 + bit + mi; in process_bit0()
369 if (!bit) in process_bit0()
372 if (bit) in process_bit0()
|
| D | genalloc.c | 239 int bit, end_bit; in gen_pool_destroy() local
246 bit = find_next_bit(chunk->bits, end_bit, 0); in gen_pool_destroy()
247 BUG_ON(bit < end_bit); in gen_pool_destroy()
|
| D | Kconfig | 123 This is a bit slower than slice by 8, but has a smaller 4KiB lookup
137 bool "Classic Algorithm (one bit at a time)"
139 Calculate checksum one bit at a time. This is VERY slow, but has
329 them on the stack. This is a bit more expensive, but avoids
350 # Generic 64-bit atomic support is selected if needed
|
| D | bitmap.c | 378 int i, word, bit, len = 0; in bitmap_scnprintf() local
392 bit = i % BITS_PER_LONG; in bitmap_scnprintf()
393 val = (maskp[word] >> bit) & chunkmask; in bitmap_scnprintf()
|
| /lib/raid6/ |
| D | int.uc | 70 * bit is 1, 0x00 for any byte for which the high bit is 0.
77 vv = (vv << 1) - (vv >> 7); /* Overflow on the top bit is OK */
|
| D | altivec.uc | 54 * bit is 1, 0x00 for any byte for which the high bit is 0.
|
| /lib/mpi/ |
| D | Makefile | 16 mpi-bit.o \
|
| /lib/xz/ |
| D | xz_dec_lzma2.c | 500 int bit; in rc_bit() local
507 bit = 0; in rc_bit()
512 bit = 1; in rc_bit()
515 return bit; in rc_bit()
|