Searched refs:bit (Results 1 - 7 of 7) sorted by relevance
/lib/mpi/ |
H A D | Makefile | 16 mpi-bit.o \
|
/lib/ |
H A D | Kconfig | 134 This is a bit slower than slice by 8, but has a smaller 4KiB lookup 148 bool "Classic Algorithm (one bit at a time)" 150 Calculate checksum one bit at a time. This is VERY slow, but has 201 This option enables the 32 bit PRNG library functions to perform a 388 them on the stack. This is a bit more expensive, but avoids 431 It only adds a little bit of code and slows kernel boot (or 442 # Generic 64-bit atomic support is selected if needed
|
H A D | decompress_unlzma.c | 362 int bit; local 366 bit = match_byte & 0x100; 367 prob_lit = prob + 0x100 + bit + mi; 369 if (!bit) 372 if (bit)
|
H A D | genalloc.c | 78 * @start: a bit position in @map 83 * users set the same bit, one user will return remain bits, otherwise 113 * @start: a bit position in @map 118 * users clear the same bit, one user will return remain bits, 147 * @min_alloc_order: log base 2 of number of bytes each bitmap bit represents 244 int bit, end_bit; local 251 bit = find_next_bit(chunk->bits, end_bit, 0); 252 BUG_ON(bit < end_bit); 577 * @min_alloc_order: log base 2 of number of bytes each bitmap bit represents
|
H A D | bitmap.c | 107 * Shifting right (dividing) means moving bits in the MS -> LS bit 154 * direction. Zeros are fed into the vacated LS bit positions 338 * the bit offset of all zero areas this function finds is multiples of that 389 int i, word, bit, len = 0; local 403 bit = i % BITS_PER_LONG; 404 val = (maskp[word] >> bit) & chunkmask; 555 * decimal numbers, the smallest and largest bit numbers set in 566 /* current bit is 'cur', most recently seen range is [rbot, rtop] */ 597 * decimal numbers, the smallest and largest bit numbers set in 604 * %-ERANGE: bit numbe [all...] |
/lib/fonts/ |
H A D | Kconfig | 58 Console font with characters just a bit smaller than the default.
|
/lib/xz/ |
H A D | xz_dec_lzma2.c | 149 * LZMA properties or related bit masks (number of literal 158 /* If 1, it's a match. Otherwise it's a single 8-bit literal. */ 487 * Decode one bit. In some versions, this function has been splitted in three 500 int bit; local 507 bit = 0; 512 bit = 1; 515 return bit; 518 /* Decode a bittree starting from the most significant bit. */ 534 /* Decode a bittree starting from the least significant bit. */ 580 /* Decode a literal (one 8-bit byt [all...] |
Completed in 109 milliseconds