HomeSort by: relevance | last modified time | path
    Searched defs:primes (Results 1 - 4 of 4) sorted by relevancy

  /src/usr.sbin/sysinst/
factor.c 40 * primes - prime table, built to include up to 46345 because
48 long primes[4800]; variable in typeref:typename:long[4800]
62 * Initialise primes at run-time rather than compile time
65 primes[0] = 2;
66 primes[1] = 3;
68 for (pc = primes[num_primes-1]; pc < 46345 && pc*pc <= max; pc+=2) {
71 while (j < num_primes && primes[j] * primes[j] <= pc) {
72 if ((rem = pc % primes[j]) == 0)
77 primes[num_primes++] = pc
    [all...]
  /src/games/primes/
primes.c 1 /* $NetBSD: primes.c,v 1.22 2018/02/03 15:40:29 christos Exp $ */
43 static char sccsid[] = "@(#)primes.c 8.5 (Berkeley) 5/10/95";
45 __RCSID("$NetBSD: primes.c,v 1.22 2018/02/03 15:40:29 christos Exp $");
50 * primes - generate a table of primes between two values
55 * primes [-dh] [start [stop]]
57 * Print primes >= start and < stop. If stop is omitted,
61 * -h: print primes in hexadecimal
63 * validation check: there are 664579 primes between 0 and 10^7
77 #include "primes.h
209 primes(uint64_t start, uint64_t stop) function in typeref:typename:void
    [all...]
  /src/regress/sys/kern/nameibench/
nameibench.c 45 const int primes[] = { variable in typeref:typename:const int[]
109 p += primes[idx];
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/gr/
nouveau_nvkm_engine_gr_gf100.c 1875 static const u8 primes[] = { local in function:gf100_gr_oneinit_tiles
1895 for (i = 0; i < ARRAY_SIZE(primes); i++) {
1896 if (gr->tpc_total % primes[i]) {
1897 gr->screen_tile_row_offset = primes[i];

Completed in 14 milliseconds