4 * Runtime locking correctness validator
6 * Started by Ingo Molnar:
8 * Copyright (C) 2006,2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
9 * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com>
11 * this code maps all the lock dependencies as they occur in a live kernel
12 * and will warn about the following classes of locking bugs:
14 * - lock inversion scenarios
15 * - circular lock dependencies
16 * - hardirq/softirq safe/unsafe locking bugs
18 * Bugs are reported even if the current locking scenario does not cause
19 * any deadlock at this point.
21 * I.e. if anytime in the past two locks were taken in a different order,
22 * even if it happened for another task, even if those were different
23 * locks (but of the same class as this lock), this code will detect it.
25 * Thanks to Arjan van de Ven for coming up with the initial idea of
26 * mapping lock dependencies runtime.
28 #define DISABLE_BRANCH_PROFILING
29 #include <linux/mutex.h>
30 #include <linux/sched.h>
31 #include <linux/delay.h>
32 #include <linux/module.h>
33 #include <linux/proc_fs.h>
34 #include <linux/seq_file.h>
35 #include <linux/spinlock.h>
36 #include <linux/kallsyms.h>
37 #include <linux/interrupt.h>
38 #include <linux/stacktrace.h>
39 #include <linux/debug_locks.h>
40 #include <linux/irqflags.h>
41 #include <linux/utsname.h>
42 #include <linux/hash.h>
43 #include <linux/ftrace.h>
44 #include <linux/stringify.h>
45 #include <linux/bitops.h>
46 #include <asm/sections.h>
48 #include "lockdep_internals.h"
50 #define CREATE_TRACE_POINTS
51 #include <trace/events/lockdep.h>
53 #ifdef CONFIG_PROVE_LOCKING
54 int prove_locking
= 1;
55 module_param(prove_locking
, int, 0644);
57 #define prove_locking 0
60 #ifdef CONFIG_LOCK_STAT
62 module_param(lock_stat
, int, 0644);
68 * lockdep_lock: protects the lockdep graph, the hashes and the
69 * class/list/hash allocators.
71 * This is one of the rare exceptions where it's justified
72 * to use a raw spinlock - we really dont want the spinlock
73 * code to recurse back into the lockdep code...
75 static raw_spinlock_t lockdep_lock
= (raw_spinlock_t
)__RAW_SPIN_LOCK_UNLOCKED
;
77 static int graph_lock(void)
79 __raw_spin_lock(&lockdep_lock
);
81 * Make sure that if another CPU detected a bug while
82 * walking the graph we dont change it (while the other
83 * CPU is busy printing out stuff with the graph lock
87 __raw_spin_unlock(&lockdep_lock
);
90 /* prevent any recursions within lockdep from causing deadlocks */
91 current
->lockdep_recursion
++;
95 static inline int graph_unlock(void)
97 if (debug_locks
&& !__raw_spin_is_locked(&lockdep_lock
))
98 return DEBUG_LOCKS_WARN_ON(1);
100 current
->lockdep_recursion
--;
101 __raw_spin_unlock(&lockdep_lock
);
106 * Turn lock debugging off and return with 0 if it was off already,
107 * and also release the graph lock:
109 static inline int debug_locks_off_graph_unlock(void)
111 int ret
= debug_locks_off();
113 __raw_spin_unlock(&lockdep_lock
);
118 static int lockdep_initialized
;
120 unsigned long nr_list_entries
;
121 struct lock_list list_entries
[MAX_LOCKDEP_ENTRIES
];
124 * All data structures here are protected by the global debug_lock.
126 * Mutex key structs only get allocated, once during bootup, and never
127 * get freed - this significantly simplifies the debugging code.
129 unsigned long nr_lock_classes
;
130 static struct lock_class lock_classes
[MAX_LOCKDEP_KEYS
];
132 static inline struct lock_class
*hlock_class(struct held_lock
*hlock
)
134 if (!hlock
->class_idx
) {
135 DEBUG_LOCKS_WARN_ON(1);
138 return lock_classes
+ hlock
->class_idx
- 1;
141 #ifdef CONFIG_LOCK_STAT
142 static DEFINE_PER_CPU(struct lock_class_stats
[MAX_LOCKDEP_KEYS
], lock_stats
);
144 static int lock_point(unsigned long points
[], unsigned long ip
)
148 for (i
= 0; i
< LOCKSTAT_POINTS
; i
++) {
149 if (points
[i
] == 0) {
160 static void lock_time_inc(struct lock_time
*lt
, s64 time
)
165 if (time
< lt
->min
|| !lt
->min
)
172 static inline void lock_time_add(struct lock_time
*src
, struct lock_time
*dst
)
174 dst
->min
+= src
->min
;
175 dst
->max
+= src
->max
;
176 dst
->total
+= src
->total
;
180 struct lock_class_stats
lock_stats(struct lock_class
*class)
182 struct lock_class_stats stats
;
185 memset(&stats
, 0, sizeof(struct lock_class_stats
));
186 for_each_possible_cpu(cpu
) {
187 struct lock_class_stats
*pcs
=
188 &per_cpu(lock_stats
, cpu
)[class - lock_classes
];
190 for (i
= 0; i
< ARRAY_SIZE(stats
.contention_point
); i
++)
191 stats
.contention_point
[i
] += pcs
->contention_point
[i
];
193 for (i
= 0; i
< ARRAY_SIZE(stats
.contending_point
); i
++)
194 stats
.contending_point
[i
] += pcs
->contending_point
[i
];
196 lock_time_add(&pcs
->read_waittime
, &stats
.read_waittime
);
197 lock_time_add(&pcs
->write_waittime
, &stats
.write_waittime
);
199 lock_time_add(&pcs
->read_holdtime
, &stats
.read_holdtime
);
200 lock_time_add(&pcs
->write_holdtime
, &stats
.write_holdtime
);
202 for (i
= 0; i
< ARRAY_SIZE(stats
.bounces
); i
++)
203 stats
.bounces
[i
] += pcs
->bounces
[i
];
209 void clear_lock_stats(struct lock_class
*class)
213 for_each_possible_cpu(cpu
) {
214 struct lock_class_stats
*cpu_stats
=
215 &per_cpu(lock_stats
, cpu
)[class - lock_classes
];
217 memset(cpu_stats
, 0, sizeof(struct lock_class_stats
));
219 memset(class->contention_point
, 0, sizeof(class->contention_point
));
220 memset(class->contending_point
, 0, sizeof(class->contending_point
));
223 static struct lock_class_stats
*get_lock_stats(struct lock_class
*class)
225 return &get_cpu_var(lock_stats
)[class - lock_classes
];
228 static void put_lock_stats(struct lock_class_stats
*stats
)
230 put_cpu_var(lock_stats
);
233 static void lock_release_holdtime(struct held_lock
*hlock
)
235 struct lock_class_stats
*stats
;
241 holdtime
= sched_clock() - hlock
->holdtime_stamp
;
243 stats
= get_lock_stats(hlock_class(hlock
));
245 lock_time_inc(&stats
->read_holdtime
, holdtime
);
247 lock_time_inc(&stats
->write_holdtime
, holdtime
);
248 put_lock_stats(stats
);
251 static inline void lock_release_holdtime(struct held_lock
*hlock
)
257 * We keep a global list of all lock classes. The list only grows,
258 * never shrinks. The list is only accessed with the lockdep
259 * spinlock lock held.
261 LIST_HEAD(all_lock_classes
);
264 * The lockdep classes are in a hash-table as well, for fast lookup:
266 #define CLASSHASH_BITS (MAX_LOCKDEP_KEYS_BITS - 1)
267 #define CLASSHASH_SIZE (1UL << CLASSHASH_BITS)
268 #define __classhashfn(key) hash_long((unsigned long)key, CLASSHASH_BITS)
269 #define classhashentry(key) (classhash_table + __classhashfn((key)))
271 static struct list_head classhash_table
[CLASSHASH_SIZE
];
274 * We put the lock dependency chains into a hash-table as well, to cache
277 #define CHAINHASH_BITS (MAX_LOCKDEP_CHAINS_BITS-1)
278 #define CHAINHASH_SIZE (1UL << CHAINHASH_BITS)
279 #define __chainhashfn(chain) hash_long(chain, CHAINHASH_BITS)
280 #define chainhashentry(chain) (chainhash_table + __chainhashfn((chain)))
282 static struct list_head chainhash_table
[CHAINHASH_SIZE
];
285 * The hash key of the lock dependency chains is a hash itself too:
286 * it's a hash of all locks taken up to that lock, including that lock.
287 * It's a 64-bit hash, because it's important for the keys to be
290 #define iterate_chain_key(key1, key2) \
291 (((key1) << MAX_LOCKDEP_KEYS_BITS) ^ \
292 ((key1) >> (64-MAX_LOCKDEP_KEYS_BITS)) ^ \
295 void lockdep_off(void)
297 current
->lockdep_recursion
++;
299 EXPORT_SYMBOL(lockdep_off
);
301 void lockdep_on(void)
303 current
->lockdep_recursion
--;
305 EXPORT_SYMBOL(lockdep_on
);
308 * Debugging switches:
312 #define VERY_VERBOSE 0
315 # define HARDIRQ_VERBOSE 1
316 # define SOFTIRQ_VERBOSE 1
317 # define RECLAIM_VERBOSE 1
319 # define HARDIRQ_VERBOSE 0
320 # define SOFTIRQ_VERBOSE 0
321 # define RECLAIM_VERBOSE 0
324 #if VERBOSE || HARDIRQ_VERBOSE || SOFTIRQ_VERBOSE || RECLAIM_VERBOSE
326 * Quick filtering for interesting events:
328 static int class_filter(struct lock_class
*class)
332 if (class->name_version
== 1 &&
333 !strcmp(class->name
, "lockname"))
335 if (class->name_version
== 1 &&
336 !strcmp(class->name
, "&struct->lockfield"))
339 /* Filter everything else. 1 would be to allow everything else */
344 static int verbose(struct lock_class
*class)
347 return class_filter(class);
353 * Stack-trace: tightly packed array of stack backtrace
354 * addresses. Protected by the graph_lock.
356 unsigned long nr_stack_trace_entries
;
357 static unsigned long stack_trace
[MAX_STACK_TRACE_ENTRIES
];
359 static int save_trace(struct stack_trace
*trace
)
361 trace
->nr_entries
= 0;
362 trace
->max_entries
= MAX_STACK_TRACE_ENTRIES
- nr_stack_trace_entries
;
363 trace
->entries
= stack_trace
+ nr_stack_trace_entries
;
367 save_stack_trace(trace
);
369 trace
->max_entries
= trace
->nr_entries
;
371 nr_stack_trace_entries
+= trace
->nr_entries
;
373 if (nr_stack_trace_entries
== MAX_STACK_TRACE_ENTRIES
) {
374 if (!debug_locks_off_graph_unlock())
377 printk("BUG: MAX_STACK_TRACE_ENTRIES too low!\n");
378 printk("turning off the locking correctness validator.\n");
387 unsigned int nr_hardirq_chains
;
388 unsigned int nr_softirq_chains
;
389 unsigned int nr_process_chains
;
390 unsigned int max_lockdep_depth
;
391 unsigned int max_recursion_depth
;
393 static unsigned int lockdep_dependency_gen_id
;
395 static bool lockdep_dependency_visit(struct lock_class
*source
,
399 lockdep_dependency_gen_id
++;
400 if (source
->dep_gen_id
== lockdep_dependency_gen_id
)
402 source
->dep_gen_id
= lockdep_dependency_gen_id
;
406 #ifdef CONFIG_DEBUG_LOCKDEP
408 * We cannot printk in early bootup code. Not even early_printk()
409 * might work. So we mark any initialization errors and printk
410 * about it later on, in lockdep_info().
412 static int lockdep_init_error
;
413 static unsigned long lockdep_init_trace_data
[20];
414 static struct stack_trace lockdep_init_trace
= {
415 .max_entries
= ARRAY_SIZE(lockdep_init_trace_data
),
416 .entries
= lockdep_init_trace_data
,
420 * Various lockdep statistics:
422 atomic_t chain_lookup_hits
;
423 atomic_t chain_lookup_misses
;
424 atomic_t hardirqs_on_events
;
425 atomic_t hardirqs_off_events
;
426 atomic_t redundant_hardirqs_on
;
427 atomic_t redundant_hardirqs_off
;
428 atomic_t softirqs_on_events
;
429 atomic_t softirqs_off_events
;
430 atomic_t redundant_softirqs_on
;
431 atomic_t redundant_softirqs_off
;
432 atomic_t nr_unused_locks
;
433 atomic_t nr_cyclic_checks
;
434 atomic_t nr_cyclic_check_recursions
;
435 atomic_t nr_find_usage_forwards_checks
;
436 atomic_t nr_find_usage_forwards_recursions
;
437 atomic_t nr_find_usage_backwards_checks
;
438 atomic_t nr_find_usage_backwards_recursions
;
445 #define __USAGE(__STATE) \
446 [LOCK_USED_IN_##__STATE] = "IN-"__stringify(__STATE)"-W", \
447 [LOCK_ENABLED_##__STATE] = __stringify(__STATE)"-ON-W", \
448 [LOCK_USED_IN_##__STATE##_READ] = "IN-"__stringify(__STATE)"-R",\
449 [LOCK_ENABLED_##__STATE##_READ] = __stringify(__STATE)"-ON-R",
451 static const char *usage_str
[] =
453 #define LOCKDEP_STATE(__STATE) __USAGE(__STATE)
454 #include "lockdep_states.h"
456 [LOCK_USED
] = "INITIAL USE",
459 const char * __get_key_name(struct lockdep_subclass_key
*key
, char *str
)
461 return kallsyms_lookup((unsigned long)key
, NULL
, NULL
, NULL
, str
);
464 static inline unsigned long lock_flag(enum lock_usage_bit bit
)
469 static char get_usage_char(struct lock_class
*class, enum lock_usage_bit bit
)
473 if (class->usage_mask
& lock_flag(bit
+ 2))
475 if (class->usage_mask
& lock_flag(bit
)) {
477 if (class->usage_mask
& lock_flag(bit
+ 2))
484 void get_usage_chars(struct lock_class
*class, char usage
[LOCK_USAGE_CHARS
])
488 #define LOCKDEP_STATE(__STATE) \
489 usage[i++] = get_usage_char(class, LOCK_USED_IN_##__STATE); \
490 usage[i++] = get_usage_char(class, LOCK_USED_IN_##__STATE##_READ);
491 #include "lockdep_states.h"
497 static void print_lock_name(struct lock_class
*class)
499 char str
[KSYM_NAME_LEN
], usage
[LOCK_USAGE_CHARS
];
502 get_usage_chars(class, usage
);
506 name
= __get_key_name(class->key
, str
);
507 printk(" (%s", name
);
509 printk(" (%s", name
);
510 if (class->name_version
> 1)
511 printk("#%d", class->name_version
);
513 printk("/%d", class->subclass
);
515 printk("){%s}", usage
);
518 static void print_lockdep_cache(struct lockdep_map
*lock
)
521 char str
[KSYM_NAME_LEN
];
525 name
= __get_key_name(lock
->key
->subkeys
, str
);
530 static void print_lock(struct held_lock
*hlock
)
532 print_lock_name(hlock_class(hlock
));
534 print_ip_sym(hlock
->acquire_ip
);
537 static void lockdep_print_held_locks(struct task_struct
*curr
)
539 int i
, depth
= curr
->lockdep_depth
;
542 printk("no locks held by %s/%d.\n", curr
->comm
, task_pid_nr(curr
));
545 printk("%d lock%s held by %s/%d:\n",
546 depth
, depth
> 1 ? "s" : "", curr
->comm
, task_pid_nr(curr
));
548 for (i
= 0; i
< depth
; i
++) {
550 print_lock(curr
->held_locks
+ i
);
554 static void print_lock_class_header(struct lock_class
*class, int depth
)
558 printk("%*s->", depth
, "");
559 print_lock_name(class);
560 printk(" ops: %lu", class->ops
);
563 for (bit
= 0; bit
< LOCK_USAGE_STATES
; bit
++) {
564 if (class->usage_mask
& (1 << bit
)) {
567 len
+= printk("%*s %s", depth
, "", usage_str
[bit
]);
568 len
+= printk(" at:\n");
569 print_stack_trace(class->usage_traces
+ bit
, len
);
572 printk("%*s }\n", depth
, "");
574 printk("%*s ... key at: ",depth
,"");
575 print_ip_sym((unsigned long)class->key
);
579 * printk the shortest lock dependencies from @start to @end in reverse order:
582 print_shortest_lock_dependencies(struct lock_list
*leaf
,
583 struct lock_list
*root
)
585 struct lock_list
*entry
= leaf
;
588 /*compute depth from generated tree by BFS*/
589 depth
= get_lock_depth(leaf
);
592 print_lock_class_header(entry
->class, depth
);
593 printk("%*s ... acquired at:\n", depth
, "");
594 print_stack_trace(&entry
->trace
, 2);
597 if (depth
== 0 && (entry
!= root
)) {
598 printk("lockdep:%s bad BFS generated tree\n", __func__
);
602 entry
= get_lock_parent(entry
);
604 } while (entry
&& (depth
>= 0));
609 * printk all lock dependencies starting at <entry>:
612 print_lock_dependencies(struct lock_class
*class, int depth
)
614 struct lock_list
*entry
;
616 if (lockdep_dependency_visit(class, depth
))
619 if (DEBUG_LOCKS_WARN_ON(depth
>= 20))
622 print_lock_class_header(class, depth
);
624 list_for_each_entry(entry
, &class->locks_after
, entry
) {
625 if (DEBUG_LOCKS_WARN_ON(!entry
->class))
628 print_lock_dependencies(entry
->class, depth
+ 1);
630 printk("%*s ... acquired at:\n",depth
,"");
631 print_stack_trace(&entry
->trace
, 2);
636 static void print_kernel_version(void)
638 printk("%s %.*s\n", init_utsname()->release
,
639 (int)strcspn(init_utsname()->version
, " "),
640 init_utsname()->version
);
643 static int very_verbose(struct lock_class
*class)
646 return class_filter(class);
652 * Is this the address of a static object:
654 static int static_obj(void *obj
)
656 unsigned long start
= (unsigned long) &_stext
,
657 end
= (unsigned long) &_end
,
658 addr
= (unsigned long) obj
;
666 if ((addr
>= start
) && (addr
< end
))
673 for_each_possible_cpu(i
) {
674 start
= (unsigned long) &__per_cpu_start
+ per_cpu_offset(i
);
675 end
= (unsigned long) &__per_cpu_start
+ PERCPU_ENOUGH_ROOM
678 if ((addr
>= start
) && (addr
< end
))
686 return is_module_address(addr
);
690 * To make lock name printouts unique, we calculate a unique
691 * class->name_version generation counter:
693 static int count_matching_names(struct lock_class
*new_class
)
695 struct lock_class
*class;
698 if (!new_class
->name
)
701 list_for_each_entry(class, &all_lock_classes
, lock_entry
) {
702 if (new_class
->key
- new_class
->subclass
== class->key
)
703 return class->name_version
;
704 if (class->name
&& !strcmp(class->name
, new_class
->name
))
705 count
= max(count
, class->name_version
);
712 * Register a lock's class in the hash-table, if the class is not present
713 * yet. Otherwise we look it up. We cache the result in the lock object
714 * itself, so actual lookup of the hash should be once per lock object.
716 static inline struct lock_class
*
717 look_up_lock_class(struct lockdep_map
*lock
, unsigned int subclass
)
719 struct lockdep_subclass_key
*key
;
720 struct list_head
*hash_head
;
721 struct lock_class
*class;
723 #ifdef CONFIG_DEBUG_LOCKDEP
725 * If the architecture calls into lockdep before initializing
726 * the hashes then we'll warn about it later. (we cannot printk
729 if (unlikely(!lockdep_initialized
)) {
731 lockdep_init_error
= 1;
732 save_stack_trace(&lockdep_init_trace
);
737 * Static locks do not have their class-keys yet - for them the key
738 * is the lock object itself:
740 if (unlikely(!lock
->key
))
741 lock
->key
= (void *)lock
;
744 * NOTE: the class-key must be unique. For dynamic locks, a static
745 * lock_class_key variable is passed in through the mutex_init()
746 * (or spin_lock_init()) call - which acts as the key. For static
747 * locks we use the lock object itself as the key.
749 BUILD_BUG_ON(sizeof(struct lock_class_key
) >
750 sizeof(struct lockdep_map
));
752 key
= lock
->key
->subkeys
+ subclass
;
754 hash_head
= classhashentry(key
);
757 * We can walk the hash lockfree, because the hash only
758 * grows, and we are careful when adding entries to the end:
760 list_for_each_entry(class, hash_head
, hash_entry
) {
761 if (class->key
== key
) {
762 WARN_ON_ONCE(class->name
!= lock
->name
);
771 * Register a lock's class in the hash-table, if the class is not present
772 * yet. Otherwise we look it up. We cache the result in the lock object
773 * itself, so actual lookup of the hash should be once per lock object.
775 static inline struct lock_class
*
776 register_lock_class(struct lockdep_map
*lock
, unsigned int subclass
, int force
)
778 struct lockdep_subclass_key
*key
;
779 struct list_head
*hash_head
;
780 struct lock_class
*class;
783 class = look_up_lock_class(lock
, subclass
);
788 * Debug-check: all keys must be persistent!
790 if (!static_obj(lock
->key
)) {
792 printk("INFO: trying to register non-static key.\n");
793 printk("the code is fine but needs lockdep annotation.\n");
794 printk("turning off the locking correctness validator.\n");
800 key
= lock
->key
->subkeys
+ subclass
;
801 hash_head
= classhashentry(key
);
803 raw_local_irq_save(flags
);
805 raw_local_irq_restore(flags
);
809 * We have to do the hash-walk again, to avoid races
812 list_for_each_entry(class, hash_head
, hash_entry
)
813 if (class->key
== key
)
816 * Allocate a new key from the static array, and add it to
819 if (nr_lock_classes
>= MAX_LOCKDEP_KEYS
) {
820 if (!debug_locks_off_graph_unlock()) {
821 raw_local_irq_restore(flags
);
824 raw_local_irq_restore(flags
);
826 printk("BUG: MAX_LOCKDEP_KEYS too low!\n");
827 printk("turning off the locking correctness validator.\n");
831 class = lock_classes
+ nr_lock_classes
++;
832 debug_atomic_inc(&nr_unused_locks
);
834 class->name
= lock
->name
;
835 class->subclass
= subclass
;
836 INIT_LIST_HEAD(&class->lock_entry
);
837 INIT_LIST_HEAD(&class->locks_before
);
838 INIT_LIST_HEAD(&class->locks_after
);
839 class->name_version
= count_matching_names(class);
841 * We use RCU's safe list-add method to make
842 * parallel walking of the hash-list safe:
844 list_add_tail_rcu(&class->hash_entry
, hash_head
);
846 * Add it to the global list of classes:
848 list_add_tail_rcu(&class->lock_entry
, &all_lock_classes
);
850 if (verbose(class)) {
852 raw_local_irq_restore(flags
);
854 printk("\nnew class %p: %s", class->key
, class->name
);
855 if (class->name_version
> 1)
856 printk("#%d", class->name_version
);
860 raw_local_irq_save(flags
);
862 raw_local_irq_restore(flags
);
868 raw_local_irq_restore(flags
);
870 if (!subclass
|| force
)
871 lock
->class_cache
= class;
873 if (DEBUG_LOCKS_WARN_ON(class->subclass
!= subclass
))
879 #ifdef CONFIG_PROVE_LOCKING
881 * Allocate a lockdep entry. (assumes the graph_lock held, returns
882 * with NULL on failure)
884 static struct lock_list
*alloc_list_entry(void)
886 if (nr_list_entries
>= MAX_LOCKDEP_ENTRIES
) {
887 if (!debug_locks_off_graph_unlock())
890 printk("BUG: MAX_LOCKDEP_ENTRIES too low!\n");
891 printk("turning off the locking correctness validator.\n");
895 return list_entries
+ nr_list_entries
++;
899 * Add a new dependency to the head of the list:
901 static int add_lock_to_list(struct lock_class
*class, struct lock_class
*this,
902 struct list_head
*head
, unsigned long ip
, int distance
)
904 struct lock_list
*entry
;
906 * Lock not present yet - get a new dependency struct and
907 * add it to the list:
909 entry
= alloc_list_entry();
913 if (!save_trace(&entry
->trace
))
917 entry
->distance
= distance
;
919 * Since we never remove from the dependency list, the list can
920 * be walked lockless by other CPUs, it's only allocation
921 * that must be protected by the spinlock. But this also means
922 * we must make new entries visible only once writes to the
923 * entry become visible - hence the RCU op:
925 list_add_tail_rcu(&entry
->entry
, head
);
930 unsigned long bfs_accessed
[BITS_TO_LONGS(MAX_LOCKDEP_ENTRIES
)];
931 static struct circular_queue lock_cq
;
933 static int __bfs(struct lock_list
*source_entry
,
935 int (*match
)(struct lock_list
*entry
, void *data
),
936 struct lock_list
**target_entry
,
939 struct lock_list
*entry
;
940 struct list_head
*head
;
941 struct circular_queue
*cq
= &lock_cq
;
944 if (match(source_entry
, data
)) {
945 *target_entry
= source_entry
;
951 head
= &source_entry
->class->locks_after
;
953 head
= &source_entry
->class->locks_before
;
955 if (list_empty(head
))
959 __cq_enqueue(cq
, (unsigned long)source_entry
);
961 while (!__cq_empty(cq
)) {
962 struct lock_list
*lock
;
964 __cq_dequeue(cq
, (unsigned long *)&lock
);
972 head
= &lock
->class->locks_after
;
974 head
= &lock
->class->locks_before
;
976 list_for_each_entry(entry
, head
, entry
) {
977 if (!lock_accessed(entry
)) {
978 mark_lock_accessed(entry
, lock
);
979 if (match(entry
, data
)) {
980 *target_entry
= entry
;
985 if (__cq_enqueue(cq
, (unsigned long)entry
)) {
996 static inline int __bfs_forwards(struct lock_list
*src_entry
,
998 int (*match
)(struct lock_list
*entry
, void *data
),
999 struct lock_list
**target_entry
)
1001 return __bfs(src_entry
, data
, match
, target_entry
, 1);
1005 static inline int __bfs_backwards(struct lock_list
*src_entry
,
1007 int (*match
)(struct lock_list
*entry
, void *data
),
1008 struct lock_list
**target_entry
)
1010 return __bfs(src_entry
, data
, match
, target_entry
, 0);
1015 * Recursive, forwards-direction lock-dependency checking, used for
1016 * both noncyclic checking and for hardirq-unsafe/softirq-unsafe
1021 * Print a dependency chain entry (this is only done when a deadlock
1022 * has been detected):
1025 print_circular_bug_entry(struct lock_list
*target
, int depth
)
1027 if (debug_locks_silent
)
1029 printk("\n-> #%u", depth
);
1030 print_lock_name(target
->class);
1032 print_stack_trace(&target
->trace
, 6);
1038 * When a circular dependency is detected, print the
1042 print_circular_bug_header(struct lock_list
*entry
, unsigned int depth
,
1043 struct held_lock
*check_src
,
1044 struct held_lock
*check_tgt
)
1046 struct task_struct
*curr
= current
;
1048 if (debug_locks_silent
)
1051 printk("\n=======================================================\n");
1052 printk( "[ INFO: possible circular locking dependency detected ]\n");
1053 print_kernel_version();
1054 printk( "-------------------------------------------------------\n");
1055 printk("%s/%d is trying to acquire lock:\n",
1056 curr
->comm
, task_pid_nr(curr
));
1057 print_lock(check_src
);
1058 printk("\nbut task is already holding lock:\n");
1059 print_lock(check_tgt
);
1060 printk("\nwhich lock already depends on the new lock.\n\n");
1061 printk("\nthe existing dependency chain (in reverse order) is:\n");
1063 print_circular_bug_entry(entry
, depth
);
1068 static inline int class_equal(struct lock_list
*entry
, void *data
)
1070 return entry
->class == data
;
1073 static noinline
int print_circular_bug(struct lock_list
*this,
1074 struct lock_list
*target
,
1075 struct held_lock
*check_src
,
1076 struct held_lock
*check_tgt
)
1078 struct task_struct
*curr
= current
;
1079 struct lock_list
*parent
;
1082 if (!debug_locks_off_graph_unlock() || debug_locks_silent
)
1085 if (!save_trace(&this->trace
))
1088 depth
= get_lock_depth(target
);
1090 print_circular_bug_header(target
, depth
, check_src
, check_tgt
);
1092 parent
= get_lock_parent(target
);
1095 print_circular_bug_entry(parent
, --depth
);
1096 parent
= get_lock_parent(parent
);
1099 printk("\nother info that might help us debug this:\n\n");
1100 lockdep_print_held_locks(curr
);
1102 printk("\nstack backtrace:\n");
1108 static noinline
int print_bfs_bug(int ret
)
1110 if (!debug_locks_off_graph_unlock())
1113 WARN(1, "lockdep bfs error:%d\n", ret
);
1118 unsigned long __lockdep_count_forward_deps(struct lock_class
*class,
1121 struct lock_list
*entry
;
1122 unsigned long ret
= 1;
1124 if (lockdep_dependency_visit(class, depth
))
1128 * Recurse this class's dependency list:
1130 list_for_each_entry(entry
, &class->locks_after
, entry
)
1131 ret
+= __lockdep_count_forward_deps(entry
->class, depth
+ 1);
1136 unsigned long lockdep_count_forward_deps(struct lock_class
*class)
1138 unsigned long ret
, flags
;
1140 local_irq_save(flags
);
1141 __raw_spin_lock(&lockdep_lock
);
1142 ret
= __lockdep_count_forward_deps(class, 0);
1143 __raw_spin_unlock(&lockdep_lock
);
1144 local_irq_restore(flags
);
1149 unsigned long __lockdep_count_backward_deps(struct lock_class
*class,
1152 struct lock_list
*entry
;
1153 unsigned long ret
= 1;
1155 if (lockdep_dependency_visit(class, depth
))
1158 * Recurse this class's dependency list:
1160 list_for_each_entry(entry
, &class->locks_before
, entry
)
1161 ret
+= __lockdep_count_backward_deps(entry
->class, depth
+ 1);
1166 unsigned long lockdep_count_backward_deps(struct lock_class
*class)
1168 unsigned long ret
, flags
;
1170 local_irq_save(flags
);
1171 __raw_spin_lock(&lockdep_lock
);
1172 ret
= __lockdep_count_backward_deps(class, 0);
1173 __raw_spin_unlock(&lockdep_lock
);
1174 local_irq_restore(flags
);
1180 * Prove that the dependency graph starting at <entry> can not
1181 * lead to <target>. Print an error and return 0 if it does.
1184 check_noncircular(struct lock_list
*root
, struct lock_class
*target
,
1185 struct lock_list
**target_entry
)
1189 debug_atomic_inc(&nr_cyclic_checks
);
1191 result
= __bfs_forwards(root
, target
, class_equal
, target_entry
);
1196 #if defined(CONFIG_TRACE_IRQFLAGS) && defined(CONFIG_PROVE_LOCKING)
1198 * Forwards and backwards subgraph searching, for the purposes of
1199 * proving that two subgraphs can be connected by a new dependency
1200 * without creating any illegal irq-safe -> irq-unsafe lock dependency.
1204 #define BFS_PROCESS_RET(ret) do { \
1206 return print_bfs_bug(ret); \
1211 static inline int usage_match(struct lock_list
*entry
, void *bit
)
1213 return entry
->class->usage_mask
& (1 << (enum lock_usage_bit
)bit
);
1219 * Find a node in the forwards-direction dependency sub-graph starting
1220 * at @root->class that matches @bit.
1222 * Return 0 if such a node exists in the subgraph, and put that node
1223 * into *@target_entry.
1225 * Return 1 otherwise and keep *@target_entry unchanged.
1226 * Return <0 on error.
1229 find_usage_forwards(struct lock_list
*root
, enum lock_usage_bit bit
,
1230 struct lock_list
**target_entry
)
1234 debug_atomic_inc(&nr_find_usage_forwards_checks
);
1236 result
= __bfs_forwards(root
, (void *)bit
, usage_match
, target_entry
);
1242 * Find a node in the backwards-direction dependency sub-graph starting
1243 * at @root->class that matches @bit.
1245 * Return 0 if such a node exists in the subgraph, and put that node
1246 * into *@target_entry.
1248 * Return 1 otherwise and keep *@target_entry unchanged.
1249 * Return <0 on error.
1252 find_usage_backwards(struct lock_list
*root
, enum lock_usage_bit bit
,
1253 struct lock_list
**target_entry
)
1257 debug_atomic_inc(&nr_find_usage_backwards_checks
);
1259 result
= __bfs_backwards(root
, (void *)bit
, usage_match
, target_entry
);
1266 print_bad_irq_dependency(struct task_struct
*curr
,
1267 struct lock_list
*prev_root
,
1268 struct lock_list
*next_root
,
1269 struct lock_list
*backwards_entry
,
1270 struct lock_list
*forwards_entry
,
1271 struct held_lock
*prev
,
1272 struct held_lock
*next
,
1273 enum lock_usage_bit bit1
,
1274 enum lock_usage_bit bit2
,
1275 const char *irqclass
)
1277 if (!debug_locks_off_graph_unlock() || debug_locks_silent
)
1280 printk("\n======================================================\n");
1281 printk( "[ INFO: %s-safe -> %s-unsafe lock order detected ]\n",
1282 irqclass
, irqclass
);
1283 print_kernel_version();
1284 printk( "------------------------------------------------------\n");
1285 printk("%s/%d [HC%u[%lu]:SC%u[%lu]:HE%u:SE%u] is trying to acquire:\n",
1286 curr
->comm
, task_pid_nr(curr
),
1287 curr
->hardirq_context
, hardirq_count() >> HARDIRQ_SHIFT
,
1288 curr
->softirq_context
, softirq_count() >> SOFTIRQ_SHIFT
,
1289 curr
->hardirqs_enabled
,
1290 curr
->softirqs_enabled
);
1293 printk("\nand this task is already holding:\n");
1295 printk("which would create a new lock dependency:\n");
1296 print_lock_name(hlock_class(prev
));
1298 print_lock_name(hlock_class(next
));
1301 printk("\nbut this new dependency connects a %s-irq-safe lock:\n",
1303 print_lock_name(backwards_entry
->class);
1304 printk("\n... which became %s-irq-safe at:\n", irqclass
);
1306 print_stack_trace(backwards_entry
->class->usage_traces
+ bit1
, 1);
1308 printk("\nto a %s-irq-unsafe lock:\n", irqclass
);
1309 print_lock_name(forwards_entry
->class);
1310 printk("\n... which became %s-irq-unsafe at:\n", irqclass
);
1313 print_stack_trace(forwards_entry
->class->usage_traces
+ bit2
, 1);
1315 printk("\nother info that might help us debug this:\n\n");
1316 lockdep_print_held_locks(curr
);
1318 printk("\nthe dependencies between %s-irq-safe lock", irqclass
);
1319 printk(" and the holding lock:\n");
1320 if (!save_trace(&prev_root
->trace
))
1322 print_shortest_lock_dependencies(backwards_entry
, prev_root
);
1324 printk("\nthe dependencies between the lock to be acquired");
1325 printk(" and %s-irq-unsafe lock:\n", irqclass
);
1326 if (!save_trace(&next_root
->trace
))
1328 print_shortest_lock_dependencies(forwards_entry
, next_root
);
1330 printk("\nstack backtrace:\n");
1337 check_usage(struct task_struct
*curr
, struct held_lock
*prev
,
1338 struct held_lock
*next
, enum lock_usage_bit bit_backwards
,
1339 enum lock_usage_bit bit_forwards
, const char *irqclass
)
1342 struct lock_list
this, that
;
1343 struct lock_list
*uninitialized_var(target_entry
);
1344 struct lock_list
*uninitialized_var(target_entry1
);
1348 this.class = hlock_class(prev
);
1349 ret
= find_usage_backwards(&this, bit_backwards
, &target_entry
);
1350 BFS_PROCESS_RET(ret
);
1353 that
.class = hlock_class(next
);
1354 ret
= find_usage_forwards(&that
, bit_forwards
, &target_entry1
);
1355 BFS_PROCESS_RET(ret
);
1357 return print_bad_irq_dependency(curr
, &this, &that
,
1358 target_entry
, target_entry1
,
1360 bit_backwards
, bit_forwards
, irqclass
);
1363 static const char *state_names
[] = {
1364 #define LOCKDEP_STATE(__STATE) \
1365 __stringify(__STATE),
1366 #include "lockdep_states.h"
1367 #undef LOCKDEP_STATE
1370 static const char *state_rnames
[] = {
1371 #define LOCKDEP_STATE(__STATE) \
1372 __stringify(__STATE)"-READ",
1373 #include "lockdep_states.h"
1374 #undef LOCKDEP_STATE
1377 static inline const char *state_name(enum lock_usage_bit bit
)
1379 return (bit
& 1) ? state_rnames
[bit
>> 2] : state_names
[bit
>> 2];
1382 static int exclusive_bit(int new_bit
)
1390 * bit 0 - write/read
1391 * bit 1 - used_in/enabled
1395 int state
= new_bit
& ~3;
1396 int dir
= new_bit
& 2;
1399 * keep state, bit flip the direction and strip read.
1401 return state
| (dir
^ 2);
1404 static int check_irq_usage(struct task_struct
*curr
, struct held_lock
*prev
,
1405 struct held_lock
*next
, enum lock_usage_bit bit
)
1408 * Prove that the new dependency does not connect a hardirq-safe
1409 * lock with a hardirq-unsafe lock - to achieve this we search
1410 * the backwards-subgraph starting at <prev>, and the
1411 * forwards-subgraph starting at <next>:
1413 if (!check_usage(curr
, prev
, next
, bit
,
1414 exclusive_bit(bit
), state_name(bit
)))
1420 * Prove that the new dependency does not connect a hardirq-safe-read
1421 * lock with a hardirq-unsafe lock - to achieve this we search
1422 * the backwards-subgraph starting at <prev>, and the
1423 * forwards-subgraph starting at <next>:
1425 if (!check_usage(curr
, prev
, next
, bit
,
1426 exclusive_bit(bit
), state_name(bit
)))
1433 check_prev_add_irq(struct task_struct
*curr
, struct held_lock
*prev
,
1434 struct held_lock
*next
)
1436 #define LOCKDEP_STATE(__STATE) \
1437 if (!check_irq_usage(curr, prev, next, LOCK_USED_IN_##__STATE)) \
1439 #include "lockdep_states.h"
1440 #undef LOCKDEP_STATE
1445 static void inc_chains(void)
1447 if (current
->hardirq_context
)
1448 nr_hardirq_chains
++;
1450 if (current
->softirq_context
)
1451 nr_softirq_chains
++;
1453 nr_process_chains
++;
1460 check_prev_add_irq(struct task_struct
*curr
, struct held_lock
*prev
,
1461 struct held_lock
*next
)
1466 static inline void inc_chains(void)
1468 nr_process_chains
++;
1474 print_deadlock_bug(struct task_struct
*curr
, struct held_lock
*prev
,
1475 struct held_lock
*next
)
1477 if (!debug_locks_off_graph_unlock() || debug_locks_silent
)
1480 printk("\n=============================================\n");
1481 printk( "[ INFO: possible recursive locking detected ]\n");
1482 print_kernel_version();
1483 printk( "---------------------------------------------\n");
1484 printk("%s/%d is trying to acquire lock:\n",
1485 curr
->comm
, task_pid_nr(curr
));
1487 printk("\nbut task is already holding lock:\n");
1490 printk("\nother info that might help us debug this:\n");
1491 lockdep_print_held_locks(curr
);
1493 printk("\nstack backtrace:\n");
1500 * Check whether we are holding such a class already.
1502 * (Note that this has to be done separately, because the graph cannot
1503 * detect such classes of deadlocks.)
1505 * Returns: 0 on deadlock detected, 1 on OK, 2 on recursive read
1508 check_deadlock(struct task_struct
*curr
, struct held_lock
*next
,
1509 struct lockdep_map
*next_instance
, int read
)
1511 struct held_lock
*prev
;
1512 struct held_lock
*nest
= NULL
;
1515 for (i
= 0; i
< curr
->lockdep_depth
; i
++) {
1516 prev
= curr
->held_locks
+ i
;
1518 if (prev
->instance
== next
->nest_lock
)
1521 if (hlock_class(prev
) != hlock_class(next
))
1525 * Allow read-after-read recursion of the same
1526 * lock class (i.e. read_lock(lock)+read_lock(lock)):
1528 if ((read
== 2) && prev
->read
)
1532 * We're holding the nest_lock, which serializes this lock's
1533 * nesting behaviour.
1538 return print_deadlock_bug(curr
, prev
, next
);
1544 * There was a chain-cache miss, and we are about to add a new dependency
1545 * to a previous lock. We recursively validate the following rules:
1547 * - would the adding of the <prev> -> <next> dependency create a
1548 * circular dependency in the graph? [== circular deadlock]
1550 * - does the new prev->next dependency connect any hardirq-safe lock
1551 * (in the full backwards-subgraph starting at <prev>) with any
1552 * hardirq-unsafe lock (in the full forwards-subgraph starting at
1553 * <next>)? [== illegal lock inversion with hardirq contexts]
1555 * - does the new prev->next dependency connect any softirq-safe lock
1556 * (in the full backwards-subgraph starting at <prev>) with any
1557 * softirq-unsafe lock (in the full forwards-subgraph starting at
1558 * <next>)? [== illegal lock inversion with softirq contexts]
1560 * any of these scenarios could lead to a deadlock.
1562 * Then if all the validations pass, we add the forwards and backwards
1566 check_prev_add(struct task_struct
*curr
, struct held_lock
*prev
,
1567 struct held_lock
*next
, int distance
)
1569 struct lock_list
*entry
;
1571 struct lock_list
this;
1572 struct lock_list
*uninitialized_var(target_entry
);
1575 * Prove that the new <prev> -> <next> dependency would not
1576 * create a circular dependency in the graph. (We do this by
1577 * forward-recursing into the graph starting at <next>, and
1578 * checking whether we can reach <prev>.)
1580 * We are using global variables to control the recursion, to
1581 * keep the stackframe size of the recursive functions low:
1583 this.class = hlock_class(next
);
1585 ret
= check_noncircular(&this, hlock_class(prev
), &target_entry
);
1587 return print_circular_bug(&this, target_entry
, next
, prev
);
1588 else if (unlikely(ret
< 0))
1589 return print_bfs_bug(ret
);
1591 if (!check_prev_add_irq(curr
, prev
, next
))
1595 * For recursive read-locks we do all the dependency checks,
1596 * but we dont store read-triggered dependencies (only
1597 * write-triggered dependencies). This ensures that only the
1598 * write-side dependencies matter, and that if for example a
1599 * write-lock never takes any other locks, then the reads are
1600 * equivalent to a NOP.
1602 if (next
->read
== 2 || prev
->read
== 2)
1605 * Is the <prev> -> <next> dependency already present?
1607 * (this may occur even though this is a new chain: consider
1608 * e.g. the L1 -> L2 -> L3 -> L4 and the L5 -> L1 -> L2 -> L3
1609 * chains - the second one will be new, but L1 already has
1610 * L2 added to its dependency list, due to the first chain.)
1612 list_for_each_entry(entry
, &hlock_class(prev
)->locks_after
, entry
) {
1613 if (entry
->class == hlock_class(next
)) {
1615 entry
->distance
= 1;
1621 * Ok, all validations passed, add the new lock
1622 * to the previous lock's dependency list:
1624 ret
= add_lock_to_list(hlock_class(prev
), hlock_class(next
),
1625 &hlock_class(prev
)->locks_after
,
1626 next
->acquire_ip
, distance
);
1631 ret
= add_lock_to_list(hlock_class(next
), hlock_class(prev
),
1632 &hlock_class(next
)->locks_before
,
1633 next
->acquire_ip
, distance
);
1638 * Debugging printouts:
1640 if (verbose(hlock_class(prev
)) || verbose(hlock_class(next
))) {
1642 printk("\n new dependency: ");
1643 print_lock_name(hlock_class(prev
));
1645 print_lock_name(hlock_class(next
));
1648 return graph_lock();
1654 * Add the dependency to all directly-previous locks that are 'relevant'.
1655 * The ones that are relevant are (in increasing distance from curr):
1656 * all consecutive trylock entries and the final non-trylock entry - or
1657 * the end of this context's lock-chain - whichever comes first.
1660 check_prevs_add(struct task_struct
*curr
, struct held_lock
*next
)
1662 int depth
= curr
->lockdep_depth
;
1663 struct held_lock
*hlock
;
1668 * Depth must not be zero for a non-head lock:
1673 * At least two relevant locks must exist for this
1676 if (curr
->held_locks
[depth
].irq_context
!=
1677 curr
->held_locks
[depth
-1].irq_context
)
1681 int distance
= curr
->lockdep_depth
- depth
+ 1;
1682 hlock
= curr
->held_locks
+ depth
-1;
1684 * Only non-recursive-read entries get new dependencies
1687 if (hlock
->read
!= 2) {
1688 if (!check_prev_add(curr
, hlock
, next
, distance
))
1691 * Stop after the first non-trylock entry,
1692 * as non-trylock entries have added their
1693 * own direct dependencies already, so this
1694 * lock is connected to them indirectly:
1696 if (!hlock
->trylock
)
1701 * End of lock-stack?
1706 * Stop the search if we cross into another context:
1708 if (curr
->held_locks
[depth
].irq_context
!=
1709 curr
->held_locks
[depth
-1].irq_context
)
1714 if (!debug_locks_off_graph_unlock())
1722 unsigned long nr_lock_chains
;
1723 struct lock_chain lock_chains
[MAX_LOCKDEP_CHAINS
];
1724 int nr_chain_hlocks
;
1725 static u16 chain_hlocks
[MAX_LOCKDEP_CHAIN_HLOCKS
];
1727 struct lock_class
*lock_chain_get_class(struct lock_chain
*chain
, int i
)
1729 return lock_classes
+ chain_hlocks
[chain
->base
+ i
];
1733 * Look up a dependency chain. If the key is not present yet then
1734 * add it and return 1 - in this case the new dependency chain is
1735 * validated. If the key is already hashed, return 0.
1736 * (On return with 1 graph_lock is held.)
1738 static inline int lookup_chain_cache(struct task_struct
*curr
,
1739 struct held_lock
*hlock
,
1742 struct lock_class
*class = hlock_class(hlock
);
1743 struct list_head
*hash_head
= chainhashentry(chain_key
);
1744 struct lock_chain
*chain
;
1745 struct held_lock
*hlock_curr
, *hlock_next
;
1748 if (DEBUG_LOCKS_WARN_ON(!irqs_disabled()))
1751 * We can walk it lock-free, because entries only get added
1754 list_for_each_entry(chain
, hash_head
, entry
) {
1755 if (chain
->chain_key
== chain_key
) {
1757 debug_atomic_inc(&chain_lookup_hits
);
1758 if (very_verbose(class))
1759 printk("\nhash chain already cached, key: "
1760 "%016Lx tail class: [%p] %s\n",
1761 (unsigned long long)chain_key
,
1762 class->key
, class->name
);
1766 if (very_verbose(class))
1767 printk("\nnew hash chain, key: %016Lx tail class: [%p] %s\n",
1768 (unsigned long long)chain_key
, class->key
, class->name
);
1770 * Allocate a new chain entry from the static array, and add
1776 * We have to walk the chain again locked - to avoid duplicates:
1778 list_for_each_entry(chain
, hash_head
, entry
) {
1779 if (chain
->chain_key
== chain_key
) {
1784 if (unlikely(nr_lock_chains
>= MAX_LOCKDEP_CHAINS
)) {
1785 if (!debug_locks_off_graph_unlock())
1788 printk("BUG: MAX_LOCKDEP_CHAINS too low!\n");
1789 printk("turning off the locking correctness validator.\n");
1793 chain
= lock_chains
+ nr_lock_chains
++;
1794 chain
->chain_key
= chain_key
;
1795 chain
->irq_context
= hlock
->irq_context
;
1796 /* Find the first held_lock of current chain */
1798 for (i
= curr
->lockdep_depth
- 1; i
>= 0; i
--) {
1799 hlock_curr
= curr
->held_locks
+ i
;
1800 if (hlock_curr
->irq_context
!= hlock_next
->irq_context
)
1805 chain
->depth
= curr
->lockdep_depth
+ 1 - i
;
1806 cn
= nr_chain_hlocks
;
1807 while (cn
+ chain
->depth
<= MAX_LOCKDEP_CHAIN_HLOCKS
) {
1808 n
= cmpxchg(&nr_chain_hlocks
, cn
, cn
+ chain
->depth
);
1813 if (likely(cn
+ chain
->depth
<= MAX_LOCKDEP_CHAIN_HLOCKS
)) {
1815 for (j
= 0; j
< chain
->depth
- 1; j
++, i
++) {
1816 int lock_id
= curr
->held_locks
[i
].class_idx
- 1;
1817 chain_hlocks
[chain
->base
+ j
] = lock_id
;
1819 chain_hlocks
[chain
->base
+ j
] = class - lock_classes
;
1821 list_add_tail_rcu(&chain
->entry
, hash_head
);
1822 debug_atomic_inc(&chain_lookup_misses
);
1828 static int validate_chain(struct task_struct
*curr
, struct lockdep_map
*lock
,
1829 struct held_lock
*hlock
, int chain_head
, u64 chain_key
)
1832 * Trylock needs to maintain the stack of held locks, but it
1833 * does not add new dependencies, because trylock can be done
1836 * We look up the chain_key and do the O(N^2) check and update of
1837 * the dependencies only if this is a new dependency chain.
1838 * (If lookup_chain_cache() returns with 1 it acquires
1839 * graph_lock for us)
1841 if (!hlock
->trylock
&& (hlock
->check
== 2) &&
1842 lookup_chain_cache(curr
, hlock
, chain_key
)) {
1844 * Check whether last held lock:
1846 * - is irq-safe, if this lock is irq-unsafe
1847 * - is softirq-safe, if this lock is hardirq-unsafe
1849 * And check whether the new lock's dependency graph
1850 * could lead back to the previous lock.
1852 * any of these scenarios could lead to a deadlock. If
1855 int ret
= check_deadlock(curr
, hlock
, lock
, hlock
->read
);
1860 * Mark recursive read, as we jump over it when
1861 * building dependencies (just like we jump over
1867 * Add dependency only if this lock is not the head
1868 * of the chain, and if it's not a secondary read-lock:
1870 if (!chain_head
&& ret
!= 2)
1871 if (!check_prevs_add(curr
, hlock
))
1875 /* after lookup_chain_cache(): */
1876 if (unlikely(!debug_locks
))
1882 static inline int validate_chain(struct task_struct
*curr
,
1883 struct lockdep_map
*lock
, struct held_lock
*hlock
,
1884 int chain_head
, u64 chain_key
)
1891 * We are building curr_chain_key incrementally, so double-check
1892 * it from scratch, to make sure that it's done correctly:
1894 static void check_chain_key(struct task_struct
*curr
)
1896 #ifdef CONFIG_DEBUG_LOCKDEP
1897 struct held_lock
*hlock
, *prev_hlock
= NULL
;
1901 for (i
= 0; i
< curr
->lockdep_depth
; i
++) {
1902 hlock
= curr
->held_locks
+ i
;
1903 if (chain_key
!= hlock
->prev_chain_key
) {
1905 WARN(1, "hm#1, depth: %u [%u], %016Lx != %016Lx\n",
1906 curr
->lockdep_depth
, i
,
1907 (unsigned long long)chain_key
,
1908 (unsigned long long)hlock
->prev_chain_key
);
1911 id
= hlock
->class_idx
- 1;
1912 if (DEBUG_LOCKS_WARN_ON(id
>= MAX_LOCKDEP_KEYS
))
1915 if (prev_hlock
&& (prev_hlock
->irq_context
!=
1916 hlock
->irq_context
))
1918 chain_key
= iterate_chain_key(chain_key
, id
);
1921 if (chain_key
!= curr
->curr_chain_key
) {
1923 WARN(1, "hm#2, depth: %u [%u], %016Lx != %016Lx\n",
1924 curr
->lockdep_depth
, i
,
1925 (unsigned long long)chain_key
,
1926 (unsigned long long)curr
->curr_chain_key
);
1932 print_usage_bug(struct task_struct
*curr
, struct held_lock
*this,
1933 enum lock_usage_bit prev_bit
, enum lock_usage_bit new_bit
)
1935 if (!debug_locks_off_graph_unlock() || debug_locks_silent
)
1938 printk("\n=================================\n");
1939 printk( "[ INFO: inconsistent lock state ]\n");
1940 print_kernel_version();
1941 printk( "---------------------------------\n");
1943 printk("inconsistent {%s} -> {%s} usage.\n",
1944 usage_str
[prev_bit
], usage_str
[new_bit
]);
1946 printk("%s/%d [HC%u[%lu]:SC%u[%lu]:HE%u:SE%u] takes:\n",
1947 curr
->comm
, task_pid_nr(curr
),
1948 trace_hardirq_context(curr
), hardirq_count() >> HARDIRQ_SHIFT
,
1949 trace_softirq_context(curr
), softirq_count() >> SOFTIRQ_SHIFT
,
1950 trace_hardirqs_enabled(curr
),
1951 trace_softirqs_enabled(curr
));
1954 printk("{%s} state was registered at:\n", usage_str
[prev_bit
]);
1955 print_stack_trace(hlock_class(this)->usage_traces
+ prev_bit
, 1);
1957 print_irqtrace_events(curr
);
1958 printk("\nother info that might help us debug this:\n");
1959 lockdep_print_held_locks(curr
);
1961 printk("\nstack backtrace:\n");
1968 * Print out an error if an invalid bit is set:
1971 valid_state(struct task_struct
*curr
, struct held_lock
*this,
1972 enum lock_usage_bit new_bit
, enum lock_usage_bit bad_bit
)
1974 if (unlikely(hlock_class(this)->usage_mask
& (1 << bad_bit
)))
1975 return print_usage_bug(curr
, this, bad_bit
, new_bit
);
1979 static int mark_lock(struct task_struct
*curr
, struct held_lock
*this,
1980 enum lock_usage_bit new_bit
);
1982 #if defined(CONFIG_TRACE_IRQFLAGS) && defined(CONFIG_PROVE_LOCKING)
1985 * print irq inversion bug:
1988 print_irq_inversion_bug(struct task_struct
*curr
,
1989 struct lock_list
*root
, struct lock_list
*other
,
1990 struct held_lock
*this, int forwards
,
1991 const char *irqclass
)
1993 if (!debug_locks_off_graph_unlock() || debug_locks_silent
)
1996 printk("\n=========================================================\n");
1997 printk( "[ INFO: possible irq lock inversion dependency detected ]\n");
1998 print_kernel_version();
1999 printk( "---------------------------------------------------------\n");
2000 printk("%s/%d just changed the state of lock:\n",
2001 curr
->comm
, task_pid_nr(curr
));
2004 printk("but this lock took another, %s-unsafe lock in the past:\n", irqclass
);
2006 printk("but this lock was taken by another, %s-safe lock in the past:\n", irqclass
);
2007 print_lock_name(other
->class);
2008 printk("\n\nand interrupts could create inverse lock ordering between them.\n\n");
2010 printk("\nother info that might help us debug this:\n");
2011 lockdep_print_held_locks(curr
);
2013 printk("\nthe shortest dependencies between 2nd lock and 1st lock:\n");
2014 if (!save_trace(&root
->trace
))
2016 print_shortest_lock_dependencies(other
, root
);
2018 printk("\nstack backtrace:\n");
2025 * Prove that in the forwards-direction subgraph starting at <this>
2026 * there is no lock matching <mask>:
2029 check_usage_forwards(struct task_struct
*curr
, struct held_lock
*this,
2030 enum lock_usage_bit bit
, const char *irqclass
)
2033 struct lock_list root
;
2034 struct lock_list
*uninitialized_var(target_entry
);
2037 root
.class = hlock_class(this);
2038 ret
= find_usage_forwards(&root
, bit
, &target_entry
);
2039 BFS_PROCESS_RET(ret
);
2041 return print_irq_inversion_bug(curr
, &root
, target_entry
,
2046 * Prove that in the backwards-direction subgraph starting at <this>
2047 * there is no lock matching <mask>:
2050 check_usage_backwards(struct task_struct
*curr
, struct held_lock
*this,
2051 enum lock_usage_bit bit
, const char *irqclass
)
2054 struct lock_list root
;
2055 struct lock_list
*uninitialized_var(target_entry
);
2058 root
.class = hlock_class(this);
2059 ret
= find_usage_backwards(&root
, bit
, &target_entry
);
2060 BFS_PROCESS_RET(ret
);
2062 return print_irq_inversion_bug(curr
, &root
, target_entry
,
2066 void print_irqtrace_events(struct task_struct
*curr
)
2068 printk("irq event stamp: %u\n", curr
->irq_events
);
2069 printk("hardirqs last enabled at (%u): ", curr
->hardirq_enable_event
);
2070 print_ip_sym(curr
->hardirq_enable_ip
);
2071 printk("hardirqs last disabled at (%u): ", curr
->hardirq_disable_event
);
2072 print_ip_sym(curr
->hardirq_disable_ip
);
2073 printk("softirqs last enabled at (%u): ", curr
->softirq_enable_event
);
2074 print_ip_sym(curr
->softirq_enable_ip
);
2075 printk("softirqs last disabled at (%u): ", curr
->softirq_disable_event
);
2076 print_ip_sym(curr
->softirq_disable_ip
);
2079 static int HARDIRQ_verbose(struct lock_class
*class)
2082 return class_filter(class);
2087 static int SOFTIRQ_verbose(struct lock_class
*class)
2090 return class_filter(class);
2095 static int RECLAIM_FS_verbose(struct lock_class
*class)
2098 return class_filter(class);
2103 #define STRICT_READ_CHECKS 1
2105 static int (*state_verbose_f
[])(struct lock_class
*class) = {
2106 #define LOCKDEP_STATE(__STATE) \
2108 #include "lockdep_states.h"
2109 #undef LOCKDEP_STATE
2112 static inline int state_verbose(enum lock_usage_bit bit
,
2113 struct lock_class
*class)
2115 return state_verbose_f
[bit
>> 2](class);
2118 typedef int (*check_usage_f
)(struct task_struct
*, struct held_lock
*,
2119 enum lock_usage_bit bit
, const char *name
);
2122 mark_lock_irq(struct task_struct
*curr
, struct held_lock
*this,
2123 enum lock_usage_bit new_bit
)
2125 int excl_bit
= exclusive_bit(new_bit
);
2126 int read
= new_bit
& 1;
2127 int dir
= new_bit
& 2;
2130 * mark USED_IN has to look forwards -- to ensure no dependency
2131 * has ENABLED state, which would allow recursion deadlocks.
2133 * mark ENABLED has to look backwards -- to ensure no dependee
2134 * has USED_IN state, which, again, would allow recursion deadlocks.
2136 check_usage_f usage
= dir
?
2137 check_usage_backwards
: check_usage_forwards
;
2140 * Validate that this particular lock does not have conflicting
2143 if (!valid_state(curr
, this, new_bit
, excl_bit
))
2147 * Validate that the lock dependencies don't have conflicting usage
2150 if ((!read
|| !dir
|| STRICT_READ_CHECKS
) &&
2151 !usage(curr
, this, excl_bit
, state_name(new_bit
& ~1)))
2155 * Check for read in write conflicts
2158 if (!valid_state(curr
, this, new_bit
, excl_bit
+ 1))
2161 if (STRICT_READ_CHECKS
&&
2162 !usage(curr
, this, excl_bit
+ 1,
2163 state_name(new_bit
+ 1)))
2167 if (state_verbose(new_bit
, hlock_class(this)))
2174 #define LOCKDEP_STATE(__STATE) __STATE,
2175 #include "lockdep_states.h"
2176 #undef LOCKDEP_STATE
2180 * Mark all held locks with a usage bit:
2183 mark_held_locks(struct task_struct
*curr
, enum mark_type mark
)
2185 enum lock_usage_bit usage_bit
;
2186 struct held_lock
*hlock
;
2189 for (i
= 0; i
< curr
->lockdep_depth
; i
++) {
2190 hlock
= curr
->held_locks
+ i
;
2192 usage_bit
= 2 + (mark
<< 2); /* ENABLED */
2194 usage_bit
+= 1; /* READ */
2196 BUG_ON(usage_bit
>= LOCK_USAGE_STATES
);
2198 if (!mark_lock(curr
, hlock
, usage_bit
))
2206 * Debugging helper: via this flag we know that we are in
2207 * 'early bootup code', and will warn about any invalid irqs-on event:
2209 static int early_boot_irqs_enabled
;
2211 void early_boot_irqs_off(void)
2213 early_boot_irqs_enabled
= 0;
2216 void early_boot_irqs_on(void)
2218 early_boot_irqs_enabled
= 1;
2222 * Hardirqs will be enabled:
2224 void trace_hardirqs_on_caller(unsigned long ip
)
2226 struct task_struct
*curr
= current
;
2228 time_hardirqs_on(CALLER_ADDR0
, ip
);
2230 if (unlikely(!debug_locks
|| current
->lockdep_recursion
))
2233 if (DEBUG_LOCKS_WARN_ON(unlikely(!early_boot_irqs_enabled
)))
2236 if (unlikely(curr
->hardirqs_enabled
)) {
2237 debug_atomic_inc(&redundant_hardirqs_on
);
2240 /* we'll do an OFF -> ON transition: */
2241 curr
->hardirqs_enabled
= 1;
2243 if (DEBUG_LOCKS_WARN_ON(!irqs_disabled()))
2245 if (DEBUG_LOCKS_WARN_ON(current
->hardirq_context
))
2248 * We are going to turn hardirqs on, so set the
2249 * usage bit for all held locks:
2251 if (!mark_held_locks(curr
, HARDIRQ
))
2254 * If we have softirqs enabled, then set the usage
2255 * bit for all held locks. (disabled hardirqs prevented
2256 * this bit from being set before)
2258 if (curr
->softirqs_enabled
)
2259 if (!mark_held_locks(curr
, SOFTIRQ
))
2262 curr
->hardirq_enable_ip
= ip
;
2263 curr
->hardirq_enable_event
= ++curr
->irq_events
;
2264 debug_atomic_inc(&hardirqs_on_events
);
2266 EXPORT_SYMBOL(trace_hardirqs_on_caller
);
2268 void trace_hardirqs_on(void)
2270 trace_hardirqs_on_caller(CALLER_ADDR0
);
2272 EXPORT_SYMBOL(trace_hardirqs_on
);
2275 * Hardirqs were disabled:
2277 void trace_hardirqs_off_caller(unsigned long ip
)
2279 struct task_struct
*curr
= current
;
2281 time_hardirqs_off(CALLER_ADDR0
, ip
);
2283 if (unlikely(!debug_locks
|| current
->lockdep_recursion
))
2286 if (DEBUG_LOCKS_WARN_ON(!irqs_disabled()))
2289 if (curr
->hardirqs_enabled
) {
2291 * We have done an ON -> OFF transition:
2293 curr
->hardirqs_enabled
= 0;
2294 curr
->hardirq_disable_ip
= ip
;
2295 curr
->hardirq_disable_event
= ++curr
->irq_events
;
2296 debug_atomic_inc(&hardirqs_off_events
);
2298 debug_atomic_inc(&redundant_hardirqs_off
);
2300 EXPORT_SYMBOL(trace_hardirqs_off_caller
);
2302 void trace_hardirqs_off(void)
2304 trace_hardirqs_off_caller(CALLER_ADDR0
);
2306 EXPORT_SYMBOL(trace_hardirqs_off
);
2309 * Softirqs will be enabled:
2311 void trace_softirqs_on(unsigned long ip
)
2313 struct task_struct
*curr
= current
;
2315 if (unlikely(!debug_locks
))
2318 if (DEBUG_LOCKS_WARN_ON(!irqs_disabled()))
2321 if (curr
->softirqs_enabled
) {
2322 debug_atomic_inc(&redundant_softirqs_on
);
2327 * We'll do an OFF -> ON transition:
2329 curr
->softirqs_enabled
= 1;
2330 curr
->softirq_enable_ip
= ip
;
2331 curr
->softirq_enable_event
= ++curr
->irq_events
;
2332 debug_atomic_inc(&softirqs_on_events
);
2334 * We are going to turn softirqs on, so set the
2335 * usage bit for all held locks, if hardirqs are
2338 if (curr
->hardirqs_enabled
)
2339 mark_held_locks(curr
, SOFTIRQ
);
2343 * Softirqs were disabled:
2345 void trace_softirqs_off(unsigned long ip
)
2347 struct task_struct
*curr
= current
;
2349 if (unlikely(!debug_locks
))
2352 if (DEBUG_LOCKS_WARN_ON(!irqs_disabled()))
2355 if (curr
->softirqs_enabled
) {
2357 * We have done an ON -> OFF transition:
2359 curr
->softirqs_enabled
= 0;
2360 curr
->softirq_disable_ip
= ip
;
2361 curr
->softirq_disable_event
= ++curr
->irq_events
;
2362 debug_atomic_inc(&softirqs_off_events
);
2363 DEBUG_LOCKS_WARN_ON(!softirq_count());
2365 debug_atomic_inc(&redundant_softirqs_off
);
2368 static void __lockdep_trace_alloc(gfp_t gfp_mask
, unsigned long flags
)
2370 struct task_struct
*curr
= current
;
2372 if (unlikely(!debug_locks
))
2375 /* no reclaim without waiting on it */
2376 if (!(gfp_mask
& __GFP_WAIT
))
2379 /* this guy won't enter reclaim */
2380 if ((curr
->flags
& PF_MEMALLOC
) && !(gfp_mask
& __GFP_NOMEMALLOC
))
2383 /* We're only interested __GFP_FS allocations for now */
2384 if (!(gfp_mask
& __GFP_FS
))
2387 if (DEBUG_LOCKS_WARN_ON(irqs_disabled_flags(flags
)))
2390 mark_held_locks(curr
, RECLAIM_FS
);
2393 static void check_flags(unsigned long flags
);
2395 void lockdep_trace_alloc(gfp_t gfp_mask
)
2397 unsigned long flags
;
2399 if (unlikely(current
->lockdep_recursion
))
2402 raw_local_irq_save(flags
);
2404 current
->lockdep_recursion
= 1;
2405 __lockdep_trace_alloc(gfp_mask
, flags
);
2406 current
->lockdep_recursion
= 0;
2407 raw_local_irq_restore(flags
);
2410 static int mark_irqflags(struct task_struct
*curr
, struct held_lock
*hlock
)
2413 * If non-trylock use in a hardirq or softirq context, then
2414 * mark the lock as used in these contexts:
2416 if (!hlock
->trylock
) {
2418 if (curr
->hardirq_context
)
2419 if (!mark_lock(curr
, hlock
,
2420 LOCK_USED_IN_HARDIRQ_READ
))
2422 if (curr
->softirq_context
)
2423 if (!mark_lock(curr
, hlock
,
2424 LOCK_USED_IN_SOFTIRQ_READ
))
2427 if (curr
->hardirq_context
)
2428 if (!mark_lock(curr
, hlock
, LOCK_USED_IN_HARDIRQ
))
2430 if (curr
->softirq_context
)
2431 if (!mark_lock(curr
, hlock
, LOCK_USED_IN_SOFTIRQ
))
2435 if (!hlock
->hardirqs_off
) {
2437 if (!mark_lock(curr
, hlock
,
2438 LOCK_ENABLED_HARDIRQ_READ
))
2440 if (curr
->softirqs_enabled
)
2441 if (!mark_lock(curr
, hlock
,
2442 LOCK_ENABLED_SOFTIRQ_READ
))
2445 if (!mark_lock(curr
, hlock
,
2446 LOCK_ENABLED_HARDIRQ
))
2448 if (curr
->softirqs_enabled
)
2449 if (!mark_lock(curr
, hlock
,
2450 LOCK_ENABLED_SOFTIRQ
))
2456 * We reuse the irq context infrastructure more broadly as a general
2457 * context checking code. This tests GFP_FS recursion (a lock taken
2458 * during reclaim for a GFP_FS allocation is held over a GFP_FS
2461 if (!hlock
->trylock
&& (curr
->lockdep_reclaim_gfp
& __GFP_FS
)) {
2463 if (!mark_lock(curr
, hlock
, LOCK_USED_IN_RECLAIM_FS_READ
))
2466 if (!mark_lock(curr
, hlock
, LOCK_USED_IN_RECLAIM_FS
))
2474 static int separate_irq_context(struct task_struct
*curr
,
2475 struct held_lock
*hlock
)
2477 unsigned int depth
= curr
->lockdep_depth
;
2480 * Keep track of points where we cross into an interrupt context:
2482 hlock
->irq_context
= 2*(curr
->hardirq_context
? 1 : 0) +
2483 curr
->softirq_context
;
2485 struct held_lock
*prev_hlock
;
2487 prev_hlock
= curr
->held_locks
+ depth
-1;
2489 * If we cross into another context, reset the
2490 * hash key (this also prevents the checking and the
2491 * adding of the dependency to 'prev'):
2493 if (prev_hlock
->irq_context
!= hlock
->irq_context
)
2502 int mark_lock_irq(struct task_struct
*curr
, struct held_lock
*this,
2503 enum lock_usage_bit new_bit
)
2509 static inline int mark_irqflags(struct task_struct
*curr
,
2510 struct held_lock
*hlock
)
2515 static inline int separate_irq_context(struct task_struct
*curr
,
2516 struct held_lock
*hlock
)
2521 void lockdep_trace_alloc(gfp_t gfp_mask
)
2528 * Mark a lock with a usage bit, and validate the state transition:
2530 static int mark_lock(struct task_struct
*curr
, struct held_lock
*this,
2531 enum lock_usage_bit new_bit
)
2533 unsigned int new_mask
= 1 << new_bit
, ret
= 1;
2536 * If already set then do not dirty the cacheline,
2537 * nor do any checks:
2539 if (likely(hlock_class(this)->usage_mask
& new_mask
))
2545 * Make sure we didnt race:
2547 if (unlikely(hlock_class(this)->usage_mask
& new_mask
)) {
2552 hlock_class(this)->usage_mask
|= new_mask
;
2554 if (!save_trace(hlock_class(this)->usage_traces
+ new_bit
))
2558 #define LOCKDEP_STATE(__STATE) \
2559 case LOCK_USED_IN_##__STATE: \
2560 case LOCK_USED_IN_##__STATE##_READ: \
2561 case LOCK_ENABLED_##__STATE: \
2562 case LOCK_ENABLED_##__STATE##_READ:
2563 #include "lockdep_states.h"
2564 #undef LOCKDEP_STATE
2565 ret
= mark_lock_irq(curr
, this, new_bit
);
2570 debug_atomic_dec(&nr_unused_locks
);
2573 if (!debug_locks_off_graph_unlock())
2582 * We must printk outside of the graph_lock:
2585 printk("\nmarked lock as {%s}:\n", usage_str
[new_bit
]);
2587 print_irqtrace_events(curr
);
2595 * Initialize a lock instance's lock-class mapping info:
2597 void lockdep_init_map(struct lockdep_map
*lock
, const char *name
,
2598 struct lock_class_key
*key
, int subclass
)
2600 lock
->class_cache
= NULL
;
2601 #ifdef CONFIG_LOCK_STAT
2602 lock
->cpu
= raw_smp_processor_id();
2605 if (DEBUG_LOCKS_WARN_ON(!name
)) {
2606 lock
->name
= "NULL";
2612 if (DEBUG_LOCKS_WARN_ON(!key
))
2615 * Sanity check, the lock-class key must be persistent:
2617 if (!static_obj(key
)) {
2618 printk("BUG: key %p not in .data!\n", key
);
2619 DEBUG_LOCKS_WARN_ON(1);
2624 if (unlikely(!debug_locks
))
2628 register_lock_class(lock
, subclass
, 1);
2630 EXPORT_SYMBOL_GPL(lockdep_init_map
);
2633 * This gets called for every mutex_lock*()/spin_lock*() operation.
2634 * We maintain the dependency maps and validate the locking attempt:
2636 static int __lock_acquire(struct lockdep_map
*lock
, unsigned int subclass
,
2637 int trylock
, int read
, int check
, int hardirqs_off
,
2638 struct lockdep_map
*nest_lock
, unsigned long ip
)
2640 struct task_struct
*curr
= current
;
2641 struct lock_class
*class = NULL
;
2642 struct held_lock
*hlock
;
2643 unsigned int depth
, id
;
2650 if (unlikely(!debug_locks
))
2653 if (DEBUG_LOCKS_WARN_ON(!irqs_disabled()))
2656 if (unlikely(subclass
>= MAX_LOCKDEP_SUBCLASSES
)) {
2658 printk("BUG: MAX_LOCKDEP_SUBCLASSES too low!\n");
2659 printk("turning off the locking correctness validator.\n");
2665 class = lock
->class_cache
;
2667 * Not cached yet or subclass?
2669 if (unlikely(!class)) {
2670 class = register_lock_class(lock
, subclass
, 0);
2674 debug_atomic_inc((atomic_t
*)&class->ops
);
2675 if (very_verbose(class)) {
2676 printk("\nacquire class [%p] %s", class->key
, class->name
);
2677 if (class->name_version
> 1)
2678 printk("#%d", class->name_version
);
2684 * Add the lock to the list of currently held locks.
2685 * (we dont increase the depth just yet, up until the
2686 * dependency checks are done)
2688 depth
= curr
->lockdep_depth
;
2689 if (DEBUG_LOCKS_WARN_ON(depth
>= MAX_LOCK_DEPTH
))
2692 hlock
= curr
->held_locks
+ depth
;
2693 if (DEBUG_LOCKS_WARN_ON(!class))
2695 hlock
->class_idx
= class - lock_classes
+ 1;
2696 hlock
->acquire_ip
= ip
;
2697 hlock
->instance
= lock
;
2698 hlock
->nest_lock
= nest_lock
;
2699 hlock
->trylock
= trylock
;
2701 hlock
->check
= check
;
2702 hlock
->hardirqs_off
= !!hardirqs_off
;
2703 #ifdef CONFIG_LOCK_STAT
2704 hlock
->waittime_stamp
= 0;
2705 hlock
->holdtime_stamp
= sched_clock();
2708 if (check
== 2 && !mark_irqflags(curr
, hlock
))
2711 /* mark it as used: */
2712 if (!mark_lock(curr
, hlock
, LOCK_USED
))
2716 * Calculate the chain hash: it's the combined hash of all the
2717 * lock keys along the dependency chain. We save the hash value
2718 * at every step so that we can get the current hash easily
2719 * after unlock. The chain hash is then used to cache dependency
2722 * The 'key ID' is what is the most compact key value to drive
2723 * the hash, not class->key.
2725 id
= class - lock_classes
;
2726 if (DEBUG_LOCKS_WARN_ON(id
>= MAX_LOCKDEP_KEYS
))
2729 chain_key
= curr
->curr_chain_key
;
2731 if (DEBUG_LOCKS_WARN_ON(chain_key
!= 0))
2736 hlock
->prev_chain_key
= chain_key
;
2737 if (separate_irq_context(curr
, hlock
)) {
2741 chain_key
= iterate_chain_key(chain_key
, id
);
2743 if (!validate_chain(curr
, lock
, hlock
, chain_head
, chain_key
))
2746 curr
->curr_chain_key
= chain_key
;
2747 curr
->lockdep_depth
++;
2748 check_chain_key(curr
);
2749 #ifdef CONFIG_DEBUG_LOCKDEP
2750 if (unlikely(!debug_locks
))
2753 if (unlikely(curr
->lockdep_depth
>= MAX_LOCK_DEPTH
)) {
2755 printk("BUG: MAX_LOCK_DEPTH too low!\n");
2756 printk("turning off the locking correctness validator.\n");
2761 if (unlikely(curr
->lockdep_depth
> max_lockdep_depth
))
2762 max_lockdep_depth
= curr
->lockdep_depth
;
2768 print_unlock_inbalance_bug(struct task_struct
*curr
, struct lockdep_map
*lock
,
2771 if (!debug_locks_off())
2773 if (debug_locks_silent
)
2776 printk("\n=====================================\n");
2777 printk( "[ BUG: bad unlock balance detected! ]\n");
2778 printk( "-------------------------------------\n");
2779 printk("%s/%d is trying to release lock (",
2780 curr
->comm
, task_pid_nr(curr
));
2781 print_lockdep_cache(lock
);
2784 printk("but there are no more locks to release!\n");
2785 printk("\nother info that might help us debug this:\n");
2786 lockdep_print_held_locks(curr
);
2788 printk("\nstack backtrace:\n");
2795 * Common debugging checks for both nested and non-nested unlock:
2797 static int check_unlock(struct task_struct
*curr
, struct lockdep_map
*lock
,
2800 if (unlikely(!debug_locks
))
2802 if (DEBUG_LOCKS_WARN_ON(!irqs_disabled()))
2805 if (curr
->lockdep_depth
<= 0)
2806 return print_unlock_inbalance_bug(curr
, lock
, ip
);
2812 __lock_set_class(struct lockdep_map
*lock
, const char *name
,
2813 struct lock_class_key
*key
, unsigned int subclass
,
2816 struct task_struct
*curr
= current
;
2817 struct held_lock
*hlock
, *prev_hlock
;
2818 struct lock_class
*class;
2822 depth
= curr
->lockdep_depth
;
2823 if (DEBUG_LOCKS_WARN_ON(!depth
))
2827 for (i
= depth
-1; i
>= 0; i
--) {
2828 hlock
= curr
->held_locks
+ i
;
2830 * We must not cross into another context:
2832 if (prev_hlock
&& prev_hlock
->irq_context
!= hlock
->irq_context
)
2834 if (hlock
->instance
== lock
)
2838 return print_unlock_inbalance_bug(curr
, lock
, ip
);
2841 lockdep_init_map(lock
, name
, key
, 0);
2842 class = register_lock_class(lock
, subclass
, 0);
2843 hlock
->class_idx
= class - lock_classes
+ 1;
2845 curr
->lockdep_depth
= i
;
2846 curr
->curr_chain_key
= hlock
->prev_chain_key
;
2848 for (; i
< depth
; i
++) {
2849 hlock
= curr
->held_locks
+ i
;
2850 if (!__lock_acquire(hlock
->instance
,
2851 hlock_class(hlock
)->subclass
, hlock
->trylock
,
2852 hlock
->read
, hlock
->check
, hlock
->hardirqs_off
,
2853 hlock
->nest_lock
, hlock
->acquire_ip
))
2857 if (DEBUG_LOCKS_WARN_ON(curr
->lockdep_depth
!= depth
))
2863 * Remove the lock to the list of currently held locks in a
2864 * potentially non-nested (out of order) manner. This is a
2865 * relatively rare operation, as all the unlock APIs default
2866 * to nested mode (which uses lock_release()):
2869 lock_release_non_nested(struct task_struct
*curr
,
2870 struct lockdep_map
*lock
, unsigned long ip
)
2872 struct held_lock
*hlock
, *prev_hlock
;
2877 * Check whether the lock exists in the current stack
2880 depth
= curr
->lockdep_depth
;
2881 if (DEBUG_LOCKS_WARN_ON(!depth
))
2885 for (i
= depth
-1; i
>= 0; i
--) {
2886 hlock
= curr
->held_locks
+ i
;
2888 * We must not cross into another context:
2890 if (prev_hlock
&& prev_hlock
->irq_context
!= hlock
->irq_context
)
2892 if (hlock
->instance
== lock
)
2896 return print_unlock_inbalance_bug(curr
, lock
, ip
);
2899 lock_release_holdtime(hlock
);
2902 * We have the right lock to unlock, 'hlock' points to it.
2903 * Now we remove it from the stack, and add back the other
2904 * entries (if any), recalculating the hash along the way:
2906 curr
->lockdep_depth
= i
;
2907 curr
->curr_chain_key
= hlock
->prev_chain_key
;
2909 for (i
++; i
< depth
; i
++) {
2910 hlock
= curr
->held_locks
+ i
;
2911 if (!__lock_acquire(hlock
->instance
,
2912 hlock_class(hlock
)->subclass
, hlock
->trylock
,
2913 hlock
->read
, hlock
->check
, hlock
->hardirqs_off
,
2914 hlock
->nest_lock
, hlock
->acquire_ip
))
2918 if (DEBUG_LOCKS_WARN_ON(curr
->lockdep_depth
!= depth
- 1))
2924 * Remove the lock to the list of currently held locks - this gets
2925 * called on mutex_unlock()/spin_unlock*() (or on a failed
2926 * mutex_lock_interruptible()). This is done for unlocks that nest
2927 * perfectly. (i.e. the current top of the lock-stack is unlocked)
2929 static int lock_release_nested(struct task_struct
*curr
,
2930 struct lockdep_map
*lock
, unsigned long ip
)
2932 struct held_lock
*hlock
;
2936 * Pop off the top of the lock stack:
2938 depth
= curr
->lockdep_depth
- 1;
2939 hlock
= curr
->held_locks
+ depth
;
2942 * Is the unlock non-nested:
2944 if (hlock
->instance
!= lock
)
2945 return lock_release_non_nested(curr
, lock
, ip
);
2946 curr
->lockdep_depth
--;
2948 if (DEBUG_LOCKS_WARN_ON(!depth
&& (hlock
->prev_chain_key
!= 0)))
2951 curr
->curr_chain_key
= hlock
->prev_chain_key
;
2953 lock_release_holdtime(hlock
);
2955 #ifdef CONFIG_DEBUG_LOCKDEP
2956 hlock
->prev_chain_key
= 0;
2957 hlock
->class_idx
= 0;
2958 hlock
->acquire_ip
= 0;
2959 hlock
->irq_context
= 0;
2965 * Remove the lock to the list of currently held locks - this gets
2966 * called on mutex_unlock()/spin_unlock*() (or on a failed
2967 * mutex_lock_interruptible()). This is done for unlocks that nest
2968 * perfectly. (i.e. the current top of the lock-stack is unlocked)
2971 __lock_release(struct lockdep_map
*lock
, int nested
, unsigned long ip
)
2973 struct task_struct
*curr
= current
;
2975 if (!check_unlock(curr
, lock
, ip
))
2979 if (!lock_release_nested(curr
, lock
, ip
))
2982 if (!lock_release_non_nested(curr
, lock
, ip
))
2986 check_chain_key(curr
);
2990 * Check whether we follow the irq-flags state precisely:
2992 static void check_flags(unsigned long flags
)
2994 #if defined(CONFIG_PROVE_LOCKING) && defined(CONFIG_DEBUG_LOCKDEP) && \
2995 defined(CONFIG_TRACE_IRQFLAGS)
2999 if (irqs_disabled_flags(flags
)) {
3000 if (DEBUG_LOCKS_WARN_ON(current
->hardirqs_enabled
)) {
3001 printk("possible reason: unannotated irqs-off.\n");
3004 if (DEBUG_LOCKS_WARN_ON(!current
->hardirqs_enabled
)) {
3005 printk("possible reason: unannotated irqs-on.\n");
3010 * We dont accurately track softirq state in e.g.
3011 * hardirq contexts (such as on 4KSTACKS), so only
3012 * check if not in hardirq contexts:
3014 if (!hardirq_count()) {
3015 if (softirq_count())
3016 DEBUG_LOCKS_WARN_ON(current
->softirqs_enabled
);
3018 DEBUG_LOCKS_WARN_ON(!current
->softirqs_enabled
);
3022 print_irqtrace_events(current
);
3026 void lock_set_class(struct lockdep_map
*lock
, const char *name
,
3027 struct lock_class_key
*key
, unsigned int subclass
,
3030 unsigned long flags
;
3032 if (unlikely(current
->lockdep_recursion
))
3035 raw_local_irq_save(flags
);
3036 current
->lockdep_recursion
= 1;
3038 if (__lock_set_class(lock
, name
, key
, subclass
, ip
))
3039 check_chain_key(current
);
3040 current
->lockdep_recursion
= 0;
3041 raw_local_irq_restore(flags
);
3043 EXPORT_SYMBOL_GPL(lock_set_class
);
3046 * We are not always called with irqs disabled - do that here,
3047 * and also avoid lockdep recursion:
3049 void lock_acquire(struct lockdep_map
*lock
, unsigned int subclass
,
3050 int trylock
, int read
, int check
,
3051 struct lockdep_map
*nest_lock
, unsigned long ip
)
3053 unsigned long flags
;
3055 trace_lock_acquire(lock
, subclass
, trylock
, read
, check
, nest_lock
, ip
);
3057 if (unlikely(current
->lockdep_recursion
))
3060 raw_local_irq_save(flags
);
3063 current
->lockdep_recursion
= 1;
3064 __lock_acquire(lock
, subclass
, trylock
, read
, check
,
3065 irqs_disabled_flags(flags
), nest_lock
, ip
);
3066 current
->lockdep_recursion
= 0;
3067 raw_local_irq_restore(flags
);
3069 EXPORT_SYMBOL_GPL(lock_acquire
);
3071 void lock_release(struct lockdep_map
*lock
, int nested
,
3074 unsigned long flags
;
3076 trace_lock_release(lock
, nested
, ip
);
3078 if (unlikely(current
->lockdep_recursion
))
3081 raw_local_irq_save(flags
);
3083 current
->lockdep_recursion
= 1;
3084 __lock_release(lock
, nested
, ip
);
3085 current
->lockdep_recursion
= 0;
3086 raw_local_irq_restore(flags
);
3088 EXPORT_SYMBOL_GPL(lock_release
);
3090 void lockdep_set_current_reclaim_state(gfp_t gfp_mask
)
3092 current
->lockdep_reclaim_gfp
= gfp_mask
;
3095 void lockdep_clear_current_reclaim_state(void)
3097 current
->lockdep_reclaim_gfp
= 0;
3100 #ifdef CONFIG_LOCK_STAT
3102 print_lock_contention_bug(struct task_struct
*curr
, struct lockdep_map
*lock
,
3105 if (!debug_locks_off())
3107 if (debug_locks_silent
)
3110 printk("\n=================================\n");
3111 printk( "[ BUG: bad contention detected! ]\n");
3112 printk( "---------------------------------\n");
3113 printk("%s/%d is trying to contend lock (",
3114 curr
->comm
, task_pid_nr(curr
));
3115 print_lockdep_cache(lock
);
3118 printk("but there are no locks held!\n");
3119 printk("\nother info that might help us debug this:\n");
3120 lockdep_print_held_locks(curr
);
3122 printk("\nstack backtrace:\n");
3129 __lock_contended(struct lockdep_map
*lock
, unsigned long ip
)
3131 struct task_struct
*curr
= current
;
3132 struct held_lock
*hlock
, *prev_hlock
;
3133 struct lock_class_stats
*stats
;
3135 int i
, contention_point
, contending_point
;
3137 depth
= curr
->lockdep_depth
;
3138 if (DEBUG_LOCKS_WARN_ON(!depth
))
3142 for (i
= depth
-1; i
>= 0; i
--) {
3143 hlock
= curr
->held_locks
+ i
;
3145 * We must not cross into another context:
3147 if (prev_hlock
&& prev_hlock
->irq_context
!= hlock
->irq_context
)
3149 if (hlock
->instance
== lock
)
3153 print_lock_contention_bug(curr
, lock
, ip
);
3157 hlock
->waittime_stamp
= sched_clock();
3159 contention_point
= lock_point(hlock_class(hlock
)->contention_point
, ip
);
3160 contending_point
= lock_point(hlock_class(hlock
)->contending_point
,
3163 stats
= get_lock_stats(hlock_class(hlock
));
3164 if (contention_point
< LOCKSTAT_POINTS
)
3165 stats
->contention_point
[contention_point
]++;
3166 if (contending_point
< LOCKSTAT_POINTS
)
3167 stats
->contending_point
[contending_point
]++;
3168 if (lock
->cpu
!= smp_processor_id())
3169 stats
->bounces
[bounce_contended
+ !!hlock
->read
]++;
3170 put_lock_stats(stats
);
3174 __lock_acquired(struct lockdep_map
*lock
, unsigned long ip
)
3176 struct task_struct
*curr
= current
;
3177 struct held_lock
*hlock
, *prev_hlock
;
3178 struct lock_class_stats
*stats
;
3184 depth
= curr
->lockdep_depth
;
3185 if (DEBUG_LOCKS_WARN_ON(!depth
))
3189 for (i
= depth
-1; i
>= 0; i
--) {
3190 hlock
= curr
->held_locks
+ i
;
3192 * We must not cross into another context:
3194 if (prev_hlock
&& prev_hlock
->irq_context
!= hlock
->irq_context
)
3196 if (hlock
->instance
== lock
)
3200 print_lock_contention_bug(curr
, lock
, _RET_IP_
);
3204 cpu
= smp_processor_id();
3205 if (hlock
->waittime_stamp
) {
3206 now
= sched_clock();
3207 waittime
= now
- hlock
->waittime_stamp
;
3208 hlock
->holdtime_stamp
= now
;
3211 trace_lock_acquired(lock
, ip
, waittime
);
3213 stats
= get_lock_stats(hlock_class(hlock
));
3216 lock_time_inc(&stats
->read_waittime
, waittime
);
3218 lock_time_inc(&stats
->write_waittime
, waittime
);
3220 if (lock
->cpu
!= cpu
)
3221 stats
->bounces
[bounce_acquired
+ !!hlock
->read
]++;
3222 put_lock_stats(stats
);
3228 void lock_contended(struct lockdep_map
*lock
, unsigned long ip
)
3230 unsigned long flags
;
3232 trace_lock_contended(lock
, ip
);
3234 if (unlikely(!lock_stat
))
3237 if (unlikely(current
->lockdep_recursion
))
3240 raw_local_irq_save(flags
);
3242 current
->lockdep_recursion
= 1;
3243 __lock_contended(lock
, ip
);
3244 current
->lockdep_recursion
= 0;
3245 raw_local_irq_restore(flags
);
3247 EXPORT_SYMBOL_GPL(lock_contended
);
3249 void lock_acquired(struct lockdep_map
*lock
, unsigned long ip
)
3251 unsigned long flags
;
3253 if (unlikely(!lock_stat
))
3256 if (unlikely(current
->lockdep_recursion
))
3259 raw_local_irq_save(flags
);
3261 current
->lockdep_recursion
= 1;
3262 __lock_acquired(lock
, ip
);
3263 current
->lockdep_recursion
= 0;
3264 raw_local_irq_restore(flags
);
3266 EXPORT_SYMBOL_GPL(lock_acquired
);
3270 * Used by the testsuite, sanitize the validator state
3271 * after a simulated failure:
3274 void lockdep_reset(void)
3276 unsigned long flags
;
3279 raw_local_irq_save(flags
);
3280 current
->curr_chain_key
= 0;
3281 current
->lockdep_depth
= 0;
3282 current
->lockdep_recursion
= 0;
3283 memset(current
->held_locks
, 0, MAX_LOCK_DEPTH
*sizeof(struct held_lock
));
3284 nr_hardirq_chains
= 0;
3285 nr_softirq_chains
= 0;
3286 nr_process_chains
= 0;
3288 for (i
= 0; i
< CHAINHASH_SIZE
; i
++)
3289 INIT_LIST_HEAD(chainhash_table
+ i
);
3290 raw_local_irq_restore(flags
);
3293 static void zap_class(struct lock_class
*class)
3298 * Remove all dependencies this lock is
3301 for (i
= 0; i
< nr_list_entries
; i
++) {
3302 if (list_entries
[i
].class == class)
3303 list_del_rcu(&list_entries
[i
].entry
);
3306 * Unhash the class and remove it from the all_lock_classes list:
3308 list_del_rcu(&class->hash_entry
);
3309 list_del_rcu(&class->lock_entry
);
3314 static inline int within(const void *addr
, void *start
, unsigned long size
)
3316 return addr
>= start
&& addr
< start
+ size
;
3319 void lockdep_free_key_range(void *start
, unsigned long size
)
3321 struct lock_class
*class, *next
;
3322 struct list_head
*head
;
3323 unsigned long flags
;
3327 raw_local_irq_save(flags
);
3328 locked
= graph_lock();
3331 * Unhash all classes that were created by this module:
3333 for (i
= 0; i
< CLASSHASH_SIZE
; i
++) {
3334 head
= classhash_table
+ i
;
3335 if (list_empty(head
))
3337 list_for_each_entry_safe(class, next
, head
, hash_entry
) {
3338 if (within(class->key
, start
, size
))
3340 else if (within(class->name
, start
, size
))
3347 raw_local_irq_restore(flags
);
3350 void lockdep_reset_lock(struct lockdep_map
*lock
)
3352 struct lock_class
*class, *next
;
3353 struct list_head
*head
;
3354 unsigned long flags
;
3358 raw_local_irq_save(flags
);
3361 * Remove all classes this lock might have:
3363 for (j
= 0; j
< MAX_LOCKDEP_SUBCLASSES
; j
++) {
3365 * If the class exists we look it up and zap it:
3367 class = look_up_lock_class(lock
, j
);
3372 * Debug check: in the end all mapped classes should
3375 locked
= graph_lock();
3376 for (i
= 0; i
< CLASSHASH_SIZE
; i
++) {
3377 head
= classhash_table
+ i
;
3378 if (list_empty(head
))
3380 list_for_each_entry_safe(class, next
, head
, hash_entry
) {
3381 if (unlikely(class == lock
->class_cache
)) {
3382 if (debug_locks_off_graph_unlock())
3392 raw_local_irq_restore(flags
);
3395 void lockdep_init(void)
3400 * Some architectures have their own start_kernel()
3401 * code which calls lockdep_init(), while we also
3402 * call lockdep_init() from the start_kernel() itself,
3403 * and we want to initialize the hashes only once:
3405 if (lockdep_initialized
)
3408 for (i
= 0; i
< CLASSHASH_SIZE
; i
++)
3409 INIT_LIST_HEAD(classhash_table
+ i
);
3411 for (i
= 0; i
< CHAINHASH_SIZE
; i
++)
3412 INIT_LIST_HEAD(chainhash_table
+ i
);
3414 lockdep_initialized
= 1;
3417 void __init
lockdep_info(void)
3419 printk("Lock dependency validator: Copyright (c) 2006 Red Hat, Inc., Ingo Molnar\n");
3421 printk("... MAX_LOCKDEP_SUBCLASSES: %lu\n", MAX_LOCKDEP_SUBCLASSES
);
3422 printk("... MAX_LOCK_DEPTH: %lu\n", MAX_LOCK_DEPTH
);
3423 printk("... MAX_LOCKDEP_KEYS: %lu\n", MAX_LOCKDEP_KEYS
);
3424 printk("... CLASSHASH_SIZE: %lu\n", CLASSHASH_SIZE
);
3425 printk("... MAX_LOCKDEP_ENTRIES: %lu\n", MAX_LOCKDEP_ENTRIES
);
3426 printk("... MAX_LOCKDEP_CHAINS: %lu\n", MAX_LOCKDEP_CHAINS
);
3427 printk("... CHAINHASH_SIZE: %lu\n", CHAINHASH_SIZE
);
3429 printk(" memory used by lock dependency info: %lu kB\n",
3430 (sizeof(struct lock_class
) * MAX_LOCKDEP_KEYS
+
3431 sizeof(struct list_head
) * CLASSHASH_SIZE
+
3432 sizeof(struct lock_list
) * MAX_LOCKDEP_ENTRIES
+
3433 sizeof(struct lock_chain
) * MAX_LOCKDEP_CHAINS
+
3434 sizeof(struct list_head
) * CHAINHASH_SIZE
) / 1024);
3436 printk(" per task-struct memory footprint: %lu bytes\n",
3437 sizeof(struct held_lock
) * MAX_LOCK_DEPTH
);
3439 #ifdef CONFIG_DEBUG_LOCKDEP
3440 if (lockdep_init_error
) {
3441 printk("WARNING: lockdep init error! Arch code didn't call lockdep_init() early enough?\n");
3442 printk("Call stack leading to lockdep invocation was:\n");
3443 print_stack_trace(&lockdep_init_trace
, 0);
3449 print_freed_lock_bug(struct task_struct
*curr
, const void *mem_from
,
3450 const void *mem_to
, struct held_lock
*hlock
)
3452 if (!debug_locks_off())
3454 if (debug_locks_silent
)
3457 printk("\n=========================\n");
3458 printk( "[ BUG: held lock freed! ]\n");
3459 printk( "-------------------------\n");
3460 printk("%s/%d is freeing memory %p-%p, with a lock still held there!\n",
3461 curr
->comm
, task_pid_nr(curr
), mem_from
, mem_to
-1);
3463 lockdep_print_held_locks(curr
);
3465 printk("\nstack backtrace:\n");
3469 static inline int not_in_range(const void* mem_from
, unsigned long mem_len
,
3470 const void* lock_from
, unsigned long lock_len
)
3472 return lock_from
+ lock_len
<= mem_from
||
3473 mem_from
+ mem_len
<= lock_from
;
3477 * Called when kernel memory is freed (or unmapped), or if a lock
3478 * is destroyed or reinitialized - this code checks whether there is
3479 * any held lock in the memory range of <from> to <to>:
3481 void debug_check_no_locks_freed(const void *mem_from
, unsigned long mem_len
)
3483 struct task_struct
*curr
= current
;
3484 struct held_lock
*hlock
;
3485 unsigned long flags
;
3488 if (unlikely(!debug_locks
))
3491 local_irq_save(flags
);
3492 for (i
= 0; i
< curr
->lockdep_depth
; i
++) {
3493 hlock
= curr
->held_locks
+ i
;
3495 if (not_in_range(mem_from
, mem_len
, hlock
->instance
,
3496 sizeof(*hlock
->instance
)))
3499 print_freed_lock_bug(curr
, mem_from
, mem_from
+ mem_len
, hlock
);
3502 local_irq_restore(flags
);
3504 EXPORT_SYMBOL_GPL(debug_check_no_locks_freed
);
3506 static void print_held_locks_bug(struct task_struct
*curr
)
3508 if (!debug_locks_off())
3510 if (debug_locks_silent
)
3513 printk("\n=====================================\n");
3514 printk( "[ BUG: lock held at task exit time! ]\n");
3515 printk( "-------------------------------------\n");
3516 printk("%s/%d is exiting with locks still held!\n",
3517 curr
->comm
, task_pid_nr(curr
));
3518 lockdep_print_held_locks(curr
);
3520 printk("\nstack backtrace:\n");
3524 void debug_check_no_locks_held(struct task_struct
*task
)
3526 if (unlikely(task
->lockdep_depth
> 0))
3527 print_held_locks_bug(task
);
3530 void debug_show_all_locks(void)
3532 struct task_struct
*g
, *p
;
3536 if (unlikely(!debug_locks
)) {
3537 printk("INFO: lockdep is turned off.\n");
3540 printk("\nShowing all locks held in the system:\n");
3543 * Here we try to get the tasklist_lock as hard as possible,
3544 * if not successful after 2 seconds we ignore it (but keep
3545 * trying). This is to enable a debug printout even if a
3546 * tasklist_lock-holding task deadlocks or crashes.
3549 if (!read_trylock(&tasklist_lock
)) {
3551 printk("hm, tasklist_lock locked, retrying... ");
3554 printk(" #%d", 10-count
);
3558 printk(" ignoring it.\n");
3562 printk(KERN_CONT
" locked it.\n");
3565 do_each_thread(g
, p
) {
3567 * It's not reliable to print a task's held locks
3568 * if it's not sleeping (or if it's not the current
3571 if (p
->state
== TASK_RUNNING
&& p
!= current
)
3573 if (p
->lockdep_depth
)
3574 lockdep_print_held_locks(p
);
3576 if (read_trylock(&tasklist_lock
))
3578 } while_each_thread(g
, p
);
3581 printk("=============================================\n\n");
3584 read_unlock(&tasklist_lock
);
3586 EXPORT_SYMBOL_GPL(debug_show_all_locks
);
3589 * Careful: only use this function if you are sure that
3590 * the task cannot run in parallel!
3592 void __debug_show_held_locks(struct task_struct
*task
)
3594 if (unlikely(!debug_locks
)) {
3595 printk("INFO: lockdep is turned off.\n");
3598 lockdep_print_held_locks(task
);
3600 EXPORT_SYMBOL_GPL(__debug_show_held_locks
);
3602 void debug_show_held_locks(struct task_struct
*task
)
3604 __debug_show_held_locks(task
);
3606 EXPORT_SYMBOL_GPL(debug_show_held_locks
);
3608 void lockdep_sys_exit(void)
3610 struct task_struct
*curr
= current
;
3612 if (unlikely(curr
->lockdep_depth
)) {
3613 if (!debug_locks_off())
3615 printk("\n================================================\n");
3616 printk( "[ BUG: lock held when returning to user space! ]\n");
3617 printk( "------------------------------------------------\n");
3618 printk("%s/%d is leaving the kernel with locks still held!\n",
3619 curr
->comm
, curr
->pid
);
3620 lockdep_print_held_locks(curr
);