1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
///
/// @file api_c.c
/// @brief Test primecount's C API.
///
/// Copyright (C) 2023 Kim Walisch, <kim.walisch@gmail.com>
///
/// This file is distributed under the BSD License. See the COPYING
/// file in the top level directory.
///
#include <primecount.h>
#include <stdint.h>
#include <inttypes.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void check(int OK)
{
if (OK)
printf(" OK\n");
else
{
printf(" ERROR\n");
exit(1);
}
}
int main(void)
{
printf("primecount version: %s\n", primecount_version());
printf("threads: %d\n", primecount_get_num_threads());
primecount_set_num_threads(3);
printf("new threads: %d\n", primecount_get_num_threads());
// Test 64-bit pi(-x)
int64_t n = -1;
int64_t res = primecount_pi(n);
printf("primecount_pi(%"PRId64") = %"PRId64, n, res);
check(res == 0);
n = -9223372036854775807;
res = primecount_pi(n);
printf("primecount_pi(%"PRId64") = %"PRId64, n, res);
check(res == 0);
char out[32];
primecount_pi_str("-1", out, sizeof(out));
printf("primecount_pi_str(-1) = %s", out);
check(strcmp(out, "0") == 0);
if (strlen(primecount_get_max_x()) > 25)
{
// Test 128-bit pi(-x)
primecount_pi_str("-1208925819614629174696176", out, sizeof(out));
printf("primecount_pi_str(-1208925819614629174696176) = %s", out);
check(strcmp(out, "0") == 0);
// Test using INT128_MIN+1
primecount_pi_str("-170141183460469231731687303715884105727", out, sizeof(out));
printf("primecount_pi_str(-170141183460469231731687303715884105727) = %s", out);
check(strcmp(out, "0") == 0);
}
n = (int64_t) 1e10;
res = primecount_pi(n);
printf("primecount_pi(%"PRId64") = %"PRId64, n, res);
check(res == 455052511);
n = 455052511;
res = primecount_nth_prime(n);
printf("primecount_nth_prime(%"PRId64") = %"PRId64, n, res);
check(res == 9999999967);
// nth_prime(-1) is an error and should hence return -1
// which indicates an error in the libprimecount C API.
n = -1;
res = primecount_nth_prime(n);
printf("primecount_nth_prime(%"PRId64") = %"PRId64, n, res);
check(res == -1);
n = (int64_t) 1e12;
int64_t a = 78498;
res = primecount_phi(n, a);
printf("primecount_phi(%"PRId64", %"PRId64") = %"PRId64, n , a, res);
check(res == 37607833521);
n = -1;
res = primecount_phi(n, a);
printf("primecount_phi(%"PRId64", %"PRId64") = %"PRId64, n , a, res);
check(res == 0);
const char* in = "1000000000000";
primecount_pi_str(in, out, sizeof(out));
printf("primecount_pi_str(%s) = %s", in, out);
check(strcmp(out, "37607912018") == 0);
printf("\n");
printf("All tests passed successfully!\n");
return 0;
}
|
