Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
fbb9ce95 IM |
2 | /* |
3 | * kernel/lockdep.c | |
4 | * | |
5 | * Runtime locking correctness validator | |
6 | * | |
7 | * Started by Ingo Molnar: | |
8 | * | |
4b32d0a4 | 9 | * Copyright (C) 2006,2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com> |
90eec103 | 10 | * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra |
fbb9ce95 IM |
11 | * |
12 | * this code maps all the lock dependencies as they occur in a live kernel | |
13 | * and will warn about the following classes of locking bugs: | |
14 | * | |
15 | * - lock inversion scenarios | |
16 | * - circular lock dependencies | |
17 | * - hardirq/softirq safe/unsafe locking bugs | |
18 | * | |
19 | * Bugs are reported even if the current locking scenario does not cause | |
20 | * any deadlock at this point. | |
21 | * | |
22 | * I.e. if anytime in the past two locks were taken in a different order, | |
23 | * even if it happened for another task, even if those were different | |
24 | * locks (but of the same class as this lock), this code will detect it. | |
25 | * | |
26 | * Thanks to Arjan van de Ven for coming up with the initial idea of | |
27 | * mapping lock dependencies runtime. | |
28 | */ | |
a5e25883 | 29 | #define DISABLE_BRANCH_PROFILING |
fbb9ce95 IM |
30 | #include <linux/mutex.h> |
31 | #include <linux/sched.h> | |
e6017571 | 32 | #include <linux/sched/clock.h> |
29930025 | 33 | #include <linux/sched/task.h> |
6d7225f0 | 34 | #include <linux/sched/mm.h> |
fbb9ce95 IM |
35 | #include <linux/delay.h> |
36 | #include <linux/module.h> | |
37 | #include <linux/proc_fs.h> | |
38 | #include <linux/seq_file.h> | |
39 | #include <linux/spinlock.h> | |
40 | #include <linux/kallsyms.h> | |
41 | #include <linux/interrupt.h> | |
42 | #include <linux/stacktrace.h> | |
43 | #include <linux/debug_locks.h> | |
44 | #include <linux/irqflags.h> | |
99de055a | 45 | #include <linux/utsname.h> |
4b32d0a4 | 46 | #include <linux/hash.h> |
81d68a96 | 47 | #include <linux/ftrace.h> |
b4b136f4 | 48 | #include <linux/stringify.h> |
ace35a7a | 49 | #include <linux/bitmap.h> |
d588e461 | 50 | #include <linux/bitops.h> |
5a0e3ad6 | 51 | #include <linux/gfp.h> |
e7904a28 | 52 | #include <linux/random.h> |
dfaaf3fa | 53 | #include <linux/jhash.h> |
88f1c87d | 54 | #include <linux/nmi.h> |
a0b0fd53 | 55 | #include <linux/rcupdate.h> |
2f43c602 | 56 | #include <linux/kprobes.h> |
af012961 | 57 | |
fbb9ce95 IM |
58 | #include <asm/sections.h> |
59 | ||
60 | #include "lockdep_internals.h" | |
61 | ||
a8d154b0 | 62 | #define CREATE_TRACE_POINTS |
67178767 | 63 | #include <trace/events/lock.h> |
a8d154b0 | 64 | |
f20786ff PZ |
65 | #ifdef CONFIG_PROVE_LOCKING |
66 | int prove_locking = 1; | |
67 | module_param(prove_locking, int, 0644); | |
68 | #else | |
69 | #define prove_locking 0 | |
70 | #endif | |
71 | ||
72 | #ifdef CONFIG_LOCK_STAT | |
73 | int lock_stat = 1; | |
74 | module_param(lock_stat, int, 0644); | |
75 | #else | |
76 | #define lock_stat 0 | |
77 | #endif | |
78 | ||
fbb9ce95 | 79 | /* |
74c383f1 IM |
80 | * lockdep_lock: protects the lockdep graph, the hashes and the |
81 | * class/list/hash allocators. | |
fbb9ce95 IM |
82 | * |
83 | * This is one of the rare exceptions where it's justified | |
84 | * to use a raw spinlock - we really dont want the spinlock | |
74c383f1 | 85 | * code to recurse back into the lockdep code... |
fbb9ce95 | 86 | */ |
edc35bd7 | 87 | static arch_spinlock_t lockdep_lock = (arch_spinlock_t)__ARCH_SPIN_LOCK_UNLOCKED; |
cdc84d79 | 88 | static struct task_struct *lockdep_selftest_task_struct; |
74c383f1 IM |
89 | |
90 | static int graph_lock(void) | |
91 | { | |
0199c4e6 | 92 | arch_spin_lock(&lockdep_lock); |
74c383f1 IM |
93 | /* |
94 | * Make sure that if another CPU detected a bug while | |
95 | * walking the graph we dont change it (while the other | |
96 | * CPU is busy printing out stuff with the graph lock | |
97 | * dropped already) | |
98 | */ | |
99 | if (!debug_locks) { | |
0199c4e6 | 100 | arch_spin_unlock(&lockdep_lock); |
74c383f1 IM |
101 | return 0; |
102 | } | |
bb065afb SR |
103 | /* prevent any recursions within lockdep from causing deadlocks */ |
104 | current->lockdep_recursion++; | |
74c383f1 IM |
105 | return 1; |
106 | } | |
107 | ||
108 | static inline int graph_unlock(void) | |
109 | { | |
0119fee4 PZ |
110 | if (debug_locks && !arch_spin_is_locked(&lockdep_lock)) { |
111 | /* | |
112 | * The lockdep graph lock isn't locked while we expect it to | |
113 | * be, we're confused now, bye! | |
114 | */ | |
381a2292 | 115 | return DEBUG_LOCKS_WARN_ON(1); |
0119fee4 | 116 | } |
381a2292 | 117 | |
bb065afb | 118 | current->lockdep_recursion--; |
0199c4e6 | 119 | arch_spin_unlock(&lockdep_lock); |
74c383f1 IM |
120 | return 0; |
121 | } | |
122 | ||
123 | /* | |
124 | * Turn lock debugging off and return with 0 if it was off already, | |
125 | * and also release the graph lock: | |
126 | */ | |
127 | static inline int debug_locks_off_graph_unlock(void) | |
128 | { | |
129 | int ret = debug_locks_off(); | |
130 | ||
0199c4e6 | 131 | arch_spin_unlock(&lockdep_lock); |
74c383f1 IM |
132 | |
133 | return ret; | |
134 | } | |
fbb9ce95 | 135 | |
fbb9ce95 | 136 | unsigned long nr_list_entries; |
af012961 | 137 | static struct lock_list list_entries[MAX_LOCKDEP_ENTRIES]; |
ace35a7a | 138 | static DECLARE_BITMAP(list_entries_in_use, MAX_LOCKDEP_ENTRIES); |
fbb9ce95 | 139 | |
fbb9ce95 IM |
140 | /* |
141 | * All data structures here are protected by the global debug_lock. | |
142 | * | |
a0b0fd53 BVA |
143 | * nr_lock_classes is the number of elements of lock_classes[] that is |
144 | * in use. | |
fbb9ce95 | 145 | */ |
108c1485 BVA |
146 | #define KEYHASH_BITS (MAX_LOCKDEP_KEYS_BITS - 1) |
147 | #define KEYHASH_SIZE (1UL << KEYHASH_BITS) | |
148 | static struct hlist_head lock_keys_hash[KEYHASH_SIZE]; | |
fbb9ce95 | 149 | unsigned long nr_lock_classes; |
1431a5d2 BVA |
150 | #ifndef CONFIG_DEBUG_LOCKDEP |
151 | static | |
152 | #endif | |
8ca2b56c | 153 | struct lock_class lock_classes[MAX_LOCKDEP_KEYS]; |
01bb6f0a | 154 | static DECLARE_BITMAP(lock_classes_in_use, MAX_LOCKDEP_KEYS); |
fbb9ce95 | 155 | |
f82b217e DJ |
156 | static inline struct lock_class *hlock_class(struct held_lock *hlock) |
157 | { | |
01bb6f0a YD |
158 | unsigned int class_idx = hlock->class_idx; |
159 | ||
160 | /* Don't re-read hlock->class_idx, can't use READ_ONCE() on bitfield */ | |
161 | barrier(); | |
162 | ||
163 | if (!test_bit(class_idx, lock_classes_in_use)) { | |
0119fee4 PZ |
164 | /* |
165 | * Someone passed in garbage, we give up. | |
166 | */ | |
f82b217e DJ |
167 | DEBUG_LOCKS_WARN_ON(1); |
168 | return NULL; | |
169 | } | |
01bb6f0a YD |
170 | |
171 | /* | |
172 | * At this point, if the passed hlock->class_idx is still garbage, | |
173 | * we just have to live with it | |
174 | */ | |
175 | return lock_classes + class_idx; | |
f82b217e DJ |
176 | } |
177 | ||
f20786ff | 178 | #ifdef CONFIG_LOCK_STAT |
25528213 | 179 | static DEFINE_PER_CPU(struct lock_class_stats[MAX_LOCKDEP_KEYS], cpu_lock_stats); |
f20786ff | 180 | |
3365e779 PZ |
181 | static inline u64 lockstat_clock(void) |
182 | { | |
c676329a | 183 | return local_clock(); |
3365e779 PZ |
184 | } |
185 | ||
c7e78cff | 186 | static int lock_point(unsigned long points[], unsigned long ip) |
f20786ff PZ |
187 | { |
188 | int i; | |
189 | ||
c7e78cff PZ |
190 | for (i = 0; i < LOCKSTAT_POINTS; i++) { |
191 | if (points[i] == 0) { | |
192 | points[i] = ip; | |
f20786ff PZ |
193 | break; |
194 | } | |
c7e78cff | 195 | if (points[i] == ip) |
f20786ff PZ |
196 | break; |
197 | } | |
198 | ||
199 | return i; | |
200 | } | |
201 | ||
3365e779 | 202 | static void lock_time_inc(struct lock_time *lt, u64 time) |
f20786ff PZ |
203 | { |
204 | if (time > lt->max) | |
205 | lt->max = time; | |
206 | ||
109d71c6 | 207 | if (time < lt->min || !lt->nr) |
f20786ff PZ |
208 | lt->min = time; |
209 | ||
210 | lt->total += time; | |
211 | lt->nr++; | |
212 | } | |
213 | ||
c46261de PZ |
214 | static inline void lock_time_add(struct lock_time *src, struct lock_time *dst) |
215 | { | |
109d71c6 FR |
216 | if (!src->nr) |
217 | return; | |
218 | ||
219 | if (src->max > dst->max) | |
220 | dst->max = src->max; | |
221 | ||
222 | if (src->min < dst->min || !dst->nr) | |
223 | dst->min = src->min; | |
224 | ||
c46261de PZ |
225 | dst->total += src->total; |
226 | dst->nr += src->nr; | |
227 | } | |
228 | ||
229 | struct lock_class_stats lock_stats(struct lock_class *class) | |
230 | { | |
231 | struct lock_class_stats stats; | |
232 | int cpu, i; | |
233 | ||
234 | memset(&stats, 0, sizeof(struct lock_class_stats)); | |
235 | for_each_possible_cpu(cpu) { | |
236 | struct lock_class_stats *pcs = | |
1871e52c | 237 | &per_cpu(cpu_lock_stats, cpu)[class - lock_classes]; |
c46261de PZ |
238 | |
239 | for (i = 0; i < ARRAY_SIZE(stats.contention_point); i++) | |
240 | stats.contention_point[i] += pcs->contention_point[i]; | |
241 | ||
c7e78cff PZ |
242 | for (i = 0; i < ARRAY_SIZE(stats.contending_point); i++) |
243 | stats.contending_point[i] += pcs->contending_point[i]; | |
244 | ||
c46261de PZ |
245 | lock_time_add(&pcs->read_waittime, &stats.read_waittime); |
246 | lock_time_add(&pcs->write_waittime, &stats.write_waittime); | |
247 | ||
248 | lock_time_add(&pcs->read_holdtime, &stats.read_holdtime); | |
249 | lock_time_add(&pcs->write_holdtime, &stats.write_holdtime); | |
96645678 PZ |
250 | |
251 | for (i = 0; i < ARRAY_SIZE(stats.bounces); i++) | |
252 | stats.bounces[i] += pcs->bounces[i]; | |
c46261de PZ |
253 | } |
254 | ||
255 | return stats; | |
256 | } | |
257 | ||
258 | void clear_lock_stats(struct lock_class *class) | |
259 | { | |
260 | int cpu; | |
261 | ||
262 | for_each_possible_cpu(cpu) { | |
263 | struct lock_class_stats *cpu_stats = | |
1871e52c | 264 | &per_cpu(cpu_lock_stats, cpu)[class - lock_classes]; |
c46261de PZ |
265 | |
266 | memset(cpu_stats, 0, sizeof(struct lock_class_stats)); | |
267 | } | |
268 | memset(class->contention_point, 0, sizeof(class->contention_point)); | |
c7e78cff | 269 | memset(class->contending_point, 0, sizeof(class->contending_point)); |
c46261de PZ |
270 | } |
271 | ||
f20786ff PZ |
272 | static struct lock_class_stats *get_lock_stats(struct lock_class *class) |
273 | { | |
01f38497 | 274 | return &this_cpu_ptr(cpu_lock_stats)[class - lock_classes]; |
f20786ff PZ |
275 | } |
276 | ||
277 | static void lock_release_holdtime(struct held_lock *hlock) | |
278 | { | |
279 | struct lock_class_stats *stats; | |
3365e779 | 280 | u64 holdtime; |
f20786ff PZ |
281 | |
282 | if (!lock_stat) | |
283 | return; | |
284 | ||
3365e779 | 285 | holdtime = lockstat_clock() - hlock->holdtime_stamp; |
f20786ff | 286 | |
f82b217e | 287 | stats = get_lock_stats(hlock_class(hlock)); |
f20786ff PZ |
288 | if (hlock->read) |
289 | lock_time_inc(&stats->read_holdtime, holdtime); | |
290 | else | |
291 | lock_time_inc(&stats->write_holdtime, holdtime); | |
f20786ff PZ |
292 | } |
293 | #else | |
294 | static inline void lock_release_holdtime(struct held_lock *hlock) | |
295 | { | |
296 | } | |
297 | #endif | |
298 | ||
fbb9ce95 | 299 | /* |
a0b0fd53 BVA |
300 | * We keep a global list of all lock classes. The list is only accessed with |
301 | * the lockdep spinlock lock held. free_lock_classes is a list with free | |
302 | * elements. These elements are linked together by the lock_entry member in | |
303 | * struct lock_class. | |
fbb9ce95 IM |
304 | */ |
305 | LIST_HEAD(all_lock_classes); | |
a0b0fd53 BVA |
306 | static LIST_HEAD(free_lock_classes); |
307 | ||
308 | /** | |
309 | * struct pending_free - information about data structures about to be freed | |
310 | * @zapped: Head of a list with struct lock_class elements. | |
de4643a7 BVA |
311 | * @lock_chains_being_freed: Bitmap that indicates which lock_chains[] elements |
312 | * are about to be freed. | |
a0b0fd53 BVA |
313 | */ |
314 | struct pending_free { | |
315 | struct list_head zapped; | |
de4643a7 | 316 | DECLARE_BITMAP(lock_chains_being_freed, MAX_LOCKDEP_CHAINS); |
a0b0fd53 BVA |
317 | }; |
318 | ||
319 | /** | |
320 | * struct delayed_free - data structures used for delayed freeing | |
321 | * | |
322 | * A data structure for delayed freeing of data structures that may be | |
323 | * accessed by RCU readers at the time these were freed. | |
324 | * | |
325 | * @rcu_head: Used to schedule an RCU callback for freeing data structures. | |
326 | * @index: Index of @pf to which freed data structures are added. | |
327 | * @scheduled: Whether or not an RCU callback has been scheduled. | |
328 | * @pf: Array with information about data structures about to be freed. | |
329 | */ | |
330 | static struct delayed_free { | |
331 | struct rcu_head rcu_head; | |
332 | int index; | |
333 | int scheduled; | |
334 | struct pending_free pf[2]; | |
335 | } delayed_free; | |
fbb9ce95 IM |
336 | |
337 | /* | |
338 | * The lockdep classes are in a hash-table as well, for fast lookup: | |
339 | */ | |
340 | #define CLASSHASH_BITS (MAX_LOCKDEP_KEYS_BITS - 1) | |
341 | #define CLASSHASH_SIZE (1UL << CLASSHASH_BITS) | |
4b32d0a4 | 342 | #define __classhashfn(key) hash_long((unsigned long)key, CLASSHASH_BITS) |
fbb9ce95 IM |
343 | #define classhashentry(key) (classhash_table + __classhashfn((key))) |
344 | ||
a63f38cc | 345 | static struct hlist_head classhash_table[CLASSHASH_SIZE]; |
fbb9ce95 | 346 | |
fbb9ce95 IM |
347 | /* |
348 | * We put the lock dependency chains into a hash-table as well, to cache | |
349 | * their existence: | |
350 | */ | |
351 | #define CHAINHASH_BITS (MAX_LOCKDEP_CHAINS_BITS-1) | |
352 | #define CHAINHASH_SIZE (1UL << CHAINHASH_BITS) | |
4b32d0a4 | 353 | #define __chainhashfn(chain) hash_long(chain, CHAINHASH_BITS) |
fbb9ce95 IM |
354 | #define chainhashentry(chain) (chainhash_table + __chainhashfn((chain))) |
355 | ||
a63f38cc | 356 | static struct hlist_head chainhash_table[CHAINHASH_SIZE]; |
fbb9ce95 IM |
357 | |
358 | /* | |
359 | * The hash key of the lock dependency chains is a hash itself too: | |
360 | * it's a hash of all locks taken up to that lock, including that lock. | |
361 | * It's a 64-bit hash, because it's important for the keys to be | |
362 | * unique. | |
363 | */ | |
dfaaf3fa PZ |
364 | static inline u64 iterate_chain_key(u64 key, u32 idx) |
365 | { | |
366 | u32 k0 = key, k1 = key >> 32; | |
367 | ||
368 | __jhash_mix(idx, k0, k1); /* Macro that modifies arguments! */ | |
369 | ||
370 | return k0 | (u64)k1 << 32; | |
371 | } | |
fbb9ce95 | 372 | |
e196e479 YD |
373 | void lockdep_init_task(struct task_struct *task) |
374 | { | |
375 | task->lockdep_depth = 0; /* no locks held yet */ | |
f6ec8829 | 376 | task->curr_chain_key = INITIAL_CHAIN_KEY; |
e196e479 YD |
377 | task->lockdep_recursion = 0; |
378 | } | |
379 | ||
1d09daa5 | 380 | void lockdep_off(void) |
fbb9ce95 IM |
381 | { |
382 | current->lockdep_recursion++; | |
383 | } | |
fbb9ce95 IM |
384 | EXPORT_SYMBOL(lockdep_off); |
385 | ||
1d09daa5 | 386 | void lockdep_on(void) |
fbb9ce95 IM |
387 | { |
388 | current->lockdep_recursion--; | |
389 | } | |
fbb9ce95 IM |
390 | EXPORT_SYMBOL(lockdep_on); |
391 | ||
cdc84d79 BVA |
392 | void lockdep_set_selftest_task(struct task_struct *task) |
393 | { | |
394 | lockdep_selftest_task_struct = task; | |
395 | } | |
396 | ||
fbb9ce95 IM |
397 | /* |
398 | * Debugging switches: | |
399 | */ | |
400 | ||
401 | #define VERBOSE 0 | |
33e94e96 | 402 | #define VERY_VERBOSE 0 |
fbb9ce95 IM |
403 | |
404 | #if VERBOSE | |
405 | # define HARDIRQ_VERBOSE 1 | |
406 | # define SOFTIRQ_VERBOSE 1 | |
407 | #else | |
408 | # define HARDIRQ_VERBOSE 0 | |
409 | # define SOFTIRQ_VERBOSE 0 | |
410 | #endif | |
411 | ||
d92a8cfc | 412 | #if VERBOSE || HARDIRQ_VERBOSE || SOFTIRQ_VERBOSE |
fbb9ce95 IM |
413 | /* |
414 | * Quick filtering for interesting events: | |
415 | */ | |
416 | static int class_filter(struct lock_class *class) | |
417 | { | |
f9829cce AK |
418 | #if 0 |
419 | /* Example */ | |
fbb9ce95 | 420 | if (class->name_version == 1 && |
f9829cce | 421 | !strcmp(class->name, "lockname")) |
fbb9ce95 IM |
422 | return 1; |
423 | if (class->name_version == 1 && | |
f9829cce | 424 | !strcmp(class->name, "&struct->lockfield")) |
fbb9ce95 | 425 | return 1; |
f9829cce | 426 | #endif |
a6640897 IM |
427 | /* Filter everything else. 1 would be to allow everything else */ |
428 | return 0; | |
fbb9ce95 IM |
429 | } |
430 | #endif | |
431 | ||
432 | static int verbose(struct lock_class *class) | |
433 | { | |
434 | #if VERBOSE | |
435 | return class_filter(class); | |
436 | #endif | |
437 | return 0; | |
438 | } | |
439 | ||
2c522836 DJ |
440 | static void print_lockdep_off(const char *bug_msg) |
441 | { | |
442 | printk(KERN_DEBUG "%s\n", bug_msg); | |
443 | printk(KERN_DEBUG "turning off the locking correctness validator.\n"); | |
acf59377 | 444 | #ifdef CONFIG_LOCK_STAT |
2c522836 | 445 | printk(KERN_DEBUG "Please attach the output of /proc/lock_stat to the bug report\n"); |
acf59377 | 446 | #endif |
2c522836 DJ |
447 | } |
448 | ||
886532ae AB |
449 | unsigned long nr_stack_trace_entries; |
450 | ||
30a35f79 | 451 | #ifdef CONFIG_PROVE_LOCKING |
12593b74 BVA |
452 | /** |
453 | * struct lock_trace - single stack backtrace | |
454 | * @hash_entry: Entry in a stack_trace_hash[] list. | |
455 | * @hash: jhash() of @entries. | |
456 | * @nr_entries: Number of entries in @entries. | |
457 | * @entries: Actual stack backtrace. | |
458 | */ | |
459 | struct lock_trace { | |
460 | struct hlist_node hash_entry; | |
461 | u32 hash; | |
462 | u32 nr_entries; | |
463 | unsigned long entries[0] __aligned(sizeof(unsigned long)); | |
464 | }; | |
465 | #define LOCK_TRACE_SIZE_IN_LONGS \ | |
466 | (sizeof(struct lock_trace) / sizeof(unsigned long)) | |
886532ae | 467 | /* |
12593b74 | 468 | * Stack-trace: sequence of lock_trace structures. Protected by the graph_lock. |
886532ae AB |
469 | */ |
470 | static unsigned long stack_trace[MAX_STACK_TRACE_ENTRIES]; | |
12593b74 BVA |
471 | static struct hlist_head stack_trace_hash[STACK_TRACE_HASH_SIZE]; |
472 | ||
473 | static bool traces_identical(struct lock_trace *t1, struct lock_trace *t2) | |
474 | { | |
475 | return t1->hash == t2->hash && t1->nr_entries == t2->nr_entries && | |
476 | memcmp(t1->entries, t2->entries, | |
477 | t1->nr_entries * sizeof(t1->entries[0])) == 0; | |
478 | } | |
886532ae | 479 | |
12593b74 | 480 | static struct lock_trace *save_trace(void) |
fbb9ce95 | 481 | { |
12593b74 BVA |
482 | struct lock_trace *trace, *t2; |
483 | struct hlist_head *hash_head; | |
484 | u32 hash; | |
c120bce7 | 485 | unsigned int max_entries; |
fbb9ce95 | 486 | |
12593b74 BVA |
487 | BUILD_BUG_ON_NOT_POWER_OF_2(STACK_TRACE_HASH_SIZE); |
488 | BUILD_BUG_ON(LOCK_TRACE_SIZE_IN_LONGS >= MAX_STACK_TRACE_ENTRIES); | |
489 | ||
490 | trace = (struct lock_trace *)(stack_trace + nr_stack_trace_entries); | |
491 | max_entries = MAX_STACK_TRACE_ENTRIES - nr_stack_trace_entries - | |
492 | LOCK_TRACE_SIZE_IN_LONGS; | |
493 | trace->nr_entries = stack_trace_save(trace->entries, max_entries, 3); | |
fbb9ce95 | 494 | |
12593b74 BVA |
495 | if (nr_stack_trace_entries >= MAX_STACK_TRACE_ENTRIES - |
496 | LOCK_TRACE_SIZE_IN_LONGS - 1) { | |
74c383f1 | 497 | if (!debug_locks_off_graph_unlock()) |
12593b74 | 498 | return NULL; |
74c383f1 | 499 | |
2c522836 | 500 | print_lockdep_off("BUG: MAX_STACK_TRACE_ENTRIES too low!"); |
74c383f1 IM |
501 | dump_stack(); |
502 | ||
12593b74 | 503 | return NULL; |
fbb9ce95 IM |
504 | } |
505 | ||
12593b74 BVA |
506 | hash = jhash(trace->entries, trace->nr_entries * |
507 | sizeof(trace->entries[0]), 0); | |
508 | trace->hash = hash; | |
509 | hash_head = stack_trace_hash + (hash & (STACK_TRACE_HASH_SIZE - 1)); | |
510 | hlist_for_each_entry(t2, hash_head, hash_entry) { | |
511 | if (traces_identical(trace, t2)) | |
512 | return t2; | |
513 | } | |
514 | nr_stack_trace_entries += LOCK_TRACE_SIZE_IN_LONGS + trace->nr_entries; | |
515 | hlist_add_head(&trace->hash_entry, hash_head); | |
516 | ||
517 | return trace; | |
fbb9ce95 | 518 | } |
8c779229 BVA |
519 | |
520 | /* Return the number of stack traces in the stack_trace[] array. */ | |
521 | u64 lockdep_stack_trace_count(void) | |
522 | { | |
523 | struct lock_trace *trace; | |
524 | u64 c = 0; | |
525 | int i; | |
526 | ||
527 | for (i = 0; i < ARRAY_SIZE(stack_trace_hash); i++) { | |
528 | hlist_for_each_entry(trace, &stack_trace_hash[i], hash_entry) { | |
529 | c++; | |
530 | } | |
531 | } | |
532 | ||
533 | return c; | |
534 | } | |
535 | ||
536 | /* Return the number of stack hash chains that have at least one stack trace. */ | |
537 | u64 lockdep_stack_hash_count(void) | |
538 | { | |
539 | u64 c = 0; | |
540 | int i; | |
541 | ||
542 | for (i = 0; i < ARRAY_SIZE(stack_trace_hash); i++) | |
543 | if (!hlist_empty(&stack_trace_hash[i])) | |
544 | c++; | |
545 | ||
546 | return c; | |
fbb9ce95 | 547 | } |
886532ae | 548 | #endif |
fbb9ce95 IM |
549 | |
550 | unsigned int nr_hardirq_chains; | |
551 | unsigned int nr_softirq_chains; | |
552 | unsigned int nr_process_chains; | |
553 | unsigned int max_lockdep_depth; | |
fbb9ce95 IM |
554 | |
555 | #ifdef CONFIG_DEBUG_LOCKDEP | |
fbb9ce95 IM |
556 | /* |
557 | * Various lockdep statistics: | |
558 | */ | |
bd6d29c2 | 559 | DEFINE_PER_CPU(struct lockdep_stats, lockdep_stats); |
fbb9ce95 IM |
560 | #endif |
561 | ||
30a35f79 | 562 | #ifdef CONFIG_PROVE_LOCKING |
fbb9ce95 IM |
563 | /* |
564 | * Locking printouts: | |
565 | */ | |
566 | ||
fabe9c42 | 567 | #define __USAGE(__STATE) \ |
b4b136f4 PZ |
568 | [LOCK_USED_IN_##__STATE] = "IN-"__stringify(__STATE)"-W", \ |
569 | [LOCK_ENABLED_##__STATE] = __stringify(__STATE)"-ON-W", \ | |
570 | [LOCK_USED_IN_##__STATE##_READ] = "IN-"__stringify(__STATE)"-R",\ | |
571 | [LOCK_ENABLED_##__STATE##_READ] = __stringify(__STATE)"-ON-R", | |
fabe9c42 | 572 | |
fbb9ce95 IM |
573 | static const char *usage_str[] = |
574 | { | |
fabe9c42 PZ |
575 | #define LOCKDEP_STATE(__STATE) __USAGE(__STATE) |
576 | #include "lockdep_states.h" | |
577 | #undef LOCKDEP_STATE | |
578 | [LOCK_USED] = "INITIAL USE", | |
fbb9ce95 | 579 | }; |
886532ae | 580 | #endif |
fbb9ce95 | 581 | |
364f6afc | 582 | const char *__get_key_name(const struct lockdep_subclass_key *key, char *str) |
fbb9ce95 | 583 | { |
ffb45122 | 584 | return kallsyms_lookup((unsigned long)key, NULL, NULL, NULL, str); |
fbb9ce95 IM |
585 | } |
586 | ||
3ff176ca | 587 | static inline unsigned long lock_flag(enum lock_usage_bit bit) |
fbb9ce95 | 588 | { |
3ff176ca PZ |
589 | return 1UL << bit; |
590 | } | |
fbb9ce95 | 591 | |
3ff176ca PZ |
592 | static char get_usage_char(struct lock_class *class, enum lock_usage_bit bit) |
593 | { | |
c52478f4 YD |
594 | /* |
595 | * The usage character defaults to '.' (i.e., irqs disabled and not in | |
596 | * irq context), which is the safest usage category. | |
597 | */ | |
3ff176ca PZ |
598 | char c = '.'; |
599 | ||
c52478f4 YD |
600 | /* |
601 | * The order of the following usage checks matters, which will | |
602 | * result in the outcome character as follows: | |
603 | * | |
604 | * - '+': irq is enabled and not in irq context | |
605 | * - '-': in irq context and irq is disabled | |
606 | * - '?': in irq context and irq is enabled | |
607 | */ | |
608 | if (class->usage_mask & lock_flag(bit + LOCK_USAGE_DIR_MASK)) { | |
3ff176ca | 609 | c = '+'; |
c52478f4 | 610 | if (class->usage_mask & lock_flag(bit)) |
3ff176ca | 611 | c = '?'; |
c52478f4 YD |
612 | } else if (class->usage_mask & lock_flag(bit)) |
613 | c = '-'; | |
fbb9ce95 | 614 | |
3ff176ca PZ |
615 | return c; |
616 | } | |
cf40bd16 | 617 | |
f510b233 | 618 | void get_usage_chars(struct lock_class *class, char usage[LOCK_USAGE_CHARS]) |
3ff176ca | 619 | { |
f510b233 | 620 | int i = 0; |
cf40bd16 | 621 | |
f510b233 PZ |
622 | #define LOCKDEP_STATE(__STATE) \ |
623 | usage[i++] = get_usage_char(class, LOCK_USED_IN_##__STATE); \ | |
624 | usage[i++] = get_usage_char(class, LOCK_USED_IN_##__STATE##_READ); | |
625 | #include "lockdep_states.h" | |
626 | #undef LOCKDEP_STATE | |
627 | ||
628 | usage[i] = '\0'; | |
fbb9ce95 IM |
629 | } |
630 | ||
e5e78d08 | 631 | static void __print_lock_name(struct lock_class *class) |
3003eba3 SR |
632 | { |
633 | char str[KSYM_NAME_LEN]; | |
634 | const char *name; | |
635 | ||
fbb9ce95 IM |
636 | name = class->name; |
637 | if (!name) { | |
638 | name = __get_key_name(class->key, str); | |
f943fe0f | 639 | printk(KERN_CONT "%s", name); |
fbb9ce95 | 640 | } else { |
f943fe0f | 641 | printk(KERN_CONT "%s", name); |
fbb9ce95 | 642 | if (class->name_version > 1) |
f943fe0f | 643 | printk(KERN_CONT "#%d", class->name_version); |
fbb9ce95 | 644 | if (class->subclass) |
f943fe0f | 645 | printk(KERN_CONT "/%d", class->subclass); |
fbb9ce95 | 646 | } |
e5e78d08 SR |
647 | } |
648 | ||
649 | static void print_lock_name(struct lock_class *class) | |
650 | { | |
651 | char usage[LOCK_USAGE_CHARS]; | |
652 | ||
653 | get_usage_chars(class, usage); | |
654 | ||
f943fe0f | 655 | printk(KERN_CONT " ("); |
e5e78d08 | 656 | __print_lock_name(class); |
f943fe0f | 657 | printk(KERN_CONT "){%s}", usage); |
fbb9ce95 IM |
658 | } |
659 | ||
660 | static void print_lockdep_cache(struct lockdep_map *lock) | |
661 | { | |
662 | const char *name; | |
9281acea | 663 | char str[KSYM_NAME_LEN]; |
fbb9ce95 IM |
664 | |
665 | name = lock->name; | |
666 | if (!name) | |
667 | name = __get_key_name(lock->key->subkeys, str); | |
668 | ||
f943fe0f | 669 | printk(KERN_CONT "%s", name); |
fbb9ce95 IM |
670 | } |
671 | ||
672 | static void print_lock(struct held_lock *hlock) | |
673 | { | |
d7bc3197 PZ |
674 | /* |
675 | * We can be called locklessly through debug_show_all_locks() so be | |
676 | * extra careful, the hlock might have been released and cleared. | |
01bb6f0a YD |
677 | * |
678 | * If this indeed happens, lets pretend it does not hurt to continue | |
679 | * to print the lock unless the hlock class_idx does not point to a | |
680 | * registered class. The rationale here is: since we don't attempt | |
681 | * to distinguish whether we are in this situation, if it just | |
682 | * happened we can't count on class_idx to tell either. | |
d7bc3197 | 683 | */ |
01bb6f0a | 684 | struct lock_class *lock = hlock_class(hlock); |
d7bc3197 | 685 | |
01bb6f0a | 686 | if (!lock) { |
f943fe0f | 687 | printk(KERN_CONT "<RELEASED>\n"); |
d7bc3197 PZ |
688 | return; |
689 | } | |
690 | ||
519248f3 | 691 | printk(KERN_CONT "%px", hlock->instance); |
01bb6f0a | 692 | print_lock_name(lock); |
b3c39758 | 693 | printk(KERN_CONT ", at: %pS\n", (void *)hlock->acquire_ip); |
fbb9ce95 IM |
694 | } |
695 | ||
8cc05c71 | 696 | static void lockdep_print_held_locks(struct task_struct *p) |
fbb9ce95 | 697 | { |
8cc05c71 | 698 | int i, depth = READ_ONCE(p->lockdep_depth); |
fbb9ce95 | 699 | |
8cc05c71 TH |
700 | if (!depth) |
701 | printk("no locks held by %s/%d.\n", p->comm, task_pid_nr(p)); | |
702 | else | |
703 | printk("%d lock%s held by %s/%d:\n", depth, | |
704 | depth > 1 ? "s" : "", p->comm, task_pid_nr(p)); | |
705 | /* | |
706 | * It's not reliable to print a task's held locks if it's not sleeping | |
707 | * and it's not the current task. | |
708 | */ | |
709 | if (p->state == TASK_RUNNING && p != current) | |
fbb9ce95 | 710 | return; |
fbb9ce95 IM |
711 | for (i = 0; i < depth; i++) { |
712 | printk(" #%d: ", i); | |
8cc05c71 | 713 | print_lock(p->held_locks + i); |
fbb9ce95 IM |
714 | } |
715 | } | |
fbb9ce95 | 716 | |
fbdc4b9a | 717 | static void print_kernel_ident(void) |
8e18257d | 718 | { |
fbdc4b9a | 719 | printk("%s %.*s %s\n", init_utsname()->release, |
8e18257d | 720 | (int)strcspn(init_utsname()->version, " "), |
fbdc4b9a BH |
721 | init_utsname()->version, |
722 | print_tainted()); | |
8e18257d PZ |
723 | } |
724 | ||
725 | static int very_verbose(struct lock_class *class) | |
726 | { | |
727 | #if VERY_VERBOSE | |
728 | return class_filter(class); | |
729 | #endif | |
730 | return 0; | |
731 | } | |
732 | ||
fbb9ce95 | 733 | /* |
8e18257d | 734 | * Is this the address of a static object: |
fbb9ce95 | 735 | */ |
8dce7a9a | 736 | #ifdef __KERNEL__ |
108c1485 | 737 | static int static_obj(const void *obj) |
fbb9ce95 | 738 | { |
8e18257d PZ |
739 | unsigned long start = (unsigned long) &_stext, |
740 | end = (unsigned long) &_end, | |
741 | addr = (unsigned long) obj; | |
8e18257d | 742 | |
7a5da02d GS |
743 | if (arch_is_kernel_initmem_freed(addr)) |
744 | return 0; | |
745 | ||
fbb9ce95 | 746 | /* |
8e18257d | 747 | * static variable? |
fbb9ce95 | 748 | */ |
8e18257d PZ |
749 | if ((addr >= start) && (addr < end)) |
750 | return 1; | |
fbb9ce95 | 751 | |
2a9ad18d MF |
752 | if (arch_is_kernel_data(addr)) |
753 | return 1; | |
754 | ||
fbb9ce95 | 755 | /* |
10fad5e4 | 756 | * in-kernel percpu var? |
fbb9ce95 | 757 | */ |
10fad5e4 TH |
758 | if (is_kernel_percpu_address(addr)) |
759 | return 1; | |
fbb9ce95 | 760 | |
8e18257d | 761 | /* |
10fad5e4 | 762 | * module static or percpu var? |
8e18257d | 763 | */ |
10fad5e4 | 764 | return is_module_address(addr) || is_module_percpu_address(addr); |
99de055a | 765 | } |
8dce7a9a | 766 | #endif |
99de055a | 767 | |
fbb9ce95 | 768 | /* |
8e18257d | 769 | * To make lock name printouts unique, we calculate a unique |
fe27b0de BVA |
770 | * class->name_version generation counter. The caller must hold the graph |
771 | * lock. | |
fbb9ce95 | 772 | */ |
8e18257d | 773 | static int count_matching_names(struct lock_class *new_class) |
fbb9ce95 | 774 | { |
8e18257d PZ |
775 | struct lock_class *class; |
776 | int count = 0; | |
fbb9ce95 | 777 | |
8e18257d | 778 | if (!new_class->name) |
fbb9ce95 IM |
779 | return 0; |
780 | ||
fe27b0de | 781 | list_for_each_entry(class, &all_lock_classes, lock_entry) { |
8e18257d PZ |
782 | if (new_class->key - new_class->subclass == class->key) |
783 | return class->name_version; | |
784 | if (class->name && !strcmp(class->name, new_class->name)) | |
785 | count = max(count, class->name_version); | |
786 | } | |
fbb9ce95 | 787 | |
8e18257d | 788 | return count + 1; |
fbb9ce95 IM |
789 | } |
790 | ||
8e18257d | 791 | static inline struct lock_class * |
08f36ff6 | 792 | look_up_lock_class(const struct lockdep_map *lock, unsigned int subclass) |
fbb9ce95 | 793 | { |
8e18257d | 794 | struct lockdep_subclass_key *key; |
a63f38cc | 795 | struct hlist_head *hash_head; |
8e18257d | 796 | struct lock_class *class; |
fbb9ce95 | 797 | |
4ba053c0 HM |
798 | if (unlikely(subclass >= MAX_LOCKDEP_SUBCLASSES)) { |
799 | debug_locks_off(); | |
800 | printk(KERN_ERR | |
801 | "BUG: looking up invalid subclass: %u\n", subclass); | |
802 | printk(KERN_ERR | |
803 | "turning off the locking correctness validator.\n"); | |
804 | dump_stack(); | |
805 | return NULL; | |
806 | } | |
807 | ||
8e18257d | 808 | /* |
64f29d1b MW |
809 | * If it is not initialised then it has never been locked, |
810 | * so it won't be present in the hash table. | |
8e18257d | 811 | */ |
64f29d1b MW |
812 | if (unlikely(!lock->key)) |
813 | return NULL; | |
fbb9ce95 | 814 | |
8e18257d PZ |
815 | /* |
816 | * NOTE: the class-key must be unique. For dynamic locks, a static | |
817 | * lock_class_key variable is passed in through the mutex_init() | |
818 | * (or spin_lock_init()) call - which acts as the key. For static | |
819 | * locks we use the lock object itself as the key. | |
820 | */ | |
4b32d0a4 PZ |
821 | BUILD_BUG_ON(sizeof(struct lock_class_key) > |
822 | sizeof(struct lockdep_map)); | |
fbb9ce95 | 823 | |
8e18257d | 824 | key = lock->key->subkeys + subclass; |
ca268c69 | 825 | |
8e18257d | 826 | hash_head = classhashentry(key); |
74c383f1 | 827 | |
8e18257d | 828 | /* |
35a9393c | 829 | * We do an RCU walk of the hash, see lockdep_free_key_range(). |
8e18257d | 830 | */ |
35a9393c PZ |
831 | if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) |
832 | return NULL; | |
833 | ||
a63f38cc | 834 | hlist_for_each_entry_rcu(class, hash_head, hash_entry) { |
4b32d0a4 | 835 | if (class->key == key) { |
0119fee4 PZ |
836 | /* |
837 | * Huh! same key, different name? Did someone trample | |
838 | * on some memory? We're most confused. | |
839 | */ | |
97831546 SAS |
840 | WARN_ON_ONCE(class->name != lock->name && |
841 | lock->key != &__lockdep_no_validate__); | |
8e18257d | 842 | return class; |
4b32d0a4 PZ |
843 | } |
844 | } | |
fbb9ce95 | 845 | |
64f29d1b MW |
846 | return NULL; |
847 | } | |
848 | ||
849 | /* | |
850 | * Static locks do not have their class-keys yet - for them the key is | |
851 | * the lock object itself. If the lock is in the per cpu area, the | |
852 | * canonical address of the lock (per cpu offset removed) is used. | |
853 | */ | |
854 | static bool assign_lock_key(struct lockdep_map *lock) | |
855 | { | |
856 | unsigned long can_addr, addr = (unsigned long)lock; | |
857 | ||
4bf50862 BVA |
858 | #ifdef __KERNEL__ |
859 | /* | |
860 | * lockdep_free_key_range() assumes that struct lock_class_key | |
861 | * objects do not overlap. Since we use the address of lock | |
862 | * objects as class key for static objects, check whether the | |
863 | * size of lock_class_key objects does not exceed the size of | |
864 | * the smallest lock object. | |
865 | */ | |
866 | BUILD_BUG_ON(sizeof(struct lock_class_key) > sizeof(raw_spinlock_t)); | |
867 | #endif | |
868 | ||
64f29d1b MW |
869 | if (__is_kernel_percpu_address(addr, &can_addr)) |
870 | lock->key = (void *)can_addr; | |
871 | else if (__is_module_percpu_address(addr, &can_addr)) | |
872 | lock->key = (void *)can_addr; | |
873 | else if (static_obj(lock)) | |
874 | lock->key = (void *)lock; | |
875 | else { | |
876 | /* Debug-check: all keys must be persistent! */ | |
877 | debug_locks_off(); | |
878 | pr_err("INFO: trying to register non-static key.\n"); | |
879 | pr_err("the code is fine but needs lockdep annotation.\n"); | |
880 | pr_err("turning off the locking correctness validator.\n"); | |
881 | dump_stack(); | |
882 | return false; | |
883 | } | |
884 | ||
885 | return true; | |
fbb9ce95 IM |
886 | } |
887 | ||
72dcd505 PZ |
888 | #ifdef CONFIG_DEBUG_LOCKDEP |
889 | ||
b526b2e3 BVA |
890 | /* Check whether element @e occurs in list @h */ |
891 | static bool in_list(struct list_head *e, struct list_head *h) | |
892 | { | |
893 | struct list_head *f; | |
894 | ||
895 | list_for_each(f, h) { | |
896 | if (e == f) | |
897 | return true; | |
898 | } | |
899 | ||
900 | return false; | |
901 | } | |
902 | ||
903 | /* | |
904 | * Check whether entry @e occurs in any of the locks_after or locks_before | |
905 | * lists. | |
906 | */ | |
907 | static bool in_any_class_list(struct list_head *e) | |
908 | { | |
909 | struct lock_class *class; | |
910 | int i; | |
911 | ||
912 | for (i = 0; i < ARRAY_SIZE(lock_classes); i++) { | |
913 | class = &lock_classes[i]; | |
914 | if (in_list(e, &class->locks_after) || | |
915 | in_list(e, &class->locks_before)) | |
916 | return true; | |
917 | } | |
918 | return false; | |
919 | } | |
920 | ||
921 | static bool class_lock_list_valid(struct lock_class *c, struct list_head *h) | |
922 | { | |
923 | struct lock_list *e; | |
924 | ||
925 | list_for_each_entry(e, h, entry) { | |
926 | if (e->links_to != c) { | |
927 | printk(KERN_INFO "class %s: mismatch for lock entry %ld; class %s <> %s", | |
928 | c->name ? : "(?)", | |
929 | (unsigned long)(e - list_entries), | |
930 | e->links_to && e->links_to->name ? | |
931 | e->links_to->name : "(?)", | |
932 | e->class && e->class->name ? e->class->name : | |
933 | "(?)"); | |
934 | return false; | |
935 | } | |
936 | } | |
937 | return true; | |
938 | } | |
939 | ||
3fe7522f AB |
940 | #ifdef CONFIG_PROVE_LOCKING |
941 | static u16 chain_hlocks[MAX_LOCKDEP_CHAIN_HLOCKS]; | |
942 | #endif | |
b526b2e3 BVA |
943 | |
944 | static bool check_lock_chain_key(struct lock_chain *chain) | |
945 | { | |
946 | #ifdef CONFIG_PROVE_LOCKING | |
f6ec8829 | 947 | u64 chain_key = INITIAL_CHAIN_KEY; |
b526b2e3 BVA |
948 | int i; |
949 | ||
950 | for (i = chain->base; i < chain->base + chain->depth; i++) | |
01bb6f0a | 951 | chain_key = iterate_chain_key(chain_key, chain_hlocks[i]); |
b526b2e3 BVA |
952 | /* |
953 | * The 'unsigned long long' casts avoid that a compiler warning | |
954 | * is reported when building tools/lib/lockdep. | |
955 | */ | |
72dcd505 | 956 | if (chain->chain_key != chain_key) { |
b526b2e3 BVA |
957 | printk(KERN_INFO "chain %lld: key %#llx <> %#llx\n", |
958 | (unsigned long long)(chain - lock_chains), | |
959 | (unsigned long long)chain->chain_key, | |
960 | (unsigned long long)chain_key); | |
72dcd505 PZ |
961 | return false; |
962 | } | |
b526b2e3 | 963 | #endif |
72dcd505 | 964 | return true; |
b526b2e3 BVA |
965 | } |
966 | ||
967 | static bool in_any_zapped_class_list(struct lock_class *class) | |
968 | { | |
969 | struct pending_free *pf; | |
970 | int i; | |
971 | ||
72dcd505 | 972 | for (i = 0, pf = delayed_free.pf; i < ARRAY_SIZE(delayed_free.pf); i++, pf++) { |
b526b2e3 BVA |
973 | if (in_list(&class->lock_entry, &pf->zapped)) |
974 | return true; | |
72dcd505 | 975 | } |
b526b2e3 BVA |
976 | |
977 | return false; | |
978 | } | |
979 | ||
72dcd505 | 980 | static bool __check_data_structures(void) |
b526b2e3 BVA |
981 | { |
982 | struct lock_class *class; | |
983 | struct lock_chain *chain; | |
984 | struct hlist_head *head; | |
985 | struct lock_list *e; | |
986 | int i; | |
987 | ||
988 | /* Check whether all classes occur in a lock list. */ | |
989 | for (i = 0; i < ARRAY_SIZE(lock_classes); i++) { | |
990 | class = &lock_classes[i]; | |
991 | if (!in_list(&class->lock_entry, &all_lock_classes) && | |
992 | !in_list(&class->lock_entry, &free_lock_classes) && | |
993 | !in_any_zapped_class_list(class)) { | |
994 | printk(KERN_INFO "class %px/%s is not in any class list\n", | |
995 | class, class->name ? : "(?)"); | |
996 | return false; | |
b526b2e3 BVA |
997 | } |
998 | } | |
999 | ||
1000 | /* Check whether all classes have valid lock lists. */ | |
1001 | for (i = 0; i < ARRAY_SIZE(lock_classes); i++) { | |
1002 | class = &lock_classes[i]; | |
1003 | if (!class_lock_list_valid(class, &class->locks_before)) | |
1004 | return false; | |
1005 | if (!class_lock_list_valid(class, &class->locks_after)) | |
1006 | return false; | |
1007 | } | |
1008 | ||
1009 | /* Check the chain_key of all lock chains. */ | |
1010 | for (i = 0; i < ARRAY_SIZE(chainhash_table); i++) { | |
1011 | head = chainhash_table + i; | |
1012 | hlist_for_each_entry_rcu(chain, head, entry) { | |
1013 | if (!check_lock_chain_key(chain)) | |
1014 | return false; | |
1015 | } | |
1016 | } | |
1017 | ||
1018 | /* | |
1019 | * Check whether all list entries that are in use occur in a class | |
1020 | * lock list. | |
1021 | */ | |
1022 | for_each_set_bit(i, list_entries_in_use, ARRAY_SIZE(list_entries)) { | |
1023 | e = list_entries + i; | |
1024 | if (!in_any_class_list(&e->entry)) { | |
1025 | printk(KERN_INFO "list entry %d is not in any class list; class %s <> %s\n", | |
1026 | (unsigned int)(e - list_entries), | |
1027 | e->class->name ? : "(?)", | |
1028 | e->links_to->name ? : "(?)"); | |
1029 | return false; | |
1030 | } | |
1031 | } | |
1032 | ||
1033 | /* | |
1034 | * Check whether all list entries that are not in use do not occur in | |
1035 | * a class lock list. | |
1036 | */ | |
1037 | for_each_clear_bit(i, list_entries_in_use, ARRAY_SIZE(list_entries)) { | |
1038 | e = list_entries + i; | |
1039 | if (in_any_class_list(&e->entry)) { | |
1040 | printk(KERN_INFO "list entry %d occurs in a class list; class %s <> %s\n", | |
1041 | (unsigned int)(e - list_entries), | |
1042 | e->class && e->class->name ? e->class->name : | |
1043 | "(?)", | |
1044 | e->links_to && e->links_to->name ? | |
1045 | e->links_to->name : "(?)"); | |
1046 | return false; | |
1047 | } | |
1048 | } | |
1049 | ||
1050 | return true; | |
1051 | } | |
1052 | ||
72dcd505 PZ |
1053 | int check_consistency = 0; |
1054 | module_param(check_consistency, int, 0644); | |
1055 | ||
1056 | static void check_data_structures(void) | |
1057 | { | |
1058 | static bool once = false; | |
1059 | ||
1060 | if (check_consistency && !once) { | |
1061 | if (!__check_data_structures()) { | |
1062 | once = true; | |
1063 | WARN_ON(once); | |
1064 | } | |
1065 | } | |
1066 | } | |
1067 | ||
1068 | #else /* CONFIG_DEBUG_LOCKDEP */ | |
1069 | ||
1070 | static inline void check_data_structures(void) { } | |
1071 | ||
1072 | #endif /* CONFIG_DEBUG_LOCKDEP */ | |
1073 | ||
feb0a386 | 1074 | /* |
a0b0fd53 BVA |
1075 | * Initialize the lock_classes[] array elements, the free_lock_classes list |
1076 | * and also the delayed_free structure. | |
feb0a386 BVA |
1077 | */ |
1078 | static void init_data_structures_once(void) | |
1079 | { | |
0126574f | 1080 | static bool ds_initialized, rcu_head_initialized; |
feb0a386 BVA |
1081 | int i; |
1082 | ||
0126574f | 1083 | if (likely(rcu_head_initialized)) |
feb0a386 BVA |
1084 | return; |
1085 | ||
0126574f BVA |
1086 | if (system_state >= SYSTEM_SCHEDULING) { |
1087 | init_rcu_head(&delayed_free.rcu_head); | |
1088 | rcu_head_initialized = true; | |
1089 | } | |
1090 | ||
1091 | if (ds_initialized) | |
1092 | return; | |
1093 | ||
1094 | ds_initialized = true; | |
feb0a386 | 1095 | |
a0b0fd53 BVA |
1096 | INIT_LIST_HEAD(&delayed_free.pf[0].zapped); |
1097 | INIT_LIST_HEAD(&delayed_free.pf[1].zapped); | |
1098 | ||
feb0a386 | 1099 | for (i = 0; i < ARRAY_SIZE(lock_classes); i++) { |
a0b0fd53 | 1100 | list_add_tail(&lock_classes[i].lock_entry, &free_lock_classes); |
feb0a386 BVA |
1101 | INIT_LIST_HEAD(&lock_classes[i].locks_after); |
1102 | INIT_LIST_HEAD(&lock_classes[i].locks_before); | |
1103 | } | |
1104 | } | |
1105 | ||
108c1485 BVA |
1106 | static inline struct hlist_head *keyhashentry(const struct lock_class_key *key) |
1107 | { | |
1108 | unsigned long hash = hash_long((uintptr_t)key, KEYHASH_BITS); | |
1109 | ||
1110 | return lock_keys_hash + hash; | |
1111 | } | |
1112 | ||
1113 | /* Register a dynamically allocated key. */ | |
1114 | void lockdep_register_key(struct lock_class_key *key) | |
1115 | { | |
1116 | struct hlist_head *hash_head; | |
1117 | struct lock_class_key *k; | |
1118 | unsigned long flags; | |
1119 | ||
1120 | if (WARN_ON_ONCE(static_obj(key))) | |
1121 | return; | |
1122 | hash_head = keyhashentry(key); | |
1123 | ||
1124 | raw_local_irq_save(flags); | |
1125 | if (!graph_lock()) | |
1126 | goto restore_irqs; | |
1127 | hlist_for_each_entry_rcu(k, hash_head, hash_entry) { | |
1128 | if (WARN_ON_ONCE(k == key)) | |
1129 | goto out_unlock; | |
1130 | } | |
1131 | hlist_add_head_rcu(&key->hash_entry, hash_head); | |
1132 | out_unlock: | |
1133 | graph_unlock(); | |
1134 | restore_irqs: | |
1135 | raw_local_irq_restore(flags); | |
1136 | } | |
1137 | EXPORT_SYMBOL_GPL(lockdep_register_key); | |
1138 | ||
1139 | /* Check whether a key has been registered as a dynamic key. */ | |
1140 | static bool is_dynamic_key(const struct lock_class_key *key) | |
1141 | { | |
1142 | struct hlist_head *hash_head; | |
1143 | struct lock_class_key *k; | |
1144 | bool found = false; | |
1145 | ||
1146 | if (WARN_ON_ONCE(static_obj(key))) | |
1147 | return false; | |
1148 | ||
1149 | /* | |
1150 | * If lock debugging is disabled lock_keys_hash[] may contain | |
1151 | * pointers to memory that has already been freed. Avoid triggering | |
1152 | * a use-after-free in that case by returning early. | |
1153 | */ | |
1154 | if (!debug_locks) | |
1155 | return true; | |
1156 | ||
1157 | hash_head = keyhashentry(key); | |
1158 | ||
1159 | rcu_read_lock(); | |
1160 | hlist_for_each_entry_rcu(k, hash_head, hash_entry) { | |
1161 | if (k == key) { | |
1162 | found = true; | |
1163 | break; | |
1164 | } | |
1165 | } | |
1166 | rcu_read_unlock(); | |
1167 | ||
1168 | return found; | |
1169 | } | |
1170 | ||
fbb9ce95 | 1171 | /* |
8e18257d PZ |
1172 | * Register a lock's class in the hash-table, if the class is not present |
1173 | * yet. Otherwise we look it up. We cache the result in the lock object | |
1174 | * itself, so actual lookup of the hash should be once per lock object. | |
fbb9ce95 | 1175 | */ |
c003ed92 | 1176 | static struct lock_class * |
8e18257d | 1177 | register_lock_class(struct lockdep_map *lock, unsigned int subclass, int force) |
fbb9ce95 | 1178 | { |
8e18257d | 1179 | struct lockdep_subclass_key *key; |
a63f38cc | 1180 | struct hlist_head *hash_head; |
8e18257d | 1181 | struct lock_class *class; |
35a9393c PZ |
1182 | |
1183 | DEBUG_LOCKS_WARN_ON(!irqs_disabled()); | |
8e18257d PZ |
1184 | |
1185 | class = look_up_lock_class(lock, subclass); | |
64f29d1b | 1186 | if (likely(class)) |
87cdee71 | 1187 | goto out_set_class_cache; |
8e18257d | 1188 | |
64f29d1b MW |
1189 | if (!lock->key) { |
1190 | if (!assign_lock_key(lock)) | |
1191 | return NULL; | |
108c1485 | 1192 | } else if (!static_obj(lock->key) && !is_dynamic_key(lock->key)) { |
8e18257d PZ |
1193 | return NULL; |
1194 | } | |
1195 | ||
1196 | key = lock->key->subkeys + subclass; | |
1197 | hash_head = classhashentry(key); | |
1198 | ||
8e18257d | 1199 | if (!graph_lock()) { |
8e18257d PZ |
1200 | return NULL; |
1201 | } | |
1202 | /* | |
1203 | * We have to do the hash-walk again, to avoid races | |
1204 | * with another CPU: | |
1205 | */ | |
a63f38cc | 1206 | hlist_for_each_entry_rcu(class, hash_head, hash_entry) { |
8e18257d PZ |
1207 | if (class->key == key) |
1208 | goto out_unlock_set; | |
35a9393c PZ |
1209 | } |
1210 | ||
feb0a386 BVA |
1211 | init_data_structures_once(); |
1212 | ||
a0b0fd53 BVA |
1213 | /* Allocate a new lock class and add it to the hash. */ |
1214 | class = list_first_entry_or_null(&free_lock_classes, typeof(*class), | |
1215 | lock_entry); | |
1216 | if (!class) { | |
8e18257d | 1217 | if (!debug_locks_off_graph_unlock()) { |
8e18257d PZ |
1218 | return NULL; |
1219 | } | |
8e18257d | 1220 | |
2c522836 | 1221 | print_lockdep_off("BUG: MAX_LOCKDEP_KEYS too low!"); |
eedeeabd | 1222 | dump_stack(); |
8e18257d PZ |
1223 | return NULL; |
1224 | } | |
a0b0fd53 | 1225 | nr_lock_classes++; |
01bb6f0a | 1226 | __set_bit(class - lock_classes, lock_classes_in_use); |
bd6d29c2 | 1227 | debug_atomic_inc(nr_unused_locks); |
8e18257d PZ |
1228 | class->key = key; |
1229 | class->name = lock->name; | |
1230 | class->subclass = subclass; | |
feb0a386 BVA |
1231 | WARN_ON_ONCE(!list_empty(&class->locks_before)); |
1232 | WARN_ON_ONCE(!list_empty(&class->locks_after)); | |
8e18257d PZ |
1233 | class->name_version = count_matching_names(class); |
1234 | /* | |
1235 | * We use RCU's safe list-add method to make | |
1236 | * parallel walking of the hash-list safe: | |
1237 | */ | |
a63f38cc | 1238 | hlist_add_head_rcu(&class->hash_entry, hash_head); |
1481197b | 1239 | /* |
a0b0fd53 BVA |
1240 | * Remove the class from the free list and add it to the global list |
1241 | * of classes. | |
1481197b | 1242 | */ |
a0b0fd53 | 1243 | list_move_tail(&class->lock_entry, &all_lock_classes); |
8e18257d PZ |
1244 | |
1245 | if (verbose(class)) { | |
1246 | graph_unlock(); | |
8e18257d | 1247 | |
04860d48 | 1248 | printk("\nnew class %px: %s", class->key, class->name); |
8e18257d | 1249 | if (class->name_version > 1) |
f943fe0f DV |
1250 | printk(KERN_CONT "#%d", class->name_version); |
1251 | printk(KERN_CONT "\n"); | |
8e18257d PZ |
1252 | dump_stack(); |
1253 | ||
8e18257d | 1254 | if (!graph_lock()) { |
8e18257d PZ |
1255 | return NULL; |
1256 | } | |
1257 | } | |
1258 | out_unlock_set: | |
1259 | graph_unlock(); | |
8e18257d | 1260 | |
87cdee71 | 1261 | out_set_class_cache: |
8e18257d | 1262 | if (!subclass || force) |
62016250 HM |
1263 | lock->class_cache[0] = class; |
1264 | else if (subclass < NR_LOCKDEP_CACHING_CLASSES) | |
1265 | lock->class_cache[subclass] = class; | |
8e18257d | 1266 | |
0119fee4 PZ |
1267 | /* |
1268 | * Hash collision, did we smoke some? We found a class with a matching | |
1269 | * hash but the subclass -- which is hashed in -- didn't match. | |
1270 | */ | |
8e18257d PZ |
1271 | if (DEBUG_LOCKS_WARN_ON(class->subclass != subclass)) |
1272 | return NULL; | |
1273 | ||
1274 | return class; | |
1275 | } | |
1276 | ||
1277 | #ifdef CONFIG_PROVE_LOCKING | |
1278 | /* | |
1279 | * Allocate a lockdep entry. (assumes the graph_lock held, returns | |
1280 | * with NULL on failure) | |
1281 | */ | |
1282 | static struct lock_list *alloc_list_entry(void) | |
1283 | { | |
ace35a7a BVA |
1284 | int idx = find_first_zero_bit(list_entries_in_use, |
1285 | ARRAY_SIZE(list_entries)); | |
1286 | ||
1287 | if (idx >= ARRAY_SIZE(list_entries)) { | |
8e18257d PZ |
1288 | if (!debug_locks_off_graph_unlock()) |
1289 | return NULL; | |
1290 | ||
2c522836 | 1291 | print_lockdep_off("BUG: MAX_LOCKDEP_ENTRIES too low!"); |
eedeeabd | 1292 | dump_stack(); |
8e18257d PZ |
1293 | return NULL; |
1294 | } | |
ace35a7a BVA |
1295 | nr_list_entries++; |
1296 | __set_bit(idx, list_entries_in_use); | |
1297 | return list_entries + idx; | |
8e18257d PZ |
1298 | } |
1299 | ||
1300 | /* | |
1301 | * Add a new dependency to the head of the list: | |
1302 | */ | |
86cffb80 BVA |
1303 | static int add_lock_to_list(struct lock_class *this, |
1304 | struct lock_class *links_to, struct list_head *head, | |
83f06168 | 1305 | unsigned long ip, int distance, |
12593b74 | 1306 | const struct lock_trace *trace) |
8e18257d PZ |
1307 | { |
1308 | struct lock_list *entry; | |
1309 | /* | |
1310 | * Lock not present yet - get a new dependency struct and | |
1311 | * add it to the list: | |
1312 | */ | |
1313 | entry = alloc_list_entry(); | |
1314 | if (!entry) | |
1315 | return 0; | |
1316 | ||
74870172 | 1317 | entry->class = this; |
86cffb80 | 1318 | entry->links_to = links_to; |
74870172 | 1319 | entry->distance = distance; |
12593b74 | 1320 | entry->trace = trace; |
8e18257d | 1321 | /* |
35a9393c PZ |
1322 | * Both allocation and removal are done under the graph lock; but |
1323 | * iteration is under RCU-sched; see look_up_lock_class() and | |
1324 | * lockdep_free_key_range(). | |
8e18257d PZ |
1325 | */ |
1326 | list_add_tail_rcu(&entry->entry, head); | |
1327 | ||
1328 | return 1; | |
1329 | } | |
1330 | ||
98c33edd PZ |
1331 | /* |
1332 | * For good efficiency of modular, we use power of 2 | |
1333 | */ | |
af012961 PZ |
1334 | #define MAX_CIRCULAR_QUEUE_SIZE 4096UL |
1335 | #define CQ_MASK (MAX_CIRCULAR_QUEUE_SIZE-1) | |
1336 | ||
98c33edd | 1337 | /* |
aa480771 YD |
1338 | * The circular_queue and helpers are used to implement graph |
1339 | * breadth-first search (BFS) algorithm, by which we can determine | |
1340 | * whether there is a path from a lock to another. In deadlock checks, | |
1341 | * a path from the next lock to be acquired to a previous held lock | |
1342 | * indicates that adding the <prev> -> <next> lock dependency will | |
1343 | * produce a circle in the graph. Breadth-first search instead of | |
1344 | * depth-first search is used in order to find the shortest (circular) | |
1345 | * path. | |
98c33edd | 1346 | */ |
af012961 | 1347 | struct circular_queue { |
aa480771 | 1348 | struct lock_list *element[MAX_CIRCULAR_QUEUE_SIZE]; |
af012961 PZ |
1349 | unsigned int front, rear; |
1350 | }; | |
1351 | ||
1352 | static struct circular_queue lock_cq; | |
af012961 | 1353 | |
12f3dfd0 | 1354 | unsigned int max_bfs_queue_depth; |
af012961 | 1355 | |
e351b660 ML |
1356 | static unsigned int lockdep_dependency_gen_id; |
1357 | ||
af012961 PZ |
1358 | static inline void __cq_init(struct circular_queue *cq) |
1359 | { | |
1360 | cq->front = cq->rear = 0; | |
e351b660 | 1361 | lockdep_dependency_gen_id++; |
af012961 PZ |
1362 | } |
1363 | ||
1364 | static inline int __cq_empty(struct circular_queue *cq) | |
1365 | { | |
1366 | return (cq->front == cq->rear); | |
1367 | } | |
1368 | ||
1369 | static inline int __cq_full(struct circular_queue *cq) | |
1370 | { | |
1371 | return ((cq->rear + 1) & CQ_MASK) == cq->front; | |
1372 | } | |
1373 | ||
aa480771 | 1374 | static inline int __cq_enqueue(struct circular_queue *cq, struct lock_list *elem) |
af012961 PZ |
1375 | { |
1376 | if (__cq_full(cq)) | |
1377 | return -1; | |
1378 | ||
1379 | cq->element[cq->rear] = elem; | |
1380 | cq->rear = (cq->rear + 1) & CQ_MASK; | |
1381 | return 0; | |
1382 | } | |
1383 | ||
c1661325 YD |
1384 | /* |
1385 | * Dequeue an element from the circular_queue, return a lock_list if | |
1386 | * the queue is not empty, or NULL if otherwise. | |
1387 | */ | |
1388 | static inline struct lock_list * __cq_dequeue(struct circular_queue *cq) | |
af012961 | 1389 | { |
c1661325 YD |
1390 | struct lock_list * lock; |
1391 | ||
af012961 | 1392 | if (__cq_empty(cq)) |
c1661325 | 1393 | return NULL; |
af012961 | 1394 | |
c1661325 | 1395 | lock = cq->element[cq->front]; |
af012961 | 1396 | cq->front = (cq->front + 1) & CQ_MASK; |
c1661325 YD |
1397 | |
1398 | return lock; | |
af012961 PZ |
1399 | } |
1400 | ||
1401 | static inline unsigned int __cq_get_elem_count(struct circular_queue *cq) | |
1402 | { | |
1403 | return (cq->rear - cq->front) & CQ_MASK; | |
1404 | } | |
1405 | ||
1406 | static inline void mark_lock_accessed(struct lock_list *lock, | |
1407 | struct lock_list *parent) | |
1408 | { | |
1409 | unsigned long nr; | |
98c33edd | 1410 | |
af012961 | 1411 | nr = lock - list_entries; |
ace35a7a | 1412 | WARN_ON(nr >= ARRAY_SIZE(list_entries)); /* Out-of-bounds, input fail */ |
af012961 | 1413 | lock->parent = parent; |
e351b660 | 1414 | lock->class->dep_gen_id = lockdep_dependency_gen_id; |
af012961 PZ |
1415 | } |
1416 | ||
1417 | static inline unsigned long lock_accessed(struct lock_list *lock) | |
1418 | { | |
1419 | unsigned long nr; | |
98c33edd | 1420 | |
af012961 | 1421 | nr = lock - list_entries; |
ace35a7a | 1422 | WARN_ON(nr >= ARRAY_SIZE(list_entries)); /* Out-of-bounds, input fail */ |
e351b660 | 1423 | return lock->class->dep_gen_id == lockdep_dependency_gen_id; |
af012961 PZ |
1424 | } |
1425 | ||
1426 | static inline struct lock_list *get_lock_parent(struct lock_list *child) | |
1427 | { | |
1428 | return child->parent; | |
1429 | } | |
1430 | ||
1431 | static inline int get_lock_depth(struct lock_list *child) | |
1432 | { | |
1433 | int depth = 0; | |
1434 | struct lock_list *parent; | |
1435 | ||
1436 | while ((parent = get_lock_parent(child))) { | |
1437 | child = parent; | |
1438 | depth++; | |
1439 | } | |
1440 | return depth; | |
1441 | } | |
1442 | ||
77a80692 YD |
1443 | /* |
1444 | * Return the forward or backward dependency list. | |
1445 | * | |
1446 | * @lock: the lock_list to get its class's dependency list | |
1447 | * @offset: the offset to struct lock_class to determine whether it is | |
1448 | * locks_after or locks_before | |
1449 | */ | |
1450 | static inline struct list_head *get_dep_list(struct lock_list *lock, int offset) | |
1451 | { | |
1452 | void *lock_class = lock->class; | |
1453 | ||
1454 | return lock_class + offset; | |
1455 | } | |
1456 | ||
154f185e YD |
1457 | /* |
1458 | * Forward- or backward-dependency search, used for both circular dependency | |
1459 | * checking and hardirq-unsafe/softirq-unsafe checking. | |
1460 | */ | |
9e2d551e | 1461 | static int __bfs(struct lock_list *source_entry, |
af012961 PZ |
1462 | void *data, |
1463 | int (*match)(struct lock_list *entry, void *data), | |
1464 | struct lock_list **target_entry, | |
77a80692 | 1465 | int offset) |
c94aa5ca ML |
1466 | { |
1467 | struct lock_list *entry; | |
c1661325 | 1468 | struct lock_list *lock; |
d588e461 | 1469 | struct list_head *head; |
c94aa5ca ML |
1470 | struct circular_queue *cq = &lock_cq; |
1471 | int ret = 1; | |
1472 | ||
9e2d551e | 1473 | if (match(source_entry, data)) { |
c94aa5ca ML |
1474 | *target_entry = source_entry; |
1475 | ret = 0; | |
1476 | goto exit; | |
1477 | } | |
1478 | ||
77a80692 | 1479 | head = get_dep_list(source_entry, offset); |
d588e461 ML |
1480 | if (list_empty(head)) |
1481 | goto exit; | |
1482 | ||
1483 | __cq_init(cq); | |
aa480771 | 1484 | __cq_enqueue(cq, source_entry); |
c94aa5ca | 1485 | |
c1661325 | 1486 | while ((lock = __cq_dequeue(cq))) { |
c94aa5ca ML |
1487 | |
1488 | if (!lock->class) { | |
1489 | ret = -2; | |
1490 | goto exit; | |
1491 | } | |
1492 | ||
77a80692 | 1493 | head = get_dep_list(lock, offset); |
c94aa5ca | 1494 | |
35a9393c PZ |
1495 | DEBUG_LOCKS_WARN_ON(!irqs_disabled()); |
1496 | ||
1497 | list_for_each_entry_rcu(entry, head, entry) { | |
c94aa5ca | 1498 | if (!lock_accessed(entry)) { |
12f3dfd0 | 1499 | unsigned int cq_depth; |
c94aa5ca | 1500 | mark_lock_accessed(entry, lock); |
9e2d551e | 1501 | if (match(entry, data)) { |
c94aa5ca ML |
1502 | *target_entry = entry; |
1503 | ret = 0; | |
1504 | goto exit; | |
1505 | } | |
1506 | ||
aa480771 | 1507 | if (__cq_enqueue(cq, entry)) { |
c94aa5ca ML |
1508 | ret = -1; |
1509 | goto exit; | |
1510 | } | |
12f3dfd0 ML |
1511 | cq_depth = __cq_get_elem_count(cq); |
1512 | if (max_bfs_queue_depth < cq_depth) | |
1513 | max_bfs_queue_depth = cq_depth; | |
c94aa5ca ML |
1514 | } |
1515 | } | |
1516 | } | |
1517 | exit: | |
1518 | return ret; | |
1519 | } | |
1520 | ||
d7aaba14 | 1521 | static inline int __bfs_forwards(struct lock_list *src_entry, |
9e2d551e ML |
1522 | void *data, |
1523 | int (*match)(struct lock_list *entry, void *data), | |
1524 | struct lock_list **target_entry) | |
c94aa5ca | 1525 | { |
77a80692 YD |
1526 | return __bfs(src_entry, data, match, target_entry, |
1527 | offsetof(struct lock_class, locks_after)); | |
c94aa5ca ML |
1528 | |
1529 | } | |
1530 | ||
d7aaba14 | 1531 | static inline int __bfs_backwards(struct lock_list *src_entry, |
9e2d551e ML |
1532 | void *data, |
1533 | int (*match)(struct lock_list *entry, void *data), | |
1534 | struct lock_list **target_entry) | |
c94aa5ca | 1535 | { |
77a80692 YD |
1536 | return __bfs(src_entry, data, match, target_entry, |
1537 | offsetof(struct lock_class, locks_before)); | |
c94aa5ca ML |
1538 | |
1539 | } | |
1540 | ||
12593b74 BVA |
1541 | static void print_lock_trace(const struct lock_trace *trace, |
1542 | unsigned int spaces) | |
c120bce7 | 1543 | { |
12593b74 | 1544 | stack_trace_print(trace->entries, trace->nr_entries, spaces); |
c120bce7 TG |
1545 | } |
1546 | ||
8e18257d PZ |
1547 | /* |
1548 | * Print a dependency chain entry (this is only done when a deadlock | |
1549 | * has been detected): | |
1550 | */ | |
f7c1c6b3 | 1551 | static noinline void |
24208ca7 | 1552 | print_circular_bug_entry(struct lock_list *target, int depth) |
8e18257d PZ |
1553 | { |
1554 | if (debug_locks_silent) | |
f7c1c6b3 | 1555 | return; |
8e18257d PZ |
1556 | printk("\n-> #%u", depth); |
1557 | print_lock_name(target->class); | |
f943fe0f | 1558 | printk(KERN_CONT ":\n"); |
12593b74 | 1559 | print_lock_trace(target->trace, 6); |
8e18257d PZ |
1560 | } |
1561 | ||
f4185812 SR |
1562 | static void |
1563 | print_circular_lock_scenario(struct held_lock *src, | |
1564 | struct held_lock *tgt, | |
1565 | struct lock_list *prt) | |
1566 | { | |
1567 | struct lock_class *source = hlock_class(src); | |
1568 | struct lock_class *target = hlock_class(tgt); | |
1569 | struct lock_class *parent = prt->class; | |
1570 | ||
1571 | /* | |
1572 | * A direct locking problem where unsafe_class lock is taken | |
1573 | * directly by safe_class lock, then all we need to show | |
1574 | * is the deadlock scenario, as it is obvious that the | |
1575 | * unsafe lock is taken under the safe lock. | |
1576 | * | |
1577 | * But if there is a chain instead, where the safe lock takes | |
1578 | * an intermediate lock (middle_class) where this lock is | |
1579 | * not the same as the safe lock, then the lock chain is | |
1580 | * used to describe the problem. Otherwise we would need | |
1581 | * to show a different CPU case for each link in the chain | |
1582 | * from the safe_class lock to the unsafe_class lock. | |
1583 | */ | |
1584 | if (parent != source) { | |
1585 | printk("Chain exists of:\n "); | |
1586 | __print_lock_name(source); | |
f943fe0f | 1587 | printk(KERN_CONT " --> "); |
f4185812 | 1588 | __print_lock_name(parent); |
f943fe0f | 1589 | printk(KERN_CONT " --> "); |
f4185812 | 1590 | __print_lock_name(target); |
f943fe0f | 1591 | printk(KERN_CONT "\n\n"); |
f4185812 SR |
1592 | } |
1593 | ||
e966eaee IM |
1594 | printk(" Possible unsafe locking scenario:\n\n"); |
1595 | printk(" CPU0 CPU1\n"); | |
1596 | printk(" ---- ----\n"); | |
1597 | printk(" lock("); | |
1598 | __print_lock_name(target); | |
1599 | printk(KERN_CONT ");\n"); | |
1600 | printk(" lock("); | |
1601 | __print_lock_name(parent); | |
1602 | printk(KERN_CONT ");\n"); | |
1603 | printk(" lock("); | |
1604 | __print_lock_name(target); | |
1605 | printk(KERN_CONT ");\n"); | |
1606 | printk(" lock("); | |
1607 | __print_lock_name(source); | |
1608 | printk(KERN_CONT ");\n"); | |
1609 | printk("\n *** DEADLOCK ***\n\n"); | |
f4185812 SR |
1610 | } |
1611 | ||
8e18257d PZ |
1612 | /* |
1613 | * When a circular dependency is detected, print the | |
1614 | * header first: | |
1615 | */ | |
f7c1c6b3 | 1616 | static noinline void |
db0002a3 ML |
1617 | print_circular_bug_header(struct lock_list *entry, unsigned int depth, |
1618 | struct held_lock *check_src, | |
1619 | struct held_lock *check_tgt) | |
8e18257d PZ |
1620 | { |
1621 | struct task_struct *curr = current; | |
1622 | ||
c94aa5ca | 1623 | if (debug_locks_silent) |
f7c1c6b3 | 1624 | return; |
8e18257d | 1625 | |
681fbec8 | 1626 | pr_warn("\n"); |
a5dd63ef PM |
1627 | pr_warn("======================================================\n"); |
1628 | pr_warn("WARNING: possible circular locking dependency detected\n"); | |
fbdc4b9a | 1629 | print_kernel_ident(); |
a5dd63ef | 1630 | pr_warn("------------------------------------------------------\n"); |
681fbec8 | 1631 | pr_warn("%s/%d is trying to acquire lock:\n", |
ba25f9dc | 1632 | curr->comm, task_pid_nr(curr)); |
db0002a3 | 1633 | print_lock(check_src); |
383a4bc8 | 1634 | |
e966eaee | 1635 | pr_warn("\nbut task is already holding lock:\n"); |
383a4bc8 | 1636 | |
db0002a3 | 1637 | print_lock(check_tgt); |
681fbec8 PM |
1638 | pr_warn("\nwhich lock already depends on the new lock.\n\n"); |
1639 | pr_warn("\nthe existing dependency chain (in reverse order) is:\n"); | |
8e18257d PZ |
1640 | |
1641 | print_circular_bug_entry(entry, depth); | |
8e18257d PZ |
1642 | } |
1643 | ||
9e2d551e ML |
1644 | static inline int class_equal(struct lock_list *entry, void *data) |
1645 | { | |
1646 | return entry->class == data; | |
1647 | } | |
1648 | ||
f7c1c6b3 YD |
1649 | static noinline void print_circular_bug(struct lock_list *this, |
1650 | struct lock_list *target, | |
1651 | struct held_lock *check_src, | |
1652 | struct held_lock *check_tgt) | |
8e18257d PZ |
1653 | { |
1654 | struct task_struct *curr = current; | |
c94aa5ca | 1655 | struct lock_list *parent; |
f4185812 | 1656 | struct lock_list *first_parent; |
24208ca7 | 1657 | int depth; |
8e18257d | 1658 | |
c94aa5ca | 1659 | if (!debug_locks_off_graph_unlock() || debug_locks_silent) |
f7c1c6b3 | 1660 | return; |
8e18257d | 1661 | |
12593b74 BVA |
1662 | this->trace = save_trace(); |
1663 | if (!this->trace) | |
f7c1c6b3 | 1664 | return; |
8e18257d | 1665 | |
c94aa5ca ML |
1666 | depth = get_lock_depth(target); |
1667 | ||
db0002a3 | 1668 | print_circular_bug_header(target, depth, check_src, check_tgt); |
c94aa5ca ML |
1669 | |
1670 | parent = get_lock_parent(target); | |
f4185812 | 1671 | first_parent = parent; |
c94aa5ca ML |
1672 | |
1673 | while (parent) { | |
1674 | print_circular_bug_entry(parent, --depth); | |
1675 | parent = get_lock_parent(parent); | |
1676 | } | |
8e18257d PZ |
1677 | |
1678 | printk("\nother info that might help us debug this:\n\n"); | |
f4185812 SR |
1679 | print_circular_lock_scenario(check_src, check_tgt, |
1680 | first_parent); | |
1681 | ||
8e18257d PZ |
1682 | lockdep_print_held_locks(curr); |
1683 | ||
1684 | printk("\nstack backtrace:\n"); | |
1685 | dump_stack(); | |
8e18257d PZ |
1686 | } |
1687 | ||
f7c1c6b3 | 1688 | static noinline void print_bfs_bug(int ret) |
db0002a3 ML |
1689 | { |
1690 | if (!debug_locks_off_graph_unlock()) | |
f7c1c6b3 | 1691 | return; |
db0002a3 | 1692 | |
0119fee4 PZ |
1693 | /* |
1694 | * Breadth-first-search failed, graph got corrupted? | |
1695 | */ | |
db0002a3 | 1696 | WARN(1, "lockdep bfs error:%d\n", ret); |
db0002a3 ML |
1697 | } |
1698 | ||
ef681026 | 1699 | static int noop_count(struct lock_list *entry, void *data) |
419ca3f1 | 1700 | { |
ef681026 ML |
1701 | (*(unsigned long *)data)++; |
1702 | return 0; | |
1703 | } | |
419ca3f1 | 1704 | |
5216d530 | 1705 | static unsigned long __lockdep_count_forward_deps(struct lock_list *this) |
ef681026 ML |
1706 | { |
1707 | unsigned long count = 0; | |
1708 | struct lock_list *uninitialized_var(target_entry); | |
419ca3f1 | 1709 | |
ef681026 | 1710 | __bfs_forwards(this, (void *)&count, noop_count, &target_entry); |
419ca3f1 | 1711 | |
ef681026 | 1712 | return count; |
419ca3f1 | 1713 | } |
419ca3f1 DM |
1714 | unsigned long lockdep_count_forward_deps(struct lock_class *class) |
1715 | { | |
1716 | unsigned long ret, flags; | |
ef681026 ML |
1717 | struct lock_list this; |
1718 | ||
1719 | this.parent = NULL; | |
1720 | this.class = class; | |
419ca3f1 | 1721 | |
fcc784be | 1722 | raw_local_irq_save(flags); |
0199c4e6 | 1723 | arch_spin_lock(&lockdep_lock); |
ef681026 | 1724 | ret = __lockdep_count_forward_deps(&this); |
0199c4e6 | 1725 | arch_spin_unlock(&lockdep_lock); |
fcc784be | 1726 | raw_local_irq_restore(flags); |
419ca3f1 DM |
1727 | |
1728 | return ret; | |
1729 | } | |
1730 | ||
5216d530 | 1731 | static unsigned long __lockdep_count_backward_deps(struct lock_list *this) |
419ca3f1 | 1732 | { |
ef681026 ML |
1733 | unsigned long count = 0; |
1734 | struct lock_list *uninitialized_var(target_entry); | |
419ca3f1 | 1735 | |
ef681026 | 1736 | __bfs_backwards(this, (void *)&count, noop_count, &target_entry); |
419ca3f1 | 1737 | |
ef681026 | 1738 | return count; |
419ca3f1 DM |
1739 | } |
1740 | ||
1741 | unsigned long lockdep_count_backward_deps(struct lock_class *class) | |
1742 | { | |
1743 | unsigned long ret, flags; | |
ef681026 ML |
1744 | struct lock_list this; |
1745 | ||
1746 | this.parent = NULL; | |
1747 | this.class = class; | |
419ca3f1 | 1748 | |
fcc784be | 1749 | raw_local_irq_save(flags); |
0199c4e6 | 1750 | arch_spin_lock(&lockdep_lock); |
ef681026 | 1751 | ret = __lockdep_count_backward_deps(&this); |
0199c4e6 | 1752 | arch_spin_unlock(&lockdep_lock); |
fcc784be | 1753 | raw_local_irq_restore(flags); |
419ca3f1 DM |
1754 | |
1755 | return ret; | |
1756 | } | |
1757 | ||
8e18257d | 1758 | /* |
8c2c2b44 YD |
1759 | * Check that the dependency graph starting at <src> can lead to |
1760 | * <target> or not. Print an error and return 0 if it does. | |
8e18257d PZ |
1761 | */ |
1762 | static noinline int | |
8c2c2b44 YD |
1763 | check_path(struct lock_class *target, struct lock_list *src_entry, |
1764 | struct lock_list **target_entry) | |
8e18257d | 1765 | { |
8c2c2b44 YD |
1766 | int ret; |
1767 | ||
1768 | ret = __bfs_forwards(src_entry, (void *)target, class_equal, | |
1769 | target_entry); | |
1770 | ||
1771 | if (unlikely(ret < 0)) | |
1772 | print_bfs_bug(ret); | |
1773 | ||
1774 | return ret; | |
1775 | } | |
1776 | ||
1777 | /* | |
1778 | * Prove that the dependency graph starting at <src> can not | |
1779 | * lead to <target>. If it can, there is a circle when adding | |
1780 | * <target> -> <src> dependency. | |
1781 | * | |
1782 | * Print an error and return 0 if it does. | |
1783 | */ | |
1784 | static noinline int | |
1785 | check_noncircular(struct held_lock *src, struct held_lock *target, | |
12593b74 | 1786 | struct lock_trace **const trace) |
8c2c2b44 YD |
1787 | { |
1788 | int ret; | |
1789 | struct lock_list *uninitialized_var(target_entry); | |
1790 | struct lock_list src_entry = { | |
1791 | .class = hlock_class(src), | |
1792 | .parent = NULL, | |
1793 | }; | |
8e18257d | 1794 | |
bd6d29c2 | 1795 | debug_atomic_inc(nr_cyclic_checks); |
419ca3f1 | 1796 | |
8c2c2b44 | 1797 | ret = check_path(hlock_class(target), &src_entry, &target_entry); |
fbb9ce95 | 1798 | |
8c2c2b44 | 1799 | if (unlikely(!ret)) { |
12593b74 | 1800 | if (!*trace) { |
8c2c2b44 YD |
1801 | /* |
1802 | * If save_trace fails here, the printing might | |
1803 | * trigger a WARN but because of the !nr_entries it | |
1804 | * should not do bad things. | |
1805 | */ | |
12593b74 | 1806 | *trace = save_trace(); |
8c2c2b44 YD |
1807 | } |
1808 | ||
1809 | print_circular_bug(&src_entry, target_entry, src, target); | |
1810 | } | |
1811 | ||
1812 | return ret; | |
db0002a3 | 1813 | } |
c94aa5ca | 1814 | |
68e9dc29 | 1815 | #ifdef CONFIG_LOCKDEP_SMALL |
8c2c2b44 YD |
1816 | /* |
1817 | * Check that the dependency graph starting at <src> can lead to | |
1818 | * <target> or not. If it can, <src> -> <target> dependency is already | |
1819 | * in the graph. | |
1820 | * | |
1821 | * Print an error and return 2 if it does or 1 if it does not. | |
1822 | */ | |
ae813308 | 1823 | static noinline int |
8c2c2b44 | 1824 | check_redundant(struct held_lock *src, struct held_lock *target) |
ae813308 | 1825 | { |
8c2c2b44 YD |
1826 | int ret; |
1827 | struct lock_list *uninitialized_var(target_entry); | |
1828 | struct lock_list src_entry = { | |
1829 | .class = hlock_class(src), | |
1830 | .parent = NULL, | |
1831 | }; | |
ae813308 PZ |
1832 | |
1833 | debug_atomic_inc(nr_redundant_checks); | |
1834 | ||
8c2c2b44 | 1835 | ret = check_path(hlock_class(target), &src_entry, &target_entry); |
ae813308 | 1836 | |
8c2c2b44 YD |
1837 | if (!ret) { |
1838 | debug_atomic_inc(nr_redundant); | |
1839 | ret = 2; | |
1840 | } else if (ret < 0) | |
1841 | ret = 0; | |
1842 | ||
1843 | return ret; | |
ae813308 | 1844 | } |
68e9dc29 | 1845 | #endif |
ae813308 | 1846 | |
e7a38f63 | 1847 | #ifdef CONFIG_TRACE_IRQFLAGS |
948f8376 FW |
1848 | |
1849 | static inline int usage_accumulate(struct lock_list *entry, void *mask) | |
1850 | { | |
1851 | *(unsigned long *)mask |= entry->class->usage_mask; | |
1852 | ||
1853 | return 0; | |
1854 | } | |
1855 | ||
fbb9ce95 IM |
1856 | /* |
1857 | * Forwards and backwards subgraph searching, for the purposes of | |
1858 | * proving that two subgraphs can be connected by a new dependency | |
1859 | * without creating any illegal irq-safe -> irq-unsafe lock dependency. | |
1860 | */ | |
fbb9ce95 | 1861 | |
627f364d | 1862 | static inline int usage_match(struct lock_list *entry, void *mask) |
d7aaba14 | 1863 | { |
627f364d | 1864 | return entry->class->usage_mask & *(unsigned long *)mask; |
d7aaba14 ML |
1865 | } |
1866 | ||
fbb9ce95 IM |
1867 | /* |
1868 | * Find a node in the forwards-direction dependency sub-graph starting | |
d7aaba14 | 1869 | * at @root->class that matches @bit. |
fbb9ce95 | 1870 | * |
d7aaba14 ML |
1871 | * Return 0 if such a node exists in the subgraph, and put that node |
1872 | * into *@target_entry. | |
fbb9ce95 | 1873 | * |
d7aaba14 ML |
1874 | * Return 1 otherwise and keep *@target_entry unchanged. |
1875 | * Return <0 on error. | |
fbb9ce95 | 1876 | */ |
d7aaba14 | 1877 | static int |
627f364d | 1878 | find_usage_forwards(struct lock_list *root, unsigned long usage_mask, |
d7aaba14 | 1879 | struct lock_list **target_entry) |
fbb9ce95 | 1880 | { |
d7aaba14 | 1881 | int result; |
fbb9ce95 | 1882 | |
bd6d29c2 | 1883 | debug_atomic_inc(nr_find_usage_forwards_checks); |
fbb9ce95 | 1884 | |
627f364d | 1885 | result = __bfs_forwards(root, &usage_mask, usage_match, target_entry); |
d7aaba14 ML |
1886 | |
1887 | return result; | |
fbb9ce95 IM |
1888 | } |
1889 | ||
1890 | /* | |
1891 | * Find a node in the backwards-direction dependency sub-graph starting | |
d7aaba14 | 1892 | * at @root->class that matches @bit. |
fbb9ce95 | 1893 | * |
d7aaba14 ML |
1894 | * Return 0 if such a node exists in the subgraph, and put that node |
1895 | * into *@target_entry. | |
fbb9ce95 | 1896 | * |
d7aaba14 ML |
1897 | * Return 1 otherwise and keep *@target_entry unchanged. |
1898 | * Return <0 on error. | |
fbb9ce95 | 1899 | */ |
d7aaba14 | 1900 | static int |
627f364d | 1901 | find_usage_backwards(struct lock_list *root, unsigned long usage_mask, |
d7aaba14 | 1902 | struct lock_list **target_entry) |
fbb9ce95 | 1903 | { |
d7aaba14 | 1904 | int result; |
fbb9ce95 | 1905 | |
bd6d29c2 | 1906 | debug_atomic_inc(nr_find_usage_backwards_checks); |
fbb9ce95 | 1907 | |
627f364d | 1908 | result = __bfs_backwards(root, &usage_mask, usage_match, target_entry); |
f82b217e | 1909 | |
d7aaba14 | 1910 | return result; |
fbb9ce95 IM |
1911 | } |
1912 | ||
af012961 PZ |
1913 | static void print_lock_class_header(struct lock_class *class, int depth) |
1914 | { | |
1915 | int bit; | |
1916 | ||
1917 | printk("%*s->", depth, ""); | |
1918 | print_lock_name(class); | |
8ca2b56c WL |
1919 | #ifdef CONFIG_DEBUG_LOCKDEP |
1920 | printk(KERN_CONT " ops: %lu", debug_class_ops_read(class)); | |
1921 | #endif | |
f943fe0f | 1922 | printk(KERN_CONT " {\n"); |
af012961 PZ |
1923 | |
1924 | for (bit = 0; bit < LOCK_USAGE_STATES; bit++) { | |
1925 | if (class->usage_mask & (1 << bit)) { | |
1926 | int len = depth; | |
1927 | ||
1928 | len += printk("%*s %s", depth, "", usage_str[bit]); | |
f943fe0f | 1929 | len += printk(KERN_CONT " at:\n"); |
12593b74 | 1930 | print_lock_trace(class->usage_traces[bit], len); |
af012961 PZ |
1931 | } |
1932 | } | |
1933 | printk("%*s }\n", depth, ""); | |
1934 | ||
04860d48 | 1935 | printk("%*s ... key at: [<%px>] %pS\n", |
f943fe0f | 1936 | depth, "", class->key, class->key); |
af012961 PZ |
1937 | } |
1938 | ||
1939 | /* | |
1940 | * printk the shortest lock dependencies from @start to @end in reverse order: | |
1941 | */ | |
1942 | static void __used | |
1943 | print_shortest_lock_dependencies(struct lock_list *leaf, | |
f7c1c6b3 | 1944 | struct lock_list *root) |
af012961 PZ |
1945 | { |
1946 | struct lock_list *entry = leaf; | |
1947 | int depth; | |
1948 | ||
1949 | /*compute depth from generated tree by BFS*/ | |
1950 | depth = get_lock_depth(leaf); | |
1951 | ||
1952 | do { | |
1953 | print_lock_class_header(entry->class, depth); | |
1954 | printk("%*s ... acquired at:\n", depth, ""); | |
12593b74 | 1955 | print_lock_trace(entry->trace, 2); |
af012961 PZ |
1956 | printk("\n"); |
1957 | ||
1958 | if (depth == 0 && (entry != root)) { | |
6be8c393 | 1959 | printk("lockdep:%s bad path found in chain graph\n", __func__); |
af012961 PZ |
1960 | break; |
1961 | } | |
1962 | ||
1963 | entry = get_lock_parent(entry); | |
1964 | depth--; | |
1965 | } while (entry && (depth >= 0)); | |
af012961 | 1966 | } |
d7aaba14 | 1967 | |
3003eba3 SR |
1968 | static void |
1969 | print_irq_lock_scenario(struct lock_list *safe_entry, | |
1970 | struct lock_list *unsafe_entry, | |
dad3d743 SR |
1971 | struct lock_class *prev_class, |
1972 | struct lock_class *next_class) | |
3003eba3 SR |
1973 | { |
1974 | struct lock_class *safe_class = safe_entry->class; | |
1975 | struct lock_class *unsafe_class = unsafe_entry->class; | |
dad3d743 | 1976 | struct lock_class *middle_class = prev_class; |
3003eba3 SR |
1977 | |
1978 | if (middle_class == safe_class) | |
dad3d743 | 1979 | middle_class = next_class; |
3003eba3 SR |
1980 | |
1981 | /* | |
1982 | * A direct locking problem where unsafe_class lock is taken | |
1983 | * directly by safe_class lock, then all we need to show | |
1984 | * is the deadlock scenario, as it is obvious that the | |
1985 | * unsafe lock is taken under the safe lock. | |
1986 | * | |
1987 | * But if there is a chain instead, where the safe lock takes | |
1988 | * an intermediate lock (middle_class) where this lock is | |
1989 | * not the same as the safe lock, then the lock chain is | |
1990 | * used to describe the problem. Otherwise we would need | |
1991 | * to show a different CPU case for each link in the chain | |
1992 | * from the safe_class lock to the unsafe_class lock. | |
1993 | */ | |
1994 | if (middle_class != unsafe_class) { | |
1995 | printk("Chain exists of:\n "); | |
1996 | __print_lock_name(safe_class); | |
f943fe0f | 1997 | printk(KERN_CONT " --> "); |
3003eba3 | 1998 | __print_lock_name(middle_class); |
f943fe0f | 1999 | printk(KERN_CONT " --> "); |
3003eba3 | 2000 | __print_lock_name(unsafe_class); |
f943fe0f | 2001 | printk(KERN_CONT "\n\n"); |
3003eba3 SR |
2002 | } |
2003 | ||
2004 | printk(" Possible interrupt unsafe locking scenario:\n\n"); | |
2005 | printk(" CPU0 CPU1\n"); | |
2006 | printk(" ---- ----\n"); | |
2007 | printk(" lock("); | |
2008 | __print_lock_name(unsafe_class); | |
f943fe0f | 2009 | printk(KERN_CONT ");\n"); |
3003eba3 SR |
2010 | printk(" local_irq_disable();\n"); |
2011 | printk(" lock("); | |
2012 | __print_lock_name(safe_class); | |
f943fe0f | 2013 | printk(KERN_CONT ");\n"); |
3003eba3 SR |
2014 | printk(" lock("); |
2015 | __print_lock_name(middle_class); | |
f943fe0f | 2016 | printk(KERN_CONT ");\n"); |
3003eba3 SR |
2017 | printk(" <Interrupt>\n"); |
2018 | printk(" lock("); | |
2019 | __print_lock_name(safe_class); | |
f943fe0f | 2020 | printk(KERN_CONT ");\n"); |
3003eba3 SR |
2021 | printk("\n *** DEADLOCK ***\n\n"); |
2022 | } | |
2023 | ||
f7c1c6b3 | 2024 | static void |
fbb9ce95 | 2025 | print_bad_irq_dependency(struct task_struct *curr, |
24208ca7 ML |
2026 | struct lock_list *prev_root, |
2027 | struct lock_list *next_root, | |
2028 | struct lock_list *backwards_entry, | |
2029 | struct lock_list *forwards_entry, | |
fbb9ce95 IM |
2030 | struct held_lock *prev, |
2031 | struct held_lock *next, | |
2032 | enum lock_usage_bit bit1, | |
2033 | enum lock_usage_bit bit2, | |
2034 | const char *irqclass) | |
2035 | { | |
74c383f1 | 2036 | if (!debug_locks_off_graph_unlock() || debug_locks_silent) |
f7c1c6b3 | 2037 | return; |
fbb9ce95 | 2038 | |
681fbec8 | 2039 | pr_warn("\n"); |
a5dd63ef PM |
2040 | pr_warn("=====================================================\n"); |
2041 | pr_warn("WARNING: %s-safe -> %s-unsafe lock order detected\n", | |
fbb9ce95 | 2042 | irqclass, irqclass); |
fbdc4b9a | 2043 | print_kernel_ident(); |
a5dd63ef | 2044 | pr_warn("-----------------------------------------------------\n"); |
681fbec8 | 2045 | pr_warn("%s/%d [HC%u[%lu]:SC%u[%lu]:HE%u:SE%u] is trying to acquire:\n", |
ba25f9dc | 2046 | curr->comm, task_pid_nr(curr), |
fbb9ce95 IM |
2047 | curr->hardirq_context, hardirq_count() >> HARDIRQ_SHIFT, |
2048 | curr->softirq_context, softirq_count() >> SOFTIRQ_SHIFT, | |
2049 | curr->hardirqs_enabled, | |
2050 | curr->softirqs_enabled); | |
2051 | print_lock(next); | |
2052 | ||
681fbec8 | 2053 | pr_warn("\nand this task is already holding:\n"); |
fbb9ce95 | 2054 | print_lock(prev); |
681fbec8 | 2055 | pr_warn("which would create a new lock dependency:\n"); |
f82b217e | 2056 | print_lock_name(hlock_class(prev)); |
681fbec8 | 2057 | pr_cont(" ->"); |
f82b217e | 2058 | print_lock_name(hlock_class(next)); |
681fbec8 | 2059 | pr_cont("\n"); |
fbb9ce95 | 2060 | |
681fbec8 | 2061 | pr_warn("\nbut this new dependency connects a %s-irq-safe lock:\n", |
fbb9ce95 | 2062 | irqclass); |
24208ca7 | 2063 | print_lock_name(backwards_entry->class); |
681fbec8 | 2064 | pr_warn("\n... which became %s-irq-safe at:\n", irqclass); |
fbb9ce95 | 2065 | |
12593b74 | 2066 | print_lock_trace(backwards_entry->class->usage_traces[bit1], 1); |
fbb9ce95 | 2067 | |
681fbec8 | 2068 | pr_warn("\nto a %s-irq-unsafe lock:\n", irqclass); |
24208ca7 | 2069 | print_lock_name(forwards_entry->class); |
681fbec8 PM |
2070 | pr_warn("\n... which became %s-irq-unsafe at:\n", irqclass); |
2071 | pr_warn("..."); | |
fbb9ce95 | 2072 | |
12593b74 | 2073 | print_lock_trace(forwards_entry->class->usage_traces[bit2], 1); |
fbb9ce95 | 2074 | |
681fbec8 | 2075 | pr_warn("\nother info that might help us debug this:\n\n"); |
dad3d743 SR |
2076 | print_irq_lock_scenario(backwards_entry, forwards_entry, |
2077 | hlock_class(prev), hlock_class(next)); | |
3003eba3 | 2078 | |
fbb9ce95 IM |
2079 | lockdep_print_held_locks(curr); |
2080 | ||
681fbec8 | 2081 | pr_warn("\nthe dependencies between %s-irq-safe lock and the holding lock:\n", irqclass); |
12593b74 BVA |
2082 | prev_root->trace = save_trace(); |
2083 | if (!prev_root->trace) | |
f7c1c6b3 | 2084 | return; |
24208ca7 | 2085 | print_shortest_lock_dependencies(backwards_entry, prev_root); |
fbb9ce95 | 2086 | |
681fbec8 PM |
2087 | pr_warn("\nthe dependencies between the lock to be acquired"); |
2088 | pr_warn(" and %s-irq-unsafe lock:\n", irqclass); | |
12593b74 BVA |
2089 | next_root->trace = save_trace(); |
2090 | if (!next_root->trace) | |
f7c1c6b3 | 2091 | return; |
24208ca7 | 2092 | print_shortest_lock_dependencies(forwards_entry, next_root); |
fbb9ce95 | 2093 | |
681fbec8 | 2094 | pr_warn("\nstack backtrace:\n"); |
fbb9ce95 | 2095 | dump_stack(); |
fbb9ce95 IM |
2096 | } |
2097 | ||
4f367d8a PZ |
2098 | static const char *state_names[] = { |
2099 | #define LOCKDEP_STATE(__STATE) \ | |
b4b136f4 | 2100 | __stringify(__STATE), |
4f367d8a PZ |
2101 | #include "lockdep_states.h" |
2102 | #undef LOCKDEP_STATE | |
2103 | }; | |
2104 | ||
2105 | static const char *state_rnames[] = { | |
2106 | #define LOCKDEP_STATE(__STATE) \ | |
b4b136f4 | 2107 | __stringify(__STATE)"-READ", |
4f367d8a PZ |
2108 | #include "lockdep_states.h" |
2109 | #undef LOCKDEP_STATE | |
2110 | }; | |
2111 | ||
2112 | static inline const char *state_name(enum lock_usage_bit bit) | |
8e18257d | 2113 | { |
c902a1e8 FW |
2114 | if (bit & LOCK_USAGE_READ_MASK) |
2115 | return state_rnames[bit >> LOCK_USAGE_DIR_MASK]; | |
2116 | else | |
2117 | return state_names[bit >> LOCK_USAGE_DIR_MASK]; | |
4f367d8a | 2118 | } |
8e18257d | 2119 | |
948f8376 FW |
2120 | /* |
2121 | * The bit number is encoded like: | |
2122 | * | |
2123 | * bit0: 0 exclusive, 1 read lock | |
2124 | * bit1: 0 used in irq, 1 irq enabled | |
2125 | * bit2-n: state | |
2126 | */ | |
4f367d8a PZ |
2127 | static int exclusive_bit(int new_bit) |
2128 | { | |
bba2a8f1 FW |
2129 | int state = new_bit & LOCK_USAGE_STATE_MASK; |
2130 | int dir = new_bit & LOCK_USAGE_DIR_MASK; | |
8e18257d PZ |
2131 | |
2132 | /* | |
4f367d8a | 2133 | * keep state, bit flip the direction and strip read. |
8e18257d | 2134 | */ |
bba2a8f1 | 2135 | return state | (dir ^ LOCK_USAGE_DIR_MASK); |
4f367d8a PZ |
2136 | } |
2137 | ||
948f8376 FW |
2138 | /* |
2139 | * Observe that when given a bitmask where each bitnr is encoded as above, a | |
2140 | * right shift of the mask transforms the individual bitnrs as -1 and | |
2141 | * conversely, a left shift transforms into +1 for the individual bitnrs. | |
2142 | * | |
2143 | * So for all bits whose number have LOCK_ENABLED_* set (bitnr1 == 1), we can | |
2144 | * create the mask with those bit numbers using LOCK_USED_IN_* (bitnr1 == 0) | |
2145 | * instead by subtracting the bit number by 2, or shifting the mask right by 2. | |
2146 | * | |
2147 | * Similarly, bitnr1 == 0 becomes bitnr1 == 1 by adding 2, or shifting left 2. | |
2148 | * | |
2149 | * So split the mask (note that LOCKF_ENABLED_IRQ_ALL|LOCKF_USED_IN_IRQ_ALL is | |
2150 | * all bits set) and recompose with bitnr1 flipped. | |
2151 | */ | |
2152 | static unsigned long invert_dir_mask(unsigned long mask) | |
2153 | { | |
2154 | unsigned long excl = 0; | |
2155 | ||
2156 | /* Invert dir */ | |
2157 | excl |= (mask & LOCKF_ENABLED_IRQ_ALL) >> LOCK_USAGE_DIR_MASK; | |
2158 | excl |= (mask & LOCKF_USED_IN_IRQ_ALL) << LOCK_USAGE_DIR_MASK; | |
2159 | ||
2160 | return excl; | |
2161 | } | |
2162 | ||
2163 | /* | |
2164 | * As above, we clear bitnr0 (LOCK_*_READ off) with bitmask ops. First, for all | |
2165 | * bits with bitnr0 set (LOCK_*_READ), add those with bitnr0 cleared (LOCK_*). | |
2166 | * And then mask out all bitnr0. | |
2167 | */ | |
2168 | static unsigned long exclusive_mask(unsigned long mask) | |
2169 | { | |
2170 | unsigned long excl = invert_dir_mask(mask); | |
2171 | ||
2172 | /* Strip read */ | |
2173 | excl |= (excl & LOCKF_IRQ_READ) >> LOCK_USAGE_READ_MASK; | |
2174 | excl &= ~LOCKF_IRQ_READ; | |
2175 | ||
2176 | return excl; | |
2177 | } | |
2178 | ||
2179 | /* | |
2180 | * Retrieve the _possible_ original mask to which @mask is | |
2181 | * exclusive. Ie: this is the opposite of exclusive_mask(). | |
2182 | * Note that 2 possible original bits can match an exclusive | |
2183 | * bit: one has LOCK_USAGE_READ_MASK set, the other has it | |
2184 | * cleared. So both are returned for each exclusive bit. | |
2185 | */ | |
2186 | static unsigned long original_mask(unsigned long mask) | |
2187 | { | |
2188 | unsigned long excl = invert_dir_mask(mask); | |
2189 | ||
2190 | /* Include read in existing usages */ | |
2191 | excl |= (excl & LOCKF_IRQ) << LOCK_USAGE_READ_MASK; | |
2192 | ||
2193 | return excl; | |
2194 | } | |
2195 | ||
2196 | /* | |
2197 | * Find the first pair of bit match between an original | |
2198 | * usage mask and an exclusive usage mask. | |
2199 | */ | |
2200 | static int find_exclusive_match(unsigned long mask, | |
2201 | unsigned long excl_mask, | |
2202 | enum lock_usage_bit *bitp, | |
2203 | enum lock_usage_bit *excl_bitp) | |
2204 | { | |
2205 | int bit, excl; | |
2206 | ||
2207 | for_each_set_bit(bit, &mask, LOCK_USED) { | |
2208 | excl = exclusive_bit(bit); | |
2209 | if (excl_mask & lock_flag(excl)) { | |
2210 | *bitp = bit; | |
2211 | *excl_bitp = excl; | |
2212 | return 0; | |
2213 | } | |
2214 | } | |
2215 | return -1; | |
2216 | } | |
2217 | ||
2218 | /* | |
2219 | * Prove that the new dependency does not connect a hardirq-safe(-read) | |
2220 | * lock with a hardirq-unsafe lock - to achieve this we search | |
2221 | * the backwards-subgraph starting at <prev>, and the | |
2222 | * forwards-subgraph starting at <next>: | |
2223 | */ | |
4f367d8a | 2224 | static int check_irq_usage(struct task_struct *curr, struct held_lock *prev, |
948f8376 | 2225 | struct held_lock *next) |
4f367d8a | 2226 | { |
948f8376 FW |
2227 | unsigned long usage_mask = 0, forward_mask, backward_mask; |
2228 | enum lock_usage_bit forward_bit = 0, backward_bit = 0; | |
2229 | struct lock_list *uninitialized_var(target_entry1); | |
2230 | struct lock_list *uninitialized_var(target_entry); | |
2231 | struct lock_list this, that; | |
2232 | int ret; | |
2233 | ||
8e18257d | 2234 | /* |
948f8376 FW |
2235 | * Step 1: gather all hard/soft IRQs usages backward in an |
2236 | * accumulated usage mask. | |
8e18257d | 2237 | */ |
948f8376 FW |
2238 | this.parent = NULL; |
2239 | this.class = hlock_class(prev); | |
8e18257d | 2240 | |
948f8376 | 2241 | ret = __bfs_backwards(&this, &usage_mask, usage_accumulate, NULL); |
f7c1c6b3 YD |
2242 | if (ret < 0) { |
2243 | print_bfs_bug(ret); | |
2244 | return 0; | |
2245 | } | |
8e18257d | 2246 | |
948f8376 FW |
2247 | usage_mask &= LOCKF_USED_IN_IRQ_ALL; |
2248 | if (!usage_mask) | |
2249 | return 1; | |
4f367d8a | 2250 | |
cf40bd16 | 2251 | /* |
948f8376 FW |
2252 | * Step 2: find exclusive uses forward that match the previous |
2253 | * backward accumulated mask. | |
cf40bd16 | 2254 | */ |
948f8376 | 2255 | forward_mask = exclusive_mask(usage_mask); |
cf40bd16 | 2256 | |
948f8376 FW |
2257 | that.parent = NULL; |
2258 | that.class = hlock_class(next); | |
4f367d8a | 2259 | |
948f8376 | 2260 | ret = find_usage_forwards(&that, forward_mask, &target_entry1); |
f7c1c6b3 YD |
2261 | if (ret < 0) { |
2262 | print_bfs_bug(ret); | |
2263 | return 0; | |
2264 | } | |
948f8376 FW |
2265 | if (ret == 1) |
2266 | return ret; | |
cf40bd16 | 2267 | |
948f8376 FW |
2268 | /* |
2269 | * Step 3: we found a bad match! Now retrieve a lock from the backward | |
2270 | * list whose usage mask matches the exclusive usage mask from the | |
2271 | * lock found on the forward list. | |
2272 | */ | |
2273 | backward_mask = original_mask(target_entry1->class->usage_mask); | |
2274 | ||
2275 | ret = find_usage_backwards(&this, backward_mask, &target_entry); | |
f7c1c6b3 YD |
2276 | if (ret < 0) { |
2277 | print_bfs_bug(ret); | |
2278 | return 0; | |
2279 | } | |
948f8376 FW |
2280 | if (DEBUG_LOCKS_WARN_ON(ret == 1)) |
2281 | return 1; | |
2282 | ||
2283 | /* | |
2284 | * Step 4: narrow down to a pair of incompatible usage bits | |
2285 | * and report it. | |
2286 | */ | |
2287 | ret = find_exclusive_match(target_entry->class->usage_mask, | |
2288 | target_entry1->class->usage_mask, | |
2289 | &backward_bit, &forward_bit); | |
2290 | if (DEBUG_LOCKS_WARN_ON(ret == -1)) | |
2291 | return 1; | |
2292 | ||
f7c1c6b3 YD |
2293 | print_bad_irq_dependency(curr, &this, &that, |
2294 | target_entry, target_entry1, | |
2295 | prev, next, | |
2296 | backward_bit, forward_bit, | |
2297 | state_name(backward_bit)); | |
2298 | ||
2299 | return 0; | |
8e18257d PZ |
2300 | } |
2301 | ||
2302 | static void inc_chains(void) | |
2303 | { | |
2304 | if (current->hardirq_context) | |
2305 | nr_hardirq_chains++; | |
2306 | else { | |
2307 | if (current->softirq_context) | |
2308 | nr_softirq_chains++; | |
2309 | else | |
2310 | nr_process_chains++; | |
2311 | } | |
2312 | } | |
2313 | ||
2314 | #else | |
2315 | ||
948f8376 FW |
2316 | static inline int check_irq_usage(struct task_struct *curr, |
2317 | struct held_lock *prev, struct held_lock *next) | |
8e18257d PZ |
2318 | { |
2319 | return 1; | |
2320 | } | |
2321 | ||
2322 | static inline void inc_chains(void) | |
2323 | { | |
2324 | nr_process_chains++; | |
2325 | } | |
2326 | ||
e7a38f63 | 2327 | #endif /* CONFIG_TRACE_IRQFLAGS */ |
fbb9ce95 | 2328 | |
48702ecf | 2329 | static void |
f7c1c6b3 | 2330 | print_deadlock_scenario(struct held_lock *nxt, struct held_lock *prv) |
48702ecf SR |
2331 | { |
2332 | struct lock_class *next = hlock_class(nxt); | |
2333 | struct lock_class *prev = hlock_class(prv); | |
2334 | ||
2335 | printk(" Possible unsafe locking scenario:\n\n"); | |
2336 | printk(" CPU0\n"); | |
2337 | printk(" ----\n"); | |
2338 | printk(" lock("); | |
2339 | __print_lock_name(prev); | |
f943fe0f | 2340 | printk(KERN_CONT ");\n"); |
48702ecf SR |
2341 | printk(" lock("); |
2342 | __print_lock_name(next); | |
f943fe0f | 2343 | printk(KERN_CONT ");\n"); |
48702ecf SR |
2344 | printk("\n *** DEADLOCK ***\n\n"); |
2345 | printk(" May be due to missing lock nesting notation\n\n"); | |
2346 | } | |
2347 | ||
f7c1c6b3 | 2348 | static void |
fbb9ce95 IM |
2349 | print_deadlock_bug(struct task_struct *curr, struct held_lock *prev, |
2350 | struct held_lock *next) | |
2351 | { | |
74c383f1 | 2352 | if (!debug_locks_off_graph_unlock() || debug_locks_silent) |
f7c1c6b3 | 2353 | return; |
fbb9ce95 | 2354 | |
681fbec8 | 2355 | pr_warn("\n"); |
a5dd63ef PM |
2356 | pr_warn("============================================\n"); |
2357 | pr_warn("WARNING: possible recursive locking detected\n"); | |
fbdc4b9a | 2358 | print_kernel_ident(); |
a5dd63ef | 2359 | pr_warn("--------------------------------------------\n"); |
681fbec8 | 2360 | pr_warn("%s/%d is trying to acquire lock:\n", |
ba25f9dc | 2361 | curr->comm, task_pid_nr(curr)); |
fbb9ce95 | 2362 | print_lock(next); |
681fbec8 | 2363 | pr_warn("\nbut task is already holding lock:\n"); |
fbb9ce95 IM |
2364 | print_lock(prev); |
2365 | ||
681fbec8 | 2366 | pr_warn("\nother info that might help us debug this:\n"); |
48702ecf | 2367 | print_deadlock_scenario(next, prev); |
fbb9ce95 IM |
2368 | lockdep_print_held_locks(curr); |
2369 | ||
681fbec8 | 2370 | pr_warn("\nstack backtrace:\n"); |
fbb9ce95 | 2371 | dump_stack(); |
fbb9ce95 IM |
2372 | } |
2373 | ||
2374 | /* | |
2375 | * Check whether we are holding such a class already. | |
2376 | * | |
2377 | * (Note that this has to be done separately, because the graph cannot | |
2378 | * detect such classes of deadlocks.) | |
2379 | * | |
2380 | * Returns: 0 on deadlock detected, 1 on OK, 2 on recursive read | |
2381 | */ | |
2382 | static int | |
4609c4f9 | 2383 | check_deadlock(struct task_struct *curr, struct held_lock *next) |
fbb9ce95 IM |
2384 | { |
2385 | struct held_lock *prev; | |
7531e2f3 | 2386 | struct held_lock *nest = NULL; |
fbb9ce95 IM |
2387 | int i; |
2388 | ||
2389 | for (i = 0; i < curr->lockdep_depth; i++) { | |
2390 | prev = curr->held_locks + i; | |
7531e2f3 PZ |
2391 | |
2392 | if (prev->instance == next->nest_lock) | |
2393 | nest = prev; | |
2394 | ||
f82b217e | 2395 | if (hlock_class(prev) != hlock_class(next)) |
fbb9ce95 | 2396 | continue; |
7531e2f3 | 2397 | |
fbb9ce95 IM |
2398 | /* |
2399 | * Allow read-after-read recursion of the same | |
6c9076ec | 2400 | * lock class (i.e. read_lock(lock)+read_lock(lock)): |
fbb9ce95 | 2401 | */ |
4609c4f9 | 2402 | if ((next->read == 2) && prev->read) |
fbb9ce95 | 2403 | return 2; |
7531e2f3 PZ |
2404 | |
2405 | /* | |
2406 | * We're holding the nest_lock, which serializes this lock's | |
2407 | * nesting behaviour. | |
2408 | */ | |
2409 | if (nest) | |
2410 | return 2; | |
2411 | ||
f7c1c6b3 YD |
2412 | print_deadlock_bug(curr, prev, next); |
2413 | return 0; | |
fbb9ce95 IM |
2414 | } |
2415 | return 1; | |
2416 | } | |
2417 | ||
2418 | /* | |
2419 | * There was a chain-cache miss, and we are about to add a new dependency | |
154f185e | 2420 | * to a previous lock. We validate the following rules: |
fbb9ce95 IM |
2421 | * |
2422 | * - would the adding of the <prev> -> <next> dependency create a | |
2423 | * circular dependency in the graph? [== circular deadlock] | |
2424 | * | |
2425 | * - does the new prev->next dependency connect any hardirq-safe lock | |
2426 | * (in the full backwards-subgraph starting at <prev>) with any | |
2427 | * hardirq-unsafe lock (in the full forwards-subgraph starting at | |
2428 | * <next>)? [== illegal lock inversion with hardirq contexts] | |
2429 | * | |
2430 | * - does the new prev->next dependency connect any softirq-safe lock | |
2431 | * (in the full backwards-subgraph starting at <prev>) with any | |
2432 | * softirq-unsafe lock (in the full forwards-subgraph starting at | |
2433 | * <next>)? [== illegal lock inversion with softirq contexts] | |
2434 | * | |
2435 | * any of these scenarios could lead to a deadlock. | |
2436 | * | |
2437 | * Then if all the validations pass, we add the forwards and backwards | |
2438 | * dependency. | |
2439 | */ | |
2440 | static int | |
2441 | check_prev_add(struct task_struct *curr, struct held_lock *prev, | |
12593b74 BVA |
2442 | struct held_lock *next, int distance, |
2443 | struct lock_trace **const trace) | |
fbb9ce95 IM |
2444 | { |
2445 | struct lock_list *entry; | |
8b405d5c | 2446 | int ret; |
fbb9ce95 | 2447 | |
a0b0fd53 BVA |
2448 | if (!hlock_class(prev)->key || !hlock_class(next)->key) { |
2449 | /* | |
2450 | * The warning statements below may trigger a use-after-free | |
2451 | * of the class name. It is better to trigger a use-after free | |
2452 | * and to have the class name most of the time instead of not | |
2453 | * having the class name available. | |
2454 | */ | |
2455 | WARN_ONCE(!debug_locks_silent && !hlock_class(prev)->key, | |
2456 | "Detected use-after-free of lock class %px/%s\n", | |
2457 | hlock_class(prev), | |
2458 | hlock_class(prev)->name); | |
2459 | WARN_ONCE(!debug_locks_silent && !hlock_class(next)->key, | |
2460 | "Detected use-after-free of lock class %px/%s\n", | |
2461 | hlock_class(next), | |
2462 | hlock_class(next)->name); | |
2463 | return 2; | |
2464 | } | |
2465 | ||
fbb9ce95 IM |
2466 | /* |
2467 | * Prove that the new <prev> -> <next> dependency would not | |
2468 | * create a circular dependency in the graph. (We do this by | |
154f185e YD |
2469 | * a breadth-first search into the graph starting at <next>, |
2470 | * and check whether we can reach <prev>.) | |
fbb9ce95 | 2471 | * |
154f185e YD |
2472 | * The search is limited by the size of the circular queue (i.e., |
2473 | * MAX_CIRCULAR_QUEUE_SIZE) which keeps track of a breadth of nodes | |
2474 | * in the graph whose neighbours are to be checked. | |
fbb9ce95 | 2475 | */ |
8c2c2b44 YD |
2476 | ret = check_noncircular(next, prev, trace); |
2477 | if (unlikely(ret <= 0)) | |
f7c1c6b3 | 2478 | return 0; |
c94aa5ca | 2479 | |
948f8376 | 2480 | if (!check_irq_usage(curr, prev, next)) |
fbb9ce95 IM |
2481 | return 0; |
2482 | ||
fbb9ce95 IM |
2483 | /* |
2484 | * For recursive read-locks we do all the dependency checks, | |
2485 | * but we dont store read-triggered dependencies (only | |
2486 | * write-triggered dependencies). This ensures that only the | |
2487 | * write-side dependencies matter, and that if for example a | |
2488 | * write-lock never takes any other locks, then the reads are | |
2489 | * equivalent to a NOP. | |
2490 | */ | |
2491 | if (next->read == 2 || prev->read == 2) | |
2492 | return 1; | |
2493 | /* | |
2494 | * Is the <prev> -> <next> dependency already present? | |
2495 | * | |
2496 | * (this may occur even though this is a new chain: consider | |
2497 | * e.g. the L1 -> L2 -> L3 -> L4 and the L5 -> L1 -> L2 -> L3 | |
2498 | * chains - the second one will be new, but L1 already has | |
2499 | * L2 added to its dependency list, due to the first chain.) | |
2500 | */ | |
f82b217e DJ |
2501 | list_for_each_entry(entry, &hlock_class(prev)->locks_after, entry) { |
2502 | if (entry->class == hlock_class(next)) { | |
068135e6 JB |
2503 | if (distance == 1) |
2504 | entry->distance = 1; | |
70911fdc | 2505 | return 1; |
068135e6 | 2506 | } |
fbb9ce95 IM |
2507 | } |
2508 | ||
68e9dc29 | 2509 | #ifdef CONFIG_LOCKDEP_SMALL |
ae813308 PZ |
2510 | /* |
2511 | * Is the <prev> -> <next> link redundant? | |
2512 | */ | |
8c2c2b44 YD |
2513 | ret = check_redundant(prev, next); |
2514 | if (ret != 1) | |
2515 | return ret; | |
68e9dc29 | 2516 | #endif |
ae813308 | 2517 | |
12593b74 BVA |
2518 | if (!*trace) { |
2519 | *trace = save_trace(); | |
2520 | if (!*trace) | |
2521 | return 0; | |
2522 | } | |
4726f2a6 | 2523 | |
fbb9ce95 IM |
2524 | /* |
2525 | * Ok, all validations passed, add the new lock | |
2526 | * to the previous lock's dependency list: | |
2527 | */ | |
86cffb80 | 2528 | ret = add_lock_to_list(hlock_class(next), hlock_class(prev), |
f82b217e | 2529 | &hlock_class(prev)->locks_after, |
12593b74 | 2530 | next->acquire_ip, distance, *trace); |
068135e6 | 2531 | |
fbb9ce95 IM |
2532 | if (!ret) |
2533 | return 0; | |
910b1b2e | 2534 | |
86cffb80 | 2535 | ret = add_lock_to_list(hlock_class(prev), hlock_class(next), |
f82b217e | 2536 | &hlock_class(next)->locks_before, |
12593b74 | 2537 | next->acquire_ip, distance, *trace); |
910b1b2e JP |
2538 | if (!ret) |
2539 | return 0; | |
fbb9ce95 | 2540 | |
70911fdc | 2541 | return 2; |
8e18257d | 2542 | } |
fbb9ce95 | 2543 | |
8e18257d PZ |
2544 | /* |
2545 | * Add the dependency to all directly-previous locks that are 'relevant'. | |
2546 | * The ones that are relevant are (in increasing distance from curr): | |
2547 | * all consecutive trylock entries and the final non-trylock entry - or | |
2548 | * the end of this context's lock-chain - whichever comes first. | |
2549 | */ | |
2550 | static int | |
2551 | check_prevs_add(struct task_struct *curr, struct held_lock *next) | |
2552 | { | |
12593b74 | 2553 | struct lock_trace *trace = NULL; |
8e18257d PZ |
2554 | int depth = curr->lockdep_depth; |
2555 | struct held_lock *hlock; | |
d6d897ce | 2556 | |
fbb9ce95 | 2557 | /* |
8e18257d PZ |
2558 | * Debugging checks. |
2559 | * | |
2560 | * Depth must not be zero for a non-head lock: | |
fbb9ce95 | 2561 | */ |
8e18257d PZ |
2562 | if (!depth) |
2563 | goto out_bug; | |
fbb9ce95 | 2564 | /* |
8e18257d PZ |
2565 | * At least two relevant locks must exist for this |
2566 | * to be a head: | |
fbb9ce95 | 2567 | */ |
8e18257d PZ |
2568 | if (curr->held_locks[depth].irq_context != |
2569 | curr->held_locks[depth-1].irq_context) | |
2570 | goto out_bug; | |
74c383f1 | 2571 | |
8e18257d PZ |
2572 | for (;;) { |
2573 | int distance = curr->lockdep_depth - depth + 1; | |
1b5ff816 | 2574 | hlock = curr->held_locks + depth - 1; |
e966eaee | 2575 | |
8e18257d | 2576 | /* |
e966eaee IM |
2577 | * Only non-recursive-read entries get new dependencies |
2578 | * added: | |
8e18257d | 2579 | */ |
e966eaee | 2580 | if (hlock->read != 2 && hlock->check) { |
76b14436 TG |
2581 | int ret = check_prev_add(curr, hlock, next, distance, |
2582 | &trace); | |
e966eaee IM |
2583 | if (!ret) |
2584 | return 0; | |
2585 | ||
ce07a941 | 2586 | /* |
e966eaee IM |
2587 | * Stop after the first non-trylock entry, |
2588 | * as non-trylock entries have added their | |
2589 | * own direct dependencies already, so this | |
2590 | * lock is connected to them indirectly: | |
ce07a941 | 2591 | */ |
e966eaee IM |
2592 | if (!hlock->trylock) |
2593 | break; | |
74c383f1 | 2594 | } |
e966eaee | 2595 | |
8e18257d PZ |
2596 | depth--; |
2597 | /* | |
2598 | * End of lock-stack? | |
2599 | */ | |
2600 | if (!depth) | |
2601 | break; | |
2602 | /* | |
2603 | * Stop the search if we cross into another context: | |
2604 | */ | |
2605 | if (curr->held_locks[depth].irq_context != | |
2606 | curr->held_locks[depth-1].irq_context) | |
2607 | break; | |
fbb9ce95 | 2608 | } |
8e18257d PZ |
2609 | return 1; |
2610 | out_bug: | |
2611 | if (!debug_locks_off_graph_unlock()) | |
2612 | return 0; | |
fbb9ce95 | 2613 | |
0119fee4 PZ |
2614 | /* |
2615 | * Clearly we all shouldn't be here, but since we made it we | |
2616 | * can reliable say we messed up our state. See the above two | |
2617 | * gotos for reasons why we could possibly end up here. | |
2618 | */ | |
8e18257d | 2619 | WARN_ON(1); |
fbb9ce95 | 2620 | |
8e18257d | 2621 | return 0; |
fbb9ce95 IM |
2622 | } |
2623 | ||
443cd507 | 2624 | struct lock_chain lock_chains[MAX_LOCKDEP_CHAINS]; |
de4643a7 | 2625 | static DECLARE_BITMAP(lock_chains_in_use, MAX_LOCKDEP_CHAINS); |
cd1a28e8 | 2626 | int nr_chain_hlocks; |
443cd507 HY |
2627 | static u16 chain_hlocks[MAX_LOCKDEP_CHAIN_HLOCKS]; |
2628 | ||
2629 | struct lock_class *lock_chain_get_class(struct lock_chain *chain, int i) | |
2630 | { | |
2631 | return lock_classes + chain_hlocks[chain->base + i]; | |
2632 | } | |
8e18257d | 2633 | |
9e4e7554 IM |
2634 | /* |
2635 | * Returns the index of the first held_lock of the current chain | |
2636 | */ | |
2637 | static inline int get_first_held_lock(struct task_struct *curr, | |
2638 | struct held_lock *hlock) | |
2639 | { | |
2640 | int i; | |
2641 | struct held_lock *hlock_curr; | |
2642 | ||
2643 | for (i = curr->lockdep_depth - 1; i >= 0; i--) { | |
2644 | hlock_curr = curr->held_locks + i; | |
2645 | if (hlock_curr->irq_context != hlock->irq_context) | |
2646 | break; | |
2647 | ||
2648 | } | |
2649 | ||
2650 | return ++i; | |
2651 | } | |
2652 | ||
5c8a010c | 2653 | #ifdef CONFIG_DEBUG_LOCKDEP |
39e2e173 AAF |
2654 | /* |
2655 | * Returns the next chain_key iteration | |
2656 | */ | |
2657 | static u64 print_chain_key_iteration(int class_idx, u64 chain_key) | |
2658 | { | |
2659 | u64 new_chain_key = iterate_chain_key(chain_key, class_idx); | |
2660 | ||
2661 | printk(" class_idx:%d -> chain_key:%016Lx", | |
2662 | class_idx, | |
2663 | (unsigned long long)new_chain_key); | |
2664 | return new_chain_key; | |
2665 | } | |
2666 | ||
2667 | static void | |
2668 | print_chain_keys_held_locks(struct task_struct *curr, struct held_lock *hlock_next) | |
2669 | { | |
2670 | struct held_lock *hlock; | |
f6ec8829 | 2671 | u64 chain_key = INITIAL_CHAIN_KEY; |
39e2e173 | 2672 | int depth = curr->lockdep_depth; |
834494b2 | 2673 | int i = get_first_held_lock(curr, hlock_next); |
39e2e173 | 2674 | |
834494b2 YD |
2675 | printk("depth: %u (irq_context %u)\n", depth - i + 1, |
2676 | hlock_next->irq_context); | |
2677 | for (; i < depth; i++) { | |
39e2e173 AAF |
2678 | hlock = curr->held_locks + i; |
2679 | chain_key = print_chain_key_iteration(hlock->class_idx, chain_key); | |
2680 | ||
2681 | print_lock(hlock); | |
2682 | } | |
2683 | ||
2684 | print_chain_key_iteration(hlock_next->class_idx, chain_key); | |
2685 | print_lock(hlock_next); | |
2686 | } | |
2687 | ||
2688 | static void print_chain_keys_chain(struct lock_chain *chain) | |
2689 | { | |
2690 | int i; | |
f6ec8829 | 2691 | u64 chain_key = INITIAL_CHAIN_KEY; |
39e2e173 AAF |
2692 | int class_id; |
2693 | ||
2694 | printk("depth: %u\n", chain->depth); | |
2695 | for (i = 0; i < chain->depth; i++) { | |
2696 | class_id = chain_hlocks[chain->base + i]; | |
01bb6f0a | 2697 | chain_key = print_chain_key_iteration(class_id, chain_key); |
39e2e173 AAF |
2698 | |
2699 | print_lock_name(lock_classes + class_id); | |
2700 | printk("\n"); | |
2701 | } | |
2702 | } | |
2703 | ||
2704 | static void print_collision(struct task_struct *curr, | |
2705 | struct held_lock *hlock_next, | |
2706 | struct lock_chain *chain) | |
2707 | { | |
681fbec8 | 2708 | pr_warn("\n"); |
a5dd63ef PM |
2709 | pr_warn("============================\n"); |
2710 | pr_warn("WARNING: chain_key collision\n"); | |
39e2e173 | 2711 | print_kernel_ident(); |
a5dd63ef | 2712 | pr_warn("----------------------------\n"); |
681fbec8 PM |
2713 | pr_warn("%s/%d: ", current->comm, task_pid_nr(current)); |
2714 | pr_warn("Hash chain already cached but the contents don't match!\n"); | |
39e2e173 | 2715 | |
681fbec8 | 2716 | pr_warn("Held locks:"); |
39e2e173 AAF |
2717 | print_chain_keys_held_locks(curr, hlock_next); |
2718 | ||
681fbec8 | 2719 | pr_warn("Locks in cached chain:"); |
39e2e173 AAF |
2720 | print_chain_keys_chain(chain); |
2721 | ||
681fbec8 | 2722 | pr_warn("\nstack backtrace:\n"); |
39e2e173 AAF |
2723 | dump_stack(); |
2724 | } | |
5c8a010c | 2725 | #endif |
39e2e173 | 2726 | |
9e4e7554 IM |
2727 | /* |
2728 | * Checks whether the chain and the current held locks are consistent | |
2729 | * in depth and also in content. If they are not it most likely means | |
2730 | * that there was a collision during the calculation of the chain_key. | |
2731 | * Returns: 0 not passed, 1 passed | |
2732 | */ | |
2733 | static int check_no_collision(struct task_struct *curr, | |
2734 | struct held_lock *hlock, | |
2735 | struct lock_chain *chain) | |
2736 | { | |
2737 | #ifdef CONFIG_DEBUG_LOCKDEP | |
2738 | int i, j, id; | |
2739 | ||
2740 | i = get_first_held_lock(curr, hlock); | |
2741 | ||
39e2e173 AAF |
2742 | if (DEBUG_LOCKS_WARN_ON(chain->depth != curr->lockdep_depth - (i - 1))) { |
2743 | print_collision(curr, hlock, chain); | |
9e4e7554 | 2744 | return 0; |
39e2e173 | 2745 | } |
9e4e7554 IM |
2746 | |
2747 | for (j = 0; j < chain->depth - 1; j++, i++) { | |
01bb6f0a | 2748 | id = curr->held_locks[i].class_idx; |
9e4e7554 | 2749 | |
39e2e173 AAF |
2750 | if (DEBUG_LOCKS_WARN_ON(chain_hlocks[chain->base + j] != id)) { |
2751 | print_collision(curr, hlock, chain); | |
9e4e7554 | 2752 | return 0; |
39e2e173 | 2753 | } |
9e4e7554 IM |
2754 | } |
2755 | #endif | |
2756 | return 1; | |
2757 | } | |
2758 | ||
2212684a BVA |
2759 | /* |
2760 | * Given an index that is >= -1, return the index of the next lock chain. | |
2761 | * Return -2 if there is no next lock chain. | |
2762 | */ | |
2763 | long lockdep_next_lockchain(long i) | |
2764 | { | |
de4643a7 BVA |
2765 | i = find_next_bit(lock_chains_in_use, ARRAY_SIZE(lock_chains), i + 1); |
2766 | return i < ARRAY_SIZE(lock_chains) ? i : -2; | |
2212684a BVA |
2767 | } |
2768 | ||
2769 | unsigned long lock_chain_count(void) | |
2770 | { | |
de4643a7 BVA |
2771 | return bitmap_weight(lock_chains_in_use, ARRAY_SIZE(lock_chains)); |
2772 | } | |
2773 | ||
2774 | /* Must be called with the graph lock held. */ | |
2775 | static struct lock_chain *alloc_lock_chain(void) | |
2776 | { | |
2777 | int idx = find_first_zero_bit(lock_chains_in_use, | |
2778 | ARRAY_SIZE(lock_chains)); | |
2779 | ||
2780 | if (unlikely(idx >= ARRAY_SIZE(lock_chains))) | |
2781 | return NULL; | |
2782 | __set_bit(idx, lock_chains_in_use); | |
2783 | return lock_chains + idx; | |
2212684a BVA |
2784 | } |
2785 | ||
fbb9ce95 | 2786 | /* |
545c23f2 BP |
2787 | * Adds a dependency chain into chain hashtable. And must be called with |
2788 | * graph_lock held. | |
2789 | * | |
2790 | * Return 0 if fail, and graph_lock is released. | |
2791 | * Return 1 if succeed, with graph_lock held. | |
fbb9ce95 | 2792 | */ |
545c23f2 BP |
2793 | static inline int add_chain_cache(struct task_struct *curr, |
2794 | struct held_lock *hlock, | |
2795 | u64 chain_key) | |
fbb9ce95 | 2796 | { |
f82b217e | 2797 | struct lock_class *class = hlock_class(hlock); |
a63f38cc | 2798 | struct hlist_head *hash_head = chainhashentry(chain_key); |
fbb9ce95 | 2799 | struct lock_chain *chain; |
e0944ee6 | 2800 | int i, j; |
fbb9ce95 | 2801 | |
0119fee4 | 2802 | /* |
527af3ea | 2803 | * The caller must hold the graph lock, ensure we've got IRQs |
0119fee4 PZ |
2804 | * disabled to make this an IRQ-safe lock.. for recursion reasons |
2805 | * lockdep won't complain about its own locking errors. | |
2806 | */ | |
381a2292 JP |
2807 | if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) |
2808 | return 0; | |
9e4e7554 | 2809 | |
de4643a7 BVA |
2810 | chain = alloc_lock_chain(); |
2811 | if (!chain) { | |
74c383f1 IM |
2812 | if (!debug_locks_off_graph_unlock()) |
2813 | return 0; | |
2814 | ||
2c522836 | 2815 | print_lockdep_off("BUG: MAX_LOCKDEP_CHAINS too low!"); |
eedeeabd | 2816 | dump_stack(); |
fbb9ce95 IM |
2817 | return 0; |
2818 | } | |
fbb9ce95 | 2819 | chain->chain_key = chain_key; |
443cd507 | 2820 | chain->irq_context = hlock->irq_context; |
9e4e7554 | 2821 | i = get_first_held_lock(curr, hlock); |
443cd507 | 2822 | chain->depth = curr->lockdep_depth + 1 - i; |
75dd602a PZ |
2823 | |
2824 | BUILD_BUG_ON((1UL << 24) <= ARRAY_SIZE(chain_hlocks)); | |
2825 | BUILD_BUG_ON((1UL << 6) <= ARRAY_SIZE(curr->held_locks)); | |
2826 | BUILD_BUG_ON((1UL << 8*sizeof(chain_hlocks[0])) <= ARRAY_SIZE(lock_classes)); | |
2827 | ||
e0944ee6 SR |
2828 | if (likely(nr_chain_hlocks + chain->depth <= MAX_LOCKDEP_CHAIN_HLOCKS)) { |
2829 | chain->base = nr_chain_hlocks; | |
443cd507 | 2830 | for (j = 0; j < chain->depth - 1; j++, i++) { |
01bb6f0a | 2831 | int lock_id = curr->held_locks[i].class_idx; |
443cd507 HY |
2832 | chain_hlocks[chain->base + j] = lock_id; |
2833 | } | |
2834 | chain_hlocks[chain->base + j] = class - lock_classes; | |
75dd602a | 2835 | nr_chain_hlocks += chain->depth; |
523b113b | 2836 | } else { |
f9af456a | 2837 | if (!debug_locks_off_graph_unlock()) |
75dd602a PZ |
2838 | return 0; |
2839 | ||
2840 | print_lockdep_off("BUG: MAX_LOCKDEP_CHAIN_HLOCKS too low!"); | |
2841 | dump_stack(); | |
2842 | return 0; | |
2843 | } | |
75dd602a | 2844 | |
a63f38cc | 2845 | hlist_add_head_rcu(&chain->entry, hash_head); |
bd6d29c2 | 2846 | debug_atomic_inc(chain_lookup_misses); |
8e18257d PZ |
2847 | inc_chains(); |
2848 | ||
2849 | return 1; | |
2850 | } | |
2851 | ||
545c23f2 | 2852 | /* |
a0b0fd53 BVA |
2853 | * Look up a dependency chain. Must be called with either the graph lock or |
2854 | * the RCU read lock held. | |
545c23f2 BP |
2855 | */ |
2856 | static inline struct lock_chain *lookup_chain_cache(u64 chain_key) | |
2857 | { | |
2858 | struct hlist_head *hash_head = chainhashentry(chain_key); | |
2859 | struct lock_chain *chain; | |
2860 | ||
545c23f2 | 2861 | hlist_for_each_entry_rcu(chain, hash_head, entry) { |
a0b0fd53 | 2862 | if (READ_ONCE(chain->chain_key) == chain_key) { |
545c23f2 BP |
2863 | debug_atomic_inc(chain_lookup_hits); |
2864 | return chain; | |
2865 | } | |
2866 | } | |
2867 | return NULL; | |
2868 | } | |
2869 | ||
2870 | /* | |
2871 | * If the key is not present yet in dependency chain cache then | |
2872 | * add it and return 1 - in this case the new dependency chain is | |
2873 | * validated. If the key is already hashed, return 0. | |
2874 | * (On return with 1 graph_lock is held.) | |
2875 | */ | |
2876 | static inline int lookup_chain_cache_add(struct task_struct *curr, | |
2877 | struct held_lock *hlock, | |
2878 | u64 chain_key) | |
2879 | { | |
2880 | struct lock_class *class = hlock_class(hlock); | |
2881 | struct lock_chain *chain = lookup_chain_cache(chain_key); | |
2882 | ||
2883 | if (chain) { | |
2884 | cache_hit: | |
2885 | if (!check_no_collision(curr, hlock, chain)) | |
2886 | return 0; | |
2887 | ||
2888 | if (very_verbose(class)) { | |
2889 | printk("\nhash chain already cached, key: " | |
04860d48 | 2890 | "%016Lx tail class: [%px] %s\n", |
545c23f2 BP |
2891 | (unsigned long long)chain_key, |
2892 | class->key, class->name); | |
2893 | } | |
2894 | ||
2895 | return 0; | |
2896 | } | |
2897 | ||
2898 | if (very_verbose(class)) { | |
04860d48 | 2899 | printk("\nnew hash chain, key: %016Lx tail class: [%px] %s\n", |
545c23f2 BP |
2900 | (unsigned long long)chain_key, class->key, class->name); |
2901 | } | |
2902 | ||
2903 | if (!graph_lock()) | |
2904 | return 0; | |
2905 | ||
2906 | /* | |
2907 | * We have to walk the chain again locked - to avoid duplicates: | |
2908 | */ | |
2909 | chain = lookup_chain_cache(chain_key); | |
2910 | if (chain) { | |
2911 | graph_unlock(); | |
2912 | goto cache_hit; | |
2913 | } | |
2914 | ||
2915 | if (!add_chain_cache(curr, hlock, chain_key)) | |
2916 | return 0; | |
2917 | ||
2918 | return 1; | |
2919 | } | |
2920 | ||
0b9fc8ec YD |
2921 | static int validate_chain(struct task_struct *curr, |
2922 | struct held_lock *hlock, | |
2923 | int chain_head, u64 chain_key) | |
8e18257d PZ |
2924 | { |
2925 | /* | |
2926 | * Trylock needs to maintain the stack of held locks, but it | |
2927 | * does not add new dependencies, because trylock can be done | |
2928 | * in any order. | |
2929 | * | |
2930 | * We look up the chain_key and do the O(N^2) check and update of | |
2931 | * the dependencies only if this is a new dependency chain. | |
545c23f2 | 2932 | * (If lookup_chain_cache_add() return with 1 it acquires |
8e18257d PZ |
2933 | * graph_lock for us) |
2934 | */ | |
fb9edbe9 | 2935 | if (!hlock->trylock && hlock->check && |
545c23f2 | 2936 | lookup_chain_cache_add(curr, hlock, chain_key)) { |
8e18257d PZ |
2937 | /* |
2938 | * Check whether last held lock: | |
2939 | * | |
2940 | * - is irq-safe, if this lock is irq-unsafe | |
2941 | * - is softirq-safe, if this lock is hardirq-unsafe | |
2942 | * | |
2943 | * And check whether the new lock's dependency graph | |
31a490e5 | 2944 | * could lead back to the previous lock: |
8e18257d | 2945 | * |
31a490e5 YD |
2946 | * - within the current held-lock stack |
2947 | * - across our accumulated lock dependency records | |
2948 | * | |
2949 | * any of these scenarios could lead to a deadlock. | |
2950 | */ | |
2951 | /* | |
2952 | * The simple case: does the current hold the same lock | |
2953 | * already? | |
8e18257d | 2954 | */ |
4609c4f9 | 2955 | int ret = check_deadlock(curr, hlock); |
8e18257d PZ |
2956 | |
2957 | if (!ret) | |
2958 | return 0; | |
2959 | /* | |
2960 | * Mark recursive read, as we jump over it when | |
2961 | * building dependencies (just like we jump over | |
2962 | * trylock entries): | |
2963 | */ | |
2964 | if (ret == 2) | |
2965 | hlock->read = 2; | |
2966 | /* | |
2967 | * Add dependency only if this lock is not the head | |
2968 | * of the chain, and if it's not a secondary read-lock: | |
2969 | */ | |
545c23f2 | 2970 | if (!chain_head && ret != 2) { |
8e18257d PZ |
2971 | if (!check_prevs_add(curr, hlock)) |
2972 | return 0; | |
545c23f2 BP |
2973 | } |
2974 | ||
8e18257d | 2975 | graph_unlock(); |
545c23f2 BP |
2976 | } else { |
2977 | /* after lookup_chain_cache_add(): */ | |
8e18257d PZ |
2978 | if (unlikely(!debug_locks)) |
2979 | return 0; | |
545c23f2 | 2980 | } |
fbb9ce95 IM |
2981 | |
2982 | return 1; | |
2983 | } | |
8e18257d PZ |
2984 | #else |
2985 | static inline int validate_chain(struct task_struct *curr, | |
0b9fc8ec YD |
2986 | struct held_lock *hlock, |
2987 | int chain_head, u64 chain_key) | |
8e18257d PZ |
2988 | { |
2989 | return 1; | |
2990 | } | |
e7a38f63 | 2991 | #endif /* CONFIG_PROVE_LOCKING */ |
fbb9ce95 IM |
2992 | |
2993 | /* | |
2994 | * We are building curr_chain_key incrementally, so double-check | |
2995 | * it from scratch, to make sure that it's done correctly: | |
2996 | */ | |
1d09daa5 | 2997 | static void check_chain_key(struct task_struct *curr) |
fbb9ce95 IM |
2998 | { |
2999 | #ifdef CONFIG_DEBUG_LOCKDEP | |
3000 | struct held_lock *hlock, *prev_hlock = NULL; | |
5f18ab5c | 3001 | unsigned int i; |
f6ec8829 | 3002 | u64 chain_key = INITIAL_CHAIN_KEY; |
fbb9ce95 IM |
3003 | |
3004 | for (i = 0; i < curr->lockdep_depth; i++) { | |
3005 | hlock = curr->held_locks + i; | |
3006 | if (chain_key != hlock->prev_chain_key) { | |
3007 | debug_locks_off(); | |
0119fee4 PZ |
3008 | /* |
3009 | * We got mighty confused, our chain keys don't match | |
3010 | * with what we expect, someone trample on our task state? | |
3011 | */ | |
2df8b1d6 | 3012 | WARN(1, "hm#1, depth: %u [%u], %016Lx != %016Lx\n", |
fbb9ce95 IM |
3013 | curr->lockdep_depth, i, |
3014 | (unsigned long long)chain_key, | |
3015 | (unsigned long long)hlock->prev_chain_key); | |
fbb9ce95 IM |
3016 | return; |
3017 | } | |
01bb6f0a | 3018 | |
0119fee4 | 3019 | /* |
01bb6f0a YD |
3020 | * hlock->class_idx can't go beyond MAX_LOCKDEP_KEYS, but is |
3021 | * it registered lock class index? | |
0119fee4 | 3022 | */ |
01bb6f0a | 3023 | if (DEBUG_LOCKS_WARN_ON(!test_bit(hlock->class_idx, lock_classes_in_use))) |
381a2292 JP |
3024 | return; |
3025 | ||
fbb9ce95 IM |
3026 | if (prev_hlock && (prev_hlock->irq_context != |
3027 | hlock->irq_context)) | |
f6ec8829 | 3028 | chain_key = INITIAL_CHAIN_KEY; |
5f18ab5c | 3029 | chain_key = iterate_chain_key(chain_key, hlock->class_idx); |
fbb9ce95 IM |
3030 | prev_hlock = hlock; |
3031 | } | |
3032 | if (chain_key != curr->curr_chain_key) { | |
3033 | debug_locks_off(); | |
0119fee4 PZ |
3034 | /* |
3035 | * More smoking hash instead of calculating it, damn see these | |
3036 | * numbers float.. I bet that a pink elephant stepped on my memory. | |
3037 | */ | |
2df8b1d6 | 3038 | WARN(1, "hm#2, depth: %u [%u], %016Lx != %016Lx\n", |
fbb9ce95 IM |
3039 | curr->lockdep_depth, i, |
3040 | (unsigned long long)chain_key, | |
3041 | (unsigned long long)curr->curr_chain_key); | |
fbb9ce95 IM |
3042 | } |
3043 | #endif | |
3044 | } | |
3045 | ||
30a35f79 | 3046 | #ifdef CONFIG_PROVE_LOCKING |
0d2cc3b3 FW |
3047 | static int mark_lock(struct task_struct *curr, struct held_lock *this, |
3048 | enum lock_usage_bit new_bit); | |
3049 | ||
f7c1c6b3 | 3050 | static void print_usage_bug_scenario(struct held_lock *lock) |
282b5c2f SR |
3051 | { |
3052 | struct lock_class *class = hlock_class(lock); | |
3053 | ||
3054 | printk(" Possible unsafe locking scenario:\n\n"); | |
3055 | printk(" CPU0\n"); | |
3056 | printk(" ----\n"); | |
3057 | printk(" lock("); | |
3058 | __print_lock_name(class); | |
f943fe0f | 3059 | printk(KERN_CONT ");\n"); |
282b5c2f SR |
3060 | printk(" <Interrupt>\n"); |
3061 | printk(" lock("); | |
3062 | __print_lock_name(class); | |
f943fe0f | 3063 | printk(KERN_CONT ");\n"); |
282b5c2f SR |
3064 | printk("\n *** DEADLOCK ***\n\n"); |
3065 | } | |
3066 | ||
f7c1c6b3 | 3067 | static void |
8e18257d PZ |
3068 | print_usage_bug(struct task_struct *curr, struct held_lock *this, |
3069 | enum lock_usage_bit prev_bit, enum lock_usage_bit new_bit) | |
3070 | { | |
3071 | if (!debug_locks_off_graph_unlock() || debug_locks_silent) | |
f7c1c6b3 | 3072 | return; |
8e18257d | 3073 | |
681fbec8 | 3074 | pr_warn("\n"); |
a5dd63ef PM |
3075 | pr_warn("================================\n"); |
3076 | pr_warn("WARNING: inconsistent lock state\n"); | |
fbdc4b9a | 3077 | print_kernel_ident(); |
a5dd63ef | 3078 | pr_warn("--------------------------------\n"); |
8e18257d | 3079 | |
681fbec8 | 3080 | pr_warn("inconsistent {%s} -> {%s} usage.\n", |
8e18257d PZ |
3081 | usage_str[prev_bit], usage_str[new_bit]); |
3082 | ||
681fbec8 | 3083 | pr_warn("%s/%d [HC%u[%lu]:SC%u[%lu]:HE%u:SE%u] takes:\n", |
ba25f9dc | 3084 | curr->comm, task_pid_nr(curr), |
8e18257d PZ |
3085 | trace_hardirq_context(curr), hardirq_count() >> HARDIRQ_SHIFT, |
3086 | trace_softirq_context(curr), softirq_count() >> SOFTIRQ_SHIFT, | |
3087 | trace_hardirqs_enabled(curr), | |
3088 | trace_softirqs_enabled(curr)); | |
3089 | print_lock(this); | |
3090 | ||
681fbec8 | 3091 | pr_warn("{%s} state was registered at:\n", usage_str[prev_bit]); |
12593b74 | 3092 | print_lock_trace(hlock_class(this)->usage_traces[prev_bit], 1); |
8e18257d PZ |
3093 | |
3094 | print_irqtrace_events(curr); | |
681fbec8 | 3095 | pr_warn("\nother info that might help us debug this:\n"); |
282b5c2f SR |
3096 | print_usage_bug_scenario(this); |
3097 | ||
8e18257d PZ |
3098 | lockdep_print_held_locks(curr); |
3099 | ||
681fbec8 | 3100 | pr_warn("\nstack backtrace:\n"); |
8e18257d | 3101 | dump_stack(); |
8e18257d PZ |
3102 | } |
3103 | ||
3104 | /* | |
3105 | * Print out an error if an invalid bit is set: | |
3106 | */ | |
3107 | static inline int | |
3108 | valid_state(struct task_struct *curr, struct held_lock *this, | |
3109 | enum lock_usage_bit new_bit, enum lock_usage_bit bad_bit) | |
3110 | { | |
f7c1c6b3 YD |
3111 | if (unlikely(hlock_class(this)->usage_mask & (1 << bad_bit))) { |
3112 | print_usage_bug(curr, this, bad_bit, new_bit); | |
3113 | return 0; | |
3114 | } | |
8e18257d PZ |
3115 | return 1; |
3116 | } | |
3117 | ||
fbb9ce95 IM |
3118 | |
3119 | /* | |
3120 | * print irq inversion bug: | |
3121 | */ | |
f7c1c6b3 | 3122 | static void |
24208ca7 ML |
3123 | print_irq_inversion_bug(struct task_struct *curr, |
3124 | struct lock_list *root, struct lock_list *other, | |
fbb9ce95 IM |
3125 | struct held_lock *this, int forwards, |
3126 | const char *irqclass) | |
3127 | { | |
dad3d743 SR |
3128 | struct lock_list *entry = other; |
3129 | struct lock_list *middle = NULL; | |
3130 | int depth; | |
3131 | ||
74c383f1 | 3132 | if (!debug_locks_off_graph_unlock() || debug_locks_silent) |
f7c1c6b3 | 3133 | return; |
fbb9ce95 | 3134 | |
681fbec8 | 3135 | pr_warn("\n"); |
a5dd63ef PM |
3136 | pr_warn("========================================================\n"); |
3137 | pr_warn("WARNING: possible irq lock inversion dependency detected\n"); | |
fbdc4b9a | 3138 | print_kernel_ident(); |
a5dd63ef | 3139 | pr_warn("--------------------------------------------------------\n"); |
681fbec8 | 3140 | pr_warn("%s/%d just changed the state of lock:\n", |
ba25f9dc | 3141 | curr->comm, task_pid_nr(curr)); |
fbb9ce95 IM |
3142 | print_lock(this); |
3143 | if (forwards) | |
681fbec8 | 3144 | pr_warn("but this lock took another, %s-unsafe lock in the past:\n", irqclass); |
fbb9ce95 | 3145 | else |
681fbec8 | 3146 | pr_warn("but this lock was taken by another, %s-safe lock in the past:\n", irqclass); |
24208ca7 | 3147 | print_lock_name(other->class); |
681fbec8 | 3148 | pr_warn("\n\nand interrupts could create inverse lock ordering between them.\n\n"); |
fbb9ce95 | 3149 | |
681fbec8 | 3150 | pr_warn("\nother info that might help us debug this:\n"); |
dad3d743 SR |
3151 | |
3152 | /* Find a middle lock (if one exists) */ | |
3153 | depth = get_lock_depth(other); | |
3154 | do { | |
3155 | if (depth == 0 && (entry != root)) { | |
681fbec8 | 3156 | pr_warn("lockdep:%s bad path found in chain graph\n", __func__); |
dad3d743 SR |
3157 | break; |
3158 | } | |
3159 | middle = entry; | |
3160 | entry = get_lock_parent(entry); | |
3161 | depth--; | |
3162 | } while (entry && entry != root && (depth >= 0)); | |
3163 | if (forwards) | |
3164 | print_irq_lock_scenario(root, other, | |
3165 | middle ? middle->class : root->class, other->class); | |
3166 | else | |
3167 | print_irq_lock_scenario(other, root, | |
3168 | middle ? middle->class : other->class, root->class); | |
3169 | ||
fbb9ce95 IM |
3170 | lockdep_print_held_locks(curr); |
3171 | ||
681fbec8 | 3172 | pr_warn("\nthe shortest dependencies between 2nd lock and 1st lock:\n"); |
12593b74 BVA |
3173 | root->trace = save_trace(); |
3174 | if (!root->trace) | |
f7c1c6b3 | 3175 | return; |
24208ca7 | 3176 | print_shortest_lock_dependencies(other, root); |
fbb9ce95 | 3177 | |
681fbec8 | 3178 | pr_warn("\nstack backtrace:\n"); |
fbb9ce95 | 3179 | dump_stack(); |
fbb9ce95 IM |
3180 | } |
3181 | ||
3182 | /* | |
3183 | * Prove that in the forwards-direction subgraph starting at <this> | |
3184 | * there is no lock matching <mask>: | |
3185 | */ | |
3186 | static int | |
3187 | check_usage_forwards(struct task_struct *curr, struct held_lock *this, | |
3188 | enum lock_usage_bit bit, const char *irqclass) | |
3189 | { | |
3190 | int ret; | |
d7aaba14 ML |
3191 | struct lock_list root; |
3192 | struct lock_list *uninitialized_var(target_entry); | |
fbb9ce95 | 3193 | |
d7aaba14 ML |
3194 | root.parent = NULL; |
3195 | root.class = hlock_class(this); | |
627f364d | 3196 | ret = find_usage_forwards(&root, lock_flag(bit), &target_entry); |
f7c1c6b3 YD |
3197 | if (ret < 0) { |
3198 | print_bfs_bug(ret); | |
3199 | return 0; | |
3200 | } | |
af012961 PZ |
3201 | if (ret == 1) |
3202 | return ret; | |
fbb9ce95 | 3203 | |
f7c1c6b3 YD |
3204 | print_irq_inversion_bug(curr, &root, target_entry, |
3205 | this, 1, irqclass); | |
3206 | return 0; | |
fbb9ce95 IM |
3207 | } |
3208 | ||
3209 | /* | |
3210 | * Prove that in the backwards-direction subgraph starting at <this> | |
3211 | * there is no lock matching <mask>: | |
3212 | */ | |
3213 | static int | |
3214 | check_usage_backwards(struct task_struct *curr, struct held_lock *this, | |
3215 | enum lock_usage_bit bit, const char *irqclass) | |
3216 | { | |
3217 | int ret; | |
d7aaba14 ML |
3218 | struct lock_list root; |
3219 | struct lock_list *uninitialized_var(target_entry); | |
fbb9ce95 | 3220 | |
d7aaba14 ML |
3221 | root.parent = NULL; |
3222 | root.class = hlock_class(this); | |
627f364d | 3223 | ret = find_usage_backwards(&root, lock_flag(bit), &target_entry); |
f7c1c6b3 YD |
3224 | if (ret < 0) { |
3225 | print_bfs_bug(ret); | |
3226 | return 0; | |
3227 | } | |
af012961 PZ |
3228 | if (ret == 1) |
3229 | return ret; | |
fbb9ce95 | 3230 | |
f7c1c6b3 YD |
3231 | print_irq_inversion_bug(curr, &root, target_entry, |
3232 | this, 0, irqclass); | |
3233 | return 0; | |
fbb9ce95 IM |
3234 | } |
3235 | ||
3117df04 | 3236 | void print_irqtrace_events(struct task_struct *curr) |
fbb9ce95 IM |
3237 | { |
3238 | printk("irq event stamp: %u\n", curr->irq_events); | |
04860d48 | 3239 | printk("hardirqs last enabled at (%u): [<%px>] %pS\n", |
f943fe0f DV |
3240 | curr->hardirq_enable_event, (void *)curr->hardirq_enable_ip, |
3241 | (void *)curr->hardirq_enable_ip); | |
04860d48 | 3242 | printk("hardirqs last disabled at (%u): [<%px>] %pS\n", |
f943fe0f DV |
3243 | curr->hardirq_disable_event, (void *)curr->hardirq_disable_ip, |
3244 | (void *)curr->hardirq_disable_ip); | |
04860d48 | 3245 | printk("softirqs last enabled at (%u): [<%px>] %pS\n", |
f943fe0f DV |
3246 | curr->softirq_enable_event, (void *)curr->softirq_enable_ip, |
3247 | (void *)curr->softirq_enable_ip); | |
04860d48 | 3248 | printk("softirqs last disabled at (%u): [<%px>] %pS\n", |
f943fe0f DV |
3249 | curr->softirq_disable_event, (void *)curr->softirq_disable_ip, |
3250 | (void *)curr->softirq_disable_ip); | |
fbb9ce95 IM |
3251 | } |
3252 | ||
cd95302d | 3253 | static int HARDIRQ_verbose(struct lock_class *class) |
fbb9ce95 | 3254 | { |
8e18257d PZ |
3255 | #if HARDIRQ_VERBOSE |
3256 | return class_filter(class); | |
3257 | #endif | |
fbb9ce95 IM |
3258 | return 0; |
3259 | } | |
3260 | ||
cd95302d | 3261 | static int SOFTIRQ_verbose(struct lock_class *class) |
fbb9ce95 | 3262 | { |
8e18257d PZ |
3263 | #if SOFTIRQ_VERBOSE |
3264 | return class_filter(class); | |
3265 | #endif | |
3266 | return 0; | |
fbb9ce95 IM |
3267 | } |
3268 | ||
3269 | #define STRICT_READ_CHECKS 1 | |
3270 | ||
cd95302d PZ |
3271 | static int (*state_verbose_f[])(struct lock_class *class) = { |
3272 | #define LOCKDEP_STATE(__STATE) \ | |
3273 | __STATE##_verbose, | |
3274 | #include "lockdep_states.h" | |
3275 | #undef LOCKDEP_STATE | |
3276 | }; | |
3277 | ||
3278 | static inline int state_verbose(enum lock_usage_bit bit, | |
3279 | struct lock_class *class) | |
3280 | { | |
c902a1e8 | 3281 | return state_verbose_f[bit >> LOCK_USAGE_DIR_MASK](class); |
cd95302d PZ |
3282 | } |
3283 | ||
42c50d54 PZ |
3284 | typedef int (*check_usage_f)(struct task_struct *, struct held_lock *, |
3285 | enum lock_usage_bit bit, const char *name); | |
3286 | ||
6a6904d3 | 3287 | static int |
1c21f14e PZ |
3288 | mark_lock_irq(struct task_struct *curr, struct held_lock *this, |
3289 | enum lock_usage_bit new_bit) | |
6a6904d3 | 3290 | { |
f989209e | 3291 | int excl_bit = exclusive_bit(new_bit); |
bba2a8f1 FW |
3292 | int read = new_bit & LOCK_USAGE_READ_MASK; |
3293 | int dir = new_bit & LOCK_USAGE_DIR_MASK; | |
42c50d54 | 3294 | |
38aa2714 PZ |
3295 | /* |
3296 | * mark USED_IN has to look forwards -- to ensure no dependency | |
3297 | * has ENABLED state, which would allow recursion deadlocks. | |
3298 | * | |
3299 | * mark ENABLED has to look backwards -- to ensure no dependee | |
3300 | * has USED_IN state, which, again, would allow recursion deadlocks. | |
3301 | */ | |
42c50d54 PZ |
3302 | check_usage_f usage = dir ? |
3303 | check_usage_backwards : check_usage_forwards; | |
f989209e | 3304 | |
38aa2714 PZ |
3305 | /* |
3306 | * Validate that this particular lock does not have conflicting | |
3307 | * usage states. | |
3308 | */ | |
6a6904d3 PZ |
3309 | if (!valid_state(curr, this, new_bit, excl_bit)) |
3310 | return 0; | |
42c50d54 | 3311 | |
38aa2714 PZ |
3312 | /* |
3313 | * Validate that the lock dependencies don't have conflicting usage | |
3314 | * states. | |
3315 | */ | |
bf998b98 | 3316 | if ((!read || STRICT_READ_CHECKS) && |
bba2a8f1 | 3317 | !usage(curr, this, excl_bit, state_name(new_bit & ~LOCK_USAGE_READ_MASK))) |
6a6904d3 | 3318 | return 0; |
780e820b | 3319 | |
38aa2714 PZ |
3320 | /* |
3321 | * Check for read in write conflicts | |
3322 | */ | |
3323 | if (!read) { | |
bba2a8f1 | 3324 | if (!valid_state(curr, this, new_bit, excl_bit + LOCK_USAGE_READ_MASK)) |
38aa2714 PZ |
3325 | return 0; |
3326 | ||
3327 | if (STRICT_READ_CHECKS && | |
bba2a8f1 FW |
3328 | !usage(curr, this, excl_bit + LOCK_USAGE_READ_MASK, |
3329 | state_name(new_bit + LOCK_USAGE_READ_MASK))) | |
38aa2714 PZ |
3330 | return 0; |
3331 | } | |
780e820b | 3332 | |
cd95302d | 3333 | if (state_verbose(new_bit, hlock_class(this))) |
6a6904d3 PZ |
3334 | return 2; |
3335 | ||
3336 | return 1; | |
3337 | } | |
3338 | ||
fbb9ce95 IM |
3339 | /* |
3340 | * Mark all held locks with a usage bit: | |
3341 | */ | |
1d09daa5 | 3342 | static int |
436a49ae | 3343 | mark_held_locks(struct task_struct *curr, enum lock_usage_bit base_bit) |
fbb9ce95 | 3344 | { |
fbb9ce95 IM |
3345 | struct held_lock *hlock; |
3346 | int i; | |
3347 | ||
3348 | for (i = 0; i < curr->lockdep_depth; i++) { | |
436a49ae | 3349 | enum lock_usage_bit hlock_bit = base_bit; |
fbb9ce95 IM |
3350 | hlock = curr->held_locks + i; |
3351 | ||
cf2ad4d1 | 3352 | if (hlock->read) |
bba2a8f1 | 3353 | hlock_bit += LOCK_USAGE_READ_MASK; |
cf2ad4d1 | 3354 | |
436a49ae | 3355 | BUG_ON(hlock_bit >= LOCK_USAGE_STATES); |
cf40bd16 | 3356 | |
34d0ed5e | 3357 | if (!hlock->check) |
efbe2eee PZ |
3358 | continue; |
3359 | ||
436a49ae | 3360 | if (!mark_lock(curr, hlock, hlock_bit)) |
fbb9ce95 IM |
3361 | return 0; |
3362 | } | |
3363 | ||
3364 | return 1; | |
3365 | } | |
3366 | ||
fbb9ce95 IM |
3367 | /* |
3368 | * Hardirqs will be enabled: | |
3369 | */ | |
dd4e5d3a | 3370 | static void __trace_hardirqs_on_caller(unsigned long ip) |
fbb9ce95 IM |
3371 | { |
3372 | struct task_struct *curr = current; | |
fbb9ce95 | 3373 | |
fbb9ce95 IM |
3374 | /* we'll do an OFF -> ON transition: */ |
3375 | curr->hardirqs_enabled = 1; | |
fbb9ce95 | 3376 | |
fbb9ce95 IM |
3377 | /* |
3378 | * We are going to turn hardirqs on, so set the | |
3379 | * usage bit for all held locks: | |
3380 | */ | |
436a49ae | 3381 | if (!mark_held_locks(curr, LOCK_ENABLED_HARDIRQ)) |
fbb9ce95 IM |
3382 | return; |
3383 | /* | |
3384 | * If we have softirqs enabled, then set the usage | |
3385 | * bit for all held locks. (disabled hardirqs prevented | |
3386 | * this bit from being set before) | |
3387 | */ | |
3388 | if (curr->softirqs_enabled) | |
436a49ae | 3389 | if (!mark_held_locks(curr, LOCK_ENABLED_SOFTIRQ)) |
fbb9ce95 IM |
3390 | return; |
3391 | ||
8e18257d PZ |
3392 | curr->hardirq_enable_ip = ip; |
3393 | curr->hardirq_enable_event = ++curr->irq_events; | |
bd6d29c2 | 3394 | debug_atomic_inc(hardirqs_on_events); |
8e18257d | 3395 | } |
dd4e5d3a | 3396 | |
bff1b208 | 3397 | void lockdep_hardirqs_on(unsigned long ip) |
dd4e5d3a | 3398 | { |
dd4e5d3a PZ |
3399 | if (unlikely(!debug_locks || current->lockdep_recursion)) |
3400 | return; | |
3401 | ||
7d36b26b PZ |
3402 | if (unlikely(current->hardirqs_enabled)) { |
3403 | /* | |
3404 | * Neither irq nor preemption are disabled here | |
3405 | * so this is racy by nature but losing one hit | |
3406 | * in a stat is not a big deal. | |
3407 | */ | |
3408 | __debug_atomic_inc(redundant_hardirqs_on); | |
3409 | return; | |
3410 | } | |
3411 | ||
0119fee4 PZ |
3412 | /* |
3413 | * We're enabling irqs and according to our state above irqs weren't | |
3414 | * already enabled, yet we find the hardware thinks they are in fact | |
3415 | * enabled.. someone messed up their IRQ state tracing. | |
3416 | */ | |
dd4e5d3a PZ |
3417 | if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) |
3418 | return; | |
3419 | ||
0119fee4 PZ |
3420 | /* |
3421 | * See the fine text that goes along with this variable definition. | |
3422 | */ | |
d671002b | 3423 | if (DEBUG_LOCKS_WARN_ON(early_boot_irqs_disabled)) |
7d36b26b PZ |
3424 | return; |
3425 | ||
0119fee4 PZ |
3426 | /* |
3427 | * Can't allow enabling interrupts while in an interrupt handler, | |
3428 | * that's general bad form and such. Recursion, limited stack etc.. | |
3429 | */ | |
7d36b26b PZ |
3430 | if (DEBUG_LOCKS_WARN_ON(current->hardirq_context)) |
3431 | return; | |
3432 | ||
dd4e5d3a PZ |
3433 | current->lockdep_recursion = 1; |
3434 | __trace_hardirqs_on_caller(ip); | |
3435 | current->lockdep_recursion = 0; | |
3436 | } | |
2f43c602 | 3437 | NOKPROBE_SYMBOL(lockdep_hardirqs_on); |
8e18257d PZ |
3438 | |
3439 | /* | |
3440 | * Hardirqs were disabled: | |
3441 | */ | |
bff1b208 | 3442 | void lockdep_hardirqs_off(unsigned long ip) |
8e18257d PZ |
3443 | { |
3444 | struct task_struct *curr = current; | |
3445 | ||
3446 | if (unlikely(!debug_locks || current->lockdep_recursion)) | |
3447 | return; | |
3448 | ||
0119fee4 PZ |
3449 | /* |
3450 | * So we're supposed to get called after you mask local IRQs, but for | |
3451 | * some reason the hardware doesn't quite think you did a proper job. | |
3452 | */ | |
8e18257d PZ |
3453 | if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) |
3454 | return; | |
3455 | ||
3456 | if (curr->hardirqs_enabled) { | |
3457 | /* | |
3458 | * We have done an ON -> OFF transition: | |
3459 | */ | |
3460 | curr->hardirqs_enabled = 0; | |
6afe40b4 | 3461 | curr->hardirq_disable_ip = ip; |
8e18257d | 3462 | curr->hardirq_disable_event = ++curr->irq_events; |
bd6d29c2 | 3463 | debug_atomic_inc(hardirqs_off_events); |
8e18257d | 3464 | } else |
bd6d29c2 | 3465 | debug_atomic_inc(redundant_hardirqs_off); |
8e18257d | 3466 | } |
2f43c602 | 3467 | NOKPROBE_SYMBOL(lockdep_hardirqs_off); |
8e18257d PZ |
3468 | |
3469 | /* | |
3470 | * Softirqs will be enabled: | |
3471 | */ | |
3472 | void trace_softirqs_on(unsigned long ip) | |
3473 | { | |
3474 | struct task_struct *curr = current; | |
3475 | ||
dd4e5d3a | 3476 | if (unlikely(!debug_locks || current->lockdep_recursion)) |
8e18257d PZ |
3477 | return; |
3478 | ||
0119fee4 PZ |
3479 | /* |
3480 | * We fancy IRQs being disabled here, see softirq.c, avoids | |
3481 | * funny state and nesting things. | |
3482 | */ | |
8e18257d PZ |
3483 | if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) |
3484 | return; | |
3485 | ||
3486 | if (curr->softirqs_enabled) { | |
bd6d29c2 | 3487 | debug_atomic_inc(redundant_softirqs_on); |
8e18257d PZ |
3488 | return; |
3489 | } | |
3490 | ||
dd4e5d3a | 3491 | current->lockdep_recursion = 1; |
8e18257d PZ |
3492 | /* |
3493 | * We'll do an OFF -> ON transition: | |
3494 | */ | |
3495 | curr->softirqs_enabled = 1; | |
3496 | curr->softirq_enable_ip = ip; | |
3497 | curr->softirq_enable_event = ++curr->irq_events; | |
bd6d29c2 | 3498 | debug_atomic_inc(softirqs_on_events); |
8e18257d PZ |
3499 | /* |
3500 | * We are going to turn softirqs on, so set the | |
3501 | * usage bit for all held locks, if hardirqs are | |
3502 | * enabled too: | |
3503 | */ | |
3504 | if (curr->hardirqs_enabled) | |
436a49ae | 3505 | mark_held_locks(curr, LOCK_ENABLED_SOFTIRQ); |
dd4e5d3a | 3506 | current->lockdep_recursion = 0; |
8e18257d PZ |
3507 | } |
3508 | ||
3509 | /* | |
3510 | * Softirqs were disabled: | |
3511 | */ | |
3512 | void trace_softirqs_off(unsigned long ip) | |
3513 | { | |
3514 | struct task_struct *curr = current; | |
3515 | ||
dd4e5d3a | 3516 | if (unlikely(!debug_locks || current->lockdep_recursion)) |
8e18257d PZ |
3517 | return; |
3518 | ||
0119fee4 PZ |
3519 | /* |
3520 | * We fancy IRQs being disabled here, see softirq.c | |
3521 | */ | |
8e18257d PZ |
3522 | if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) |
3523 | return; | |
3524 | ||
3525 | if (curr->softirqs_enabled) { | |
3526 | /* | |
3527 | * We have done an ON -> OFF transition: | |
3528 | */ | |
3529 | curr->softirqs_enabled = 0; | |
3530 | curr->softirq_disable_ip = ip; | |
3531 | curr->softirq_disable_event = ++curr->irq_events; | |
bd6d29c2 | 3532 | debug_atomic_inc(softirqs_off_events); |
0119fee4 PZ |
3533 | /* |
3534 | * Whoops, we wanted softirqs off, so why aren't they? | |
3535 | */ | |
8e18257d PZ |
3536 | DEBUG_LOCKS_WARN_ON(!softirq_count()); |
3537 | } else | |
bd6d29c2 | 3538 | debug_atomic_inc(redundant_softirqs_off); |
8e18257d PZ |
3539 | } |
3540 | ||
09180651 YD |
3541 | static int |
3542 | mark_usage(struct task_struct *curr, struct held_lock *hlock, int check) | |
8e18257d | 3543 | { |
09180651 YD |
3544 | if (!check) |
3545 | goto lock_used; | |
3546 | ||
8e18257d PZ |
3547 | /* |
3548 | * If non-trylock use in a hardirq or softirq context, then | |
3549 | * mark the lock as used in these contexts: | |
3550 | */ | |
3551 | if (!hlock->trylock) { | |
3552 | if (hlock->read) { | |
3553 | if (curr->hardirq_context) | |
3554 | if (!mark_lock(curr, hlock, | |
3555 | LOCK_USED_IN_HARDIRQ_READ)) | |
3556 | return 0; | |
3557 | if (curr->softirq_context) | |
3558 | if (!mark_lock(curr, hlock, | |
3559 | LOCK_USED_IN_SOFTIRQ_READ)) | |
3560 | return 0; | |
3561 | } else { | |
3562 | if (curr->hardirq_context) | |
3563 | if (!mark_lock(curr, hlock, LOCK_USED_IN_HARDIRQ)) | |
3564 | return 0; | |
3565 | if (curr->softirq_context) | |
3566 | if (!mark_lock(curr, hlock, LOCK_USED_IN_SOFTIRQ)) | |
3567 | return 0; | |
3568 | } | |
3569 | } | |
3570 | if (!hlock->hardirqs_off) { | |
3571 | if (hlock->read) { | |
3572 | if (!mark_lock(curr, hlock, | |
4fc95e86 | 3573 | LOCK_ENABLED_HARDIRQ_READ)) |
8e18257d PZ |
3574 | return 0; |
3575 | if (curr->softirqs_enabled) | |
3576 | if (!mark_lock(curr, hlock, | |
4fc95e86 | 3577 | LOCK_ENABLED_SOFTIRQ_READ)) |
8e18257d PZ |
3578 | return 0; |
3579 | } else { | |
3580 | if (!mark_lock(curr, hlock, | |
4fc95e86 | 3581 | LOCK_ENABLED_HARDIRQ)) |
8e18257d PZ |
3582 | return 0; |
3583 | if (curr->softirqs_enabled) | |
3584 | if (!mark_lock(curr, hlock, | |
4fc95e86 | 3585 | LOCK_ENABLED_SOFTIRQ)) |
8e18257d PZ |
3586 | return 0; |
3587 | } | |
3588 | } | |
3589 | ||
09180651 YD |
3590 | lock_used: |
3591 | /* mark it as used: */ | |
3592 | if (!mark_lock(curr, hlock, LOCK_USED)) | |
3593 | return 0; | |
3594 | ||
8e18257d PZ |
3595 | return 1; |
3596 | } | |
3597 | ||
c2469756 BF |
3598 | static inline unsigned int task_irq_context(struct task_struct *task) |
3599 | { | |
3600 | return 2 * !!task->hardirq_context + !!task->softirq_context; | |
3601 | } | |
3602 | ||
8e18257d PZ |
3603 | static int separate_irq_context(struct task_struct *curr, |
3604 | struct held_lock *hlock) | |
3605 | { | |
3606 | unsigned int depth = curr->lockdep_depth; | |
3607 | ||
3608 | /* | |
3609 | * Keep track of points where we cross into an interrupt context: | |
3610 | */ | |
8e18257d PZ |
3611 | if (depth) { |
3612 | struct held_lock *prev_hlock; | |
3613 | ||
3614 | prev_hlock = curr->held_locks + depth-1; | |
3615 | /* | |
3616 | * If we cross into another context, reset the | |
3617 | * hash key (this also prevents the checking and the | |
3618 | * adding of the dependency to 'prev'): | |
3619 | */ | |
3620 | if (prev_hlock->irq_context != hlock->irq_context) | |
3621 | return 1; | |
3622 | } | |
3623 | return 0; | |
fbb9ce95 IM |
3624 | } |
3625 | ||
fbb9ce95 | 3626 | /* |
8e18257d | 3627 | * Mark a lock with a usage bit, and validate the state transition: |
fbb9ce95 | 3628 | */ |
1d09daa5 | 3629 | static int mark_lock(struct task_struct *curr, struct held_lock *this, |
0764d23c | 3630 | enum lock_usage_bit new_bit) |
fbb9ce95 | 3631 | { |
8e18257d | 3632 | unsigned int new_mask = 1 << new_bit, ret = 1; |
fbb9ce95 | 3633 | |
4d56330d YD |
3634 | if (new_bit >= LOCK_USAGE_STATES) { |
3635 | DEBUG_LOCKS_WARN_ON(1); | |
3636 | return 0; | |
3637 | } | |
3638 | ||
fbb9ce95 | 3639 | /* |
8e18257d PZ |
3640 | * If already set then do not dirty the cacheline, |
3641 | * nor do any checks: | |
fbb9ce95 | 3642 | */ |
f82b217e | 3643 | if (likely(hlock_class(this)->usage_mask & new_mask)) |
8e18257d PZ |
3644 | return 1; |
3645 | ||
3646 | if (!graph_lock()) | |
3647 | return 0; | |
fbb9ce95 | 3648 | /* |
25985edc | 3649 | * Make sure we didn't race: |
fbb9ce95 | 3650 | */ |
f82b217e | 3651 | if (unlikely(hlock_class(this)->usage_mask & new_mask)) { |
8e18257d PZ |
3652 | graph_unlock(); |
3653 | return 1; | |
3654 | } | |
fbb9ce95 | 3655 | |
f82b217e | 3656 | hlock_class(this)->usage_mask |= new_mask; |
fbb9ce95 | 3657 | |
12593b74 | 3658 | if (!(hlock_class(this)->usage_traces[new_bit] = save_trace())) |
8e18257d | 3659 | return 0; |
fbb9ce95 | 3660 | |
8e18257d | 3661 | switch (new_bit) { |
8e18257d | 3662 | case LOCK_USED: |
bd6d29c2 | 3663 | debug_atomic_dec(nr_unused_locks); |
8e18257d PZ |
3664 | break; |
3665 | default: | |
4d56330d YD |
3666 | ret = mark_lock_irq(curr, this, new_bit); |
3667 | if (!ret) | |
8e18257d | 3668 | return 0; |
8e18257d | 3669 | } |
fbb9ce95 | 3670 | |
8e18257d PZ |
3671 | graph_unlock(); |
3672 | ||
3673 | /* | |
3674 | * We must printk outside of the graph_lock: | |
3675 | */ | |
3676 | if (ret == 2) { | |
3677 | printk("\nmarked lock as {%s}:\n", usage_str[new_bit]); | |
3678 | print_lock(this); | |
3679 | print_irqtrace_events(curr); | |
3680 | dump_stack(); | |
3681 | } | |
3682 | ||
3683 | return ret; | |
3684 | } | |
fbb9ce95 | 3685 | |
30a35f79 | 3686 | #else /* CONFIG_PROVE_LOCKING */ |
886532ae AB |
3687 | |
3688 | static inline int | |
3689 | mark_usage(struct task_struct *curr, struct held_lock *hlock, int check) | |
3690 | { | |
3691 | return 1; | |
3692 | } | |
3693 | ||
3694 | static inline unsigned int task_irq_context(struct task_struct *task) | |
3695 | { | |
3696 | return 0; | |
3697 | } | |
3698 | ||
3699 | static inline int separate_irq_context(struct task_struct *curr, | |
3700 | struct held_lock *hlock) | |
3701 | { | |
3702 | return 0; | |
3703 | } | |
3704 | ||
30a35f79 | 3705 | #endif /* CONFIG_PROVE_LOCKING */ |
886532ae | 3706 | |
fbb9ce95 IM |
3707 | /* |
3708 | * Initialize a lock instance's lock-class mapping info: | |
3709 | */ | |
d35568bd | 3710 | void lockdep_init_map(struct lockdep_map *lock, const char *name, |
4dfbb9d8 | 3711 | struct lock_class_key *key, int subclass) |
fbb9ce95 | 3712 | { |
d3d03d4f YZ |
3713 | int i; |
3714 | ||
d3d03d4f YZ |
3715 | for (i = 0; i < NR_LOCKDEP_CACHING_CLASSES; i++) |
3716 | lock->class_cache[i] = NULL; | |
62016250 | 3717 | |
c8a25005 PZ |
3718 | #ifdef CONFIG_LOCK_STAT |
3719 | lock->cpu = raw_smp_processor_id(); | |
3720 | #endif | |
3721 | ||
0119fee4 PZ |
3722 | /* |
3723 | * Can't be having no nameless bastards around this place! | |
3724 | */ | |
c8a25005 PZ |
3725 | if (DEBUG_LOCKS_WARN_ON(!name)) { |
3726 | lock->name = "NULL"; | |
fbb9ce95 | 3727 | return; |
c8a25005 PZ |
3728 | } |
3729 | ||
3730 | lock->name = name; | |
fbb9ce95 | 3731 | |
0119fee4 PZ |
3732 | /* |
3733 | * No key, no joy, we need to hash something. | |
3734 | */ | |
fbb9ce95 IM |
3735 | if (DEBUG_LOCKS_WARN_ON(!key)) |
3736 | return; | |
fbb9ce95 | 3737 | /* |
108c1485 BVA |
3738 | * Sanity check, the lock-class key must either have been allocated |
3739 | * statically or must have been registered as a dynamic key. | |
fbb9ce95 | 3740 | */ |
108c1485 BVA |
3741 | if (!static_obj(key) && !is_dynamic_key(key)) { |
3742 | if (debug_locks) | |
3743 | printk(KERN_ERR "BUG: key %px has not been registered!\n", key); | |
fbb9ce95 IM |
3744 | DEBUG_LOCKS_WARN_ON(1); |
3745 | return; | |
3746 | } | |
fbb9ce95 | 3747 | lock->key = key; |
c8a25005 PZ |
3748 | |
3749 | if (unlikely(!debug_locks)) | |
3750 | return; | |
3751 | ||
35a9393c PZ |
3752 | if (subclass) { |
3753 | unsigned long flags; | |
3754 | ||
3755 | if (DEBUG_LOCKS_WARN_ON(current->lockdep_recursion)) | |
3756 | return; | |
3757 | ||
3758 | raw_local_irq_save(flags); | |
3759 | current->lockdep_recursion = 1; | |
4dfbb9d8 | 3760 | register_lock_class(lock, subclass, 1); |
35a9393c PZ |
3761 | current->lockdep_recursion = 0; |
3762 | raw_local_irq_restore(flags); | |
3763 | } | |
fbb9ce95 | 3764 | } |
fbb9ce95 IM |
3765 | EXPORT_SYMBOL_GPL(lockdep_init_map); |
3766 | ||
1704f47b | 3767 | struct lock_class_key __lockdep_no_validate__; |
ea6749c7 | 3768 | EXPORT_SYMBOL_GPL(__lockdep_no_validate__); |
1704f47b | 3769 | |
f7c1c6b3 | 3770 | static void |
d0945950 ML |
3771 | print_lock_nested_lock_not_held(struct task_struct *curr, |
3772 | struct held_lock *hlock, | |
3773 | unsigned long ip) | |
3774 | { | |
3775 | if (!debug_locks_off()) | |
f7c1c6b3 | 3776 | return; |
d0945950 | 3777 | if (debug_locks_silent) |
f7c1c6b3 | 3778 | return; |
d0945950 | 3779 | |
681fbec8 | 3780 | pr_warn("\n"); |
a5dd63ef PM |
3781 | pr_warn("==================================\n"); |
3782 | pr_warn("WARNING: Nested lock was not taken\n"); | |
d0945950 | 3783 | print_kernel_ident(); |
a5dd63ef | 3784 | pr_warn("----------------------------------\n"); |
d0945950 | 3785 | |
681fbec8 | 3786 | pr_warn("%s/%d is trying to lock:\n", curr->comm, task_pid_nr(curr)); |
d0945950 ML |
3787 | print_lock(hlock); |
3788 | ||
681fbec8 PM |
3789 | pr_warn("\nbut this task is not holding:\n"); |
3790 | pr_warn("%s\n", hlock->nest_lock->name); | |
d0945950 | 3791 | |
681fbec8 | 3792 | pr_warn("\nstack backtrace:\n"); |
d0945950 ML |
3793 | dump_stack(); |
3794 | ||
681fbec8 | 3795 | pr_warn("\nother info that might help us debug this:\n"); |
d0945950 ML |
3796 | lockdep_print_held_locks(curr); |
3797 | ||
681fbec8 | 3798 | pr_warn("\nstack backtrace:\n"); |
d0945950 | 3799 | dump_stack(); |
d0945950 ML |
3800 | } |
3801 | ||
08f36ff6 | 3802 | static int __lock_is_held(const struct lockdep_map *lock, int read); |
d0945950 | 3803 | |
fbb9ce95 IM |
3804 | /* |
3805 | * This gets called for every mutex_lock*()/spin_lock*() operation. | |
3806 | * We maintain the dependency maps and validate the locking attempt: | |
8ee10862 WL |
3807 | * |
3808 | * The callers must make sure that IRQs are disabled before calling it, | |
3809 | * otherwise we could get an interrupt which would want to take locks, | |
3810 | * which would end up in lockdep again. | |
fbb9ce95 IM |
3811 | */ |
3812 | static int __lock_acquire(struct lockdep_map *lock, unsigned int subclass, | |
3813 | int trylock, int read, int check, int hardirqs_off, | |
bb97a91e | 3814 | struct lockdep_map *nest_lock, unsigned long ip, |
21199f27 | 3815 | int references, int pin_count) |
fbb9ce95 IM |
3816 | { |
3817 | struct task_struct *curr = current; | |
d6d897ce | 3818 | struct lock_class *class = NULL; |
fbb9ce95 | 3819 | struct held_lock *hlock; |
5f18ab5c | 3820 | unsigned int depth; |
fbb9ce95 | 3821 | int chain_head = 0; |
bb97a91e | 3822 | int class_idx; |
fbb9ce95 IM |
3823 | u64 chain_key; |
3824 | ||
3825 | if (unlikely(!debug_locks)) | |
3826 | return 0; | |
3827 | ||
fb9edbe9 ON |
3828 | if (!prove_locking || lock->key == &__lockdep_no_validate__) |
3829 | check = 0; | |
1704f47b | 3830 | |
62016250 HM |
3831 | if (subclass < NR_LOCKDEP_CACHING_CLASSES) |
3832 | class = lock->class_cache[subclass]; | |
d6d897ce | 3833 | /* |
62016250 | 3834 | * Not cached? |
d6d897ce | 3835 | */ |
fbb9ce95 | 3836 | if (unlikely(!class)) { |
4dfbb9d8 | 3837 | class = register_lock_class(lock, subclass, 0); |
fbb9ce95 IM |
3838 | if (!class) |
3839 | return 0; | |
3840 | } | |
8ca2b56c WL |
3841 | |
3842 | debug_class_ops_inc(class); | |
3843 | ||
fbb9ce95 | 3844 | if (very_verbose(class)) { |
04860d48 | 3845 | printk("\nacquire class [%px] %s", class->key, class->name); |
fbb9ce95 | 3846 | if (class->name_version > 1) |
f943fe0f DV |
3847 | printk(KERN_CONT "#%d", class->name_version); |
3848 | printk(KERN_CONT "\n"); | |
fbb9ce95 IM |
3849 | dump_stack(); |
3850 | } | |
3851 | ||
3852 | /* | |
3853 | * Add the lock to the list of currently held locks. | |
3854 | * (we dont increase the depth just yet, up until the | |
3855 | * dependency checks are done) | |
3856 | */ | |
3857 | depth = curr->lockdep_depth; | |
0119fee4 PZ |
3858 | /* |
3859 | * Ran out of static storage for our per-task lock stack again have we? | |
3860 | */ | |
fbb9ce95 IM |
3861 | if (DEBUG_LOCKS_WARN_ON(depth >= MAX_LOCK_DEPTH)) |
3862 | return 0; | |
3863 | ||
01bb6f0a | 3864 | class_idx = class - lock_classes; |
bb97a91e | 3865 | |
e966eaee | 3866 | if (depth) { |
bb97a91e PZ |
3867 | hlock = curr->held_locks + depth - 1; |
3868 | if (hlock->class_idx == class_idx && nest_lock) { | |
d9349850 ID |
3869 | if (!references) |
3870 | references++; | |
7fb4a2ce | 3871 | |
d9349850 | 3872 | if (!hlock->references) |
bb97a91e | 3873 | hlock->references++; |
d9349850 ID |
3874 | |
3875 | hlock->references += references; | |
3876 | ||
3877 | /* Overflow */ | |
3878 | if (DEBUG_LOCKS_WARN_ON(hlock->references < references)) | |
3879 | return 0; | |
bb97a91e | 3880 | |
8c8889d8 | 3881 | return 2; |
bb97a91e PZ |
3882 | } |
3883 | } | |
3884 | ||
fbb9ce95 | 3885 | hlock = curr->held_locks + depth; |
0119fee4 PZ |
3886 | /* |
3887 | * Plain impossible, we just registered it and checked it weren't no | |
3888 | * NULL like.. I bet this mushroom I ate was good! | |
3889 | */ | |
f82b217e DJ |
3890 | if (DEBUG_LOCKS_WARN_ON(!class)) |
3891 | return 0; | |
bb97a91e | 3892 | hlock->class_idx = class_idx; |
fbb9ce95 IM |
3893 | hlock->acquire_ip = ip; |
3894 | hlock->instance = lock; | |
7531e2f3 | 3895 | hlock->nest_lock = nest_lock; |
c2469756 | 3896 | hlock->irq_context = task_irq_context(curr); |
fbb9ce95 IM |
3897 | hlock->trylock = trylock; |
3898 | hlock->read = read; | |
3899 | hlock->check = check; | |
6951b12a | 3900 | hlock->hardirqs_off = !!hardirqs_off; |
bb97a91e | 3901 | hlock->references = references; |
f20786ff PZ |
3902 | #ifdef CONFIG_LOCK_STAT |
3903 | hlock->waittime_stamp = 0; | |
3365e779 | 3904 | hlock->holdtime_stamp = lockstat_clock(); |
f20786ff | 3905 | #endif |
21199f27 | 3906 | hlock->pin_count = pin_count; |
fbb9ce95 | 3907 | |
09180651 YD |
3908 | /* Initialize the lock usage bit */ |
3909 | if (!mark_usage(curr, hlock, check)) | |
fbb9ce95 | 3910 | return 0; |
8e18257d | 3911 | |
fbb9ce95 | 3912 | /* |
17aacfb9 | 3913 | * Calculate the chain hash: it's the combined hash of all the |
fbb9ce95 IM |
3914 | * lock keys along the dependency chain. We save the hash value |
3915 | * at every step so that we can get the current hash easily | |
3916 | * after unlock. The chain hash is then used to cache dependency | |
3917 | * results. | |
3918 | * | |
3919 | * The 'key ID' is what is the most compact key value to drive | |
3920 | * the hash, not class->key. | |
3921 | */ | |
0119fee4 | 3922 | /* |
01bb6f0a | 3923 | * Whoops, we did it again.. class_idx is invalid. |
0119fee4 | 3924 | */ |
01bb6f0a | 3925 | if (DEBUG_LOCKS_WARN_ON(!test_bit(class_idx, lock_classes_in_use))) |
fbb9ce95 IM |
3926 | return 0; |
3927 | ||
3928 | chain_key = curr->curr_chain_key; | |
3929 | if (!depth) { | |
0119fee4 PZ |
3930 | /* |
3931 | * How can we have a chain hash when we ain't got no keys?! | |
3932 | */ | |
f6ec8829 | 3933 | if (DEBUG_LOCKS_WARN_ON(chain_key != INITIAL_CHAIN_KEY)) |
fbb9ce95 IM |
3934 | return 0; |
3935 | chain_head = 1; | |
3936 | } | |
3937 | ||
3938 | hlock->prev_chain_key = chain_key; | |
8e18257d | 3939 | if (separate_irq_context(curr, hlock)) { |
f6ec8829 | 3940 | chain_key = INITIAL_CHAIN_KEY; |
8e18257d | 3941 | chain_head = 1; |
fbb9ce95 | 3942 | } |
5f18ab5c | 3943 | chain_key = iterate_chain_key(chain_key, class_idx); |
fbb9ce95 | 3944 | |
f7c1c6b3 YD |
3945 | if (nest_lock && !__lock_is_held(nest_lock, -1)) { |
3946 | print_lock_nested_lock_not_held(curr, hlock, ip); | |
3947 | return 0; | |
3948 | } | |
d0945950 | 3949 | |
a0b0fd53 BVA |
3950 | if (!debug_locks_silent) { |
3951 | WARN_ON_ONCE(depth && !hlock_class(hlock - 1)->key); | |
3952 | WARN_ON_ONCE(!hlock_class(hlock)->key); | |
3953 | } | |
3954 | ||
0b9fc8ec | 3955 | if (!validate_chain(curr, hlock, chain_head, chain_key)) |
8e18257d | 3956 | return 0; |
381a2292 | 3957 | |
3aa416b0 | 3958 | curr->curr_chain_key = chain_key; |
fbb9ce95 IM |
3959 | curr->lockdep_depth++; |
3960 | check_chain_key(curr); | |
60e114d1 JP |
3961 | #ifdef CONFIG_DEBUG_LOCKDEP |
3962 | if (unlikely(!debug_locks)) | |
3963 | return 0; | |
3964 | #endif | |
fbb9ce95 IM |
3965 | if (unlikely(curr->lockdep_depth >= MAX_LOCK_DEPTH)) { |
3966 | debug_locks_off(); | |
2c522836 DJ |
3967 | print_lockdep_off("BUG: MAX_LOCK_DEPTH too low!"); |
3968 | printk(KERN_DEBUG "depth: %i max: %lu!\n", | |
c0540606 | 3969 | curr->lockdep_depth, MAX_LOCK_DEPTH); |
c0540606 BG |
3970 | |
3971 | lockdep_print_held_locks(current); | |
3972 | debug_show_all_locks(); | |
eedeeabd | 3973 | dump_stack(); |
c0540606 | 3974 | |
fbb9ce95 IM |
3975 | return 0; |
3976 | } | |
381a2292 | 3977 | |
fbb9ce95 IM |
3978 | if (unlikely(curr->lockdep_depth > max_lockdep_depth)) |
3979 | max_lockdep_depth = curr->lockdep_depth; | |
3980 | ||
3981 | return 1; | |
3982 | } | |
3983 | ||
f7c1c6b3 YD |
3984 | static void print_unlock_imbalance_bug(struct task_struct *curr, |
3985 | struct lockdep_map *lock, | |
3986 | unsigned long ip) | |
fbb9ce95 IM |
3987 | { |
3988 | if (!debug_locks_off()) | |
f7c1c6b3 | 3989 | return; |
fbb9ce95 | 3990 | if (debug_locks_silent) |
f7c1c6b3 | 3991 | return; |
fbb9ce95 | 3992 | |
681fbec8 | 3993 | pr_warn("\n"); |
a5dd63ef PM |
3994 | pr_warn("=====================================\n"); |
3995 | pr_warn("WARNING: bad unlock balance detected!\n"); | |
fbdc4b9a | 3996 | print_kernel_ident(); |
a5dd63ef | 3997 | pr_warn("-------------------------------------\n"); |
681fbec8 | 3998 | pr_warn("%s/%d is trying to release lock (", |
ba25f9dc | 3999 | curr->comm, task_pid_nr(curr)); |
fbb9ce95 | 4000 | print_lockdep_cache(lock); |
681fbec8 | 4001 | pr_cont(") at:\n"); |
fbb9ce95 | 4002 | print_ip_sym(ip); |
681fbec8 PM |
4003 | pr_warn("but there are no more locks to release!\n"); |
4004 | pr_warn("\nother info that might help us debug this:\n"); | |
fbb9ce95 IM |
4005 | lockdep_print_held_locks(curr); |
4006 | ||
681fbec8 | 4007 | pr_warn("\nstack backtrace:\n"); |
fbb9ce95 | 4008 | dump_stack(); |
fbb9ce95 IM |
4009 | } |
4010 | ||
08f36ff6 MW |
4011 | static int match_held_lock(const struct held_lock *hlock, |
4012 | const struct lockdep_map *lock) | |
bb97a91e PZ |
4013 | { |
4014 | if (hlock->instance == lock) | |
4015 | return 1; | |
4016 | ||
4017 | if (hlock->references) { | |
08f36ff6 | 4018 | const struct lock_class *class = lock->class_cache[0]; |
bb97a91e PZ |
4019 | |
4020 | if (!class) | |
4021 | class = look_up_lock_class(lock, 0); | |
4022 | ||
80e0401e PZ |
4023 | /* |
4024 | * If look_up_lock_class() failed to find a class, we're trying | |
4025 | * to test if we hold a lock that has never yet been acquired. | |
4026 | * Clearly if the lock hasn't been acquired _ever_, we're not | |
4027 | * holding it either, so report failure. | |
4028 | */ | |
64f29d1b | 4029 | if (!class) |
bb97a91e PZ |
4030 | return 0; |
4031 | ||
0119fee4 PZ |
4032 | /* |
4033 | * References, but not a lock we're actually ref-counting? | |
4034 | * State got messed up, follow the sites that change ->references | |
4035 | * and try to make sense of it. | |
4036 | */ | |
bb97a91e PZ |
4037 | if (DEBUG_LOCKS_WARN_ON(!hlock->nest_lock)) |
4038 | return 0; | |
4039 | ||
01bb6f0a | 4040 | if (hlock->class_idx == class - lock_classes) |
bb97a91e PZ |
4041 | return 1; |
4042 | } | |
4043 | ||
4044 | return 0; | |
4045 | } | |
4046 | ||
41c2c5b8 O |
4047 | /* @depth must not be zero */ |
4048 | static struct held_lock *find_held_lock(struct task_struct *curr, | |
4049 | struct lockdep_map *lock, | |
4050 | unsigned int depth, int *idx) | |
4051 | { | |
4052 | struct held_lock *ret, *hlock, *prev_hlock; | |
4053 | int i; | |
4054 | ||
4055 | i = depth - 1; | |
4056 | hlock = curr->held_locks + i; | |
4057 | ret = hlock; | |
4058 | if (match_held_lock(hlock, lock)) | |
4059 | goto out; | |
4060 | ||
4061 | ret = NULL; | |
4062 | for (i--, prev_hlock = hlock--; | |
4063 | i >= 0; | |
4064 | i--, prev_hlock = hlock--) { | |
4065 | /* | |
4066 | * We must not cross into another context: | |
4067 | */ | |
4068 | if (prev_hlock->irq_context != hlock->irq_context) { | |
4069 | ret = NULL; | |
4070 | break; | |
4071 | } | |
4072 | if (match_held_lock(hlock, lock)) { | |
4073 | ret = hlock; | |
4074 | break; | |
4075 | } | |
4076 | } | |
4077 | ||
4078 | out: | |
4079 | *idx = i; | |
4080 | return ret; | |
4081 | } | |
4082 | ||
e969970b | 4083 | static int reacquire_held_locks(struct task_struct *curr, unsigned int depth, |
8c8889d8 | 4084 | int idx, unsigned int *merged) |
e969970b O |
4085 | { |
4086 | struct held_lock *hlock; | |
8c8889d8 | 4087 | int first_idx = idx; |
e969970b | 4088 | |
8ee10862 WL |
4089 | if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) |
4090 | return 0; | |
4091 | ||
e969970b | 4092 | for (hlock = curr->held_locks + idx; idx < depth; idx++, hlock++) { |
8c8889d8 | 4093 | switch (__lock_acquire(hlock->instance, |
e969970b O |
4094 | hlock_class(hlock)->subclass, |
4095 | hlock->trylock, | |
4096 | hlock->read, hlock->check, | |
4097 | hlock->hardirqs_off, | |
4098 | hlock->nest_lock, hlock->acquire_ip, | |
8c8889d8 ID |
4099 | hlock->references, hlock->pin_count)) { |
4100 | case 0: | |
e969970b | 4101 | return 1; |
8c8889d8 ID |
4102 | case 1: |
4103 | break; | |
4104 | case 2: | |
4105 | *merged += (idx == first_idx); | |
4106 | break; | |
4107 | default: | |
4108 | WARN_ON(1); | |
4109 | return 0; | |
4110 | } | |
e969970b O |
4111 | } |
4112 | return 0; | |
4113 | } | |
4114 | ||
64aa348e | 4115 | static int |
00ef9f73 PZ |
4116 | __lock_set_class(struct lockdep_map *lock, const char *name, |
4117 | struct lock_class_key *key, unsigned int subclass, | |
4118 | unsigned long ip) | |
64aa348e PZ |
4119 | { |
4120 | struct task_struct *curr = current; | |
8c8889d8 | 4121 | unsigned int depth, merged = 0; |
41c2c5b8 | 4122 | struct held_lock *hlock; |
64aa348e | 4123 | struct lock_class *class; |
64aa348e PZ |
4124 | int i; |
4125 | ||
513e1073 WL |
4126 | if (unlikely(!debug_locks)) |
4127 | return 0; | |
4128 | ||
64aa348e | 4129 | depth = curr->lockdep_depth; |
0119fee4 PZ |
4130 | /* |
4131 | * This function is about (re)setting the class of a held lock, | |
4132 | * yet we're not actually holding any locks. Naughty user! | |
4133 | */ | |
64aa348e PZ |
4134 | if (DEBUG_LOCKS_WARN_ON(!depth)) |
4135 | return 0; | |
4136 | ||
41c2c5b8 | 4137 | hlock = find_held_lock(curr, lock, depth, &i); |
f7c1c6b3 YD |
4138 | if (!hlock) { |
4139 | print_unlock_imbalance_bug(curr, lock, ip); | |
4140 | return 0; | |
4141 | } | |
64aa348e | 4142 | |
00ef9f73 | 4143 | lockdep_init_map(lock, name, key, 0); |
64aa348e | 4144 | class = register_lock_class(lock, subclass, 0); |
01bb6f0a | 4145 | hlock->class_idx = class - lock_classes; |
64aa348e PZ |
4146 | |
4147 | curr->lockdep_depth = i; | |
4148 | curr->curr_chain_key = hlock->prev_chain_key; | |
4149 | ||
8c8889d8 | 4150 | if (reacquire_held_locks(curr, depth, i, &merged)) |
e969970b | 4151 | return 0; |
64aa348e | 4152 | |
0119fee4 PZ |
4153 | /* |
4154 | * I took it apart and put it back together again, except now I have | |
4155 | * these 'spare' parts.. where shall I put them. | |
4156 | */ | |
8c8889d8 | 4157 | if (DEBUG_LOCKS_WARN_ON(curr->lockdep_depth != depth - merged)) |
64aa348e PZ |
4158 | return 0; |
4159 | return 1; | |
4160 | } | |
4161 | ||
6419c4af O |
4162 | static int __lock_downgrade(struct lockdep_map *lock, unsigned long ip) |
4163 | { | |
4164 | struct task_struct *curr = current; | |
8c8889d8 | 4165 | unsigned int depth, merged = 0; |
6419c4af | 4166 | struct held_lock *hlock; |
6419c4af O |
4167 | int i; |
4168 | ||
71492580 WL |
4169 | if (unlikely(!debug_locks)) |
4170 | return 0; | |
4171 | ||
6419c4af O |
4172 | depth = curr->lockdep_depth; |
4173 | /* | |
4174 | * This function is about (re)setting the class of a held lock, | |
4175 | * yet we're not actually holding any locks. Naughty user! | |
4176 | */ | |
4177 | if (DEBUG_LOCKS_WARN_ON(!depth)) | |
4178 | return 0; | |
4179 | ||
4180 | hlock = find_held_lock(curr, lock, depth, &i); | |
f7c1c6b3 YD |
4181 | if (!hlock) { |
4182 | print_unlock_imbalance_bug(curr, lock, ip); | |
4183 | return 0; | |
4184 | } | |
6419c4af O |
4185 | |
4186 | curr->lockdep_depth = i; | |
4187 | curr->curr_chain_key = hlock->prev_chain_key; | |
4188 | ||
4189 | WARN(hlock->read, "downgrading a read lock"); | |
4190 | hlock->read = 1; | |
4191 | hlock->acquire_ip = ip; | |
4192 | ||
8c8889d8 ID |
4193 | if (reacquire_held_locks(curr, depth, i, &merged)) |
4194 | return 0; | |
4195 | ||
4196 | /* Merging can't happen with unchanged classes.. */ | |
4197 | if (DEBUG_LOCKS_WARN_ON(merged)) | |
6419c4af O |
4198 | return 0; |
4199 | ||
4200 | /* | |
4201 | * I took it apart and put it back together again, except now I have | |
4202 | * these 'spare' parts.. where shall I put them. | |
4203 | */ | |
4204 | if (DEBUG_LOCKS_WARN_ON(curr->lockdep_depth != depth)) | |
4205 | return 0; | |
8c8889d8 | 4206 | |
6419c4af O |
4207 | return 1; |
4208 | } | |
4209 | ||
fbb9ce95 | 4210 | /* |
e0f56fd7 PZ |
4211 | * Remove the lock to the list of currently held locks - this gets |
4212 | * called on mutex_unlock()/spin_unlock*() (or on a failed | |
4213 | * mutex_lock_interruptible()). | |
4214 | * | |
4215 | * @nested is an hysterical artifact, needs a tree wide cleanup. | |
fbb9ce95 IM |
4216 | */ |
4217 | static int | |
b4adfe8e | 4218 | __lock_release(struct lockdep_map *lock, unsigned long ip) |
fbb9ce95 | 4219 | { |
e0f56fd7 | 4220 | struct task_struct *curr = current; |
8c8889d8 | 4221 | unsigned int depth, merged = 1; |
41c2c5b8 | 4222 | struct held_lock *hlock; |
e966eaee | 4223 | int i; |
fbb9ce95 | 4224 | |
e0f56fd7 PZ |
4225 | if (unlikely(!debug_locks)) |
4226 | return 0; | |
4227 | ||
fbb9ce95 | 4228 | depth = curr->lockdep_depth; |
0119fee4 PZ |
4229 | /* |
4230 | * So we're all set to release this lock.. wait what lock? We don't | |
4231 | * own any locks, you've been drinking again? | |
4232 | */ | |
dd471efe | 4233 | if (depth <= 0) { |
f7c1c6b3 YD |
4234 | print_unlock_imbalance_bug(curr, lock, ip); |
4235 | return 0; | |
4236 | } | |
fbb9ce95 | 4237 | |
e0f56fd7 PZ |
4238 | /* |
4239 | * Check whether the lock exists in the current stack | |
4240 | * of held locks: | |
4241 | */ | |
41c2c5b8 | 4242 | hlock = find_held_lock(curr, lock, depth, &i); |
f7c1c6b3 YD |
4243 | if (!hlock) { |
4244 | print_unlock_imbalance_bug(curr, lock, ip); | |
4245 | return 0; | |
4246 | } | |
fbb9ce95 | 4247 | |
bb97a91e PZ |
4248 | if (hlock->instance == lock) |
4249 | lock_release_holdtime(hlock); | |
4250 | ||
a24fc60d PZ |
4251 | WARN(hlock->pin_count, "releasing a pinned lock\n"); |
4252 | ||
bb97a91e PZ |
4253 | if (hlock->references) { |
4254 | hlock->references--; | |
4255 | if (hlock->references) { | |
4256 | /* | |
4257 | * We had, and after removing one, still have | |
4258 | * references, the current lock stack is still | |
4259 | * valid. We're done! | |
4260 | */ | |
4261 | return 1; | |
4262 | } | |
4263 | } | |
f20786ff | 4264 | |
fbb9ce95 IM |
4265 | /* |
4266 | * We have the right lock to unlock, 'hlock' points to it. | |
4267 | * Now we remove it from the stack, and add back the other | |
4268 | * entries (if any), recalculating the hash along the way: | |
4269 | */ | |
bb97a91e | 4270 | |
fbb9ce95 IM |
4271 | curr->lockdep_depth = i; |
4272 | curr->curr_chain_key = hlock->prev_chain_key; | |
4273 | ||
ce52a18d WL |
4274 | /* |
4275 | * The most likely case is when the unlock is on the innermost | |
4276 | * lock. In this case, we are done! | |
4277 | */ | |
4278 | if (i == depth-1) | |
4279 | return 1; | |
4280 | ||
8c8889d8 | 4281 | if (reacquire_held_locks(curr, depth, i + 1, &merged)) |
e969970b | 4282 | return 0; |
fbb9ce95 | 4283 | |
0119fee4 PZ |
4284 | /* |
4285 | * We had N bottles of beer on the wall, we drank one, but now | |
4286 | * there's not N-1 bottles of beer left on the wall... | |
8c8889d8 | 4287 | * Pouring two of the bottles together is acceptable. |
0119fee4 | 4288 | */ |
8c8889d8 | 4289 | DEBUG_LOCKS_WARN_ON(curr->lockdep_depth != depth - merged); |
f20786ff | 4290 | |
ce52a18d WL |
4291 | /* |
4292 | * Since reacquire_held_locks() would have called check_chain_key() | |
4293 | * indirectly via __lock_acquire(), we don't need to do it again | |
4294 | * on return. | |
4295 | */ | |
4296 | return 0; | |
fbb9ce95 IM |
4297 | } |
4298 | ||
2f43c602 MH |
4299 | static nokprobe_inline |
4300 | int __lock_is_held(const struct lockdep_map *lock, int read) | |
fbb9ce95 | 4301 | { |
f607c668 PZ |
4302 | struct task_struct *curr = current; |
4303 | int i; | |
fbb9ce95 | 4304 | |
f607c668 | 4305 | for (i = 0; i < curr->lockdep_depth; i++) { |
bb97a91e | 4306 | struct held_lock *hlock = curr->held_locks + i; |
fbb9ce95 | 4307 | |
f8319483 PZ |
4308 | if (match_held_lock(hlock, lock)) { |
4309 | if (read == -1 || hlock->read == read) | |
4310 | return 1; | |
4311 | ||
4312 | return 0; | |
4313 | } | |
f607c668 | 4314 | } |
f20786ff | 4315 | |
f607c668 | 4316 | return 0; |
fbb9ce95 IM |
4317 | } |
4318 | ||
e7904a28 PZ |
4319 | static struct pin_cookie __lock_pin_lock(struct lockdep_map *lock) |
4320 | { | |
4321 | struct pin_cookie cookie = NIL_COOKIE; | |
4322 | struct task_struct *curr = current; | |
4323 | int i; | |
4324 | ||
4325 | if (unlikely(!debug_locks)) | |
4326 | return cookie; | |
4327 | ||
4328 | for (i = 0; i < curr->lockdep_depth; i++) { | |
4329 | struct held_lock *hlock = curr->held_locks + i; | |
4330 | ||
4331 | if (match_held_lock(hlock, lock)) { | |
4332 | /* | |
4333 | * Grab 16bits of randomness; this is sufficient to not | |
4334 | * be guessable and still allows some pin nesting in | |
4335 | * our u32 pin_count. | |
4336 | */ | |
4337 | cookie.val = 1 + (prandom_u32() >> 16); | |
4338 | hlock->pin_count += cookie.val; | |
4339 | return cookie; | |
4340 | } | |
4341 | } | |
4342 | ||
4343 | WARN(1, "pinning an unheld lock\n"); | |
4344 | return cookie; | |
4345 | } | |
4346 | ||
4347 | static void __lock_repin_lock(struct lockdep_map *lock, struct pin_cookie cookie) | |
fbb9ce95 IM |
4348 | { |
4349 | struct task_struct *curr = current; | |
a24fc60d | 4350 | int i; |
fbb9ce95 | 4351 | |
a24fc60d | 4352 | if (unlikely(!debug_locks)) |
fbb9ce95 IM |
4353 | return; |
4354 | ||
a24fc60d PZ |
4355 | for (i = 0; i < curr->lockdep_depth; i++) { |
4356 | struct held_lock *hlock = curr->held_locks + i; | |
4357 | ||
4358 | if (match_held_lock(hlock, lock)) { | |
e7904a28 | 4359 | hlock->pin_count += cookie.val; |
fbb9ce95 | 4360 | return; |
a24fc60d | 4361 | } |
fbb9ce95 IM |
4362 | } |
4363 | ||
a24fc60d | 4364 | WARN(1, "pinning an unheld lock\n"); |
fbb9ce95 IM |
4365 | } |
4366 | ||
e7904a28 | 4367 | static void __lock_unpin_lock(struct lockdep_map *lock, struct pin_cookie cookie) |
f607c668 PZ |
4368 | { |
4369 | struct task_struct *curr = current; | |
4370 | int i; | |
4371 | ||
a24fc60d PZ |
4372 | if (unlikely(!debug_locks)) |
4373 | return; | |
4374 | ||
f607c668 | 4375 | for (i = 0; i < curr->lockdep_depth; i++) { |
bb97a91e PZ |
4376 | struct held_lock *hlock = curr->held_locks + i; |
4377 | ||
a24fc60d PZ |
4378 | if (match_held_lock(hlock, lock)) { |
4379 | if (WARN(!hlock->pin_count, "unpinning an unpinned lock\n")) | |
4380 | return; | |
4381 | ||
e7904a28 PZ |
4382 | hlock->pin_count -= cookie.val; |
4383 | ||
4384 | if (WARN((int)hlock->pin_count < 0, "pin count corrupted\n")) | |
4385 | hlock->pin_count = 0; | |
4386 | ||
a24fc60d PZ |
4387 | return; |
4388 | } | |
f607c668 PZ |
4389 | } |
4390 | ||
a24fc60d | 4391 | WARN(1, "unpinning an unheld lock\n"); |
f607c668 PZ |
4392 | } |
4393 | ||
fbb9ce95 IM |
4394 | /* |
4395 | * Check whether we follow the irq-flags state precisely: | |
4396 | */ | |
1d09daa5 | 4397 | static void check_flags(unsigned long flags) |
fbb9ce95 | 4398 | { |
30a35f79 | 4399 | #if defined(CONFIG_PROVE_LOCKING) && defined(CONFIG_DEBUG_LOCKDEP) |
fbb9ce95 IM |
4400 | if (!debug_locks) |
4401 | return; | |
4402 | ||
5f9fa8a6 IM |
4403 | if (irqs_disabled_flags(flags)) { |
4404 | if (DEBUG_LOCKS_WARN_ON(current->hardirqs_enabled)) { | |
4405 | printk("possible reason: unannotated irqs-off.\n"); | |
4406 | } | |
4407 | } else { | |
4408 | if (DEBUG_LOCKS_WARN_ON(!current->hardirqs_enabled)) { | |
4409 | printk("possible reason: unannotated irqs-on.\n"); | |
4410 | } | |
4411 | } | |
fbb9ce95 IM |
4412 | |
4413 | /* | |
4414 | * We dont accurately track softirq state in e.g. | |
4415 | * hardirq contexts (such as on 4KSTACKS), so only | |
4416 | * check if not in hardirq contexts: | |
4417 | */ | |
4418 | if (!hardirq_count()) { | |
0119fee4 PZ |
4419 | if (softirq_count()) { |
4420 | /* like the above, but with softirqs */ | |
fbb9ce95 | 4421 | DEBUG_LOCKS_WARN_ON(current->softirqs_enabled); |
0119fee4 PZ |
4422 | } else { |
4423 | /* lick the above, does it taste good? */ | |
fbb9ce95 | 4424 | DEBUG_LOCKS_WARN_ON(!current->softirqs_enabled); |
0119fee4 | 4425 | } |
fbb9ce95 IM |
4426 | } |
4427 | ||
4428 | if (!debug_locks) | |
4429 | print_irqtrace_events(current); | |
4430 | #endif | |
4431 | } | |
4432 | ||
00ef9f73 PZ |
4433 | void lock_set_class(struct lockdep_map *lock, const char *name, |
4434 | struct lock_class_key *key, unsigned int subclass, | |
4435 | unsigned long ip) | |
64aa348e PZ |
4436 | { |
4437 | unsigned long flags; | |
4438 | ||
4439 | if (unlikely(current->lockdep_recursion)) | |
4440 | return; | |
4441 | ||
4442 | raw_local_irq_save(flags); | |
4443 | current->lockdep_recursion = 1; | |
4444 | check_flags(flags); | |
00ef9f73 | 4445 | if (__lock_set_class(lock, name, key, subclass, ip)) |
64aa348e PZ |
4446 | check_chain_key(current); |
4447 | current->lockdep_recursion = 0; | |
4448 | raw_local_irq_restore(flags); | |
4449 | } | |
00ef9f73 | 4450 | EXPORT_SYMBOL_GPL(lock_set_class); |
64aa348e | 4451 | |
6419c4af O |
4452 | void lock_downgrade(struct lockdep_map *lock, unsigned long ip) |
4453 | { | |
4454 | unsigned long flags; | |
4455 | ||
4456 | if (unlikely(current->lockdep_recursion)) | |
4457 | return; | |
4458 | ||
4459 | raw_local_irq_save(flags); | |
4460 | current->lockdep_recursion = 1; | |
4461 | check_flags(flags); | |
4462 | if (__lock_downgrade(lock, ip)) | |
4463 | check_chain_key(current); | |
4464 | current->lockdep_recursion = 0; | |
4465 | raw_local_irq_restore(flags); | |
4466 | } | |
4467 | EXPORT_SYMBOL_GPL(lock_downgrade); | |
4468 | ||
fbb9ce95 IM |
4469 | /* |
4470 | * We are not always called with irqs disabled - do that here, | |
4471 | * and also avoid lockdep recursion: | |
4472 | */ | |
1d09daa5 | 4473 | void lock_acquire(struct lockdep_map *lock, unsigned int subclass, |
7531e2f3 PZ |
4474 | int trylock, int read, int check, |
4475 | struct lockdep_map *nest_lock, unsigned long ip) | |
fbb9ce95 IM |
4476 | { |
4477 | unsigned long flags; | |
4478 | ||
4479 | if (unlikely(current->lockdep_recursion)) | |
4480 | return; | |
4481 | ||
4482 | raw_local_irq_save(flags); | |
4483 | check_flags(flags); | |
4484 | ||
4485 | current->lockdep_recursion = 1; | |
db2c4c77 | 4486 | trace_lock_acquire(lock, subclass, trylock, read, check, nest_lock, ip); |
fbb9ce95 | 4487 | __lock_acquire(lock, subclass, trylock, read, check, |
21199f27 | 4488 | irqs_disabled_flags(flags), nest_lock, ip, 0, 0); |
fbb9ce95 IM |
4489 | current->lockdep_recursion = 0; |
4490 | raw_local_irq_restore(flags); | |
4491 | } | |
fbb9ce95 IM |
4492 | EXPORT_SYMBOL_GPL(lock_acquire); |
4493 | ||
1d09daa5 | 4494 | void lock_release(struct lockdep_map *lock, int nested, |
0764d23c | 4495 | unsigned long ip) |
fbb9ce95 IM |
4496 | { |
4497 | unsigned long flags; | |
4498 | ||
4499 | if (unlikely(current->lockdep_recursion)) | |
4500 | return; | |
4501 | ||
4502 | raw_local_irq_save(flags); | |
4503 | check_flags(flags); | |
4504 | current->lockdep_recursion = 1; | |
93135439 | 4505 | trace_lock_release(lock, ip); |
b4adfe8e | 4506 | if (__lock_release(lock, ip)) |
e0f56fd7 | 4507 | check_chain_key(current); |
fbb9ce95 IM |
4508 | current->lockdep_recursion = 0; |
4509 | raw_local_irq_restore(flags); | |
4510 | } | |
fbb9ce95 IM |
4511 | EXPORT_SYMBOL_GPL(lock_release); |
4512 | ||
08f36ff6 | 4513 | int lock_is_held_type(const struct lockdep_map *lock, int read) |
f607c668 PZ |
4514 | { |
4515 | unsigned long flags; | |
4516 | int ret = 0; | |
4517 | ||
4518 | if (unlikely(current->lockdep_recursion)) | |
f2513cde | 4519 | return 1; /* avoid false negative lockdep_assert_held() */ |
f607c668 PZ |
4520 | |
4521 | raw_local_irq_save(flags); | |
4522 | check_flags(flags); | |
4523 | ||
4524 | current->lockdep_recursion = 1; | |
f8319483 | 4525 | ret = __lock_is_held(lock, read); |
f607c668 PZ |
4526 | current->lockdep_recursion = 0; |
4527 | raw_local_irq_restore(flags); | |
4528 | ||
4529 | return ret; | |
4530 | } | |
f8319483 | 4531 | EXPORT_SYMBOL_GPL(lock_is_held_type); |
2f43c602 | 4532 | NOKPROBE_SYMBOL(lock_is_held_type); |
f607c668 | 4533 | |
e7904a28 | 4534 | struct pin_cookie lock_pin_lock(struct lockdep_map *lock) |
a24fc60d | 4535 | { |
e7904a28 | 4536 | struct pin_cookie cookie = NIL_COOKIE; |
a24fc60d PZ |
4537 | unsigned long flags; |
4538 | ||
4539 | if (unlikely(current->lockdep_recursion)) | |
e7904a28 | 4540 | return cookie; |
a24fc60d PZ |
4541 | |
4542 | raw_local_irq_save(flags); | |
4543 | check_flags(flags); | |
4544 | ||
4545 | current->lockdep_recursion = 1; | |
e7904a28 | 4546 | cookie = __lock_pin_lock(lock); |
a24fc60d PZ |
4547 | current->lockdep_recursion = 0; |
4548 | raw_local_irq_restore(flags); | |
e7904a28 PZ |
4549 | |
4550 | return cookie; | |
a24fc60d PZ |
4551 | } |
4552 | EXPORT_SYMBOL_GPL(lock_pin_lock); | |
4553 | ||
e7904a28 PZ |
4554 | void lock_repin_lock(struct lockdep_map *lock, struct pin_cookie cookie) |
4555 | { | |
4556 | unsigned long flags; | |
4557 | ||
4558 | if (unlikely(current->lockdep_recursion)) | |
4559 | return; | |
4560 | ||
4561 | raw_local_irq_save(flags); | |
4562 | check_flags(flags); | |
4563 | ||
4564 | current->lockdep_recursion = 1; | |
4565 | __lock_repin_lock(lock, cookie); | |
4566 | current->lockdep_recursion = 0; | |
4567 | raw_local_irq_restore(flags); | |
4568 | } | |
4569 | EXPORT_SYMBOL_GPL(lock_repin_lock); | |
4570 | ||
4571 | void lock_unpin_lock(struct lockdep_map *lock, struct pin_cookie cookie) | |
a24fc60d PZ |
4572 | { |
4573 | unsigned long flags; | |
4574 | ||
4575 | if (unlikely(current->lockdep_recursion)) | |
4576 | return; | |
4577 | ||
4578 | raw_local_irq_save(flags); | |
4579 | check_flags(flags); | |
4580 | ||
4581 | current->lockdep_recursion = 1; | |
e7904a28 | 4582 | __lock_unpin_lock(lock, cookie); |
a24fc60d PZ |
4583 | current->lockdep_recursion = 0; |
4584 | raw_local_irq_restore(flags); | |
4585 | } | |
4586 | EXPORT_SYMBOL_GPL(lock_unpin_lock); | |
4587 | ||
f20786ff | 4588 | #ifdef CONFIG_LOCK_STAT |
f7c1c6b3 YD |
4589 | static void print_lock_contention_bug(struct task_struct *curr, |
4590 | struct lockdep_map *lock, | |
4591 | unsigned long ip) | |
f20786ff PZ |
4592 | { |
4593 | if (!debug_locks_off()) | |
f7c1c6b3 | 4594 | return; |
f20786ff | 4595 | if (debug_locks_silent) |
f7c1c6b3 | 4596 | return; |
f20786ff | 4597 | |
681fbec8 | 4598 | pr_warn("\n"); |
a5dd63ef PM |
4599 | pr_warn("=================================\n"); |
4600 | pr_warn("WARNING: bad contention detected!\n"); | |
fbdc4b9a | 4601 | print_kernel_ident(); |
a5dd63ef | 4602 | pr_warn("---------------------------------\n"); |
681fbec8 | 4603 | pr_warn("%s/%d is trying to contend lock (", |
ba25f9dc | 4604 | curr->comm, task_pid_nr(curr)); |
f20786ff | 4605 | print_lockdep_cache(lock); |
681fbec8 | 4606 | pr_cont(") at:\n"); |
f20786ff | 4607 | print_ip_sym(ip); |
681fbec8 PM |
4608 | pr_warn("but there are no locks held!\n"); |
4609 | pr_warn("\nother info that might help us debug this:\n"); | |
f20786ff PZ |
4610 | lockdep_print_held_locks(curr); |
4611 | ||
681fbec8 | 4612 | pr_warn("\nstack backtrace:\n"); |
f20786ff | 4613 | dump_stack(); |
f20786ff PZ |
4614 | } |
4615 | ||
4616 | static void | |
4617 | __lock_contended(struct lockdep_map *lock, unsigned long ip) | |
4618 | { | |
4619 | struct task_struct *curr = current; | |
41c2c5b8 | 4620 | struct held_lock *hlock; |
f20786ff PZ |
4621 | struct lock_class_stats *stats; |
4622 | unsigned int depth; | |
c7e78cff | 4623 | int i, contention_point, contending_point; |
f20786ff PZ |
4624 | |
4625 | depth = curr->lockdep_depth; | |
0119fee4 PZ |
4626 | /* |
4627 | * Whee, we contended on this lock, except it seems we're not | |
4628 | * actually trying to acquire anything much at all.. | |
4629 | */ | |
f20786ff PZ |
4630 | if (DEBUG_LOCKS_WARN_ON(!depth)) |
4631 | return; | |
4632 | ||
41c2c5b8 O |
4633 | hlock = find_held_lock(curr, lock, depth, &i); |
4634 | if (!hlock) { | |
4635 | print_lock_contention_bug(curr, lock, ip); | |
4636 | return; | |
f20786ff | 4637 | } |
f20786ff | 4638 | |
bb97a91e PZ |
4639 | if (hlock->instance != lock) |
4640 | return; | |
4641 | ||
3365e779 | 4642 | hlock->waittime_stamp = lockstat_clock(); |
f20786ff | 4643 | |
c7e78cff PZ |
4644 | contention_point = lock_point(hlock_class(hlock)->contention_point, ip); |
4645 | contending_point = lock_point(hlock_class(hlock)->contending_point, | |
4646 | lock->ip); | |
f20786ff | 4647 | |
f82b217e | 4648 | stats = get_lock_stats(hlock_class(hlock)); |
c7e78cff PZ |
4649 | if (contention_point < LOCKSTAT_POINTS) |
4650 | stats->contention_point[contention_point]++; | |
4651 | if (contending_point < LOCKSTAT_POINTS) | |
4652 | stats->contending_point[contending_point]++; | |
96645678 PZ |
4653 | if (lock->cpu != smp_processor_id()) |
4654 | stats->bounces[bounce_contended + !!hlock->read]++; | |
f20786ff PZ |
4655 | } |
4656 | ||
4657 | static void | |
c7e78cff | 4658 | __lock_acquired(struct lockdep_map *lock, unsigned long ip) |
f20786ff PZ |
4659 | { |
4660 | struct task_struct *curr = current; | |
41c2c5b8 | 4661 | struct held_lock *hlock; |
f20786ff PZ |
4662 | struct lock_class_stats *stats; |
4663 | unsigned int depth; | |
3365e779 | 4664 | u64 now, waittime = 0; |
96645678 | 4665 | int i, cpu; |
f20786ff PZ |
4666 | |
4667 | depth = curr->lockdep_depth; | |
0119fee4 PZ |
4668 | /* |
4669 | * Yay, we acquired ownership of this lock we didn't try to | |
4670 | * acquire, how the heck did that happen? | |
4671 | */ | |
f20786ff PZ |
4672 | if (DEBUG_LOCKS_WARN_ON(!depth)) |
4673 | return; | |
4674 | ||
41c2c5b8 O |
4675 | hlock = find_held_lock(curr, lock, depth, &i); |
4676 | if (!hlock) { | |
4677 | print_lock_contention_bug(curr, lock, _RET_IP_); | |
4678 | return; | |
f20786ff | 4679 | } |
f20786ff | 4680 | |
bb97a91e PZ |
4681 | if (hlock->instance != lock) |
4682 | return; | |
4683 | ||
96645678 PZ |
4684 | cpu = smp_processor_id(); |
4685 | if (hlock->waittime_stamp) { | |
3365e779 | 4686 | now = lockstat_clock(); |
96645678 PZ |
4687 | waittime = now - hlock->waittime_stamp; |
4688 | hlock->holdtime_stamp = now; | |
4689 | } | |
f20786ff | 4690 | |
883a2a31 | 4691 | trace_lock_acquired(lock, ip); |
2062501a | 4692 | |
f82b217e | 4693 | stats = get_lock_stats(hlock_class(hlock)); |
96645678 PZ |
4694 | if (waittime) { |
4695 | if (hlock->read) | |
4696 | lock_time_inc(&stats->read_waittime, waittime); | |
4697 | else | |
4698 | lock_time_inc(&stats->write_waittime, waittime); | |
4699 | } | |
4700 | if (lock->cpu != cpu) | |
4701 | stats->bounces[bounce_acquired + !!hlock->read]++; | |
96645678 PZ |
4702 | |
4703 | lock->cpu = cpu; | |
c7e78cff | 4704 | lock->ip = ip; |
f20786ff PZ |
4705 | } |
4706 | ||
4707 | void lock_contended(struct lockdep_map *lock, unsigned long ip) | |
4708 | { | |
4709 | unsigned long flags; | |
4710 | ||
9506a742 | 4711 | if (unlikely(!lock_stat || !debug_locks)) |
f20786ff PZ |
4712 | return; |
4713 | ||
4714 | if (unlikely(current->lockdep_recursion)) | |
4715 | return; | |
4716 | ||
4717 | raw_local_irq_save(flags); | |
4718 | check_flags(flags); | |
4719 | current->lockdep_recursion = 1; | |
db2c4c77 | 4720 | trace_lock_contended(lock, ip); |
f20786ff PZ |
4721 | __lock_contended(lock, ip); |
4722 | current->lockdep_recursion = 0; | |
4723 | raw_local_irq_restore(flags); | |
4724 | } | |
4725 | EXPORT_SYMBOL_GPL(lock_contended); | |
4726 | ||
c7e78cff | 4727 | void lock_acquired(struct lockdep_map *lock, unsigned long ip) |
f20786ff PZ |
4728 | { |
4729 | unsigned long flags; | |
4730 | ||
9506a742 | 4731 | if (unlikely(!lock_stat || !debug_locks)) |
f20786ff PZ |
4732 | return; |
4733 | ||
4734 | if (unlikely(current->lockdep_recursion)) | |
4735 | return; | |
4736 | ||
4737 | raw_local_irq_save(flags); | |
4738 | check_flags(flags); | |
4739 | current->lockdep_recursion = 1; | |
c7e78cff | 4740 | __lock_acquired(lock, ip); |
f20786ff PZ |
4741 | current->lockdep_recursion = 0; |
4742 | raw_local_irq_restore(flags); | |
4743 | } | |
4744 | EXPORT_SYMBOL_GPL(lock_acquired); | |
4745 | #endif | |
4746 | ||
fbb9ce95 IM |
4747 | /* |
4748 | * Used by the testsuite, sanitize the validator state | |
4749 | * after a simulated failure: | |
4750 | */ | |
4751 | ||
4752 | void lockdep_reset(void) | |
4753 | { | |
4754 | unsigned long flags; | |
23d95a03 | 4755 | int i; |
fbb9ce95 IM |
4756 | |
4757 | raw_local_irq_save(flags); | |
e196e479 | 4758 | lockdep_init_task(current); |
fbb9ce95 IM |
4759 | memset(current->held_locks, 0, MAX_LOCK_DEPTH*sizeof(struct held_lock)); |
4760 | nr_hardirq_chains = 0; | |
4761 | nr_softirq_chains = 0; | |
4762 | nr_process_chains = 0; | |
4763 | debug_locks = 1; | |
23d95a03 | 4764 | for (i = 0; i < CHAINHASH_SIZE; i++) |
a63f38cc | 4765 | INIT_HLIST_HEAD(chainhash_table + i); |
fbb9ce95 IM |
4766 | raw_local_irq_restore(flags); |
4767 | } | |
4768 | ||
a0b0fd53 | 4769 | /* Remove a class from a lock chain. Must be called with the graph lock held. */ |
de4643a7 BVA |
4770 | static void remove_class_from_lock_chain(struct pending_free *pf, |
4771 | struct lock_chain *chain, | |
a0b0fd53 BVA |
4772 | struct lock_class *class) |
4773 | { | |
4774 | #ifdef CONFIG_PROVE_LOCKING | |
4775 | struct lock_chain *new_chain; | |
4776 | u64 chain_key; | |
4777 | int i; | |
4778 | ||
4779 | for (i = chain->base; i < chain->base + chain->depth; i++) { | |
4780 | if (chain_hlocks[i] != class - lock_classes) | |
4781 | continue; | |
4782 | /* The code below leaks one chain_hlock[] entry. */ | |
72dcd505 | 4783 | if (--chain->depth > 0) { |
a0b0fd53 BVA |
4784 | memmove(&chain_hlocks[i], &chain_hlocks[i + 1], |
4785 | (chain->base + chain->depth - i) * | |
4786 | sizeof(chain_hlocks[0])); | |
72dcd505 | 4787 | } |
a0b0fd53 BVA |
4788 | /* |
4789 | * Each lock class occurs at most once in a lock chain so once | |
4790 | * we found a match we can break out of this loop. | |
4791 | */ | |
4792 | goto recalc; | |
4793 | } | |
4794 | /* Since the chain has not been modified, return. */ | |
4795 | return; | |
4796 | ||
4797 | recalc: | |
f6ec8829 | 4798 | chain_key = INITIAL_CHAIN_KEY; |
a0b0fd53 | 4799 | for (i = chain->base; i < chain->base + chain->depth; i++) |
01bb6f0a | 4800 | chain_key = iterate_chain_key(chain_key, chain_hlocks[i]); |
a0b0fd53 BVA |
4801 | if (chain->depth && chain->chain_key == chain_key) |
4802 | return; | |
4803 | /* Overwrite the chain key for concurrent RCU readers. */ | |
4804 | WRITE_ONCE(chain->chain_key, chain_key); | |
4805 | /* | |
4806 | * Note: calling hlist_del_rcu() from inside a | |
4807 | * hlist_for_each_entry_rcu() loop is safe. | |
4808 | */ | |
4809 | hlist_del_rcu(&chain->entry); | |
de4643a7 | 4810 | __set_bit(chain - lock_chains, pf->lock_chains_being_freed); |
a0b0fd53 BVA |
4811 | if (chain->depth == 0) |
4812 | return; | |
4813 | /* | |
4814 | * If the modified lock chain matches an existing lock chain, drop | |
4815 | * the modified lock chain. | |
4816 | */ | |
4817 | if (lookup_chain_cache(chain_key)) | |
4818 | return; | |
de4643a7 BVA |
4819 | new_chain = alloc_lock_chain(); |
4820 | if (WARN_ON_ONCE(!new_chain)) { | |
a0b0fd53 BVA |
4821 | debug_locks_off(); |
4822 | return; | |
4823 | } | |
a0b0fd53 BVA |
4824 | *new_chain = *chain; |
4825 | hlist_add_head_rcu(&new_chain->entry, chainhashentry(chain_key)); | |
4826 | #endif | |
4827 | } | |
4828 | ||
4829 | /* Must be called with the graph lock held. */ | |
de4643a7 BVA |
4830 | static void remove_class_from_lock_chains(struct pending_free *pf, |
4831 | struct lock_class *class) | |
a0b0fd53 BVA |
4832 | { |
4833 | struct lock_chain *chain; | |
4834 | struct hlist_head *head; | |
4835 | int i; | |
4836 | ||
4837 | for (i = 0; i < ARRAY_SIZE(chainhash_table); i++) { | |
4838 | head = chainhash_table + i; | |
4839 | hlist_for_each_entry_rcu(chain, head, entry) { | |
de4643a7 | 4840 | remove_class_from_lock_chain(pf, chain, class); |
a0b0fd53 BVA |
4841 | } |
4842 | } | |
4843 | } | |
4844 | ||
786fa29e BVA |
4845 | /* |
4846 | * Remove all references to a lock class. The caller must hold the graph lock. | |
4847 | */ | |
a0b0fd53 | 4848 | static void zap_class(struct pending_free *pf, struct lock_class *class) |
fbb9ce95 | 4849 | { |
86cffb80 | 4850 | struct lock_list *entry; |
fbb9ce95 IM |
4851 | int i; |
4852 | ||
a0b0fd53 BVA |
4853 | WARN_ON_ONCE(!class->key); |
4854 | ||
fbb9ce95 IM |
4855 | /* |
4856 | * Remove all dependencies this lock is | |
4857 | * involved in: | |
4858 | */ | |
ace35a7a BVA |
4859 | for_each_set_bit(i, list_entries_in_use, ARRAY_SIZE(list_entries)) { |
4860 | entry = list_entries + i; | |
86cffb80 BVA |
4861 | if (entry->class != class && entry->links_to != class) |
4862 | continue; | |
ace35a7a BVA |
4863 | __clear_bit(i, list_entries_in_use); |
4864 | nr_list_entries--; | |
86cffb80 | 4865 | list_del_rcu(&entry->entry); |
fbb9ce95 | 4866 | } |
a0b0fd53 BVA |
4867 | if (list_empty(&class->locks_after) && |
4868 | list_empty(&class->locks_before)) { | |
4869 | list_move_tail(&class->lock_entry, &pf->zapped); | |
4870 | hlist_del_rcu(&class->hash_entry); | |
4871 | WRITE_ONCE(class->key, NULL); | |
4872 | WRITE_ONCE(class->name, NULL); | |
4873 | nr_lock_classes--; | |
01bb6f0a | 4874 | __clear_bit(class - lock_classes, lock_classes_in_use); |
a0b0fd53 BVA |
4875 | } else { |
4876 | WARN_ONCE(true, "%s() failed for class %s\n", __func__, | |
4877 | class->name); | |
4878 | } | |
fbb9ce95 | 4879 | |
de4643a7 | 4880 | remove_class_from_lock_chains(pf, class); |
a0b0fd53 BVA |
4881 | } |
4882 | ||
4883 | static void reinit_class(struct lock_class *class) | |
4884 | { | |
4885 | void *const p = class; | |
4886 | const unsigned int offset = offsetof(struct lock_class, key); | |
4887 | ||
4888 | WARN_ON_ONCE(!class->lock_entry.next); | |
4889 | WARN_ON_ONCE(!list_empty(&class->locks_after)); | |
4890 | WARN_ON_ONCE(!list_empty(&class->locks_before)); | |
4891 | memset(p + offset, 0, sizeof(*class) - offset); | |
4892 | WARN_ON_ONCE(!class->lock_entry.next); | |
4893 | WARN_ON_ONCE(!list_empty(&class->locks_after)); | |
4894 | WARN_ON_ONCE(!list_empty(&class->locks_before)); | |
fbb9ce95 IM |
4895 | } |
4896 | ||
fabe874a | 4897 | static inline int within(const void *addr, void *start, unsigned long size) |
fbb9ce95 IM |
4898 | { |
4899 | return addr >= start && addr < start + size; | |
4900 | } | |
4901 | ||
a0b0fd53 BVA |
4902 | static bool inside_selftest(void) |
4903 | { | |
4904 | return current == lockdep_selftest_task_struct; | |
4905 | } | |
4906 | ||
4907 | /* The caller must hold the graph lock. */ | |
4908 | static struct pending_free *get_pending_free(void) | |
4909 | { | |
4910 | return delayed_free.pf + delayed_free.index; | |
4911 | } | |
4912 | ||
4913 | static void free_zapped_rcu(struct rcu_head *cb); | |
4914 | ||
4915 | /* | |
4916 | * Schedule an RCU callback if no RCU callback is pending. Must be called with | |
4917 | * the graph lock held. | |
4918 | */ | |
4919 | static void call_rcu_zapped(struct pending_free *pf) | |
4920 | { | |
4921 | WARN_ON_ONCE(inside_selftest()); | |
4922 | ||
4923 | if (list_empty(&pf->zapped)) | |
4924 | return; | |
4925 | ||
4926 | if (delayed_free.scheduled) | |
4927 | return; | |
4928 | ||
4929 | delayed_free.scheduled = true; | |
4930 | ||
4931 | WARN_ON_ONCE(delayed_free.pf + delayed_free.index != pf); | |
4932 | delayed_free.index ^= 1; | |
4933 | ||
4934 | call_rcu(&delayed_free.rcu_head, free_zapped_rcu); | |
4935 | } | |
4936 | ||
4937 | /* The caller must hold the graph lock. May be called from RCU context. */ | |
4938 | static void __free_zapped_classes(struct pending_free *pf) | |
4939 | { | |
4940 | struct lock_class *class; | |
4941 | ||
72dcd505 | 4942 | check_data_structures(); |
b526b2e3 | 4943 | |
a0b0fd53 BVA |
4944 | list_for_each_entry(class, &pf->zapped, lock_entry) |
4945 | reinit_class(class); | |
4946 | ||
4947 | list_splice_init(&pf->zapped, &free_lock_classes); | |
de4643a7 BVA |
4948 | |
4949 | #ifdef CONFIG_PROVE_LOCKING | |
4950 | bitmap_andnot(lock_chains_in_use, lock_chains_in_use, | |
4951 | pf->lock_chains_being_freed, ARRAY_SIZE(lock_chains)); | |
4952 | bitmap_clear(pf->lock_chains_being_freed, 0, ARRAY_SIZE(lock_chains)); | |
4953 | #endif | |
a0b0fd53 BVA |
4954 | } |
4955 | ||
4956 | static void free_zapped_rcu(struct rcu_head *ch) | |
4957 | { | |
4958 | struct pending_free *pf; | |
4959 | unsigned long flags; | |
4960 | ||
4961 | if (WARN_ON_ONCE(ch != &delayed_free.rcu_head)) | |
4962 | return; | |
4963 | ||
4964 | raw_local_irq_save(flags); | |
90c1cba2 BVA |
4965 | arch_spin_lock(&lockdep_lock); |
4966 | current->lockdep_recursion = 1; | |
a0b0fd53 BVA |
4967 | |
4968 | /* closed head */ | |
4969 | pf = delayed_free.pf + (delayed_free.index ^ 1); | |
4970 | __free_zapped_classes(pf); | |
4971 | delayed_free.scheduled = false; | |
4972 | ||
4973 | /* | |
4974 | * If there's anything on the open list, close and start a new callback. | |
4975 | */ | |
4976 | call_rcu_zapped(delayed_free.pf + delayed_free.index); | |
4977 | ||
90c1cba2 BVA |
4978 | current->lockdep_recursion = 0; |
4979 | arch_spin_unlock(&lockdep_lock); | |
a0b0fd53 BVA |
4980 | raw_local_irq_restore(flags); |
4981 | } | |
4982 | ||
4983 | /* | |
4984 | * Remove all lock classes from the class hash table and from the | |
4985 | * all_lock_classes list whose key or name is in the address range [start, | |
4986 | * start + size). Move these lock classes to the zapped_classes list. Must | |
4987 | * be called with the graph lock held. | |
4988 | */ | |
4989 | static void __lockdep_free_key_range(struct pending_free *pf, void *start, | |
4990 | unsigned long size) | |
956f3563 BVA |
4991 | { |
4992 | struct lock_class *class; | |
4993 | struct hlist_head *head; | |
4994 | int i; | |
4995 | ||
4996 | /* Unhash all classes that were created by a module. */ | |
4997 | for (i = 0; i < CLASSHASH_SIZE; i++) { | |
4998 | head = classhash_table + i; | |
4999 | hlist_for_each_entry_rcu(class, head, hash_entry) { | |
5000 | if (!within(class->key, start, size) && | |
5001 | !within(class->name, start, size)) | |
5002 | continue; | |
a0b0fd53 | 5003 | zap_class(pf, class); |
956f3563 BVA |
5004 | } |
5005 | } | |
5006 | } | |
5007 | ||
35a9393c PZ |
5008 | /* |
5009 | * Used in module.c to remove lock classes from memory that is going to be | |
5010 | * freed; and possibly re-used by other modules. | |
5011 | * | |
29fc33fb BVA |
5012 | * We will have had one synchronize_rcu() before getting here, so we're |
5013 | * guaranteed nobody will look up these exact classes -- they're properly dead | |
5014 | * but still allocated. | |
35a9393c | 5015 | */ |
a0b0fd53 | 5016 | static void lockdep_free_key_range_reg(void *start, unsigned long size) |
fbb9ce95 | 5017 | { |
a0b0fd53 | 5018 | struct pending_free *pf; |
fbb9ce95 | 5019 | unsigned long flags; |
fbb9ce95 | 5020 | |
feb0a386 BVA |
5021 | init_data_structures_once(); |
5022 | ||
fbb9ce95 | 5023 | raw_local_irq_save(flags); |
90c1cba2 BVA |
5024 | arch_spin_lock(&lockdep_lock); |
5025 | current->lockdep_recursion = 1; | |
a0b0fd53 BVA |
5026 | pf = get_pending_free(); |
5027 | __lockdep_free_key_range(pf, start, size); | |
5028 | call_rcu_zapped(pf); | |
90c1cba2 BVA |
5029 | current->lockdep_recursion = 0; |
5030 | arch_spin_unlock(&lockdep_lock); | |
fbb9ce95 | 5031 | raw_local_irq_restore(flags); |
35a9393c PZ |
5032 | |
5033 | /* | |
5034 | * Wait for any possible iterators from look_up_lock_class() to pass | |
5035 | * before continuing to free the memory they refer to. | |
35a9393c | 5036 | */ |
51959d85 | 5037 | synchronize_rcu(); |
a0b0fd53 | 5038 | } |
35a9393c | 5039 | |
a0b0fd53 BVA |
5040 | /* |
5041 | * Free all lockdep keys in the range [start, start+size). Does not sleep. | |
5042 | * Ignores debug_locks. Must only be used by the lockdep selftests. | |
5043 | */ | |
5044 | static void lockdep_free_key_range_imm(void *start, unsigned long size) | |
5045 | { | |
5046 | struct pending_free *pf = delayed_free.pf; | |
5047 | unsigned long flags; | |
5048 | ||
5049 | init_data_structures_once(); | |
5050 | ||
5051 | raw_local_irq_save(flags); | |
5052 | arch_spin_lock(&lockdep_lock); | |
5053 | __lockdep_free_key_range(pf, start, size); | |
5054 | __free_zapped_classes(pf); | |
5055 | arch_spin_unlock(&lockdep_lock); | |
5056 | raw_local_irq_restore(flags); | |
5057 | } | |
5058 | ||
5059 | void lockdep_free_key_range(void *start, unsigned long size) | |
5060 | { | |
5061 | init_data_structures_once(); | |
5062 | ||
5063 | if (inside_selftest()) | |
5064 | lockdep_free_key_range_imm(start, size); | |
5065 | else | |
5066 | lockdep_free_key_range_reg(start, size); | |
fbb9ce95 IM |
5067 | } |
5068 | ||
2904d9fa BVA |
5069 | /* |
5070 | * Check whether any element of the @lock->class_cache[] array refers to a | |
5071 | * registered lock class. The caller must hold either the graph lock or the | |
5072 | * RCU read lock. | |
5073 | */ | |
5074 | static bool lock_class_cache_is_registered(struct lockdep_map *lock) | |
fbb9ce95 | 5075 | { |
35a9393c | 5076 | struct lock_class *class; |
a63f38cc | 5077 | struct hlist_head *head; |
fbb9ce95 | 5078 | int i, j; |
2904d9fa BVA |
5079 | |
5080 | for (i = 0; i < CLASSHASH_SIZE; i++) { | |
5081 | head = classhash_table + i; | |
5082 | hlist_for_each_entry_rcu(class, head, hash_entry) { | |
5083 | for (j = 0; j < NR_LOCKDEP_CACHING_CLASSES; j++) | |
5084 | if (lock->class_cache[j] == class) | |
5085 | return true; | |
5086 | } | |
5087 | } | |
5088 | return false; | |
5089 | } | |
5090 | ||
956f3563 | 5091 | /* The caller must hold the graph lock. Does not sleep. */ |
a0b0fd53 BVA |
5092 | static void __lockdep_reset_lock(struct pending_free *pf, |
5093 | struct lockdep_map *lock) | |
2904d9fa BVA |
5094 | { |
5095 | struct lock_class *class; | |
956f3563 | 5096 | int j; |
fbb9ce95 IM |
5097 | |
5098 | /* | |
d6d897ce IM |
5099 | * Remove all classes this lock might have: |
5100 | */ | |
5101 | for (j = 0; j < MAX_LOCKDEP_SUBCLASSES; j++) { | |
5102 | /* | |
5103 | * If the class exists we look it up and zap it: | |
5104 | */ | |
5105 | class = look_up_lock_class(lock, j); | |
64f29d1b | 5106 | if (class) |
a0b0fd53 | 5107 | zap_class(pf, class); |
d6d897ce IM |
5108 | } |
5109 | /* | |
5110 | * Debug check: in the end all mapped classes should | |
5111 | * be gone. | |
fbb9ce95 | 5112 | */ |
956f3563 BVA |
5113 | if (WARN_ON_ONCE(lock_class_cache_is_registered(lock))) |
5114 | debug_locks_off(); | |
5115 | } | |
5116 | ||
a0b0fd53 BVA |
5117 | /* |
5118 | * Remove all information lockdep has about a lock if debug_locks == 1. Free | |
5119 | * released data structures from RCU context. | |
5120 | */ | |
5121 | static void lockdep_reset_lock_reg(struct lockdep_map *lock) | |
956f3563 | 5122 | { |
a0b0fd53 | 5123 | struct pending_free *pf; |
956f3563 BVA |
5124 | unsigned long flags; |
5125 | int locked; | |
5126 | ||
956f3563 BVA |
5127 | raw_local_irq_save(flags); |
5128 | locked = graph_lock(); | |
a0b0fd53 BVA |
5129 | if (!locked) |
5130 | goto out_irq; | |
5131 | ||
5132 | pf = get_pending_free(); | |
5133 | __lockdep_reset_lock(pf, lock); | |
5134 | call_rcu_zapped(pf); | |
5135 | ||
5136 | graph_unlock(); | |
5137 | out_irq: | |
5138 | raw_local_irq_restore(flags); | |
5139 | } | |
5140 | ||
5141 | /* | |
5142 | * Reset a lock. Does not sleep. Ignores debug_locks. Must only be used by the | |
5143 | * lockdep selftests. | |
5144 | */ | |
5145 | static void lockdep_reset_lock_imm(struct lockdep_map *lock) | |
5146 | { | |
5147 | struct pending_free *pf = delayed_free.pf; | |
5148 | unsigned long flags; | |
5149 | ||
5150 | raw_local_irq_save(flags); | |
5151 | arch_spin_lock(&lockdep_lock); | |
5152 | __lockdep_reset_lock(pf, lock); | |
5153 | __free_zapped_classes(pf); | |
5154 | arch_spin_unlock(&lockdep_lock); | |
fbb9ce95 IM |
5155 | raw_local_irq_restore(flags); |
5156 | } | |
5157 | ||
a0b0fd53 BVA |
5158 | void lockdep_reset_lock(struct lockdep_map *lock) |
5159 | { | |
5160 | init_data_structures_once(); | |
5161 | ||
5162 | if (inside_selftest()) | |
5163 | lockdep_reset_lock_imm(lock); | |
5164 | else | |
5165 | lockdep_reset_lock_reg(lock); | |
5166 | } | |
5167 | ||
108c1485 BVA |
5168 | /* Unregister a dynamically allocated key. */ |
5169 | void lockdep_unregister_key(struct lock_class_key *key) | |
5170 | { | |
5171 | struct hlist_head *hash_head = keyhashentry(key); | |
5172 | struct lock_class_key *k; | |
5173 | struct pending_free *pf; | |
5174 | unsigned long flags; | |
5175 | bool found = false; | |
5176 | ||
5177 | might_sleep(); | |
5178 | ||
5179 | if (WARN_ON_ONCE(static_obj(key))) | |
5180 | return; | |
5181 | ||
5182 | raw_local_irq_save(flags); | |
8b39adbe BVA |
5183 | if (!graph_lock()) |
5184 | goto out_irq; | |
5185 | ||
108c1485 BVA |
5186 | pf = get_pending_free(); |
5187 | hlist_for_each_entry_rcu(k, hash_head, hash_entry) { | |
5188 | if (k == key) { | |
5189 | hlist_del_rcu(&k->hash_entry); | |
5190 | found = true; | |
5191 | break; | |
5192 | } | |
5193 | } | |
5194 | WARN_ON_ONCE(!found); | |
5195 | __lockdep_free_key_range(pf, key, 1); | |
5196 | call_rcu_zapped(pf); | |
8b39adbe BVA |
5197 | graph_unlock(); |
5198 | out_irq: | |
108c1485 BVA |
5199 | raw_local_irq_restore(flags); |
5200 | ||
5201 | /* Wait until is_dynamic_key() has finished accessing k->hash_entry. */ | |
5202 | synchronize_rcu(); | |
5203 | } | |
5204 | EXPORT_SYMBOL_GPL(lockdep_unregister_key); | |
5205 | ||
c3bc8fd6 | 5206 | void __init lockdep_init(void) |
fbb9ce95 IM |
5207 | { |
5208 | printk("Lock dependency validator: Copyright (c) 2006 Red Hat, Inc., Ingo Molnar\n"); | |
5209 | ||
b0788caf | 5210 | printk("... MAX_LOCKDEP_SUBCLASSES: %lu\n", MAX_LOCKDEP_SUBCLASSES); |
fbb9ce95 IM |
5211 | printk("... MAX_LOCK_DEPTH: %lu\n", MAX_LOCK_DEPTH); |
5212 | printk("... MAX_LOCKDEP_KEYS: %lu\n", MAX_LOCKDEP_KEYS); | |
b0788caf | 5213 | printk("... CLASSHASH_SIZE: %lu\n", CLASSHASH_SIZE); |
fbb9ce95 IM |
5214 | printk("... MAX_LOCKDEP_ENTRIES: %lu\n", MAX_LOCKDEP_ENTRIES); |
5215 | printk("... MAX_LOCKDEP_CHAINS: %lu\n", MAX_LOCKDEP_CHAINS); | |
5216 | printk("... CHAINHASH_SIZE: %lu\n", CHAINHASH_SIZE); | |
5217 | ||
09d75ecb | 5218 | printk(" memory used by lock dependency info: %zu kB\n", |
7ff8517e | 5219 | (sizeof(lock_classes) + |
01bb6f0a | 5220 | sizeof(lock_classes_in_use) + |
7ff8517e BVA |
5221 | sizeof(classhash_table) + |
5222 | sizeof(list_entries) + | |
ace35a7a | 5223 | sizeof(list_entries_in_use) + |
a0b0fd53 BVA |
5224 | sizeof(chainhash_table) + |
5225 | sizeof(delayed_free) | |
4dd861d6 | 5226 | #ifdef CONFIG_PROVE_LOCKING |
7ff8517e | 5227 | + sizeof(lock_cq) |
15ea86b5 | 5228 | + sizeof(lock_chains) |
de4643a7 | 5229 | + sizeof(lock_chains_in_use) |
15ea86b5 | 5230 | + sizeof(chain_hlocks) |
4dd861d6 | 5231 | #endif |
90629209 | 5232 | ) / 1024 |
4dd861d6 | 5233 | ); |
fbb9ce95 | 5234 | |
12593b74 BVA |
5235 | #if defined(CONFIG_TRACE_IRQFLAGS) && defined(CONFIG_PROVE_LOCKING) |
5236 | printk(" memory used for stack traces: %zu kB\n", | |
5237 | (sizeof(stack_trace) + sizeof(stack_trace_hash)) / 1024 | |
5238 | ); | |
5239 | #endif | |
5240 | ||
09d75ecb | 5241 | printk(" per task-struct memory footprint: %zu bytes\n", |
7ff8517e | 5242 | sizeof(((struct task_struct *)NULL)->held_locks)); |
fbb9ce95 IM |
5243 | } |
5244 | ||
fbb9ce95 IM |
5245 | static void |
5246 | print_freed_lock_bug(struct task_struct *curr, const void *mem_from, | |
55794a41 | 5247 | const void *mem_to, struct held_lock *hlock) |
fbb9ce95 IM |
5248 | { |
5249 | if (!debug_locks_off()) | |
5250 | return; | |
5251 | if (debug_locks_silent) | |
5252 | return; | |
5253 | ||
681fbec8 | 5254 | pr_warn("\n"); |
a5dd63ef PM |
5255 | pr_warn("=========================\n"); |
5256 | pr_warn("WARNING: held lock freed!\n"); | |
fbdc4b9a | 5257 | print_kernel_ident(); |
a5dd63ef | 5258 | pr_warn("-------------------------\n"); |
04860d48 | 5259 | pr_warn("%s/%d is freeing memory %px-%px, with a lock still held there!\n", |
ba25f9dc | 5260 | curr->comm, task_pid_nr(curr), mem_from, mem_to-1); |
55794a41 | 5261 | print_lock(hlock); |
fbb9ce95 IM |
5262 | lockdep_print_held_locks(curr); |
5263 | ||
681fbec8 | 5264 | pr_warn("\nstack backtrace:\n"); |
fbb9ce95 IM |
5265 | dump_stack(); |
5266 | } | |
5267 | ||
54561783 ON |
5268 | static inline int not_in_range(const void* mem_from, unsigned long mem_len, |
5269 | const void* lock_from, unsigned long lock_len) | |
5270 | { | |
5271 | return lock_from + lock_len <= mem_from || | |
5272 | mem_from + mem_len <= lock_from; | |
5273 | } | |
5274 | ||
fbb9ce95 IM |
5275 | /* |
5276 | * Called when kernel memory is freed (or unmapped), or if a lock | |
5277 | * is destroyed or reinitialized - this code checks whether there is | |
5278 | * any held lock in the memory range of <from> to <to>: | |
5279 | */ | |
5280 | void debug_check_no_locks_freed(const void *mem_from, unsigned long mem_len) | |
5281 | { | |
fbb9ce95 IM |
5282 | struct task_struct *curr = current; |
5283 | struct held_lock *hlock; | |
5284 | unsigned long flags; | |
5285 | int i; | |
5286 | ||
5287 | if (unlikely(!debug_locks)) | |
5288 | return; | |
5289 | ||
fcc784be | 5290 | raw_local_irq_save(flags); |
fbb9ce95 IM |
5291 | for (i = 0; i < curr->lockdep_depth; i++) { |
5292 | hlock = curr->held_locks + i; | |
5293 | ||
54561783 ON |
5294 | if (not_in_range(mem_from, mem_len, hlock->instance, |
5295 | sizeof(*hlock->instance))) | |
fbb9ce95 IM |
5296 | continue; |
5297 | ||
54561783 | 5298 | print_freed_lock_bug(curr, mem_from, mem_from + mem_len, hlock); |
fbb9ce95 IM |
5299 | break; |
5300 | } | |
fcc784be | 5301 | raw_local_irq_restore(flags); |
fbb9ce95 | 5302 | } |
ed07536e | 5303 | EXPORT_SYMBOL_GPL(debug_check_no_locks_freed); |
fbb9ce95 | 5304 | |
1b1d2fb4 | 5305 | static void print_held_locks_bug(void) |
fbb9ce95 IM |
5306 | { |
5307 | if (!debug_locks_off()) | |
5308 | return; | |
5309 | if (debug_locks_silent) | |
5310 | return; | |
5311 | ||
681fbec8 | 5312 | pr_warn("\n"); |
a5dd63ef PM |
5313 | pr_warn("====================================\n"); |
5314 | pr_warn("WARNING: %s/%d still has locks held!\n", | |
1b1d2fb4 | 5315 | current->comm, task_pid_nr(current)); |
fbdc4b9a | 5316 | print_kernel_ident(); |
a5dd63ef | 5317 | pr_warn("------------------------------------\n"); |
1b1d2fb4 | 5318 | lockdep_print_held_locks(current); |
681fbec8 | 5319 | pr_warn("\nstack backtrace:\n"); |
fbb9ce95 IM |
5320 | dump_stack(); |
5321 | } | |
5322 | ||
1b1d2fb4 | 5323 | void debug_check_no_locks_held(void) |
fbb9ce95 | 5324 | { |
1b1d2fb4 CC |
5325 | if (unlikely(current->lockdep_depth > 0)) |
5326 | print_held_locks_bug(); | |
fbb9ce95 | 5327 | } |
1b1d2fb4 | 5328 | EXPORT_SYMBOL_GPL(debug_check_no_locks_held); |
fbb9ce95 | 5329 | |
8dce7a9a | 5330 | #ifdef __KERNEL__ |
fbb9ce95 IM |
5331 | void debug_show_all_locks(void) |
5332 | { | |
5333 | struct task_struct *g, *p; | |
fbb9ce95 | 5334 | |
9c35dd7f | 5335 | if (unlikely(!debug_locks)) { |
681fbec8 | 5336 | pr_warn("INFO: lockdep is turned off.\n"); |
9c35dd7f JP |
5337 | return; |
5338 | } | |
681fbec8 | 5339 | pr_warn("\nShowing all locks held in the system:\n"); |
fbb9ce95 | 5340 | |
0f736a52 TH |
5341 | rcu_read_lock(); |
5342 | for_each_process_thread(g, p) { | |
0f736a52 TH |
5343 | if (!p->lockdep_depth) |
5344 | continue; | |
5345 | lockdep_print_held_locks(p); | |
88f1c87d | 5346 | touch_nmi_watchdog(); |
0f736a52 TH |
5347 | touch_all_softlockup_watchdogs(); |
5348 | } | |
5349 | rcu_read_unlock(); | |
fbb9ce95 | 5350 | |
681fbec8 | 5351 | pr_warn("\n"); |
a5dd63ef | 5352 | pr_warn("=============================================\n\n"); |
fbb9ce95 | 5353 | } |
fbb9ce95 | 5354 | EXPORT_SYMBOL_GPL(debug_show_all_locks); |
8dce7a9a | 5355 | #endif |
fbb9ce95 | 5356 | |
82a1fcb9 IM |
5357 | /* |
5358 | * Careful: only use this function if you are sure that | |
5359 | * the task cannot run in parallel! | |
5360 | */ | |
f1b499f0 | 5361 | void debug_show_held_locks(struct task_struct *task) |
fbb9ce95 | 5362 | { |
9c35dd7f JP |
5363 | if (unlikely(!debug_locks)) { |
5364 | printk("INFO: lockdep is turned off.\n"); | |
5365 | return; | |
5366 | } | |
fbb9ce95 IM |
5367 | lockdep_print_held_locks(task); |
5368 | } | |
fbb9ce95 | 5369 | EXPORT_SYMBOL_GPL(debug_show_held_locks); |
b351d164 | 5370 | |
722a9f92 | 5371 | asmlinkage __visible void lockdep_sys_exit(void) |
b351d164 PZ |
5372 | { |
5373 | struct task_struct *curr = current; | |
5374 | ||
5375 | if (unlikely(curr->lockdep_depth)) { | |
5376 | if (!debug_locks_off()) | |
5377 | return; | |
681fbec8 | 5378 | pr_warn("\n"); |
a5dd63ef PM |
5379 | pr_warn("================================================\n"); |
5380 | pr_warn("WARNING: lock held when returning to user space!\n"); | |
fbdc4b9a | 5381 | print_kernel_ident(); |
a5dd63ef | 5382 | pr_warn("------------------------------------------------\n"); |
681fbec8 | 5383 | pr_warn("%s/%d is leaving the kernel with locks still held!\n", |
b351d164 PZ |
5384 | curr->comm, curr->pid); |
5385 | lockdep_print_held_locks(curr); | |
5386 | } | |
b09be676 BP |
5387 | |
5388 | /* | |
5389 | * The lock history for each syscall should be independent. So wipe the | |
5390 | * slate clean on return to userspace. | |
5391 | */ | |
f52be570 | 5392 | lockdep_invariant_state(false); |
b351d164 | 5393 | } |
0632eb3d | 5394 | |
b3fbab05 | 5395 | void lockdep_rcu_suspicious(const char *file, const int line, const char *s) |
0632eb3d PM |
5396 | { |
5397 | struct task_struct *curr = current; | |
5398 | ||
2b3fc35f | 5399 | /* Note: the following can be executed concurrently, so be careful. */ |
681fbec8 | 5400 | pr_warn("\n"); |
a5dd63ef PM |
5401 | pr_warn("=============================\n"); |
5402 | pr_warn("WARNING: suspicious RCU usage\n"); | |
fbdc4b9a | 5403 | print_kernel_ident(); |
a5dd63ef | 5404 | pr_warn("-----------------------------\n"); |
681fbec8 PM |
5405 | pr_warn("%s:%d %s!\n", file, line, s); |
5406 | pr_warn("\nother info that might help us debug this:\n\n"); | |
5407 | pr_warn("\n%srcu_scheduler_active = %d, debug_locks = %d\n", | |
c5fdcec9 PM |
5408 | !rcu_lockdep_current_cpu_online() |
5409 | ? "RCU used illegally from offline CPU!\n" | |
5c173eb8 | 5410 | : !rcu_is_watching() |
c5fdcec9 PM |
5411 | ? "RCU used illegally from idle CPU!\n" |
5412 | : "", | |
5413 | rcu_scheduler_active, debug_locks); | |
0464e937 FW |
5414 | |
5415 | /* | |
5416 | * If a CPU is in the RCU-free window in idle (ie: in the section | |
5417 | * between rcu_idle_enter() and rcu_idle_exit(), then RCU | |
5418 | * considers that CPU to be in an "extended quiescent state", | |
5419 | * which means that RCU will be completely ignoring that CPU. | |
5420 | * Therefore, rcu_read_lock() and friends have absolutely no | |
5421 | * effect on a CPU running in that state. In other words, even if | |
5422 | * such an RCU-idle CPU has called rcu_read_lock(), RCU might well | |
5423 | * delete data structures out from under it. RCU really has no | |
5424 | * choice here: we need to keep an RCU-free window in idle where | |
5425 | * the CPU may possibly enter into low power mode. This way we can | |
5426 | * notice an extended quiescent state to other CPUs that started a grace | |
5427 | * period. Otherwise we would delay any grace period as long as we run | |
5428 | * in the idle task. | |
5429 | * | |
5430 | * So complain bitterly if someone does call rcu_read_lock(), | |
5431 | * rcu_read_lock_bh() and so on from extended quiescent states. | |
5432 | */ | |
5c173eb8 | 5433 | if (!rcu_is_watching()) |
681fbec8 | 5434 | pr_warn("RCU used illegally from extended quiescent state!\n"); |
0464e937 | 5435 | |
0632eb3d | 5436 | lockdep_print_held_locks(curr); |
681fbec8 | 5437 | pr_warn("\nstack backtrace:\n"); |
0632eb3d PM |
5438 | dump_stack(); |
5439 | } | |
b3fbab05 | 5440 | EXPORT_SYMBOL_GPL(lockdep_rcu_suspicious); |