blob: 3524ef189c7b5ff31857ab76f9a2f6f2d33c43e2 [file] [log] [blame]
Christopher Faulet1a2b56e2017-10-12 16:09:09 +02001/*
2 * include/common/hathreads.h
3 * definitions, macros and inline functions about threads.
4 *
5 * Copyright (C) 2017 Christopher Fauet - cfaulet@haproxy.com
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22#ifndef _COMMON_HATHREADS_H
23#define _COMMON_HATHREADS_H
24
25#include <common/config.h>
26
27#define MAX_THREADS_MASK ((unsigned long)-1)
28extern THREAD_LOCAL unsigned int tid; /* The thread id */
29extern THREAD_LOCAL unsigned int tid_bit; /* The bit corresponding to the thread id */
30
31#ifndef USE_THREAD
32
33#define HA_ATOMIC_CAS(val, old, new) ({((*val) == (*old)) ? (*(val) = (new) , 1) : (*(old) = *(val), 0);})
34#define HA_ATOMIC_ADD(val, i) ({*(val) += (i);})
35#define HA_ATOMIC_SUB(val, i) ({*(val) -= (i);})
36#define HA_ATOMIC_AND(val, flags) ({*(val) &= (flags);})
37#define HA_ATOMIC_OR(val, flags) ({*(val) |= (flags);})
38#define HA_ATOMIC_XCHG(val, new) \
39 ({ \
40 typeof(*(val)) __old = *(val); \
41 *(val) = new; \
42 __old; \
43 })
44#define HA_ATOMIC_STORE(val, new) ({*(val) = new;})
45#define HA_ATOMIC_UPDATE_MAX(val, new) \
46 ({ \
47 typeof(*(val)) __new = (new); \
48 \
49 if (*(val) < __new) \
50 *(val) = __new; \
51 *(val); \
52 })
53
54#define HA_ATOMIC_UPDATE_MIN(val, new) \
55 ({ \
56 typeof(*(val)) __new = (new); \
57 \
58 if (*(val) > __new) \
59 *(val) = __new; \
60 *(val); \
61 })
62
Willy Tarreaub29dc952017-10-31 18:00:20 +010063#define HA_BARRIER() do { } while (0)
Christopher Faulet339fff82017-10-19 11:59:15 +020064
65#define THREAD_SYNC_INIT(m) do { /* do nothing */ } while(0)
66#define THREAD_SYNC_ENABLE() do { /* do nothing */ } while(0)
67#define THREAD_WANT_SYNC() do { /* do nothing */ } while(0)
68#define THREAD_ENTER_SYNC() do { /* do nothing */ } while(0)
69#define THREAD_EXIT_SYNC() do { /* do nothing */ } while(0)
70#define THREAD_NO_SYNC() ({ 0; })
71#define THREAD_NEED_SYNC() ({ 1; })
72
Christopher Faulet1a2b56e2017-10-12 16:09:09 +020073#define SPIN_INIT(l) do { /* do nothing */ } while(0)
74#define SPIN_DESTROY(l) do { /* do nothing */ } while(0)
75#define SPIN_LOCK(lbl, l) do { /* do nothing */ } while(0)
76#define SPIN_TRYLOCK(lbl, l) ({ 0; })
77#define SPIN_UNLOCK(lbl, l) do { /* do nothing */ } while(0)
78
79#define RWLOCK_INIT(l) do { /* do nothing */ } while(0)
80#define RWLOCK_DESTROY(l) do { /* do nothing */ } while(0)
81#define RWLOCK_WRLOCK(lbl, l) do { /* do nothing */ } while(0)
82#define RWLOCK_TRYWRLOCK(lbl, l) ({ 0; })
83#define RWLOCK_WRUNLOCK(lbl, l) do { /* do nothing */ } while(0)
84#define RWLOCK_RDLOCK(lbl, l) do { /* do nothing */ } while(0)
85#define RWLOCK_TRYRDLOCK(lbl, l) ({ 0; })
86#define RWLOCK_RDUNLOCK(lbl, l) do { /* do nothing */ } while(0)
87
88#else /* USE_THREAD */
89
90#include <stdio.h>
91#include <stdlib.h>
92#include <string.h>
93#include <pthread.h>
94#include <import/plock.h>
95
96/* TODO: thread: For now, we rely on GCC builtins but it could be a good idea to
97 * have a header file regrouping all functions dealing with threads. */
98#define HA_ATOMIC_CAS(val, old, new) __atomic_compare_exchange_n(val, old, new, 0, 0, 0)
99#define HA_ATOMIC_ADD(val, i) __atomic_add_fetch(val, i, 0)
100#define HA_ATOMIC_SUB(val, i) __atomic_sub_fetch(val, i, 0)
101#define HA_ATOMIC_AND(val, flags) __atomic_and_fetch(val, flags, 0)
102#define HA_ATOMIC_OR(val, flags) __atomic_or_fetch(val, flags, 0)
103#define HA_ATOMIC_XCHG(val, new) __atomic_exchange_n(val, new, 0)
104#define HA_ATOMIC_STORE(val, new) __atomic_store_n(val, new, 0)
105#define HA_ATOMIC_UPDATE_MAX(val, new) \
106 ({ \
107 typeof(*(val)) __old = *(val); \
108 typeof(*(val)) __new = (new); \
109 \
110 while (__old < __new && !HA_ATOMIC_CAS(val, &__old, __new)); \
111 (*val); \
112 })
113#define HA_ATOMIC_UPDATE_MIN(val, new) \
114 ({ \
115 typeof((*val)) __old = *(val); \
116 typeof((*val)) __new = (new); \
117 \
118 while (__old > __new && !HA_ATOMIC_CAS(val, &__old, __new)); \
119 (*val); \
120 })
121
Willy Tarreaub29dc952017-10-31 18:00:20 +0100122#define HA_BARRIER() pl_barrier()
123
Christopher Faulet339fff82017-10-19 11:59:15 +0200124#define THREAD_SYNC_INIT(m) thread_sync_init(m)
125#define THREAD_SYNC_ENABLE() thread_sync_enable()
126#define THREAD_WANT_SYNC() thread_want_sync()
127#define THREAD_ENTER_SYNC() thread_enter_sync()
128#define THREAD_EXIT_SYNC() thread_exit_sync()
129#define THREAD_NO_SYNC() thread_no_sync()
130#define THREAD_NEED_SYNC() thread_need_sync()
131
132int thread_sync_init(unsigned long mask);
133void thread_sync_enable(void);
134void thread_want_sync(void);
135void thread_enter_sync(void);
136void thread_exit_sync(void);
137int thread_no_sync(void);
138int thread_need_sync(void);
139
Christopher Faulet1a2b56e2017-10-12 16:09:09 +0200140#if defined(DEBUG_THREAD) || defined(DEBUG_FULL)
141
142enum lock_label {
Christopher Faulet339fff82017-10-19 11:59:15 +0200143 THREAD_SYNC_LOCK = 0,
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200144 FDTAB_LOCK,
145 FDCACHE_LOCK,
146 FD_LOCK,
147 POLL_LOCK,
Emeric Brunc60def82017-09-27 14:59:38 +0200148 TASK_RQ_LOCK,
149 TASK_WQ_LOCK,
Christopher Fauletb349e482017-08-29 09:52:38 +0200150 POOL_LOCK,
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200151 LISTENER_LOCK,
152 LISTENER_QUEUE_LOCK,
Christopher Fauletff8abcd2017-06-02 15:33:24 +0200153 PROXY_LOCK,
Christopher Faulet29f77e82017-06-08 14:04:45 +0200154 SERVER_LOCK,
Christopher Faulet5d42e092017-10-16 12:00:40 +0200155 UPDATED_SERVERS_LOCK,
Christopher Faulet5b517552017-06-09 14:17:53 +0200156 LBPRM_LOCK,
Christopher Fauletb79a94c2017-05-30 15:34:30 +0200157 SIGNALS_LOCK,
Emeric Brun819fc6f2017-06-13 19:37:32 +0200158 STK_TABLE_LOCK,
159 STK_SESS_LOCK,
Emeric Brun1138fd02017-06-19 12:38:55 +0200160 APPLETS_LOCK,
Emeric Brun80527f52017-06-19 17:46:37 +0200161 PEER_LOCK,
Emeric Bruna1dd2432017-06-21 15:42:52 +0200162 BUF_WQ_LOCK,
Emeric Brun6b35e9b2017-06-30 16:23:45 +0200163 STRMS_LOCK,
Emeric Brun821bb9b2017-06-15 16:37:39 +0200164 SSL_LOCK,
165 SSL_GEN_CERTS_LOCK,
Emeric Brunb5997f72017-07-03 11:34:05 +0200166 PATREF_LOCK,
167 PATEXP_LOCK,
168 PATLRU_LOCK,
Christopher Faulete95f2c32017-07-24 16:30:34 +0200169 VARS_LOCK,
Christopher Faulet8ca3b4b2017-07-25 11:07:15 +0200170 COMP_POOL_LOCK,
Thierry FOURNIER61ba0e22017-07-12 11:41:21 +0200171 LUA_LOCK,
Thierry FOURNIER738a6d72017-07-17 00:14:07 +0200172 NOTIF_LOCK,
Christopher Faulet24289f22017-09-25 14:48:02 +0200173 SPOE_APPLET_LOCK,
Christopher Fauletb2812a62017-10-04 16:17:58 +0200174 DNS_LOCK,
Christopher Fauletcfda8472017-10-20 15:40:23 +0200175 PID_LIST_LOCK,
Christopher Fauletc2a89a62017-10-23 15:54:24 +0200176 EMAIL_ALERTS_LOCK,
Christopher Faulet339fff82017-10-19 11:59:15 +0200177 LOCK_LABELS
Christopher Faulet1a2b56e2017-10-12 16:09:09 +0200178};
179struct lock_stat {
180 uint64_t nsec_wait_for_write;
181 uint64_t nsec_wait_for_read;
182 uint64_t num_write_locked;
183 uint64_t num_write_unlocked;
184 uint64_t num_read_locked;
185 uint64_t num_read_unlocked;
186};
187
188extern struct lock_stat lock_stats[LOCK_LABELS];
189
190#define __HA_SPINLOCK_T unsigned long
191
192#define __SPIN_INIT(l) ({ (*l) = 0; })
193#define __SPIN_DESTROY(l) ({ (*l) = 0; })
194#define __SPIN_LOCK(l) pl_take_w(l)
195#define __SPIN_TRYLOCK(l) !pl_try_w(l)
196#define __SPIN_UNLOCK(l) pl_drop_w(l)
197
198#define __HA_RWLOCK_T unsigned long
199
200#define __RWLOCK_INIT(l) ({ (*l) = 0; })
201#define __RWLOCK_DESTROY(l) ({ (*l) = 0; })
202#define __RWLOCK_WRLOCK(l) pl_take_w(l)
203#define __RWLOCK_TRYWRLOCK(l) !pl_try_w(l)
204#define __RWLOCK_WRUNLOCK(l) pl_drop_w(l)
205#define __RWLOCK_RDLOCK(l) pl_take_r(l)
206#define __RWLOCK_TRYRDLOCK(l) !pl_try_r(l)
207#define __RWLOCK_RDUNLOCK(l) pl_drop_r(l)
208
209#define HA_SPINLOCK_T struct ha_spinlock
210
211#define SPIN_INIT(l) __spin_init(l)
212#define SPIN_DESTROY(l) __spin_destroy(l)
213
214#define SPIN_LOCK(lbl, l) __spin_lock(lbl, l, __func__, __FILE__, __LINE__)
215#define SPIN_TRYLOCK(lbl, l) __spin_trylock(lbl, l, __func__, __FILE__, __LINE__)
216#define SPIN_UNLOCK(lbl, l) __spin_unlock(lbl, l, __func__, __FILE__, __LINE__)
217
218#define HA_RWLOCK_T struct ha_rwlock
219
220#define RWLOCK_INIT(l) __ha_rwlock_init((l))
221#define RWLOCK_DESTROY(l) __ha_rwlock_destroy((l))
222#define RWLOCK_WRLOCK(lbl,l) __ha_rwlock_wrlock(lbl, l, __func__, __FILE__, __LINE__)
223#define RWLOCK_TRYWRLOCK(lbl,l) __ha_rwlock_trywrlock(lbl, l, __func__, __FILE__, __LINE__)
224#define RWLOCK_WRUNLOCK(lbl,l) __ha_rwlock_wrunlock(lbl, l, __func__, __FILE__, __LINE__)
225#define RWLOCK_RDLOCK(lbl,l) __ha_rwlock_rdlock(lbl, l)
226#define RWLOCK_TRYRDLOCK(lbl,l) __ha_rwlock_tryrdlock(lbl, l)
227#define RWLOCK_RDUNLOCK(lbl,l) __ha_rwlock_rdunlock(lbl, l)
228
229struct ha_spinlock {
230 __HA_SPINLOCK_T lock;
231 struct {
232 unsigned long owner; /* a bit is set to 1 << tid for the lock owner */
233 unsigned long waiters; /* a bit is set to 1 << tid for waiting threads */
234 struct {
235 const char *function;
236 const char *file;
237 int line;
238 } last_location; /* location of the last owner */
239 } info;
240};
241
242struct ha_rwlock {
243 __HA_RWLOCK_T lock;
244 struct {
245 unsigned long cur_writer; /* a bit is set to 1 << tid for the lock owner */
246 unsigned long wait_writers; /* a bit is set to 1 << tid for waiting writers */
247 unsigned long cur_readers; /* a bit is set to 1 << tid for current readers */
248 unsigned long wait_readers; /* a bit is set to 1 << tid for waiting waiters */
249 struct {
250 const char *function;
251 const char *file;
252 int line;
253 } last_location; /* location of the last write owner */
254 } info;
255};
256
257static inline void show_lock_stats()
258{
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200259 const char *labels[LOCK_LABELS] = {"THREAD_SYNC", "FDTAB", "FDCACHE", "FD", "POLL",
Christopher Fauletb79a94c2017-05-30 15:34:30 +0200260 "TASK_RQ", "TASK_WQ", "POOL",
Christopher Faulet29f77e82017-06-08 14:04:45 +0200261 "LISTENER", "LISTENER_QUEUE", "PROXY", "SERVER",
Emeric Brun1138fd02017-06-19 12:38:55 +0200262 "UPDATED_SERVERS", "LBPRM", "SIGNALS", "STK_TABLE", "STK_SESS",
Emeric Brunb5997f72017-07-03 11:34:05 +0200263 "APPLETS", "PEER", "BUF_WQ", "STREAMS", "SSL", "SSL_GEN_CERTS",
Thierry FOURNIER738a6d72017-07-17 00:14:07 +0200264 "PATREF", "PATEXP", "PATLRU", "VARS", "COMP_POOL", "LUA",
Christopher Fauletc2a89a62017-10-23 15:54:24 +0200265 "NOTIF", "SPOE_APPLET", "DNS", "PID_LIST", "EMAIL_ALERTS" };
Christopher Faulet1a2b56e2017-10-12 16:09:09 +0200266 int lbl;
267
268 for (lbl = 0; lbl < LOCK_LABELS; lbl++) {
269 fprintf(stderr,
270 "Stats about Lock %s: \n"
271 "\t # write lock : %lu\n"
272 "\t # write unlock: %lu (%ld)\n"
273 "\t # wait time for write : %.3f msec\n"
274 "\t # wait time for write/lock: %.3f nsec\n"
275 "\t # read lock : %lu\n"
276 "\t # read unlock : %lu (%ld)\n"
277 "\t # wait time for read : %.3f msec\n"
278 "\t # wait time for read/lock : %.3f nsec\n",
279 labels[lbl],
280 lock_stats[lbl].num_write_locked,
281 lock_stats[lbl].num_write_unlocked,
282 lock_stats[lbl].num_write_unlocked - lock_stats[lbl].num_write_locked,
283 (double)lock_stats[lbl].nsec_wait_for_write / 1000000.0,
284 lock_stats[lbl].num_write_locked ? ((double)lock_stats[lbl].nsec_wait_for_write / (double)lock_stats[lbl].num_write_locked) : 0,
285 lock_stats[lbl].num_read_locked,
286 lock_stats[lbl].num_read_unlocked,
287 lock_stats[lbl].num_read_unlocked - lock_stats[lbl].num_read_locked,
288 (double)lock_stats[lbl].nsec_wait_for_read / 1000000.0,
289 lock_stats[lbl].num_read_locked ? ((double)lock_stats[lbl].nsec_wait_for_read / (double)lock_stats[lbl].num_read_locked) : 0);
290 }
291}
292
293/* Following functions are used to collect some stats about locks. We wrap
294 * pthread functions to known how much time we wait in a lock. */
295
296static uint64_t nsec_now(void) {
297 struct timespec ts;
298
299 clock_gettime(CLOCK_MONOTONIC, &ts);
300 return ((uint64_t) ts.tv_sec * 1000000000ULL +
301 (uint64_t) ts.tv_nsec);
302}
303
304static inline void __ha_rwlock_init(struct ha_rwlock *l)
305{
306 memset(l, 0, sizeof(struct ha_rwlock));
307 __RWLOCK_INIT(&l->lock);
308}
309
310static inline void __ha_rwlock_destroy(struct ha_rwlock *l)
311{
312 __RWLOCK_DESTROY(&l->lock);
313 memset(l, 0, sizeof(struct ha_rwlock));
314}
315
316
317static inline void __ha_rwlock_wrlock(enum lock_label lbl, struct ha_rwlock *l,
318 const char *func, const char *file, int line)
319{
320 uint64_t start_time;
321
322 if (unlikely(l->info.cur_writer & tid_bit)) {
323 /* the thread is already owning the lock for write */
324 abort();
325 }
326
327 if (unlikely(l->info.cur_readers & tid_bit)) {
328 /* the thread is already owning the lock for read */
329 abort();
330 }
331
332 HA_ATOMIC_OR(&l->info.wait_writers, tid_bit);
333
334 start_time = nsec_now();
335 __RWLOCK_WRLOCK(&l->lock);
336 HA_ATOMIC_ADD(&lock_stats[lbl].nsec_wait_for_write, (nsec_now() - start_time));
337
338 HA_ATOMIC_ADD(&lock_stats[lbl].num_write_locked, 1);
339
340 l->info.cur_writer = tid_bit;
341 l->info.last_location.function = func;
342 l->info.last_location.file = file;
343 l->info.last_location.line = line;
344
345 HA_ATOMIC_AND(&l->info.wait_writers, ~tid_bit);
346}
347
348static inline int __ha_rwlock_trywrlock(enum lock_label lbl, struct ha_rwlock *l,
349 const char *func, const char *file, int line)
350{
351 uint64_t start_time;
352 int r;
353
354 if (unlikely(l->info.cur_writer & tid_bit)) {
355 /* the thread is already owning the lock for write */
356 abort();
357 }
358
359 if (unlikely(l->info.cur_readers & tid_bit)) {
360 /* the thread is already owning the lock for read */
361 abort();
362 }
363
364 /* We set waiting writer because trywrlock could wait for readers to quit */
365 HA_ATOMIC_OR(&l->info.wait_writers, tid_bit);
366
367 start_time = nsec_now();
368 r = __RWLOCK_TRYWRLOCK(&l->lock);
369 HA_ATOMIC_ADD(&lock_stats[lbl].nsec_wait_for_write, (nsec_now() - start_time));
370 if (unlikely(r)) {
371 HA_ATOMIC_AND(&l->info.wait_writers, ~tid_bit);
372 return r;
373 }
374 HA_ATOMIC_ADD(&lock_stats[lbl].num_write_locked, 1);
375
376 l->info.cur_writer = tid_bit;
377 l->info.last_location.function = func;
378 l->info.last_location.file = file;
379 l->info.last_location.line = line;
380
381 HA_ATOMIC_AND(&l->info.wait_writers, ~tid_bit);
382
383 return 0;
384}
385
386static inline void __ha_rwlock_wrunlock(enum lock_label lbl,struct ha_rwlock *l,
387 const char *func, const char *file, int line)
388{
389 if (unlikely(!(l->info.cur_writer & tid_bit))) {
390 /* the thread is not owning the lock for write */
391 abort();
392 }
393
394 l->info.cur_writer = 0;
395 l->info.last_location.function = func;
396 l->info.last_location.file = file;
397 l->info.last_location.line = line;
398
399 __RWLOCK_WRUNLOCK(&l->lock);
400
401 HA_ATOMIC_ADD(&lock_stats[lbl].num_write_unlocked, 1);
402}
403
404static inline void __ha_rwlock_rdlock(enum lock_label lbl,struct ha_rwlock *l)
405{
406 uint64_t start_time;
407
408 if (unlikely(l->info.cur_writer & tid_bit)) {
409 /* the thread is already owning the lock for write */
410 abort();
411 }
412
413 if (unlikely(l->info.cur_readers & tid_bit)) {
414 /* the thread is already owning the lock for read */
415 abort();
416 }
417
418 HA_ATOMIC_OR(&l->info.wait_readers, tid_bit);
419
420 start_time = nsec_now();
421 __RWLOCK_RDLOCK(&l->lock);
422 HA_ATOMIC_ADD(&lock_stats[lbl].nsec_wait_for_read, (nsec_now() - start_time));
423 HA_ATOMIC_ADD(&lock_stats[lbl].num_read_locked, 1);
424
425 HA_ATOMIC_OR(&l->info.cur_readers, tid_bit);
426
427 HA_ATOMIC_AND(&l->info.wait_readers, ~tid_bit);
428}
429
430static inline int __ha_rwlock_tryrdlock(enum lock_label lbl,struct ha_rwlock *l)
431{
432 int r;
433
434 if (unlikely(l->info.cur_writer & tid_bit)) {
435 /* the thread is already owning the lock for write */
436 abort();
437 }
438
439 if (unlikely(l->info.cur_readers & tid_bit)) {
440 /* the thread is already owning the lock for read */
441 abort();
442 }
443
444 /* try read should never wait */
445 r = __RWLOCK_TRYRDLOCK(&l->lock);
446 if (unlikely(r))
447 return r;
448 HA_ATOMIC_ADD(&lock_stats[lbl].num_read_locked, 1);
449
450 HA_ATOMIC_OR(&l->info.cur_readers, tid_bit);
451
452 return 0;
453}
454
455static inline void __ha_rwlock_rdunlock(enum lock_label lbl,struct ha_rwlock *l)
456{
457 if (unlikely(!(l->info.cur_readers & tid_bit))) {
458 /* the thread is not owning the lock for read */
459 abort();
460 }
461
462 HA_ATOMIC_AND(&l->info.cur_readers, ~tid_bit);
463
464 __RWLOCK_RDUNLOCK(&l->lock);
465
466 HA_ATOMIC_ADD(&lock_stats[lbl].num_read_unlocked, 1);
467}
468
469static inline void __spin_init(struct ha_spinlock *l)
470{
471 memset(l, 0, sizeof(struct ha_spinlock));
472 __SPIN_INIT(&l->lock);
473}
474
475static inline void __spin_destroy(struct ha_spinlock *l)
476{
477 __SPIN_DESTROY(&l->lock);
478 memset(l, 0, sizeof(struct ha_spinlock));
479}
480
481static inline void __spin_lock(enum lock_label lbl, struct ha_spinlock *l,
482 const char *func, const char *file, int line)
483{
484 uint64_t start_time;
485
486 if (unlikely(l->info.owner & tid_bit)) {
487 /* the thread is already owning the lock */
488 abort();
489 }
490
491 HA_ATOMIC_OR(&l->info.waiters, tid_bit);
492
493 start_time = nsec_now();
494 __SPIN_LOCK(&l->lock);
495 HA_ATOMIC_ADD(&lock_stats[lbl].nsec_wait_for_write, (nsec_now() - start_time));
496
497 HA_ATOMIC_ADD(&lock_stats[lbl].num_write_locked, 1);
498
499
500 l->info.owner = tid_bit;
501 l->info.last_location.function = func;
502 l->info.last_location.file = file;
503 l->info.last_location.line = line;
504
505 HA_ATOMIC_AND(&l->info.waiters, ~tid_bit);
506}
507
508static inline int __spin_trylock(enum lock_label lbl, struct ha_spinlock *l,
509 const char *func, const char *file, int line)
510{
511 int r;
512
513 if (unlikely(l->info.owner & tid_bit)) {
514 /* the thread is already owning the lock */
515 abort();
516 }
517
518 /* try read should never wait */
519 r = __SPIN_TRYLOCK(&l->lock);
520 if (unlikely(r))
521 return r;
522 HA_ATOMIC_ADD(&lock_stats[lbl].num_write_locked, 1);
523
524 l->info.owner = tid_bit;
525 l->info.last_location.function = func;
526 l->info.last_location.file = file;
527 l->info.last_location.line = line;
528
529 return 0;
530}
531
532static inline void __spin_unlock(enum lock_label lbl, struct ha_spinlock *l,
533 const char *func, const char *file, int line)
534{
535 if (unlikely(!(l->info.owner & tid_bit))) {
536 /* the thread is not owning the lock */
537 abort();
538 }
539
540 l->info.owner = 0;
541 l->info.last_location.function = func;
542 l->info.last_location.file = file;
543 l->info.last_location.line = line;
544
545 __RWLOCK_WRUNLOCK(&l->lock);
Christopher Faulet1a2b56e2017-10-12 16:09:09 +0200546 HA_ATOMIC_ADD(&lock_stats[lbl].num_write_unlocked, 1);
547}
548
549#else /* DEBUG_THREAD */
550
551#define HA_SPINLOCK_T unsigned long
552
553#define SPIN_INIT(l) ({ (*l) = 0; })
554#define SPIN_DESTROY(l) ({ (*l) = 0; })
555#define SPIN_LOCK(lbl, l) pl_take_w(l)
556#define SPIN_TRYLOCK(lbl, l) !pl_try_w(l)
557#define SPIN_UNLOCK(lbl, l) pl_drop_w(l)
558
559#define HA_RWLOCK_T unsigned long
560
561#define RWLOCK_INIT(l) ({ (*l) = 0; })
562#define RWLOCK_DESTROY(l) ({ (*l) = 0; })
563#define RWLOCK_WRLOCK(lbl,l) pl_take_w(l)
564#define RWLOCK_TRYWRLOCK(lbl,l) !pl_try_w(l)
565#define RWLOCK_WRUNLOCK(lbl,l) pl_drop_w(l)
566#define RWLOCK_RDLOCK(lbl,l) pl_take_r(l)
567#define RWLOCK_TRYRDLOCK(lbl,l) !pl_try_r(l)
568#define RWLOCK_RDUNLOCK(lbl,l) pl_drop_r(l)
569
570#endif /* DEBUG_THREAD */
571
572#endif /* USE_THREAD */
573
574#endif /* _COMMON_HATHREADS_H */