blob: f270ce1582ff938d4e4a4d0467a2ff58a127f0db [file] [log] [blame]
Ingo Molnarfbb9ce92006-07-03 00:24:50 -07001/*
2 * Runtime locking correctness validator
3 *
Peter Zijlstra4b32d0a2007-07-19 01:48:59 -07004 * Copyright (C) 2006,2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
5 * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com>
Ingo Molnarfbb9ce92006-07-03 00:24:50 -07006 *
7 * see Documentation/lockdep-design.txt for more details.
8 */
9#ifndef __LINUX_LOCKDEP_H
10#define __LINUX_LOCKDEP_H
11
Heiko Carstensa1e96b02007-02-12 00:52:20 -080012struct task_struct;
Peter Zijlstraf20786f2007-07-19 01:48:56 -070013struct lockdep_map;
Heiko Carstensa1e96b02007-02-12 00:52:20 -080014
Michael S. Tsirkindb0b0ea2006-09-29 01:59:28 -070015#ifdef CONFIG_LOCKDEP
16
Ingo Molnarfbb9ce92006-07-03 00:24:50 -070017#include <linux/linkage.h>
18#include <linux/list.h>
19#include <linux/debug_locks.h>
20#include <linux/stacktrace.h>
21
Ingo Molnarfbb9ce92006-07-03 00:24:50 -070022/*
23 * Lock-class usage-state bits:
24 */
25enum lock_usage_bit
26{
27 LOCK_USED = 0,
28 LOCK_USED_IN_HARDIRQ,
29 LOCK_USED_IN_SOFTIRQ,
30 LOCK_ENABLED_SOFTIRQS,
31 LOCK_ENABLED_HARDIRQS,
32 LOCK_USED_IN_HARDIRQ_READ,
33 LOCK_USED_IN_SOFTIRQ_READ,
34 LOCK_ENABLED_SOFTIRQS_READ,
35 LOCK_ENABLED_HARDIRQS_READ,
36 LOCK_USAGE_STATES
37};
38
39/*
40 * Usage-state bitmasks:
41 */
42#define LOCKF_USED (1 << LOCK_USED)
43#define LOCKF_USED_IN_HARDIRQ (1 << LOCK_USED_IN_HARDIRQ)
44#define LOCKF_USED_IN_SOFTIRQ (1 << LOCK_USED_IN_SOFTIRQ)
45#define LOCKF_ENABLED_HARDIRQS (1 << LOCK_ENABLED_HARDIRQS)
46#define LOCKF_ENABLED_SOFTIRQS (1 << LOCK_ENABLED_SOFTIRQS)
47
48#define LOCKF_ENABLED_IRQS (LOCKF_ENABLED_HARDIRQS | LOCKF_ENABLED_SOFTIRQS)
49#define LOCKF_USED_IN_IRQ (LOCKF_USED_IN_HARDIRQ | LOCKF_USED_IN_SOFTIRQ)
50
51#define LOCKF_USED_IN_HARDIRQ_READ (1 << LOCK_USED_IN_HARDIRQ_READ)
52#define LOCKF_USED_IN_SOFTIRQ_READ (1 << LOCK_USED_IN_SOFTIRQ_READ)
53#define LOCKF_ENABLED_HARDIRQS_READ (1 << LOCK_ENABLED_HARDIRQS_READ)
54#define LOCKF_ENABLED_SOFTIRQS_READ (1 << LOCK_ENABLED_SOFTIRQS_READ)
55
56#define LOCKF_ENABLED_IRQS_READ \
57 (LOCKF_ENABLED_HARDIRQS_READ | LOCKF_ENABLED_SOFTIRQS_READ)
58#define LOCKF_USED_IN_IRQ_READ \
59 (LOCKF_USED_IN_HARDIRQ_READ | LOCKF_USED_IN_SOFTIRQ_READ)
60
61#define MAX_LOCKDEP_SUBCLASSES 8UL
62
63/*
64 * Lock-classes are keyed via unique addresses, by embedding the
65 * lockclass-key into the kernel (or module) .data section. (For
66 * static locks we use the lock address itself as the key.)
67 */
68struct lockdep_subclass_key {
69 char __one_byte;
70} __attribute__ ((__packed__));
71
72struct lock_class_key {
73 struct lockdep_subclass_key subkeys[MAX_LOCKDEP_SUBCLASSES];
74};
75
76/*
77 * The lock-class itself:
78 */
79struct lock_class {
80 /*
81 * class-hash:
82 */
83 struct list_head hash_entry;
84
85 /*
86 * global list of all lock-classes:
87 */
88 struct list_head lock_entry;
89
90 struct lockdep_subclass_key *key;
91 unsigned int subclass;
David Miller419ca3f2008-07-29 21:45:03 -070092 unsigned int dep_gen_id;
Ingo Molnarfbb9ce92006-07-03 00:24:50 -070093
94 /*
95 * IRQ/softirq usage tracking bits:
96 */
97 unsigned long usage_mask;
98 struct stack_trace usage_traces[LOCK_USAGE_STATES];
99
100 /*
101 * These fields represent a directed graph of lock dependencies,
102 * to every node we attach a list of "forward" and a list of
103 * "backward" graph nodes.
104 */
105 struct list_head locks_after, locks_before;
106
107 /*
108 * Generation counter, when doing certain classes of graph walking,
109 * to ensure that we check one node only once:
110 */
111 unsigned int version;
112
113 /*
114 * Statistics counter:
115 */
116 unsigned long ops;
117
118 const char *name;
119 int name_version;
Peter Zijlstraf20786f2007-07-19 01:48:56 -0700120
121#ifdef CONFIG_LOCK_STAT
122 unsigned long contention_point[4];
123#endif
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700124};
125
Peter Zijlstraf20786f2007-07-19 01:48:56 -0700126#ifdef CONFIG_LOCK_STAT
127struct lock_time {
128 s64 min;
129 s64 max;
130 s64 total;
131 unsigned long nr;
132};
133
Peter Zijlstra96645672007-07-19 01:49:00 -0700134enum bounce_type {
135 bounce_acquired_write,
136 bounce_acquired_read,
137 bounce_contended_write,
138 bounce_contended_read,
139 nr_bounce_types,
140
141 bounce_acquired = bounce_acquired_write,
142 bounce_contended = bounce_contended_write,
143};
144
Peter Zijlstraf20786f2007-07-19 01:48:56 -0700145struct lock_class_stats {
146 unsigned long contention_point[4];
147 struct lock_time read_waittime;
148 struct lock_time write_waittime;
149 struct lock_time read_holdtime;
150 struct lock_time write_holdtime;
Peter Zijlstra96645672007-07-19 01:49:00 -0700151 unsigned long bounces[nr_bounce_types];
Peter Zijlstraf20786f2007-07-19 01:48:56 -0700152};
153
154struct lock_class_stats lock_stats(struct lock_class *class);
155void clear_lock_stats(struct lock_class *class);
156#endif
157
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700158/*
159 * Map the lock object (the lock instance) to the lock-class object.
160 * This is embedded into specific lock instances:
161 */
162struct lockdep_map {
163 struct lock_class_key *key;
Ingo Molnard6d897c2006-07-10 04:44:04 -0700164 struct lock_class *class_cache;
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700165 const char *name;
Peter Zijlstra96645672007-07-19 01:49:00 -0700166#ifdef CONFIG_LOCK_STAT
167 int cpu;
168#endif
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700169};
170
171/*
172 * Every lock has a list of other locks that were taken after it.
173 * We only grow the list, never remove from it:
174 */
175struct lock_list {
176 struct list_head entry;
177 struct lock_class *class;
178 struct stack_trace trace;
Jason Baron068135e2007-02-10 01:44:59 -0800179 int distance;
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700180};
181
182/*
183 * We record lock dependency chains, so that we can cache them:
184 */
185struct lock_chain {
Huang, Ying443cd502008-06-20 16:39:21 +0800186 u8 irq_context;
187 u8 depth;
188 u16 base;
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700189 struct list_head entry;
190 u64 chain_key;
191};
192
193struct held_lock {
194 /*
195 * One-way hash of the dependency chain up to this point. We
196 * hash the hashes step by step as the dependency chain grows.
197 *
198 * We use it for dependency-caching and we skip detection
199 * passes and dependency-updates if there is a cache-hit, so
200 * it is absolutely critical for 100% coverage of the validator
201 * to have a unique key value for every unique dependency path
202 * that can occur in the system, to make a unique hash value
203 * as likely as possible - hence the 64-bit width.
204 *
205 * The task struct holds the current hash value (initialized
206 * with zero), here we store the previous hash value:
207 */
208 u64 prev_chain_key;
209 struct lock_class *class;
210 unsigned long acquire_ip;
211 struct lockdep_map *instance;
212
Peter Zijlstraf20786f2007-07-19 01:48:56 -0700213#ifdef CONFIG_LOCK_STAT
214 u64 waittime_stamp;
215 u64 holdtime_stamp;
216#endif
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700217 /*
218 * The lock-stack is unified in that the lock chains of interrupt
219 * contexts nest ontop of process context chains, but we 'separate'
220 * the hashes by starting with 0 if we cross into an interrupt
221 * context, and we also keep do not add cross-context lock
222 * dependencies - the lock usage graph walking covers that area
223 * anyway, and we'd just unnecessarily increase the number of
224 * dependencies otherwise. [Note: hardirq and softirq contexts
225 * are separated from each other too.]
226 *
227 * The following field is used to detect when we cross into an
228 * interrupt context:
229 */
230 int irq_context;
231 int trylock;
232 int read;
233 int check;
234 int hardirqs_off;
235};
236
237/*
238 * Initialization, self-test and debugging-output methods:
239 */
240extern void lockdep_init(void);
241extern void lockdep_info(void);
242extern void lockdep_reset(void);
243extern void lockdep_reset_lock(struct lockdep_map *lock);
244extern void lockdep_free_key_range(void *start, unsigned long size);
Peter Zijlstrab351d162007-10-11 22:11:12 +0200245extern void lockdep_sys_exit(void);
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700246
247extern void lockdep_off(void);
248extern void lockdep_on(void);
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700249
250/*
251 * These methods are used by specific locking variants (spinlocks,
252 * rwlocks, mutexes and rwsems) to pass init/acquire/release events
253 * to lockdep:
254 */
255
256extern void lockdep_init_map(struct lockdep_map *lock, const char *name,
Peter Zijlstra4dfbb9d2006-10-11 01:45:14 -0400257 struct lock_class_key *key, int subclass);
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700258
259/*
Peter Zijlstra851a67b2007-10-11 22:11:12 +0200260 * To initialize a lockdep_map statically use this macro.
261 * Note that _name must not be NULL.
262 */
263#define STATIC_LOCKDEP_MAP_INIT(_name, _key) \
264 { .name = (_name), .key = (void *)(_key), }
265
266/*
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700267 * Reinitialize a lock key - for cases where there is special locking or
268 * special initialization of locks so that the validator gets the scope
269 * of dependencies wrong: they are either too broad (they need a class-split)
270 * or they are too narrow (they suffer from a false class-split):
271 */
272#define lockdep_set_class(lock, key) \
Peter Zijlstra4dfbb9d2006-10-11 01:45:14 -0400273 lockdep_init_map(&(lock)->dep_map, #key, key, 0)
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700274#define lockdep_set_class_and_name(lock, key, name) \
Peter Zijlstra4dfbb9d2006-10-11 01:45:14 -0400275 lockdep_init_map(&(lock)->dep_map, name, key, 0)
276#define lockdep_set_class_and_subclass(lock, key, sub) \
277 lockdep_init_map(&(lock)->dep_map, #key, key, sub)
278#define lockdep_set_subclass(lock, sub) \
279 lockdep_init_map(&(lock)->dep_map, #lock, \
280 (lock)->dep_map.key, sub)
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700281
282/*
283 * Acquire a lock.
284 *
285 * Values for "read":
286 *
287 * 0: exclusive (write) acquire
288 * 1: read-acquire (no recursion allowed)
289 * 2: read-acquire with same-instance recursion allowed
290 *
291 * Values for check:
292 *
293 * 0: disabled
294 * 1: simple checks (freeing, held-at-exit-time, etc.)
295 * 2: full validation
296 */
297extern void lock_acquire(struct lockdep_map *lock, unsigned int subclass,
298 int trylock, int read, int check, unsigned long ip);
299
300extern void lock_release(struct lockdep_map *lock, int nested,
301 unsigned long ip);
302
Peter Zijlstra64aa3482008-08-11 09:30:21 +0200303extern void lock_set_subclass(struct lockdep_map *lock, unsigned int subclass,
304 unsigned long ip);
305
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700306# define INIT_LOCKDEP .lockdep_recursion = 0,
307
Jarek Poplawskie3a55fd2007-03-22 00:11:26 -0800308#define lockdep_depth(tsk) (debug_locks ? (tsk)->lockdep_depth : 0)
Peter Zijlstrad5abe662006-12-06 20:37:26 -0800309
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700310#else /* !LOCKDEP */
311
312static inline void lockdep_off(void)
313{
314}
315
316static inline void lockdep_on(void)
317{
318}
319
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700320# define lock_acquire(l, s, t, r, c, i) do { } while (0)
321# define lock_release(l, n, i) do { } while (0)
Peter Zijlstra64aa3482008-08-11 09:30:21 +0200322# define lock_set_subclass(l, s, i) do { } while (0)
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700323# define lockdep_init() do { } while (0)
324# define lockdep_info() do { } while (0)
Peter Zijlstra4dfbb9d2006-10-11 01:45:14 -0400325# define lockdep_init_map(lock, name, key, sub) do { (void)(key); } while (0)
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700326# define lockdep_set_class(lock, key) do { (void)(key); } while (0)
327# define lockdep_set_class_and_name(lock, key, name) \
328 do { (void)(key); } while (0)
Peter Zijlstra4dfbb9d2006-10-11 01:45:14 -0400329#define lockdep_set_class_and_subclass(lock, key, sub) \
330 do { (void)(key); } while (0)
Andrew Morton07646e22006-10-11 23:45:23 -0400331#define lockdep_set_subclass(lock, sub) do { } while (0)
332
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700333# define INIT_LOCKDEP
334# define lockdep_reset() do { debug_locks = 1; } while (0)
335# define lockdep_free_key_range(start, size) do { } while (0)
Peter Zijlstrab351d162007-10-11 22:11:12 +0200336# define lockdep_sys_exit() do { } while (0)
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700337/*
338 * The class key takes no space if lockdep is disabled:
339 */
340struct lock_class_key { };
Peter Zijlstrad5abe662006-12-06 20:37:26 -0800341
342#define lockdep_depth(tsk) (0)
343
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700344#endif /* !LOCKDEP */
345
Peter Zijlstraf20786f2007-07-19 01:48:56 -0700346#ifdef CONFIG_LOCK_STAT
347
348extern void lock_contended(struct lockdep_map *lock, unsigned long ip);
349extern void lock_acquired(struct lockdep_map *lock);
350
351#define LOCK_CONTENDED(_lock, try, lock) \
352do { \
353 if (!try(_lock)) { \
354 lock_contended(&(_lock)->dep_map, _RET_IP_); \
355 lock(_lock); \
Peter Zijlstraf20786f2007-07-19 01:48:56 -0700356 } \
Peter Zijlstra96645672007-07-19 01:49:00 -0700357 lock_acquired(&(_lock)->dep_map); \
Peter Zijlstraf20786f2007-07-19 01:48:56 -0700358} while (0)
359
360#else /* CONFIG_LOCK_STAT */
361
362#define lock_contended(lockdep_map, ip) do {} while (0)
363#define lock_acquired(lockdep_map) do {} while (0)
364
365#define LOCK_CONTENDED(_lock, try, lock) \
366 lock(_lock)
367
368#endif /* CONFIG_LOCK_STAT */
369
Ingo Molnar243c7622006-07-03 00:25:06 -0700370#if defined(CONFIG_TRACE_IRQFLAGS) && defined(CONFIG_GENERIC_HARDIRQS)
371extern void early_init_irq_lock_class(void);
372#else
Ingo Molnar3117df02006-12-13 00:34:43 -0800373static inline void early_init_irq_lock_class(void)
374{
375}
Ingo Molnar243c7622006-07-03 00:25:06 -0700376#endif
377
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700378#ifdef CONFIG_TRACE_IRQFLAGS
379extern void early_boot_irqs_off(void);
380extern void early_boot_irqs_on(void);
Ingo Molnar3117df02006-12-13 00:34:43 -0800381extern void print_irqtrace_events(struct task_struct *curr);
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700382#else
Ingo Molnar3117df02006-12-13 00:34:43 -0800383static inline void early_boot_irqs_off(void)
384{
385}
386static inline void early_boot_irqs_on(void)
387{
388}
389static inline void print_irqtrace_events(struct task_struct *curr)
390{
391}
Ingo Molnarfbb9ce92006-07-03 00:24:50 -0700392#endif
393
394/*
395 * For trivial one-depth nesting of a lock-class, the following
396 * global define can be used. (Subsystems with multiple levels
397 * of nesting should define their own lock-nesting subclasses.)
398 */
399#define SINGLE_DEPTH_NESTING 1
400
401/*
402 * Map the dependency ops to NOP or to real lockdep ops, depending
403 * on the per lock-class debug mode:
404 */
405
406#ifdef CONFIG_DEBUG_LOCK_ALLOC
407# ifdef CONFIG_PROVE_LOCKING
408# define spin_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 2, i)
409# else
410# define spin_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 1, i)
411# endif
412# define spin_release(l, n, i) lock_release(l, n, i)
413#else
414# define spin_acquire(l, s, t, i) do { } while (0)
415# define spin_release(l, n, i) do { } while (0)
416#endif
417
418#ifdef CONFIG_DEBUG_LOCK_ALLOC
419# ifdef CONFIG_PROVE_LOCKING
420# define rwlock_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 2, i)
421# define rwlock_acquire_read(l, s, t, i) lock_acquire(l, s, t, 2, 2, i)
422# else
423# define rwlock_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 1, i)
424# define rwlock_acquire_read(l, s, t, i) lock_acquire(l, s, t, 2, 1, i)
425# endif
426# define rwlock_release(l, n, i) lock_release(l, n, i)
427#else
428# define rwlock_acquire(l, s, t, i) do { } while (0)
429# define rwlock_acquire_read(l, s, t, i) do { } while (0)
430# define rwlock_release(l, n, i) do { } while (0)
431#endif
432
433#ifdef CONFIG_DEBUG_LOCK_ALLOC
434# ifdef CONFIG_PROVE_LOCKING
435# define mutex_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 2, i)
436# else
437# define mutex_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 1, i)
438# endif
439# define mutex_release(l, n, i) lock_release(l, n, i)
440#else
441# define mutex_acquire(l, s, t, i) do { } while (0)
442# define mutex_release(l, n, i) do { } while (0)
443#endif
444
445#ifdef CONFIG_DEBUG_LOCK_ALLOC
446# ifdef CONFIG_PROVE_LOCKING
447# define rwsem_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 2, i)
448# define rwsem_acquire_read(l, s, t, i) lock_acquire(l, s, t, 1, 2, i)
449# else
450# define rwsem_acquire(l, s, t, i) lock_acquire(l, s, t, 0, 1, i)
451# define rwsem_acquire_read(l, s, t, i) lock_acquire(l, s, t, 1, 1, i)
452# endif
453# define rwsem_release(l, n, i) lock_release(l, n, i)
454#else
455# define rwsem_acquire(l, s, t, i) do { } while (0)
456# define rwsem_acquire_read(l, s, t, i) do { } while (0)
457# define rwsem_release(l, n, i) do { } while (0)
458#endif
459
460#endif /* __LINUX_LOCKDEP_H */