6 #include "model-assert.h"
9 static thrd_t *threads;
10 static unsigned int *input;
11 static unsigned int *output;
12 static int num_threads;
16 thrd_t curr = thrd_current();
18 for (i = 0; i < num_threads; i++)
19 if (curr.priv == threads[i].priv)
28 unsigned int reclaimNode;
31 static void main_task(void *param)
34 int pid = *((int *)param);
37 atomic_store_explicit(&x[0], 1, memory_order_relaxed);
40 } else if (pid % 4 == 1) {
41 atomic_store_explicit(&x[1], 1, memory_order_relaxed);
42 enqueue(queue, 1, false);
43 } else if (pid % 4 == 2) {
44 succ1 = dequeue(queue, &idx1, &reclaimNode);
46 atomic_load_explicit(&x[idx1], memory_order_relaxed);
48 } else if (pid % 4 == 3) {
49 succ2 = dequeue(queue, &idx2, &reclaimNode);
51 atomic_load_explicit(&x[idx2], memory_order_relaxed);
56 int user_main(int argc, char **argv)
60 unsigned int in_sum = 0, out_sum = 0;
62 queue = calloc(1, sizeof(*queue));
66 threads = malloc(num_threads * sizeof(thrd_t));
67 param = malloc(num_threads * sizeof(*param));
68 input = calloc(num_threads, sizeof(*input));
69 output = calloc(num_threads, sizeof(*output));
71 atomic_init(&x[0], 0);
72 atomic_init(&x[1], 0);
73 atomic_init(&x[2], 0);
74 init_queue(queue, num_threads);
75 for (i = 0; i < num_threads; i++) {
77 thrd_create(&threads[i], main_task, ¶m[i]);
79 for (i = 0; i < num_threads; i++)
80 thrd_join(threads[i]);
82 for (i = 0; i < num_threads; i++) {
86 for (i = 0; i < num_threads; i++)
87 printf("input[%d] = %u\n", i, input[i]);
88 for (i = 0; i < num_threads; i++)
89 printf("output[%d] = %u\n", i, output[i]);
91 MODEL_ASSERT(in_sum == out_sum);