cdschecker_modified_benchmarks/ms-queue/main.cc

   1 #include <stdlib.h>
   2 #include <stdio.h>
   3 #include "cds_threads.h"
   4
   5 #include "my_queue.h"
   6 #include "model-assert.h"
   7
   8 static int procs = 4;
   9 static queue_t *queue;
  10 static thrd_t *threads;
  11 static unsigned int *input;
  12 static unsigned int *output;
  13 static int num_threads;
  14
  15 int get_thread_num()
  16 {
  17         //thrd_t curr = thrd_current();
  18         int i;
  19         for (i = 0; i < num_threads; i++)
  20                 if (std::this_thread::get_id() == threads[i].get_id())
  21                         return i;
  22         MODEL_ASSERT(0);
  23         return -1;
  24 }
  25
  26 bool succ1, succ2;
  27
  28 static void main_task(void *param)
  29 {
  30         std::this_thread::sleep_for(std::chrono::milliseconds(10));
  31         unsigned int val;
  32         int pid = *((int *)param);
  33         if (!pid) {
  34                 input[0] = 17;
  35                 enqueue(queue, input[0]);
  36                 succ1 = dequeue(queue, &output[0]);
  37                 //printf("Dequeue: %d\n", output[0]);
  38         } else {
  39                 input[1] = 37;
  40                 enqueue(queue, input[1]);
  41                 succ2 = dequeue(queue, &output[1]);
  42         }
  43 }
  44
  45 int user_main(int argc, char **argv)
  46 {
  47         int i;
  48         int *param;
  49         unsigned int in_sum = 0, out_sum = 0;
  50
  51         queue = (queue_t *)calloc(1, sizeof(*queue));
  52         MODEL_ASSERT(queue);
  53
  54         num_threads = procs;
  55         threads = (std::thread *)malloc(num_threads * sizeof(std::thread));
  56         param = (int *)malloc(num_threads * sizeof(*param));
  57         input = (unsigned *)calloc(num_threads, sizeof(*input));
  58         output = (unsigned *)calloc(num_threads, sizeof(*output));
  59
  60         init_queue(queue, num_threads);
  61         for (i = 0; i < num_threads; i++) {
  62                 param[i] = i;
  63                 //threads[i] = std::thread(main_task, &param[i]);
  64                 new (&threads[i])std::thread(main_task, &param[i]);
  65         }
  66         for (i = 0; i < num_threads; i++)
  67                 threads[i].join();
  68
  69         for (i = 0; i < num_threads; i++) {
  70                 in_sum += input[i];
  71                 out_sum += output[i];
  72         }
  73         for (i = 0; i < num_threads; i++)
  74                 printf("input[%d] = %u\n", i, input[i]);
  75         for (i = 0; i < num_threads; i++)
  76                 printf("output[%d] = %u\n", i, output[i]);
  77         if (succ1 && succ2)
  78                 MODEL_ASSERT(in_sum == out_sum);
  79         else
  80                 MODEL_ASSERT (false);
  81
  82         free(param);
  83         free(threads);
  84         free(queue);
  85
  86         return 0;
  87 }