Repository navigation
Expand file tree
/
Copy pathtest_multithread.c
More file actions
284 lines (244 loc) · 7.04 KB
/
Copy pathtest_multithread.c
File metadata and controls
284 lines (244 loc) · 7.04 KB
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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
#define _GNU_SOURCE
#include <inttypes.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "lfq.h"
#include "cross-platform.h"
#if !defined(_MSC_VER)
#include <pthread.h>
#if defined(__linux__)
#include <sched.h>
#endif
#endif
#ifndef MAX_PRODUCER
#define MAX_PRODUCER 100
#endif
#ifndef MAX_CONSUMER
#define MAX_CONSUMER 10
#endif
#ifndef ITEMS_PER_PRODUCER
#define ITEMS_PER_PRODUCER 100000
#endif
#define SOMEID 667814649u
static volatile uint64_t cn_added = 0;
static volatile uint64_t cn_deled = 0;
static volatile uint64_t sum_added = 0;
static volatile uint64_t sum_deled = 0;
static lfq_atomic_int_t producer_id_next = 0;
static lfq_atomic_int_t consumer_tid_next = 0;
static lfq_atomic_int_t producers_running = 0;
static lfq_atomic_int_t errors = 0;
struct user_data {
uint32_t magic;
uint32_t producer;
uint32_t sequence;
};
#if defined(__linux__) && defined(LFQ_AFFINITY_MODE)
static int affinity_cpu_for_role(int consumer) {
cpu_set_t allowed;
CPU_ZERO(&allowed);
if (sched_getaffinity(0, sizeof(allowed), &allowed) != 0)
return -1;
int first = -1;
#if LFQ_AFFINITY_MODE == 2
int second = -1;
#endif
for (int cpu = 0; cpu < CPU_SETSIZE; ++cpu) {
if (!CPU_ISSET(cpu, &allowed))
continue;
if (first < 0) {
first = cpu;
continue;
}
#if LFQ_AFFINITY_MODE == 2
second = cpu;
#endif
break;
}
if (first < 0)
return -1;
#if LFQ_AFFINITY_MODE == 2
if (consumer && second >= 0)
return second;
#else
(void)consumer;
#endif
return first;
}
static void pin_current_for_role(int consumer) {
int cpu = affinity_cpu_for_role(consumer);
if (cpu < 0) {
ATOMIC_ADD(&errors, 1);
return;
}
cpu_set_t set;
CPU_ZERO(&set);
CPU_SET(cpu, &set);
if (pthread_setaffinity_np(pthread_self(), sizeof(set), &set) != 0)
ATOMIC_ADD(&errors, 1);
}
#else
static void pin_current_for_role(int consumer) {
(void)consumer;
}
#endif
THREAD_FN addq(void *data) {
struct lfq_ctx *ctx = (struct lfq_ctx *)data;
pin_current_for_role(0);
uint32_t producer = (uint32_t)(ATOMIC_ADD(&producer_id_next, 1) - 1);
uint64_t local_added = 0;
uint64_t local_sum = 0;
for (uint32_t i = 0; i < ITEMS_PER_PRODUCER; ++i) {
struct user_data *p = (struct user_data *)malloc(sizeof(*p));
if (!p) {
ATOMIC_ADD(&errors, 1);
break;
}
p->magic = SOMEID;
p->producer = producer;
p->sequence = i;
int rc = lfq_enqueue(ctx, p);
if (rc != 0) {
fprintf(stderr, "lfq_enqueue failed: %d\n", rc);
free(p);
ATOMIC_ADD(&errors, 1);
break;
}
++local_added;
local_sum += ((uint64_t)producer << 32) | i;
}
ATOMIC_ADD64(&cn_added, local_added);
ATOMIC_ADD64(&sum_added, local_sum);
ATOMIC_SUB(&producers_running, 1);
return 0;
}
THREAD_FN delq(void *data) {
struct lfq_ctx *ctx = (struct lfq_ctx *)data;
pin_current_for_role(1);
int tid = ATOMIC_ADD(&consumer_tid_next, 1) - 1;
uint64_t local_deleted = 0;
uint64_t local_sum = 0;
for (;;) {
void *raw = NULL;
int rc = lfq_try_dequeue_tid(ctx, tid, &raw);
if (rc == 1) {
struct user_data *p = (struct user_data *)raw;
if (!p || p->magic != SOMEID) {
fprintf(stderr, "data corruption detected\n");
ATOMIC_ADD(&errors, 1);
if (p)
free(p);
break;
}
local_sum += ((uint64_t)p->producer << 32) | p->sequence;
++local_deleted;
free(p);
continue;
}
if (rc < 0) {
fprintf(stderr, "lfq_try_dequeue_tid failed: %d\n", rc);
ATOMIC_ADD(&errors, 1);
break;
}
if (lfq_atomic_load_int(&producers_running) == 0)
break;
THREAD_YIELD();
}
ATOMIC_ADD64(&cn_deled, local_deleted);
ATOMIC_ADD64(&sum_deled, local_sum);
return 0;
}
int main(void) {
#if defined(__linux__) && defined(LFQ_AFFINITY_MODE)
printf("affinity stress mode=%d (1=same CPU, 2=producer/consumer split)\n",
LFQ_AFFINITY_MODE);
#endif
struct lfq_ctx ctx;
if (lfq_init(&ctx, MAX_CONSUMER) != 0) {
fprintf(stderr, "lfq_init failed\n");
return 1;
}
THREAD_TOKEN consumers[MAX_CONSUMER];
THREAD_TOKEN producers[MAX_PRODUCER];
int producer_created[MAX_PRODUCER] = {0};
int consumer_created[MAX_CONSUMER] = {0};
ATOMIC_ADD(&producers_running, MAX_PRODUCER);
for (int i = 0; i < MAX_PRODUCER; ++i) {
#if defined(_MSC_VER)
producers[i] = CreateThread(NULL, 0, addq, &ctx, 0, NULL);
if (producers[i]) {
producer_created[i] = 1;
} else {
ATOMIC_ADD(&errors, 1);
ATOMIC_SUB(&producers_running, 1);
}
#else
if (pthread_create(&producers[i], NULL, addq, &ctx) == 0) {
producer_created[i] = 1;
} else {
ATOMIC_ADD(&errors, 1);
ATOMIC_SUB(&producers_running, 1);
}
#endif
}
for (int i = 0; i < MAX_CONSUMER; ++i) {
#if defined(_MSC_VER)
consumers[i] = CreateThread(NULL, 0, delq, &ctx, 0, NULL);
if (consumers[i]) {
consumer_created[i] = 1;
} else {
ATOMIC_ADD(&errors, 1);
}
#else
if (pthread_create(&consumers[i], NULL, delq, &ctx) == 0) {
consumer_created[i] = 1;
} else {
ATOMIC_ADD(&errors, 1);
}
#endif
}
for (int i = 0; i < MAX_PRODUCER; ++i) {
if (producer_created[i])
THREAD_WAIT(producers[i]);
}
for (int i = 0; i < MAX_CONSUMER; ++i) {
if (consumer_created[i])
THREAD_WAIT(consumers[i]);
}
/* Drain if thread creation failed; accounting still has to match. */
for (;;) {
void *raw = NULL;
int rc = lfq_try_dequeue(&ctx, &raw);
if (rc == 0)
break;
if (rc < 0) {
ATOMIC_ADD(&errors, 1);
break;
}
struct user_data *p = (struct user_data *)raw;
if (!p || p->magic != SOMEID) {
ATOMIC_ADD(&errors, 1);
if (p)
free(p);
break;
}
ATOMIC_ADD64(&sum_deled, ((uint64_t)p->producer << 32) | p->sequence);
ATOMIC_ADD64(&cn_deled, 1);
free(p);
}
long retired = lfg_count_freelist(&ctx);
int clean = lfq_clean(&ctx);
int error_count = lfq_atomic_load_int(&errors);
printf("push=%" PRIu64 " pop=%" PRIu64
" sum_push=%" PRIu64 " sum_pop=%" PRIu64
" retired=%ld clean=%d errors=%d\n",
cn_added, cn_deled, sum_added, sum_deled, retired, clean, error_count);
if (cn_added != cn_deled || sum_added != sum_deled || clean != 0 || error_count != 0) {
fprintf(stderr, "multithread test FAILED\n");
return 1;
}
printf("multithread test PASS\n");
return 0;
}