benchmark/ms-queue/testcase1.c

   1 #include <stdlib.h>
   2 #include <stdio.h>
   3 #include <threads.h>
   4
   5 #include "my_queue.h"
   6 #include "model-assert.h"
   7
   8 static int procs = 2;
   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 (curr.priv == threads[i].priv)
  21                         return i;
  22         //MODEL_ASSERT(0);
  23         return -1;
  24 }
  25
  26 /** Be careful, we must make these variables to be global so that they will be
  27  * 'available' when the execution is generated */
  28 bool succ1, succ2;
  29 unsigned int output1, output2;
  30
  31 static void main_task(void *param)
  32 {
  33         int pid = *((int *)param);
  34         if (pid % 4 == 0) {
  35                 output1 = 1;
  36                 succ1 = dequeue(queue, &output1);
  37                 if (succ1)
  38                         printf("Thrd 1: Dequeue %d.\n", output1);
  39                 else
  40                         printf("Thrd 1: Dequeue NULL.\n");
  41         } else if (pid % 4 == 1) {
  42                 enqueue(queue, 2);
  43         }
  44 }
  45
  46 int user_main(int argc, char **argv)
  47 {
  48         /**
  49                 @Begin
  50                 @Entry_point
  51                 @End
  52         */
  53         int i;
  54         int *param;
  55         unsigned int in_sum = 0, out_sum = 0;
  56
  57         queue = calloc(1, sizeof(*queue));
  58         //MODEL_ASSERT(queue);
  59
  60         num_threads = procs;
  61         threads = malloc(num_threads * sizeof(thrd_t));
  62         param = malloc(num_threads * sizeof(*param));
  63         input = calloc(num_threads, sizeof(*input));
  64         output = calloc(num_threads, sizeof(*output));
  65
  66         init_queue(queue, num_threads);
  67         for (i = 0; i < num_threads; i++) {
  68                 param[i] = i;
  69                 thrd_create(&threads[i], main_task, &param[i]);
  70         }
  71         for (i = 0; i < num_threads; i++)
  72                 thrd_join(threads[i]);
  73 /*
  74         for (i = 0; i < num_threads; i++) {
  75                 in_sum += input[i];
  76                 out_sum += output[i];
  77         }
  78         for (i = 0; i < num_threads; i++)
  79                 printf("input[%d] = %u\n", i, input[i]);
  80         for (i = 0; i < num_threads; i++)
  81                 printf("output[%d] = %u\n", i, output[i]);
  82         //MODEL_ASSERT(in_sum == out_sum);
  83         */
  84
  85         free(param);
  86         free(threads);
  87         free(queue);
  88
  89         return 0;
  90 }