File: bitlock_test.c

package info (click to toggle)
libbitarray 2.0-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 348 kB
  • sloc: ansic: 4,401; makefile: 117; cpp: 19; sh: 11
file content (178 lines) | stat: -rw-r--r-- 4,238 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
/*
 dev/bitlock_test.c
 project: bit array C library
 url: https://github.com/noporpoise/BitArray/
 maintainer: Isaac Turner <turner.isaac@gmail.com>
 license: Public Domain, no warranty
 date: Aug 2014
*/

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <pthread.h>
#include <unistd.h>
#include <stdbool.h>

#include "bit_macros.h"

typedef struct {
  pthread_t th;
  size_t id, result;
} TestThread;

// Do a million loops
#define NUM_LOOPS 10000
char *locks, *data;
pthread_mutex_t *mutexes;

void* worker_bitlock(void *ptr)
{
  TestThread *wrkr = (TestThread*)ptr;
  size_t i;
  for(i = 0; i < NUM_LOOPS; i++) {
    bitlock_yield_acquire(locks, i);
    wrkr->result += i + *(volatile char *)&data[i];
    data[i] = wrkr->id;
    usleep(5);
    bitlock_release(locks, i);
    usleep(5);
  }

  return NULL;
}

void* worker_bitlock_spin(void *ptr)
{
  TestThread *wrkr = (TestThread*)ptr;
  size_t i;
  for(i = 0; i < NUM_LOOPS; i++) {
    bitlock_acquire(locks, i);
    wrkr->result += i + *(volatile char *)&data[i];
    data[i] = wrkr->id;
    usleep(5);
    bitlock_release(locks, i);
    usleep(5);
  }

  return NULL;
}

void* worker_mutex(void *ptr)
{
  TestThread *wrkr = (TestThread*)ptr;
  size_t i;
  for(i = 0; i < NUM_LOOPS; i++) {
    pthread_mutex_lock(&mutexes[0]);
    wrkr->result += i + *(volatile char *)&data[i];
    data[i] = wrkr->id;
    usleep(5);
    pthread_mutex_unlock(&mutexes[0]);
    usleep(5);
  }

  return NULL;
}

void* worker_mutexes(void *ptr)
{
  TestThread *wrkr = (TestThread*)ptr;
  size_t i;
  for(i = 0; i < NUM_LOOPS; i++) {
    pthread_mutex_lock(&mutexes[i]);
    wrkr->result += i + *(volatile char *)&data[i];
    data[i] = wrkr->id;
    usleep(5);
    pthread_mutex_unlock(&mutexes[i]);
    usleep(5);
  }

  return NULL;
}

// sum of 0 up to num (inclusive)
#define cumm_sum(num) ((num)*(((num)+1)/2)+(((num)&1) ? 0 : (num)/2))

int main(int argc, char **argv)
{
  char *method = "Bitlocks";
  void* (*func)(void*) = worker_bitlock;

  if(argc == 2 && strcmp(argv[1],"bits") == 0) {}
  else if(argc == 2 && strcmp(argv[1],"mutex") == 0) {
    method = "Mutex";
    func = worker_mutex;
  }
  else if(argc == 2 && strcmp(argv[1],"mutexes") == 0) {
    method = "Mutexes";
    func = worker_mutexes;
  }
  else if(argc == 2 && strcmp(argv[1],"spin") == 0) {
    method = "Bitlocks-Spin";
    func = worker_bitlock_spin;
  }
  else if(argc != 1) {
    fprintf(stderr, "usage: ./bitlock_test <bits|mutex|spin>\n");
    exit(-1);
  }

  printf("\nTesting %s\n\n", method);

  int rc;
  size_t i, num_threads = 30;
  TestThread workers[num_threads];

  locks = (char*)calloc(1, (NUM_LOOPS+7)/8);
  data = (char*)calloc(1, NUM_LOOPS);
  mutexes = (pthread_mutex_t*)calloc(NUM_LOOPS, sizeof(pthread_mutex_t));

  for(i = 0; i < NUM_LOOPS; i++)
    pthread_mutex_init(&mutexes[i], NULL);

  // for(i = 0; i < num_threads; i++)
  //   printf("cummulative sum %zu: %zu\n", i, cumm_sum(i));

  // Create threads
  for(i = 0; i < num_threads; i++) {
    workers[i] = (TestThread){.id = i+1, .result = 0};
    rc = pthread_create(&workers[i].th, NULL, func, &workers[i]);
    if(rc) { fprintf(stderr, "pthread error: %s\n", strerror(rc)); exit(-1); }
  }

  // Wait for threads to finish
  for(i = 0; i < num_threads; i++) {
    rc = pthread_join(workers[i].th, NULL);
    if(rc) { fprintf(stderr, "pthread error: %s\n", strerror(rc)); exit(-1); }
  }

  for(i = 0; i < NUM_LOOPS; i++)
    pthread_mutex_destroy(&mutexes[i]);

  size_t sum = 0, expsum = 0;
  for(i = 0; i < NUM_LOOPS; i++) sum += data[i];
  for(i = 0; i < num_threads; i++) sum += workers[i].result;

  // for(i = 0; i < num_threads; i++) printf("got: %zu %zu\n", i, workers[i].result);

  // 0 1 2 3 4 5
  // 0 1 3 6 10
  expsum = cumm_sum(NUM_LOOPS-1)*num_threads + cumm_sum(num_threads)*NUM_LOOPS;
  // expsum = cumm_sum(NUM_LOOPS-1) * num_threads;

  bool pass = (sum == expsum);

  for(i = 0; i < sizeof(locks) && locks[i] == 0; i++) {}
  if(i < sizeof(locks)) {
    printf("locks not zeroed!\n");
    pass = false;
  }

  printf("sum: %zu exp: %zu\n", sum, expsum);
  printf("%s.\n\n", pass ? "Pass" : "Fail");

  free(mutexes);
  free(data);
  free(locks);

  return pass ? EXIT_SUCCESS : EXIT_FAILURE;
}