games/primes/primes.c

170

primes(start, stop);

games/primes/primes.c

92

static void primes(uint64_t, uint64_t);

regress/sys/kern/nameibench/nameibench.c

109

p += primes[idx];

regress/sys/kern/nameibench/nameibench.c

45

const int primes[] = {

tests/usr.bin/indent/lsym_lparen_or_lbracket.c

116

int second_prime = &primes[1];

tests/usr.bin/indent/lsym_lparen_or_lbracket.c

120

int second_prime = &primes[1];

usr.sbin/sysinst/factor.c

101

val % primes[i] == 0) {

usr.sbin/sysinst/factor.c

102

fact_list[(*num_fact)++] = primes[i];

usr.sbin/sysinst/factor.c

103

val /= primes[i];

usr.sbin/sysinst/factor.c

48

long primes[4800];

usr.sbin/sysinst/factor.c

65

primes[0] = 2;

usr.sbin/sysinst/factor.c

66

primes[1] = 3;

usr.sbin/sysinst/factor.c

68

for (pc = primes[num_primes-1]; pc < 46345 && pc*pc <= max; pc+=2) {

usr.sbin/sysinst/factor.c

71

while (j < num_primes && primes[j] * primes[j] <= pc) {

usr.sbin/sysinst/factor.c

72

if ((rem = pc % primes[j]) == 0)

usr.sbin/sysinst/factor.c

77

primes[num_primes++] = pc;

usr.sbin/sysinst/factor.c

97

while (i < num_primes && val % primes[i] != 0) i++;