4 #include "model-assert.h"
8 #define relaxed memory_order_relaxed
9 #define release memory_order_release
10 #define acquire memory_order_acquire
12 #define MAX_FREELIST 4 /* Each thread can own up to MAX_FREELIST free nodes */
13 #define INITIAL_FREE 2 /* Each thread starts with INITIAL_FREE free nodes */
15 #define POISON_IDX 0x666
17 static unsigned int (*free_lists)[MAX_FREELIST];
19 /* Search this thread's free list for a "new" node */
20 static unsigned int new_node()
23 int t = get_thread_num();
24 for (i = 0; i < MAX_FREELIST; i++) {
25 unsigned int node = load_32(&free_lists[t][i]);
27 store_32(&free_lists[t][i], 0);
31 /* free_list is empty? */
36 /* Place this node index back on this thread's free list */
37 static void reclaim(unsigned int node)
40 int t = get_thread_num();
42 /* Don't reclaim NULL node */
45 for (i = 0; i < MAX_FREELIST; i++) {
46 /* Should never race with our own thread here */
47 unsigned int idx = load_32(&free_lists[t][i]);
49 /* Found empty spot in free list */
51 store_32(&free_lists[t][i], node);
55 /* free list is full? */
59 void init_queue(queue_t *q, int num_threads)
63 /* Initialize each thread's free list with INITIAL_FREE pointers */
64 /* The actual nodes are initialized with poison indexes */
65 free_lists = (unsigned (*)[MAX_FREELIST])malloc(num_threads * sizeof(*free_lists));
66 for (i = 0; i < num_threads; i++) {
67 for (j = 0; j < INITIAL_FREE; j++) {
68 free_lists[i][j] = 2 + i * MAX_FREELIST + j;
69 atomic_init(&q->nodes[free_lists[i][j]].next, MAKE_POINTER(POISON_IDX, 0));
73 /* initialize queue */
74 atomic_init(&q->head, MAKE_POINTER(1, 0));
75 atomic_init(&q->tail, MAKE_POINTER(1, 0));
76 atomic_init(&q->nodes[1].next, MAKE_POINTER(0, 0));
79 void enqueue(queue_t *q, unsigned int val)
88 store_32(&q->nodes[node].value, val);
89 tmp = atomic_load_explicit(&q->nodes[node].next, relaxed);
90 set_ptr(&tmp, 0); // NULL
93 atomic_store_explicit(&q->nodes[node].next, tmp, relaxed);
94 //atomic_store_explicit(&q->nodes[node].next, tmp, release);
97 tail = atomic_load_explicit(&q->tail, acquire);
98 next = atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire);
99 if (tail == atomic_load_explicit(&q->tail, relaxed)) {
100 /* Check for uninitialized 'next' */
101 MODEL_ASSERT(get_ptr(next) != POISON_IDX);
103 if (get_ptr(next) == 0) { // == NULL
104 pointer value = MAKE_POINTER(node, get_count(next) + 1);
105 success = atomic_compare_exchange_strong_explicit(&q->nodes[get_ptr(tail)].next,
106 &next, value, release, release);
109 unsigned int ptr = get_ptr(atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire));
110 pointer value = MAKE_POINTER(ptr,
111 get_count(tail) + 1);
112 atomic_compare_exchange_strong_explicit(&q->tail,
119 atomic_compare_exchange_strong_explicit(&q->tail,
121 MAKE_POINTER(node, get_count(tail) + 1),
125 bool dequeue(queue_t *q, unsigned int *retVal)
133 head = atomic_load_explicit(&q->head, acquire);
136 tail = atomic_load_explicit(&q->tail, relaxed);
137 //tail = atomic_load_explicit(&q->tail, acquire);
139 next = atomic_load_explicit(&q->nodes[get_ptr(head)].next, acquire);
140 if (atomic_load_explicit(&q->head, relaxed) == head) {
141 if (get_ptr(head) == get_ptr(tail)) {
143 /* Check for uninitialized 'next' */
144 MODEL_ASSERT(get_ptr(next) != POISON_IDX);
146 if (get_ptr(next) == 0) { // NULL
147 return false; // NULL
149 atomic_compare_exchange_strong_explicit(&q->tail,
151 MAKE_POINTER(get_ptr(next), get_count(tail) + 1),
155 *retVal = load_32(&q->nodes[get_ptr(next)].value);
156 success = atomic_compare_exchange_strong_explicit(&q->head,
158 MAKE_POINTER(get_ptr(next), get_count(head) + 1),
165 reclaim(get_ptr(head));