Blame view
kernel/lockdep.c
101 KB
fbb9ce953 [PATCH] lockdep: ... |
1 2 3 4 5 6 7 |
/* * kernel/lockdep.c * * Runtime locking correctness validator * * Started by Ingo Molnar: * |
4b32d0a4e lockdep: various ... |
8 9 |
* Copyright (C) 2006,2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com> * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com> |
fbb9ce953 [PATCH] lockdep: ... |
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 |
* * this code maps all the lock dependencies as they occur in a live kernel * and will warn about the following classes of locking bugs: * * - lock inversion scenarios * - circular lock dependencies * - hardirq/softirq safe/unsafe locking bugs * * Bugs are reported even if the current locking scenario does not cause * any deadlock at this point. * * I.e. if anytime in the past two locks were taken in a different order, * even if it happened for another task, even if those were different * locks (but of the same class as this lock), this code will detect it. * * Thanks to Arjan van de Ven for coming up with the initial idea of * mapping lock dependencies runtime. */ |
a5e25883a ftrace: replace r... |
28 |
#define DISABLE_BRANCH_PROFILING |
fbb9ce953 [PATCH] lockdep: ... |
29 30 31 32 33 34 35 36 37 38 39 40 |
#include <linux/mutex.h> #include <linux/sched.h> #include <linux/delay.h> #include <linux/module.h> #include <linux/proc_fs.h> #include <linux/seq_file.h> #include <linux/spinlock.h> #include <linux/kallsyms.h> #include <linux/interrupt.h> #include <linux/stacktrace.h> #include <linux/debug_locks.h> #include <linux/irqflags.h> |
99de055ac [PATCH] lockdep: ... |
41 |
#include <linux/utsname.h> |
4b32d0a4e lockdep: various ... |
42 |
#include <linux/hash.h> |
81d68a96a ftrace: trace irq... |
43 |
#include <linux/ftrace.h> |
b4b136f44 lockdep: use stri... |
44 |
#include <linux/stringify.h> |
d588e4615 lockdep: Improve ... |
45 |
#include <linux/bitops.h> |
5a0e3ad6a include cleanup: ... |
46 |
#include <linux/gfp.h> |
af0129614 lockdep: BFS cleanup |
47 |
|
fbb9ce953 [PATCH] lockdep: ... |
48 49 50 |
#include <asm/sections.h> #include "lockdep_internals.h" |
a8d154b00 tracing: create a... |
51 |
#define CREATE_TRACE_POINTS |
67178767b tracing: Rename '... |
52 |
#include <trace/events/lock.h> |
a8d154b00 tracing: create a... |
53 |
|
f20786ff4 lockstat: core in... |
54 55 56 57 58 59 60 61 62 63 64 65 66 |
#ifdef CONFIG_PROVE_LOCKING int prove_locking = 1; module_param(prove_locking, int, 0644); #else #define prove_locking 0 #endif #ifdef CONFIG_LOCK_STAT int lock_stat = 1; module_param(lock_stat, int, 0644); #else #define lock_stat 0 #endif |
fbb9ce953 [PATCH] lockdep: ... |
67 |
/* |
74c383f14 [PATCH] lockdep: ... |
68 69 |
* lockdep_lock: protects the lockdep graph, the hashes and the * class/list/hash allocators. |
fbb9ce953 [PATCH] lockdep: ... |
70 71 72 |
* * This is one of the rare exceptions where it's justified * to use a raw spinlock - we really dont want the spinlock |
74c383f14 [PATCH] lockdep: ... |
73 |
* code to recurse back into the lockdep code... |
fbb9ce953 [PATCH] lockdep: ... |
74 |
*/ |
edc35bd72 locking: Rename _... |
75 |
static arch_spinlock_t lockdep_lock = (arch_spinlock_t)__ARCH_SPIN_LOCK_UNLOCKED; |
74c383f14 [PATCH] lockdep: ... |
76 77 78 |
static int graph_lock(void) { |
0199c4e68 locking: Convert ... |
79 |
arch_spin_lock(&lockdep_lock); |
74c383f14 [PATCH] lockdep: ... |
80 81 82 83 84 85 86 |
/* * Make sure that if another CPU detected a bug while * walking the graph we dont change it (while the other * CPU is busy printing out stuff with the graph lock * dropped already) */ if (!debug_locks) { |
0199c4e68 locking: Convert ... |
87 |
arch_spin_unlock(&lockdep_lock); |
74c383f14 [PATCH] lockdep: ... |
88 89 |
return 0; } |
bb065afb8 lockdep: update l... |
90 91 |
/* prevent any recursions within lockdep from causing deadlocks */ current->lockdep_recursion++; |
74c383f14 [PATCH] lockdep: ... |
92 93 94 95 96 |
return 1; } static inline int graph_unlock(void) { |
0119fee44 lockdep: Comment ... |
97 98 99 100 101 |
if (debug_locks && !arch_spin_is_locked(&lockdep_lock)) { /* * The lockdep graph lock isn't locked while we expect it to * be, we're confused now, bye! */ |
381a22920 [PATCH] lockdep: ... |
102 |
return DEBUG_LOCKS_WARN_ON(1); |
0119fee44 lockdep: Comment ... |
103 |
} |
381a22920 [PATCH] lockdep: ... |
104 |
|
bb065afb8 lockdep: update l... |
105 |
current->lockdep_recursion--; |
0199c4e68 locking: Convert ... |
106 |
arch_spin_unlock(&lockdep_lock); |
74c383f14 [PATCH] lockdep: ... |
107 108 109 110 111 112 113 114 115 116 |
return 0; } /* * Turn lock debugging off and return with 0 if it was off already, * and also release the graph lock: */ static inline int debug_locks_off_graph_unlock(void) { int ret = debug_locks_off(); |
0199c4e68 locking: Convert ... |
117 |
arch_spin_unlock(&lockdep_lock); |
74c383f14 [PATCH] lockdep: ... |
118 119 120 |
return ret; } |
fbb9ce953 [PATCH] lockdep: ... |
121 122 123 124 |
static int lockdep_initialized; unsigned long nr_list_entries; |
af0129614 lockdep: BFS cleanup |
125 |
static struct lock_list list_entries[MAX_LOCKDEP_ENTRIES]; |
fbb9ce953 [PATCH] lockdep: ... |
126 |
|
fbb9ce953 [PATCH] lockdep: ... |
127 128 129 130 131 132 133 134 |
/* * All data structures here are protected by the global debug_lock. * * Mutex key structs only get allocated, once during bootup, and never * get freed - this significantly simplifies the debugging code. */ unsigned long nr_lock_classes; static struct lock_class lock_classes[MAX_LOCKDEP_KEYS]; |
f82b217e3 lockdep: shrink h... |
135 136 137 |
static inline struct lock_class *hlock_class(struct held_lock *hlock) { if (!hlock->class_idx) { |
0119fee44 lockdep: Comment ... |
138 139 140 |
/* * Someone passed in garbage, we give up. */ |
f82b217e3 lockdep: shrink h... |
141 142 143 144 145 |
DEBUG_LOCKS_WARN_ON(1); return NULL; } return lock_classes + hlock->class_idx - 1; } |
f20786ff4 lockstat: core in... |
146 |
#ifdef CONFIG_LOCK_STAT |
1871e52c7 percpu: make perc... |
147 148 |
static DEFINE_PER_CPU(struct lock_class_stats[MAX_LOCKDEP_KEYS], cpu_lock_stats); |
f20786ff4 lockstat: core in... |
149 |
|
3365e7798 lockdep: Use cpu_... |
150 151 |
static inline u64 lockstat_clock(void) { |
c676329ab sched_clock: Add ... |
152 |
return local_clock(); |
3365e7798 lockdep: Use cpu_... |
153 |
} |
c7e78cff6 lockstat: contend... |
154 |
static int lock_point(unsigned long points[], unsigned long ip) |
f20786ff4 lockstat: core in... |
155 156 |
{ int i; |
c7e78cff6 lockstat: contend... |
157 158 159 |
for (i = 0; i < LOCKSTAT_POINTS; i++) { if (points[i] == 0) { points[i] = ip; |
f20786ff4 lockstat: core in... |
160 161 |
break; } |
c7e78cff6 lockstat: contend... |
162 |
if (points[i] == ip) |
f20786ff4 lockstat: core in... |
163 164 165 166 167 |
break; } return i; } |
3365e7798 lockdep: Use cpu_... |
168 |
static void lock_time_inc(struct lock_time *lt, u64 time) |
f20786ff4 lockstat: core in... |
169 170 171 |
{ if (time > lt->max) lt->max = time; |
109d71c6d lockstat: Fix min... |
172 |
if (time < lt->min || !lt->nr) |
f20786ff4 lockstat: core in... |
173 174 175 176 177 |
lt->min = time; lt->total += time; lt->nr++; } |
c46261de0 lockstat: human r... |
178 179 |
static inline void lock_time_add(struct lock_time *src, struct lock_time *dst) { |
109d71c6d lockstat: Fix min... |
180 181 182 183 184 185 186 187 |
if (!src->nr) return; if (src->max > dst->max) dst->max = src->max; if (src->min < dst->min || !dst->nr) dst->min = src->min; |
c46261de0 lockstat: human r... |
188 189 190 191 192 193 194 195 196 197 198 199 |
dst->total += src->total; dst->nr += src->nr; } struct lock_class_stats lock_stats(struct lock_class *class) { struct lock_class_stats stats; int cpu, i; memset(&stats, 0, sizeof(struct lock_class_stats)); for_each_possible_cpu(cpu) { struct lock_class_stats *pcs = |
1871e52c7 percpu: make perc... |
200 |
&per_cpu(cpu_lock_stats, cpu)[class - lock_classes]; |
c46261de0 lockstat: human r... |
201 202 203 |
for (i = 0; i < ARRAY_SIZE(stats.contention_point); i++) stats.contention_point[i] += pcs->contention_point[i]; |
c7e78cff6 lockstat: contend... |
204 205 |
for (i = 0; i < ARRAY_SIZE(stats.contending_point); i++) stats.contending_point[i] += pcs->contending_point[i]; |
c46261de0 lockstat: human r... |
206 207 208 209 210 |
lock_time_add(&pcs->read_waittime, &stats.read_waittime); lock_time_add(&pcs->write_waittime, &stats.write_waittime); lock_time_add(&pcs->read_holdtime, &stats.read_holdtime); lock_time_add(&pcs->write_holdtime, &stats.write_holdtime); |
96645678c lockstat: measure... |
211 212 213 |
for (i = 0; i < ARRAY_SIZE(stats.bounces); i++) stats.bounces[i] += pcs->bounces[i]; |
c46261de0 lockstat: human r... |
214 215 216 217 218 219 220 221 222 223 224 |
} return stats; } void clear_lock_stats(struct lock_class *class) { int cpu; for_each_possible_cpu(cpu) { struct lock_class_stats *cpu_stats = |
1871e52c7 percpu: make perc... |
225 |
&per_cpu(cpu_lock_stats, cpu)[class - lock_classes]; |
c46261de0 lockstat: human r... |
226 227 228 229 |
memset(cpu_stats, 0, sizeof(struct lock_class_stats)); } memset(class->contention_point, 0, sizeof(class->contention_point)); |
c7e78cff6 lockstat: contend... |
230 |
memset(class->contending_point, 0, sizeof(class->contending_point)); |
c46261de0 lockstat: human r... |
231 |
} |
f20786ff4 lockstat: core in... |
232 233 |
static struct lock_class_stats *get_lock_stats(struct lock_class *class) { |
1871e52c7 percpu: make perc... |
234 |
return &get_cpu_var(cpu_lock_stats)[class - lock_classes]; |
f20786ff4 lockstat: core in... |
235 236 237 238 |
} static void put_lock_stats(struct lock_class_stats *stats) { |
1871e52c7 percpu: make perc... |
239 |
put_cpu_var(cpu_lock_stats); |
f20786ff4 lockstat: core in... |
240 241 242 243 244 |
} static void lock_release_holdtime(struct held_lock *hlock) { struct lock_class_stats *stats; |
3365e7798 lockdep: Use cpu_... |
245 |
u64 holdtime; |
f20786ff4 lockstat: core in... |
246 247 248 |
if (!lock_stat) return; |
3365e7798 lockdep: Use cpu_... |
249 |
holdtime = lockstat_clock() - hlock->holdtime_stamp; |
f20786ff4 lockstat: core in... |
250 |
|
f82b217e3 lockdep: shrink h... |
251 |
stats = get_lock_stats(hlock_class(hlock)); |
f20786ff4 lockstat: core in... |
252 253 254 255 256 257 258 259 260 261 262 |
if (hlock->read) lock_time_inc(&stats->read_holdtime, holdtime); else lock_time_inc(&stats->write_holdtime, holdtime); put_lock_stats(stats); } #else static inline void lock_release_holdtime(struct held_lock *hlock) { } #endif |
fbb9ce953 [PATCH] lockdep: ... |
263 264 265 266 267 268 269 270 271 272 273 274 |
/* * We keep a global list of all lock classes. The list only grows, * never shrinks. The list is only accessed with the lockdep * spinlock lock held. */ LIST_HEAD(all_lock_classes); /* * The lockdep classes are in a hash-table as well, for fast lookup: */ #define CLASSHASH_BITS (MAX_LOCKDEP_KEYS_BITS - 1) #define CLASSHASH_SIZE (1UL << CLASSHASH_BITS) |
4b32d0a4e lockdep: various ... |
275 |
#define __classhashfn(key) hash_long((unsigned long)key, CLASSHASH_BITS) |
fbb9ce953 [PATCH] lockdep: ... |
276 277 278 |
#define classhashentry(key) (classhash_table + __classhashfn((key))) static struct list_head classhash_table[CLASSHASH_SIZE]; |
fbb9ce953 [PATCH] lockdep: ... |
279 280 281 282 283 284 |
/* * We put the lock dependency chains into a hash-table as well, to cache * their existence: */ #define CHAINHASH_BITS (MAX_LOCKDEP_CHAINS_BITS-1) #define CHAINHASH_SIZE (1UL << CHAINHASH_BITS) |
4b32d0a4e lockdep: various ... |
285 |
#define __chainhashfn(chain) hash_long(chain, CHAINHASH_BITS) |
fbb9ce953 [PATCH] lockdep: ... |
286 287 288 289 290 291 292 293 294 295 296 |
#define chainhashentry(chain) (chainhash_table + __chainhashfn((chain))) static struct list_head chainhash_table[CHAINHASH_SIZE]; /* * The hash key of the lock dependency chains is a hash itself too: * it's a hash of all locks taken up to that lock, including that lock. * It's a 64-bit hash, because it's important for the keys to be * unique. */ #define iterate_chain_key(key1, key2) \ |
03cbc358a [PATCH] lockdep c... |
297 298 |
(((key1) << MAX_LOCKDEP_KEYS_BITS) ^ \ ((key1) >> (64-MAX_LOCKDEP_KEYS_BITS)) ^ \ |
fbb9ce953 [PATCH] lockdep: ... |
299 |
(key2)) |
1d09daa55 ftrace: use Makef... |
300 |
void lockdep_off(void) |
fbb9ce953 [PATCH] lockdep: ... |
301 302 303 |
{ current->lockdep_recursion++; } |
fbb9ce953 [PATCH] lockdep: ... |
304 |
EXPORT_SYMBOL(lockdep_off); |
1d09daa55 ftrace: use Makef... |
305 |
void lockdep_on(void) |
fbb9ce953 [PATCH] lockdep: ... |
306 307 308 |
{ current->lockdep_recursion--; } |
fbb9ce953 [PATCH] lockdep: ... |
309 |
EXPORT_SYMBOL(lockdep_on); |
fbb9ce953 [PATCH] lockdep: ... |
310 311 312 313 314 |
/* * Debugging switches: */ #define VERBOSE 0 |
33e94e960 [PATCH] lockdep: ... |
315 |
#define VERY_VERBOSE 0 |
fbb9ce953 [PATCH] lockdep: ... |
316 317 318 319 |
#if VERBOSE # define HARDIRQ_VERBOSE 1 # define SOFTIRQ_VERBOSE 1 |
cf40bd16f lockdep: annotate... |
320 |
# define RECLAIM_VERBOSE 1 |
fbb9ce953 [PATCH] lockdep: ... |
321 322 323 |
#else # define HARDIRQ_VERBOSE 0 # define SOFTIRQ_VERBOSE 0 |
cf40bd16f lockdep: annotate... |
324 |
# define RECLAIM_VERBOSE 0 |
fbb9ce953 [PATCH] lockdep: ... |
325 |
#endif |
cf40bd16f lockdep: annotate... |
326 |
#if VERBOSE || HARDIRQ_VERBOSE || SOFTIRQ_VERBOSE || RECLAIM_VERBOSE |
fbb9ce953 [PATCH] lockdep: ... |
327 328 329 330 331 |
/* * Quick filtering for interesting events: */ static int class_filter(struct lock_class *class) { |
f9829cceb [PATCH] Minor cle... |
332 333 |
#if 0 /* Example */ |
fbb9ce953 [PATCH] lockdep: ... |
334 |
if (class->name_version == 1 && |
f9829cceb [PATCH] Minor cle... |
335 |
!strcmp(class->name, "lockname")) |
fbb9ce953 [PATCH] lockdep: ... |
336 337 |
return 1; if (class->name_version == 1 && |
f9829cceb [PATCH] Minor cle... |
338 |
!strcmp(class->name, "&struct->lockfield")) |
fbb9ce953 [PATCH] lockdep: ... |
339 |
return 1; |
f9829cceb [PATCH] Minor cle... |
340 |
#endif |
a66408974 [PATCH] lockdep: ... |
341 342 |
/* Filter everything else. 1 would be to allow everything else */ return 0; |
fbb9ce953 [PATCH] lockdep: ... |
343 344 345 346 347 348 349 350 351 352 |
} #endif static int verbose(struct lock_class *class) { #if VERBOSE return class_filter(class); #endif return 0; } |
fbb9ce953 [PATCH] lockdep: ... |
353 354 |
/* * Stack-trace: tightly packed array of stack backtrace |
74c383f14 [PATCH] lockdep: ... |
355 |
* addresses. Protected by the graph_lock. |
fbb9ce953 [PATCH] lockdep: ... |
356 357 358 359 360 361 362 363 364 |
*/ unsigned long nr_stack_trace_entries; static unsigned long stack_trace[MAX_STACK_TRACE_ENTRIES]; static int save_trace(struct stack_trace *trace) { trace->nr_entries = 0; trace->max_entries = MAX_STACK_TRACE_ENTRIES - nr_stack_trace_entries; trace->entries = stack_trace + nr_stack_trace_entries; |
5a1b3999d [PATCH] x86: Some... |
365 |
trace->skip = 3; |
5a1b3999d [PATCH] x86: Some... |
366 |
|
ab1b6f03a simplify the stac... |
367 |
save_stack_trace(trace); |
fbb9ce953 [PATCH] lockdep: ... |
368 |
|
4f84f4330 lockdep: Fix back... |
369 370 371 372 373 374 375 |
/* * Some daft arches put -1 at the end to indicate its a full trace. * * <rant> this is buggy anyway, since it takes a whole extra entry so a * complete trace that maxes out the entries provided will be reported * as incomplete, friggin useless </rant> */ |
ea5b41f9d lockdep: Avoid ou... |
376 377 |
if (trace->nr_entries != 0 && trace->entries[trace->nr_entries-1] == ULONG_MAX) |
4f84f4330 lockdep: Fix back... |
378 |
trace->nr_entries--; |
fbb9ce953 [PATCH] lockdep: ... |
379 380 381 |
trace->max_entries = trace->nr_entries; nr_stack_trace_entries += trace->nr_entries; |
fbb9ce953 [PATCH] lockdep: ... |
382 |
|
4f84f4330 lockdep: Fix back... |
383 |
if (nr_stack_trace_entries >= MAX_STACK_TRACE_ENTRIES-1) { |
74c383f14 [PATCH] lockdep: ... |
384 385 386 387 388 389 390 391 |
if (!debug_locks_off_graph_unlock()) return 0; printk("BUG: MAX_STACK_TRACE_ENTRIES too low! "); printk("turning off the locking correctness validator. "); dump_stack(); |
fbb9ce953 [PATCH] lockdep: ... |
392 393 394 395 396 397 398 399 400 401 |
return 0; } return 1; } unsigned int nr_hardirq_chains; unsigned int nr_softirq_chains; unsigned int nr_process_chains; unsigned int max_lockdep_depth; |
fbb9ce953 [PATCH] lockdep: ... |
402 403 404 405 406 407 408 409 |
#ifdef CONFIG_DEBUG_LOCKDEP /* * We cannot printk in early bootup code. Not even early_printk() * might work. So we mark any initialization errors and printk * about it later on, in lockdep_info(). */ static int lockdep_init_error; |
c71063c9c lockdep debugging... |
410 411 412 413 414 |
static unsigned long lockdep_init_trace_data[20]; static struct stack_trace lockdep_init_trace = { .max_entries = ARRAY_SIZE(lockdep_init_trace_data), .entries = lockdep_init_trace_data, }; |
fbb9ce953 [PATCH] lockdep: ... |
415 416 417 418 |
/* * Various lockdep statistics: */ |
bd6d29c25 lockstat: Make lo... |
419 |
DEFINE_PER_CPU(struct lockdep_stats, lockdep_stats); |
fbb9ce953 [PATCH] lockdep: ... |
420 421 422 423 424 |
#endif /* * Locking printouts: */ |
fabe9c42c lockdep: generate... |
425 |
#define __USAGE(__STATE) \ |
b4b136f44 lockdep: use stri... |
426 427 428 429 |
[LOCK_USED_IN_##__STATE] = "IN-"__stringify(__STATE)"-W", \ [LOCK_ENABLED_##__STATE] = __stringify(__STATE)"-ON-W", \ [LOCK_USED_IN_##__STATE##_READ] = "IN-"__stringify(__STATE)"-R",\ [LOCK_ENABLED_##__STATE##_READ] = __stringify(__STATE)"-ON-R", |
fabe9c42c lockdep: generate... |
430 |
|
fbb9ce953 [PATCH] lockdep: ... |
431 432 |
static const char *usage_str[] = { |
fabe9c42c lockdep: generate... |
433 434 435 436 |
#define LOCKDEP_STATE(__STATE) __USAGE(__STATE) #include "lockdep_states.h" #undef LOCKDEP_STATE [LOCK_USED] = "INITIAL USE", |
fbb9ce953 [PATCH] lockdep: ... |
437 438 439 440 |
}; const char * __get_key_name(struct lockdep_subclass_key *key, char *str) { |
ffb451227 Simplify kallsyms... |
441 |
return kallsyms_lookup((unsigned long)key, NULL, NULL, NULL, str); |
fbb9ce953 [PATCH] lockdep: ... |
442 |
} |
3ff176ca4 lockdep: simplify... |
443 |
static inline unsigned long lock_flag(enum lock_usage_bit bit) |
fbb9ce953 [PATCH] lockdep: ... |
444 |
{ |
3ff176ca4 lockdep: simplify... |
445 446 |
return 1UL << bit; } |
fbb9ce953 [PATCH] lockdep: ... |
447 |
|
3ff176ca4 lockdep: simplify... |
448 449 450 451 452 453 454 455 456 457 |
static char get_usage_char(struct lock_class *class, enum lock_usage_bit bit) { char c = '.'; if (class->usage_mask & lock_flag(bit + 2)) c = '+'; if (class->usage_mask & lock_flag(bit)) { c = '-'; if (class->usage_mask & lock_flag(bit + 2)) c = '?'; |
fbb9ce953 [PATCH] lockdep: ... |
458 |
} |
3ff176ca4 lockdep: simplify... |
459 460 |
return c; } |
cf40bd16f lockdep: annotate... |
461 |
|
f510b233c lockdep: get_user... |
462 |
void get_usage_chars(struct lock_class *class, char usage[LOCK_USAGE_CHARS]) |
3ff176ca4 lockdep: simplify... |
463 |
{ |
f510b233c lockdep: get_user... |
464 |
int i = 0; |
cf40bd16f lockdep: annotate... |
465 |
|
f510b233c lockdep: get_user... |
466 467 468 469 470 471 472 |
#define LOCKDEP_STATE(__STATE) \ usage[i++] = get_usage_char(class, LOCK_USED_IN_##__STATE); \ usage[i++] = get_usage_char(class, LOCK_USED_IN_##__STATE##_READ); #include "lockdep_states.h" #undef LOCKDEP_STATE usage[i] = '\0'; |
fbb9ce953 [PATCH] lockdep: ... |
473 |
} |
3003eba31 lockdep: Print a ... |
474 475 476 477 478 479 480 481 482 483 484 |
static int __print_lock_name(struct lock_class *class) { char str[KSYM_NAME_LEN]; const char *name; name = class->name; if (!name) name = __get_key_name(class->key, str); return printk("%s", name); } |
fbb9ce953 [PATCH] lockdep: ... |
485 486 |
static void print_lock_name(struct lock_class *class) { |
f510b233c lockdep: get_user... |
487 |
char str[KSYM_NAME_LEN], usage[LOCK_USAGE_CHARS]; |
fbb9ce953 [PATCH] lockdep: ... |
488 |
const char *name; |
f510b233c lockdep: get_user... |
489 |
get_usage_chars(class, usage); |
fbb9ce953 [PATCH] lockdep: ... |
490 491 492 493 494 495 496 497 498 499 500 501 |
name = class->name; if (!name) { name = __get_key_name(class->key, str); printk(" (%s", name); } else { printk(" (%s", name); if (class->name_version > 1) printk("#%d", class->name_version); if (class->subclass) printk("/%d", class->subclass); } |
f510b233c lockdep: get_user... |
502 |
printk("){%s}", usage); |
fbb9ce953 [PATCH] lockdep: ... |
503 504 505 506 507 |
} static void print_lockdep_cache(struct lockdep_map *lock) { const char *name; |
9281acea6 kallsyms: make KS... |
508 |
char str[KSYM_NAME_LEN]; |
fbb9ce953 [PATCH] lockdep: ... |
509 510 511 512 513 514 515 516 517 518 |
name = lock->name; if (!name) name = __get_key_name(lock->key->subkeys, str); printk("%s", name); } static void print_lock(struct held_lock *hlock) { |
f82b217e3 lockdep: shrink h... |
519 |
print_lock_name(hlock_class(hlock)); |
fbb9ce953 [PATCH] lockdep: ... |
520 521 522 523 524 525 526 527 528 |
printk(", at: "); print_ip_sym(hlock->acquire_ip); } static void lockdep_print_held_locks(struct task_struct *curr) { int i, depth = curr->lockdep_depth; if (!depth) { |
ba25f9dcc Use helpers to ob... |
529 530 |
printk("no locks held by %s/%d. ", curr->comm, task_pid_nr(curr)); |
fbb9ce953 [PATCH] lockdep: ... |
531 532 533 534 |
return; } printk("%d lock%s held by %s/%d: ", |
ba25f9dcc Use helpers to ob... |
535 |
depth, depth > 1 ? "s" : "", curr->comm, task_pid_nr(curr)); |
fbb9ce953 [PATCH] lockdep: ... |
536 537 538 539 540 541 |
for (i = 0; i < depth; i++) { printk(" #%d: ", i); print_lock(curr->held_locks + i); } } |
fbb9ce953 [PATCH] lockdep: ... |
542 |
|
8e18257d2 lockdep: reduce t... |
543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 |
static void print_kernel_version(void) { printk("%s %.*s ", init_utsname()->release, (int)strcspn(init_utsname()->version, " "), init_utsname()->version); } static int very_verbose(struct lock_class *class) { #if VERY_VERBOSE return class_filter(class); #endif return 0; } |
fbb9ce953 [PATCH] lockdep: ... |
558 |
/* |
8e18257d2 lockdep: reduce t... |
559 |
* Is this the address of a static object: |
fbb9ce953 [PATCH] lockdep: ... |
560 |
*/ |
8e18257d2 lockdep: reduce t... |
561 |
static int static_obj(void *obj) |
fbb9ce953 [PATCH] lockdep: ... |
562 |
{ |
8e18257d2 lockdep: reduce t... |
563 564 565 |
unsigned long start = (unsigned long) &_stext, end = (unsigned long) &_end, addr = (unsigned long) obj; |
8e18257d2 lockdep: reduce t... |
566 |
|
fbb9ce953 [PATCH] lockdep: ... |
567 |
/* |
8e18257d2 lockdep: reduce t... |
568 |
* static variable? |
fbb9ce953 [PATCH] lockdep: ... |
569 |
*/ |
8e18257d2 lockdep: reduce t... |
570 571 |
if ((addr >= start) && (addr < end)) return 1; |
fbb9ce953 [PATCH] lockdep: ... |
572 |
|
2a9ad18de lockdep: use new ... |
573 574 |
if (arch_is_kernel_data(addr)) return 1; |
fbb9ce953 [PATCH] lockdep: ... |
575 |
/* |
10fad5e46 percpu, module: i... |
576 |
* in-kernel percpu var? |
fbb9ce953 [PATCH] lockdep: ... |
577 |
*/ |
10fad5e46 percpu, module: i... |
578 579 |
if (is_kernel_percpu_address(addr)) return 1; |
fbb9ce953 [PATCH] lockdep: ... |
580 |
|
8e18257d2 lockdep: reduce t... |
581 |
/* |
10fad5e46 percpu, module: i... |
582 |
* module static or percpu var? |
8e18257d2 lockdep: reduce t... |
583 |
*/ |
10fad5e46 percpu, module: i... |
584 |
return is_module_address(addr) || is_module_percpu_address(addr); |
99de055ac [PATCH] lockdep: ... |
585 |
} |
fbb9ce953 [PATCH] lockdep: ... |
586 |
/* |
8e18257d2 lockdep: reduce t... |
587 588 |
* To make lock name printouts unique, we calculate a unique * class->name_version generation counter: |
fbb9ce953 [PATCH] lockdep: ... |
589 |
*/ |
8e18257d2 lockdep: reduce t... |
590 |
static int count_matching_names(struct lock_class *new_class) |
fbb9ce953 [PATCH] lockdep: ... |
591 |
{ |
8e18257d2 lockdep: reduce t... |
592 593 |
struct lock_class *class; int count = 0; |
fbb9ce953 [PATCH] lockdep: ... |
594 |
|
8e18257d2 lockdep: reduce t... |
595 |
if (!new_class->name) |
fbb9ce953 [PATCH] lockdep: ... |
596 |
return 0; |
8e18257d2 lockdep: reduce t... |
597 598 599 600 601 602 |
list_for_each_entry(class, &all_lock_classes, lock_entry) { if (new_class->key - new_class->subclass == class->key) return class->name_version; if (class->name && !strcmp(class->name, new_class->name)) count = max(count, class->name_version); } |
fbb9ce953 [PATCH] lockdep: ... |
603 |
|
8e18257d2 lockdep: reduce t... |
604 |
return count + 1; |
fbb9ce953 [PATCH] lockdep: ... |
605 |
} |
8e18257d2 lockdep: reduce t... |
606 607 608 609 610 611 612 |
/* * Register a lock's class in the hash-table, if the class is not present * yet. Otherwise we look it up. We cache the result in the lock object * itself, so actual lookup of the hash should be once per lock object. */ static inline struct lock_class * look_up_lock_class(struct lockdep_map *lock, unsigned int subclass) |
fbb9ce953 [PATCH] lockdep: ... |
613 |
{ |
8e18257d2 lockdep: reduce t... |
614 615 616 |
struct lockdep_subclass_key *key; struct list_head *hash_head; struct lock_class *class; |
fbb9ce953 [PATCH] lockdep: ... |
617 |
|
8e18257d2 lockdep: reduce t... |
618 619 620 621 622 623 624 625 626 |
#ifdef CONFIG_DEBUG_LOCKDEP /* * If the architecture calls into lockdep before initializing * the hashes then we'll warn about it later. (we cannot printk * right now) */ if (unlikely(!lockdep_initialized)) { lockdep_init(); lockdep_init_error = 1; |
c71063c9c lockdep debugging... |
627 |
save_stack_trace(&lockdep_init_trace); |
8e18257d2 lockdep: reduce t... |
628 629 |
} #endif |
fbb9ce953 [PATCH] lockdep: ... |
630 |
|
4ba053c04 lockdep: Check th... |
631 632 633 634 635 636 637 638 639 640 641 |
if (unlikely(subclass >= MAX_LOCKDEP_SUBCLASSES)) { debug_locks_off(); printk(KERN_ERR "BUG: looking up invalid subclass: %u ", subclass); printk(KERN_ERR "turning off the locking correctness validator. "); dump_stack(); return NULL; } |
8e18257d2 lockdep: reduce t... |
642 643 644 645 646 647 |
/* * Static locks do not have their class-keys yet - for them the key * is the lock object itself: */ if (unlikely(!lock->key)) lock->key = (void *)lock; |
fbb9ce953 [PATCH] lockdep: ... |
648 |
|
8e18257d2 lockdep: reduce t... |
649 650 651 652 653 654 |
/* * NOTE: the class-key must be unique. For dynamic locks, a static * lock_class_key variable is passed in through the mutex_init() * (or spin_lock_init()) call - which acts as the key. For static * locks we use the lock object itself as the key. */ |
4b32d0a4e lockdep: various ... |
655 656 |
BUILD_BUG_ON(sizeof(struct lock_class_key) > sizeof(struct lockdep_map)); |
fbb9ce953 [PATCH] lockdep: ... |
657 |
|
8e18257d2 lockdep: reduce t... |
658 |
key = lock->key->subkeys + subclass; |
ca268c691 [PATCH] lockdep: ... |
659 |
|
8e18257d2 lockdep: reduce t... |
660 |
hash_head = classhashentry(key); |
74c383f14 [PATCH] lockdep: ... |
661 |
|
8e18257d2 lockdep: reduce t... |
662 663 664 665 |
/* * We can walk the hash lockfree, because the hash only * grows, and we are careful when adding entries to the end: */ |
4b32d0a4e lockdep: various ... |
666 667 |
list_for_each_entry(class, hash_head, hash_entry) { if (class->key == key) { |
0119fee44 lockdep: Comment ... |
668 669 670 671 |
/* * Huh! same key, different name? Did someone trample * on some memory? We're most confused. */ |
4b32d0a4e lockdep: various ... |
672 |
WARN_ON_ONCE(class->name != lock->name); |
8e18257d2 lockdep: reduce t... |
673 |
return class; |
4b32d0a4e lockdep: various ... |
674 675 |
} } |
fbb9ce953 [PATCH] lockdep: ... |
676 |
|
8e18257d2 lockdep: reduce t... |
677 |
return NULL; |
fbb9ce953 [PATCH] lockdep: ... |
678 679 680 |
} /* |
8e18257d2 lockdep: reduce t... |
681 682 683 |
* Register a lock's class in the hash-table, if the class is not present * yet. Otherwise we look it up. We cache the result in the lock object * itself, so actual lookup of the hash should be once per lock object. |
fbb9ce953 [PATCH] lockdep: ... |
684 |
*/ |
8e18257d2 lockdep: reduce t... |
685 686 |
static inline struct lock_class * register_lock_class(struct lockdep_map *lock, unsigned int subclass, int force) |
fbb9ce953 [PATCH] lockdep: ... |
687 |
{ |
8e18257d2 lockdep: reduce t... |
688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 |
struct lockdep_subclass_key *key; struct list_head *hash_head; struct lock_class *class; unsigned long flags; class = look_up_lock_class(lock, subclass); if (likely(class)) return class; /* * Debug-check: all keys must be persistent! */ if (!static_obj(lock->key)) { debug_locks_off(); printk("INFO: trying to register non-static key. "); printk("the code is fine but needs lockdep annotation. "); printk("turning off the locking correctness validator. "); dump_stack(); return NULL; } key = lock->key->subkeys + subclass; hash_head = classhashentry(key); raw_local_irq_save(flags); if (!graph_lock()) { raw_local_irq_restore(flags); return NULL; } /* * We have to do the hash-walk again, to avoid races * with another CPU: */ list_for_each_entry(class, hash_head, hash_entry) if (class->key == key) goto out_unlock_set; /* * Allocate a new key from the static array, and add it to * the hash: */ if (nr_lock_classes >= MAX_LOCKDEP_KEYS) { if (!debug_locks_off_graph_unlock()) { raw_local_irq_restore(flags); return NULL; } raw_local_irq_restore(flags); printk("BUG: MAX_LOCKDEP_KEYS too low! "); printk("turning off the locking correctness validator. "); |
eedeeabde lockdep: add stac... |
743 |
dump_stack(); |
8e18257d2 lockdep: reduce t... |
744 745 746 |
return NULL; } class = lock_classes + nr_lock_classes++; |
bd6d29c25 lockstat: Make lo... |
747 |
debug_atomic_inc(nr_unused_locks); |
8e18257d2 lockdep: reduce t... |
748 749 750 751 752 753 754 755 756 757 758 759 |
class->key = key; class->name = lock->name; class->subclass = subclass; INIT_LIST_HEAD(&class->lock_entry); INIT_LIST_HEAD(&class->locks_before); INIT_LIST_HEAD(&class->locks_after); class->name_version = count_matching_names(class); /* * We use RCU's safe list-add method to make * parallel walking of the hash-list safe: */ list_add_tail_rcu(&class->hash_entry, hash_head); |
1481197b5 Subject: lockdep:... |
760 761 762 763 |
/* * Add it to the global list of classes: */ list_add_tail_rcu(&class->lock_entry, &all_lock_classes); |
8e18257d2 lockdep: reduce t... |
764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 |
if (verbose(class)) { graph_unlock(); raw_local_irq_restore(flags); printk(" new class %p: %s", class->key, class->name); if (class->name_version > 1) printk("#%d", class->name_version); printk(" "); dump_stack(); raw_local_irq_save(flags); if (!graph_lock()) { raw_local_irq_restore(flags); return NULL; } } out_unlock_set: graph_unlock(); raw_local_irq_restore(flags); if (!subclass || force) |
620162505 lockdep: Add impr... |
788 789 790 |
lock->class_cache[0] = class; else if (subclass < NR_LOCKDEP_CACHING_CLASSES) lock->class_cache[subclass] = class; |
8e18257d2 lockdep: reduce t... |
791 |
|
0119fee44 lockdep: Comment ... |
792 793 794 795 |
/* * Hash collision, did we smoke some? We found a class with a matching * hash but the subclass -- which is hashed in -- didn't match. */ |
8e18257d2 lockdep: reduce t... |
796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 |
if (DEBUG_LOCKS_WARN_ON(class->subclass != subclass)) return NULL; return class; } #ifdef CONFIG_PROVE_LOCKING /* * Allocate a lockdep entry. (assumes the graph_lock held, returns * with NULL on failure) */ static struct lock_list *alloc_list_entry(void) { if (nr_list_entries >= MAX_LOCKDEP_ENTRIES) { if (!debug_locks_off_graph_unlock()) return NULL; printk("BUG: MAX_LOCKDEP_ENTRIES too low! "); printk("turning off the locking correctness validator. "); |
eedeeabde lockdep: add stac... |
817 |
dump_stack(); |
8e18257d2 lockdep: reduce t... |
818 819 820 821 822 823 824 825 826 |
return NULL; } return list_entries + nr_list_entries++; } /* * Add a new dependency to the head of the list: */ static int add_lock_to_list(struct lock_class *class, struct lock_class *this, |
4726f2a61 lockdep: Reduce s... |
827 828 |
struct list_head *head, unsigned long ip, int distance, struct stack_trace *trace) |
8e18257d2 lockdep: reduce t... |
829 830 831 832 833 834 835 836 837 |
{ struct lock_list *entry; /* * Lock not present yet - get a new dependency struct and * add it to the list: */ entry = alloc_list_entry(); if (!entry) return 0; |
748701728 lockdep: fix inva... |
838 839 |
entry->class = this; entry->distance = distance; |
4726f2a61 lockdep: Reduce s... |
840 |
entry->trace = *trace; |
8e18257d2 lockdep: reduce t... |
841 842 843 844 845 846 847 848 849 850 851 |
/* * Since we never remove from the dependency list, the list can * be walked lockless by other CPUs, it's only allocation * that must be protected by the spinlock. But this also means * we must make new entries visible only once writes to the * entry become visible - hence the RCU op: */ list_add_tail_rcu(&entry->entry, head); return 1; } |
98c33edda lockdep: Fix styl... |
852 853 854 |
/* * For good efficiency of modular, we use power of 2 */ |
af0129614 lockdep: BFS cleanup |
855 856 |
#define MAX_CIRCULAR_QUEUE_SIZE 4096UL #define CQ_MASK (MAX_CIRCULAR_QUEUE_SIZE-1) |
98c33edda lockdep: Fix styl... |
857 858 |
/* * The circular_queue and helpers is used to implement the |
af0129614 lockdep: BFS cleanup |
859 860 861 |
* breadth-first search(BFS)algorithem, by which we can build * the shortest path from the next lock to be acquired to the * previous held lock if there is a circular between them. |
98c33edda lockdep: Fix styl... |
862 |
*/ |
af0129614 lockdep: BFS cleanup |
863 864 865 866 867 868 |
struct circular_queue { unsigned long element[MAX_CIRCULAR_QUEUE_SIZE]; unsigned int front, rear; }; static struct circular_queue lock_cq; |
af0129614 lockdep: BFS cleanup |
869 |
|
12f3dfd02 lockdep: Add stat... |
870 |
unsigned int max_bfs_queue_depth; |
af0129614 lockdep: BFS cleanup |
871 |
|
e351b660f lockdep: Reintrod... |
872 |
static unsigned int lockdep_dependency_gen_id; |
af0129614 lockdep: BFS cleanup |
873 874 875 |
static inline void __cq_init(struct circular_queue *cq) { cq->front = cq->rear = 0; |
e351b660f lockdep: Reintrod... |
876 |
lockdep_dependency_gen_id++; |
af0129614 lockdep: BFS cleanup |
877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 |
} static inline int __cq_empty(struct circular_queue *cq) { return (cq->front == cq->rear); } static inline int __cq_full(struct circular_queue *cq) { return ((cq->rear + 1) & CQ_MASK) == cq->front; } static inline int __cq_enqueue(struct circular_queue *cq, unsigned long elem) { if (__cq_full(cq)) return -1; cq->element[cq->rear] = elem; cq->rear = (cq->rear + 1) & CQ_MASK; return 0; } static inline int __cq_dequeue(struct circular_queue *cq, unsigned long *elem) { if (__cq_empty(cq)) return -1; *elem = cq->element[cq->front]; cq->front = (cq->front + 1) & CQ_MASK; return 0; } static inline unsigned int __cq_get_elem_count(struct circular_queue *cq) { return (cq->rear - cq->front) & CQ_MASK; } static inline void mark_lock_accessed(struct lock_list *lock, struct lock_list *parent) { unsigned long nr; |
98c33edda lockdep: Fix styl... |
918 |
|
af0129614 lockdep: BFS cleanup |
919 |
nr = lock - list_entries; |
0119fee44 lockdep: Comment ... |
920 |
WARN_ON(nr >= nr_list_entries); /* Out-of-bounds, input fail */ |
af0129614 lockdep: BFS cleanup |
921 |
lock->parent = parent; |
e351b660f lockdep: Reintrod... |
922 |
lock->class->dep_gen_id = lockdep_dependency_gen_id; |
af0129614 lockdep: BFS cleanup |
923 924 925 926 927 |
} static inline unsigned long lock_accessed(struct lock_list *lock) { unsigned long nr; |
98c33edda lockdep: Fix styl... |
928 |
|
af0129614 lockdep: BFS cleanup |
929 |
nr = lock - list_entries; |
0119fee44 lockdep: Comment ... |
930 |
WARN_ON(nr >= nr_list_entries); /* Out-of-bounds, input fail */ |
e351b660f lockdep: Reintrod... |
931 |
return lock->class->dep_gen_id == lockdep_dependency_gen_id; |
af0129614 lockdep: BFS cleanup |
932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 |
} static inline struct lock_list *get_lock_parent(struct lock_list *child) { return child->parent; } static inline int get_lock_depth(struct lock_list *child) { int depth = 0; struct lock_list *parent; while ((parent = get_lock_parent(child))) { child = parent; depth++; } return depth; } |
9e2d551ea lockdep: Introduc... |
950 |
static int __bfs(struct lock_list *source_entry, |
af0129614 lockdep: BFS cleanup |
951 952 953 954 |
void *data, int (*match)(struct lock_list *entry, void *data), struct lock_list **target_entry, int forward) |
c94aa5ca3 lockdep: Print th... |
955 956 |
{ struct lock_list *entry; |
d588e4615 lockdep: Improve ... |
957 |
struct list_head *head; |
c94aa5ca3 lockdep: Print th... |
958 959 |
struct circular_queue *cq = &lock_cq; int ret = 1; |
9e2d551ea lockdep: Introduc... |
960 |
if (match(source_entry, data)) { |
c94aa5ca3 lockdep: Print th... |
961 962 963 964 |
*target_entry = source_entry; ret = 0; goto exit; } |
d588e4615 lockdep: Improve ... |
965 966 967 968 969 970 971 972 973 |
if (forward) head = &source_entry->class->locks_after; else head = &source_entry->class->locks_before; if (list_empty(head)) goto exit; __cq_init(cq); |
c94aa5ca3 lockdep: Print th... |
974 975 976 977 |
__cq_enqueue(cq, (unsigned long)source_entry); while (!__cq_empty(cq)) { struct lock_list *lock; |
c94aa5ca3 lockdep: Print th... |
978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 |
__cq_dequeue(cq, (unsigned long *)&lock); if (!lock->class) { ret = -2; goto exit; } if (forward) head = &lock->class->locks_after; else head = &lock->class->locks_before; list_for_each_entry(entry, head, entry) { if (!lock_accessed(entry)) { |
12f3dfd02 lockdep: Add stat... |
993 |
unsigned int cq_depth; |
c94aa5ca3 lockdep: Print th... |
994 |
mark_lock_accessed(entry, lock); |
9e2d551ea lockdep: Introduc... |
995 |
if (match(entry, data)) { |
c94aa5ca3 lockdep: Print th... |
996 997 998 999 1000 1001 1002 1003 1004 |
*target_entry = entry; ret = 0; goto exit; } if (__cq_enqueue(cq, (unsigned long)entry)) { ret = -1; goto exit; } |
12f3dfd02 lockdep: Add stat... |
1005 1006 1007 |
cq_depth = __cq_get_elem_count(cq); if (max_bfs_queue_depth < cq_depth) max_bfs_queue_depth = cq_depth; |
c94aa5ca3 lockdep: Print th... |
1008 1009 1010 1011 1012 1013 |
} } } exit: return ret; } |
d7aaba140 lockdep: Implemen... |
1014 |
static inline int __bfs_forwards(struct lock_list *src_entry, |
9e2d551ea lockdep: Introduc... |
1015 1016 1017 |
void *data, int (*match)(struct lock_list *entry, void *data), struct lock_list **target_entry) |
c94aa5ca3 lockdep: Print th... |
1018 |
{ |
9e2d551ea lockdep: Introduc... |
1019 |
return __bfs(src_entry, data, match, target_entry, 1); |
c94aa5ca3 lockdep: Print th... |
1020 1021 |
} |
d7aaba140 lockdep: Implemen... |
1022 |
static inline int __bfs_backwards(struct lock_list *src_entry, |
9e2d551ea lockdep: Introduc... |
1023 1024 1025 |
void *data, int (*match)(struct lock_list *entry, void *data), struct lock_list **target_entry) |
c94aa5ca3 lockdep: Print th... |
1026 |
{ |
9e2d551ea lockdep: Introduc... |
1027 |
return __bfs(src_entry, data, match, target_entry, 0); |
c94aa5ca3 lockdep: Print th... |
1028 1029 |
} |
8e18257d2 lockdep: reduce t... |
1030 1031 1032 1033 |
/* * Recursive, forwards-direction lock-dependency checking, used for * both noncyclic checking and for hardirq-unsafe/softirq-unsafe * checking. |
8e18257d2 lockdep: reduce t... |
1034 |
*/ |
8e18257d2 lockdep: reduce t... |
1035 1036 1037 1038 1039 1040 |
/* * Print a dependency chain entry (this is only done when a deadlock * has been detected): */ static noinline int |
24208ca76 lockdep: Introduc... |
1041 |
print_circular_bug_entry(struct lock_list *target, int depth) |
8e18257d2 lockdep: reduce t... |
1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 |
{ if (debug_locks_silent) return 0; printk(" -> #%u", depth); print_lock_name(target->class); printk(": "); print_stack_trace(&target->trace, 6); return 0; } |
f4185812a lockdep: Print a ... |
1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 |
static void print_circular_lock_scenario(struct held_lock *src, struct held_lock *tgt, struct lock_list *prt) { struct lock_class *source = hlock_class(src); struct lock_class *target = hlock_class(tgt); struct lock_class *parent = prt->class; /* * A direct locking problem where unsafe_class lock is taken * directly by safe_class lock, then all we need to show * is the deadlock scenario, as it is obvious that the * unsafe lock is taken under the safe lock. * * But if there is a chain instead, where the safe lock takes * an intermediate lock (middle_class) where this lock is * not the same as the safe lock, then the lock chain is * used to describe the problem. Otherwise we would need * to show a different CPU case for each link in the chain * from the safe_class lock to the unsafe_class lock. */ if (parent != source) { printk("Chain exists of: "); __print_lock_name(source); printk(" --> "); __print_lock_name(parent); printk(" --> "); __print_lock_name(target); printk(" "); } printk(" Possible unsafe locking scenario: "); printk(" CPU0 CPU1 "); printk(" ---- ---- "); printk(" lock("); __print_lock_name(target); printk("); "); printk(" lock("); __print_lock_name(parent); printk("); "); printk(" lock("); __print_lock_name(target); printk("); "); printk(" lock("); __print_lock_name(source); printk("); "); printk(" *** DEADLOCK *** "); } |
8e18257d2 lockdep: reduce t... |
1117 1118 1119 1120 1121 |
/* * When a circular dependency is detected, print the * header first: */ static noinline int |
db0002a32 lockdep: Implemen... |
1122 1123 1124 |
print_circular_bug_header(struct lock_list *entry, unsigned int depth, struct held_lock *check_src, struct held_lock *check_tgt) |
8e18257d2 lockdep: reduce t... |
1125 1126 |
{ struct task_struct *curr = current; |
c94aa5ca3 lockdep: Print th... |
1127 |
if (debug_locks_silent) |
8e18257d2 lockdep: reduce t... |
1128 |
return 0; |
b3fbab057 rcu: Restore chec... |
1129 1130 1131 1132 1133 1134 |
printk(" "); printk("====================================================== "); printk("[ INFO: possible circular locking dependency detected ] "); |
8e18257d2 lockdep: reduce t... |
1135 |
print_kernel_version(); |
b3fbab057 rcu: Restore chec... |
1136 1137 |
printk("------------------------------------------------------- "); |
8e18257d2 lockdep: reduce t... |
1138 1139 |
printk("%s/%d is trying to acquire lock: ", |
ba25f9dcc Use helpers to ob... |
1140 |
curr->comm, task_pid_nr(curr)); |
db0002a32 lockdep: Implemen... |
1141 |
print_lock(check_src); |
8e18257d2 lockdep: reduce t... |
1142 1143 1144 |
printk(" but task is already holding lock: "); |
db0002a32 lockdep: Implemen... |
1145 |
print_lock(check_tgt); |
8e18257d2 lockdep: reduce t... |
1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 |
printk(" which lock already depends on the new lock. "); printk(" the existing dependency chain (in reverse order) is: "); print_circular_bug_entry(entry, depth); return 0; } |
9e2d551ea lockdep: Introduc... |
1158 1159 1160 1161 |
static inline int class_equal(struct lock_list *entry, void *data) { return entry->class == data; } |
db0002a32 lockdep: Implemen... |
1162 1163 1164 1165 |
static noinline int print_circular_bug(struct lock_list *this, struct lock_list *target, struct held_lock *check_src, struct held_lock *check_tgt) |
8e18257d2 lockdep: reduce t... |
1166 1167 |
{ struct task_struct *curr = current; |
c94aa5ca3 lockdep: Print th... |
1168 |
struct lock_list *parent; |
f4185812a lockdep: Print a ... |
1169 |
struct lock_list *first_parent; |
24208ca76 lockdep: Introduc... |
1170 |
int depth; |
8e18257d2 lockdep: reduce t... |
1171 |
|
c94aa5ca3 lockdep: Print th... |
1172 |
if (!debug_locks_off_graph_unlock() || debug_locks_silent) |
8e18257d2 lockdep: reduce t... |
1173 |
return 0; |
db0002a32 lockdep: Implemen... |
1174 |
if (!save_trace(&this->trace)) |
8e18257d2 lockdep: reduce t... |
1175 |
return 0; |
c94aa5ca3 lockdep: Print th... |
1176 |
depth = get_lock_depth(target); |
db0002a32 lockdep: Implemen... |
1177 |
print_circular_bug_header(target, depth, check_src, check_tgt); |
c94aa5ca3 lockdep: Print th... |
1178 1179 |
parent = get_lock_parent(target); |
f4185812a lockdep: Print a ... |
1180 |
first_parent = parent; |
c94aa5ca3 lockdep: Print th... |
1181 1182 1183 1184 1185 |
while (parent) { print_circular_bug_entry(parent, --depth); parent = get_lock_parent(parent); } |
8e18257d2 lockdep: reduce t... |
1186 1187 1188 1189 1190 |
printk(" other info that might help us debug this: "); |
f4185812a lockdep: Print a ... |
1191 1192 |
print_circular_lock_scenario(check_src, check_tgt, first_parent); |
8e18257d2 lockdep: reduce t... |
1193 1194 1195 1196 1197 1198 1199 1200 1201 |
lockdep_print_held_locks(curr); printk(" stack backtrace: "); dump_stack(); return 0; } |
db0002a32 lockdep: Implemen... |
1202 1203 1204 1205 |
static noinline int print_bfs_bug(int ret) { if (!debug_locks_off_graph_unlock()) return 0; |
0119fee44 lockdep: Comment ... |
1206 1207 1208 |
/* * Breadth-first-search failed, graph got corrupted? */ |
db0002a32 lockdep: Implemen... |
1209 1210 1211 1212 1213 |
WARN(1, "lockdep bfs error:%d ", ret); return 0; } |
ef681026f lockdep: Implemen... |
1214 |
static int noop_count(struct lock_list *entry, void *data) |
419ca3f13 lockdep: fix comb... |
1215 |
{ |
ef681026f lockdep: Implemen... |
1216 1217 1218 |
(*(unsigned long *)data)++; return 0; } |
419ca3f13 lockdep: fix comb... |
1219 |
|
ef681026f lockdep: Implemen... |
1220 1221 1222 1223 |
unsigned long __lockdep_count_forward_deps(struct lock_list *this) { unsigned long count = 0; struct lock_list *uninitialized_var(target_entry); |
419ca3f13 lockdep: fix comb... |
1224 |
|
ef681026f lockdep: Implemen... |
1225 |
__bfs_forwards(this, (void *)&count, noop_count, &target_entry); |
419ca3f13 lockdep: fix comb... |
1226 |
|
ef681026f lockdep: Implemen... |
1227 |
return count; |
419ca3f13 lockdep: fix comb... |
1228 |
} |
419ca3f13 lockdep: fix comb... |
1229 1230 1231 |
unsigned long lockdep_count_forward_deps(struct lock_class *class) { unsigned long ret, flags; |
ef681026f lockdep: Implemen... |
1232 1233 1234 1235 |
struct lock_list this; this.parent = NULL; this.class = class; |
419ca3f13 lockdep: fix comb... |
1236 1237 |
local_irq_save(flags); |
0199c4e68 locking: Convert ... |
1238 |
arch_spin_lock(&lockdep_lock); |
ef681026f lockdep: Implemen... |
1239 |
ret = __lockdep_count_forward_deps(&this); |
0199c4e68 locking: Convert ... |
1240 |
arch_spin_unlock(&lockdep_lock); |
419ca3f13 lockdep: fix comb... |
1241 1242 1243 1244 |
local_irq_restore(flags); return ret; } |
ef681026f lockdep: Implemen... |
1245 |
unsigned long __lockdep_count_backward_deps(struct lock_list *this) |
419ca3f13 lockdep: fix comb... |
1246 |
{ |
ef681026f lockdep: Implemen... |
1247 1248 |
unsigned long count = 0; struct lock_list *uninitialized_var(target_entry); |
419ca3f13 lockdep: fix comb... |
1249 |
|
ef681026f lockdep: Implemen... |
1250 |
__bfs_backwards(this, (void *)&count, noop_count, &target_entry); |
419ca3f13 lockdep: fix comb... |
1251 |
|
ef681026f lockdep: Implemen... |
1252 |
return count; |
419ca3f13 lockdep: fix comb... |
1253 1254 1255 1256 1257 |
} unsigned long lockdep_count_backward_deps(struct lock_class *class) { unsigned long ret, flags; |
ef681026f lockdep: Implemen... |
1258 1259 1260 1261 |
struct lock_list this; this.parent = NULL; this.class = class; |
419ca3f13 lockdep: fix comb... |
1262 1263 |
local_irq_save(flags); |
0199c4e68 locking: Convert ... |
1264 |
arch_spin_lock(&lockdep_lock); |
ef681026f lockdep: Implemen... |
1265 |
ret = __lockdep_count_backward_deps(&this); |
0199c4e68 locking: Convert ... |
1266 |
arch_spin_unlock(&lockdep_lock); |
419ca3f13 lockdep: fix comb... |
1267 1268 1269 1270 |
local_irq_restore(flags); return ret; } |
8e18257d2 lockdep: reduce t... |
1271 1272 1273 1274 1275 |
/* * Prove that the dependency graph starting at <entry> can not * lead to <target>. Print an error and return 0 if it does. */ static noinline int |
db0002a32 lockdep: Implemen... |
1276 1277 |
check_noncircular(struct lock_list *root, struct lock_class *target, struct lock_list **target_entry) |
8e18257d2 lockdep: reduce t... |
1278 |
{ |
db0002a32 lockdep: Implemen... |
1279 |
int result; |
8e18257d2 lockdep: reduce t... |
1280 |
|
bd6d29c25 lockstat: Make lo... |
1281 |
debug_atomic_inc(nr_cyclic_checks); |
419ca3f13 lockdep: fix comb... |
1282 |
|
d7aaba140 lockdep: Implemen... |
1283 |
result = __bfs_forwards(root, target, class_equal, target_entry); |
fbb9ce953 [PATCH] lockdep: ... |
1284 |
|
db0002a32 lockdep: Implemen... |
1285 1286 |
return result; } |
c94aa5ca3 lockdep: Print th... |
1287 |
|
81d68a96a ftrace: trace irq... |
1288 |
#if defined(CONFIG_TRACE_IRQFLAGS) && defined(CONFIG_PROVE_LOCKING) |
fbb9ce953 [PATCH] lockdep: ... |
1289 1290 1291 1292 1293 |
/* * Forwards and backwards subgraph searching, for the purposes of * proving that two subgraphs can be connected by a new dependency * without creating any illegal irq-safe -> irq-unsafe lock dependency. */ |
fbb9ce953 [PATCH] lockdep: ... |
1294 |
|
d7aaba140 lockdep: Implemen... |
1295 1296 1297 1298 |
static inline int usage_match(struct lock_list *entry, void *bit) { return entry->class->usage_mask & (1 << (enum lock_usage_bit)bit); } |
fbb9ce953 [PATCH] lockdep: ... |
1299 1300 |
/* * Find a node in the forwards-direction dependency sub-graph starting |
d7aaba140 lockdep: Implemen... |
1301 |
* at @root->class that matches @bit. |
fbb9ce953 [PATCH] lockdep: ... |
1302 |
* |
d7aaba140 lockdep: Implemen... |
1303 1304 |
* Return 0 if such a node exists in the subgraph, and put that node * into *@target_entry. |
fbb9ce953 [PATCH] lockdep: ... |
1305 |
* |
d7aaba140 lockdep: Implemen... |
1306 1307 |
* Return 1 otherwise and keep *@target_entry unchanged. * Return <0 on error. |
fbb9ce953 [PATCH] lockdep: ... |
1308 |
*/ |
d7aaba140 lockdep: Implemen... |
1309 1310 1311 |
static int find_usage_forwards(struct lock_list *root, enum lock_usage_bit bit, struct lock_list **target_entry) |
fbb9ce953 [PATCH] lockdep: ... |
1312 |
{ |
d7aaba140 lockdep: Implemen... |
1313 |
int result; |
fbb9ce953 [PATCH] lockdep: ... |
1314 |
|
bd6d29c25 lockstat: Make lo... |
1315 |
debug_atomic_inc(nr_find_usage_forwards_checks); |
fbb9ce953 [PATCH] lockdep: ... |
1316 |
|
d7aaba140 lockdep: Implemen... |
1317 1318 1319 |
result = __bfs_forwards(root, (void *)bit, usage_match, target_entry); return result; |
fbb9ce953 [PATCH] lockdep: ... |
1320 1321 1322 1323 |
} /* * Find a node in the backwards-direction dependency sub-graph starting |
d7aaba140 lockdep: Implemen... |
1324 |
* at @root->class that matches @bit. |
fbb9ce953 [PATCH] lockdep: ... |
1325 |
* |
d7aaba140 lockdep: Implemen... |
1326 1327 |
* Return 0 if such a node exists in the subgraph, and put that node * into *@target_entry. |
fbb9ce953 [PATCH] lockdep: ... |
1328 |
* |
d7aaba140 lockdep: Implemen... |
1329 1330 |
* Return 1 otherwise and keep *@target_entry unchanged. * Return <0 on error. |
fbb9ce953 [PATCH] lockdep: ... |
1331 |
*/ |
d7aaba140 lockdep: Implemen... |
1332 1333 1334 |
static int find_usage_backwards(struct lock_list *root, enum lock_usage_bit bit, struct lock_list **target_entry) |
fbb9ce953 [PATCH] lockdep: ... |
1335 |
{ |
d7aaba140 lockdep: Implemen... |
1336 |
int result; |
fbb9ce953 [PATCH] lockdep: ... |
1337 |
|
bd6d29c25 lockstat: Make lo... |
1338 |
debug_atomic_inc(nr_find_usage_backwards_checks); |
fbb9ce953 [PATCH] lockdep: ... |
1339 |
|
d7aaba140 lockdep: Implemen... |
1340 |
result = __bfs_backwards(root, (void *)bit, usage_match, target_entry); |
f82b217e3 lockdep: shrink h... |
1341 |
|
d7aaba140 lockdep: Implemen... |
1342 |
return result; |
fbb9ce953 [PATCH] lockdep: ... |
1343 |
} |
af0129614 lockdep: BFS cleanup |
1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 |
static void print_lock_class_header(struct lock_class *class, int depth) { int bit; printk("%*s->", depth, ""); print_lock_name(class); printk(" ops: %lu", class->ops); printk(" { "); for (bit = 0; bit < LOCK_USAGE_STATES; bit++) { if (class->usage_mask & (1 << bit)) { int len = depth; len += printk("%*s %s", depth, "", usage_str[bit]); len += printk(" at: "); print_stack_trace(class->usage_traces + bit, len); } } printk("%*s } ", depth, ""); printk("%*s ... key at: ",depth,""); print_ip_sym((unsigned long)class->key); } /* * printk the shortest lock dependencies from @start to @end in reverse order: */ static void __used print_shortest_lock_dependencies(struct lock_list *leaf, struct lock_list *root) { struct lock_list *entry = leaf; int depth; /*compute depth from generated tree by BFS*/ depth = get_lock_depth(leaf); do { print_lock_class_header(entry->class, depth); printk("%*s ... acquired at: ", depth, ""); print_stack_trace(&entry->trace, 2); printk(" "); if (depth == 0 && (entry != root)) { |
6be8c3935 lockdep: Replace ... |
1393 1394 |
printk("lockdep:%s bad path found in chain graph ", __func__); |
af0129614 lockdep: BFS cleanup |
1395 1396 1397 1398 1399 1400 1401 1402 1403 |
break; } entry = get_lock_parent(entry); depth--; } while (entry && (depth >= 0)); return; } |
d7aaba140 lockdep: Implemen... |
1404 |
|
3003eba31 lockdep: Print a ... |
1405 1406 1407 |
static void print_irq_lock_scenario(struct lock_list *safe_entry, struct lock_list *unsafe_entry, |
dad3d7435 lockdep: Print a ... |
1408 1409 |
struct lock_class *prev_class, struct lock_class *next_class) |
3003eba31 lockdep: Print a ... |
1410 1411 1412 |
{ struct lock_class *safe_class = safe_entry->class; struct lock_class *unsafe_class = unsafe_entry->class; |
dad3d7435 lockdep: Print a ... |
1413 |
struct lock_class *middle_class = prev_class; |
3003eba31 lockdep: Print a ... |
1414 1415 |
if (middle_class == safe_class) |
dad3d7435 lockdep: Print a ... |
1416 |
middle_class = next_class; |
3003eba31 lockdep: Print a ... |
1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 |
/* * A direct locking problem where unsafe_class lock is taken * directly by safe_class lock, then all we need to show * is the deadlock scenario, as it is obvious that the * unsafe lock is taken under the safe lock. * * But if there is a chain instead, where the safe lock takes * an intermediate lock (middle_class) where this lock is * not the same as the safe lock, then the lock chain is * used to describe the problem. Otherwise we would need * to show a different CPU case for each link in the chain * from the safe_class lock to the unsafe_class lock. */ if (middle_class != unsafe_class) { printk("Chain exists of: "); __print_lock_name(safe_class); printk(" --> "); __print_lock_name(middle_class); printk(" --> "); __print_lock_name(unsafe_class); printk(" "); } printk(" Possible interrupt unsafe locking scenario: "); printk(" CPU0 CPU1 "); printk(" ---- ---- "); printk(" lock("); __print_lock_name(unsafe_class); printk("); "); printk(" local_irq_disable(); "); printk(" lock("); __print_lock_name(safe_class); printk("); "); printk(" lock("); __print_lock_name(middle_class); printk("); "); printk(" <Interrupt> "); printk(" lock("); __print_lock_name(safe_class); printk("); "); printk(" *** DEADLOCK *** "); } |
fbb9ce953 [PATCH] lockdep: ... |
1476 1477 |
static int print_bad_irq_dependency(struct task_struct *curr, |
24208ca76 lockdep: Introduc... |
1478 1479 1480 1481 |
struct lock_list *prev_root, struct lock_list *next_root, struct lock_list *backwards_entry, struct lock_list *forwards_entry, |
fbb9ce953 [PATCH] lockdep: ... |
1482 1483 1484 1485 1486 1487 |
struct held_lock *prev, struct held_lock *next, enum lock_usage_bit bit1, enum lock_usage_bit bit2, const char *irqclass) { |
74c383f14 [PATCH] lockdep: ... |
1488 |
if (!debug_locks_off_graph_unlock() || debug_locks_silent) |
fbb9ce953 [PATCH] lockdep: ... |
1489 |
return 0; |
b3fbab057 rcu: Restore chec... |
1490 1491 1492 1493 1494 1495 |
printk(" "); printk("====================================================== "); printk("[ INFO: %s-safe -> %s-unsafe lock order detected ] ", |
fbb9ce953 [PATCH] lockdep: ... |
1496 |
irqclass, irqclass); |
99de055ac [PATCH] lockdep: ... |
1497 |
print_kernel_version(); |
b3fbab057 rcu: Restore chec... |
1498 1499 |
printk("------------------------------------------------------ "); |
fbb9ce953 [PATCH] lockdep: ... |
1500 1501 |
printk("%s/%d [HC%u[%lu]:SC%u[%lu]:HE%u:SE%u] is trying to acquire: ", |
ba25f9dcc Use helpers to ob... |
1502 |
curr->comm, task_pid_nr(curr), |
fbb9ce953 [PATCH] lockdep: ... |
1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 |
curr->hardirq_context, hardirq_count() >> HARDIRQ_SHIFT, curr->softirq_context, softirq_count() >> SOFTIRQ_SHIFT, curr->hardirqs_enabled, curr->softirqs_enabled); print_lock(next); printk(" and this task is already holding: "); print_lock(prev); printk("which would create a new lock dependency: "); |
f82b217e3 lockdep: shrink h... |
1515 |
print_lock_name(hlock_class(prev)); |
fbb9ce953 [PATCH] lockdep: ... |
1516 |
printk(" ->"); |
f82b217e3 lockdep: shrink h... |
1517 |
print_lock_name(hlock_class(next)); |
fbb9ce953 [PATCH] lockdep: ... |
1518 1519 1520 1521 1522 1523 1524 |
printk(" "); printk(" but this new dependency connects a %s-irq-safe lock: ", irqclass); |
24208ca76 lockdep: Introduc... |
1525 |
print_lock_name(backwards_entry->class); |
fbb9ce953 [PATCH] lockdep: ... |
1526 1527 1528 |
printk(" ... which became %s-irq-safe at: ", irqclass); |
24208ca76 lockdep: Introduc... |
1529 |
print_stack_trace(backwards_entry->class->usage_traces + bit1, 1); |
fbb9ce953 [PATCH] lockdep: ... |
1530 1531 1532 1533 |
printk(" to a %s-irq-unsafe lock: ", irqclass); |
24208ca76 lockdep: Introduc... |
1534 |
print_lock_name(forwards_entry->class); |
fbb9ce953 [PATCH] lockdep: ... |
1535 1536 1537 1538 |
printk(" ... which became %s-irq-unsafe at: ", irqclass); printk("..."); |
24208ca76 lockdep: Introduc... |
1539 |
print_stack_trace(forwards_entry->class->usage_traces + bit2, 1); |
fbb9ce953 [PATCH] lockdep: ... |
1540 1541 1542 1543 1544 |
printk(" other info that might help us debug this: "); |
dad3d7435 lockdep: Print a ... |
1545 1546 |
print_irq_lock_scenario(backwards_entry, forwards_entry, hlock_class(prev), hlock_class(next)); |
3003eba31 lockdep: Print a ... |
1547 |
|
fbb9ce953 [PATCH] lockdep: ... |
1548 |
lockdep_print_held_locks(curr); |
24208ca76 lockdep: Introduc... |
1549 1550 1551 1552 1553 1554 1555 |
printk(" the dependencies between %s-irq-safe lock", irqclass); printk(" and the holding lock: "); if (!save_trace(&prev_root->trace)) return 0; print_shortest_lock_dependencies(backwards_entry, prev_root); |
fbb9ce953 [PATCH] lockdep: ... |
1556 |
|
24208ca76 lockdep: Introduc... |
1557 1558 1559 1560 1561 1562 1563 |
printk(" the dependencies between the lock to be acquired"); printk(" and %s-irq-unsafe lock: ", irqclass); if (!save_trace(&next_root->trace)) return 0; print_shortest_lock_dependencies(forwards_entry, next_root); |
fbb9ce953 [PATCH] lockdep: ... |
1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 |
printk(" stack backtrace: "); dump_stack(); return 0; } static int check_usage(struct task_struct *curr, struct held_lock *prev, struct held_lock *next, enum lock_usage_bit bit_backwards, enum lock_usage_bit bit_forwards, const char *irqclass) { int ret; |
24208ca76 lockdep: Introduc... |
1579 |
struct lock_list this, that; |
d7aaba140 lockdep: Implemen... |
1580 |
struct lock_list *uninitialized_var(target_entry); |
24208ca76 lockdep: Introduc... |
1581 |
struct lock_list *uninitialized_var(target_entry1); |
d7aaba140 lockdep: Implemen... |
1582 1583 1584 1585 1586 |
this.parent = NULL; this.class = hlock_class(prev); ret = find_usage_backwards(&this, bit_backwards, &target_entry); |
af0129614 lockdep: BFS cleanup |
1587 1588 1589 1590 |
if (ret < 0) return print_bfs_bug(ret); if (ret == 1) return ret; |
d7aaba140 lockdep: Implemen... |
1591 |
|
24208ca76 lockdep: Introduc... |
1592 1593 1594 |
that.parent = NULL; that.class = hlock_class(next); ret = find_usage_forwards(&that, bit_forwards, &target_entry1); |
af0129614 lockdep: BFS cleanup |
1595 1596 1597 1598 |
if (ret < 0) return print_bfs_bug(ret); if (ret == 1) return ret; |
fbb9ce953 [PATCH] lockdep: ... |
1599 |
|
24208ca76 lockdep: Introduc... |
1600 1601 1602 |
return print_bad_irq_dependency(curr, &this, &that, target_entry, target_entry1, prev, next, |
fbb9ce953 [PATCH] lockdep: ... |
1603 1604 |
bit_backwards, bit_forwards, irqclass); } |
4f367d8ad lockdep: simplify... |
1605 1606 |
static const char *state_names[] = { #define LOCKDEP_STATE(__STATE) \ |
b4b136f44 lockdep: use stri... |
1607 |
__stringify(__STATE), |
4f367d8ad lockdep: simplify... |
1608 1609 1610 1611 1612 1613 |
#include "lockdep_states.h" #undef LOCKDEP_STATE }; static const char *state_rnames[] = { #define LOCKDEP_STATE(__STATE) \ |
b4b136f44 lockdep: use stri... |
1614 |
__stringify(__STATE)"-READ", |
4f367d8ad lockdep: simplify... |
1615 1616 1617 1618 1619 |
#include "lockdep_states.h" #undef LOCKDEP_STATE }; static inline const char *state_name(enum lock_usage_bit bit) |
8e18257d2 lockdep: reduce t... |
1620 |
{ |
4f367d8ad lockdep: simplify... |
1621 1622 |
return (bit & 1) ? state_rnames[bit >> 2] : state_names[bit >> 2]; } |
8e18257d2 lockdep: reduce t... |
1623 |
|
4f367d8ad lockdep: simplify... |
1624 1625 |
static int exclusive_bit(int new_bit) { |
8e18257d2 lockdep: reduce t... |
1626 |
/* |
4f367d8ad lockdep: simplify... |
1627 1628 1629 1630 1631 1632 1633 1634 |
* USED_IN * USED_IN_READ * ENABLED * ENABLED_READ * * bit 0 - write/read * bit 1 - used_in/enabled * bit 2+ state |
8e18257d2 lockdep: reduce t... |
1635 |
*/ |
4f367d8ad lockdep: simplify... |
1636 1637 1638 |
int state = new_bit & ~3; int dir = new_bit & 2; |
8e18257d2 lockdep: reduce t... |
1639 1640 |
/* |
4f367d8ad lockdep: simplify... |
1641 |
* keep state, bit flip the direction and strip read. |
8e18257d2 lockdep: reduce t... |
1642 |
*/ |
4f367d8ad lockdep: simplify... |
1643 1644 1645 1646 1647 1648 |
return state | (dir ^ 2); } static int check_irq_usage(struct task_struct *curr, struct held_lock *prev, struct held_lock *next, enum lock_usage_bit bit) { |
8e18257d2 lockdep: reduce t... |
1649 |
/* |
4f367d8ad lockdep: simplify... |
1650 1651 |
* Prove that the new dependency does not connect a hardirq-safe * lock with a hardirq-unsafe lock - to achieve this we search |
8e18257d2 lockdep: reduce t... |
1652 1653 1654 |
* the backwards-subgraph starting at <prev>, and the * forwards-subgraph starting at <next>: */ |
4f367d8ad lockdep: simplify... |
1655 1656 |
if (!check_usage(curr, prev, next, bit, exclusive_bit(bit), state_name(bit))) |
8e18257d2 lockdep: reduce t... |
1657 |
return 0; |
4f367d8ad lockdep: simplify... |
1658 |
bit++; /* _READ */ |
cf40bd16f lockdep: annotate... |
1659 |
/* |
4f367d8ad lockdep: simplify... |
1660 1661 |
* Prove that the new dependency does not connect a hardirq-safe-read * lock with a hardirq-unsafe lock - to achieve this we search |
cf40bd16f lockdep: annotate... |
1662 1663 1664 |
* the backwards-subgraph starting at <prev>, and the * forwards-subgraph starting at <next>: */ |
4f367d8ad lockdep: simplify... |
1665 1666 |
if (!check_usage(curr, prev, next, bit, exclusive_bit(bit), state_name(bit))) |
cf40bd16f lockdep: annotate... |
1667 |
return 0; |
4f367d8ad lockdep: simplify... |
1668 1669 1670 1671 1672 1673 1674 1675 1676 |
return 1; } static int check_prev_add_irq(struct task_struct *curr, struct held_lock *prev, struct held_lock *next) { #define LOCKDEP_STATE(__STATE) \ if (!check_irq_usage(curr, prev, next, LOCK_USED_IN_##__STATE)) \ |
cf40bd16f lockdep: annotate... |
1677 |
return 0; |
4f367d8ad lockdep: simplify... |
1678 1679 |
#include "lockdep_states.h" #undef LOCKDEP_STATE |
cf40bd16f lockdep: annotate... |
1680 |
|
8e18257d2 lockdep: reduce t... |
1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 |
return 1; } static void inc_chains(void) { if (current->hardirq_context) nr_hardirq_chains++; else { if (current->softirq_context) nr_softirq_chains++; else nr_process_chains++; } } #else static inline int check_prev_add_irq(struct task_struct *curr, struct held_lock *prev, struct held_lock *next) { return 1; } static inline void inc_chains(void) { nr_process_chains++; } |
fbb9ce953 [PATCH] lockdep: ... |
1709 |
#endif |
48702ecf3 lockdep: Print a ... |
1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 |
static void print_deadlock_scenario(struct held_lock *nxt, struct held_lock *prv) { struct lock_class *next = hlock_class(nxt); struct lock_class *prev = hlock_class(prv); printk(" Possible unsafe locking scenario: "); printk(" CPU0 "); printk(" ---- "); printk(" lock("); __print_lock_name(prev); printk("); "); printk(" lock("); __print_lock_name(next); printk("); "); printk(" *** DEADLOCK *** "); printk(" May be due to missing lock nesting notation "); } |
fbb9ce953 [PATCH] lockdep: ... |
1740 1741 1742 1743 |
static int print_deadlock_bug(struct task_struct *curr, struct held_lock *prev, struct held_lock *next) { |
74c383f14 [PATCH] lockdep: ... |
1744 |
if (!debug_locks_off_graph_unlock() || debug_locks_silent) |
fbb9ce953 [PATCH] lockdep: ... |
1745 |
return 0; |
b3fbab057 rcu: Restore chec... |
1746 1747 1748 1749 1750 1751 |
printk(" "); printk("============================================= "); printk("[ INFO: possible recursive locking detected ] "); |
99de055ac [PATCH] lockdep: ... |
1752 |
print_kernel_version(); |
b3fbab057 rcu: Restore chec... |
1753 1754 |
printk("--------------------------------------------- "); |
fbb9ce953 [PATCH] lockdep: ... |
1755 1756 |
printk("%s/%d is trying to acquire lock: ", |
ba25f9dcc Use helpers to ob... |
1757 |
curr->comm, task_pid_nr(curr)); |
fbb9ce953 [PATCH] lockdep: ... |
1758 1759 1760 1761 1762 1763 1764 1765 1766 |
print_lock(next); printk(" but task is already holding lock: "); print_lock(prev); printk(" other info that might help us debug this: "); |
48702ecf3 lockdep: Print a ... |
1767 |
print_deadlock_scenario(next, prev); |
fbb9ce953 [PATCH] lockdep: ... |
1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 |
lockdep_print_held_locks(curr); printk(" stack backtrace: "); dump_stack(); return 0; } /* * Check whether we are holding such a class already. * * (Note that this has to be done separately, because the graph cannot * detect such classes of deadlocks.) * * Returns: 0 on deadlock detected, 1 on OK, 2 on recursive read */ static int check_deadlock(struct task_struct *curr, struct held_lock *next, struct lockdep_map *next_instance, int read) { struct held_lock *prev; |
7531e2f34 lockdep: lock pro... |
1791 |
struct held_lock *nest = NULL; |
fbb9ce953 [PATCH] lockdep: ... |
1792 1793 1794 1795 |
int i; for (i = 0; i < curr->lockdep_depth; i++) { prev = curr->held_locks + i; |
7531e2f34 lockdep: lock pro... |
1796 1797 1798 |
if (prev->instance == next->nest_lock) nest = prev; |
f82b217e3 lockdep: shrink h... |
1799 |
if (hlock_class(prev) != hlock_class(next)) |
fbb9ce953 [PATCH] lockdep: ... |
1800 |
continue; |
7531e2f34 lockdep: lock pro... |
1801 |
|
fbb9ce953 [PATCH] lockdep: ... |
1802 1803 |
/* * Allow read-after-read recursion of the same |
6c9076ec9 [PATCH] lockdep: ... |
1804 |
* lock class (i.e. read_lock(lock)+read_lock(lock)): |
fbb9ce953 [PATCH] lockdep: ... |
1805 |
*/ |
6c9076ec9 [PATCH] lockdep: ... |
1806 |
if ((read == 2) && prev->read) |
fbb9ce953 [PATCH] lockdep: ... |
1807 |
return 2; |
7531e2f34 lockdep: lock pro... |
1808 1809 1810 1811 1812 1813 1814 |
/* * We're holding the nest_lock, which serializes this lock's * nesting behaviour. */ if (nest) return 2; |
fbb9ce953 [PATCH] lockdep: ... |
1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 |
return print_deadlock_bug(curr, prev, next); } return 1; } /* * There was a chain-cache miss, and we are about to add a new dependency * to a previous lock. We recursively validate the following rules: * * - would the adding of the <prev> -> <next> dependency create a * circular dependency in the graph? [== circular deadlock] * * - does the new prev->next dependency connect any hardirq-safe lock * (in the full backwards-subgraph starting at <prev>) with any * hardirq-unsafe lock (in the full forwards-subgraph starting at * <next>)? [== illegal lock inversion with hardirq contexts] * * - does the new prev->next dependency connect any softirq-safe lock * (in the full backwards-subgraph starting at <prev>) with any * softirq-unsafe lock (in the full forwards-subgraph starting at * <next>)? [== illegal lock inversion with softirq contexts] * * any of these scenarios could lead to a deadlock. * * Then if all the validations pass, we add the forwards and backwards * dependency. */ static int check_prev_add(struct task_struct *curr, struct held_lock *prev, |
4726f2a61 lockdep: Reduce s... |
1844 |
struct held_lock *next, int distance, int trylock_loop) |
fbb9ce953 [PATCH] lockdep: ... |
1845 1846 1847 |
{ struct lock_list *entry; int ret; |
db0002a32 lockdep: Implemen... |
1848 1849 |
struct lock_list this; struct lock_list *uninitialized_var(target_entry); |
4726f2a61 lockdep: Reduce s... |
1850 1851 1852 1853 1854 1855 1856 1857 |
/* * Static variable, serialized by the graph_lock(). * * We use this static variable to save the stack trace in case * we call into this function multiple times due to encountering * trylocks in the held lock stack. */ static struct stack_trace trace; |
fbb9ce953 [PATCH] lockdep: ... |
1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 |
/* * Prove that the new <prev> -> <next> dependency would not * create a circular dependency in the graph. (We do this by * forward-recursing into the graph starting at <next>, and * checking whether we can reach <prev>.) * * We are using global variables to control the recursion, to * keep the stackframe size of the recursive functions low: */ |
db0002a32 lockdep: Implemen... |
1868 1869 1870 1871 1872 1873 1874 |
this.class = hlock_class(next); this.parent = NULL; ret = check_noncircular(&this, hlock_class(prev), &target_entry); if (unlikely(!ret)) return print_circular_bug(&this, target_entry, next, prev); else if (unlikely(ret < 0)) return print_bfs_bug(ret); |
c94aa5ca3 lockdep: Print th... |
1875 |
|
8e18257d2 lockdep: reduce t... |
1876 |
if (!check_prev_add_irq(curr, prev, next)) |
fbb9ce953 [PATCH] lockdep: ... |
1877 1878 1879 |
return 0; /* |
fbb9ce953 [PATCH] lockdep: ... |
1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 |
* For recursive read-locks we do all the dependency checks, * but we dont store read-triggered dependencies (only * write-triggered dependencies). This ensures that only the * write-side dependencies matter, and that if for example a * write-lock never takes any other locks, then the reads are * equivalent to a NOP. */ if (next->read == 2 || prev->read == 2) return 1; /* * Is the <prev> -> <next> dependency already present? * * (this may occur even though this is a new chain: consider * e.g. the L1 -> L2 -> L3 -> L4 and the L5 -> L1 -> L2 -> L3 * chains - the second one will be new, but L1 already has * L2 added to its dependency list, due to the first chain.) */ |
f82b217e3 lockdep: shrink h... |
1897 1898 |
list_for_each_entry(entry, &hlock_class(prev)->locks_after, entry) { if (entry->class == hlock_class(next)) { |
068135e63 [PATCH] lockdep: ... |
1899 1900 |
if (distance == 1) entry->distance = 1; |
fbb9ce953 [PATCH] lockdep: ... |
1901 |
return 2; |
068135e63 [PATCH] lockdep: ... |
1902 |
} |
fbb9ce953 [PATCH] lockdep: ... |
1903 |
} |
4726f2a61 lockdep: Reduce s... |
1904 1905 |
if (!trylock_loop && !save_trace(&trace)) return 0; |
fbb9ce953 [PATCH] lockdep: ... |
1906 1907 1908 1909 |
/* * Ok, all validations passed, add the new lock * to the previous lock's dependency list: */ |
f82b217e3 lockdep: shrink h... |
1910 1911 |
ret = add_lock_to_list(hlock_class(prev), hlock_class(next), &hlock_class(prev)->locks_after, |
4726f2a61 lockdep: Reduce s... |
1912 |
next->acquire_ip, distance, &trace); |
068135e63 [PATCH] lockdep: ... |
1913 |
|
fbb9ce953 [PATCH] lockdep: ... |
1914 1915 |
if (!ret) return 0; |
910b1b2e6 [PATCH] lockdep: ... |
1916 |
|
f82b217e3 lockdep: shrink h... |
1917 1918 |
ret = add_lock_to_list(hlock_class(next), hlock_class(prev), &hlock_class(next)->locks_before, |
4726f2a61 lockdep: Reduce s... |
1919 |
next->acquire_ip, distance, &trace); |
910b1b2e6 [PATCH] lockdep: ... |
1920 1921 |
if (!ret) return 0; |
fbb9ce953 [PATCH] lockdep: ... |
1922 1923 |
/* |
8e18257d2 lockdep: reduce t... |
1924 1925 |
* Debugging printouts: */ |
f82b217e3 lockdep: shrink h... |
1926 |
if (verbose(hlock_class(prev)) || verbose(hlock_class(next))) { |
8e18257d2 lockdep: reduce t... |
1927 1928 1929 |
graph_unlock(); printk(" new dependency: "); |
f82b217e3 lockdep: shrink h... |
1930 |
print_lock_name(hlock_class(prev)); |
8e18257d2 lockdep: reduce t... |
1931 |
printk(" => "); |
f82b217e3 lockdep: shrink h... |
1932 |
print_lock_name(hlock_class(next)); |
8e18257d2 lockdep: reduce t... |
1933 1934 |
printk(" "); |
fbb9ce953 [PATCH] lockdep: ... |
1935 |
dump_stack(); |
8e18257d2 lockdep: reduce t... |
1936 |
return graph_lock(); |
fbb9ce953 [PATCH] lockdep: ... |
1937 |
} |
8e18257d2 lockdep: reduce t... |
1938 1939 |
return 1; } |
fbb9ce953 [PATCH] lockdep: ... |
1940 |
|
8e18257d2 lockdep: reduce t... |
1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 |
/* * Add the dependency to all directly-previous locks that are 'relevant'. * The ones that are relevant are (in increasing distance from curr): * all consecutive trylock entries and the final non-trylock entry - or * the end of this context's lock-chain - whichever comes first. */ static int check_prevs_add(struct task_struct *curr, struct held_lock *next) { int depth = curr->lockdep_depth; |
4726f2a61 lockdep: Reduce s... |
1951 |
int trylock_loop = 0; |
8e18257d2 lockdep: reduce t... |
1952 |
struct held_lock *hlock; |
d6d897cec [PATCH] lockdep: ... |
1953 |
|
fbb9ce953 [PATCH] lockdep: ... |
1954 |
/* |
8e18257d2 lockdep: reduce t... |
1955 1956 1957 |
* Debugging checks. * * Depth must not be zero for a non-head lock: |
fbb9ce953 [PATCH] lockdep: ... |
1958 |
*/ |
8e18257d2 lockdep: reduce t... |
1959 1960 |
if (!depth) goto out_bug; |
fbb9ce953 [PATCH] lockdep: ... |
1961 |
/* |
8e18257d2 lockdep: reduce t... |
1962 1963 |
* At least two relevant locks must exist for this * to be a head: |
fbb9ce953 [PATCH] lockdep: ... |
1964 |
*/ |
8e18257d2 lockdep: reduce t... |
1965 1966 1967 |
if (curr->held_locks[depth].irq_context != curr->held_locks[depth-1].irq_context) goto out_bug; |
74c383f14 [PATCH] lockdep: ... |
1968 |
|
8e18257d2 lockdep: reduce t... |
1969 1970 1971 1972 1973 1974 1975 1976 |
for (;;) { int distance = curr->lockdep_depth - depth + 1; hlock = curr->held_locks + depth-1; /* * Only non-recursive-read entries get new dependencies * added: */ if (hlock->read != 2) { |
4726f2a61 lockdep: Reduce s... |
1977 1978 |
if (!check_prev_add(curr, hlock, next, distance, trylock_loop)) |
8e18257d2 lockdep: reduce t... |
1979 1980 1981 1982 1983 1984 1985 1986 1987 |
return 0; /* * Stop after the first non-trylock entry, * as non-trylock entries have added their * own direct dependencies already, so this * lock is connected to them indirectly: */ if (!hlock->trylock) break; |
74c383f14 [PATCH] lockdep: ... |
1988 |
} |
8e18257d2 lockdep: reduce t... |
1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 |
depth--; /* * End of lock-stack? */ if (!depth) break; /* * Stop the search if we cross into another context: */ if (curr->held_locks[depth].irq_context != curr->held_locks[depth-1].irq_context) break; |
4726f2a61 lockdep: Reduce s... |
2001 |
trylock_loop = 1; |
fbb9ce953 [PATCH] lockdep: ... |
2002 |
} |
8e18257d2 lockdep: reduce t... |
2003 2004 2005 2006 |
return 1; out_bug: if (!debug_locks_off_graph_unlock()) return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2007 |
|
0119fee44 lockdep: Comment ... |
2008 2009 2010 2011 2012 |
/* * Clearly we all shouldn't be here, but since we made it we * can reliable say we messed up our state. See the above two * gotos for reasons why we could possibly end up here. */ |
8e18257d2 lockdep: reduce t... |
2013 |
WARN_ON(1); |
fbb9ce953 [PATCH] lockdep: ... |
2014 |
|
8e18257d2 lockdep: reduce t... |
2015 |
return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2016 |
} |
8e18257d2 lockdep: reduce t... |
2017 |
unsigned long nr_lock_chains; |
443cd507c lockdep: add lock... |
2018 |
struct lock_chain lock_chains[MAX_LOCKDEP_CHAINS]; |
cd1a28e84 lockdep: add lock... |
2019 |
int nr_chain_hlocks; |
443cd507c lockdep: add lock... |
2020 2021 2022 2023 2024 2025 |
static u16 chain_hlocks[MAX_LOCKDEP_CHAIN_HLOCKS]; struct lock_class *lock_chain_get_class(struct lock_chain *chain, int i) { return lock_classes + chain_hlocks[chain->base + i]; } |
8e18257d2 lockdep: reduce t... |
2026 |
|
fbb9ce953 [PATCH] lockdep: ... |
2027 2028 |
/* * Look up a dependency chain. If the key is not present yet then |
9e860d000 lockdep: lookup_c... |
2029 2030 2031 |
* add it and return 1 - in this case the new dependency chain is * validated. If the key is already hashed, return 0. * (On return with 1 graph_lock is held.) |
fbb9ce953 [PATCH] lockdep: ... |
2032 |
*/ |
443cd507c lockdep: add lock... |
2033 2034 2035 |
static inline int lookup_chain_cache(struct task_struct *curr, struct held_lock *hlock, u64 chain_key) |
fbb9ce953 [PATCH] lockdep: ... |
2036 |
{ |
f82b217e3 lockdep: shrink h... |
2037 |
struct lock_class *class = hlock_class(hlock); |
fbb9ce953 [PATCH] lockdep: ... |
2038 2039 |
struct list_head *hash_head = chainhashentry(chain_key); struct lock_chain *chain; |
443cd507c lockdep: add lock... |
2040 |
struct held_lock *hlock_curr, *hlock_next; |
e0944ee63 lockdep: Remove c... |
2041 |
int i, j; |
fbb9ce953 [PATCH] lockdep: ... |
2042 |
|
0119fee44 lockdep: Comment ... |
2043 2044 2045 2046 2047 |
/* * We might need to take the graph lock, ensure we've got IRQs * disabled to make this an IRQ-safe lock.. for recursion reasons * lockdep won't complain about its own locking errors. */ |
381a22920 [PATCH] lockdep: ... |
2048 2049 |
if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2050 2051 2052 2053 2054 2055 2056 |
/* * We can walk it lock-free, because entries only get added * to the hash: */ list_for_each_entry(chain, hash_head, entry) { if (chain->chain_key == chain_key) { cache_hit: |
bd6d29c25 lockstat: Make lo... |
2057 |
debug_atomic_inc(chain_lookup_hits); |
81fc685a8 [PATCH] lockdep: ... |
2058 |
if (very_verbose(class)) |
755cd9002 [PATCH] lockdep: ... |
2059 2060 2061 2062 2063 2064 |
printk(" hash chain already cached, key: " "%016Lx tail class: [%p] %s ", (unsigned long long)chain_key, class->key, class->name); |
fbb9ce953 [PATCH] lockdep: ... |
2065 2066 2067 |
return 0; } } |
81fc685a8 [PATCH] lockdep: ... |
2068 |
if (very_verbose(class)) |
755cd9002 [PATCH] lockdep: ... |
2069 2070 2071 2072 |
printk(" new hash chain, key: %016Lx tail class: [%p] %s ", (unsigned long long)chain_key, class->key, class->name); |
fbb9ce953 [PATCH] lockdep: ... |
2073 2074 2075 2076 |
/* * Allocate a new chain entry from the static array, and add * it to the hash: */ |
74c383f14 [PATCH] lockdep: ... |
2077 2078 |
if (!graph_lock()) return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2079 2080 2081 2082 2083 |
/* * We have to walk the chain again locked - to avoid duplicates: */ list_for_each_entry(chain, hash_head, entry) { if (chain->chain_key == chain_key) { |
74c383f14 [PATCH] lockdep: ... |
2084 |
graph_unlock(); |
fbb9ce953 [PATCH] lockdep: ... |
2085 2086 2087 2088 |
goto cache_hit; } } if (unlikely(nr_lock_chains >= MAX_LOCKDEP_CHAINS)) { |
74c383f14 [PATCH] lockdep: ... |
2089 2090 |
if (!debug_locks_off_graph_unlock()) return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2091 2092 2093 2094 |
printk("BUG: MAX_LOCKDEP_CHAINS too low! "); printk("turning off the locking correctness validator. "); |
eedeeabde lockdep: add stac... |
2095 |
dump_stack(); |
fbb9ce953 [PATCH] lockdep: ... |
2096 2097 2098 2099 |
return 0; } chain = lock_chains + nr_lock_chains++; chain->chain_key = chain_key; |
443cd507c lockdep: add lock... |
2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 |
chain->irq_context = hlock->irq_context; /* Find the first held_lock of current chain */ hlock_next = hlock; for (i = curr->lockdep_depth - 1; i >= 0; i--) { hlock_curr = curr->held_locks + i; if (hlock_curr->irq_context != hlock_next->irq_context) break; hlock_next = hlock; } i++; chain->depth = curr->lockdep_depth + 1 - i; |
e0944ee63 lockdep: Remove c... |
2111 2112 2113 |
if (likely(nr_chain_hlocks + chain->depth <= MAX_LOCKDEP_CHAIN_HLOCKS)) { chain->base = nr_chain_hlocks; nr_chain_hlocks += chain->depth; |
443cd507c lockdep: add lock... |
2114 |
for (j = 0; j < chain->depth - 1; j++, i++) { |
f82b217e3 lockdep: shrink h... |
2115 |
int lock_id = curr->held_locks[i].class_idx - 1; |
443cd507c lockdep: add lock... |
2116 2117 2118 2119 |
chain_hlocks[chain->base + j] = lock_id; } chain_hlocks[chain->base + j] = class - lock_classes; } |
fbb9ce953 [PATCH] lockdep: ... |
2120 |
list_add_tail_rcu(&chain->entry, hash_head); |
bd6d29c25 lockstat: Make lo... |
2121 |
debug_atomic_inc(chain_lookup_misses); |
8e18257d2 lockdep: reduce t... |
2122 2123 2124 2125 2126 2127 |
inc_chains(); return 1; } static int validate_chain(struct task_struct *curr, struct lockdep_map *lock, |
4e6045f13 workqueue: debug ... |
2128 |
struct held_lock *hlock, int chain_head, u64 chain_key) |
8e18257d2 lockdep: reduce t... |
2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 |
{ /* * Trylock needs to maintain the stack of held locks, but it * does not add new dependencies, because trylock can be done * in any order. * * We look up the chain_key and do the O(N^2) check and update of * the dependencies only if this is a new dependency chain. * (If lookup_chain_cache() returns with 1 it acquires * graph_lock for us) */ if (!hlock->trylock && (hlock->check == 2) && |
443cd507c lockdep: add lock... |
2141 |
lookup_chain_cache(curr, hlock, chain_key)) { |
8e18257d2 lockdep: reduce t... |
2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 |
/* * Check whether last held lock: * * - is irq-safe, if this lock is irq-unsafe * - is softirq-safe, if this lock is hardirq-unsafe * * And check whether the new lock's dependency graph * could lead back to the previous lock. * * any of these scenarios could lead to a deadlock. If * All validations */ int ret = check_deadlock(curr, hlock, lock, hlock->read); if (!ret) return 0; /* * Mark recursive read, as we jump over it when * building dependencies (just like we jump over * trylock entries): */ if (ret == 2) hlock->read = 2; /* * Add dependency only if this lock is not the head * of the chain, and if it's not a secondary read-lock: */ if (!chain_head && ret != 2) if (!check_prevs_add(curr, hlock)) return 0; graph_unlock(); } else /* after lookup_chain_cache(): */ if (unlikely(!debug_locks)) return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2177 2178 2179 |
return 1; } |
8e18257d2 lockdep: reduce t... |
2180 2181 2182 |
#else static inline int validate_chain(struct task_struct *curr, struct lockdep_map *lock, struct held_lock *hlock, |
3aa416b07 lockdep: fix mism... |
2183 |
int chain_head, u64 chain_key) |
8e18257d2 lockdep: reduce t... |
2184 2185 2186 |
{ return 1; } |
ca58abcb4 lockdep: sanitise... |
2187 |
#endif |
fbb9ce953 [PATCH] lockdep: ... |
2188 2189 2190 2191 2192 |
/* * We are building curr_chain_key incrementally, so double-check * it from scratch, to make sure that it's done correctly: */ |
1d09daa55 ftrace: use Makef... |
2193 |
static void check_chain_key(struct task_struct *curr) |
fbb9ce953 [PATCH] lockdep: ... |
2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 |
{ #ifdef CONFIG_DEBUG_LOCKDEP struct held_lock *hlock, *prev_hlock = NULL; unsigned int i, id; u64 chain_key = 0; for (i = 0; i < curr->lockdep_depth; i++) { hlock = curr->held_locks + i; if (chain_key != hlock->prev_chain_key) { debug_locks_off(); |
0119fee44 lockdep: Comment ... |
2204 2205 2206 2207 |
/* * We got mighty confused, our chain keys don't match * with what we expect, someone trample on our task state? */ |
2df8b1d65 lockdep: use WARN... |
2208 2209 |
WARN(1, "hm#1, depth: %u [%u], %016Lx != %016Lx ", |
fbb9ce953 [PATCH] lockdep: ... |
2210 2211 2212 |
curr->lockdep_depth, i, (unsigned long long)chain_key, (unsigned long long)hlock->prev_chain_key); |
fbb9ce953 [PATCH] lockdep: ... |
2213 2214 |
return; } |
f82b217e3 lockdep: shrink h... |
2215 |
id = hlock->class_idx - 1; |
0119fee44 lockdep: Comment ... |
2216 2217 2218 |
/* * Whoops ran out of static storage again? */ |
381a22920 [PATCH] lockdep: ... |
2219 2220 |
if (DEBUG_LOCKS_WARN_ON(id >= MAX_LOCKDEP_KEYS)) return; |
fbb9ce953 [PATCH] lockdep: ... |
2221 2222 2223 2224 2225 2226 2227 2228 |
if (prev_hlock && (prev_hlock->irq_context != hlock->irq_context)) chain_key = 0; chain_key = iterate_chain_key(chain_key, id); prev_hlock = hlock; } if (chain_key != curr->curr_chain_key) { debug_locks_off(); |
0119fee44 lockdep: Comment ... |
2229 2230 2231 2232 |
/* * More smoking hash instead of calculating it, damn see these * numbers float.. I bet that a pink elephant stepped on my memory. */ |
2df8b1d65 lockdep: use WARN... |
2233 2234 |
WARN(1, "hm#2, depth: %u [%u], %016Lx != %016Lx ", |
fbb9ce953 [PATCH] lockdep: ... |
2235 2236 2237 |
curr->lockdep_depth, i, (unsigned long long)chain_key, (unsigned long long)curr->curr_chain_key); |
fbb9ce953 [PATCH] lockdep: ... |
2238 2239 2240 |
} #endif } |
282b5c2f6 lockdep: Print a ... |
2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 |
static void print_usage_bug_scenario(struct held_lock *lock) { struct lock_class *class = hlock_class(lock); printk(" Possible unsafe locking scenario: "); printk(" CPU0 "); printk(" ---- "); printk(" lock("); __print_lock_name(class); printk("); "); printk(" <Interrupt> "); printk(" lock("); __print_lock_name(class); printk("); "); printk(" *** DEADLOCK *** "); } |
8e18257d2 lockdep: reduce t... |
2268 2269 2270 2271 2272 2273 |
static int print_usage_bug(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit prev_bit, enum lock_usage_bit new_bit) { if (!debug_locks_off_graph_unlock() || debug_locks_silent) return 0; |
b3fbab057 rcu: Restore chec... |
2274 2275 2276 2277 2278 2279 |
printk(" "); printk("================================= "); printk("[ INFO: inconsistent lock state ] "); |
8e18257d2 lockdep: reduce t... |
2280 |
print_kernel_version(); |
b3fbab057 rcu: Restore chec... |
2281 2282 |
printk("--------------------------------- "); |
8e18257d2 lockdep: reduce t... |
2283 2284 2285 2286 2287 2288 2289 |
printk("inconsistent {%s} -> {%s} usage. ", usage_str[prev_bit], usage_str[new_bit]); printk("%s/%d [HC%u[%lu]:SC%u[%lu]:HE%u:SE%u] takes: ", |
ba25f9dcc Use helpers to ob... |
2290 |
curr->comm, task_pid_nr(curr), |
8e18257d2 lockdep: reduce t... |
2291 2292 2293 2294 2295 2296 2297 2298 |
trace_hardirq_context(curr), hardirq_count() >> HARDIRQ_SHIFT, trace_softirq_context(curr), softirq_count() >> SOFTIRQ_SHIFT, trace_hardirqs_enabled(curr), trace_softirqs_enabled(curr)); print_lock(this); printk("{%s} state was registered at: ", usage_str[prev_bit]); |
f82b217e3 lockdep: shrink h... |
2299 |
print_stack_trace(hlock_class(this)->usage_traces + prev_bit, 1); |
8e18257d2 lockdep: reduce t... |
2300 2301 2302 2303 2304 |
print_irqtrace_events(curr); printk(" other info that might help us debug this: "); |
282b5c2f6 lockdep: Print a ... |
2305 |
print_usage_bug_scenario(this); |
8e18257d2 lockdep: reduce t... |
2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 |
lockdep_print_held_locks(curr); printk(" stack backtrace: "); dump_stack(); return 0; } /* * Print out an error if an invalid bit is set: */ static inline int valid_state(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit new_bit, enum lock_usage_bit bad_bit) { |
f82b217e3 lockdep: shrink h... |
2323 |
if (unlikely(hlock_class(this)->usage_mask & (1 << bad_bit))) |
8e18257d2 lockdep: reduce t... |
2324 2325 2326 2327 2328 2329 |
return print_usage_bug(curr, this, bad_bit, new_bit); return 1; } static int mark_lock(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit new_bit); |
81d68a96a ftrace: trace irq... |
2330 |
#if defined(CONFIG_TRACE_IRQFLAGS) && defined(CONFIG_PROVE_LOCKING) |
fbb9ce953 [PATCH] lockdep: ... |
2331 2332 2333 2334 2335 |
/* * print irq inversion bug: */ static int |
24208ca76 lockdep: Introduc... |
2336 2337 |
print_irq_inversion_bug(struct task_struct *curr, struct lock_list *root, struct lock_list *other, |
fbb9ce953 [PATCH] lockdep: ... |
2338 2339 2340 |
struct held_lock *this, int forwards, const char *irqclass) { |
dad3d7435 lockdep: Print a ... |
2341 2342 2343 |
struct lock_list *entry = other; struct lock_list *middle = NULL; int depth; |
74c383f14 [PATCH] lockdep: ... |
2344 |
if (!debug_locks_off_graph_unlock() || debug_locks_silent) |
fbb9ce953 [PATCH] lockdep: ... |
2345 |
return 0; |
b3fbab057 rcu: Restore chec... |
2346 2347 2348 2349 2350 2351 |
printk(" "); printk("========================================================= "); printk("[ INFO: possible irq lock inversion dependency detected ] "); |
99de055ac [PATCH] lockdep: ... |
2352 |
print_kernel_version(); |
b3fbab057 rcu: Restore chec... |
2353 2354 |
printk("--------------------------------------------------------- "); |
fbb9ce953 [PATCH] lockdep: ... |
2355 2356 |
printk("%s/%d just changed the state of lock: ", |
ba25f9dcc Use helpers to ob... |
2357 |
curr->comm, task_pid_nr(curr)); |
fbb9ce953 [PATCH] lockdep: ... |
2358 2359 |
print_lock(this); if (forwards) |
26575e28d lockdep: remove e... |
2360 2361 |
printk("but this lock took another, %s-unsafe lock in the past: ", irqclass); |
fbb9ce953 [PATCH] lockdep: ... |
2362 |
else |
26575e28d lockdep: remove e... |
2363 2364 |
printk("but this lock was taken by another, %s-safe lock in the past: ", irqclass); |
24208ca76 lockdep: Introduc... |
2365 |
print_lock_name(other->class); |
fbb9ce953 [PATCH] lockdep: ... |
2366 2367 2368 2369 2370 2371 2372 2373 2374 |
printk(" and interrupts could create inverse lock ordering between them. "); printk(" other info that might help us debug this: "); |
dad3d7435 lockdep: Print a ... |
2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 |
/* Find a middle lock (if one exists) */ depth = get_lock_depth(other); do { if (depth == 0 && (entry != root)) { printk("lockdep:%s bad path found in chain graph ", __func__); break; } middle = entry; entry = get_lock_parent(entry); depth--; } while (entry && entry != root && (depth >= 0)); if (forwards) print_irq_lock_scenario(root, other, middle ? middle->class : root->class, other->class); else print_irq_lock_scenario(other, root, middle ? middle->class : other->class, root->class); |
fbb9ce953 [PATCH] lockdep: ... |
2394 |
lockdep_print_held_locks(curr); |
24208ca76 lockdep: Introduc... |
2395 2396 2397 2398 2399 2400 |
printk(" the shortest dependencies between 2nd lock and 1st lock: "); if (!save_trace(&root->trace)) return 0; print_shortest_lock_dependencies(other, root); |
fbb9ce953 [PATCH] lockdep: ... |
2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 |
printk(" stack backtrace: "); dump_stack(); return 0; } /* * Prove that in the forwards-direction subgraph starting at <this> * there is no lock matching <mask>: */ static int check_usage_forwards(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit bit, const char *irqclass) { int ret; |
d7aaba140 lockdep: Implemen... |
2419 2420 |
struct lock_list root; struct lock_list *uninitialized_var(target_entry); |
fbb9ce953 [PATCH] lockdep: ... |
2421 |
|
d7aaba140 lockdep: Implemen... |
2422 2423 2424 |
root.parent = NULL; root.class = hlock_class(this); ret = find_usage_forwards(&root, bit, &target_entry); |
af0129614 lockdep: BFS cleanup |
2425 2426 2427 2428 |
if (ret < 0) return print_bfs_bug(ret); if (ret == 1) return ret; |
fbb9ce953 [PATCH] lockdep: ... |
2429 |
|
24208ca76 lockdep: Introduc... |
2430 |
return print_irq_inversion_bug(curr, &root, target_entry, |
d7aaba140 lockdep: Implemen... |
2431 |
this, 1, irqclass); |
fbb9ce953 [PATCH] lockdep: ... |
2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 |
} /* * Prove that in the backwards-direction subgraph starting at <this> * there is no lock matching <mask>: */ static int check_usage_backwards(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit bit, const char *irqclass) { int ret; |
d7aaba140 lockdep: Implemen... |
2443 2444 |
struct lock_list root; struct lock_list *uninitialized_var(target_entry); |
fbb9ce953 [PATCH] lockdep: ... |
2445 |
|
d7aaba140 lockdep: Implemen... |
2446 2447 2448 |
root.parent = NULL; root.class = hlock_class(this); ret = find_usage_backwards(&root, bit, &target_entry); |
af0129614 lockdep: BFS cleanup |
2449 2450 2451 2452 |
if (ret < 0) return print_bfs_bug(ret); if (ret == 1) return ret; |
fbb9ce953 [PATCH] lockdep: ... |
2453 |
|
24208ca76 lockdep: Introduc... |
2454 |
return print_irq_inversion_bug(curr, &root, target_entry, |
48d506741 lockdep: Fix chec... |
2455 |
this, 0, irqclass); |
fbb9ce953 [PATCH] lockdep: ... |
2456 |
} |
3117df045 [PATCH] lockdep: ... |
2457 |
void print_irqtrace_events(struct task_struct *curr) |
fbb9ce953 [PATCH] lockdep: ... |
2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 |
{ printk("irq event stamp: %u ", curr->irq_events); printk("hardirqs last enabled at (%u): ", curr->hardirq_enable_event); print_ip_sym(curr->hardirq_enable_ip); printk("hardirqs last disabled at (%u): ", curr->hardirq_disable_event); print_ip_sym(curr->hardirq_disable_ip); printk("softirqs last enabled at (%u): ", curr->softirq_enable_event); print_ip_sym(curr->softirq_enable_ip); printk("softirqs last disabled at (%u): ", curr->softirq_disable_event); print_ip_sym(curr->softirq_disable_ip); } |
cd95302d2 lockdep: simplify... |
2470 |
static int HARDIRQ_verbose(struct lock_class *class) |
fbb9ce953 [PATCH] lockdep: ... |
2471 |
{ |
8e18257d2 lockdep: reduce t... |
2472 2473 2474 |
#if HARDIRQ_VERBOSE return class_filter(class); #endif |
fbb9ce953 [PATCH] lockdep: ... |
2475 2476 |
return 0; } |
cd95302d2 lockdep: simplify... |
2477 |
static int SOFTIRQ_verbose(struct lock_class *class) |
fbb9ce953 [PATCH] lockdep: ... |
2478 |
{ |
8e18257d2 lockdep: reduce t... |
2479 2480 2481 2482 |
#if SOFTIRQ_VERBOSE return class_filter(class); #endif return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2483 |
} |
cd95302d2 lockdep: simplify... |
2484 |
static int RECLAIM_FS_verbose(struct lock_class *class) |
cf40bd16f lockdep: annotate... |
2485 2486 2487 2488 2489 2490 |
{ #if RECLAIM_VERBOSE return class_filter(class); #endif return 0; } |
fbb9ce953 [PATCH] lockdep: ... |
2491 |
#define STRICT_READ_CHECKS 1 |
cd95302d2 lockdep: simplify... |
2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 |
static int (*state_verbose_f[])(struct lock_class *class) = { #define LOCKDEP_STATE(__STATE) \ __STATE##_verbose, #include "lockdep_states.h" #undef LOCKDEP_STATE }; static inline int state_verbose(enum lock_usage_bit bit, struct lock_class *class) { return state_verbose_f[bit >> 2](class); } |
42c50d544 lockdep: merge th... |
2504 2505 |
typedef int (*check_usage_f)(struct task_struct *, struct held_lock *, enum lock_usage_bit bit, const char *name); |
6a6904d34 lockdep: split up... |
2506 |
static int |
1c21f14ec lockdep: fix inco... |
2507 2508 |
mark_lock_irq(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit new_bit) |
6a6904d34 lockdep: split up... |
2509 |
{ |
f989209e2 lockdep: further ... |
2510 |
int excl_bit = exclusive_bit(new_bit); |
9d3651a23 lockdep: fully re... |
2511 |
int read = new_bit & 1; |
42c50d544 lockdep: merge th... |
2512 |
int dir = new_bit & 2; |
38aa27143 lockdep: add comm... |
2513 2514 2515 2516 2517 2518 2519 |
/* * mark USED_IN has to look forwards -- to ensure no dependency * has ENABLED state, which would allow recursion deadlocks. * * mark ENABLED has to look backwards -- to ensure no dependee * has USED_IN state, which, again, would allow recursion deadlocks. */ |
42c50d544 lockdep: merge th... |
2520 2521 |
check_usage_f usage = dir ? check_usage_backwards : check_usage_forwards; |
f989209e2 lockdep: further ... |
2522 |
|
38aa27143 lockdep: add comm... |
2523 2524 2525 2526 |
/* * Validate that this particular lock does not have conflicting * usage states. */ |
6a6904d34 lockdep: split up... |
2527 2528 |
if (!valid_state(curr, this, new_bit, excl_bit)) return 0; |
42c50d544 lockdep: merge th... |
2529 |
|
38aa27143 lockdep: add comm... |
2530 2531 2532 2533 2534 |
/* * Validate that the lock dependencies don't have conflicting usage * states. */ if ((!read || !dir || STRICT_READ_CHECKS) && |
1c21f14ec lockdep: fix inco... |
2535 |
!usage(curr, this, excl_bit, state_name(new_bit & ~1))) |
6a6904d34 lockdep: split up... |
2536 |
return 0; |
780e820b2 lockdep: merge th... |
2537 |
|
38aa27143 lockdep: add comm... |
2538 2539 2540 2541 2542 2543 2544 2545 |
/* * Check for read in write conflicts */ if (!read) { if (!valid_state(curr, this, new_bit, excl_bit + 1)) return 0; if (STRICT_READ_CHECKS && |
4f367d8ad lockdep: simplify... |
2546 2547 |
!usage(curr, this, excl_bit + 1, state_name(new_bit + 1))) |
38aa27143 lockdep: add comm... |
2548 2549 |
return 0; } |
780e820b2 lockdep: merge th... |
2550 |
|
cd95302d2 lockdep: simplify... |
2551 |
if (state_verbose(new_bit, hlock_class(this))) |
6a6904d34 lockdep: split up... |
2552 2553 2554 2555 |
return 2; return 1; } |
cf40bd16f lockdep: annotate... |
2556 |
enum mark_type { |
36bfb9bb0 lockdep: simplify... |
2557 2558 2559 |
#define LOCKDEP_STATE(__STATE) __STATE, #include "lockdep_states.h" #undef LOCKDEP_STATE |
cf40bd16f lockdep: annotate... |
2560 |
}; |
fbb9ce953 [PATCH] lockdep: ... |
2561 2562 2563 |
/* * Mark all held locks with a usage bit: */ |
1d09daa55 ftrace: use Makef... |
2564 |
static int |
cf40bd16f lockdep: annotate... |
2565 |
mark_held_locks(struct task_struct *curr, enum mark_type mark) |
fbb9ce953 [PATCH] lockdep: ... |
2566 2567 2568 2569 2570 2571 2572 |
{ enum lock_usage_bit usage_bit; struct held_lock *hlock; int i; for (i = 0; i < curr->lockdep_depth; i++) { hlock = curr->held_locks + i; |
cf2ad4d13 lockdep: remove m... |
2573 2574 2575 2576 2577 |
usage_bit = 2 + (mark << 2); /* ENABLED */ if (hlock->read) usage_bit += 1; /* READ */ BUG_ON(usage_bit >= LOCK_USAGE_STATES); |
cf40bd16f lockdep: annotate... |
2578 |
|
70a0686a7 lockdep: Fix up w... |
2579 |
if (hlock_class(hlock)->key == __lockdep_no_validate__.subkeys) |
efbe2eee6 lockdep: Fix lock... |
2580 |
continue; |
4ff773bbd lockdep: removed ... |
2581 |
if (!mark_lock(curr, hlock, usage_bit)) |
fbb9ce953 [PATCH] lockdep: ... |
2582 2583 2584 2585 2586 2587 2588 |
return 0; } return 1; } /* |
fbb9ce953 [PATCH] lockdep: ... |
2589 2590 |
* Hardirqs will be enabled: */ |
dd4e5d3ac lockdep: Fix trac... |
2591 |
static void __trace_hardirqs_on_caller(unsigned long ip) |
fbb9ce953 [PATCH] lockdep: ... |
2592 2593 |
{ struct task_struct *curr = current; |
fbb9ce953 [PATCH] lockdep: ... |
2594 |
|
fbb9ce953 [PATCH] lockdep: ... |
2595 2596 |
/* we'll do an OFF -> ON transition: */ curr->hardirqs_enabled = 1; |
fbb9ce953 [PATCH] lockdep: ... |
2597 |
|
fbb9ce953 [PATCH] lockdep: ... |
2598 2599 2600 2601 |
/* * We are going to turn hardirqs on, so set the * usage bit for all held locks: */ |
cf40bd16f lockdep: annotate... |
2602 |
if (!mark_held_locks(curr, HARDIRQ)) |
fbb9ce953 [PATCH] lockdep: ... |
2603 2604 2605 2606 2607 2608 2609 |
return; /* * If we have softirqs enabled, then set the usage * bit for all held locks. (disabled hardirqs prevented * this bit from being set before) */ if (curr->softirqs_enabled) |
cf40bd16f lockdep: annotate... |
2610 |
if (!mark_held_locks(curr, SOFTIRQ)) |
fbb9ce953 [PATCH] lockdep: ... |
2611 |
return; |
8e18257d2 lockdep: reduce t... |
2612 2613 |
curr->hardirq_enable_ip = ip; curr->hardirq_enable_event = ++curr->irq_events; |
bd6d29c25 lockstat: Make lo... |
2614 |
debug_atomic_inc(hardirqs_on_events); |
8e18257d2 lockdep: reduce t... |
2615 |
} |
dd4e5d3ac lockdep: Fix trac... |
2616 2617 2618 2619 2620 2621 2622 |
void trace_hardirqs_on_caller(unsigned long ip) { time_hardirqs_on(CALLER_ADDR0, ip); if (unlikely(!debug_locks || current->lockdep_recursion)) return; |
7d36b26be lockdep: Fix trac... |
2623 2624 2625 2626 2627 2628 2629 2630 2631 |
if (unlikely(current->hardirqs_enabled)) { /* * Neither irq nor preemption are disabled here * so this is racy by nature but losing one hit * in a stat is not a big deal. */ __debug_atomic_inc(redundant_hardirqs_on); return; } |
0119fee44 lockdep: Comment ... |
2632 2633 2634 2635 2636 |
/* * We're enabling irqs and according to our state above irqs weren't * already enabled, yet we find the hardware thinks they are in fact * enabled.. someone messed up their IRQ state tracing. */ |
dd4e5d3ac lockdep: Fix trac... |
2637 2638 |
if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) return; |
0119fee44 lockdep: Comment ... |
2639 2640 2641 |
/* * See the fine text that goes along with this variable definition. */ |
7d36b26be lockdep: Fix trac... |
2642 2643 |
if (DEBUG_LOCKS_WARN_ON(unlikely(early_boot_irqs_disabled))) return; |
0119fee44 lockdep: Comment ... |
2644 2645 2646 2647 |
/* * Can't allow enabling interrupts while in an interrupt handler, * that's general bad form and such. Recursion, limited stack etc.. */ |
7d36b26be lockdep: Fix trac... |
2648 2649 |
if (DEBUG_LOCKS_WARN_ON(current->hardirq_context)) return; |
dd4e5d3ac lockdep: Fix trac... |
2650 2651 2652 2653 |
current->lockdep_recursion = 1; __trace_hardirqs_on_caller(ip); current->lockdep_recursion = 0; } |
81d68a96a ftrace: trace irq... |
2654 |
EXPORT_SYMBOL(trace_hardirqs_on_caller); |
8e18257d2 lockdep: reduce t... |
2655 |
|
1d09daa55 ftrace: use Makef... |
2656 |
void trace_hardirqs_on(void) |
81d68a96a ftrace: trace irq... |
2657 2658 2659 |
{ trace_hardirqs_on_caller(CALLER_ADDR0); } |
8e18257d2 lockdep: reduce t... |
2660 2661 2662 2663 2664 |
EXPORT_SYMBOL(trace_hardirqs_on); /* * Hardirqs were disabled: */ |
6afe40b4d lockdep: fix irqs... |
2665 |
void trace_hardirqs_off_caller(unsigned long ip) |
8e18257d2 lockdep: reduce t... |
2666 2667 |
{ struct task_struct *curr = current; |
6afe40b4d lockdep: fix irqs... |
2668 |
time_hardirqs_off(CALLER_ADDR0, ip); |
81d68a96a ftrace: trace irq... |
2669 |
|
8e18257d2 lockdep: reduce t... |
2670 2671 |
if (unlikely(!debug_locks || current->lockdep_recursion)) return; |
0119fee44 lockdep: Comment ... |
2672 2673 2674 2675 |
/* * So we're supposed to get called after you mask local IRQs, but for * some reason the hardware doesn't quite think you did a proper job. */ |
8e18257d2 lockdep: reduce t... |
2676 2677 2678 2679 2680 2681 2682 2683 |
if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) return; if (curr->hardirqs_enabled) { /* * We have done an ON -> OFF transition: */ curr->hardirqs_enabled = 0; |
6afe40b4d lockdep: fix irqs... |
2684 |
curr->hardirq_disable_ip = ip; |
8e18257d2 lockdep: reduce t... |
2685 |
curr->hardirq_disable_event = ++curr->irq_events; |
bd6d29c25 lockstat: Make lo... |
2686 |
debug_atomic_inc(hardirqs_off_events); |
8e18257d2 lockdep: reduce t... |
2687 |
} else |
bd6d29c25 lockstat: Make lo... |
2688 |
debug_atomic_inc(redundant_hardirqs_off); |
8e18257d2 lockdep: reduce t... |
2689 |
} |
81d68a96a ftrace: trace irq... |
2690 |
EXPORT_SYMBOL(trace_hardirqs_off_caller); |
8e18257d2 lockdep: reduce t... |
2691 |
|
1d09daa55 ftrace: use Makef... |
2692 |
void trace_hardirqs_off(void) |
81d68a96a ftrace: trace irq... |
2693 2694 2695 |
{ trace_hardirqs_off_caller(CALLER_ADDR0); } |
8e18257d2 lockdep: reduce t... |
2696 2697 2698 2699 2700 2701 2702 2703 |
EXPORT_SYMBOL(trace_hardirqs_off); /* * Softirqs will be enabled: */ void trace_softirqs_on(unsigned long ip) { struct task_struct *curr = current; |
dd4e5d3ac lockdep: Fix trac... |
2704 |
if (unlikely(!debug_locks || current->lockdep_recursion)) |
8e18257d2 lockdep: reduce t... |
2705 |
return; |
0119fee44 lockdep: Comment ... |
2706 2707 2708 2709 |
/* * We fancy IRQs being disabled here, see softirq.c, avoids * funny state and nesting things. */ |
8e18257d2 lockdep: reduce t... |
2710 2711 2712 2713 |
if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) return; if (curr->softirqs_enabled) { |
bd6d29c25 lockstat: Make lo... |
2714 |
debug_atomic_inc(redundant_softirqs_on); |
8e18257d2 lockdep: reduce t... |
2715 2716 |
return; } |
dd4e5d3ac lockdep: Fix trac... |
2717 |
current->lockdep_recursion = 1; |
8e18257d2 lockdep: reduce t... |
2718 2719 2720 2721 2722 2723 |
/* * We'll do an OFF -> ON transition: */ curr->softirqs_enabled = 1; curr->softirq_enable_ip = ip; curr->softirq_enable_event = ++curr->irq_events; |
bd6d29c25 lockstat: Make lo... |
2724 |
debug_atomic_inc(softirqs_on_events); |
8e18257d2 lockdep: reduce t... |
2725 2726 2727 2728 2729 2730 |
/* * We are going to turn softirqs on, so set the * usage bit for all held locks, if hardirqs are * enabled too: */ if (curr->hardirqs_enabled) |
cf40bd16f lockdep: annotate... |
2731 |
mark_held_locks(curr, SOFTIRQ); |
dd4e5d3ac lockdep: Fix trac... |
2732 |
current->lockdep_recursion = 0; |
8e18257d2 lockdep: reduce t... |
2733 2734 2735 2736 2737 2738 2739 2740 |
} /* * Softirqs were disabled: */ void trace_softirqs_off(unsigned long ip) { struct task_struct *curr = current; |
dd4e5d3ac lockdep: Fix trac... |
2741 |
if (unlikely(!debug_locks || current->lockdep_recursion)) |
8e18257d2 lockdep: reduce t... |
2742 |
return; |
0119fee44 lockdep: Comment ... |
2743 2744 2745 |
/* * We fancy IRQs being disabled here, see softirq.c */ |
8e18257d2 lockdep: reduce t... |
2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 |
if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) return; if (curr->softirqs_enabled) { /* * We have done an ON -> OFF transition: */ curr->softirqs_enabled = 0; curr->softirq_disable_ip = ip; curr->softirq_disable_event = ++curr->irq_events; |
bd6d29c25 lockstat: Make lo... |
2756 |
debug_atomic_inc(softirqs_off_events); |
0119fee44 lockdep: Comment ... |
2757 2758 2759 |
/* * Whoops, we wanted softirqs off, so why aren't they? */ |
8e18257d2 lockdep: reduce t... |
2760 2761 |
DEBUG_LOCKS_WARN_ON(!softirq_count()); } else |
bd6d29c25 lockstat: Make lo... |
2762 |
debug_atomic_inc(redundant_softirqs_off); |
8e18257d2 lockdep: reduce t... |
2763 |
} |
2f8501815 lockdep: fix dead... |
2764 |
static void __lockdep_trace_alloc(gfp_t gfp_mask, unsigned long flags) |
cf40bd16f lockdep: annotate... |
2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 |
{ struct task_struct *curr = current; if (unlikely(!debug_locks)) return; /* no reclaim without waiting on it */ if (!(gfp_mask & __GFP_WAIT)) return; /* this guy won't enter reclaim */ if ((curr->flags & PF_MEMALLOC) && !(gfp_mask & __GFP_NOMEMALLOC)) return; /* We're only interested __GFP_FS allocations for now */ if (!(gfp_mask & __GFP_FS)) return; |
0119fee44 lockdep: Comment ... |
2782 2783 2784 |
/* * Oi! Can't be having __GFP_FS allocations with IRQs disabled. */ |
2f8501815 lockdep: fix dead... |
2785 |
if (DEBUG_LOCKS_WARN_ON(irqs_disabled_flags(flags))) |
cf40bd16f lockdep: annotate... |
2786 2787 2788 2789 |
return; mark_held_locks(curr, RECLAIM_FS); } |
2f8501815 lockdep: fix dead... |
2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 |
static void check_flags(unsigned long flags); void lockdep_trace_alloc(gfp_t gfp_mask) { unsigned long flags; if (unlikely(current->lockdep_recursion)) return; raw_local_irq_save(flags); check_flags(flags); current->lockdep_recursion = 1; __lockdep_trace_alloc(gfp_mask, flags); current->lockdep_recursion = 0; raw_local_irq_restore(flags); } |
8e18257d2 lockdep: reduce t... |
2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 |
static int mark_irqflags(struct task_struct *curr, struct held_lock *hlock) { /* * If non-trylock use in a hardirq or softirq context, then * mark the lock as used in these contexts: */ if (!hlock->trylock) { if (hlock->read) { if (curr->hardirq_context) if (!mark_lock(curr, hlock, LOCK_USED_IN_HARDIRQ_READ)) return 0; if (curr->softirq_context) if (!mark_lock(curr, hlock, LOCK_USED_IN_SOFTIRQ_READ)) return 0; } else { if (curr->hardirq_context) if (!mark_lock(curr, hlock, LOCK_USED_IN_HARDIRQ)) return 0; if (curr->softirq_context) if (!mark_lock(curr, hlock, LOCK_USED_IN_SOFTIRQ)) return 0; } } if (!hlock->hardirqs_off) { if (hlock->read) { if (!mark_lock(curr, hlock, |
4fc95e867 lockdep: sanitize... |
2834 |
LOCK_ENABLED_HARDIRQ_READ)) |
8e18257d2 lockdep: reduce t... |
2835 2836 2837 |
return 0; if (curr->softirqs_enabled) if (!mark_lock(curr, hlock, |
4fc95e867 lockdep: sanitize... |
2838 |
LOCK_ENABLED_SOFTIRQ_READ)) |
8e18257d2 lockdep: reduce t... |
2839 2840 2841 |
return 0; } else { if (!mark_lock(curr, hlock, |
4fc95e867 lockdep: sanitize... |
2842 |
LOCK_ENABLED_HARDIRQ)) |
8e18257d2 lockdep: reduce t... |
2843 2844 2845 |
return 0; if (curr->softirqs_enabled) if (!mark_lock(curr, hlock, |
4fc95e867 lockdep: sanitize... |
2846 |
LOCK_ENABLED_SOFTIRQ)) |
8e18257d2 lockdep: reduce t... |
2847 2848 2849 |
return 0; } } |
cf40bd16f lockdep: annotate... |
2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 |
/* * We reuse the irq context infrastructure more broadly as a general * context checking code. This tests GFP_FS recursion (a lock taken * during reclaim for a GFP_FS allocation is held over a GFP_FS * allocation). */ if (!hlock->trylock && (curr->lockdep_reclaim_gfp & __GFP_FS)) { if (hlock->read) { if (!mark_lock(curr, hlock, LOCK_USED_IN_RECLAIM_FS_READ)) return 0; } else { if (!mark_lock(curr, hlock, LOCK_USED_IN_RECLAIM_FS)) return 0; } } |
8e18257d2 lockdep: reduce t... |
2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 |
return 1; } static int separate_irq_context(struct task_struct *curr, struct held_lock *hlock) { unsigned int depth = curr->lockdep_depth; /* * Keep track of points where we cross into an interrupt context: */ hlock->irq_context = 2*(curr->hardirq_context ? 1 : 0) + curr->softirq_context; if (depth) { struct held_lock *prev_hlock; prev_hlock = curr->held_locks + depth-1; /* * If we cross into another context, reset the * hash key (this also prevents the checking and the * adding of the dependency to 'prev'): */ if (prev_hlock->irq_context != hlock->irq_context) return 1; } return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2891 |
} |
0119fee44 lockdep: Comment ... |
2892 |
#else /* defined(CONFIG_TRACE_IRQFLAGS) && defined(CONFIG_PROVE_LOCKING) */ |
fbb9ce953 [PATCH] lockdep: ... |
2893 |
|
8e18257d2 lockdep: reduce t... |
2894 2895 2896 |
static inline int mark_lock_irq(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit new_bit) |
fbb9ce953 [PATCH] lockdep: ... |
2897 |
{ |
0119fee44 lockdep: Comment ... |
2898 |
WARN_ON(1); /* Impossible innit? when we don't have TRACE_IRQFLAG */ |
8e18257d2 lockdep: reduce t... |
2899 2900 |
return 1; } |
fbb9ce953 [PATCH] lockdep: ... |
2901 |
|
8e18257d2 lockdep: reduce t... |
2902 2903 2904 2905 2906 |
static inline int mark_irqflags(struct task_struct *curr, struct held_lock *hlock) { return 1; } |
fbb9ce953 [PATCH] lockdep: ... |
2907 |
|
8e18257d2 lockdep: reduce t... |
2908 2909 2910 2911 |
static inline int separate_irq_context(struct task_struct *curr, struct held_lock *hlock) { return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2912 |
} |
868a23a80 lockdep: build fi... |
2913 2914 2915 |
void lockdep_trace_alloc(gfp_t gfp_mask) { } |
0119fee44 lockdep: Comment ... |
2916 |
#endif /* defined(CONFIG_TRACE_IRQFLAGS) && defined(CONFIG_PROVE_LOCKING) */ |
fbb9ce953 [PATCH] lockdep: ... |
2917 2918 |
/* |
8e18257d2 lockdep: reduce t... |
2919 |
* Mark a lock with a usage bit, and validate the state transition: |
fbb9ce953 [PATCH] lockdep: ... |
2920 |
*/ |
1d09daa55 ftrace: use Makef... |
2921 |
static int mark_lock(struct task_struct *curr, struct held_lock *this, |
0764d23cf ftrace: lockdep n... |
2922 |
enum lock_usage_bit new_bit) |
fbb9ce953 [PATCH] lockdep: ... |
2923 |
{ |
8e18257d2 lockdep: reduce t... |
2924 |
unsigned int new_mask = 1 << new_bit, ret = 1; |
fbb9ce953 [PATCH] lockdep: ... |
2925 2926 |
/* |
8e18257d2 lockdep: reduce t... |
2927 2928 |
* If already set then do not dirty the cacheline, * nor do any checks: |
fbb9ce953 [PATCH] lockdep: ... |
2929 |
*/ |
f82b217e3 lockdep: shrink h... |
2930 |
if (likely(hlock_class(this)->usage_mask & new_mask)) |
8e18257d2 lockdep: reduce t... |
2931 2932 2933 2934 |
return 1; if (!graph_lock()) return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2935 |
/* |
25985edce Fix common misspe... |
2936 |
* Make sure we didn't race: |
fbb9ce953 [PATCH] lockdep: ... |
2937 |
*/ |
f82b217e3 lockdep: shrink h... |
2938 |
if (unlikely(hlock_class(this)->usage_mask & new_mask)) { |
8e18257d2 lockdep: reduce t... |
2939 2940 2941 |
graph_unlock(); return 1; } |
fbb9ce953 [PATCH] lockdep: ... |
2942 |
|
f82b217e3 lockdep: shrink h... |
2943 |
hlock_class(this)->usage_mask |= new_mask; |
fbb9ce953 [PATCH] lockdep: ... |
2944 |
|
f82b217e3 lockdep: shrink h... |
2945 |
if (!save_trace(hlock_class(this)->usage_traces + new_bit)) |
8e18257d2 lockdep: reduce t... |
2946 |
return 0; |
fbb9ce953 [PATCH] lockdep: ... |
2947 |
|
8e18257d2 lockdep: reduce t... |
2948 |
switch (new_bit) { |
5346417e1 lockdep: simplify... |
2949 2950 2951 2952 2953 2954 2955 |
#define LOCKDEP_STATE(__STATE) \ case LOCK_USED_IN_##__STATE: \ case LOCK_USED_IN_##__STATE##_READ: \ case LOCK_ENABLED_##__STATE: \ case LOCK_ENABLED_##__STATE##_READ: #include "lockdep_states.h" #undef LOCKDEP_STATE |
8e18257d2 lockdep: reduce t... |
2956 2957 2958 2959 2960 |
ret = mark_lock_irq(curr, this, new_bit); if (!ret) return 0; break; case LOCK_USED: |
bd6d29c25 lockstat: Make lo... |
2961 |
debug_atomic_dec(nr_unused_locks); |
8e18257d2 lockdep: reduce t... |
2962 2963 2964 2965 2966 2967 2968 |
break; default: if (!debug_locks_off_graph_unlock()) return 0; WARN_ON(1); return 0; } |
fbb9ce953 [PATCH] lockdep: ... |
2969 |
|
8e18257d2 lockdep: reduce t... |
2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 |
graph_unlock(); /* * We must printk outside of the graph_lock: */ if (ret == 2) { printk(" marked lock as {%s}: ", usage_str[new_bit]); print_lock(this); print_irqtrace_events(curr); dump_stack(); } return ret; } |
fbb9ce953 [PATCH] lockdep: ... |
2986 2987 2988 2989 2990 |
/* * Initialize a lock instance's lock-class mapping info: */ void lockdep_init_map(struct lockdep_map *lock, const char *name, |
4dfbb9d8c Lockdep: add lock... |
2991 |
struct lock_class_key *key, int subclass) |
fbb9ce953 [PATCH] lockdep: ... |
2992 |
{ |
f59de8992 lockdep: Clear wh... |
2993 |
memset(lock, 0, sizeof(*lock)); |
620162505 lockdep: Add impr... |
2994 |
|
c8a250058 lockdep: more rob... |
2995 2996 2997 |
#ifdef CONFIG_LOCK_STAT lock->cpu = raw_smp_processor_id(); #endif |
0119fee44 lockdep: Comment ... |
2998 2999 3000 |
/* * Can't be having no nameless bastards around this place! */ |
c8a250058 lockdep: more rob... |
3001 3002 |
if (DEBUG_LOCKS_WARN_ON(!name)) { lock->name = "NULL"; |
fbb9ce953 [PATCH] lockdep: ... |
3003 |
return; |
c8a250058 lockdep: more rob... |
3004 3005 3006 |
} lock->name = name; |
fbb9ce953 [PATCH] lockdep: ... |
3007 |
|
0119fee44 lockdep: Comment ... |
3008 3009 3010 |
/* * No key, no joy, we need to hash something. */ |
fbb9ce953 [PATCH] lockdep: ... |
3011 3012 |
if (DEBUG_LOCKS_WARN_ON(!key)) return; |
fbb9ce953 [PATCH] lockdep: ... |
3013 3014 3015 3016 3017 3018 |
/* * Sanity check, the lock-class key must be persistent: */ if (!static_obj(key)) { printk("BUG: key %p not in .data! ", key); |
0119fee44 lockdep: Comment ... |
3019 3020 3021 |
/* * What it says above ^^^^^, I suggest you read it. */ |
fbb9ce953 [PATCH] lockdep: ... |
3022 3023 3024 |
DEBUG_LOCKS_WARN_ON(1); return; } |
fbb9ce953 [PATCH] lockdep: ... |
3025 |
lock->key = key; |
c8a250058 lockdep: more rob... |
3026 3027 3028 |
if (unlikely(!debug_locks)) return; |
4dfbb9d8c Lockdep: add lock... |
3029 3030 |
if (subclass) register_lock_class(lock, subclass, 1); |
fbb9ce953 [PATCH] lockdep: ... |
3031 |
} |
fbb9ce953 [PATCH] lockdep: ... |
3032 |
EXPORT_SYMBOL_GPL(lockdep_init_map); |
1704f47b5 lockdep: Add nova... |
3033 |
struct lock_class_key __lockdep_no_validate__; |
fbb9ce953 [PATCH] lockdep: ... |
3034 3035 3036 3037 3038 3039 |
/* * This gets called for every mutex_lock*()/spin_lock*() operation. * We maintain the dependency maps and validate the locking attempt: */ static int __lock_acquire(struct lockdep_map *lock, unsigned int subclass, int trylock, int read, int check, int hardirqs_off, |
bb97a91e2 lockdep: Deal wit... |
3040 3041 |
struct lockdep_map *nest_lock, unsigned long ip, int references) |
fbb9ce953 [PATCH] lockdep: ... |
3042 3043 |
{ struct task_struct *curr = current; |
d6d897cec [PATCH] lockdep: ... |
3044 |
struct lock_class *class = NULL; |
fbb9ce953 [PATCH] lockdep: ... |
3045 |
struct held_lock *hlock; |
fbb9ce953 [PATCH] lockdep: ... |
3046 3047 |
unsigned int depth, id; int chain_head = 0; |
bb97a91e2 lockdep: Deal wit... |
3048 |
int class_idx; |
fbb9ce953 [PATCH] lockdep: ... |
3049 |
u64 chain_key; |
f20786ff4 lockstat: core in... |
3050 3051 |
if (!prove_locking) check = 1; |
fbb9ce953 [PATCH] lockdep: ... |
3052 3053 |
if (unlikely(!debug_locks)) return 0; |
0119fee44 lockdep: Comment ... |
3054 3055 3056 3057 3058 |
/* * Lockdep should run with IRQs disabled, otherwise we could * get an interrupt which would want to take locks, which would * end up in lockdep and have you got a head-ache already? */ |
fbb9ce953 [PATCH] lockdep: ... |
3059 3060 |
if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) return 0; |
1704f47b5 lockdep: Add nova... |
3061 3062 |
if (lock->key == &__lockdep_no_validate__) check = 1; |
620162505 lockdep: Add impr... |
3063 3064 |
if (subclass < NR_LOCKDEP_CACHING_CLASSES) class = lock->class_cache[subclass]; |
d6d897cec [PATCH] lockdep: ... |
3065 |
/* |
620162505 lockdep: Add impr... |
3066 |
* Not cached? |
d6d897cec [PATCH] lockdep: ... |
3067 |
*/ |
fbb9ce953 [PATCH] lockdep: ... |
3068 |
if (unlikely(!class)) { |
4dfbb9d8c Lockdep: add lock... |
3069 |
class = register_lock_class(lock, subclass, 0); |
fbb9ce953 [PATCH] lockdep: ... |
3070 3071 3072 |
if (!class) return 0; } |
bd6d29c25 lockstat: Make lo... |
3073 |
atomic_inc((atomic_t *)&class->ops); |
fbb9ce953 [PATCH] lockdep: ... |
3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 |
if (very_verbose(class)) { printk(" acquire class [%p] %s", class->key, class->name); if (class->name_version > 1) printk("#%d", class->name_version); printk(" "); dump_stack(); } /* * Add the lock to the list of currently held locks. * (we dont increase the depth just yet, up until the * dependency checks are done) */ depth = curr->lockdep_depth; |
0119fee44 lockdep: Comment ... |
3090 3091 3092 |
/* * Ran out of static storage for our per-task lock stack again have we? */ |
fbb9ce953 [PATCH] lockdep: ... |
3093 3094 |
if (DEBUG_LOCKS_WARN_ON(depth >= MAX_LOCK_DEPTH)) return 0; |
bb97a91e2 lockdep: Deal wit... |
3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 |
class_idx = class - lock_classes + 1; if (depth) { hlock = curr->held_locks + depth - 1; if (hlock->class_idx == class_idx && nest_lock) { if (hlock->references) hlock->references++; else hlock->references = 2; return 1; } } |
fbb9ce953 [PATCH] lockdep: ... |
3108 |
hlock = curr->held_locks + depth; |
0119fee44 lockdep: Comment ... |
3109 3110 3111 3112 |
/* * Plain impossible, we just registered it and checked it weren't no * NULL like.. I bet this mushroom I ate was good! */ |
f82b217e3 lockdep: shrink h... |
3113 3114 |
if (DEBUG_LOCKS_WARN_ON(!class)) return 0; |
bb97a91e2 lockdep: Deal wit... |
3115 |
hlock->class_idx = class_idx; |
fbb9ce953 [PATCH] lockdep: ... |
3116 3117 |
hlock->acquire_ip = ip; hlock->instance = lock; |
7531e2f34 lockdep: lock pro... |
3118 |
hlock->nest_lock = nest_lock; |
fbb9ce953 [PATCH] lockdep: ... |
3119 3120 3121 |
hlock->trylock = trylock; hlock->read = read; hlock->check = check; |
6951b12a0 lockdep: fix spur... |
3122 |
hlock->hardirqs_off = !!hardirqs_off; |
bb97a91e2 lockdep: Deal wit... |
3123 |
hlock->references = references; |
f20786ff4 lockstat: core in... |
3124 3125 |
#ifdef CONFIG_LOCK_STAT hlock->waittime_stamp = 0; |
3365e7798 lockdep: Use cpu_... |
3126 |
hlock->holdtime_stamp = lockstat_clock(); |
f20786ff4 lockstat: core in... |
3127 |
#endif |
fbb9ce953 [PATCH] lockdep: ... |
3128 |
|
8e18257d2 lockdep: reduce t... |
3129 3130 |
if (check == 2 && !mark_irqflags(curr, hlock)) return 0; |
fbb9ce953 [PATCH] lockdep: ... |
3131 |
/* mark it as used: */ |
4ff773bbd lockdep: removed ... |
3132 |
if (!mark_lock(curr, hlock, LOCK_USED)) |
fbb9ce953 [PATCH] lockdep: ... |
3133 |
return 0; |
8e18257d2 lockdep: reduce t... |
3134 |
|
fbb9ce953 [PATCH] lockdep: ... |
3135 |
/* |
17aacfb9c lockdep: fix a ty... |
3136 |
* Calculate the chain hash: it's the combined hash of all the |
fbb9ce953 [PATCH] lockdep: ... |
3137 3138 3139 3140 3141 3142 3143 3144 3145 |
* lock keys along the dependency chain. We save the hash value * at every step so that we can get the current hash easily * after unlock. The chain hash is then used to cache dependency * results. * * The 'key ID' is what is the most compact key value to drive * the hash, not class->key. */ id = class - lock_classes; |
0119fee44 lockdep: Comment ... |
3146 3147 3148 |
/* * Whoops, we did it again.. ran straight out of our static allocation. */ |
fbb9ce953 [PATCH] lockdep: ... |
3149 3150 3151 3152 3153 |
if (DEBUG_LOCKS_WARN_ON(id >= MAX_LOCKDEP_KEYS)) return 0; chain_key = curr->curr_chain_key; if (!depth) { |
0119fee44 lockdep: Comment ... |
3154 3155 3156 |
/* * How can we have a chain hash when we ain't got no keys?! */ |
fbb9ce953 [PATCH] lockdep: ... |
3157 3158 3159 3160 3161 3162 |
if (DEBUG_LOCKS_WARN_ON(chain_key != 0)) return 0; chain_head = 1; } hlock->prev_chain_key = chain_key; |
8e18257d2 lockdep: reduce t... |
3163 3164 3165 |
if (separate_irq_context(curr, hlock)) { chain_key = 0; chain_head = 1; |
fbb9ce953 [PATCH] lockdep: ... |
3166 |
} |
fbb9ce953 [PATCH] lockdep: ... |
3167 |
chain_key = iterate_chain_key(chain_key, id); |
fbb9ce953 [PATCH] lockdep: ... |
3168 |
|
3aa416b07 lockdep: fix mism... |
3169 |
if (!validate_chain(curr, lock, hlock, chain_head, chain_key)) |
8e18257d2 lockdep: reduce t... |
3170 |
return 0; |
381a22920 [PATCH] lockdep: ... |
3171 |
|
3aa416b07 lockdep: fix mism... |
3172 |
curr->curr_chain_key = chain_key; |
fbb9ce953 [PATCH] lockdep: ... |
3173 3174 |
curr->lockdep_depth++; check_chain_key(curr); |
60e114d11 [PATCH] lockdep: ... |
3175 3176 3177 3178 |
#ifdef CONFIG_DEBUG_LOCKDEP if (unlikely(!debug_locks)) return 0; #endif |
fbb9ce953 [PATCH] lockdep: ... |
3179 3180 3181 3182 3183 3184 |
if (unlikely(curr->lockdep_depth >= MAX_LOCK_DEPTH)) { debug_locks_off(); printk("BUG: MAX_LOCK_DEPTH too low! "); printk("turning off the locking correctness validator. "); |
eedeeabde lockdep: add stac... |
3185 |
dump_stack(); |
fbb9ce953 [PATCH] lockdep: ... |
3186 3187 |
return 0; } |
381a22920 [PATCH] lockdep: ... |
3188 |
|
fbb9ce953 [PATCH] lockdep: ... |
3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 |
if (unlikely(curr->lockdep_depth > max_lockdep_depth)) max_lockdep_depth = curr->lockdep_depth; return 1; } static int print_unlock_inbalance_bug(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) { if (!debug_locks_off()) return 0; if (debug_locks_silent) return 0; |
b3fbab057 rcu: Restore chec... |
3203 3204 3205 3206 3207 3208 3209 3210 |
printk(" "); printk("===================================== "); printk("[ BUG: bad unlock balance detected! ] "); printk("------------------------------------- "); |
fbb9ce953 [PATCH] lockdep: ... |
3211 |
printk("%s/%d is trying to release lock (", |
ba25f9dcc Use helpers to ob... |
3212 |
curr->comm, task_pid_nr(curr)); |
fbb9ce953 [PATCH] lockdep: ... |
3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 |
print_lockdep_cache(lock); printk(") at: "); print_ip_sym(ip); printk("but there are no more locks to release! "); printk(" other info that might help us debug this: "); lockdep_print_held_locks(curr); printk(" stack backtrace: "); dump_stack(); return 0; } /* * Common debugging checks for both nested and non-nested unlock: */ static int check_unlock(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) { if (unlikely(!debug_locks)) return 0; |
0119fee44 lockdep: Comment ... |
3240 3241 3242 |
/* * Lockdep should run with IRQs disabled, recursion, head-ache, etc.. */ |
fbb9ce953 [PATCH] lockdep: ... |
3243 3244 3245 3246 3247 3248 3249 3250 |
if (DEBUG_LOCKS_WARN_ON(!irqs_disabled())) return 0; if (curr->lockdep_depth <= 0) return print_unlock_inbalance_bug(curr, lock, ip); return 1; } |
bb97a91e2 lockdep: Deal wit... |
3251 3252 3253 3254 3255 3256 |
static int match_held_lock(struct held_lock *hlock, struct lockdep_map *lock) { if (hlock->instance == lock) return 1; if (hlock->references) { |
620162505 lockdep: Add impr... |
3257 |
struct lock_class *class = lock->class_cache[0]; |
bb97a91e2 lockdep: Deal wit... |
3258 3259 3260 |
if (!class) class = look_up_lock_class(lock, 0); |
80e0401e3 lockdep: Fix wron... |
3261 3262 3263 3264 3265 3266 3267 |
/* * If look_up_lock_class() failed to find a class, we're trying * to test if we hold a lock that has never yet been acquired. * Clearly if the lock hasn't been acquired _ever_, we're not * holding it either, so report failure. */ if (!class) |
bb97a91e2 lockdep: Deal wit... |
3268 |
return 0; |
0119fee44 lockdep: Comment ... |
3269 3270 3271 3272 3273 |
/* * References, but not a lock we're actually ref-counting? * State got messed up, follow the sites that change ->references * and try to make sense of it. */ |
bb97a91e2 lockdep: Deal wit... |
3274 3275 3276 3277 3278 3279 3280 3281 3282 |
if (DEBUG_LOCKS_WARN_ON(!hlock->nest_lock)) return 0; if (hlock->class_idx == class - lock_classes + 1) return 1; } return 0; } |
64aa348ed lockdep: lock_set... |
3283 |
static int |
00ef9f734 lockdep: change a... |
3284 3285 3286 |
__lock_set_class(struct lockdep_map *lock, const char *name, struct lock_class_key *key, unsigned int subclass, unsigned long ip) |
64aa348ed lockdep: lock_set... |
3287 3288 3289 3290 3291 3292 3293 3294 |
{ struct task_struct *curr = current; struct held_lock *hlock, *prev_hlock; struct lock_class *class; unsigned int depth; int i; depth = curr->lockdep_depth; |
0119fee44 lockdep: Comment ... |
3295 3296 3297 3298 |
/* * This function is about (re)setting the class of a held lock, * yet we're not actually holding any locks. Naughty user! */ |
64aa348ed lockdep: lock_set... |
3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 |
if (DEBUG_LOCKS_WARN_ON(!depth)) return 0; prev_hlock = NULL; for (i = depth-1; i >= 0; i--) { hlock = curr->held_locks + i; /* * We must not cross into another context: */ if (prev_hlock && prev_hlock->irq_context != hlock->irq_context) break; |
bb97a91e2 lockdep: Deal wit... |
3310 |
if (match_held_lock(hlock, lock)) |
64aa348ed lockdep: lock_set... |
3311 3312 3313 3314 3315 3316 |
goto found_it; prev_hlock = hlock; } return print_unlock_inbalance_bug(curr, lock, ip); found_it: |
00ef9f734 lockdep: change a... |
3317 |
lockdep_init_map(lock, name, key, 0); |
64aa348ed lockdep: lock_set... |
3318 |
class = register_lock_class(lock, subclass, 0); |
f82b217e3 lockdep: shrink h... |
3319 |
hlock->class_idx = class - lock_classes + 1; |
64aa348ed lockdep: lock_set... |
3320 3321 3322 3323 3324 3325 3326 |
curr->lockdep_depth = i; curr->curr_chain_key = hlock->prev_chain_key; for (; i < depth; i++) { hlock = curr->held_locks + i; if (!__lock_acquire(hlock->instance, |
f82b217e3 lockdep: shrink h... |
3327 |
hlock_class(hlock)->subclass, hlock->trylock, |
64aa348ed lockdep: lock_set... |
3328 |
hlock->read, hlock->check, hlock->hardirqs_off, |
bb97a91e2 lockdep: Deal wit... |
3329 3330 |
hlock->nest_lock, hlock->acquire_ip, hlock->references)) |
64aa348ed lockdep: lock_set... |
3331 3332 |
return 0; } |
0119fee44 lockdep: Comment ... |
3333 3334 3335 3336 |
/* * I took it apart and put it back together again, except now I have * these 'spare' parts.. where shall I put them. */ |
64aa348ed lockdep: lock_set... |
3337 3338 3339 3340 |
if (DEBUG_LOCKS_WARN_ON(curr->lockdep_depth != depth)) return 0; return 1; } |
fbb9ce953 [PATCH] lockdep: ... |
3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 |
/* * Remove the lock to the list of currently held locks in a * potentially non-nested (out of order) manner. This is a * relatively rare operation, as all the unlock APIs default * to nested mode (which uses lock_release()): */ static int lock_release_non_nested(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) { struct held_lock *hlock, *prev_hlock; unsigned int depth; int i; /* * Check whether the lock exists in the current stack * of held locks: */ depth = curr->lockdep_depth; |
0119fee44 lockdep: Comment ... |
3360 3361 3362 3363 |
/* * So we're all set to release this lock.. wait what lock? We don't * own any locks, you've been drinking again? */ |
fbb9ce953 [PATCH] lockdep: ... |
3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 |
if (DEBUG_LOCKS_WARN_ON(!depth)) return 0; prev_hlock = NULL; for (i = depth-1; i >= 0; i--) { hlock = curr->held_locks + i; /* * We must not cross into another context: */ if (prev_hlock && prev_hlock->irq_context != hlock->irq_context) break; |
bb97a91e2 lockdep: Deal wit... |
3375 |
if (match_held_lock(hlock, lock)) |
fbb9ce953 [PATCH] lockdep: ... |
3376 3377 3378 3379 3380 3381 |
goto found_it; prev_hlock = hlock; } return print_unlock_inbalance_bug(curr, lock, ip); found_it: |
bb97a91e2 lockdep: Deal wit... |
3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 |
if (hlock->instance == lock) lock_release_holdtime(hlock); if (hlock->references) { hlock->references--; if (hlock->references) { /* * We had, and after removing one, still have * references, the current lock stack is still * valid. We're done! */ return 1; } } |
f20786ff4 lockstat: core in... |
3396 |
|
fbb9ce953 [PATCH] lockdep: ... |
3397 3398 3399 3400 3401 |
/* * We have the right lock to unlock, 'hlock' points to it. * Now we remove it from the stack, and add back the other * entries (if any), recalculating the hash along the way: */ |
bb97a91e2 lockdep: Deal wit... |
3402 |
|
fbb9ce953 [PATCH] lockdep: ... |
3403 3404 3405 3406 3407 3408 |
curr->lockdep_depth = i; curr->curr_chain_key = hlock->prev_chain_key; for (i++; i < depth; i++) { hlock = curr->held_locks + i; if (!__lock_acquire(hlock->instance, |
f82b217e3 lockdep: shrink h... |
3409 |
hlock_class(hlock)->subclass, hlock->trylock, |
fbb9ce953 [PATCH] lockdep: ... |
3410 |
hlock->read, hlock->check, hlock->hardirqs_off, |
bb97a91e2 lockdep: Deal wit... |
3411 3412 |
hlock->nest_lock, hlock->acquire_ip, hlock->references)) |
fbb9ce953 [PATCH] lockdep: ... |
3413 3414 |
return 0; } |
0119fee44 lockdep: Comment ... |
3415 3416 3417 3418 |
/* * We had N bottles of beer on the wall, we drank one, but now * there's not N-1 bottles of beer left on the wall... */ |
fbb9ce953 [PATCH] lockdep: ... |
3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 |
if (DEBUG_LOCKS_WARN_ON(curr->lockdep_depth != depth - 1)) return 0; return 1; } /* * Remove the lock to the list of currently held locks - this gets * called on mutex_unlock()/spin_unlock*() (or on a failed * mutex_lock_interruptible()). This is done for unlocks that nest * perfectly. (i.e. the current top of the lock-stack is unlocked) */ static int lock_release_nested(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) { struct held_lock *hlock; unsigned int depth; /* * Pop off the top of the lock stack: */ depth = curr->lockdep_depth - 1; hlock = curr->held_locks + depth; /* * Is the unlock non-nested: */ |
bb97a91e2 lockdep: Deal wit... |
3445 |
if (hlock->instance != lock || hlock->references) |
fbb9ce953 [PATCH] lockdep: ... |
3446 3447 |
return lock_release_non_nested(curr, lock, ip); curr->lockdep_depth--; |
0119fee44 lockdep: Comment ... |
3448 3449 3450 |
/* * No more locks, but somehow we've got hash left over, who left it? */ |
fbb9ce953 [PATCH] lockdep: ... |
3451 3452 3453 3454 |
if (DEBUG_LOCKS_WARN_ON(!depth && (hlock->prev_chain_key != 0))) return 0; curr->curr_chain_key = hlock->prev_chain_key; |
f20786ff4 lockstat: core in... |
3455 |
lock_release_holdtime(hlock); |
fbb9ce953 [PATCH] lockdep: ... |
3456 3457 |
#ifdef CONFIG_DEBUG_LOCKDEP hlock->prev_chain_key = 0; |
f82b217e3 lockdep: shrink h... |
3458 |
hlock->class_idx = 0; |
fbb9ce953 [PATCH] lockdep: ... |
3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 |
hlock->acquire_ip = 0; hlock->irq_context = 0; #endif return 1; } /* * Remove the lock to the list of currently held locks - this gets * called on mutex_unlock()/spin_unlock*() (or on a failed * mutex_lock_interruptible()). This is done for unlocks that nest * perfectly. (i.e. the current top of the lock-stack is unlocked) */ static void __lock_release(struct lockdep_map *lock, int nested, unsigned long ip) { struct task_struct *curr = current; if (!check_unlock(curr, lock, ip)) return; if (nested) { if (!lock_release_nested(curr, lock, ip)) return; } else { if (!lock_release_non_nested(curr, lock, ip)) return; } check_chain_key(curr); } |
f607c6685 lockdep: Introduc... |
3489 3490 3491 3492 3493 3494 |
static int __lock_is_held(struct lockdep_map *lock) { struct task_struct *curr = current; int i; for (i = 0; i < curr->lockdep_depth; i++) { |
bb97a91e2 lockdep: Deal wit... |
3495 3496 3497 |
struct held_lock *hlock = curr->held_locks + i; if (match_held_lock(hlock, lock)) |
f607c6685 lockdep: Introduc... |
3498 3499 3500 3501 3502 |
return 1; } return 0; } |
fbb9ce953 [PATCH] lockdep: ... |
3503 3504 3505 |
/* * Check whether we follow the irq-flags state precisely: */ |
1d09daa55 ftrace: use Makef... |
3506 |
static void check_flags(unsigned long flags) |
fbb9ce953 [PATCH] lockdep: ... |
3507 |
{ |
992860e99 lockdep: fix ftra... |
3508 3509 |
#if defined(CONFIG_PROVE_LOCKING) && defined(CONFIG_DEBUG_LOCKDEP) && \ defined(CONFIG_TRACE_IRQFLAGS) |
fbb9ce953 [PATCH] lockdep: ... |
3510 3511 |
if (!debug_locks) return; |
5f9fa8a62 lockdep: make cli... |
3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 |
if (irqs_disabled_flags(flags)) { if (DEBUG_LOCKS_WARN_ON(current->hardirqs_enabled)) { printk("possible reason: unannotated irqs-off. "); } } else { if (DEBUG_LOCKS_WARN_ON(!current->hardirqs_enabled)) { printk("possible reason: unannotated irqs-on. "); } } |
fbb9ce953 [PATCH] lockdep: ... |
3523 3524 3525 3526 3527 3528 3529 |
/* * We dont accurately track softirq state in e.g. * hardirq contexts (such as on 4KSTACKS), so only * check if not in hardirq contexts: */ if (!hardirq_count()) { |
0119fee44 lockdep: Comment ... |
3530 3531 |
if (softirq_count()) { /* like the above, but with softirqs */ |
fbb9ce953 [PATCH] lockdep: ... |
3532 |
DEBUG_LOCKS_WARN_ON(current->softirqs_enabled); |
0119fee44 lockdep: Comment ... |
3533 3534 |
} else { /* lick the above, does it taste good? */ |
fbb9ce953 [PATCH] lockdep: ... |
3535 |
DEBUG_LOCKS_WARN_ON(!current->softirqs_enabled); |
0119fee44 lockdep: Comment ... |
3536 |
} |
fbb9ce953 [PATCH] lockdep: ... |
3537 3538 3539 3540 3541 3542 |
} if (!debug_locks) print_irqtrace_events(current); #endif } |
00ef9f734 lockdep: change a... |
3543 3544 3545 |
void lock_set_class(struct lockdep_map *lock, const char *name, struct lock_class_key *key, unsigned int subclass, unsigned long ip) |
64aa348ed lockdep: lock_set... |
3546 3547 3548 3549 3550 3551 3552 3553 3554 |
{ unsigned long flags; if (unlikely(current->lockdep_recursion)) return; raw_local_irq_save(flags); current->lockdep_recursion = 1; check_flags(flags); |
00ef9f734 lockdep: change a... |
3555 |
if (__lock_set_class(lock, name, key, subclass, ip)) |
64aa348ed lockdep: lock_set... |
3556 3557 3558 3559 |
check_chain_key(current); current->lockdep_recursion = 0; raw_local_irq_restore(flags); } |
00ef9f734 lockdep: change a... |
3560 |
EXPORT_SYMBOL_GPL(lock_set_class); |
64aa348ed lockdep: lock_set... |
3561 |
|
fbb9ce953 [PATCH] lockdep: ... |
3562 3563 3564 3565 |
/* * We are not always called with irqs disabled - do that here, * and also avoid lockdep recursion: */ |
1d09daa55 ftrace: use Makef... |
3566 |
void lock_acquire(struct lockdep_map *lock, unsigned int subclass, |
7531e2f34 lockdep: lock pro... |
3567 3568 |
int trylock, int read, int check, struct lockdep_map *nest_lock, unsigned long ip) |
fbb9ce953 [PATCH] lockdep: ... |
3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 |
{ unsigned long flags; if (unlikely(current->lockdep_recursion)) return; raw_local_irq_save(flags); check_flags(flags); current->lockdep_recursion = 1; |
db2c4c779 lockdep: Move loc... |
3579 |
trace_lock_acquire(lock, subclass, trylock, read, check, nest_lock, ip); |
fbb9ce953 [PATCH] lockdep: ... |
3580 |
__lock_acquire(lock, subclass, trylock, read, check, |
bb97a91e2 lockdep: Deal wit... |
3581 |
irqs_disabled_flags(flags), nest_lock, ip, 0); |
fbb9ce953 [PATCH] lockdep: ... |
3582 3583 3584 |
current->lockdep_recursion = 0; raw_local_irq_restore(flags); } |
fbb9ce953 [PATCH] lockdep: ... |
3585 |
EXPORT_SYMBOL_GPL(lock_acquire); |
1d09daa55 ftrace: use Makef... |
3586 |
void lock_release(struct lockdep_map *lock, int nested, |
0764d23cf ftrace: lockdep n... |
3587 |
unsigned long ip) |
fbb9ce953 [PATCH] lockdep: ... |
3588 3589 3590 3591 3592 3593 3594 3595 3596 |
{ unsigned long flags; if (unlikely(current->lockdep_recursion)) return; raw_local_irq_save(flags); check_flags(flags); current->lockdep_recursion = 1; |
931354394 tracing: Drop the... |
3597 |
trace_lock_release(lock, ip); |
fbb9ce953 [PATCH] lockdep: ... |
3598 3599 3600 3601 |
__lock_release(lock, nested, ip); current->lockdep_recursion = 0; raw_local_irq_restore(flags); } |
fbb9ce953 [PATCH] lockdep: ... |
3602 |
EXPORT_SYMBOL_GPL(lock_release); |
f607c6685 lockdep: Introduc... |
3603 3604 3605 3606 3607 3608 |
int lock_is_held(struct lockdep_map *lock) { unsigned long flags; int ret = 0; if (unlikely(current->lockdep_recursion)) |
f2513cde9 lockdep: Fix lock... |
3609 |
return 1; /* avoid false negative lockdep_assert_held() */ |
f607c6685 lockdep: Introduc... |
3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 |
raw_local_irq_save(flags); check_flags(flags); current->lockdep_recursion = 1; ret = __lock_is_held(lock); current->lockdep_recursion = 0; raw_local_irq_restore(flags); return ret; } EXPORT_SYMBOL_GPL(lock_is_held); |
cf40bd16f lockdep: annotate... |
3622 3623 3624 3625 3626 3627 3628 3629 3630 |
void lockdep_set_current_reclaim_state(gfp_t gfp_mask) { current->lockdep_reclaim_gfp = gfp_mask; } void lockdep_clear_current_reclaim_state(void) { current->lockdep_reclaim_gfp = 0; } |
f20786ff4 lockstat: core in... |
3631 3632 3633 3634 3635 3636 3637 3638 3639 |
#ifdef CONFIG_LOCK_STAT static int print_lock_contention_bug(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) { if (!debug_locks_off()) return 0; if (debug_locks_silent) return 0; |
b3fbab057 rcu: Restore chec... |
3640 3641 3642 3643 3644 3645 3646 3647 |
printk(" "); printk("================================= "); printk("[ BUG: bad contention detected! ] "); printk("--------------------------------- "); |
f20786ff4 lockstat: core in... |
3648 |
printk("%s/%d is trying to contend lock (", |
ba25f9dcc Use helpers to ob... |
3649 |
curr->comm, task_pid_nr(curr)); |
f20786ff4 lockstat: core in... |
3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 |
print_lockdep_cache(lock); printk(") at: "); print_ip_sym(ip); printk("but there are no locks held! "); printk(" other info that might help us debug this: "); lockdep_print_held_locks(curr); printk(" stack backtrace: "); dump_stack(); return 0; } static void __lock_contended(struct lockdep_map *lock, unsigned long ip) { struct task_struct *curr = current; struct held_lock *hlock, *prev_hlock; struct lock_class_stats *stats; unsigned int depth; |
c7e78cff6 lockstat: contend... |
3676 |
int i, contention_point, contending_point; |
f20786ff4 lockstat: core in... |
3677 3678 |
depth = curr->lockdep_depth; |
0119fee44 lockdep: Comment ... |
3679 3680 3681 3682 |
/* * Whee, we contended on this lock, except it seems we're not * actually trying to acquire anything much at all.. */ |
f20786ff4 lockstat: core in... |
3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 |
if (DEBUG_LOCKS_WARN_ON(!depth)) return; prev_hlock = NULL; for (i = depth-1; i >= 0; i--) { hlock = curr->held_locks + i; /* * We must not cross into another context: */ if (prev_hlock && prev_hlock->irq_context != hlock->irq_context) break; |
bb97a91e2 lockdep: Deal wit... |
3694 |
if (match_held_lock(hlock, lock)) |
f20786ff4 lockstat: core in... |
3695 3696 3697 3698 3699 3700 3701 |
goto found_it; prev_hlock = hlock; } print_lock_contention_bug(curr, lock, ip); return; found_it: |
bb97a91e2 lockdep: Deal wit... |
3702 3703 |
if (hlock->instance != lock) return; |
3365e7798 lockdep: Use cpu_... |
3704 |
hlock->waittime_stamp = lockstat_clock(); |
f20786ff4 lockstat: core in... |
3705 |
|
c7e78cff6 lockstat: contend... |
3706 3707 3708 |
contention_point = lock_point(hlock_class(hlock)->contention_point, ip); contending_point = lock_point(hlock_class(hlock)->contending_point, lock->ip); |
f20786ff4 lockstat: core in... |
3709 |
|
f82b217e3 lockdep: shrink h... |
3710 |
stats = get_lock_stats(hlock_class(hlock)); |
c7e78cff6 lockstat: contend... |
3711 3712 3713 3714 |
if (contention_point < LOCKSTAT_POINTS) stats->contention_point[contention_point]++; if (contending_point < LOCKSTAT_POINTS) stats->contending_point[contending_point]++; |
96645678c lockstat: measure... |
3715 3716 |
if (lock->cpu != smp_processor_id()) stats->bounces[bounce_contended + !!hlock->read]++; |
f20786ff4 lockstat: core in... |
3717 3718 3719 3720 |
put_lock_stats(stats); } static void |
c7e78cff6 lockstat: contend... |
3721 |
__lock_acquired(struct lockdep_map *lock, unsigned long ip) |
f20786ff4 lockstat: core in... |
3722 3723 3724 3725 3726 |
{ struct task_struct *curr = current; struct held_lock *hlock, *prev_hlock; struct lock_class_stats *stats; unsigned int depth; |
3365e7798 lockdep: Use cpu_... |
3727 |
u64 now, waittime = 0; |
96645678c lockstat: measure... |
3728 |
int i, cpu; |
f20786ff4 lockstat: core in... |
3729 3730 |
depth = curr->lockdep_depth; |
0119fee44 lockdep: Comment ... |
3731 3732 3733 3734 |
/* * Yay, we acquired ownership of this lock we didn't try to * acquire, how the heck did that happen? */ |
f20786ff4 lockstat: core in... |
3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 |
if (DEBUG_LOCKS_WARN_ON(!depth)) return; prev_hlock = NULL; for (i = depth-1; i >= 0; i--) { hlock = curr->held_locks + i; /* * We must not cross into another context: */ if (prev_hlock && prev_hlock->irq_context != hlock->irq_context) break; |
bb97a91e2 lockdep: Deal wit... |
3746 |
if (match_held_lock(hlock, lock)) |
f20786ff4 lockstat: core in... |
3747 3748 3749 3750 3751 3752 3753 |
goto found_it; prev_hlock = hlock; } print_lock_contention_bug(curr, lock, _RET_IP_); return; found_it: |
bb97a91e2 lockdep: Deal wit... |
3754 3755 |
if (hlock->instance != lock) return; |
96645678c lockstat: measure... |
3756 3757 |
cpu = smp_processor_id(); if (hlock->waittime_stamp) { |
3365e7798 lockdep: Use cpu_... |
3758 |
now = lockstat_clock(); |
96645678c lockstat: measure... |
3759 3760 3761 |
waittime = now - hlock->waittime_stamp; hlock->holdtime_stamp = now; } |
f20786ff4 lockstat: core in... |
3762 |
|
883a2a318 tracing: Drop loc... |
3763 |
trace_lock_acquired(lock, ip); |
2062501ae tracing/lockdep: ... |
3764 |
|
f82b217e3 lockdep: shrink h... |
3765 |
stats = get_lock_stats(hlock_class(hlock)); |
96645678c lockstat: measure... |
3766 3767 3768 3769 3770 3771 3772 3773 |
if (waittime) { if (hlock->read) lock_time_inc(&stats->read_waittime, waittime); else lock_time_inc(&stats->write_waittime, waittime); } if (lock->cpu != cpu) stats->bounces[bounce_acquired + !!hlock->read]++; |
f20786ff4 lockstat: core in... |
3774 |
put_lock_stats(stats); |
96645678c lockstat: measure... |
3775 3776 |
lock->cpu = cpu; |
c7e78cff6 lockstat: contend... |
3777 |
lock->ip = ip; |
f20786ff4 lockstat: core in... |
3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 |
} void lock_contended(struct lockdep_map *lock, unsigned long ip) { unsigned long flags; if (unlikely(!lock_stat)) return; if (unlikely(current->lockdep_recursion)) return; raw_local_irq_save(flags); check_flags(flags); current->lockdep_recursion = 1; |
db2c4c779 lockdep: Move loc... |
3793 |
trace_lock_contended(lock, ip); |
f20786ff4 lockstat: core in... |
3794 3795 3796 3797 3798 |
__lock_contended(lock, ip); current->lockdep_recursion = 0; raw_local_irq_restore(flags); } EXPORT_SYMBOL_GPL(lock_contended); |
c7e78cff6 lockstat: contend... |
3799 |
void lock_acquired(struct lockdep_map *lock, unsigned long ip) |
f20786ff4 lockstat: core in... |
3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 |
{ unsigned long flags; if (unlikely(!lock_stat)) return; if (unlikely(current->lockdep_recursion)) return; raw_local_irq_save(flags); check_flags(flags); current->lockdep_recursion = 1; |
c7e78cff6 lockstat: contend... |
3812 |
__lock_acquired(lock, ip); |
f20786ff4 lockstat: core in... |
3813 3814 3815 3816 3817 |
current->lockdep_recursion = 0; raw_local_irq_restore(flags); } EXPORT_SYMBOL_GPL(lock_acquired); #endif |
fbb9ce953 [PATCH] lockdep: ... |
3818 3819 3820 3821 3822 3823 3824 3825 |
/* * Used by the testsuite, sanitize the validator state * after a simulated failure: */ void lockdep_reset(void) { unsigned long flags; |
23d95a03d [PATCH] lockdep: ... |
3826 |
int i; |
fbb9ce953 [PATCH] lockdep: ... |
3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 |
raw_local_irq_save(flags); current->curr_chain_key = 0; current->lockdep_depth = 0; current->lockdep_recursion = 0; memset(current->held_locks, 0, MAX_LOCK_DEPTH*sizeof(struct held_lock)); nr_hardirq_chains = 0; nr_softirq_chains = 0; nr_process_chains = 0; debug_locks = 1; |
23d95a03d [PATCH] lockdep: ... |
3837 3838 |
for (i = 0; i < CHAINHASH_SIZE; i++) INIT_LIST_HEAD(chainhash_table + i); |
fbb9ce953 [PATCH] lockdep: ... |
3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 |
raw_local_irq_restore(flags); } static void zap_class(struct lock_class *class) { int i; /* * Remove all dependencies this lock is * involved in: */ for (i = 0; i < nr_list_entries; i++) { if (list_entries[i].class == class) list_del_rcu(&list_entries[i].entry); } /* * Unhash the class and remove it from the all_lock_classes list: */ list_del_rcu(&class->hash_entry); list_del_rcu(&class->lock_entry); |
8bfe0298f lockdep: handle c... |
3859 |
class->key = NULL; |
fbb9ce953 [PATCH] lockdep: ... |
3860 |
} |
fabe874a4 lockdep: fix kern... |
3861 |
static inline int within(const void *addr, void *start, unsigned long size) |
fbb9ce953 [PATCH] lockdep: ... |
3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 |
{ return addr >= start && addr < start + size; } void lockdep_free_key_range(void *start, unsigned long size) { struct lock_class *class, *next; struct list_head *head; unsigned long flags; int i; |
5a26db5bd lockdep: fix inte... |
3872 |
int locked; |
fbb9ce953 [PATCH] lockdep: ... |
3873 3874 |
raw_local_irq_save(flags); |
5a26db5bd lockdep: fix inte... |
3875 |
locked = graph_lock(); |
fbb9ce953 [PATCH] lockdep: ... |
3876 3877 3878 3879 3880 3881 3882 3883 |
/* * Unhash all classes that were created by this module: */ for (i = 0; i < CLASSHASH_SIZE; i++) { head = classhash_table + i; if (list_empty(head)) continue; |
fabe874a4 lockdep: fix kern... |
3884 |
list_for_each_entry_safe(class, next, head, hash_entry) { |
fbb9ce953 [PATCH] lockdep: ... |
3885 3886 |
if (within(class->key, start, size)) zap_class(class); |
fabe874a4 lockdep: fix kern... |
3887 3888 3889 |
else if (within(class->name, start, size)) zap_class(class); } |
fbb9ce953 [PATCH] lockdep: ... |
3890 |
} |
5a26db5bd lockdep: fix inte... |
3891 3892 |
if (locked) graph_unlock(); |
fbb9ce953 [PATCH] lockdep: ... |
3893 3894 3895 3896 3897 |
raw_local_irq_restore(flags); } void lockdep_reset_lock(struct lockdep_map *lock) { |
d6d897cec [PATCH] lockdep: ... |
3898 |
struct lock_class *class, *next; |
fbb9ce953 [PATCH] lockdep: ... |
3899 3900 3901 |
struct list_head *head; unsigned long flags; int i, j; |
5a26db5bd lockdep: fix inte... |
3902 |
int locked; |
fbb9ce953 [PATCH] lockdep: ... |
3903 3904 |
raw_local_irq_save(flags); |
fbb9ce953 [PATCH] lockdep: ... |
3905 3906 |
/* |
d6d897cec [PATCH] lockdep: ... |
3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 |
* Remove all classes this lock might have: */ for (j = 0; j < MAX_LOCKDEP_SUBCLASSES; j++) { /* * If the class exists we look it up and zap it: */ class = look_up_lock_class(lock, j); if (class) zap_class(class); } /* * Debug check: in the end all mapped classes should * be gone. |
fbb9ce953 [PATCH] lockdep: ... |
3920 |
*/ |
5a26db5bd lockdep: fix inte... |
3921 |
locked = graph_lock(); |
fbb9ce953 [PATCH] lockdep: ... |
3922 3923 3924 3925 3926 |
for (i = 0; i < CLASSHASH_SIZE; i++) { head = classhash_table + i; if (list_empty(head)) continue; list_for_each_entry_safe(class, next, head, hash_entry) { |
620162505 lockdep: Add impr... |
3927 3928 3929 3930 3931 3932 |
int match = 0; for (j = 0; j < NR_LOCKDEP_CACHING_CLASSES; j++) match |= class == lock->class_cache[j]; if (unlikely(match)) { |
0119fee44 lockdep: Comment ... |
3933 3934 3935 3936 |
if (debug_locks_off_graph_unlock()) { /* * We all just reset everything, how did it match? */ |
74c383f14 [PATCH] lockdep: ... |
3937 |
WARN_ON(1); |
0119fee44 lockdep: Comment ... |
3938 |
} |
d6d897cec [PATCH] lockdep: ... |
3939 |
goto out_restore; |
fbb9ce953 [PATCH] lockdep: ... |
3940 3941 3942 |
} } } |
5a26db5bd lockdep: fix inte... |
3943 3944 |
if (locked) graph_unlock(); |
d6d897cec [PATCH] lockdep: ... |
3945 3946 |
out_restore: |
fbb9ce953 [PATCH] lockdep: ... |
3947 3948 |
raw_local_irq_restore(flags); } |
1499993cc [PATCH] fix secti... |
3949 |
void lockdep_init(void) |
fbb9ce953 [PATCH] lockdep: ... |
3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 |
{ int i; /* * Some architectures have their own start_kernel() * code which calls lockdep_init(), while we also * call lockdep_init() from the start_kernel() itself, * and we want to initialize the hashes only once: */ if (lockdep_initialized) return; for (i = 0; i < CLASSHASH_SIZE; i++) INIT_LIST_HEAD(classhash_table + i); for (i = 0; i < CHAINHASH_SIZE; i++) INIT_LIST_HEAD(chainhash_table + i); lockdep_initialized = 1; } void __init lockdep_info(void) { printk("Lock dependency validator: Copyright (c) 2006 Red Hat, Inc., Ingo Molnar "); |
b0788caf7 lockdep: consiste... |
3975 3976 |
printk("... MAX_LOCKDEP_SUBCLASSES: %lu ", MAX_LOCKDEP_SUBCLASSES); |
fbb9ce953 [PATCH] lockdep: ... |
3977 3978 3979 3980 |
printk("... MAX_LOCK_DEPTH: %lu ", MAX_LOCK_DEPTH); printk("... MAX_LOCKDEP_KEYS: %lu ", MAX_LOCKDEP_KEYS); |
b0788caf7 lockdep: consiste... |
3981 3982 |
printk("... CLASSHASH_SIZE: %lu ", CLASSHASH_SIZE); |
fbb9ce953 [PATCH] lockdep: ... |
3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 |
printk("... MAX_LOCKDEP_ENTRIES: %lu ", MAX_LOCKDEP_ENTRIES); printk("... MAX_LOCKDEP_CHAINS: %lu ", MAX_LOCKDEP_CHAINS); printk("... CHAINHASH_SIZE: %lu ", CHAINHASH_SIZE); printk(" memory used by lock dependency info: %lu kB ", (sizeof(struct lock_class) * MAX_LOCKDEP_KEYS + sizeof(struct list_head) * CLASSHASH_SIZE + sizeof(struct lock_list) * MAX_LOCKDEP_ENTRIES + sizeof(struct lock_chain) * MAX_LOCKDEP_CHAINS + |
90629209a lockdep: Fix memo... |
3996 |
sizeof(struct list_head) * CHAINHASH_SIZE |
4dd861d64 lockdep: Update m... |
3997 |
#ifdef CONFIG_PROVE_LOCKING |
e351b660f lockdep: Reintrod... |
3998 |
+ sizeof(struct circular_queue) |
4dd861d64 lockdep: Update m... |
3999 |
#endif |
90629209a lockdep: Fix memo... |
4000 |
) / 1024 |
4dd861d64 lockdep: Update m... |
4001 |
); |
fbb9ce953 [PATCH] lockdep: ... |
4002 4003 4004 4005 4006 4007 |
printk(" per task-struct memory footprint: %lu bytes ", sizeof(struct held_lock) * MAX_LOCK_DEPTH); #ifdef CONFIG_DEBUG_LOCKDEP |
c71063c9c lockdep debugging... |
4008 4009 4010 4011 4012 4013 4014 |
if (lockdep_init_error) { printk("WARNING: lockdep init error! Arch code didn't call lockdep_init() early enough? "); printk("Call stack leading to lockdep invocation was: "); print_stack_trace(&lockdep_init_trace, 0); } |
fbb9ce953 [PATCH] lockdep: ... |
4015 4016 |
#endif } |
fbb9ce953 [PATCH] lockdep: ... |
4017 4018 |
static void print_freed_lock_bug(struct task_struct *curr, const void *mem_from, |
55794a412 [PATCH] lockdep: ... |
4019 |
const void *mem_to, struct held_lock *hlock) |
fbb9ce953 [PATCH] lockdep: ... |
4020 4021 4022 4023 4024 |
{ if (!debug_locks_off()) return; if (debug_locks_silent) return; |
b3fbab057 rcu: Restore chec... |
4025 4026 4027 4028 4029 4030 4031 4032 |
printk(" "); printk("========================= "); printk("[ BUG: held lock freed! ] "); printk("------------------------- "); |
fbb9ce953 [PATCH] lockdep: ... |
4033 4034 |
printk("%s/%d is freeing memory %p-%p, with a lock still held there! ", |
ba25f9dcc Use helpers to ob... |
4035 |
curr->comm, task_pid_nr(curr), mem_from, mem_to-1); |
55794a412 [PATCH] lockdep: ... |
4036 |
print_lock(hlock); |
fbb9ce953 [PATCH] lockdep: ... |
4037 4038 4039 4040 4041 4042 4043 |
lockdep_print_held_locks(curr); printk(" stack backtrace: "); dump_stack(); } |
54561783e lockdep: in_range... |
4044 4045 4046 4047 4048 4049 |
static inline int not_in_range(const void* mem_from, unsigned long mem_len, const void* lock_from, unsigned long lock_len) { return lock_from + lock_len <= mem_from || mem_from + mem_len <= lock_from; } |
fbb9ce953 [PATCH] lockdep: ... |
4050 4051 4052 4053 4054 4055 4056 |
/* * Called when kernel memory is freed (or unmapped), or if a lock * is destroyed or reinitialized - this code checks whether there is * any held lock in the memory range of <from> to <to>: */ void debug_check_no_locks_freed(const void *mem_from, unsigned long mem_len) { |
fbb9ce953 [PATCH] lockdep: ... |
4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 |
struct task_struct *curr = current; struct held_lock *hlock; unsigned long flags; int i; if (unlikely(!debug_locks)) return; local_irq_save(flags); for (i = 0; i < curr->lockdep_depth; i++) { hlock = curr->held_locks + i; |
54561783e lockdep: in_range... |
4068 4069 |
if (not_in_range(mem_from, mem_len, hlock->instance, sizeof(*hlock->instance))) |
fbb9ce953 [PATCH] lockdep: ... |
4070 |
continue; |
54561783e lockdep: in_range... |
4071 |
print_freed_lock_bug(curr, mem_from, mem_from + mem_len, hlock); |
fbb9ce953 [PATCH] lockdep: ... |
4072 4073 4074 4075 |
break; } local_irq_restore(flags); } |
ed07536ed [PATCH] lockdep: ... |
4076 |
EXPORT_SYMBOL_GPL(debug_check_no_locks_freed); |
fbb9ce953 [PATCH] lockdep: ... |
4077 4078 4079 4080 4081 4082 4083 |
static void print_held_locks_bug(struct task_struct *curr) { if (!debug_locks_off()) return; if (debug_locks_silent) return; |
b3fbab057 rcu: Restore chec... |
4084 4085 4086 4087 4088 4089 4090 4091 |
printk(" "); printk("===================================== "); printk("[ BUG: lock held at task exit time! ] "); printk("------------------------------------- "); |
fbb9ce953 [PATCH] lockdep: ... |
4092 4093 |
printk("%s/%d is exiting with locks still held! ", |
ba25f9dcc Use helpers to ob... |
4094 |
curr->comm, task_pid_nr(curr)); |
fbb9ce953 [PATCH] lockdep: ... |
4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 |
lockdep_print_held_locks(curr); printk(" stack backtrace: "); dump_stack(); } void debug_check_no_locks_held(struct task_struct *task) { if (unlikely(task->lockdep_depth > 0)) print_held_locks_bug(task); } void debug_show_all_locks(void) { struct task_struct *g, *p; int count = 10; int unlock = 1; |
9c35dd7f8 [PATCH] lockdep: ... |
4114 4115 4116 4117 4118 |
if (unlikely(!debug_locks)) { printk("INFO: lockdep is turned off. "); return; } |
fbb9ce953 [PATCH] lockdep: ... |
4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 |
printk(" Showing all locks held in the system: "); /* * Here we try to get the tasklist_lock as hard as possible, * if not successful after 2 seconds we ignore it (but keep * trying). This is to enable a debug printout even if a * tasklist_lock-holding task deadlocks or crashes. */ retry: if (!read_trylock(&tasklist_lock)) { if (count == 10) printk("hm, tasklist_lock locked, retrying... "); if (count) { count--; printk(" #%d", 10-count); mdelay(200); goto retry; } printk(" ignoring it. "); unlock = 0; |
46fec7ac4 lockdep: minor fi... |
4142 4143 4144 4145 |
} else { if (count != 10) printk(KERN_CONT " locked it. "); |
fbb9ce953 [PATCH] lockdep: ... |
4146 |
} |
fbb9ce953 [PATCH] lockdep: ... |
4147 4148 |
do_each_thread(g, p) { |
856848737 lockdep: fix debu... |
4149 4150 4151 4152 4153 4154 4155 |
/* * It's not reliable to print a task's held locks * if it's not sleeping (or if it's not the current * task): */ if (p->state == TASK_RUNNING && p != current) continue; |
fbb9ce953 [PATCH] lockdep: ... |
4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 |
if (p->lockdep_depth) lockdep_print_held_locks(p); if (!unlock) if (read_trylock(&tasklist_lock)) unlock = 1; } while_each_thread(g, p); printk(" "); printk("============================================= "); if (unlock) read_unlock(&tasklist_lock); } |
fbb9ce953 [PATCH] lockdep: ... |
4172 |
EXPORT_SYMBOL_GPL(debug_show_all_locks); |
82a1fcb90 softlockup: autom... |
4173 4174 4175 4176 |
/* * Careful: only use this function if you are sure that * the task cannot run in parallel! */ |
f1b499f02 lockdep: Remove _... |
4177 |
void debug_show_held_locks(struct task_struct *task) |
fbb9ce953 [PATCH] lockdep: ... |
4178 |
{ |
9c35dd7f8 [PATCH] lockdep: ... |
4179 4180 4181 4182 4183 |
if (unlikely(!debug_locks)) { printk("INFO: lockdep is turned off. "); return; } |
fbb9ce953 [PATCH] lockdep: ... |
4184 4185 |
lockdep_print_held_locks(task); } |
fbb9ce953 [PATCH] lockdep: ... |
4186 |
EXPORT_SYMBOL_GPL(debug_show_held_locks); |
b351d164e lockdep: syscall ... |
4187 4188 4189 4190 4191 4192 4193 4194 |
void lockdep_sys_exit(void) { struct task_struct *curr = current; if (unlikely(curr->lockdep_depth)) { if (!debug_locks_off()) return; |
b3fbab057 rcu: Restore chec... |
4195 4196 4197 4198 4199 4200 4201 4202 |
printk(" "); printk("================================================ "); printk("[ BUG: lock held when returning to user space! ] "); printk("------------------------------------------------ "); |
b351d164e lockdep: syscall ... |
4203 4204 4205 4206 4207 4208 |
printk("%s/%d is leaving the kernel with locks still held! ", curr->comm, curr->pid); lockdep_print_held_locks(curr); } } |
0632eb3d7 rcu: Integrate rc... |
4209 |
|
b3fbab057 rcu: Restore chec... |
4210 |
void lockdep_rcu_suspicious(const char *file, const int line, const char *s) |
0632eb3d7 rcu: Integrate rc... |
4211 4212 |
{ struct task_struct *curr = current; |
2b3fc35f6 rcu: optionally l... |
4213 |
#ifndef CONFIG_PROVE_RCU_REPEATEDLY |
0632eb3d7 rcu: Integrate rc... |
4214 4215 |
if (!debug_locks_off()) return; |
2b3fc35f6 rcu: optionally l... |
4216 4217 |
#endif /* #ifdef CONFIG_PROVE_RCU_REPEATEDLY */ /* Note: the following can be executed concurrently, so be careful. */ |
b3fbab057 rcu: Restore chec... |
4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 |
printk(" "); printk("=============================== "); printk("[ INFO: suspicious RCU usage. ] "); printk("------------------------------- "); printk("%s:%d %s! ", file, line, s); |
0632eb3d7 rcu: Integrate rc... |
4228 4229 4230 4231 |
printk(" other info that might help us debug this: "); |
cc5b83a9f rcu: Add control ... |
4232 4233 4234 |
printk(" rcu_scheduler_active = %d, debug_locks = %d ", rcu_scheduler_active, debug_locks); |
0632eb3d7 rcu: Integrate rc... |
4235 4236 4237 4238 4239 4240 |
lockdep_print_held_locks(curr); printk(" stack backtrace: "); dump_stack(); } |
b3fbab057 rcu: Restore chec... |
4241 |
EXPORT_SYMBOL_GPL(lockdep_rcu_suspicious); |