131 static int probable_prime(BIGNUM *rnd, int bits);
132 static int probable_prime_dh(BIGNUM *rnd, int bits,
134 static int probable_prime_dh_safe(BIGNUM *rnd, int bits,
377 static int probable_prime(BIGNUM *rnd, int bits)  in probable_prime()  argument
384 	if (!BN_rand(rnd,bits,1,1)) return(0);  in probable_prime()
387 		mods[i]=(prime_t)BN_mod_word(rnd,(BN_ULONG)primes[i]);  in probable_prime()
401 	if (!BN_add_word(rnd,delta)) return(0);  in probable_prime()
402 	bn_check_top(rnd);  in probable_prime()
406 static int probable_prime_dh(BIGNUM *rnd, int bits,  in probable_prime_dh()  argument
415 	if (!BN_rand(rnd,bits,0,1)) goto err;  in probable_prime_dh()
419 	if (!BN_mod(t1,rnd,add,ctx)) goto err;  in probable_prime_dh()
420 	if (!BN_sub(rnd,rnd,t1)) goto err;  in probable_prime_dh()
422 		{ if (!BN_add_word(rnd,1)) goto err; }  in probable_prime_dh()
424 		{ if (!BN_add(rnd,rnd,rem)) goto err; }  in probable_prime_dh()
431 		if (BN_mod_word(rnd,(BN_ULONG)primes[i]) <= 1)  in probable_prime_dh()
433 			if (!BN_add(rnd,rnd,add)) goto err;  in probable_prime_dh()
440 	bn_check_top(rnd);  in probable_prime_dh()