int i;
int t = get_thread_num();
for (i = 0; i < MAX_FREELIST; i++) {
- //unsigned int node = load_32(&free_lists[t][i]);
- unsigned int node = free_lists[t][i];
+ unsigned int node = load_32(&free_lists[t][i]);
+ //unsigned int node = free_lists[t][i];
if (node) {
- //store_32(&free_lists[t][i], 0);
- free_lists[t][i] = 0;
+ store_32(&free_lists[t][i], 0);
+ //free_lists[t][i] = 0;
return node;
}
}
for (i = 0; i < MAX_FREELIST; i++) {
/* Should never race with our own thread here */
- //unsigned int idx = load_32(&free_lists[t][i]);
- unsigned int idx = free_lists[t][i];
+ unsigned int idx = load_32(&free_lists[t][i]);
+ //unsigned int idx = free_lists[t][i];
/* Found empty spot in free list */
if (idx == 0) {
- //store_32(&free_lists[t][i], node);
- free_lists[t][i] = node;
+ store_32(&free_lists[t][i], node);
+ //free_lists[t][i] = node;
return;
}
}
pointer tmp;
node = new_node();
- //store_32(&q->nodes[node].value, val);
- q->nodes[node].value = val;
+ store_32(&q->nodes[node].value, val);
+ //q->nodes[node].value = val;
tmp = atomic_load_explicit(&q->nodes[node].next, relaxed);
set_ptr(&tmp, 0); // NULL
atomic_store_explicit(&q->nodes[node].next, tmp, relaxed);
@Label: Dequeue_Read_Head
@End
*/
- /** FIXME: A new bug has been found here!!! It should be acquire instead of
+ /** A new bug has been found here!!! It should be acquire instead of
* relaxed (it introduces a bug when there's two dequeuers and one
- * enqueuer)
+ * enqueuer) correctness bug!!
*/
tail = atomic_load_explicit(&q->tail, acquire);
/**
//printf("miss4_dequeue\n");
thrd_yield();
} else {
- //value = load_32(&q->nodes[get_ptr(next)].value);
- value = q->nodes[get_ptr(next)].value;
- /****FIXME: correctness error ****/
+ value = load_32(&q->nodes[get_ptr(next)].value);
+ //value = q->nodes[get_ptr(next)].value;
+ /**** correctness error ****/
success = atomic_compare_exchange_strong_explicit(&q->head,
&head,
MAKE_POINTER(get_ptr(next), get_count(head) + 1),