8 Deque * q = (Deque *) calloc(1, sizeof(Deque));
9 Array * a = (Array *) calloc(1, sizeof(Array)+2*sizeof(atomic_int));
10 atomic_store_explicit(&q->array, a, memory_order_relaxed);
11 atomic_store_explicit(&q->top, 0, memory_order_relaxed);
12 atomic_store_explicit(&q->bottom, 0, memory_order_relaxed);
13 atomic_store_explicit(&a->size, 2, memory_order_relaxed);
20 @Interface_define: Take
24 size_t b = atomic_load_explicit(&q->bottom, memory_order_relaxed) - 1;
27 @Commit_point_define_check: true
28 @Label: Take_Read_Bottom
31 Array *a = (Array *) atomic_load_explicit(&q->array, memory_order_relaxed);
34 @Commit_point_define_check: true
35 @Label: Take_Read_Array
38 atomic_store_explicit(&q->bottom, b, memory_order_relaxed);
39 /**** SPEC (sequential) (testcase1.c) ****/
40 atomic_thread_fence(memory_order_seq_cst);
41 size_t t = atomic_load_explicit(&q->top, memory_order_relaxed);
44 @Commit_point_define_check: t != b
50 /* Non-empty queue. */
51 int size = atomic_load_explicit(&a->size,memory_order_relaxed);
52 x = atomic_load_explicit(&a->buffer[b % size], memory_order_relaxed);
55 @Commit_point_define_check: t != b
56 @Label: Take_Read_Buffer
60 /* Single last element in queue. */
61 //FIXME: weaken the following seq_cst causes no spec problem
62 bool succ = atomic_compare_exchange_strong_explicit(&q->top, &t, t +
63 1, memory_order_seq_cst, memory_order_relaxed);
66 @Commit_point_define_check: succ
73 @Additional_ordering_point_define_check: true
74 @Label: Take_Additional_Point
81 atomic_store_explicit(&q->bottom, b + 1, memory_order_relaxed);
83 } else { /* Empty queue. */
85 atomic_store_explicit(&q->bottom, b + 1, memory_order_relaxed);
90 void resize(Deque *q) {
91 Array *a = (Array *) atomic_load_explicit(&q->array, memory_order_relaxed);
92 size_t size=atomic_load_explicit(&a->size, memory_order_relaxed);
93 size_t new_size=size << 1;
94 Array *new_a = (Array *) calloc(1, new_size * sizeof(atomic_int) + sizeof(Array));
95 size_t top=atomic_load_explicit(&q->top, memory_order_relaxed);
96 size_t bottom=atomic_load_explicit(&q->bottom, memory_order_relaxed);
97 atomic_store_explicit(&new_a->size, new_size, memory_order_relaxed);
99 for(i=top; i < bottom; i++) {
100 atomic_store_explicit(&new_a->buffer[i % new_size], atomic_load_explicit(&a->buffer[i % size], memory_order_relaxed), memory_order_relaxed);
102 /**** detected UL ****/
103 atomic_store_explicit(&q->array, new_a, memory_order_release);
104 //printf("resize\n");
109 @Interface_define: Push
112 void push(Deque *q, int x) {
113 size_t b = atomic_load_explicit(&q->bottom, memory_order_relaxed);
114 /**** SPEC (sequential) ****/
115 size_t t = atomic_load_explicit(&q->top, memory_order_acquire);
116 Array *a = (Array *) atomic_load_explicit(&q->array, memory_order_relaxed);
117 if (b - t > atomic_load_explicit(&a->size, memory_order_relaxed) - 1) /* Full queue. */ {
119 // CDSSpec can actually detect the same bug if we avoid the UL error
120 //Bug in paper...should have next line...
121 //a = (Array *) atomic_load_explicit(&q->array, memory_order_relaxed);
124 @Commit_point_define_check: true
125 @Label: Push_Read_Array
129 int size = atomic_load_explicit(&a->size, memory_order_relaxed);
131 atomic_store_explicit(&a->buffer[b % size], x, memory_order_relaxed);
134 @Commit_point_define_check: true
135 @Label: Push_Update_Buffer
138 /**** SPEC (Sync) (run with -u100 to avoid the uninitialized bug) ****/
139 atomic_thread_fence(memory_order_release);
140 // Watch out!!! We need to specifiy the fence as the commit point because
141 // the synchronization in C11 actually is established at the fence.
144 @Commit_point_define_check: true
145 @Label: Push_Update_Bottom
148 atomic_store_explicit(&q->bottom, b + 1, memory_order_relaxed);
154 @Interface_define: Steal
157 int steal(Deque *q) {
158 //Watch out: actually on need to be an acquire (don't count it)
160 size_t t = atomic_load_explicit(&q->top, memory_order_acquire);
163 @Potential_commit_point_define: true
164 @Label: Steal_Potential_Read_Tail
167 //FIXME: remove the fence causes no error and fewer executions..
168 atomic_thread_fence(memory_order_seq_cst);
169 /**** SPEC & UL ****/
170 size_t b = atomic_load_explicit(&q->bottom, memory_order_acquire);
173 @Commit_point_define_check: true
174 @Label: Steal_Read_Bottom
180 @Commit_point_define: t >= b
181 @Potential_commit_point_label: Steal_Potential_Read_Tail
182 @Label: Steal_Read_Tail
187 /* Non-empty queue. */
188 /**** detected UL ****/
189 Array *a = (Array *) atomic_load_explicit(&q->array, memory_order_acquire);
192 @Commit_point_define_check: true
193 @Label: Steal_Read_Array
196 int size = atomic_load_explicit(&a->size, memory_order_relaxed);
197 x = atomic_load_explicit(&a->buffer[t % size], memory_order_relaxed);
200 @Potential_commit_point_define: true
201 @Label: Steal_Potential_Read_Buffer
204 /**** SPEC (sequential) ****/
205 bool succ = atomic_compare_exchange_strong_explicit(&q->top, &t, t + 1,
206 memory_order_seq_cst, memory_order_relaxed);
209 @Commit_point_define_check: succ
210 @Label: Steal_CAS_Top
216 @Additional_ordering_point_define_check: true
217 @Label: Steal_Additional_Point
223 @Commit_point_define: succ
224 @Potential_commit_point_label: Steal_Potential_Read_Buffer
225 @Label: Steal_Read_Buffer