| /lib/ |
| D | atomic64_test.c | 23 #define TEST(bit, op, c_op, val) \ argument
25 atomic##bit##_set(&v, v0); \
27 atomic##bit##_##op(val, &v); \
29 WARN(atomic##bit##_read(&v) != r, "%Lx != %Lx\n", \
30 (unsigned long long)atomic##bit##_read(&v), \
39 #define FAMILY_TEST(test, bit, op, args...) \ argument
41 test(bit, op, ##args); \
42 test(bit, op##_acquire, ##args); \
43 test(bit, op##_release, ##args); \
44 test(bit, op##_relaxed, ##args); \
[all …]
|
| D | nodemask.c | 22 int w, bit = NUMA_NO_NODE; in node_random() local
26 bit = bitmap_ord_to_pos(maskp->bits, in node_random()
28 return bit; in node_random()
|
| 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 | Kconfig | 21 This option enables the use of hardware bit-reversal instructions on
139 This is a bit slower than slice by 8, but has a smaller 4KiB lookup
153 bool "Classic Algorithm (one bit at a time)"
155 Calculate checksum one bit at a time. This is VERY slow, but has
206 This option enables the 32 bit PRNG library functions to perform a
405 them on the stack. This is a bit more expensive, but avoids
444 It only adds a little bit of code and slows kernel boot (or
455 # Generic 64-bit atomic support is selected if needed
|
| 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 | 244 int bit, end_bit; in gen_pool_destroy() local
251 bit = find_next_bit(chunk->bits, end_bit, 0); in gen_pool_destroy()
252 BUG_ON(bit < end_bit); in gen_pool_destroy()
|
| D | vsprintf.c | 873 int word, bit; in bitmap_string() local
877 bit = i % BITS_PER_LONG; in bitmap_string()
878 val = (bitmap[word] >> bit) & chunkmask; in bitmap_string()
|
| /lib/842/ |
| D | 842_decompress.c | 61 u8 bit; member
98 u8 *in = p->in, b = p->bit, bits = b + n; in next_bits()
129 p->bit += n; in next_bits()
131 if (p->bit > 7) { in next_bits()
132 p->in += p->bit / 8; in next_bits()
133 p->ilen -= p->bit / 8; in next_bits()
134 p->bit %= 8; in next_bits()
295 p.bit = 0; in sw842_decompress()
|
| D | 842_compress.c | 103 u8 bit; member
178 int b = p->bit, bits = b + n, s = round_up(bits, 8) - bits; in add_bits()
220 p->bit += n; in add_bits()
222 if (p->bit > 7) { in add_bits()
223 p->out += p->bit / 8; in add_bits()
224 p->olen -= p->bit / 8; in add_bits()
225 p->bit %= 8; in add_bits()
506 p->bit = 0; in sw842_compress()
596 if (p->bit) { in sw842_compress()
599 p->bit = 0; in sw842_compress()
|
| /lib/mpi/ |
| D | Makefile | 16 mpi-bit.o \
|
| /lib/raid6/ |
| D | s390vx.uc | 28 * vector register y left by 1 bit and stores the result in
38 * operation returns 0xFF if the high bit of the byte is 1,
39 * or 0x00 if the high bit is 0. The result is stored in vector
|
| 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 | tilegx.uc | 41 * bit is 1, 0x00 for any byte for which the high bit is 0.
|
| D | altivec.uc | 54 * bit is 1, 0x00 for any byte for which the high bit is 0.
|
| D | neon.uc | 45 * bit is 1, 0x00 for any byte for which the high bit is 0.
|
| /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()
|
| /lib/fonts/ |
| D | Kconfig | 58 Console font with characters just a bit smaller than the default.
|