Lines Matching defs:bits
19 * data is then "credited" as having a certain number of bits of entropy.
20 * When enough bits of entropy are available, the hash is finalized and
544 * in 32-bits.
602 * static void credit_init_bits(size_t bits)
701 #define credit_init_bits(bits) if (!crng_ready()) _credit_init_bits(bits)
703 static void __cold _credit_init_bits(size_t bits)
709 if (!bits)
712 add = min_t(size_t, bits, POOL_BITS);
791 * The last two routines try to estimate how many bits of entropy
931 * may produce endless random bits, so this function will sleep for
1059 * supposed to be sufficiently dispersed between bits so on average
1123 * of how many bits of entropy this call has added to the pool. The
1131 unsigned int bits;
1150 * Calculate number of bits of randomness we probably added.
1176 * on general principles, and limit entropy estimate to 11 bits.
1178 bits = min(fls(delta >> 1), 11);
1188 this_cpu_ptr(&irq_randomness)->count += max(1u, bits * 64) - 1;
1190 _credit_init_bits(bits);
1577 * - poolsize - the number of bits of entropy that the input pool can
1580 * - entropy_avail - the number of bits of entropy currently in the