benchmark/ms-queue/my_queue.c

   1 #include <threads.h>
   2 #include <stdlib.h>
   3 #include "librace.h"
   4 #include "model-assert.h"
   5
   6 #include "my_queue.h"
   7
   8 #define relaxed memory_order_relaxed
   9 #define release memory_order_release
  10 #define acquire memory_order_acquire
  11
  12 #define MAX_FREELIST 4 /* Each thread can own up to MAX_FREELIST free nodes */
  13 #define INITIAL_FREE 3 /* Each thread starts with INITIAL_FREE free nodes */
  14
  15 #define POISON_IDX 0x666
  16
  17 static unsigned int (*free_lists)[MAX_FREELIST];
  18
  19 /* Search this thread's free list for a "new" node */
  20 static unsigned int new_node()
  21 {
  22         int i;
  23         int t = get_thread_num();
  24         for (i = 0; i < MAX_FREELIST; i++) {
  25                 unsigned int node = load_32(&free_lists[t][i]);
  26                 //unsigned int node = free_lists[t][i];
  27                 if (node) {
  28                         store_32(&free_lists[t][i], 0);
  29                         //free_lists[t][i] = 0;
  30                         return node;
  31                 }
  32         }
  33         /* free_list is empty? */
  34         //MODEL_ASSERT(0);
  35         return 0;
  36 }
  37
  38 /* Place this node index back on this thread's free list */
  39 static void reclaim(unsigned int node)
  40 {
  41         int i;
  42         int t = get_thread_num();
  43
  44         /* Don't reclaim NULL node */
  45         //MODEL_ASSERT(node);
  46
  47         for (i = 0; i < MAX_FREELIST; i++) {
  48                 /* Should never race with our own thread here */
  49                 unsigned int idx = load_32(&free_lists[t][i]);
  50                 //unsigned int idx = free_lists[t][i];
  51
  52                 /* Found empty spot in free list */
  53                 if (idx == 0) {
  54                         store_32(&free_lists[t][i], node);
  55                         //free_lists[t][i] = node;
  56                         return;
  57                 }
  58         }
  59         /* free list is full? */
  60         //MODEL_ASSERT(0);
  61 }
  62
  63 void init_queue(queue_t *q, int num_threads)
  64 {
  65         int i, j;
  66         for (i = 0; i < MAX_NODES; i++) {
  67                 atomic_init(&q->nodes[i].next, MAKE_POINTER(POISON_IDX, 0));
  68         }
  69
  70         /* Initialize each thread's free list with INITIAL_FREE pointers */
  71         /* The actual nodes are initialized with poison indexes */
  72         free_lists = malloc(num_threads * sizeof(*free_lists));
  73         for (i = 0; i < num_threads; i++) {
  74                 for (j = 0; j < INITIAL_FREE; j++) {
  75                         free_lists[i][j] = 2 + i * MAX_FREELIST + j;
  76                         atomic_init(&q->nodes[free_lists[i][j]].next, MAKE_POINTER(POISON_IDX, 0));
  77                 }
  78         }
  79
  80         /* initialize queue */
  81         atomic_init(&q->head, MAKE_POINTER(1, 0));
  82         atomic_init(&q->tail, MAKE_POINTER(1, 0));
  83         atomic_init(&q->nodes[1].next, MAKE_POINTER(0, 0));
  84 }
  85
  86 /**
  87         @Begin
  88         @Interface_define: Enqueue
  89         @End
  90 */
  91 void enqueue(queue_t *q, unsigned int val)
  92 {
  93         int success = 0;
  94         unsigned int node;
  95         pointer tail;
  96         pointer next;
  97         pointer tmp;
  98
  99         node = new_node();
 100         store_32(&q->nodes[node].value, val);
 101         //q->nodes[node].value = val;
 102         tmp = atomic_load_explicit(&q->nodes[node].next, relaxed);
 103         set_ptr(&tmp, 0); // NULL
 104         atomic_store_explicit(&q->nodes[node].next, tmp, relaxed);
 105
 106         while (!success) {
 107
 108                 /**
 109                         @Begin
 110                         @Commit_point_clear: true
 111                         @Label: Enqueue_Clear
 112                         @End
 113                 */
 114                 /**** detected UL ****/
 115                 tail = atomic_load_explicit(&q->tail, acquire);
 116                 /****FIXME: miss ****/
 117                 next = atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire);
 118                 //printf("miss1_enqueue\n");
 119                 if (tail == atomic_load_explicit(&q->tail, relaxed)) {
 120
 121                         /* Check for uninitialized 'next' */
 122                         //MODEL_ASSERT(get_ptr(next) != POISON_IDX);
 123
 124                         if (get_ptr(next) == 0) { // == NULL
 125                                 pointer value = MAKE_POINTER(node, get_count(next) + 1);
 126                                 /**** detected UL ****/
 127                                 // Second release can be just relaxed
 128                                 success = atomic_compare_exchange_strong_explicit(&q->nodes[get_ptr(tail)].next,
 129                                                 &next, value, release, relaxed);
 130                                 /**
 131                                         @Begin
 132                                         @Commit_point_define_check: success
 133                                         @Label: EnqueueUpdateNext
 134                                         @End
 135                                 */
 136                         }
 137                         if (!success) {
 138                                 // This routine helps the other enqueue to update the tail
 139                                 /**** detected UL ****/
 140                                 unsigned int ptr = get_ptr(atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire));
 141                                 pointer value = MAKE_POINTER(ptr,
 142                                                 get_count(tail) + 1);
 143                                 /****FIXME: miss ****/
 144                                 // Second release can be just relaxed
 145                                 bool succ = false;
 146                                 succ = atomic_compare_exchange_strong_explicit(&q->tail,
 147                                                 &tail, value, release, relaxed);
 148                                 if (succ) {
 149                                         //printf("miss2_enqueue CAS succ\n");
 150                                 }
 151                                 //printf("miss2_enqueue\n");
 152                                 thrd_yield();
 153                         }
 154                 }
 155         }
 156         /**** dectected UL ****/
 157         // Second release can be just relaxed
 158         bool succ = atomic_compare_exchange_strong_explicit(&q->tail,
 159                         &tail,
 160                         MAKE_POINTER(node, get_count(tail) + 1),
 161                         release, relaxed);
 162 }
 163
 164 /**
 165         @Begin
 166         @Interface_define: Dequeue
 167         @End
 168 */
 169 bool dequeue(queue_t *q, int *retVal)
 170 {
 171         unsigned int value = 0;
 172         int success = 0;
 173         pointer head;
 174         pointer tail;
 175         pointer next;
 176
 177         while (!success) {
 178                 /**
 179                         @Begin
 180                         @Commit_point_clear: true
 181                         @Label: Dequeue_Clear
 182                         @End
 183                 */
 184                 /**** detected correctness error ****/
 185                 head = atomic_load_explicit(&q->head, acquire);
 186                 /** A new bug has been found here!!! It should be acquire instead of
 187                  * relaxed (it introduces a bug when there's two dequeuers and one
 188                  * enqueuer) correctness bug!!
 189                  */
 190                 tail = atomic_load_explicit(&q->tail, acquire);
 191
 192                 /**** Detected UL/DR (testcase1.c) ****/
 193                 next = atomic_load_explicit(&q->nodes[get_ptr(head)].next, acquire);
 194                 /**
 195                         @Begin
 196                         @Potential_commit_point_define: true
 197                         @Label: DequeueReadNext
 198                         @End
 199                 */
 200                 if (atomic_load_explicit(&q->head, relaxed) == head) {
 201                         if (get_ptr(head) == get_ptr(tail)) {
 202
 203                                 /* Check for uninitialized 'next' */
 204                                 //MODEL_ASSERT(get_ptr(next) != POISON_IDX);
 205
 206                                 if (get_ptr(next) == 0) { // NULL
 207                                         return false; // NULL
 208                                 }
 209                                 /**** Detected UL (testcase1.c) ****/
 210                                 // Second release can be just relaxed
 211                                 bool succ = false;
 212                                 succ = atomic_compare_exchange_strong_explicit(&q->tail,
 213                                                 &tail,
 214                                                 MAKE_POINTER(get_ptr(next), get_count(tail) + 1),
 215                                                 release, relaxed);
 216                                 if (succ) {
 217                                         //printf("miss4_dequeue CAS succ\n");
 218                                 }
 219                                 //printf("miss4_dequeue\n");
 220                                 thrd_yield();
 221                         } else {
 222                                 value = load_32(&q->nodes[get_ptr(next)].value);
 223                                 //value = q->nodes[get_ptr(next)].value;
 224                                 /**** correctness error ****/
 225                                 success = atomic_compare_exchange_strong_explicit(&q->head,
 226                                                 &head,
 227                                                 MAKE_POINTER(get_ptr(next), get_count(head) + 1),
 228                                                 release, relaxed);
 229                                 /**
 230                                         @Begin
 231                                         @Commit_point_define_check: success
 232                                         @Label: DequeueUpdateHead
 233                                         @End
 234                                 */
 235
 236                                 /**
 237                                         @Begin
 238                                         @Commit_point_define: success
 239                                         @Potential_commit_point_label: DequeueReadNext
 240                                         @Label: DequeueReadNextVerify
 241                                         @End
 242                                 */
 243                                 if (!success)
 244                                         thrd_yield();
 245                         }
 246                 }
 247         }
 248         reclaim(get_ptr(head));
 249         *retVal = value;
 250         return true;
 251 }