forked from apache/brpc
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbthread_key_unittest.cpp
406 lines (347 loc) · 12.4 KB
/
bthread_key_unittest.cpp
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
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
#include <algorithm> // std::sort
#include "butil/atomicops.h"
#include <gtest/gtest.h>
#include "butil/time.h"
#include "butil/macros.h"
#include "butil/scoped_lock.h"
#include "butil/logging.h"
#include "bthread/bthread.h"
#include "bthread/unstable.h"
extern "C" {
int bthread_keytable_pool_size(bthread_keytable_pool_t* pool) {
bthread_keytable_pool_stat_t s;
if (bthread_keytable_pool_getstat(pool, &s) != 0) {
return 0;
}
return s.nfree;
}
}
namespace {
// Count tls usages.
struct Counters {
butil::atomic<size_t> ncreate;
butil::atomic<size_t> ndestroy;
butil::atomic<size_t> nenterthread;
butil::atomic<size_t> nleavethread;
};
// Wrap same counters into different objects to make sure that different key
// returns different objects as well as aggregate the usages.
struct CountersWrapper {
CountersWrapper(Counters* c, bthread_key_t key) : _c(c), _key(key) {}
~CountersWrapper() {
if (_c) {
_c->ndestroy.fetch_add(1, butil::memory_order_relaxed);
}
CHECK_EQ(0, bthread_key_delete(_key));
}
private:
Counters* _c;
bthread_key_t _key;
};
static void destroy_counters_wrapper(void* arg) {
delete static_cast<CountersWrapper*>(arg);
}
const size_t NKEY_PER_WORKER = 32;
// NOTE: returns void to use ASSERT
static void worker1_impl(Counters* cs) {
cs->nenterthread.fetch_add(1, butil::memory_order_relaxed);
bthread_key_t k[NKEY_PER_WORKER];
CountersWrapper* ws[arraysize(k)];
for (size_t i = 0; i < arraysize(k); ++i) {
ASSERT_EQ(0, bthread_key_create(&k[i], destroy_counters_wrapper));
}
for (size_t i = 0; i < arraysize(k); ++i) {
ws[i] = new CountersWrapper(cs, k[i]);
}
// Get just-created tls should return NULL.
for (size_t i = 0; i < arraysize(k); ++i) {
ASSERT_EQ(NULL, bthread_getspecific(k[i]));
}
for (size_t i = 0; i < arraysize(k); ++i) {
cs->ncreate.fetch_add(1, butil::memory_order_relaxed);
ASSERT_EQ(0, bthread_setspecific(k[i], ws[i]))
<< "i=" << i << " is_bthread=" << !!bthread_self();
}
// Sleep a while to make some context switches. TLS should be unchanged.
bthread_usleep(10000);
for (size_t i = 0; i < arraysize(k); ++i) {
ASSERT_EQ(ws[i], bthread_getspecific(k[i])) << "i=" << i;
}
cs->nleavethread.fetch_add(1, butil::memory_order_relaxed);
}
static void* worker1(void* arg) {
worker1_impl(static_cast<Counters*>(arg));
return NULL;
}
TEST(KeyTest, creating_key_in_parallel) {
Counters args;
memset(&args, 0, sizeof(args));
pthread_t th[8];
bthread_t bth[8];
for (size_t i = 0; i < arraysize(th); ++i) {
ASSERT_EQ(0, pthread_create(&th[i], NULL, worker1, &args));
}
for (size_t i = 0; i < arraysize(bth); ++i) {
ASSERT_EQ(0, bthread_start_background(&bth[i], NULL, worker1, &args));
}
for (size_t i = 0; i < arraysize(th); ++i) {
ASSERT_EQ(0, pthread_join(th[i], NULL));
}
for (size_t i = 0; i < arraysize(bth); ++i) {
ASSERT_EQ(0, bthread_join(bth[i], NULL));
}
ASSERT_EQ(arraysize(th) + arraysize(bth),
args.nenterthread.load(butil::memory_order_relaxed));
ASSERT_EQ(arraysize(th) + arraysize(bth),
args.nleavethread.load(butil::memory_order_relaxed));
ASSERT_EQ(NKEY_PER_WORKER * (arraysize(th) + arraysize(bth)),
args.ncreate.load(butil::memory_order_relaxed));
ASSERT_EQ(NKEY_PER_WORKER * (arraysize(th) + arraysize(bth)),
args.ndestroy.load(butil::memory_order_relaxed));
}
butil::atomic<size_t> seq(1);
std::vector<size_t> seqs;
pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
void dtor2(void* arg) {
BAIDU_SCOPED_LOCK(mutex);
seqs.push_back((size_t)arg);
}
// NOTE: returns void to use ASSERT
static void worker2_impl(bthread_key_t k) {
ASSERT_EQ(NULL, bthread_getspecific(k));
ASSERT_EQ(0, bthread_setspecific(k, (void*)seq.fetch_add(1)));
}
static void* worker2(void* arg) {
worker2_impl(*static_cast<bthread_key_t*>(arg));
return NULL;
}
TEST(KeyTest, use_one_key_in_different_threads) {
bthread_key_t k;
ASSERT_EQ(0, bthread_key_create(&k, dtor2)) << berror();
seqs.clear();
pthread_t th[16];
for (size_t i = 0; i < arraysize(th); ++i) {
ASSERT_EQ(0, pthread_create(&th[i], NULL, worker2, &k));
}
bthread_t bth[1];
for (size_t i = 0; i < arraysize(bth); ++i) {
ASSERT_EQ(0, bthread_start_urgent(&bth[i], NULL, worker2, &k));
}
for (size_t i = 0; i < arraysize(th); ++i) {
ASSERT_EQ(0, pthread_join(th[i], NULL));
}
for (size_t i = 0; i < arraysize(bth); ++i) {
ASSERT_EQ(0, bthread_join(bth[i], NULL));
}
ASSERT_EQ(arraysize(th) + arraysize(bth), seqs.size());
std::sort(seqs.begin(), seqs.end());
ASSERT_EQ(seqs.end(), std::unique(seqs.begin(), seqs.end()));
ASSERT_EQ(arraysize(th) + arraysize(bth) - 1, *(seqs.end()-1) - *seqs.begin());
ASSERT_EQ(0, bthread_key_delete(k));
}
struct Keys {
bthread_key_t valid_key;
bthread_key_t invalid_key;
};
void* const DUMMY_PTR = (void*)1;
void use_invalid_keys_impl(const Keys* keys) {
ASSERT_EQ(NULL, bthread_getspecific(keys->invalid_key));
// valid key returns NULL as well.
ASSERT_EQ(NULL, bthread_getspecific(keys->valid_key));
// both pthread_setspecific(of nptl) and bthread_setspecific should find
// the key is invalid.
ASSERT_EQ(EINVAL, bthread_setspecific(keys->invalid_key, DUMMY_PTR));
ASSERT_EQ(0, bthread_setspecific(keys->valid_key, DUMMY_PTR));
// Print error again.
ASSERT_EQ(NULL, bthread_getspecific(keys->invalid_key));
ASSERT_EQ(DUMMY_PTR, bthread_getspecific(keys->valid_key));
}
void* use_invalid_keys(void* args) {
use_invalid_keys_impl(static_cast<const Keys*>(args));
return NULL;
}
TEST(KeyTest, use_invalid_keys) {
Keys keys;
ASSERT_EQ(0, bthread_key_create(&keys.valid_key, NULL));
// intended to be a created but invalid key.
keys.invalid_key.index = keys.valid_key.index;
keys.invalid_key.version = 123;
pthread_t th;
bthread_t bth;
ASSERT_EQ(0, pthread_create(&th, NULL, use_invalid_keys, &keys));
ASSERT_EQ(0, bthread_start_urgent(&bth, NULL, use_invalid_keys, &keys));
ASSERT_EQ(0, pthread_join(th, NULL));
ASSERT_EQ(0, bthread_join(bth, NULL));
ASSERT_EQ(0, bthread_key_delete(keys.valid_key));
}
TEST(KeyTest, reuse_key) {
bthread_key_t key;
ASSERT_EQ(0, bthread_key_create(&key, NULL));
ASSERT_EQ(NULL, bthread_getspecific(key));
ASSERT_EQ(0, bthread_setspecific(key, (void*)1));
ASSERT_EQ(0, bthread_key_delete(key)); // delete key before clearing TLS.
bthread_key_t key2;
ASSERT_EQ(0, bthread_key_create(&key2, NULL));
ASSERT_EQ(key.index, key2.index);
// The slot is not NULL, the impl must check version and return NULL.
ASSERT_EQ(NULL, bthread_getspecific(key2));
}
// NOTE: sid is short for 'set in dtor'.
struct SidData {
bthread_key_t key;
int seq;
int end_seq;
};
static void sid_dtor(void* tls){
SidData* data = (SidData*)tls;
// Should already be set NULL.
ASSERT_EQ(NULL, bthread_getspecific(data->key));
if (++data->seq < data->end_seq){
ASSERT_EQ(0, bthread_setspecific(data->key, data));
}
}
static void sid_thread_impl(SidData* data) {
ASSERT_EQ(0, bthread_setspecific(data->key, data));
};
static void* sid_thread(void* args) {
sid_thread_impl((SidData*)args);
return NULL;
}
TEST(KeyTest, set_in_dtor) {
bthread_key_t key;
ASSERT_EQ(0, bthread_key_create(&key, sid_dtor));
SidData pth_data = { key, 0, 3 };
SidData bth_data = { key, 0, 3 };
SidData bth2_data = { key, 0, 3 };
pthread_t pth;
bthread_t bth;
bthread_t bth2;
ASSERT_EQ(0, pthread_create(&pth, NULL, sid_thread, &pth_data));
ASSERT_EQ(0, bthread_start_urgent(&bth, NULL, sid_thread, &bth_data));
ASSERT_EQ(0, bthread_start_urgent(&bth2, &BTHREAD_ATTR_PTHREAD,
sid_thread, &bth2_data));
ASSERT_EQ(0, pthread_join(pth, NULL));
ASSERT_EQ(0, bthread_join(bth, NULL));
ASSERT_EQ(0, bthread_join(bth2, NULL));
ASSERT_EQ(0, bthread_key_delete(key));
EXPECT_EQ(pth_data.end_seq, pth_data.seq);
EXPECT_EQ(bth_data.end_seq, bth_data.seq);
EXPECT_EQ(bth2_data.end_seq, bth2_data.seq);
}
struct SBAData {
bthread_key_t key;
int level;
int ndestroy;
};
struct SBATLS {
int* ndestroy;
static void deleter(void* d) {
SBATLS* tls = (SBATLS*)d;
++*tls->ndestroy;
delete tls;
}
};
void* set_before_anybth(void* args);
void set_before_anybth_impl(SBAData* data) {
ASSERT_EQ(NULL, bthread_getspecific(data->key));
SBATLS *tls = new SBATLS;
tls->ndestroy = &data->ndestroy;
ASSERT_EQ(0, bthread_setspecific(data->key, tls));
ASSERT_EQ(tls, bthread_getspecific(data->key));
if (data->level++ == 0) {
bthread_t bth;
ASSERT_EQ(0, bthread_start_urgent(&bth, NULL, set_before_anybth, data));
ASSERT_EQ(0, bthread_join(bth, NULL));
ASSERT_EQ(1, data->ndestroy);
} else {
bthread_usleep(1000);
}
ASSERT_EQ(tls, bthread_getspecific(data->key));
}
void* set_before_anybth(void* args) {
set_before_anybth_impl((SBAData*)args);
return NULL;
}
TEST(KeyTest, set_tls_before_creating_any_bthread) {
bthread_key_t key;
ASSERT_EQ(0, bthread_key_create(&key, SBATLS::deleter));
pthread_t th;
SBAData data;
data.key = key;
data.level = 0;
data.ndestroy = 0;
ASSERT_EQ(0, pthread_create(&th, NULL, set_before_anybth, &data));
ASSERT_EQ(0, pthread_join(th, NULL));
ASSERT_EQ(0, bthread_key_delete(key));
ASSERT_EQ(2, data.level);
ASSERT_EQ(2, data.ndestroy);
}
struct PoolData {
bthread_key_t key;
PoolData* expected_data;
int seq;
int end_seq;
};
static void pool_thread_impl(PoolData* data) {
ASSERT_EQ(data->expected_data, (PoolData*)bthread_getspecific(data->key));
if (NULL == bthread_getspecific(data->key)) {
ASSERT_EQ(0, bthread_setspecific(data->key, data));
}
};
static void* pool_thread(void* args) {
pool_thread_impl((PoolData*)args);
return NULL;
}
static void pool_dtor(void* tls){
PoolData* data = (PoolData*)tls;
// Should already be set NULL.
ASSERT_EQ(NULL, bthread_getspecific(data->key));
if (++data->seq < data->end_seq){
ASSERT_EQ(0, bthread_setspecific(data->key, data));
}
}
TEST(KeyTest, using_pool) {
bthread_key_t key;
ASSERT_EQ(0, bthread_key_create(&key, pool_dtor));
bthread_keytable_pool_t pool;
ASSERT_EQ(0, bthread_keytable_pool_init(&pool));
ASSERT_EQ(0, bthread_keytable_pool_size(&pool));
bthread_attr_t attr;
ASSERT_EQ(0, bthread_attr_init(&attr));
attr.keytable_pool = &pool;
bthread_attr_t attr2 = attr;
attr2.stack_type = BTHREAD_STACKTYPE_PTHREAD;
PoolData bth_data = { key, NULL, 0, 3 };
bthread_t bth;
ASSERT_EQ(0, bthread_start_urgent(&bth, &attr, pool_thread, &bth_data));
ASSERT_EQ(0, bthread_join(bth, NULL));
ASSERT_EQ(0, bth_data.seq);
ASSERT_EQ(1, bthread_keytable_pool_size(&pool));
PoolData bth2_data = { key, &bth_data, 0, 3 };
bthread_t bth2;
ASSERT_EQ(0, bthread_start_urgent(&bth2, &attr2, pool_thread, &bth2_data));
ASSERT_EQ(0, bthread_join(bth2, NULL));
ASSERT_EQ(0, bth2_data.seq);
ASSERT_EQ(1, bthread_keytable_pool_size(&pool));
ASSERT_EQ(0, bthread_keytable_pool_destroy(&pool));
EXPECT_EQ(bth_data.end_seq, bth_data.seq);
EXPECT_EQ(0, bth2_data.seq);
ASSERT_EQ(0, bthread_key_delete(key));
}
} // namespace