1 /* SPDX-License-Identifier: GPL-2.0 */
3 * Runtime locking correctness validator
5 * Copyright (C) 2006,2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
6 * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra
8 * see Documentation/locking/lockdep-design.rst for more details.
10 #ifndef __LINUX_LOCKDEP_H
11 #define __LINUX_LOCKDEP_H
13 #include <linux/lockdep_types.h>
14 #include <linux/smp.h>
15 #include <asm/percpu.h>
20 extern int prove_locking
;
25 #include <linux/linkage.h>
26 #include <linux/list.h>
27 #include <linux/debug_locks.h>
28 #include <linux/stacktrace.h>
30 static inline void lockdep_copy_map(struct lockdep_map
*to
,
31 struct lockdep_map
*from
)
37 * Since the class cache can be modified concurrently we could observe
38 * half pointers (64bit arch using 32bit copy insns). Therefore clear
39 * the caches and take the performance hit.
41 * XXX it doesn't work well with lockdep_set_class_and_subclass(), since
42 * that relies on cache abuse.
44 for (i
= 0; i
< NR_LOCKDEP_CACHING_CLASSES
; i
++)
45 to
->class_cache
[i
] = NULL
;
49 * Every lock has a list of other locks that were taken after it.
50 * We only grow the list, never remove from it:
53 struct list_head entry
;
54 struct lock_class
*class;
55 struct lock_class
*links_to
;
56 const struct lock_trace
*trace
;
58 /* bitmap of different dependencies from head to this */
60 /* used by BFS to record whether "prev -> this" only has -(*R)-> */
64 * The parent field is used to implement breadth-first search, and the
65 * bit 0 is reused to indicate if the lock has been accessed in BFS.
67 struct lock_list
*parent
;
71 * struct lock_chain - lock dependency chain record
73 * @irq_context: the same as irq_context in held_lock below
74 * @depth: the number of held locks in this chain
75 * @base: the index in chain_hlocks for this chain
76 * @entry: the collided lock chains in lock_chain hash list
77 * @chain_key: the hash key of this lock_chain
80 /* see BUILD_BUG_ON()s in add_chain_cache() */
81 unsigned int irq_context
: 2,
85 struct hlist_node entry
;
89 #define MAX_LOCKDEP_KEYS_BITS 13
90 #define MAX_LOCKDEP_KEYS (1UL << MAX_LOCKDEP_KEYS_BITS)
91 #define INITIAL_CHAIN_KEY -1
95 * One-way hash of the dependency chain up to this point. We
96 * hash the hashes step by step as the dependency chain grows.
98 * We use it for dependency-caching and we skip detection
99 * passes and dependency-updates if there is a cache-hit, so
100 * it is absolutely critical for 100% coverage of the validator
101 * to have a unique key value for every unique dependency path
102 * that can occur in the system, to make a unique hash value
103 * as likely as possible - hence the 64-bit width.
105 * The task struct holds the current hash value (initialized
106 * with zero), here we store the previous hash value:
109 unsigned long acquire_ip
;
110 struct lockdep_map
*instance
;
111 struct lockdep_map
*nest_lock
;
112 #ifdef CONFIG_LOCK_STAT
117 * class_idx is zero-indexed; it points to the element in
118 * lock_classes this held lock instance belongs to. class_idx is in
119 * the range from 0 to (MAX_LOCKDEP_KEYS-1) inclusive.
121 unsigned int class_idx
:MAX_LOCKDEP_KEYS_BITS
;
123 * The lock-stack is unified in that the lock chains of interrupt
124 * contexts nest ontop of process context chains, but we 'separate'
125 * the hashes by starting with 0 if we cross into an interrupt
126 * context, and we also keep do not add cross-context lock
127 * dependencies - the lock usage graph walking covers that area
128 * anyway, and we'd just unnecessarily increase the number of
129 * dependencies otherwise. [Note: hardirq and softirq contexts
130 * are separated from each other too.]
132 * The following field is used to detect when we cross into an
135 unsigned int irq_context
:2; /* bit 0 - soft, bit 1 - hard */
136 unsigned int trylock
:1; /* 16 bits */
138 unsigned int read
:2; /* see lock_acquire() comment */
139 unsigned int check
:1; /* see lock_acquire() comment */
140 unsigned int hardirqs_off
:1;
141 unsigned int references
:12; /* 32 bits */
142 unsigned int pin_count
;
146 * Initialization, self-test and debugging-output methods:
148 extern void lockdep_init(void);
149 extern void lockdep_reset(void);
150 extern void lockdep_reset_lock(struct lockdep_map
*lock
);
151 extern void lockdep_free_key_range(void *start
, unsigned long size
);
152 extern asmlinkage
void lockdep_sys_exit(void);
153 extern void lockdep_set_selftest_task(struct task_struct
*task
);
155 extern void lockdep_init_task(struct task_struct
*task
);
158 * Split the recursion counter in two to readily detect 'off' vs recursion.
160 #define LOCKDEP_RECURSION_BITS 16
161 #define LOCKDEP_OFF (1U << LOCKDEP_RECURSION_BITS)
162 #define LOCKDEP_RECURSION_MASK (LOCKDEP_OFF - 1)
165 * lockdep_{off,on}() are macros to avoid tracing and kprobes; not inlines due
166 * to header dependencies.
169 #define lockdep_off() \
171 current->lockdep_recursion += LOCKDEP_OFF; \
174 #define lockdep_on() \
176 current->lockdep_recursion -= LOCKDEP_OFF; \
179 extern void lockdep_register_key(struct lock_class_key
*key
);
180 extern void lockdep_unregister_key(struct lock_class_key
*key
);
183 * These methods are used by specific locking variants (spinlocks,
184 * rwlocks, mutexes and rwsems) to pass init/acquire/release events
188 extern void lockdep_init_map_type(struct lockdep_map
*lock
, const char *name
,
189 struct lock_class_key
*key
, int subclass
, u8 inner
, u8 outer
, u8 lock_type
);
192 lockdep_init_map_waits(struct lockdep_map
*lock
, const char *name
,
193 struct lock_class_key
*key
, int subclass
, u8 inner
, u8 outer
)
195 lockdep_init_map_type(lock
, name
, key
, subclass
, inner
, LD_WAIT_INV
, LD_LOCK_NORMAL
);
199 lockdep_init_map_wait(struct lockdep_map
*lock
, const char *name
,
200 struct lock_class_key
*key
, int subclass
, u8 inner
)
202 lockdep_init_map_waits(lock
, name
, key
, subclass
, inner
, LD_WAIT_INV
);
205 static inline void lockdep_init_map(struct lockdep_map
*lock
, const char *name
,
206 struct lock_class_key
*key
, int subclass
)
208 lockdep_init_map_wait(lock
, name
, key
, subclass
, LD_WAIT_INV
);
212 * Reinitialize a lock key - for cases where there is special locking or
213 * special initialization of locks so that the validator gets the scope
214 * of dependencies wrong: they are either too broad (they need a class-split)
215 * or they are too narrow (they suffer from a false class-split):
217 #define lockdep_set_class(lock, key) \
218 lockdep_init_map_waits(&(lock)->dep_map, #key, key, 0, \
219 (lock)->dep_map.wait_type_inner, \
220 (lock)->dep_map.wait_type_outer)
222 #define lockdep_set_class_and_name(lock, key, name) \
223 lockdep_init_map_waits(&(lock)->dep_map, name, key, 0, \
224 (lock)->dep_map.wait_type_inner, \
225 (lock)->dep_map.wait_type_outer)
227 #define lockdep_set_class_and_subclass(lock, key, sub) \
228 lockdep_init_map_waits(&(lock)->dep_map, #key, key, sub,\
229 (lock)->dep_map.wait_type_inner, \
230 (lock)->dep_map.wait_type_outer)
232 #define lockdep_set_subclass(lock, sub) \
233 lockdep_init_map_waits(&(lock)->dep_map, #lock, (lock)->dep_map.key, sub,\
234 (lock)->dep_map.wait_type_inner, \
235 (lock)->dep_map.wait_type_outer)
237 #define lockdep_set_novalidate_class(lock) \
238 lockdep_set_class_and_name(lock, &__lockdep_no_validate__, #lock)
241 * Compare locking classes
243 #define lockdep_match_class(lock, key) lockdep_match_key(&(lock)->dep_map, key)
245 static inline int lockdep_match_key(struct lockdep_map
*lock
,
246 struct lock_class_key
*key
)
248 return lock
->key
== key
;
256 * 0: exclusive (write) acquire
257 * 1: read-acquire (no recursion allowed)
258 * 2: read-acquire with same-instance recursion allowed
262 * 0: simple checks (freeing, held-at-exit-time, etc.)
265 extern void lock_acquire(struct lockdep_map
*lock
, unsigned int subclass
,
266 int trylock
, int read
, int check
,
267 struct lockdep_map
*nest_lock
, unsigned long ip
);
269 extern void lock_release(struct lockdep_map
*lock
, unsigned long ip
);
271 /* lock_is_held_type() returns */
272 #define LOCK_STATE_UNKNOWN -1
273 #define LOCK_STATE_NOT_HELD 0
274 #define LOCK_STATE_HELD 1
277 * Same "read" as for lock_acquire(), except -1 means any.
279 extern int lock_is_held_type(const struct lockdep_map
*lock
, int read
);
281 static inline int lock_is_held(const struct lockdep_map
*lock
)
283 return lock_is_held_type(lock
, -1);
286 #define lockdep_is_held(lock) lock_is_held(&(lock)->dep_map)
287 #define lockdep_is_held_type(lock, r) lock_is_held_type(&(lock)->dep_map, (r))
289 extern void lock_set_class(struct lockdep_map
*lock
, const char *name
,
290 struct lock_class_key
*key
, unsigned int subclass
,
293 static inline void lock_set_subclass(struct lockdep_map
*lock
,
294 unsigned int subclass
, unsigned long ip
)
296 lock_set_class(lock
, lock
->name
, lock
->key
, subclass
, ip
);
299 extern void lock_downgrade(struct lockdep_map
*lock
, unsigned long ip
);
301 #define NIL_COOKIE (struct pin_cookie){ .val = 0U, }
303 extern struct pin_cookie
lock_pin_lock(struct lockdep_map
*lock
);
304 extern void lock_repin_lock(struct lockdep_map
*lock
, struct pin_cookie
);
305 extern void lock_unpin_lock(struct lockdep_map
*lock
, struct pin_cookie
);
307 #define lockdep_depth(tsk) (debug_locks ? (tsk)->lockdep_depth : 0)
309 #define lockdep_assert(cond) \
310 do { WARN_ON(debug_locks && !(cond)); } while (0)
312 #define lockdep_assert_once(cond) \
313 do { WARN_ON_ONCE(debug_locks && !(cond)); } while (0)
315 #define lockdep_assert_held(l) \
316 lockdep_assert(lockdep_is_held(l) != LOCK_STATE_NOT_HELD)
318 #define lockdep_assert_not_held(l) \
319 lockdep_assert(lockdep_is_held(l) != LOCK_STATE_HELD)
321 #define lockdep_assert_held_write(l) \
322 lockdep_assert(lockdep_is_held_type(l, 0))
324 #define lockdep_assert_held_read(l) \
325 lockdep_assert(lockdep_is_held_type(l, 1))
327 #define lockdep_assert_held_once(l) \
328 lockdep_assert_once(lockdep_is_held(l) != LOCK_STATE_NOT_HELD)
330 #define lockdep_assert_none_held_once() \
331 lockdep_assert_once(!current->lockdep_depth)
333 #define lockdep_recursing(tsk) ((tsk)->lockdep_recursion)
335 #define lockdep_pin_lock(l) lock_pin_lock(&(l)->dep_map)
336 #define lockdep_repin_lock(l,c) lock_repin_lock(&(l)->dep_map, (c))
337 #define lockdep_unpin_lock(l,c) lock_unpin_lock(&(l)->dep_map, (c))
339 #else /* !CONFIG_LOCKDEP */
341 static inline void lockdep_init_task(struct task_struct
*task
)
345 static inline void lockdep_off(void)
349 static inline void lockdep_on(void)
353 static inline void lockdep_set_selftest_task(struct task_struct
*task
)
357 # define lock_acquire(l, s, t, r, c, n, i) do { } while (0)
358 # define lock_release(l, i) do { } while (0)
359 # define lock_downgrade(l, i) do { } while (0)
360 # define lock_set_class(l, n, k, s, i) do { } while (0)
361 # define lock_set_subclass(l, s, i) do { } while (0)
362 # define lockdep_init() do { } while (0)
363 # define lockdep_init_map_type(lock, name, key, sub, inner, outer, type) \
364 do { (void)(name); (void)(key); } while (0)
365 # define lockdep_init_map_waits(lock, name, key, sub, inner, outer) \
366 do { (void)(name); (void)(key); } while (0)
367 # define lockdep_init_map_wait(lock, name, key, sub, inner) \
368 do { (void)(name); (void)(key); } while (0)
369 # define lockdep_init_map(lock, name, key, sub) \
370 do { (void)(name); (void)(key); } while (0)
371 # define lockdep_set_class(lock, key) do { (void)(key); } while (0)
372 # define lockdep_set_class_and_name(lock, key, name) \
373 do { (void)(key); (void)(name); } while (0)
374 #define lockdep_set_class_and_subclass(lock, key, sub) \
375 do { (void)(key); } while (0)
376 #define lockdep_set_subclass(lock, sub) do { } while (0)
378 #define lockdep_set_novalidate_class(lock) do { } while (0)
381 * We don't define lockdep_match_class() and lockdep_match_key() for !LOCKDEP
382 * case since the result is not well defined and the caller should rather
383 * #ifdef the call himself.
386 # define lockdep_reset() do { debug_locks = 1; } while (0)
387 # define lockdep_free_key_range(start, size) do { } while (0)
388 # define lockdep_sys_exit() do { } while (0)
390 static inline void lockdep_register_key(struct lock_class_key
*key
)
394 static inline void lockdep_unregister_key(struct lock_class_key
*key
)
398 #define lockdep_depth(tsk) (0)
401 * Dummy forward declarations, allow users to write less ifdef-y code
402 * and depend on dead code elimination.
404 extern int lock_is_held(const void *);
405 extern int lockdep_is_held(const void *);
406 #define lockdep_is_held_type(l, r) (1)
408 #define lockdep_assert(c) do { } while (0)
409 #define lockdep_assert_once(c) do { } while (0)
411 #define lockdep_assert_held(l) do { (void)(l); } while (0)
412 #define lockdep_assert_not_held(l) do { (void)(l); } while (0)
413 #define lockdep_assert_held_write(l) do { (void)(l); } while (0)
414 #define lockdep_assert_held_read(l) do { (void)(l); } while (0)
415 #define lockdep_assert_held_once(l) do { (void)(l); } while (0)
416 #define lockdep_assert_none_held_once() do { } while (0)
418 #define lockdep_recursing(tsk) (0)
420 #define NIL_COOKIE (struct pin_cookie){ }
422 #define lockdep_pin_lock(l) ({ struct pin_cookie cookie = { }; cookie; })
423 #define lockdep_repin_lock(l, c) do { (void)(l); (void)(c); } while (0)
424 #define lockdep_unpin_lock(l, c) do { (void)(l); (void)(c); } while (0)
426 #endif /* !LOCKDEP */
428 enum xhlock_context_t
{
434 #define lockdep_init_map_crosslock(m, n, k, s) do {} while (0)
436 * To initialize a lockdep_map statically use this macro.
437 * Note that _name must not be NULL.
439 #define STATIC_LOCKDEP_MAP_INIT(_name, _key) \
440 { .name = (_name), .key = (void *)(_key), }
442 static inline void lockdep_invariant_state(bool force
) {}
443 static inline void lockdep_free_task(struct task_struct
*task
) {}
445 #ifdef CONFIG_LOCK_STAT
447 extern void lock_contended(struct lockdep_map
*lock
, unsigned long ip
);
448 extern void lock_acquired(struct lockdep_map
*lock
, unsigned long ip
);
450 #define LOCK_CONTENDED(_lock, try, lock) \
453 lock_contended(&(_lock)->dep_map, _RET_IP_); \
456 lock_acquired(&(_lock)->dep_map, _RET_IP_); \
459 #define LOCK_CONTENDED_RETURN(_lock, try, lock) \
463 lock_contended(&(_lock)->dep_map, _RET_IP_); \
464 ____err = lock(_lock); \
467 lock_acquired(&(_lock)->dep_map, _RET_IP_); \
471 #else /* CONFIG_LOCK_STAT */
473 #define lock_contended(lockdep_map, ip) do {} while (0)
474 #define lock_acquired(lockdep_map, ip) do {} while (0)
476 #define LOCK_CONTENDED(_lock, try, lock) \
479 #define LOCK_CONTENDED_RETURN(_lock, try, lock) \
482 #endif /* CONFIG_LOCK_STAT */
484 #ifdef CONFIG_LOCKDEP
487 * On lockdep we dont want the hand-coded irq-enable of
488 * _raw_*_lock_flags() code, because lockdep assumes
489 * that interrupts are not re-enabled during lock-acquire:
491 #define LOCK_CONTENDED_FLAGS(_lock, try, lock, lockfl, flags) \
492 LOCK_CONTENDED((_lock), (try), (lock))
494 #else /* CONFIG_LOCKDEP */
496 #define LOCK_CONTENDED_FLAGS(_lock, try, lock, lockfl, flags) \
497 lockfl((_lock), (flags))
499 #endif /* CONFIG_LOCKDEP */
501 #ifdef CONFIG_PROVE_LOCKING
502 extern void print_irqtrace_events(struct task_struct
*curr
);
504 static inline void print_irqtrace_events(struct task_struct
*curr
)
509 /* Variable used to make lockdep treat read_lock() as recursive in selftests */
510 #ifdef CONFIG_DEBUG_LOCKING_API_SELFTESTS
511 extern unsigned int force_read_lock_recursive
;
512 #else /* CONFIG_DEBUG_LOCKING_API_SELFTESTS */
513 #define force_read_lock_recursive 0
514 #endif /* CONFIG_DEBUG_LOCKING_API_SELFTESTS */
516 #ifdef CONFIG_LOCKDEP
517 extern bool read_lock_is_recursive(void);
518 #else /* CONFIG_LOCKDEP */
519 /* If !LOCKDEP, the value is meaningless */
520 #define read_lock_is_recursive() 0
524 * For trivial one-depth nesting of a lock-class, the following
525 * global define can be used. (Subsystems with multiple levels
526 * of nesting should define their own lock-nesting subclasses.)
528 #define SINGLE_DEPTH_NESTING 1
531 * Map the dependency ops to NOP or to real lockdep ops, depending
532 * on the per lock-class debug mode:
535 #define lock_acquire_exclusive(l, s, t, n, i) lock_acquire(l, s, t, 0, 1, n, i)
536 #define lock_acquire_shared(l, s, t, n, i) lock_acquire(l, s, t, 1, 1, n, i)
537 #define lock_acquire_shared_recursive(l, s, t, n, i) lock_acquire(l, s, t, 2, 1, n, i)
539 #define spin_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
540 #define spin_acquire_nest(l, s, t, n, i) lock_acquire_exclusive(l, s, t, n, i)
541 #define spin_release(l, i) lock_release(l, i)
543 #define rwlock_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
544 #define rwlock_acquire_read(l, s, t, i) \
546 if (read_lock_is_recursive()) \
547 lock_acquire_shared_recursive(l, s, t, NULL, i); \
549 lock_acquire_shared(l, s, t, NULL, i); \
552 #define rwlock_release(l, i) lock_release(l, i)
554 #define seqcount_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
555 #define seqcount_acquire_read(l, s, t, i) lock_acquire_shared_recursive(l, s, t, NULL, i)
556 #define seqcount_release(l, i) lock_release(l, i)
558 #define mutex_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
559 #define mutex_acquire_nest(l, s, t, n, i) lock_acquire_exclusive(l, s, t, n, i)
560 #define mutex_release(l, i) lock_release(l, i)
562 #define rwsem_acquire(l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
563 #define rwsem_acquire_nest(l, s, t, n, i) lock_acquire_exclusive(l, s, t, n, i)
564 #define rwsem_acquire_read(l, s, t, i) lock_acquire_shared(l, s, t, NULL, i)
565 #define rwsem_release(l, i) lock_release(l, i)
567 #define lock_map_acquire(l) lock_acquire_exclusive(l, 0, 0, NULL, _THIS_IP_)
568 #define lock_map_acquire_read(l) lock_acquire_shared_recursive(l, 0, 0, NULL, _THIS_IP_)
569 #define lock_map_acquire_tryread(l) lock_acquire_shared_recursive(l, 0, 1, NULL, _THIS_IP_)
570 #define lock_map_release(l) lock_release(l, _THIS_IP_)
572 #ifdef CONFIG_PROVE_LOCKING
573 # define might_lock(lock) \
575 typecheck(struct lockdep_map *, &(lock)->dep_map); \
576 lock_acquire(&(lock)->dep_map, 0, 0, 0, 1, NULL, _THIS_IP_); \
577 lock_release(&(lock)->dep_map, _THIS_IP_); \
579 # define might_lock_read(lock) \
581 typecheck(struct lockdep_map *, &(lock)->dep_map); \
582 lock_acquire(&(lock)->dep_map, 0, 0, 1, 1, NULL, _THIS_IP_); \
583 lock_release(&(lock)->dep_map, _THIS_IP_); \
585 # define might_lock_nested(lock, subclass) \
587 typecheck(struct lockdep_map *, &(lock)->dep_map); \
588 lock_acquire(&(lock)->dep_map, subclass, 0, 1, 1, NULL, \
590 lock_release(&(lock)->dep_map, _THIS_IP_); \
593 DECLARE_PER_CPU(int, hardirqs_enabled
);
594 DECLARE_PER_CPU(int, hardirq_context
);
595 DECLARE_PER_CPU(unsigned int, lockdep_recursion
);
597 #define __lockdep_enabled (debug_locks && !this_cpu_read(lockdep_recursion))
599 #define lockdep_assert_irqs_enabled() \
601 WARN_ON_ONCE(__lockdep_enabled && !this_cpu_read(hardirqs_enabled)); \
604 #define lockdep_assert_irqs_disabled() \
606 WARN_ON_ONCE(__lockdep_enabled && this_cpu_read(hardirqs_enabled)); \
609 #define lockdep_assert_in_irq() \
611 WARN_ON_ONCE(__lockdep_enabled && !this_cpu_read(hardirq_context)); \
614 #define lockdep_assert_preemption_enabled() \
616 WARN_ON_ONCE(IS_ENABLED(CONFIG_PREEMPT_COUNT) && \
617 __lockdep_enabled && \
618 (preempt_count() != 0 || \
619 !this_cpu_read(hardirqs_enabled))); \
622 #define lockdep_assert_preemption_disabled() \
624 WARN_ON_ONCE(IS_ENABLED(CONFIG_PREEMPT_COUNT) && \
625 __lockdep_enabled && \
626 (preempt_count() == 0 && \
627 this_cpu_read(hardirqs_enabled))); \
631 * Acceptable for protecting per-CPU resources accessed from BH.
632 * Much like in_softirq() - semantics are ambiguous, use carefully.
634 #define lockdep_assert_in_softirq() \
636 WARN_ON_ONCE(__lockdep_enabled && \
637 (!in_softirq() || in_irq() || in_nmi())); \
641 # define might_lock(lock) do { } while (0)
642 # define might_lock_read(lock) do { } while (0)
643 # define might_lock_nested(lock, subclass) do { } while (0)
645 # define lockdep_assert_irqs_enabled() do { } while (0)
646 # define lockdep_assert_irqs_disabled() do { } while (0)
647 # define lockdep_assert_in_irq() do { } while (0)
649 # define lockdep_assert_preemption_enabled() do { } while (0)
650 # define lockdep_assert_preemption_disabled() do { } while (0)
651 # define lockdep_assert_in_softirq() do { } while (0)
654 #ifdef CONFIG_PROVE_RAW_LOCK_NESTING
656 # define lockdep_assert_RT_in_threaded_ctx() do { \
657 WARN_ONCE(debug_locks && !current->lockdep_recursion && \
658 lockdep_hardirq_context() && \
659 !(current->hardirq_threaded || current->irq_config), \
660 "Not in threaded context on PREEMPT_RT as expected\n"); \
665 # define lockdep_assert_RT_in_threaded_ctx() do { } while (0)
669 #ifdef CONFIG_LOCKDEP
670 void lockdep_rcu_suspicious(const char *file
, const int line
, const char *s
);
673 lockdep_rcu_suspicious(const char *file
, const int line
, const char *s
)
678 #endif /* __LINUX_LOCKDEP_H */