add Java lockfree hashtable
[cdsspec-compiler.git] / benchmark / chase-lev-deque-bugfix / deque.c
index b556460bd5d6fb095c6e623a786d36c0545a641b..1ebeb135c3cee5c456133794b2f83bcf1030419d 100644 (file)
@@ -35,10 +35,7 @@ int take(Deque *q) {
        int x;
        if (t <= b) {
                /* Non-empty queue. */
-               int size = atomic_load_explicit(&a->size, memory_order_relaxed);
-               if (size == 0) 
-                       model_print("take: size == 0\n");
-               // TODO: size can be zero here!!
+               int size = atomic_load_explicit(&a->size,memory_order_relaxed);
                x = atomic_load_explicit(&a->buffer[b % size], memory_order_relaxed);
                /**
                        @Begin
@@ -48,21 +45,15 @@ int take(Deque *q) {
                */
                if (t == b) {
                        /* Single last element in queue. */
+                       //FIXME: weaken the following seq_cst causes no spec problem
                        bool succ = atomic_compare_exchange_strong_explicit(&q->top, &t, t +
                                1, memory_order_seq_cst, memory_order_relaxed);
                        /**
                                @Begin
-                               @Commit_point_define_check: succ == true
+                               @Commit_point_define_check: true
                                @Label: Take_Point3
                                @End
                        */
-                       
-                       /**
-                               @Begin
-                               @Commit_point_define_check: succ == false
-                               @Label: Take_Point4
-                               @End
-                       */
                        if (!succ) {
                                /* Failed race. */
                                x = EMPTY;
@@ -86,12 +77,9 @@ void resize(Deque *q) {
        atomic_store_explicit(&new_a->size, new_size, memory_order_relaxed);
        size_t i;
        for(i=top; i < bottom; i++) {
-               if (new_size == 0)
-                       model_print("resize: new_size == 0\n");
-               if (size == 0)
-                       model_print("resize: size == 0\n");
                atomic_store_explicit(&new_a->buffer[i % new_size], atomic_load_explicit(&a->buffer[i % size], memory_order_relaxed), memory_order_relaxed);
        }
+       /**** FIXME: detected failure ****/
        atomic_store_explicit(&q->array, new_a, memory_order_release);
        printf("resize\n");
 }
@@ -103,6 +91,7 @@ void resize(Deque *q) {
 */
 void push(Deque *q, int x) {
        size_t b = atomic_load_explicit(&q->bottom, memory_order_relaxed);
+       /**** FIXME: detected correctness ****/
        size_t t = atomic_load_explicit(&q->top, memory_order_acquire);
        Array *a = (Array *) atomic_load_explicit(&q->array, memory_order_relaxed);
        if (b - t > atomic_load_explicit(&a->size, memory_order_relaxed) - 1) /* Full queue. */ {
@@ -111,17 +100,17 @@ void push(Deque *q, int x) {
                a = (Array *) atomic_load_explicit(&q->array, memory_order_relaxed);
        }
        int size = atomic_load_explicit(&a->size, memory_order_relaxed);
-       if (size == 0) 
-               model_print("push: size == 0\n");
        atomic_store_explicit(&a->buffer[b % size], x, memory_order_relaxed);
-       atomic_thread_fence(memory_order_release);
        /**
                @Begin
                @Commit_point_define_check: true
                @Label: Push_Point
                @End
        */
+       atomic_thread_fence(memory_order_release);
+       
        atomic_store_explicit(&q->bottom, b + 1, memory_order_relaxed);
+       
 }
 
 /**
@@ -130,6 +119,7 @@ void push(Deque *q, int x) {
        @End
 */
 int steal(Deque *q) {
+       //FIXME: weaken the following acquire causes no spec problem
        size_t t = atomic_load_explicit(&q->top, memory_order_acquire);
        atomic_thread_fence(memory_order_seq_cst);
        size_t b = atomic_load_explicit(&q->bottom, memory_order_acquire);
@@ -144,21 +134,27 @@ int steal(Deque *q) {
                /* Non-empty queue. */
                Array *a = (Array *) atomic_load_explicit(&q->array, memory_order_acquire);
                int size = atomic_load_explicit(&a->size, memory_order_relaxed);
-               if (size == 0) 
-                       model_print("steal: size == 0\n");
                x = atomic_load_explicit(&a->buffer[t % size], memory_order_relaxed);
+               /**
+                       @Begin
+                       @Potential_commit_point_define: true
+                       @Label: Potential_Steal
+                       @End
+               */
+               
                bool succ = atomic_compare_exchange_strong_explicit(&q->top, &t, t + 1,
                        memory_order_seq_cst, memory_order_relaxed);
                /**
                        @Begin
-                       @Commit_point_define_check: succ == true
+                       @Commit_point_define_check: !succ
                        @Label: Steal_Point2
                        @End
                */
-               
+
                /**
                        @Begin
-                       @Commit_point_define_check: succ == false
+                       @Commit_point_define: succ
+                       @Potential_commit_point_label: Potential_Steal
                        @Label: Steal_Point3
                        @End
                */