Commit | Line | Data |
---|---|---|
fbb9ce95 IM |
1 | /* |
2 | * Runtime locking correctness validator | |
3 | * | |
4b32d0a4 PZ |
4 | * Copyright (C) 2006,2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com> |
5 | * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com> | |
fbb9ce95 IM |
6 | * |
7 | * see Documentation/lockdep-design.txt for more details. | |
8 | */ | |
9 | #ifndef __LINUX_LOCKDEP_H | |
10 | #define __LINUX_LOCKDEP_H | |
11 | ||
a1e96b03 | 12 | struct task_struct; |
f20786ff | 13 | struct lockdep_map; |
a1e96b03 | 14 | |
2edf5e49 DY |
15 | /* for sysctl */ |
16 | extern int prove_locking; | |
17 | extern int lock_stat; | |
18 | ||
db0b0ead MT |
19 | #ifdef CONFIG_LOCKDEP |
20 | ||
fbb9ce95 IM |
21 | #include <linux/linkage.h> |
22 | #include <linux/list.h> | |
23 | #include <linux/debug_locks.h> | |
24 | #include <linux/stacktrace.h> | |
25 | ||
fbb9ce95 | 26 | /* |
9851673b PZ |
27 | * We'd rather not expose kernel/lockdep_states.h this wide, but we do need |
28 | * the total number of states... :-( | |
fbb9ce95 | 29 | */ |
9851673b | 30 | #define XXX_LOCK_USAGE_STATES (1+3*4) |
fbb9ce95 IM |
31 | |
32 | #define MAX_LOCKDEP_SUBCLASSES 8UL | |
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 | */ | |
50 | struct lockdep_subclass_key { | |
51 | char __one_byte; | |
52 | } __attribute__ ((__packed__)); | |
53 | ||
54 | struct lock_class_key { | |
55 | struct lockdep_subclass_key subkeys[MAX_LOCKDEP_SUBCLASSES]; | |
56 | }; | |
57 | ||
1704f47b PZ |
58 | extern 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 | */ | |
65 | struct lock_class { | |
66 | /* | |
67 | * class-hash: | |
68 | */ | |
69 | struct list_head hash_entry; | |
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 | |
114 | struct lock_time { | |
115 | s64 min; | |
116 | s64 max; | |
117 | s64 total; | |
118 | unsigned long nr; | |
fbb9ce95 IM |
119 | }; |
120 | ||
96645678 PZ |
121 | enum 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 PZ |
132 | struct lock_class_stats { |
133 | unsigned long contention_point[4]; | |
c7e78cff | 134 | unsigned long contending_point[4]; |
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 | ||
142 | struct lock_class_stats lock_stats(struct lock_class *class); | |
143 | void 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 | */ | |
150 | struct 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 |
6fa3eb70 S |
158 | //skip lockdep if we need it |
159 | int skip; | |
fbb9ce95 IM |
160 | }; |
161 | ||
4d82a1de PZ |
162 | static inline void lockdep_copy_map(struct lockdep_map *to, |
163 | struct lockdep_map *from) | |
164 | { | |
165 | int i; | |
166 | ||
167 | *to = *from; | |
168 | /* | |
169 | * Since the class cache can be modified concurrently we could observe | |
170 | * half pointers (64bit arch using 32bit copy insns). Therefore clear | |
171 | * the caches and take the performance hit. | |
172 | * | |
173 | * XXX it doesn't work well with lockdep_set_class_and_subclass(), since | |
174 | * that relies on cache abuse. | |
175 | */ | |
176 | for (i = 0; i < NR_LOCKDEP_CACHING_CLASSES; i++) | |
177 | to->class_cache[i] = NULL; | |
178 | } | |
179 | ||
fbb9ce95 IM |
180 | /* |
181 | * Every lock has a list of other locks that were taken after it. | |
182 | * We only grow the list, never remove from it: | |
183 | */ | |
184 | struct lock_list { | |
185 | struct list_head entry; | |
186 | struct lock_class *class; | |
187 | struct stack_trace trace; | |
068135e6 | 188 | int distance; |
c94aa5ca | 189 | |
af012961 PZ |
190 | /* |
191 | * The parent field is used to implement breadth-first search, and the | |
192 | * bit 0 is reused to indicate if the lock has been accessed in BFS. | |
c94aa5ca ML |
193 | */ |
194 | struct lock_list *parent; | |
fbb9ce95 IM |
195 | }; |
196 | ||
197 | /* | |
198 | * We record lock dependency chains, so that we can cache them: | |
199 | */ | |
200 | struct lock_chain { | |
443cd507 HY |
201 | u8 irq_context; |
202 | u8 depth; | |
203 | u16 base; | |
fbb9ce95 IM |
204 | struct list_head entry; |
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 |
216 | struct 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 DJ |
256 | unsigned int read:2; /* see lock_acquire() comment */ |
257 | unsigned int check:2; /* see lock_acquire() comment */ | |
258 | unsigned int hardirqs_off:1; | |
bb97a91e | 259 | unsigned int references:11; /* 32 bits */ |
fbb9ce95 IM |
260 | }; |
261 | ||
262 | /* | |
263 | * Initialization, self-test and debugging-output methods: | |
264 | */ | |
265 | extern void lockdep_init(void); | |
266 | extern void lockdep_info(void); | |
267 | extern void lockdep_reset(void); | |
268 | extern void lockdep_reset_lock(struct lockdep_map *lock); | |
269 | extern void lockdep_free_key_range(void *start, unsigned long size); | |
b351d164 | 270 | extern void lockdep_sys_exit(void); |
fbb9ce95 IM |
271 | |
272 | extern void lockdep_off(void); | |
273 | extern 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 | ||
281 | extern void lockdep_init_map(struct lockdep_map *lock, const char *name, | |
4dfbb9d8 | 282 | struct lock_class_key *key, int subclass); |
fbb9ce95 | 283 | |
6fa3eb70 S |
284 | static inline void lockdep_skip_validate(struct lockdep_map *lock) |
285 | { | |
286 | lock->skip = 1; | |
287 | } | |
851a67b8 PZ |
288 | /* |
289 | * To initialize a lockdep_map statically use this macro. | |
290 | * Note that _name must not be NULL. | |
291 | */ | |
292 | #define STATIC_LOCKDEP_MAP_INIT(_name, _key) \ | |
293 | { .name = (_name), .key = (void *)(_key), } | |
294 | ||
fbb9ce95 IM |
295 | /* |
296 | * Reinitialize a lock key - for cases where there is special locking or | |
297 | * special initialization of locks so that the validator gets the scope | |
298 | * of dependencies wrong: they are either too broad (they need a class-split) | |
299 | * or they are too narrow (they suffer from a false class-split): | |
300 | */ | |
301 | #define lockdep_set_class(lock, key) \ | |
4dfbb9d8 | 302 | lockdep_init_map(&(lock)->dep_map, #key, key, 0) |
fbb9ce95 | 303 | #define lockdep_set_class_and_name(lock, key, name) \ |
4dfbb9d8 PZ |
304 | lockdep_init_map(&(lock)->dep_map, name, key, 0) |
305 | #define lockdep_set_class_and_subclass(lock, key, sub) \ | |
306 | lockdep_init_map(&(lock)->dep_map, #key, key, sub) | |
307 | #define lockdep_set_subclass(lock, sub) \ | |
308 | lockdep_init_map(&(lock)->dep_map, #lock, \ | |
309 | (lock)->dep_map.key, sub) | |
1704f47b PZ |
310 | |
311 | #define lockdep_set_novalidate_class(lock) \ | |
312 | lockdep_set_class(lock, &__lockdep_no_validate__) | |
9a7aa12f JK |
313 | /* |
314 | * Compare locking classes | |
315 | */ | |
316 | #define lockdep_match_class(lock, key) lockdep_match_key(&(lock)->dep_map, key) | |
317 | ||
318 | static inline int lockdep_match_key(struct lockdep_map *lock, | |
319 | struct lock_class_key *key) | |
320 | { | |
321 | return lock->key == key; | |
322 | } | |
fbb9ce95 IM |
323 | |
324 | /* | |
325 | * Acquire a lock. | |
326 | * | |
327 | * Values for "read": | |
328 | * | |
329 | * 0: exclusive (write) acquire | |
330 | * 1: read-acquire (no recursion allowed) | |
331 | * 2: read-acquire with same-instance recursion allowed | |
332 | * | |
333 | * Values for check: | |
334 | * | |
335 | * 0: disabled | |
336 | * 1: simple checks (freeing, held-at-exit-time, etc.) | |
337 | * 2: full validation | |
338 | */ | |
339 | extern void lock_acquire(struct lockdep_map *lock, unsigned int subclass, | |
7531e2f3 PZ |
340 | int trylock, int read, int check, |
341 | struct lockdep_map *nest_lock, unsigned long ip); | |
fbb9ce95 IM |
342 | |
343 | extern void lock_release(struct lockdep_map *lock, int nested, | |
344 | unsigned long ip); | |
345 | ||
f607c668 PZ |
346 | #define lockdep_is_held(lock) lock_is_held(&(lock)->dep_map) |
347 | ||
348 | extern int lock_is_held(struct lockdep_map *lock); | |
349 | ||
00ef9f73 PZ |
350 | extern void lock_set_class(struct lockdep_map *lock, const char *name, |
351 | struct lock_class_key *key, unsigned int subclass, | |
352 | unsigned long ip); | |
353 | ||
354 | static inline void lock_set_subclass(struct lockdep_map *lock, | |
355 | unsigned int subclass, unsigned long ip) | |
356 | { | |
357 | lock_set_class(lock, lock->name, lock->key, subclass, ip); | |
358 | } | |
64aa348e | 359 | |
cf40bd16 NP |
360 | extern void lockdep_set_current_reclaim_state(gfp_t gfp_mask); |
361 | extern void lockdep_clear_current_reclaim_state(void); | |
362 | extern void lockdep_trace_alloc(gfp_t mask); | |
363 | ||
364 | # define INIT_LOCKDEP .lockdep_recursion = 0, .lockdep_reclaim_gfp = 0, | |
fbb9ce95 | 365 | |
e3a55fd1 | 366 | #define lockdep_depth(tsk) (debug_locks ? (tsk)->lockdep_depth : 0) |
d5abe669 | 367 | |
b1ae345d JB |
368 | #define lockdep_assert_held(l) do { \ |
369 | WARN_ON(debug_locks && !lockdep_is_held(l)); \ | |
370 | } while (0) | |
f607c668 | 371 | |
94d24fc4 PZ |
372 | #define lockdep_recursing(tsk) ((tsk)->lockdep_recursion) |
373 | ||
fbb9ce95 IM |
374 | #else /* !LOCKDEP */ |
375 | ||
376 | static inline void lockdep_off(void) | |
377 | { | |
378 | } | |
379 | ||
380 | static inline void lockdep_on(void) | |
381 | { | |
382 | } | |
6fa3eb70 S |
383 | static inline void lockdep_skip_validate(struct lockdep_map *lock) |
384 | { | |
385 | } | |
fbb9ce95 | 386 | |
7531e2f3 | 387 | # define lock_acquire(l, s, t, r, c, n, i) do { } while (0) |
fbb9ce95 | 388 | # define lock_release(l, n, i) do { } while (0) |
00ef9f73 | 389 | # define lock_set_class(l, n, k, s, i) do { } while (0) |
64aa348e | 390 | # define lock_set_subclass(l, s, i) do { } while (0) |
cf40bd16 NP |
391 | # define lockdep_set_current_reclaim_state(g) do { } while (0) |
392 | # define lockdep_clear_current_reclaim_state() do { } while (0) | |
393 | # define lockdep_trace_alloc(g) do { } while (0) | |
fbb9ce95 IM |
394 | # define lockdep_init() do { } while (0) |
395 | # define lockdep_info() do { } while (0) | |
e25cf3db IM |
396 | # define lockdep_init_map(lock, name, key, sub) \ |
397 | do { (void)(name); (void)(key); } while (0) | |
fbb9ce95 IM |
398 | # define lockdep_set_class(lock, key) do { (void)(key); } while (0) |
399 | # define lockdep_set_class_and_name(lock, key, name) \ | |
e25cf3db | 400 | do { (void)(key); (void)(name); } while (0) |
4dfbb9d8 PZ |
401 | #define lockdep_set_class_and_subclass(lock, key, sub) \ |
402 | do { (void)(key); } while (0) | |
07646e21 | 403 | #define lockdep_set_subclass(lock, sub) do { } while (0) |
1704f47b PZ |
404 | |
405 | #define lockdep_set_novalidate_class(lock) do { } while (0) | |
406 | ||
9a7aa12f JK |
407 | /* |
408 | * We don't define lockdep_match_class() and lockdep_match_key() for !LOCKDEP | |
409 | * case since the result is not well defined and the caller should rather | |
410 | * #ifdef the call himself. | |
411 | */ | |
07646e21 | 412 | |
fbb9ce95 IM |
413 | # define INIT_LOCKDEP |
414 | # define lockdep_reset() do { debug_locks = 1; } while (0) | |
415 | # define lockdep_free_key_range(start, size) do { } while (0) | |
b351d164 | 416 | # define lockdep_sys_exit() do { } while (0) |
fbb9ce95 IM |
417 | /* |
418 | * The class key takes no space if lockdep is disabled: | |
419 | */ | |
420 | struct lock_class_key { }; | |
d5abe669 PZ |
421 | |
422 | #define lockdep_depth(tsk) (0) | |
423 | ||
5cd3f5af | 424 | #define lockdep_assert_held(l) do { (void)(l); } while (0) |
f607c668 | 425 | |
94d24fc4 PZ |
426 | #define lockdep_recursing(tsk) (0) |
427 | ||
fbb9ce95 IM |
428 | #endif /* !LOCKDEP */ |
429 | ||
f20786ff PZ |
430 | #ifdef CONFIG_LOCK_STAT |
431 | ||
432 | extern void lock_contended(struct lockdep_map *lock, unsigned long ip); | |
c7e78cff | 433 | extern void lock_acquired(struct lockdep_map *lock, unsigned long ip); |
f20786ff PZ |
434 | |
435 | #define LOCK_CONTENDED(_lock, try, lock) \ | |
436 | do { \ | |
437 | if (!try(_lock)) { \ | |
438 | lock_contended(&(_lock)->dep_map, _RET_IP_); \ | |
439 | lock(_lock); \ | |
f20786ff | 440 | } \ |
c7e78cff | 441 | lock_acquired(&(_lock)->dep_map, _RET_IP_); \ |
f20786ff PZ |
442 | } while (0) |
443 | ||
444 | #else /* CONFIG_LOCK_STAT */ | |
445 | ||
446 | #define lock_contended(lockdep_map, ip) do {} while (0) | |
c7e78cff | 447 | #define lock_acquired(lockdep_map, ip) do {} while (0) |
f20786ff PZ |
448 | |
449 | #define LOCK_CONTENDED(_lock, try, lock) \ | |
450 | lock(_lock) | |
451 | ||
452 | #endif /* CONFIG_LOCK_STAT */ | |
453 | ||
e8c158bb RH |
454 | #ifdef CONFIG_LOCKDEP |
455 | ||
456 | /* | |
457 | * On lockdep we dont want the hand-coded irq-enable of | |
458 | * _raw_*_lock_flags() code, because lockdep assumes | |
459 | * that interrupts are not re-enabled during lock-acquire: | |
460 | */ | |
461 | #define LOCK_CONTENDED_FLAGS(_lock, try, lock, lockfl, flags) \ | |
462 | LOCK_CONTENDED((_lock), (try), (lock)) | |
463 | ||
464 | #else /* CONFIG_LOCKDEP */ | |
465 | ||
466 | #define LOCK_CONTENDED_FLAGS(_lock, try, lock, lockfl, flags) \ | |
467 | lockfl((_lock), (flags)) | |
468 | ||
469 | #endif /* CONFIG_LOCKDEP */ | |
470 | ||
fbb9ce95 | 471 | #ifdef CONFIG_TRACE_IRQFLAGS |
3117df04 | 472 | extern void print_irqtrace_events(struct task_struct *curr); |
fbb9ce95 | 473 | #else |
3117df04 IM |
474 | static inline void print_irqtrace_events(struct task_struct *curr) |
475 | { | |
476 | } | |
fbb9ce95 IM |
477 | #endif |
478 | ||
479 | /* | |
480 | * For trivial one-depth nesting of a lock-class, the following | |
481 | * global define can be used. (Subsystems with multiple levels | |
482 | * of nesting should define their own lock-nesting subclasses.) | |
483 | */ | |
484 | #define SINGLE_DEPTH_NESTING 1 | |
485 | ||
486 | /* | |
487 | * Map the dependency ops to NOP or to real lockdep ops, depending | |
488 | * on the per lock-class debug mode: | |
489 | */ | |
490 | ||
491 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | |
492 | # ifdef CONFIG_PROVE_LOCKING | |
7531e2f3 | 493 | # define spin_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 2, NULL, i) |
b7d39aff | 494 | # define spin_acquire_nest(l, s, t, n, i) lock_acquire(l, s, t, 0, 2, n, i) |
fbb9ce95 | 495 | # else |
7531e2f3 | 496 | # define spin_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 1, NULL, i) |
b7d39aff | 497 | # define spin_acquire_nest(l, s, t, n, i) lock_acquire(l, s, t, 0, 1, NULL, i) |
fbb9ce95 IM |
498 | # endif |
499 | # define spin_release(l, n, i) lock_release(l, n, i) | |
500 | #else | |
501 | # define spin_acquire(l, s, t, i) do { } while (0) | |
502 | # define spin_release(l, n, i) do { } while (0) | |
503 | #endif | |
504 | ||
505 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | |
506 | # ifdef CONFIG_PROVE_LOCKING | |
7531e2f3 PZ |
507 | # define rwlock_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 2, NULL, i) |
508 | # define rwlock_acquire_read(l, s, t, i) lock_acquire(l, s, t, 2, 2, NULL, i) | |
fbb9ce95 | 509 | # else |
7531e2f3 PZ |
510 | # define rwlock_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 1, NULL, i) |
511 | # define rwlock_acquire_read(l, s, t, i) lock_acquire(l, s, t, 2, 1, NULL, i) | |
fbb9ce95 IM |
512 | # endif |
513 | # define rwlock_release(l, n, i) lock_release(l, n, i) | |
514 | #else | |
515 | # define rwlock_acquire(l, s, t, i) do { } while (0) | |
516 | # define rwlock_acquire_read(l, s, t, i) do { } while (0) | |
517 | # define rwlock_release(l, n, i) do { } while (0) | |
518 | #endif | |
519 | ||
520 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | |
521 | # ifdef CONFIG_PROVE_LOCKING | |
7531e2f3 | 522 | # define mutex_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 2, NULL, i) |
e4c70a66 | 523 | # define mutex_acquire_nest(l, s, t, n, i) lock_acquire(l, s, t, 0, 2, n, i) |
fbb9ce95 | 524 | # else |
7531e2f3 | 525 | # define mutex_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 1, NULL, i) |
e4c70a66 | 526 | # define mutex_acquire_nest(l, s, t, n, i) lock_acquire(l, s, t, 0, 1, n, i) |
fbb9ce95 IM |
527 | # endif |
528 | # define mutex_release(l, n, i) lock_release(l, n, i) | |
529 | #else | |
530 | # define mutex_acquire(l, s, t, i) do { } while (0) | |
e4c70a66 | 531 | # define mutex_acquire_nest(l, s, t, n, i) do { } while (0) |
fbb9ce95 IM |
532 | # define mutex_release(l, n, i) do { } while (0) |
533 | #endif | |
534 | ||
535 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | |
536 | # ifdef CONFIG_PROVE_LOCKING | |
7531e2f3 | 537 | # define rwsem_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 2, NULL, i) |
1b963c81 | 538 | # define rwsem_acquire_nest(l, s, t, n, i) lock_acquire(l, s, t, 0, 2, n, i) |
7531e2f3 | 539 | # define rwsem_acquire_read(l, s, t, i) lock_acquire(l, s, t, 1, 2, NULL, i) |
fbb9ce95 | 540 | # else |
7531e2f3 | 541 | # define rwsem_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 1, NULL, i) |
1b963c81 | 542 | # define rwsem_acquire_nest(l, s, t, n, i) lock_acquire(l, s, t, 0, 1, n, i) |
7531e2f3 | 543 | # define rwsem_acquire_read(l, s, t, i) lock_acquire(l, s, t, 1, 1, NULL, i) |
fbb9ce95 IM |
544 | # endif |
545 | # define rwsem_release(l, n, i) lock_release(l, n, i) | |
546 | #else | |
547 | # define rwsem_acquire(l, s, t, i) do { } while (0) | |
1b963c81 | 548 | # define rwsem_acquire_nest(l, s, t, n, i) do { } while (0) |
fbb9ce95 IM |
549 | # define rwsem_acquire_read(l, s, t, i) do { } while (0) |
550 | # define rwsem_release(l, n, i) do { } while (0) | |
551 | #endif | |
552 | ||
4f3e7524 PZ |
553 | #ifdef CONFIG_DEBUG_LOCK_ALLOC |
554 | # ifdef CONFIG_PROVE_LOCKING | |
3295f0ef | 555 | # define lock_map_acquire(l) lock_acquire(l, 0, 0, 0, 2, NULL, _THIS_IP_) |
e159489b | 556 | # define lock_map_acquire_read(l) lock_acquire(l, 0, 0, 2, 2, NULL, _THIS_IP_) |
4f3e7524 | 557 | # else |
3295f0ef | 558 | # define lock_map_acquire(l) lock_acquire(l, 0, 0, 0, 1, NULL, _THIS_IP_) |
e159489b | 559 | # define lock_map_acquire_read(l) lock_acquire(l, 0, 0, 2, 1, NULL, _THIS_IP_) |
4f3e7524 | 560 | # endif |
3295f0ef | 561 | # define lock_map_release(l) lock_release(l, 1, _THIS_IP_) |
4f3e7524 | 562 | #else |
3295f0ef | 563 | # define lock_map_acquire(l) do { } while (0) |
e159489b | 564 | # define lock_map_acquire_read(l) do { } while (0) |
3295f0ef | 565 | # define lock_map_release(l) do { } while (0) |
4f3e7524 PZ |
566 | #endif |
567 | ||
76b189e9 PZ |
568 | #ifdef CONFIG_PROVE_LOCKING |
569 | # define might_lock(lock) \ | |
570 | do { \ | |
571 | typecheck(struct lockdep_map *, &(lock)->dep_map); \ | |
572 | lock_acquire(&(lock)->dep_map, 0, 0, 0, 2, NULL, _THIS_IP_); \ | |
573 | lock_release(&(lock)->dep_map, 0, _THIS_IP_); \ | |
574 | } while (0) | |
575 | # define might_lock_read(lock) \ | |
576 | do { \ | |
577 | typecheck(struct lockdep_map *, &(lock)->dep_map); \ | |
578 | lock_acquire(&(lock)->dep_map, 0, 0, 1, 2, NULL, _THIS_IP_); \ | |
579 | lock_release(&(lock)->dep_map, 0, _THIS_IP_); \ | |
580 | } while (0) | |
581 | #else | |
582 | # define might_lock(lock) do { } while (0) | |
583 | # define might_lock_read(lock) do { } while (0) | |
584 | #endif | |
585 | ||
0632eb3d | 586 | #ifdef CONFIG_PROVE_RCU |
b3fbab05 | 587 | void lockdep_rcu_suspicious(const char *file, const int line, const char *s); |
0632eb3d PM |
588 | #endif |
589 | ||
fbb9ce95 | 590 | #endif /* __LINUX_LOCKDEP_H */ |