#define acquire memory_order_acquire
#define MAX_FREELIST 4 /* Each thread can own up to MAX_FREELIST free nodes */
-#define INITIAL_FREE 2 /* Each thread starts with INITIAL_FREE free nodes */
+#define INITIAL_FREE 3 /* Each thread starts with INITIAL_FREE free nodes */
#define POISON_IDX 0x666
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];
if (node) {
store_32(&free_lists[t][i], 0);
+ //free_lists[t][i] = 0;
return node;
}
}
/* free_list is empty? */
- MODEL_ASSERT(0);
+ //MODEL_ASSERT(0);
return 0;
}
int t = get_thread_num();
/* Don't reclaim NULL node */
- MODEL_ASSERT(node);
+ //MODEL_ASSERT(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];
/* Found empty spot in free list */
if (idx == 0) {
store_32(&free_lists[t][i], node);
+ //free_lists[t][i] = node;
return;
}
}
/* free list is full? */
- MODEL_ASSERT(0);
+ //MODEL_ASSERT(0);
}
void init_queue(queue_t *q, int num_threads)
{
- /**
- @Begin
- @Entry_point
- @End
- */
-
int i, j;
/* Initialize each thread's free list with INITIAL_FREE pointers */
node = new_node();
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) {
+ /**** detected UL ****/
tail = atomic_load_explicit(&q->tail, acquire);
+ /****FIXME: miss ****/
next = atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire);
+ //printf("miss1_enqueue\n");
if (tail == atomic_load_explicit(&q->tail, relaxed)) {
/* Check for uninitialized 'next' */
- MODEL_ASSERT(get_ptr(next) != POISON_IDX);
+ //MODEL_ASSERT(get_ptr(next) != POISON_IDX);
if (get_ptr(next) == 0) { // == NULL
pointer value = MAKE_POINTER(node, get_count(next) + 1);
+ /**** detected UL ****/
+ // Second release can be just relaxed
success = atomic_compare_exchange_strong_explicit(&q->nodes[get_ptr(tail)].next,
- &next, value, release, release);
- }
- if (!success) {
- unsigned int ptr = get_ptr(atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire));
- pointer value = MAKE_POINTER(ptr,
- get_count(tail) + 1);
- int commit_success = 0;
- commit_success = atomic_compare_exchange_strong_explicit(&q->tail,
- &tail, value, release, release);
+ &next, value, release, relaxed);
/**
@Begin
- @Commit_point_define_check: __ATOMIC_RET__ == true
+ @Commit_point_define_check: success == true
@Label: Enqueue_Success_Point
@End
*/
+ }
+ if (!success) {
+ // This routine helps the other enqueue to update the tail
+ /**** detected UL ****/
+ unsigned int ptr = get_ptr(atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire));
+ pointer value = MAKE_POINTER(ptr,
+ get_count(tail) + 1);
+ /****FIXME: miss ****/
+ // Second release can be just relaxed
+ bool succ = false;
+ succ = atomic_compare_exchange_strong_explicit(&q->tail,
+ &tail, value, release, relaxed);
+ if (succ) {
+ //printf("miss2_enqueue CAS succ\n");
+ }
+ //printf("miss2_enqueue\n");
thrd_yield();
}
}
}
+ /**** dectected UL ****/
+ // Second release can be just relaxed
atomic_compare_exchange_strong_explicit(&q->tail,
&tail,
MAKE_POINTER(node, get_count(tail) + 1),
- release, release);
+ release, relaxed);
}
-
/**
@Begin
@Interface_define: Dequeue
@End
*/
-unsigned int dequeue(queue_t *q)
+bool dequeue(queue_t *q, unsigned int *retVal)
{
unsigned int value;
int success = 0;
pointer next;
while (!success) {
+ /**** detected correctness error ****/
head = atomic_load_explicit(&q->head, acquire);
+ // FIXME: This must be acquire otherwise we have a bug with 1 enqueue &
+ // 1 dequeue
tail = atomic_load_explicit(&q->tail, relaxed);
+ /****FIXME: miss ****/
next = atomic_load_explicit(&q->nodes[get_ptr(head)].next, acquire);
+ //printf("miss3_dequeue\n");
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);
+ //MODEL_ASSERT(get_ptr(next) != POISON_IDX);
if (get_ptr(next) == 0) { // NULL
- return 0; // NULL
+ /**
+ @Begin
+ @Commit_point_define_check: true
+ @Label: Dequeue_Empty_Point
+ @End
+ */
+ return false; // NULL
}
- atomic_compare_exchange_strong_explicit(&q->tail,
+ /****FIXME: miss (not reached) ****/
+ // Second release can be just relaxed
+ bool succ = false;
+ succ = atomic_compare_exchange_strong_explicit(&q->tail,
&tail,
MAKE_POINTER(get_ptr(next), get_count(tail) + 1),
- release, release);
+ release, relaxed);
+ if (succ) {
+ //printf("miss4_dequeue CAS succ\n");
+ }
+ //printf("miss4_dequeue\n");
thrd_yield();
} else {
- value = load_32(&q->nodes[get_ptr(next)].value);
+ *retVal = load_32(&q->nodes[get_ptr(next)].value);
+ //value = q->nodes[get_ptr(next)].value;
+ /****FIXME: correctness error ****/
+ // Seconde release can be just relaxed
success = atomic_compare_exchange_strong_explicit(&q->head,
&head,
MAKE_POINTER(get_ptr(next), get_count(head) + 1),
- release, release);
+ release, relaxed);
/**
@Begin
- @Commit_point_define_check: __ATOMIC_RET__ == true
+ @Commit_point_define_check: success == true
@Label: Dequeue_Success_Point
@End
*/
}
}
reclaim(get_ptr(head));
- return value;
+ return true;
}
projects / cdsspec-compiler.git / blobdiff