Searched refs:primes (Results 1 - 12 of 12) sorted by relevance
/freebsd-10.0-release/games/primes/ |
H A D | Makefile | 4 PROG= primes 5 SRCS= pattern.c pr_tbl.c primes.c
|
H A D | primes.c | 41 static char sccsid[] = "@(#)primes.c 8.5 (Berkeley) 5/10/95"; 48 * primes - generate a table of primes between two values 55 * primes [-h] [start [stop]] 57 * Print primes >= start and < stop. If stop is omitted, 61 * validation check: there are 664579 primes between 0 and 10^7 74 #include "primes.h" 89 static void primes(ubig, ubig); 163 primes(start, stop); 199 * primes 202 primes(ubig start, ubig stop) function [all...] |
/freebsd-10.0-release/crypto/openssl/crypto/bn/ |
H A D | bn_prime.h | 66 static const prime_t primes[NUMPRIMES]= variable
|
H A D | bn_prime.pl | 7 push(@primes,2); 9 loop: while ($#primes < $num-1) 14 for ($i=0; defined($primes[$i]) && $primes[$i]<=$s; $i++) 16 next loop if (($p%$primes[$i]) == 0); 18 push(@primes,$p); 93 for ($i=0; $i <= $#primes; $i++) 95 if ($primes[$i] > 256) 109 print "static const prime_t primes[NUMPRIMES]=\n\t{\n\t"; 111 for ($i=0; $i <= $#primes; [all...] |
H A D | bn_prime.c | 123 /* The quick sieve algorithm approach to weeding out primes is 266 if (BN_mod_word(a, primes[i]) == 0) 387 mods[i]=(prime_t)BN_mod_word(rnd,(BN_ULONG)primes[i]); 388 maxdelta=BN_MASK2 - primes[NUMPRIMES-1]; 393 * that gcd(rnd-1,primes) == 1 (except for 2) */ 394 if (((mods[i]+delta)%primes[i]) <= 1) 431 if (BN_mod_word(rnd,(BN_ULONG)primes[i]) <= 1) 480 * gcd(p-1,primes) == 1 (except for 2) */ 481 if ( (BN_mod_word(p,(BN_ULONG)primes[i]) == 0) || 482 (BN_mod_word(q,(BN_ULONG)primes[ [all...] |
H A D | bntest.c | 1892 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local 1894 if (!BN_set_word(p, primes[i])) goto err;
|
/freebsd-10.0-release/games/factor/ |
H A D | Makefile | 8 CFLAGS+=-I${.CURDIR}/../primes 17 MLINKS+=factor.6 primes.6 18 .PATH: ${.CURDIR}/../primes
|
/freebsd-10.0-release/games/ |
H A D | Makefile | 14 primes \
|
/freebsd-10.0-release/sys/kern/ |
H A D | subr_hash.c | 100 static const int primes[] = { 1, 13, 31, 61, 127, 251, 509, 761, 1021, 1531, variable 103 #define NPRIMES (sizeof(primes) / sizeof(primes[0])) 116 for (i = 1, hashsize = primes[1]; hashsize <= elements;) { 120 hashsize = primes[i]; 122 hashsize = primes[i - 1];
|
/freebsd-10.0-release/contrib/binutils/bfd/ |
H A D | hash.c | 310 /* These are primes that are near, but slightly smaller than, a 312 static const unsigned long primes[] = { local 336 const unsigned long *low = &primes[0]; 337 const unsigned long *high = &primes[sizeof (primes) / sizeof (primes[0])];
|
/freebsd-10.0-release/contrib/ofed/management/opensm/opensm/ |
H A D | st.c | 120 static long primes[] = { variable 166 i < sizeof(primes) / sizeof(primes[0]); i++, newsize <<= 1) { 168 return primes[i];
|
/freebsd-10.0-release/crypto/openssh/contrib/redhat/ |
H A D | openssh.spec | 488 - replace primes with moduli 693 - Add the primes file from the latest snapshot to the main package (#20884).
|
Completed in 185 milliseconds