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) {
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);
while (!success) {
+
/**
@Begin
@Commit_point_clear: true
*/
/**** detected UL ****/
tail = atomic_load_explicit(&q->tail, acquire);
- /**
- @Begin
- @Commit_point_define_check: true
- @Label: Enqueue_Read_Tail
- @End
- */
/****FIXME: miss ****/
next = atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire);
//printf("miss1_enqueue\n");
/**
@Begin
@Commit_point_define_check: success
- @Label: Enqueue_UpdateNext
+ @Label: EnqueueUpdateNext
@End
*/
}
/**
@Begin
@Commit_point_define_check: true
- @Label: Dequeue_Read_Head
+ @Label: DequeueReadHead
@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, relaxed);
- /**
- @Begin
- @Potential_commit_point_define: true
- @Label: Dequeue_Potential_Read_Tail
- @End
- */
+ tail = atomic_load_explicit(&q->tail, acquire);
- /****FIXME: miss ****/
+ /**** Detected UL/DR (testcase1.c) ****/
next = atomic_load_explicit(&q->nodes[get_ptr(head)].next, acquire);
/**
@Begin
- @Potential_commit_point_define: true
- @Label: Dequeue_Potential_LoadNext
+ @Potential_commit_point_define: true
+ @Label: DequeueReadNext
@End
*/
-
if (atomic_load_explicit(&q->head, relaxed) == head) {
if (get_ptr(head) == get_ptr(tail)) {
/* Check for uninitialized 'next' */
//MODEL_ASSERT(get_ptr(next) != POISON_IDX);
- if (get_ptr(next) == 0) { // NULL
- /**
- @Begin
- @Commit_point_define: true
- @Potential_commit_point_label: Dequeue_Potential_Read_Tail
- @Label: Dequeue_Read_Tail
- @End
- */
+ if (get_ptr(next) == 0) { // NULL
return false; // NULL
}
- /****FIXME: miss (not reached) ****/
+ /**** Detected UL (testcase1.c) ****/
// Second release can be just relaxed
bool succ = false;
succ = atomic_compare_exchange_strong_explicit(&q->tail,
//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),
release, relaxed);
+ /**
+ @Begin
+ @Commit_point_define_check: success
+ @Label: DequeueUpdateHead
+ @End
+ */
+
/**
@Begin
@Commit_point_define: success
- @Potential_commit_point_label: Dequeue_Potential_LoadNext
- @Label: Dequeue_LoadNext
+ @Potential_commit_point_label: DequeueReadNext
+ @Label: DequeueReadNextVerify
@End
*/
if (!success)