]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - include/linux/lockdep.h
ftrace: Fix debug preempt config name in stack_tracer_{en,dis}able
[mirror_ubuntu-artful-kernel.git] / include / linux / lockdep.h
CommitLineData
fbb9ce95
IM
1/*
2 * Runtime locking correctness validator
3 *
4b32d0a4 4 * Copyright (C) 2006,2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
90eec103 5 * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra
fbb9ce95 6 *
214e0aed 7 * see Documentation/locking/lockdep-design.txt for more details.
fbb9ce95
IM
8 */
9#ifndef __LINUX_LOCKDEP_H
10#define __LINUX_LOCKDEP_H
11
a1e96b03 12struct task_struct;
f20786ff 13struct lockdep_map;
a1e96b03 14
2edf5e49
DY
15/* for sysctl */
16extern int prove_locking;
17extern int lock_stat;
18
a5ecddfe
BG
19#define MAX_LOCKDEP_SUBCLASSES 8UL
20
db0b0ead
MT
21#ifdef CONFIG_LOCKDEP
22
fbb9ce95
IM
23#include <linux/linkage.h>
24#include <linux/list.h>
25#include <linux/debug_locks.h>
26#include <linux/stacktrace.h>
27
fbb9ce95 28/*
9851673b
PZ
29 * We'd rather not expose kernel/lockdep_states.h this wide, but we do need
30 * the total number of states... :-(
fbb9ce95 31 */
9851673b 32#define XXX_LOCK_USAGE_STATES (1+3*4)
fbb9ce95 33
62016250
HM
34/*
35 * NR_LOCKDEP_CACHING_CLASSES ... Number of classes
36 * cached in the instance of lockdep_map
37 *
38 * Currently main class (subclass == 0) and signle depth subclass
39 * are cached in lockdep_map. This optimization is mainly targeting
40 * on rq->lock. double_rq_lock() acquires this highly competitive with
41 * single depth.
42 */
43#define NR_LOCKDEP_CACHING_CLASSES 2
44
fbb9ce95
IM
45/*
46 * Lock-classes are keyed via unique addresses, by embedding the
47 * lockclass-key into the kernel (or module) .data section. (For
48 * static locks we use the lock address itself as the key.)
49 */
50struct lockdep_subclass_key {
51 char __one_byte;
52} __attribute__ ((__packed__));
53
54struct lock_class_key {
55 struct lockdep_subclass_key subkeys[MAX_LOCKDEP_SUBCLASSES];
56};
57
1704f47b
PZ
58extern struct lock_class_key __lockdep_no_validate__;
59
c7e78cff
PZ
60#define LOCKSTAT_POINTS 4
61
fbb9ce95
IM
62/*
63 * The lock-class itself:
64 */
65struct lock_class {
66 /*
67 * class-hash:
68 */
a63f38cc 69 struct hlist_node hash_entry;
fbb9ce95
IM
70
71 /*
72 * global list of all lock-classes:
73 */
74 struct list_head lock_entry;
75
76 struct lockdep_subclass_key *key;
77 unsigned int subclass;
e351b660 78 unsigned int dep_gen_id;
fbb9ce95
IM
79
80 /*
81 * IRQ/softirq usage tracking bits:
82 */
83 unsigned long usage_mask;
9851673b 84 struct stack_trace usage_traces[XXX_LOCK_USAGE_STATES];
fbb9ce95
IM
85
86 /*
87 * These fields represent a directed graph of lock dependencies,
88 * to every node we attach a list of "forward" and a list of
89 * "backward" graph nodes.
90 */
91 struct list_head locks_after, locks_before;
92
93 /*
94 * Generation counter, when doing certain classes of graph walking,
95 * to ensure that we check one node only once:
96 */
97 unsigned int version;
98
99 /*
100 * Statistics counter:
101 */
102 unsigned long ops;
103
104 const char *name;
105 int name_version;
f20786ff
PZ
106
107#ifdef CONFIG_LOCK_STAT
c7e78cff
PZ
108 unsigned long contention_point[LOCKSTAT_POINTS];
109 unsigned long contending_point[LOCKSTAT_POINTS];
f20786ff
PZ
110#endif
111};
112
113#ifdef CONFIG_LOCK_STAT
114struct lock_time {
115 s64 min;
116 s64 max;
117 s64 total;
118 unsigned long nr;
fbb9ce95
IM
119};
120
96645678
PZ
121enum bounce_type {
122 bounce_acquired_write,
123 bounce_acquired_read,
124 bounce_contended_write,
125 bounce_contended_read,
126 nr_bounce_types,
127
128 bounce_acquired = bounce_acquired_write,
129 bounce_contended = bounce_contended_write,
130};
131
f20786ff 132struct lock_class_stats {
68722101
GB
133 unsigned long contention_point[LOCKSTAT_POINTS];
134 unsigned long contending_point[LOCKSTAT_POINTS];
f20786ff
PZ
135 struct lock_time read_waittime;
136 struct lock_time write_waittime;
137 struct lock_time read_holdtime;
138 struct lock_time write_holdtime;
96645678 139 unsigned long bounces[nr_bounce_types];
f20786ff
PZ
140};
141
142struct lock_class_stats lock_stats(struct lock_class *class);
143void clear_lock_stats(struct lock_class *class);
144#endif
145
fbb9ce95
IM
146/*
147 * Map the lock object (the lock instance) to the lock-class object.
148 * This is embedded into specific lock instances:
149 */
150struct lockdep_map {
151 struct lock_class_key *key;
62016250 152 struct lock_class *class_cache[NR_LOCKDEP_CACHING_CLASSES];
fbb9ce95 153 const char *name;
96645678
PZ
154#ifdef CONFIG_LOCK_STAT
155 int cpu;
c7e78cff 156 unsigned long ip;
96645678 157#endif
fbb9ce95
IM
158};
159
4d82a1de
PZ
160static inline void lockdep_copy_map(struct lockdep_map *to,
161 struct lockdep_map *from)
162{
163 int i;
164
165 *to = *from;
166 /*
167 * Since the class cache can be modified concurrently we could observe
168 * half pointers (64bit arch using 32bit copy insns). Therefore clear
169 * the caches and take the performance hit.
170 *
171 * XXX it doesn't work well with lockdep_set_class_and_subclass(), since
172 * that relies on cache abuse.
173 */
174 for (i = 0; i < NR_LOCKDEP_CACHING_CLASSES; i++)
175 to->class_cache[i] = NULL;
176}
177
fbb9ce95
IM
178/*
179 * Every lock has a list of other locks that were taken after it.
180 * We only grow the list, never remove from it:
181 */
182struct lock_list {
183 struct list_head entry;
184 struct lock_class *class;
185 struct stack_trace trace;
068135e6 186 int distance;
c94aa5ca 187
af012961
PZ
188 /*
189 * The parent field is used to implement breadth-first search, and the
190 * bit 0 is reused to indicate if the lock has been accessed in BFS.
c94aa5ca
ML
191 */
192 struct lock_list *parent;
fbb9ce95
IM
193};
194
195/*
196 * We record lock dependency chains, so that we can cache them:
197 */
198struct lock_chain {
75dd602a
PZ
199 /* see BUILD_BUG_ON()s in lookup_chain_cache() */
200 unsigned int irq_context : 2,
201 depth : 6,
202 base : 24;
203 /* 4 byte hole */
a63f38cc 204 struct hlist_node entry;
fbb9ce95
IM
205 u64 chain_key;
206};
207
e5f363e3 208#define MAX_LOCKDEP_KEYS_BITS 13
b42e737e
PZ
209/*
210 * Subtract one because we offset hlock->class_idx by 1 in order
211 * to make 0 mean no class. This avoids overflowing the class_idx
212 * bitfield and hitting the BUG in hlock_class().
213 */
214#define MAX_LOCKDEP_KEYS ((1UL << MAX_LOCKDEP_KEYS_BITS) - 1)
f82b217e 215
fbb9ce95
IM
216struct held_lock {
217 /*
218 * One-way hash of the dependency chain up to this point. We
219 * hash the hashes step by step as the dependency chain grows.
220 *
221 * We use it for dependency-caching and we skip detection
222 * passes and dependency-updates if there is a cache-hit, so
223 * it is absolutely critical for 100% coverage of the validator
224 * to have a unique key value for every unique dependency path
225 * that can occur in the system, to make a unique hash value
226 * as likely as possible - hence the 64-bit width.
227 *
228 * The task struct holds the current hash value (initialized
229 * with zero), here we store the previous hash value:
230 */
231 u64 prev_chain_key;
fbb9ce95
IM
232 unsigned long acquire_ip;
233 struct lockdep_map *instance;
7531e2f3 234 struct lockdep_map *nest_lock;
f20786ff
PZ
235#ifdef CONFIG_LOCK_STAT
236 u64 waittime_stamp;
237 u64 holdtime_stamp;
238#endif
f82b217e 239 unsigned int class_idx:MAX_LOCKDEP_KEYS_BITS;
fbb9ce95
IM
240 /*
241 * The lock-stack is unified in that the lock chains of interrupt
242 * contexts nest ontop of process context chains, but we 'separate'
243 * the hashes by starting with 0 if we cross into an interrupt
244 * context, and we also keep do not add cross-context lock
245 * dependencies - the lock usage graph walking covers that area
246 * anyway, and we'd just unnecessarily increase the number of
247 * dependencies otherwise. [Note: hardirq and softirq contexts
248 * are separated from each other too.]
249 *
250 * The following field is used to detect when we cross into an
251 * interrupt context:
252 */
f82b217e 253 unsigned int irq_context:2; /* bit 0 - soft, bit 1 - hard */
bb97a91e
PZ
254 unsigned int trylock:1; /* 16 bits */
255
f82b217e 256 unsigned int read:2; /* see lock_acquire() comment */
fb9edbe9 257 unsigned int check:1; /* see lock_acquire() comment */
f82b217e 258 unsigned int hardirqs_off:1;
fb9edbe9 259 unsigned int references:12; /* 32 bits */
a24fc60d 260 unsigned int pin_count;
fbb9ce95
IM
261};
262
263/*
264 * Initialization, self-test and debugging-output methods:
265 */
fbb9ce95
IM
266extern void lockdep_info(void);
267extern void lockdep_reset(void);
268extern void lockdep_reset_lock(struct lockdep_map *lock);
269extern void lockdep_free_key_range(void *start, unsigned long size);
63f9a7fd 270extern asmlinkage void lockdep_sys_exit(void);
fbb9ce95
IM
271
272extern void lockdep_off(void);
273extern void lockdep_on(void);
fbb9ce95
IM
274
275/*
276 * These methods are used by specific locking variants (spinlocks,
277 * rwlocks, mutexes and rwsems) to pass init/acquire/release events
278 * to lockdep:
279 */
280
281extern void lockdep_init_map(struct lockdep_map *lock, const char *name,
4dfbb9d8 282 struct lock_class_key *key, int subclass);
fbb9ce95 283
851a67b8
PZ
284/*
285 * To initialize a lockdep_map statically use this macro.
286 * Note that _name must not be NULL.
287 */
288#define STATIC_LOCKDEP_MAP_INIT(_name, _key) \
289 { .name = (_name), .key = (void *)(_key), }
290
fbb9ce95
IM
291/*
292 * Reinitialize a lock key - for cases where there is special locking or
293 * special initialization of locks so that the validator gets the scope
294 * of dependencies wrong: they are either too broad (they need a class-split)
295 * or they are too narrow (they suffer from a false class-split):
296 */
297#define lockdep_set_class(lock, key) \
4dfbb9d8 298 lockdep_init_map(&(lock)->dep_map, #key, key, 0)
fbb9ce95 299#define lockdep_set_class_and_name(lock, key, name) \
4dfbb9d8
PZ
300 lockdep_init_map(&(lock)->dep_map, name, key, 0)
301#define lockdep_set_class_and_subclass(lock, key, sub) \
302 lockdep_init_map(&(lock)->dep_map, #key, key, sub)
303#define lockdep_set_subclass(lock, sub) \
304 lockdep_init_map(&(lock)->dep_map, #lock, \
305 (lock)->dep_map.key, sub)
1704f47b
PZ
306
307#define lockdep_set_novalidate_class(lock) \
47be1c1a 308 lockdep_set_class_and_name(lock, &__lockdep_no_validate__, #lock)
9a7aa12f
JK
309/*
310 * Compare locking classes
311 */
312#define lockdep_match_class(lock, key) lockdep_match_key(&(lock)->dep_map, key)
313
314static inline int lockdep_match_key(struct lockdep_map *lock,
315 struct lock_class_key *key)
316{
317 return lock->key == key;
318}
fbb9ce95
IM
319
320/*
321 * Acquire a lock.
322 *
323 * Values for "read":
324 *
325 * 0: exclusive (write) acquire
326 * 1: read-acquire (no recursion allowed)
327 * 2: read-acquire with same-instance recursion allowed
328 *
329 * Values for check:
330 *
fb9edbe9
ON
331 * 0: simple checks (freeing, held-at-exit-time, etc.)
332 * 1: full validation
fbb9ce95
IM
333 */
334extern void lock_acquire(struct lockdep_map *lock, unsigned int subclass,
7531e2f3
PZ
335 int trylock, int read, int check,
336 struct lockdep_map *nest_lock, unsigned long ip);
fbb9ce95
IM
337
338extern void lock_release(struct lockdep_map *lock, int nested,
339 unsigned long ip);
340
f8319483
PZ
341/*
342 * Same "read" as for lock_acquire(), except -1 means any.
343 */
344extern int lock_is_held_type(struct lockdep_map *lock, int read);
345
346static inline int lock_is_held(struct lockdep_map *lock)
347{
348 return lock_is_held_type(lock, -1);
349}
f607c668 350
f8319483
PZ
351#define lockdep_is_held(lock) lock_is_held(&(lock)->dep_map)
352#define lockdep_is_held_type(lock, r) lock_is_held_type(&(lock)->dep_map, (r))
f607c668 353
00ef9f73
PZ
354extern void lock_set_class(struct lockdep_map *lock, const char *name,
355 struct lock_class_key *key, unsigned int subclass,
356 unsigned long ip);
357
358static inline void lock_set_subclass(struct lockdep_map *lock,
359 unsigned int subclass, unsigned long ip)
360{
361 lock_set_class(lock, lock->name, lock->key, subclass, ip);
362}
64aa348e 363
6419c4af
O
364extern void lock_downgrade(struct lockdep_map *lock, unsigned long ip);
365
cf40bd16
NP
366extern void lockdep_set_current_reclaim_state(gfp_t gfp_mask);
367extern void lockdep_clear_current_reclaim_state(void);
368extern void lockdep_trace_alloc(gfp_t mask);
369
e7904a28
PZ
370struct pin_cookie { unsigned int val; };
371
372#define NIL_COOKIE (struct pin_cookie){ .val = 0U, }
373
374extern struct pin_cookie lock_pin_lock(struct lockdep_map *lock);
375extern void lock_repin_lock(struct lockdep_map *lock, struct pin_cookie);
376extern void lock_unpin_lock(struct lockdep_map *lock, struct pin_cookie);
a24fc60d 377
cf40bd16 378# define INIT_LOCKDEP .lockdep_recursion = 0, .lockdep_reclaim_gfp = 0,
fbb9ce95 379
e3a55fd1 380#define lockdep_depth(tsk) (debug_locks ? (tsk)->lockdep_depth : 0)
d5abe669 381
b1ae345d
JB
382#define lockdep_assert_held(l) do { \
383 WARN_ON(debug_locks && !lockdep_is_held(l)); \
384 } while (0)
f607c668 385
f8319483
PZ
386#define lockdep_assert_held_exclusive(l) do { \
387 WARN_ON(debug_locks && !lockdep_is_held_type(l, 0)); \
388 } while (0)
389
390#define lockdep_assert_held_read(l) do { \
391 WARN_ON(debug_locks && !lockdep_is_held_type(l, 1)); \
392 } while (0)
393
9a37110d
PH
394#define lockdep_assert_held_once(l) do { \
395 WARN_ON_ONCE(debug_locks && !lockdep_is_held(l)); \
396 } while (0)
397
94d24fc4
PZ
398#define lockdep_recursing(tsk) ((tsk)->lockdep_recursion)
399
e7904a28
PZ
400#define lockdep_pin_lock(l) lock_pin_lock(&(l)->dep_map)
401#define lockdep_repin_lock(l,c) lock_repin_lock(&(l)->dep_map, (c))
402#define lockdep_unpin_lock(l,c) lock_unpin_lock(&(l)->dep_map, (c))
a24fc60d 403
a51805ef 404#else /* !CONFIG_LOCKDEP */
fbb9ce95
IM
405
406static inline void lockdep_off(void)
407{
408}
409
410static inline void lockdep_on(void)
411{
412}
413
7531e2f3 414# define lock_acquire(l, s, t, r, c, n, i) do { } while (0)
fbb9ce95 415# define lock_release(l, n, i) do { } while (0)
6419c4af 416# define lock_downgrade(l, i) do { } while (0)
00ef9f73 417# define lock_set_class(l, n, k, s, i) do { } while (0)
64aa348e 418# define lock_set_subclass(l, s, i) do { } while (0)
cf40bd16
NP
419# define lockdep_set_current_reclaim_state(g) do { } while (0)
420# define lockdep_clear_current_reclaim_state() do { } while (0)
421# define lockdep_trace_alloc(g) do { } while (0)
fbb9ce95 422# define lockdep_info() do { } while (0)
e25cf3db
IM
423# define lockdep_init_map(lock, name, key, sub) \
424 do { (void)(name); (void)(key); } while (0)
fbb9ce95
IM
425# define lockdep_set_class(lock, key) do { (void)(key); } while (0)
426# define lockdep_set_class_and_name(lock, key, name) \
e25cf3db 427 do { (void)(key); (void)(name); } while (0)
4dfbb9d8
PZ
428#define lockdep_set_class_and_subclass(lock, key, sub) \
429 do { (void)(key); } while (0)
07646e21 430#define lockdep_set_subclass(lock, sub) do { } while (0)
1704f47b
PZ
431
432#define lockdep_set_novalidate_class(lock) do { } while (0)
433
9a7aa12f
JK
434/*
435 * We don't define lockdep_match_class() and lockdep_match_key() for !LOCKDEP
436 * case since the result is not well defined and the caller should rather
437 * #ifdef the call himself.
438 */
07646e21 439
fbb9ce95
IM
440# define INIT_LOCKDEP
441# define lockdep_reset() do { debug_locks = 1; } while (0)
442# define lockdep_free_key_range(start, size) do { } while (0)
b351d164 443# define lockdep_sys_exit() do { } while (0)
fbb9ce95
IM
444/*
445 * The class key takes no space if lockdep is disabled:
446 */
447struct lock_class_key { };
d5abe669
PZ
448
449#define lockdep_depth(tsk) (0)
450
f8319483
PZ
451#define lockdep_is_held_type(l, r) (1)
452
5cd3f5af 453#define lockdep_assert_held(l) do { (void)(l); } while (0)
f8319483
PZ
454#define lockdep_assert_held_exclusive(l) do { (void)(l); } while (0)
455#define lockdep_assert_held_read(l) do { (void)(l); } while (0)
9a37110d 456#define lockdep_assert_held_once(l) do { (void)(l); } while (0)
f607c668 457
94d24fc4
PZ
458#define lockdep_recursing(tsk) (0)
459
e7904a28
PZ
460struct pin_cookie { };
461
462#define NIL_COOKIE (struct pin_cookie){ }
463
464#define lockdep_pin_lock(l) ({ struct pin_cookie cookie; cookie; })
465#define lockdep_repin_lock(l, c) do { (void)(l); (void)(c); } while (0)
466#define lockdep_unpin_lock(l, c) do { (void)(l); (void)(c); } while (0)
a24fc60d 467
fbb9ce95
IM
468#endif /* !LOCKDEP */
469
f20786ff
PZ
470#ifdef CONFIG_LOCK_STAT
471
472extern void lock_contended(struct lockdep_map *lock, unsigned long ip);
c7e78cff 473extern void lock_acquired(struct lockdep_map *lock, unsigned long ip);
f20786ff
PZ
474
475#define LOCK_CONTENDED(_lock, try, lock) \
476do { \
477 if (!try(_lock)) { \
478 lock_contended(&(_lock)->dep_map, _RET_IP_); \
479 lock(_lock); \
f20786ff 480 } \
c7e78cff 481 lock_acquired(&(_lock)->dep_map, _RET_IP_); \
f20786ff
PZ
482} while (0)
483
916633a4
MH
484#define LOCK_CONTENDED_RETURN(_lock, try, lock) \
485({ \
486 int ____err = 0; \
487 if (!try(_lock)) { \
488 lock_contended(&(_lock)->dep_map, _RET_IP_); \
489 ____err = lock(_lock); \
490 } \
491 if (!____err) \
492 lock_acquired(&(_lock)->dep_map, _RET_IP_); \
493 ____err; \
494})
495
f20786ff
PZ
496#else /* CONFIG_LOCK_STAT */
497
498#define lock_contended(lockdep_map, ip) do {} while (0)
c7e78cff 499#define lock_acquired(lockdep_map, ip) do {} while (0)
f20786ff
PZ
500
501#define LOCK_CONTENDED(_lock, try, lock) \
502 lock(_lock)
503
916633a4
MH
504#define LOCK_CONTENDED_RETURN(_lock, try, lock) \
505 lock(_lock)
506
f20786ff
PZ
507#endif /* CONFIG_LOCK_STAT */
508
e8c158bb
RH
509#ifdef CONFIG_LOCKDEP
510
511/*
512 * On lockdep we dont want the hand-coded irq-enable of
513 * _raw_*_lock_flags() code, because lockdep assumes
514 * that interrupts are not re-enabled during lock-acquire:
515 */
516#define LOCK_CONTENDED_FLAGS(_lock, try, lock, lockfl, flags) \
517 LOCK_CONTENDED((_lock), (try), (lock))
518
519#else /* CONFIG_LOCKDEP */
520
521#define LOCK_CONTENDED_FLAGS(_lock, try, lock, lockfl, flags) \
522 lockfl((_lock), (flags))
523
524#endif /* CONFIG_LOCKDEP */
525
fbb9ce95 526#ifdef CONFIG_TRACE_IRQFLAGS
3117df04 527extern void print_irqtrace_events(struct task_struct *curr);
fbb9ce95 528#else
3117df04
IM
529static inline void print_irqtrace_events(struct task_struct *curr)
530{
531}
fbb9ce95
IM
532#endif
533
534/*
535 * For trivial one-depth nesting of a lock-class, the following
536 * global define can be used. (Subsystems with multiple levels
537 * of nesting should define their own lock-nesting subclasses.)
538 */
539#define SINGLE_DEPTH_NESTING 1
540
541/*
542 * Map the dependency ops to NOP or to real lockdep ops, depending
543 * on the per lock-class debug mode:
544 */
545
fb9edbe9
ON
546#define lock_acquire_exclusive(l, s, t, n, i) lock_acquire(l, s, t, 0, 1, n, i)
547#define lock_acquire_shared(l, s, t, n, i) lock_acquire(l, s, t, 1, 1, n, i)
548#define lock_acquire_shared_recursive(l, s, t, n, i) lock_acquire(l, s, t, 2, 1, n, i)
fbb9ce95 549
a51805ef
ML
550#define spin_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
551#define spin_acquire_nest(l, s, t, n, i) lock_acquire_exclusive(l, s, t, n, i)
552#define spin_release(l, n, i) lock_release(l, n, i)
fbb9ce95 553
a51805ef
ML
554#define rwlock_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
555#define rwlock_acquire_read(l, s, t, i) lock_acquire_shared_recursive(l, s, t, NULL, i)
556#define rwlock_release(l, n, i) lock_release(l, n, i)
fbb9ce95 557
1ca7d67c
JS
558#define seqcount_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
559#define seqcount_acquire_read(l, s, t, i) lock_acquire_shared_recursive(l, s, t, NULL, i)
560#define seqcount_release(l, n, i) lock_release(l, n, i)
561
a51805ef
ML
562#define mutex_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
563#define mutex_acquire_nest(l, s, t, n, i) lock_acquire_exclusive(l, s, t, n, i)
564#define mutex_release(l, n, i) lock_release(l, n, i)
565
566#define rwsem_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
567#define rwsem_acquire_nest(l, s, t, n, i) lock_acquire_exclusive(l, s, t, n, i)
568#define rwsem_acquire_read(l, s, t, i) lock_acquire_shared(l, s, t, NULL, i)
1ca7d67c 569#define rwsem_release(l, n, i) lock_release(l, n, i)
fbb9ce95 570
a51805ef
ML
571#define lock_map_acquire(l) lock_acquire_exclusive(l, 0, 0, NULL, _THIS_IP_)
572#define lock_map_acquire_read(l) lock_acquire_shared_recursive(l, 0, 0, NULL, _THIS_IP_)
dd56af42 573#define lock_map_acquire_tryread(l) lock_acquire_shared_recursive(l, 0, 1, NULL, _THIS_IP_)
1ca7d67c 574#define lock_map_release(l) lock_release(l, 1, _THIS_IP_)
4f3e7524 575
76b189e9
PZ
576#ifdef CONFIG_PROVE_LOCKING
577# define might_lock(lock) \
578do { \
579 typecheck(struct lockdep_map *, &(lock)->dep_map); \
fb9edbe9 580 lock_acquire(&(lock)->dep_map, 0, 0, 0, 1, NULL, _THIS_IP_); \
76b189e9
PZ
581 lock_release(&(lock)->dep_map, 0, _THIS_IP_); \
582} while (0)
583# define might_lock_read(lock) \
584do { \
585 typecheck(struct lockdep_map *, &(lock)->dep_map); \
fb9edbe9 586 lock_acquire(&(lock)->dep_map, 0, 0, 1, 1, NULL, _THIS_IP_); \
76b189e9
PZ
587 lock_release(&(lock)->dep_map, 0, _THIS_IP_); \
588} while (0)
589#else
590# define might_lock(lock) do { } while (0)
591# define might_lock_read(lock) do { } while (0)
592#endif
593
d24209bb 594#ifdef CONFIG_LOCKDEP
b3fbab05 595void lockdep_rcu_suspicious(const char *file, const int line, const char *s);
d24209bb
PM
596#else
597static inline void
598lockdep_rcu_suspicious(const char *file, const int line, const char *s)
599{
600}
0632eb3d
PM
601#endif
602
fbb9ce95 603#endif /* __LINUX_LOCKDEP_H */