| line |
true |
false |
branch |
|
44
|
34 |
76362 |
if (n <= 2) |
|
47
|
76173 |
189 |
if (n <= cache->last_count_n) { |
|
52
|
0 |
189 |
if (n <= cache->last_bmask_n) { |
|
98
|
0 |
42 |
MPUverbose(2, " Prime Count Cache (max %lu):\n", (UV)cache->last_n); |
|
99
|
0 |
42 |
MPUverbose(2, " Small: %lu (%luk) Mask: %lu (%luk)\n", |
|
|
0 |
0 |
MPUverbose(2, " Small: %lu (%luk) Mask: %lu (%luk)\n", |
|
104
|
0 |
42 |
MPUverbose(2, " Lookups Small %lu Mask %lu LMO %lu\n", |
|
107
|
42 |
0 |
if (cache->count != 0) |
|
109
|
0 |
42 |
if (cache->bm_count != 0) |
|
111
|
0 |
42 |
if (cache->bm_mask != 0) |
|
123
|
0 |
36 |
if (n < 5) n = 5; |
|
127
|
0 |
36 |
if (n > UVCONST( 34359738367)) n = UVCONST( 34359738367); |
|
142
|
36 |
0 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
36 |
0 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
72 |
28966 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
72 |
0 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
36 |
36 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
8128 |
20838 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
3 |
8174 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
49 |
8125 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
3 |
8125 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
0 |
28963 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
|
33 |
29002 |
START_DO_FOR_EACH_PRIME(3, count_last_n) { |
|
143
|
93705 |
29002 |
while (idx < ((p-1)>>1)) counts[idx++] = cnt; |
|
146
|
79 |
36 |
while (idx <= count_last_idx) counts[idx++] = cnt; |
|
153
|
0 |
36 |
if (n > cache->last_count_n) { |
|
165
|
0 |
0 |
while (next_segment_primes(ctx, &seg_base, &seg_low, &seg_high)) { |
|
166
|
0 |
0 |
START_DO_FOR_EACH_SIEVE_PRIME( segment, seg_base, seg_low, seg_high ) |
|
|
0 |
0 |
START_DO_FOR_EACH_SIEVE_PRIME( segment, seg_base, seg_low, seg_high ) |
|
|
0 |
0 |
START_DO_FOR_EACH_SIEVE_PRIME( segment, seg_base, seg_low, seg_high ) |
|
|
0 |
0 |
START_DO_FOR_EACH_SIEVE_PRIME( segment, seg_base, seg_low, seg_high ) |
|
|
0 |
0 |
START_DO_FOR_EACH_SIEVE_PRIME( segment, seg_base, seg_low, seg_high ) |
|
175
|
0 |
0 |
for (i = 1; i < words; i++) |
|
193
|
0 |
6 |
MPUassert(primes != 0, "prime_count_cache_create called with null pointer"); |
|
194
|
0 |
6 |
if (lastidx <= 1) return prime_count_cache_create(5); |
|
195
|
0 |
6 |
if (lastidx > 203280221) lastidx = 203280221; |
|
208
|
5272 |
6 |
for (i = 2; i <= lastidx; i++) { |
|
210
|
0 |
5272 |
if (p > count_last_n) break; |
|
211
|
15531 |
5272 |
while (idx < ((p-1)>>1)) counts[idx++] = cnt; |
|
214
|
0 |
6 |
while (idx <= count_last_idx) counts[idx++] = cnt; |
|
221
|
0 |
6 |
if (n > cache->last_count_n) { |
|
229
|
0 |
0 |
for (i = 2; i <= lastidx; i++) { |
|
237
|
0 |
0 |
for (i = 1; i < words; i++) |