📄 libc-lock.h
字号:
/* libc-internal interface for mutex locks. LinuxThreads version. Copyright (C) 1996,1997,1998,1999,2000,2001,2002,2003 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with the GNU C Library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */#ifndef _BITS_LIBC_LOCK_H#define _BITS_LIBC_LOCK_H 1#include <pthread.h>#if defined _LIBC && !defined NOT_IN_libc#include <linuxthreads/internals.h>#endif/* Mutex type. */#if defined(_LIBC) || defined(_IO_MTSAFE_IO)typedef pthread_mutex_t __libc_lock_t;typedef struct { pthread_mutex_t mutex; } __libc_lock_recursive_t;# ifdef __USE_UNIX98typedef pthread_rwlock_t __libc_rwlock_t;# elsetypedef struct __libc_rwlock_opaque__ __libc_rwlock_t;# endiftypedef __libc_lock_recursive_t __rtld_lock_recursive_t;#elsetypedef struct __libc_lock_opaque__ __libc_lock_t;typedef struct __libc_lock_recursive_opaque__ __libc_lock_recursive_t;typedef struct __libc_rwlock_opaque__ __libc_rwlock_t;#endif/* Type for key to thread-specific data. */typedef pthread_key_t __libc_key_t;/* Define a lock variable NAME with storage class CLASS. The lock must be initialized with __libc_lock_init before it can be used (or define it with __libc_lock_define_initialized, below). Use `extern' for CLASS to declare a lock defined in another module. In public structure definitions you must use a pointer to the lock structure (i.e., NAME begins with a `*'), because its storage size will not be known outside of libc. */#define __libc_lock_define(CLASS,NAME) \ CLASS __libc_lock_t NAME;#define __libc_rwlock_define(CLASS,NAME) \ CLASS __libc_rwlock_t NAME;#define __libc_lock_define_recursive(CLASS,NAME) \ CLASS __libc_lock_recursive_t NAME;#define __rtld_lock_define_recursive(CLASS,NAME) \ CLASS __rtld_lock_recursive_t NAME;/* Define an initialized lock variable NAME with storage class CLASS. For the C library we take a deeper look at the initializer. For this implementation all fields are initialized to zero. Therefore we don't initialize the variable which allows putting it into the BSS section. (Except on PA-RISC and other odd architectures, where initialized locks must be set to one due to the lack of normal atomic operations.) */#if __LT_SPINLOCK_INIT == 0# define __libc_lock_define_initialized(CLASS,NAME) \ CLASS __libc_lock_t NAME;#else# define __libc_lock_define_initialized(CLASS,NAME) \ CLASS __libc_lock_t NAME = PTHREAD_MUTEX_INITIALIZER;#endif#define __libc_rwlock_define_initialized(CLASS,NAME) \ CLASS __libc_rwlock_t NAME = PTHREAD_RWLOCK_INITIALIZER;/* Define an initialized recursive lock variable NAME with storage class CLASS. */#define __libc_lock_define_initialized_recursive(CLASS,NAME) \ CLASS __libc_lock_recursive_t NAME = _LIBC_LOCK_RECURSIVE_INITIALIZER;#define _LIBC_LOCK_RECURSIVE_INITIALIZER \ {PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP}#define __rtld_lock_define_initialized_recursive(CLASS,NAME) \ CLASS __rtld_lock_recursive_t NAME = _RTLD_LOCK_RECURSIVE_INITIALIZER;#define _RTLD_LOCK_RECURSIVE_INITIALIZER \ {PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP}#if defined _LIBC && defined IS_IN_libpthread# define __libc_maybe_call(FUNC, ARGS, ELSE) FUNC ARGS#else# if defined __PIC__ || (defined _LIBC && defined SHARED)# define __libc_maybe_call(FUNC, ARGS, ELSE) \ (__extension__ ({ __typeof (FUNC) *_fn = (FUNC); \ _fn != NULL ? (*_fn) ARGS : ELSE; }))# else# define __libc_maybe_call(FUNC, ARGS, ELSE) \ (FUNC != NULL ? FUNC ARGS : ELSE)# endif#endif#if defined _LIBC && !defined NOT_IN_libc && defined SHARED# define __libc_maybe_call2(FUNC, ARGS, ELSE) \ ({__builtin_expect (__libc_pthread_functions.ptr_##FUNC != NULL, 0) \ ? __libc_pthread_functions.ptr_##FUNC ARGS : ELSE; })#else# define __libc_maybe_call2(FUNC, ARGS, ELSE) __libc_maybe_call (__##FUNC, ARGS, ELSE)#endif/* Initialize the named lock variable, leaving it in a consistent, unlocked state. */#if defined _LIBC && !defined NOT_IN_libc && defined SHARED#define __libc_lock_init(NAME) \ ({ \ (NAME).__m_count = 0; \ (NAME).__m_owner = NULL; \ (NAME).__m_kind = PTHREAD_MUTEX_TIMED_NP; \ (NAME).__m_lock.__status = 0; \ (NAME).__m_lock.__spinlock = __LT_SPINLOCK_INIT; \ 0; })#else#define __libc_lock_init(NAME) \ (__libc_maybe_call2 (pthread_mutex_init, (&(NAME), NULL), 0))#endif#define __libc_rwlock_init(NAME) \ (__libc_maybe_call (__pthread_rwlock_init, (&(NAME), NULL), 0));/* Same as last but this time we initialize a recursive mutex. */#if defined _LIBC && !defined NOT_IN_libc && defined SHARED#define __libc_lock_init_recursive(NAME) \ ({ \ (NAME).mutex.__m_count = 0; \ (NAME).mutex.__m_owner = NULL; \ (NAME).mutex.__m_kind = PTHREAD_MUTEX_RECURSIVE_NP; \ (NAME).mutex.__m_lock.__status = 0; \ (NAME).mutex.__m_lock.__spinlock = __LT_SPINLOCK_INIT; \ 0; })#else#define __libc_lock_init_recursive(NAME) \ do { \ if (__pthread_mutex_init != NULL) \ { \ pthread_mutexattr_t __attr; \ __pthread_mutexattr_init (&__attr); \ __pthread_mutexattr_settype (&__attr, PTHREAD_MUTEX_RECURSIVE_NP); \ __pthread_mutex_init (&(NAME).mutex, &__attr); \ __pthread_mutexattr_destroy (&__attr); \ } \ } while (0);#endif#define __rtld_lock_init_recursive(NAME) \ __libc_lock_init_recursive (NAME)/* Finalize the named lock variable, which must be locked. It cannot be used again until __libc_lock_init is called again on it. This must be called on a lock variable before the containing storage is reused. */#define __libc_lock_fini(NAME) \ (__libc_maybe_call2 (pthread_mutex_destroy, (&(NAME)), 0));#define __libc_rwlock_fini(NAME) \ (__libc_maybe_call (__pthread_rwlock_destroy, (&(NAME)), 0));/* Finalize recursive named lock. */#define __libc_lock_fini_recursive(NAME) __libc_lock_fini ((NAME).mutex)#define __rtld_lock_fini_recursive(NAME) __libc_lock_fini_recursive (NAME)/* Lock the named lock variable. */#define __libc_lock_lock(NAME) \ (__libc_maybe_call2 (pthread_mutex_lock, (&(NAME)), 0));#define __libc_rwlock_rdlock(NAME) \ (__libc_maybe_call (__pthread_rwlock_rdlock, (&(NAME)), 0));#define __libc_rwlock_wrlock(NAME) \ (__libc_maybe_call (__pthread_rwlock_wrlock, (&(NAME)), 0));/* Lock the recursive named lock variable. */#define __libc_lock_lock_recursive(NAME) __libc_lock_lock ((NAME).mutex)/* Try to lock the named lock variable. */#define __libc_lock_trylock(NAME) \ (__libc_maybe_call2 (pthread_mutex_trylock, (&(NAME)), 0))#define __libc_rwlock_tryrdlock(NAME) \ (__libc_maybe_call (__pthread_rwlock_tryrdlock, (&(NAME)), 0))#define __libc_rwlock_trywrlock(NAME) \ (__libc_maybe_call (__pthread_rwlock_trywrlock, (&(NAME)), 0))/* Try to lock the recursive named lock variable. */#define __libc_lock_trylock_recursive(NAME) __libc_lock_trylock ((NAME).mutex)#define __rtld_lock_trylock_recursive(NAME) \ __libc_lock_trylock_recursive (NAME)/* Unlock the named lock variable. */#define __libc_lock_unlock(NAME) \ (__libc_maybe_call2 (pthread_mutex_unlock, (&(NAME)), 0));#define __libc_rwlock_unlock(NAME) \ (__libc_maybe_call (__pthread_rwlock_unlock, (&(NAME)), 0));/* Unlock the recursive named lock variable. */#define __libc_lock_unlock_recursive(NAME) __libc_lock_unlock ((NAME).mutex)#if defined _LIBC && defined SHARED# define __rtld_lock_default_lock_recursive(lock) \
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -