Lines Matching refs:b
62 /* Test whether bytes represents (in big-endian base 256) a number b that
63 * is significantly above a power of 2. That is, b must not have a long run
66 * Let n be the bit-size of b, i.e. the integer such that 2^n <= b < 2^{n+1}.
67 * This function returns 1 if, when drawing a number between 0 and b,
69 * This probability is (b - 2^n) / b and this function checks that this
101 /* At this point, x = floor((b - 2^n) / 2^(n-8)). b is significantly above
279 size_t b;
280 /* If upper_bound is small, stats[b] is the number of times the value b
281 * has been generated. Otherwise stats[b] is the number of times a
282 * value with bit b set has been generated. */
326 for (b = 0; b < n_bits; b++) {
327 stats[b] += mbedtls_mpi_get_bit(&R, b);
333 for (b = min; b < stats_len; b++) {
334 mbedtls_test_set_step(1000000 + b);
339 TEST_ASSERT(stats[b] > 0);
348 for (b = 0; b < n_bits; b++) {
349 mbedtls_test_set_step(1000000 + b);
358 if (statistically_safe_all_the_way || b != n_bits - 1) {
359 TEST_ASSERT(stats[b] > 0);
361 TEST_ASSERT(stats[b] < (size_t) iterations);