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