Searched refs:primes (Results 1 - 14 of 14) sorted by relevance

/freebsd-11-stable/usr.bin/primes/
H A DMakefile4 PROG= primes
5 SRCS= pattern.c pr_tbl.c primes.c spsp.c
H A Dprimes.c41 static char sccsid[] = "@(#)primes.c 8.5 (Berkeley) 5/10/95";
44 "$FreeBSD: stable/11/usr.bin/primes/primes.c 320218 2017-06-22 05:26:08Z cperciva $";
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
75 #include "primes.h"
90 static void primes(ubi
203 primes(ubig start, ubig stop) function
[all...]
/freebsd-11-stable/crypto/openssl/crypto/bn/
H A Dbn_prime.h66 static const prime_t primes[NUMPRIMES] = { variable
H A Dbn_prime.pl7 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] = {";
111 for ($i=0; $i <= $#primes;
[all...]
H A Dbn_prime.c125 * The quick sieve algorithm approach to weeding out primes is Philip
268 if (BN_mod_word(a, primes[i]) == 0)
378 mods[i] = (prime_t) BN_mod_word(rnd, (BN_ULONG)primes[i]);
379 maxdelta = BN_MASK2 - primes[NUMPRIMES - 1];
383 * check that rnd is not a prime and also that gcd(rnd-1,primes) == 1
386 if (((mods[i] + delta) % primes[i]) <= 1) {
431 if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) {
488 * check that for p and q gcd(p-1,primes) == 1 (except for 2)
490 if ((BN_mod_word(p, (BN_ULONG)primes[i]) == 0) ||
491 (BN_mod_word(q, (BN_ULONG)primes[
[all...]
H A Dbntest.c1924 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local
1926 if (!BN_set_word(p, primes[i]))
/freebsd-11-stable/usr.bin/factor/
H A DMakefile8 CFLAGS+=-I${SRCTOP}/usr.bin/primes
16 MLINKS+=factor.6 primes.6
17 .PATH: ${SRCTOP}/usr.bin/primes
/freebsd-11-stable/sys/kern/
H A Dsubr_hash.c103 static const int primes[] = { 1, 13, 31, 61, 127, 251, 509, 761, 1021, 1531, variable
106 #define NPRIMES nitems(primes)
124 for (i = 1, hashsize = primes[1]; hashsize <= elements;) {
128 hashsize = primes[i];
130 hashsize = primes[i - 1];
/freebsd-11-stable/targets/pseudo/userland/games/
H A DMakefile.depend16 usr.bin/primes \
/freebsd-11-stable/crypto/openssh/
H A DMakefile.in361 if [ -f $(DESTDIR)$(sysconfdir)/primes ]; then \
362 echo "moving $(DESTDIR)$(sysconfdir)/primes to $(DESTDIR)$(sysconfdir)/moduli"; \
363 mv "$(DESTDIR)$(sysconfdir)/primes" "$(DESTDIR)$(sysconfdir)/moduli"; \
/freebsd-11-stable/contrib/binutils/bfd/
H A Dhash.c310 /* 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-11-stable/contrib/ofed/opensm/opensm/
H A Dst.c118 static long primes[] = { variable
164 i < sizeof(primes) / sizeof(primes[0]); i++, newsize <<= 1) {
166 return primes[i];
/freebsd-11-stable/usr.bin/
H A DMakefile219 SUBDIR.${MK_GAMES}+= primes
/freebsd-11-stable/crypto/openssh/contrib/redhat/
H A Dopenssh.spec484 - replace primes with moduli
689 - Add the primes file from the latest snapshot to the main package (#20884).

Completed in 226 milliseconds