Christopher Faulet | 1a2b56e | 2017-10-12 16:09:09 +0200 | [diff] [blame] | 1 | /* |
| 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) |
| 28 | extern THREAD_LOCAL unsigned int tid; /* The thread id */ |
| 29 | extern 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 | |
Christopher Faulet | 339fff8 | 2017-10-19 11:59:15 +0200 | [diff] [blame] | 63 | |
| 64 | #define THREAD_SYNC_INIT(m) do { /* do nothing */ } while(0) |
| 65 | #define THREAD_SYNC_ENABLE() do { /* do nothing */ } while(0) |
| 66 | #define THREAD_WANT_SYNC() do { /* do nothing */ } while(0) |
| 67 | #define THREAD_ENTER_SYNC() do { /* do nothing */ } while(0) |
| 68 | #define THREAD_EXIT_SYNC() do { /* do nothing */ } while(0) |
| 69 | #define THREAD_NO_SYNC() ({ 0; }) |
| 70 | #define THREAD_NEED_SYNC() ({ 1; }) |
| 71 | |
Christopher Faulet | 1a2b56e | 2017-10-12 16:09:09 +0200 | [diff] [blame] | 72 | #define SPIN_INIT(l) do { /* do nothing */ } while(0) |
| 73 | #define SPIN_DESTROY(l) do { /* do nothing */ } while(0) |
| 74 | #define SPIN_LOCK(lbl, l) do { /* do nothing */ } while(0) |
| 75 | #define SPIN_TRYLOCK(lbl, l) ({ 0; }) |
| 76 | #define SPIN_UNLOCK(lbl, l) do { /* do nothing */ } while(0) |
| 77 | |
| 78 | #define RWLOCK_INIT(l) do { /* do nothing */ } while(0) |
| 79 | #define RWLOCK_DESTROY(l) do { /* do nothing */ } while(0) |
| 80 | #define RWLOCK_WRLOCK(lbl, l) do { /* do nothing */ } while(0) |
| 81 | #define RWLOCK_TRYWRLOCK(lbl, l) ({ 0; }) |
| 82 | #define RWLOCK_WRUNLOCK(lbl, l) do { /* do nothing */ } while(0) |
| 83 | #define RWLOCK_RDLOCK(lbl, l) do { /* do nothing */ } while(0) |
| 84 | #define RWLOCK_TRYRDLOCK(lbl, l) ({ 0; }) |
| 85 | #define RWLOCK_RDUNLOCK(lbl, l) do { /* do nothing */ } while(0) |
| 86 | |
| 87 | #else /* USE_THREAD */ |
| 88 | |
| 89 | #include <stdio.h> |
| 90 | #include <stdlib.h> |
| 91 | #include <string.h> |
| 92 | #include <pthread.h> |
| 93 | #include <import/plock.h> |
| 94 | |
| 95 | /* TODO: thread: For now, we rely on GCC builtins but it could be a good idea to |
| 96 | * have a header file regrouping all functions dealing with threads. */ |
| 97 | #define HA_ATOMIC_CAS(val, old, new) __atomic_compare_exchange_n(val, old, new, 0, 0, 0) |
| 98 | #define HA_ATOMIC_ADD(val, i) __atomic_add_fetch(val, i, 0) |
| 99 | #define HA_ATOMIC_SUB(val, i) __atomic_sub_fetch(val, i, 0) |
| 100 | #define HA_ATOMIC_AND(val, flags) __atomic_and_fetch(val, flags, 0) |
| 101 | #define HA_ATOMIC_OR(val, flags) __atomic_or_fetch(val, flags, 0) |
| 102 | #define HA_ATOMIC_XCHG(val, new) __atomic_exchange_n(val, new, 0) |
| 103 | #define HA_ATOMIC_STORE(val, new) __atomic_store_n(val, new, 0) |
| 104 | #define HA_ATOMIC_UPDATE_MAX(val, new) \ |
| 105 | ({ \ |
| 106 | typeof(*(val)) __old = *(val); \ |
| 107 | typeof(*(val)) __new = (new); \ |
| 108 | \ |
| 109 | while (__old < __new && !HA_ATOMIC_CAS(val, &__old, __new)); \ |
| 110 | (*val); \ |
| 111 | }) |
| 112 | #define HA_ATOMIC_UPDATE_MIN(val, new) \ |
| 113 | ({ \ |
| 114 | typeof((*val)) __old = *(val); \ |
| 115 | typeof((*val)) __new = (new); \ |
| 116 | \ |
| 117 | while (__old > __new && !HA_ATOMIC_CAS(val, &__old, __new)); \ |
| 118 | (*val); \ |
| 119 | }) |
| 120 | |
Christopher Faulet | 339fff8 | 2017-10-19 11:59:15 +0200 | [diff] [blame] | 121 | #define THREAD_SYNC_INIT(m) thread_sync_init(m) |
| 122 | #define THREAD_SYNC_ENABLE() thread_sync_enable() |
| 123 | #define THREAD_WANT_SYNC() thread_want_sync() |
| 124 | #define THREAD_ENTER_SYNC() thread_enter_sync() |
| 125 | #define THREAD_EXIT_SYNC() thread_exit_sync() |
| 126 | #define THREAD_NO_SYNC() thread_no_sync() |
| 127 | #define THREAD_NEED_SYNC() thread_need_sync() |
| 128 | |
| 129 | int thread_sync_init(unsigned long mask); |
| 130 | void thread_sync_enable(void); |
| 131 | void thread_want_sync(void); |
| 132 | void thread_enter_sync(void); |
| 133 | void thread_exit_sync(void); |
| 134 | int thread_no_sync(void); |
| 135 | int thread_need_sync(void); |
| 136 | |
Christopher Faulet | 1a2b56e | 2017-10-12 16:09:09 +0200 | [diff] [blame] | 137 | #if defined(DEBUG_THREAD) || defined(DEBUG_FULL) |
| 138 | |
| 139 | enum lock_label { |
Christopher Faulet | 339fff8 | 2017-10-19 11:59:15 +0200 | [diff] [blame] | 140 | THREAD_SYNC_LOCK = 0, |
Christopher Faulet | d4604ad | 2017-05-29 10:40:41 +0200 | [diff] [blame] | 141 | FDTAB_LOCK, |
| 142 | FDCACHE_LOCK, |
| 143 | FD_LOCK, |
| 144 | POLL_LOCK, |
Emeric Brun | c60def8 | 2017-09-27 14:59:38 +0200 | [diff] [blame] | 145 | TASK_RQ_LOCK, |
| 146 | TASK_WQ_LOCK, |
Christopher Faulet | b349e48 | 2017-08-29 09:52:38 +0200 | [diff] [blame] | 147 | POOL_LOCK, |
Christopher Faulet | 8d8aa0d | 2017-05-30 15:36:50 +0200 | [diff] [blame] | 148 | LISTENER_LOCK, |
| 149 | LISTENER_QUEUE_LOCK, |
Christopher Faulet | ff8abcd | 2017-06-02 15:33:24 +0200 | [diff] [blame] | 150 | PROXY_LOCK, |
Christopher Faulet | 29f77e8 | 2017-06-08 14:04:45 +0200 | [diff] [blame] | 151 | SERVER_LOCK, |
Christopher Faulet | 5d42e09 | 2017-10-16 12:00:40 +0200 | [diff] [blame^] | 152 | UPDATED_SERVERS_LOCK, |
Christopher Faulet | b79a94c | 2017-05-30 15:34:30 +0200 | [diff] [blame] | 153 | SIGNALS_LOCK, |
Christopher Faulet | 339fff8 | 2017-10-19 11:59:15 +0200 | [diff] [blame] | 154 | LOCK_LABELS |
Christopher Faulet | 1a2b56e | 2017-10-12 16:09:09 +0200 | [diff] [blame] | 155 | }; |
| 156 | struct lock_stat { |
| 157 | uint64_t nsec_wait_for_write; |
| 158 | uint64_t nsec_wait_for_read; |
| 159 | uint64_t num_write_locked; |
| 160 | uint64_t num_write_unlocked; |
| 161 | uint64_t num_read_locked; |
| 162 | uint64_t num_read_unlocked; |
| 163 | }; |
| 164 | |
| 165 | extern struct lock_stat lock_stats[LOCK_LABELS]; |
| 166 | |
| 167 | #define __HA_SPINLOCK_T unsigned long |
| 168 | |
| 169 | #define __SPIN_INIT(l) ({ (*l) = 0; }) |
| 170 | #define __SPIN_DESTROY(l) ({ (*l) = 0; }) |
| 171 | #define __SPIN_LOCK(l) pl_take_w(l) |
| 172 | #define __SPIN_TRYLOCK(l) !pl_try_w(l) |
| 173 | #define __SPIN_UNLOCK(l) pl_drop_w(l) |
| 174 | |
| 175 | #define __HA_RWLOCK_T unsigned long |
| 176 | |
| 177 | #define __RWLOCK_INIT(l) ({ (*l) = 0; }) |
| 178 | #define __RWLOCK_DESTROY(l) ({ (*l) = 0; }) |
| 179 | #define __RWLOCK_WRLOCK(l) pl_take_w(l) |
| 180 | #define __RWLOCK_TRYWRLOCK(l) !pl_try_w(l) |
| 181 | #define __RWLOCK_WRUNLOCK(l) pl_drop_w(l) |
| 182 | #define __RWLOCK_RDLOCK(l) pl_take_r(l) |
| 183 | #define __RWLOCK_TRYRDLOCK(l) !pl_try_r(l) |
| 184 | #define __RWLOCK_RDUNLOCK(l) pl_drop_r(l) |
| 185 | |
| 186 | #define HA_SPINLOCK_T struct ha_spinlock |
| 187 | |
| 188 | #define SPIN_INIT(l) __spin_init(l) |
| 189 | #define SPIN_DESTROY(l) __spin_destroy(l) |
| 190 | |
| 191 | #define SPIN_LOCK(lbl, l) __spin_lock(lbl, l, __func__, __FILE__, __LINE__) |
| 192 | #define SPIN_TRYLOCK(lbl, l) __spin_trylock(lbl, l, __func__, __FILE__, __LINE__) |
| 193 | #define SPIN_UNLOCK(lbl, l) __spin_unlock(lbl, l, __func__, __FILE__, __LINE__) |
| 194 | |
| 195 | #define HA_RWLOCK_T struct ha_rwlock |
| 196 | |
| 197 | #define RWLOCK_INIT(l) __ha_rwlock_init((l)) |
| 198 | #define RWLOCK_DESTROY(l) __ha_rwlock_destroy((l)) |
| 199 | #define RWLOCK_WRLOCK(lbl,l) __ha_rwlock_wrlock(lbl, l, __func__, __FILE__, __LINE__) |
| 200 | #define RWLOCK_TRYWRLOCK(lbl,l) __ha_rwlock_trywrlock(lbl, l, __func__, __FILE__, __LINE__) |
| 201 | #define RWLOCK_WRUNLOCK(lbl,l) __ha_rwlock_wrunlock(lbl, l, __func__, __FILE__, __LINE__) |
| 202 | #define RWLOCK_RDLOCK(lbl,l) __ha_rwlock_rdlock(lbl, l) |
| 203 | #define RWLOCK_TRYRDLOCK(lbl,l) __ha_rwlock_tryrdlock(lbl, l) |
| 204 | #define RWLOCK_RDUNLOCK(lbl,l) __ha_rwlock_rdunlock(lbl, l) |
| 205 | |
| 206 | struct ha_spinlock { |
| 207 | __HA_SPINLOCK_T lock; |
| 208 | struct { |
| 209 | unsigned long owner; /* a bit is set to 1 << tid for the lock owner */ |
| 210 | unsigned long waiters; /* a bit is set to 1 << tid for waiting threads */ |
| 211 | struct { |
| 212 | const char *function; |
| 213 | const char *file; |
| 214 | int line; |
| 215 | } last_location; /* location of the last owner */ |
| 216 | } info; |
| 217 | }; |
| 218 | |
| 219 | struct ha_rwlock { |
| 220 | __HA_RWLOCK_T lock; |
| 221 | struct { |
| 222 | unsigned long cur_writer; /* a bit is set to 1 << tid for the lock owner */ |
| 223 | unsigned long wait_writers; /* a bit is set to 1 << tid for waiting writers */ |
| 224 | unsigned long cur_readers; /* a bit is set to 1 << tid for current readers */ |
| 225 | unsigned long wait_readers; /* a bit is set to 1 << tid for waiting waiters */ |
| 226 | struct { |
| 227 | const char *function; |
| 228 | const char *file; |
| 229 | int line; |
| 230 | } last_location; /* location of the last write owner */ |
| 231 | } info; |
| 232 | }; |
| 233 | |
| 234 | static inline void show_lock_stats() |
| 235 | { |
Christopher Faulet | d4604ad | 2017-05-29 10:40:41 +0200 | [diff] [blame] | 236 | const char *labels[LOCK_LABELS] = {"THREAD_SYNC", "FDTAB", "FDCACHE", "FD", "POLL", |
Christopher Faulet | b79a94c | 2017-05-30 15:34:30 +0200 | [diff] [blame] | 237 | "TASK_RQ", "TASK_WQ", "POOL", |
Christopher Faulet | 29f77e8 | 2017-06-08 14:04:45 +0200 | [diff] [blame] | 238 | "LISTENER", "LISTENER_QUEUE", "PROXY", "SERVER", |
Christopher Faulet | 5d42e09 | 2017-10-16 12:00:40 +0200 | [diff] [blame^] | 239 | "UPDATED_SERVERS", "SIGNALS" }; |
Christopher Faulet | 1a2b56e | 2017-10-12 16:09:09 +0200 | [diff] [blame] | 240 | int lbl; |
| 241 | |
| 242 | for (lbl = 0; lbl < LOCK_LABELS; lbl++) { |
| 243 | fprintf(stderr, |
| 244 | "Stats about Lock %s: \n" |
| 245 | "\t # write lock : %lu\n" |
| 246 | "\t # write unlock: %lu (%ld)\n" |
| 247 | "\t # wait time for write : %.3f msec\n" |
| 248 | "\t # wait time for write/lock: %.3f nsec\n" |
| 249 | "\t # read lock : %lu\n" |
| 250 | "\t # read unlock : %lu (%ld)\n" |
| 251 | "\t # wait time for read : %.3f msec\n" |
| 252 | "\t # wait time for read/lock : %.3f nsec\n", |
| 253 | labels[lbl], |
| 254 | lock_stats[lbl].num_write_locked, |
| 255 | lock_stats[lbl].num_write_unlocked, |
| 256 | lock_stats[lbl].num_write_unlocked - lock_stats[lbl].num_write_locked, |
| 257 | (double)lock_stats[lbl].nsec_wait_for_write / 1000000.0, |
| 258 | lock_stats[lbl].num_write_locked ? ((double)lock_stats[lbl].nsec_wait_for_write / (double)lock_stats[lbl].num_write_locked) : 0, |
| 259 | lock_stats[lbl].num_read_locked, |
| 260 | lock_stats[lbl].num_read_unlocked, |
| 261 | lock_stats[lbl].num_read_unlocked - lock_stats[lbl].num_read_locked, |
| 262 | (double)lock_stats[lbl].nsec_wait_for_read / 1000000.0, |
| 263 | lock_stats[lbl].num_read_locked ? ((double)lock_stats[lbl].nsec_wait_for_read / (double)lock_stats[lbl].num_read_locked) : 0); |
| 264 | } |
| 265 | } |
| 266 | |
| 267 | /* Following functions are used to collect some stats about locks. We wrap |
| 268 | * pthread functions to known how much time we wait in a lock. */ |
| 269 | |
| 270 | static uint64_t nsec_now(void) { |
| 271 | struct timespec ts; |
| 272 | |
| 273 | clock_gettime(CLOCK_MONOTONIC, &ts); |
| 274 | return ((uint64_t) ts.tv_sec * 1000000000ULL + |
| 275 | (uint64_t) ts.tv_nsec); |
| 276 | } |
| 277 | |
| 278 | static inline void __ha_rwlock_init(struct ha_rwlock *l) |
| 279 | { |
| 280 | memset(l, 0, sizeof(struct ha_rwlock)); |
| 281 | __RWLOCK_INIT(&l->lock); |
| 282 | } |
| 283 | |
| 284 | static inline void __ha_rwlock_destroy(struct ha_rwlock *l) |
| 285 | { |
| 286 | __RWLOCK_DESTROY(&l->lock); |
| 287 | memset(l, 0, sizeof(struct ha_rwlock)); |
| 288 | } |
| 289 | |
| 290 | |
| 291 | static inline void __ha_rwlock_wrlock(enum lock_label lbl, struct ha_rwlock *l, |
| 292 | const char *func, const char *file, int line) |
| 293 | { |
| 294 | uint64_t start_time; |
| 295 | |
| 296 | if (unlikely(l->info.cur_writer & tid_bit)) { |
| 297 | /* the thread is already owning the lock for write */ |
| 298 | abort(); |
| 299 | } |
| 300 | |
| 301 | if (unlikely(l->info.cur_readers & tid_bit)) { |
| 302 | /* the thread is already owning the lock for read */ |
| 303 | abort(); |
| 304 | } |
| 305 | |
| 306 | HA_ATOMIC_OR(&l->info.wait_writers, tid_bit); |
| 307 | |
| 308 | start_time = nsec_now(); |
| 309 | __RWLOCK_WRLOCK(&l->lock); |
| 310 | HA_ATOMIC_ADD(&lock_stats[lbl].nsec_wait_for_write, (nsec_now() - start_time)); |
| 311 | |
| 312 | HA_ATOMIC_ADD(&lock_stats[lbl].num_write_locked, 1); |
| 313 | |
| 314 | l->info.cur_writer = tid_bit; |
| 315 | l->info.last_location.function = func; |
| 316 | l->info.last_location.file = file; |
| 317 | l->info.last_location.line = line; |
| 318 | |
| 319 | HA_ATOMIC_AND(&l->info.wait_writers, ~tid_bit); |
| 320 | } |
| 321 | |
| 322 | static inline int __ha_rwlock_trywrlock(enum lock_label lbl, struct ha_rwlock *l, |
| 323 | const char *func, const char *file, int line) |
| 324 | { |
| 325 | uint64_t start_time; |
| 326 | int r; |
| 327 | |
| 328 | if (unlikely(l->info.cur_writer & tid_bit)) { |
| 329 | /* the thread is already owning the lock for write */ |
| 330 | abort(); |
| 331 | } |
| 332 | |
| 333 | if (unlikely(l->info.cur_readers & tid_bit)) { |
| 334 | /* the thread is already owning the lock for read */ |
| 335 | abort(); |
| 336 | } |
| 337 | |
| 338 | /* We set waiting writer because trywrlock could wait for readers to quit */ |
| 339 | HA_ATOMIC_OR(&l->info.wait_writers, tid_bit); |
| 340 | |
| 341 | start_time = nsec_now(); |
| 342 | r = __RWLOCK_TRYWRLOCK(&l->lock); |
| 343 | HA_ATOMIC_ADD(&lock_stats[lbl].nsec_wait_for_write, (nsec_now() - start_time)); |
| 344 | if (unlikely(r)) { |
| 345 | HA_ATOMIC_AND(&l->info.wait_writers, ~tid_bit); |
| 346 | return r; |
| 347 | } |
| 348 | HA_ATOMIC_ADD(&lock_stats[lbl].num_write_locked, 1); |
| 349 | |
| 350 | l->info.cur_writer = tid_bit; |
| 351 | l->info.last_location.function = func; |
| 352 | l->info.last_location.file = file; |
| 353 | l->info.last_location.line = line; |
| 354 | |
| 355 | HA_ATOMIC_AND(&l->info.wait_writers, ~tid_bit); |
| 356 | |
| 357 | return 0; |
| 358 | } |
| 359 | |
| 360 | static inline void __ha_rwlock_wrunlock(enum lock_label lbl,struct ha_rwlock *l, |
| 361 | const char *func, const char *file, int line) |
| 362 | { |
| 363 | if (unlikely(!(l->info.cur_writer & tid_bit))) { |
| 364 | /* the thread is not owning the lock for write */ |
| 365 | abort(); |
| 366 | } |
| 367 | |
| 368 | l->info.cur_writer = 0; |
| 369 | l->info.last_location.function = func; |
| 370 | l->info.last_location.file = file; |
| 371 | l->info.last_location.line = line; |
| 372 | |
| 373 | __RWLOCK_WRUNLOCK(&l->lock); |
| 374 | |
| 375 | HA_ATOMIC_ADD(&lock_stats[lbl].num_write_unlocked, 1); |
| 376 | } |
| 377 | |
| 378 | static inline void __ha_rwlock_rdlock(enum lock_label lbl,struct ha_rwlock *l) |
| 379 | { |
| 380 | uint64_t start_time; |
| 381 | |
| 382 | if (unlikely(l->info.cur_writer & tid_bit)) { |
| 383 | /* the thread is already owning the lock for write */ |
| 384 | abort(); |
| 385 | } |
| 386 | |
| 387 | if (unlikely(l->info.cur_readers & tid_bit)) { |
| 388 | /* the thread is already owning the lock for read */ |
| 389 | abort(); |
| 390 | } |
| 391 | |
| 392 | HA_ATOMIC_OR(&l->info.wait_readers, tid_bit); |
| 393 | |
| 394 | start_time = nsec_now(); |
| 395 | __RWLOCK_RDLOCK(&l->lock); |
| 396 | HA_ATOMIC_ADD(&lock_stats[lbl].nsec_wait_for_read, (nsec_now() - start_time)); |
| 397 | HA_ATOMIC_ADD(&lock_stats[lbl].num_read_locked, 1); |
| 398 | |
| 399 | HA_ATOMIC_OR(&l->info.cur_readers, tid_bit); |
| 400 | |
| 401 | HA_ATOMIC_AND(&l->info.wait_readers, ~tid_bit); |
| 402 | } |
| 403 | |
| 404 | static inline int __ha_rwlock_tryrdlock(enum lock_label lbl,struct ha_rwlock *l) |
| 405 | { |
| 406 | int r; |
| 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 | /* try read should never wait */ |
| 419 | r = __RWLOCK_TRYRDLOCK(&l->lock); |
| 420 | if (unlikely(r)) |
| 421 | return r; |
| 422 | HA_ATOMIC_ADD(&lock_stats[lbl].num_read_locked, 1); |
| 423 | |
| 424 | HA_ATOMIC_OR(&l->info.cur_readers, tid_bit); |
| 425 | |
| 426 | return 0; |
| 427 | } |
| 428 | |
| 429 | static inline void __ha_rwlock_rdunlock(enum lock_label lbl,struct ha_rwlock *l) |
| 430 | { |
| 431 | if (unlikely(!(l->info.cur_readers & tid_bit))) { |
| 432 | /* the thread is not owning the lock for read */ |
| 433 | abort(); |
| 434 | } |
| 435 | |
| 436 | HA_ATOMIC_AND(&l->info.cur_readers, ~tid_bit); |
| 437 | |
| 438 | __RWLOCK_RDUNLOCK(&l->lock); |
| 439 | |
| 440 | HA_ATOMIC_ADD(&lock_stats[lbl].num_read_unlocked, 1); |
| 441 | } |
| 442 | |
| 443 | static inline void __spin_init(struct ha_spinlock *l) |
| 444 | { |
| 445 | memset(l, 0, sizeof(struct ha_spinlock)); |
| 446 | __SPIN_INIT(&l->lock); |
| 447 | } |
| 448 | |
| 449 | static inline void __spin_destroy(struct ha_spinlock *l) |
| 450 | { |
| 451 | __SPIN_DESTROY(&l->lock); |
| 452 | memset(l, 0, sizeof(struct ha_spinlock)); |
| 453 | } |
| 454 | |
| 455 | static inline void __spin_lock(enum lock_label lbl, struct ha_spinlock *l, |
| 456 | const char *func, const char *file, int line) |
| 457 | { |
| 458 | uint64_t start_time; |
| 459 | |
| 460 | if (unlikely(l->info.owner & tid_bit)) { |
| 461 | /* the thread is already owning the lock */ |
| 462 | abort(); |
| 463 | } |
| 464 | |
| 465 | HA_ATOMIC_OR(&l->info.waiters, tid_bit); |
| 466 | |
| 467 | start_time = nsec_now(); |
| 468 | __SPIN_LOCK(&l->lock); |
| 469 | HA_ATOMIC_ADD(&lock_stats[lbl].nsec_wait_for_write, (nsec_now() - start_time)); |
| 470 | |
| 471 | HA_ATOMIC_ADD(&lock_stats[lbl].num_write_locked, 1); |
| 472 | |
| 473 | |
| 474 | l->info.owner = tid_bit; |
| 475 | l->info.last_location.function = func; |
| 476 | l->info.last_location.file = file; |
| 477 | l->info.last_location.line = line; |
| 478 | |
| 479 | HA_ATOMIC_AND(&l->info.waiters, ~tid_bit); |
| 480 | } |
| 481 | |
| 482 | static inline int __spin_trylock(enum lock_label lbl, struct ha_spinlock *l, |
| 483 | const char *func, const char *file, int line) |
| 484 | { |
| 485 | int r; |
| 486 | |
| 487 | if (unlikely(l->info.owner & tid_bit)) { |
| 488 | /* the thread is already owning the lock */ |
| 489 | abort(); |
| 490 | } |
| 491 | |
| 492 | /* try read should never wait */ |
| 493 | r = __SPIN_TRYLOCK(&l->lock); |
| 494 | if (unlikely(r)) |
| 495 | return r; |
| 496 | HA_ATOMIC_ADD(&lock_stats[lbl].num_write_locked, 1); |
| 497 | |
| 498 | l->info.owner = tid_bit; |
| 499 | l->info.last_location.function = func; |
| 500 | l->info.last_location.file = file; |
| 501 | l->info.last_location.line = line; |
| 502 | |
| 503 | return 0; |
| 504 | } |
| 505 | |
| 506 | static inline void __spin_unlock(enum lock_label lbl, struct ha_spinlock *l, |
| 507 | const char *func, const char *file, int line) |
| 508 | { |
| 509 | if (unlikely(!(l->info.owner & tid_bit))) { |
| 510 | /* the thread is not owning the lock */ |
| 511 | abort(); |
| 512 | } |
| 513 | |
| 514 | l->info.owner = 0; |
| 515 | l->info.last_location.function = func; |
| 516 | l->info.last_location.file = file; |
| 517 | l->info.last_location.line = line; |
| 518 | |
| 519 | __RWLOCK_WRUNLOCK(&l->lock); |
| 520 | |
| 521 | HA_ATOMIC_ADD(&lock_stats[lbl].num_write_unlocked, 1); |
| 522 | } |
| 523 | |
| 524 | #else /* DEBUG_THREAD */ |
| 525 | |
| 526 | #define HA_SPINLOCK_T unsigned long |
| 527 | |
| 528 | #define SPIN_INIT(l) ({ (*l) = 0; }) |
| 529 | #define SPIN_DESTROY(l) ({ (*l) = 0; }) |
| 530 | #define SPIN_LOCK(lbl, l) pl_take_w(l) |
| 531 | #define SPIN_TRYLOCK(lbl, l) !pl_try_w(l) |
| 532 | #define SPIN_UNLOCK(lbl, l) pl_drop_w(l) |
| 533 | |
| 534 | #define HA_RWLOCK_T unsigned long |
| 535 | |
| 536 | #define RWLOCK_INIT(l) ({ (*l) = 0; }) |
| 537 | #define RWLOCK_DESTROY(l) ({ (*l) = 0; }) |
| 538 | #define RWLOCK_WRLOCK(lbl,l) pl_take_w(l) |
| 539 | #define RWLOCK_TRYWRLOCK(lbl,l) !pl_try_w(l) |
| 540 | #define RWLOCK_WRUNLOCK(lbl,l) pl_drop_w(l) |
| 541 | #define RWLOCK_RDLOCK(lbl,l) pl_take_r(l) |
| 542 | #define RWLOCK_TRYRDLOCK(lbl,l) !pl_try_r(l) |
| 543 | #define RWLOCK_RDUNLOCK(lbl,l) pl_drop_r(l) |
| 544 | |
| 545 | #endif /* DEBUG_THREAD */ |
| 546 | |
| 547 | #endif /* USE_THREAD */ |
| 548 | |
| 549 | #endif /* _COMMON_HATHREADS_H */ |