Searched refs:num_primes (Results 1 – 1 of 1) sorted by relevance
49 int num_primes = 2; variable68 for (pc = primes[num_primes-1]; pc < 46345 && pc*pc <= max; pc+=2) { in build_primes()71 while (j < num_primes && primes[j] * primes[j] <= pc) { in build_primes()77 primes[num_primes++] = pc; in build_primes()95 while (*num_fact < fact_size-1 && val > 1 && i < num_primes) { in factor()97 while (i < num_primes && val % primes[i] != 0) i++; in factor()100 while (*num_fact < fact_size-1 && i < num_primes && in factor()