The example shows how to solve in the background.
Output (approximately)
./solve-async 0
pi = 3.
1415926535 8979323846 2643383279 5028841971 6939937510 5820974944
5923078164 0628620899 8628034825 3421170679 8214808651 3282306647
0938446095 5058223172 5359408128 4811174502 8410270193 8521105559
6446229489 5493038196 4428810975 6659334461 2847564823 3786783165
2712019091 4564856692 3460348610 4543266482 1339360726 0249141273
7245870066 0631558817 4881520920 9628292540 9171536436 7892590360
0113305305 4882046652 1384146951 9415116094 3305727036 5759591953
0921861173 8193261179 3105118548 0744623799 6274956735 1885752724
8912279381 8301194912 ...
Code
#ifndef WIN32
#include <stdlib.h>
#include <stdio.h>
#include <stdatomic.h>
#include <assert.h>
bool ret = true;
size_t atoms_n;
char *str = NULL;
size_t str_n = 0;
goto error;
}
printf("Model:");
for (it = atoms, ie = atoms + atoms_n; it != ie; ++it) {
size_t n;
char *str_new;
if (str_n < n) {
if (!(str_new = (char*)realloc(str, sizeof(*str) * n))) {
goto error;
}
str = str_new;
str_n = n;
}
printf(" %s", str);
}
printf("\n");
goto out;
error:
ret = false;
out:
if (atoms) { free(atoms); }
if (str) { free(str); }
return ret;
}
(void)type;
(void)event;
(void)goon;
atomic_flag *running = (atomic_flag*)data;
atomic_flag_clear(running);
}
return true;
}
int main(int argc, char const **argv) {
char const *error_message;
int ret = 0;
atomic_flag running = ATOMIC_FLAG_INIT;
uint64_t samples = 0;
uint64_t incircle = 0;
uint64_t x, y;
"1 { p(X); q(X) } 1 :- X = 1..n."
":- not n+1 { p(1..n); q(1..n) }.")) { goto error; }
atomic_flag_test_and_set(&running);
do {
++samples;
x = rand();
y = rand();
if (x * x + y * y <= (uint64_t)RAND_MAX * RAND_MAX) { incircle+= 1; }
}
while (atomic_flag_test_and_set(&running));
printf("pi = %g\n", 4.0*incircle/samples);
goto out;
error:
printf("%s\n", error_message);
out:
return ret;
}
#else
#include <stdio.h>
int main(int argc, char const **argv) {
printf("example requires c11, which is not available on windows");
return 0;
}
#endif