crypto/libressl/crypto/bn/bn_bpsw.c

414

if ((mod = BN_mod_word(n, primes[i])) == (BN_ULONG)-1)

crypto/libressl/crypto/bn/bn_bpsw.c

417

*is_prime = BN_is_word(n, primes[i]);

crypto/libressl/crypto/bn/bn_prime.c

295

BN_ULONG mod = BN_mod_word(a, primes[i]);

crypto/libressl/crypto/bn/bn_prime.c

299

return BN_is_word(a, primes[i]);

crypto/libressl/crypto/bn/bn_prime.c

420

BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);

crypto/libressl/crypto/bn/bn_prime.c

425

maxdelta = BN_MASK2 - primes[NUMPRIMES - 1];

crypto/libressl/crypto/bn/bn_prime.c

431

if (((mods[i] + delta) % primes[i]) <= 1) {

crypto/libressl/crypto/bn/bn_prime.c

477

BN_LONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);

crypto/libressl/crypto/bn/bn_prime.c

542

BN_ULONG pmod = BN_mod_word(p, (BN_ULONG)primes[i]);

crypto/libressl/crypto/bn/bn_prime.c

543

BN_ULONG qmod = BN_mod_word(q, (BN_ULONG)primes[i]);

crypto/libressl/crypto/bn/bn_prime.h

64

static const prime_t primes[NUMPRIMES] = {

games/primes/primes.c

154

primes(start, stop);

games/primes/primes.c

80

static void primes(ubig, ubig);

sys/kern/kern_subr.c

380

static int primes[] = { 1, 13, 31, 61, 127, 251, 509, 761, 1021, 1531, 2039,

sys/kern/kern_subr.c

383

#define NPRIMES NELEM(primes)

sys/kern/kern_subr.c

397

for (i = 1, hashsize = primes[1]; hashsize <= elements;) {

sys/kern/kern_subr.c

401

hashsize = primes[i];

sys/kern/kern_subr.c

403

hashsize = primes[i - 1];

sys/kern/kern_subr.c

428

for (i = 1, hashsize = primes[1]; hashsize <= elements;) {

sys/kern/kern_subr.c

432

hashsize = primes[i];

sys/kern/kern_subr.c

434

hashsize = primes[i - 1];