Lines Matching defs:pool
17 * The high level overview is that there is one input pool, into which
23 * entropy collectors, described below, add data to the input pool.
100 * Returns whether or not the input pool has been seeded and thus guaranteed
105 * Returns: true if the input pool has been seeded.
106 * false if the input pool has not been seeded.
123 * Wait for the input pool to be seeded and thus guaranteed to supply
129 * Returns: 0 if the input pool has been seeded.
245 /* Used by crng_reseed() and crng_make_state() to extract a new seed from the input pool. */
248 /* This extracts a new crng key from the input pool. */
634 * This function adds bytes into the input pool. It does not
757 * add_device_randomness() adds data to the input pool that
761 * the pool, but it initializes the pool to different values for devices
766 * entropy as specified by the caller. If the entropy pool is full it will
774 * representing the current instance of a VM to the pool, without crediting,
778 * inputs to the entropy pool. Using the cycle counters and the irq source
779 * as inputs, it feeds the input pool roughly once a second or after 64
787 * entropy pool. Note that high-speed solid state drives with very low
910 * Add device- or boot-specific data to the input pool to help
914 * the entropy pool having similar initial state across largely
994 unsigned long pool[4];
1005 .pool = { SIPHASH_CONST_0, SIPHASH_CONST_1, SIPHASH_CONST_2, SIPHASH_CONST_3 },
1008 .pool = { HSIPHASH_CONST_0, HSIPHASH_CONST_1, HSIPHASH_CONST_2, HSIPHASH_CONST_3 },
1056 * The size of the copied stack pool is explicitly 2 longs so that we
1062 unsigned long pool[2];
1073 * Copy the pool to the stack so that the mixer always has a
1076 memcpy(pool, fast_pool->pool, sizeof(pool));
1082 mix_pool_bytes(pool, sizeof(pool));
1083 credit_init_bits(clamp_t(unsigned int, (count & U16_MAX) / 64, 1, sizeof(pool) * 8));
1085 memzero_explicit(pool, sizeof(pool));
1096 fast_mix(fast_pool->pool, entropy,
1121 * This function adds entropy to the entropy "pool" by using timing
1123 * of how many bits of entropy this call has added to the pool. The
1124 * value "num" is also added to the pool; it should somehow describe
1135 * sometime after, so mix into the fast pool.
1138 fast_mix(this_cpu_ptr(&irq_randomness)->pool, entropy, num);
1353 * the input pool but does not credit it.
1512 /* Since we're crediting, enforce that it was all written into the pool. */
1577 * - poolsize - the number of bits of entropy that the input pool can
1581 * input pool. Always <= poolsize.
1583 * - write_wakeup_threshold - the amount of entropy in the input pool