/linux-4.1.27/include/linux/ |
H A D | mutex-debug.h | 17 static struct lock_class_key __key; \ 19 __mutex_init((mutex), #mutex, &__key); \
|
H A D | semaphore.h | 34 static struct lock_class_key __key; sema_init() local 36 lockdep_init_map(&sem->lock.dep_map, "semaphore->lock", &__key, 0); sema_init()
|
H A D | percpu_counter.h | 35 static struct lock_class_key __key; \ 37 __percpu_counter_init(fbc, value, gfp, &__key); \
|
H A D | rwlock.h | 22 static struct lock_class_key __key; \ 24 __rwlock_init((lock), #lock, &__key); \
|
H A D | kthread.h | 113 static struct lock_class_key __key; \ 114 __init_kthread_worker((worker), "("#worker")->lock", &__key); \
|
H A D | timer.h | 115 static struct lock_class_key __key; \ 116 init_timer_key((_timer), (_flags), #_timer, &__key); \ 121 static struct lock_class_key __key; \ 122 init_timer_on_stack_key((_timer), (_flags), #_timer, &__key); \
|
H A D | mutex.h | 95 static struct lock_class_key __key; \ 97 __mutex_init((mutex), #mutex, &__key); \
|
H A D | rwsem.h | 89 static struct lock_class_key __key; \ 91 __init_rwsem((sem), #sem, &__key); \
|
H A D | btree-128.h | 83 void visitor128(void *elem, unsigned long opaque, unsigned long *__key,
|
H A D | ring_buffer.h | 96 static struct lock_class_key __key; \ 97 __ring_buffer_alloc((size), (flags), &__key); \
|
H A D | workqueue.h | 205 static struct lock_class_key __key; \ work_static() 209 lockdep_init_map(&(_work)->lockdep_map, #_work, &__key, 0); \ work_static() 383 static struct lock_class_key __key; \ 389 &__key, __lock_name, ##args); \
|
H A D | spinlock.h | 97 static struct lock_class_key __key; \ 99 __raw_spin_lock_init((lock), #lock, &__key); \
|
H A D | tty_ldisc.h | 153 static struct lock_class_key __key; \ 155 __init_ldsem((sem), #sem, &__key); \
|
H A D | device.h | 390 * instances of the __key variable */ 393 static struct lock_class_key __key; \ 394 __class_register(class, &__key); \ 486 * instances of the __key variable */ 489 static struct lock_class_key __key; \ 490 __class_create(owner, name, &__key); \
|
H A D | seqlock.h | 69 static struct lock_class_key __key; \ 70 __seqcount_init((s), #s, &__key); \
|
H A D | sysfs.h | 52 static struct lock_class_key __key; \ 54 (attr)->key = &__key; \
|
H A D | wait.h | 76 static struct lock_class_key __key; \ 78 __init_waitqueue_head((q), #q, &__key); \
|
/linux-4.1.27/tools/lib/lockdep/include/liblockdep/ |
H A D | mutex.h | 31 static struct lock_class_key __key; \ 33 __mutex_init((mutex), #mutex, &__key, (mutexattr)); \
|
H A D | rwlock.h | 32 static struct lock_class_key __key; \ 34 __rwlock_init((lock), #lock, &__key, (attr)); \
|
/linux-4.1.27/include/net/sctp/ |
H A D | auth.h | 68 #define key_for_each(__key, __list_head) \ 69 list_for_each_entry(__key, __list_head, key_list) 71 #define key_for_each_safe(__key, __tmp, __list_head) \ 72 list_for_each_entry_safe(__key, __tmp, __list_head, key_list)
|
/linux-4.1.27/lib/ |
H A D | btree.c | 307 * key smaller than __key, but larger than this parent key exists. 308 * So we set __key to the parent key and retry. We have to use the smallest 312 unsigned long *__key) btree_get_prev() 318 if (keyzero(geo, __key)) btree_get_prev() 323 longcpy(key, __key, geo->keylen); btree_get_prev() 347 longcpy(__key, bkey(geo, node, i), geo->keylen); btree_get_prev() 716 void visitor32(void *elem, unsigned long opaque, unsigned long *__key, visitor32() argument 720 u32 *key = (void *)__key; visitor32() 726 void visitor64(void *elem, unsigned long opaque, unsigned long *__key, visitor64() argument 730 u64 *key = (void *)__key; visitor64() 736 void visitor128(void *elem, unsigned long opaque, unsigned long *__key, visitor128() argument 740 u64 *key = (void *)__key; visitor128() 311 btree_get_prev(struct btree_head *head, struct btree_geo *geo, unsigned long *__key) btree_get_prev() argument
|
/linux-4.1.27/drivers/net/wireless/iwlwifi/ |
H A D | iwl-trans.h | 1022 static struct lock_class_key __key; trans_lockdep_init() local 1025 &__key, 0); trans_lockdep_init()
|