cdschecker_modified_benchmarks/ms-queue/my_queue.cc

   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 2 /* 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                 if (node) {
  27                         store_32(&free_lists[t][i], 0);
  28                         return node;
  29                 }
  30         }
  31         /* free_list is empty? */
  32         MODEL_ASSERT(0);
  33         return 0;
  34 }
  35
  36 /* Place this node index back on this thread's free list */
  37 static void reclaim(unsigned int node)
  38 {
  39         int i;
  40         int t = get_thread_num();
  41
  42         /* Don't reclaim NULL node */
  43         MODEL_ASSERT(node);
  44
  45         for (i = 0; i < MAX_FREELIST; i++) {
  46                 /* Should never race with our own thread here */
  47                 unsigned int idx = load_32(&free_lists[t][i]);
  48
  49                 /* Found empty spot in free list */
  50                 if (idx == 0) {
  51                         store_32(&free_lists[t][i], node);
  52                         return;
  53                 }
  54         }
  55         /* free list is full? */
  56         MODEL_ASSERT(0);
  57 }
  58
  59 void init_queue(queue_t *q, int num_threads)
  60 {
  61         int i, j;
  62
  63         /* Initialize each thread's free list with INITIAL_FREE pointers */
  64         /* The actual nodes are initialized with poison indexes */
  65         free_lists = (unsigned (*)[MAX_FREELIST])malloc(num_threads * sizeof(*free_lists));
  66         for (i = 0; i < num_threads; i++) {
  67                 for (j = 0; j < INITIAL_FREE; j++) {
  68                         free_lists[i][j] = 2 + i * MAX_FREELIST + j;
  69                         atomic_init(&q->nodes[free_lists[i][j]].next, MAKE_POINTER(POISON_IDX, 0));
  70                 }
  71         }
  72
  73         /* initialize queue */
  74         atomic_init(&q->head, MAKE_POINTER(1, 0));
  75         atomic_init(&q->tail, MAKE_POINTER(1, 0));
  76         atomic_init(&q->nodes[1].next, MAKE_POINTER(0, 0));
  77 }
  78
  79 void enqueue(queue_t *q, unsigned int val)
  80 {
  81         int success = 0;
  82         unsigned int node;
  83         pointer tail;
  84         pointer next;
  85         pointer tmp;
  86
  87         node = new_node();
  88         store_32(&q->nodes[node].value, val);
  89         tmp = atomic_load_explicit(&q->nodes[node].next, relaxed);
  90         set_ptr(&tmp, 0); // NULL
  91
  92         // Bug 1
  93         atomic_store_explicit(&q->nodes[node].next, tmp, relaxed);
  94         //atomic_store_explicit(&q->nodes[node].next, tmp, release);
  95
  96         while (!success) {
  97                 tail = atomic_load_explicit(&q->tail, acquire);
  98                 next = atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire);
  99                 if (tail == atomic_load_explicit(&q->tail, relaxed)) {
 100                         /* Check for uninitialized 'next' */
 101                         MODEL_ASSERT(get_ptr(next) != POISON_IDX);
 102
 103                         if (get_ptr(next) == 0) { // == NULL
 104                                 pointer value = MAKE_POINTER(node, get_count(next) + 1);
 105                                 success = atomic_compare_exchange_strong_explicit(&q->nodes[get_ptr(tail)].next,
 106                                                 &next, value, release, release);
 107                         }
 108                         if (!success) {
 109                                 unsigned int ptr = get_ptr(atomic_load_explicit(&q->nodes[get_ptr(tail)].next, acquire));
 110                                 pointer value = MAKE_POINTER(ptr,
 111                                                 get_count(tail) + 1);
 112                                 atomic_compare_exchange_strong_explicit(&q->tail,
 113                                                 &tail, value,
 114                                                 release, release);
 115                                 thrd_yield();
 116                         }
 117                 }
 118         }
 119         atomic_compare_exchange_strong_explicit(&q->tail,
 120                         &tail,
 121                         MAKE_POINTER(node, get_count(tail) + 1),
 122                         release, release);
 123 }
 124
 125 bool dequeue(queue_t *q, unsigned int *retVal)
 126 {
 127         int success = 0;
 128         pointer head;
 129         pointer tail;
 130         pointer next;
 131
 132         while (!success) {
 133                 head = atomic_load_explicit(&q->head, acquire);
 134
 135                 // Bug 2
 136                 tail = atomic_load_explicit(&q->tail, relaxed);
 137                 //tail = atomic_load_explicit(&q->tail, acquire);
 138
 139                 next = atomic_load_explicit(&q->nodes[get_ptr(head)].next, acquire);
 140                 if (atomic_load_explicit(&q->head, relaxed) == head) {
 141                         if (get_ptr(head) == get_ptr(tail)) {
 142
 143                                 /* Check for uninitialized 'next' */
 144                                 MODEL_ASSERT(get_ptr(next) != POISON_IDX);
 145
 146                                 if (get_ptr(next) == 0) { // NULL
 147                                         return false; // NULL
 148                                 }
 149                                 atomic_compare_exchange_strong_explicit(&q->tail,
 150                                                 &tail,
 151                                                 MAKE_POINTER(get_ptr(next), get_count(tail) + 1),
 152                                                 release, release);
 153                                 thrd_yield();
 154                         } else {
 155                                 *retVal = load_32(&q->nodes[get_ptr(next)].value);
 156                                 success = atomic_compare_exchange_strong_explicit(&q->head,
 157                                                 &head,
 158                                                 MAKE_POINTER(get_ptr(next), get_count(head) + 1),
 159                                                 release, release);
 160                                 if (!success)
 161                                         thrd_yield();
 162                         }
 163                 }
 164         }
 165         reclaim(get_ptr(head));
 166         return true;
 167 }