25 static int probable_prime(BIGNUM *rnd, int bits, int safe, prime_t *mods);
26 static int probable_prime_dh(BIGNUM *rnd, int bits, int safe, prime_t *mods,
272 static int probable_prime(BIGNUM *rnd, int bits, int safe, prime_t *mods)  in probable_prime()  argument
280     if (!BN_priv_rand(rnd, bits, BN_RAND_TOP_TWO, BN_RAND_BOTTOM_ODD))  in probable_prime()
282     if (safe && !BN_set_bit(rnd, 1))  in probable_prime()
286         BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);  in probable_prime()
302                 && square(primes[i]) > BN_get_word(rnd) + delta)  in probable_prime()
312     if (!BN_add_word(rnd, delta))  in probable_prime()
314     if (BN_num_bits(rnd) != bits)  in probable_prime()
316     bn_check_top(rnd);  in probable_prime()
320 static int probable_prime_dh(BIGNUM *rnd, int bits, int safe, prime_t *mods,  in probable_prime_dh()  argument
337     if (!BN_rand(rnd, bits, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ODD))  in probable_prime_dh()
342     if (!BN_mod(t1, rnd, add, ctx))  in probable_prime_dh()
344     if (!BN_sub(rnd, rnd, t1))  in probable_prime_dh()
347         if (!BN_add_word(rnd, safe ? 3u : 1u))  in probable_prime_dh()
350         if (!BN_add(rnd, rnd, rem))  in probable_prime_dh()
354     if (BN_num_bits(rnd) < bits  in probable_prime_dh()
355             || BN_get_word(rnd) < (safe ? 5u : 3u)) {  in probable_prime_dh()
356         if (!BN_add(rnd, rnd, add))  in probable_prime_dh()
362         BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);  in probable_prime_dh()
372                 && square(primes[i]) > BN_get_word(rnd) + delta)  in probable_prime_dh()
383     if (!BN_add_word(rnd, delta))  in probable_prime_dh()
389     bn_check_top(rnd);  in probable_prime_dh()