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 reclaimNode1, reclaimNode2;
31 static void main_task(void *param)
34 int pid = *((int *)param);
36 //atomic_store_explicit(&x[0], 1, memory_order_relaxed);
37 enqueue(queue, 0, true);
40 } else if (pid % 4 == 1) {
41 //atomic_store_explicit(&x[1], 1, memory_order_relaxed);
42 enqueue(queue, 1, false);
43 enqueue(queue, 1, false);
45 succ1 = dequeue(queue, &idx1, &reclaimNode1);
47 //atomic_load_explicit(&x[idx1], memory_order_relaxed);
50 succ2 = dequeue(queue, &idx2, &reclaimNode2);
52 //atomic_load_explicit(&x[idx2], memory_order_relaxed);
54 simulateRecycledNodeUpdate(queue, reclaimNode1);
58 } else if (pid % 4 == 2) {
60 } else if (pid % 4 == 3) {
65 int user_main(int argc, char **argv)
69 unsigned int in_sum = 0, out_sum = 0;
71 queue = calloc(1, sizeof(*queue));
75 threads = malloc(num_threads * sizeof(thrd_t));
76 param = malloc(num_threads * sizeof(*param));
77 input = calloc(num_threads, sizeof(*input));
78 output = calloc(num_threads, sizeof(*output));
80 atomic_init(&x[0], 0);
81 atomic_init(&x[1], 0);
82 atomic_init(&x[2], 0);
83 init_queue(queue, num_threads);
84 for (i = 0; i < num_threads; i++) {
86 thrd_create(&threads[i], main_task, ¶m[i]);
88 for (i = 0; i < num_threads; i++)
89 thrd_join(threads[i]);
91 for (i = 0; i < num_threads; i++) {
95 for (i = 0; i < num_threads; i++)
96 printf("input[%d] = %u\n", i, input[i]);
97 for (i = 0; i < num_threads; i++)
98 printf("output[%d] = %u\n", i, output[i]);
100 MODEL_ASSERT(in_sum == out_sum);
102 MODEL_ASSERT (false);