| line |
true |
false |
branch |
|
70
|
1886 |
2 |
for (i = b; i > a; i--) { |
|
73
|
1610 |
276 |
: lastwpc + segment_prime_count(lastw+1, w); |
|
89
|
0 |
1 |
if (maxn > 4294967291U) maxn = 4294967291U; |
|
91
|
0 |
1 |
MPUassert(lastidx >= b, "failed to generate enough primes\n"); |
|
105
|
1 |
1 |
if (n < SIEVE_LIMIT) |
|
118
|
2 |
1 |
if (n < SIEVE_LIMIT) |
|
137
|
5 |
1 |
if (n < SIEVE_LIMIT) |
|
141
|
0 |
1 |
if (n == UV_MAX) { |
|
142
|
0 |
0 |
if ( (n%3) == 0 || (n%5) == 0 || (n%7) == 0 || (n%31) == 0 ) |
|
|
0 |
0 |
if ( (n%3) == 0 || (n%5) == 0 || (n%7) == 0 || (n%31) == 0 ) |
|
|
0 |
0 |
if ( (n%3) == 0 || (n%5) == 0 || (n%7) == 0 || (n%31) == 0 ) |
|
|
0 |
0 |
if ( (n%3) == 0 || (n%5) == 0 || (n%7) == 0 || (n%31) == 0 ) |
|
148
|
0 |
1 |
if (verbose > 0) printf("lehmer %lu stage 1: calculate a,b,c \n", n); |
|
156
|
0 |
1 |
if (verbose > 0) printf("lehmer %lu stage 2: phi(x,a) (z=%lu a=%lu b=%lu c=%lu)\n", n, z, a, b, c); |
|
164
|
0 |
1 |
MPUassert(lastidx >= b, "failed to generate enough primes\n"); |
|
166
|
0 |
1 |
if (verbose > 0) printf("lehmer %lu stage 3: %lu small primes\n", n, lastidx); |
|
184
|
0 |
1 |
if (verbose > 0) printf("lehmer %lu stage 4: loop %lu to %lu, pc to %lu\n", n, a+1, b, n/primes[a+1]); |
|
189
|
998 |
1 |
for (i = b; i >= a+1; i--) { |
|
192
|
0 |
998 |
: lastwpc + segment_prime_count(lastw+1, w); |
|
195
|
55 |
943 |
if (i <= c) { |
|
197
|
2838 |
55 |
for (j = i; j <= bi; j++) { |
|
225
|
0 |
1 |
if (n < SIEVE_LIMIT) |
|
234
|
0 |
1 |
MPUassert(lastidx >= b, "failed to generate enough primes\n"); |
|
240
|
0 |
1 |
Newz(0, lpf, n13+1, uint32_t); |
|
242
|
404 |
1 |
for (i = 1; i <= n13; i++) { |
|
244
|
798 |
404 |
for (j = primei; j <= n13; j += primei) { |
|
246
|
403 |
395 |
if (lpf[j] == 0) lpf[j] = primei; |
|
249
|
176 |
404 |
for (j = k; j <= n13; j += k) |
|
255
|
404 |
1 |
for (i = 1; i <= n13; i++) |
|
256
|
158 |
246 |
if (mu[i] == 0) |
|
261
|
1 |
0 |
c = (a < tiny_phi_max_a()) ? a : tiny_phi_max_a(); |
|
268
|
404 |
1 |
for (i = 1; i <= n13; i++) |
|
269
|
76 |
328 |
if (lpf[i] > primec) |
|
275
|
72 |
1 |
for (i = c; i+1 < a; i++) { |
|
277
|
28831 |
72 |
for (j = (n13/p)+1; j <= n13; j++) |
|
278
|
2626 |
26205 |
if (lpf[j] > p) |