aboutsummaryrefslogtreecommitdiffstats
path: root/kernel
diff options
context:
space:
mode:
Diffstat (limited to 'kernel')
-rw-r--r--kernel/Makefile3
-rw-r--r--kernel/cpuset.c10
-rw-r--r--kernel/exit.c5
-rw-r--r--kernel/fork.c4
-rw-r--r--kernel/mutex-debug.c464
-rw-r--r--kernel/mutex-debug.h134
-rw-r--r--kernel/mutex.c325
-rw-r--r--kernel/mutex.h35
-rw-r--r--kernel/sched.c1
9 files changed, 975 insertions, 6 deletions
diff --git a/kernel/Makefile b/kernel/Makefile
index 4f5a1453093a..a940bac02837 100644
--- a/kernel/Makefile
+++ b/kernel/Makefile
@@ -7,8 +7,9 @@ obj-y = sched.o fork.o exec_domain.o panic.o printk.o profile.o \
7 sysctl.o capability.o ptrace.o timer.o user.o \ 7 sysctl.o capability.o ptrace.o timer.o user.o \
8 signal.o sys.o kmod.o workqueue.o pid.o \ 8 signal.o sys.o kmod.o workqueue.o pid.o \
9 rcupdate.o intermodule.o extable.o params.o posix-timers.o \ 9 rcupdate.o intermodule.o extable.o params.o posix-timers.o \
10 kthread.o wait.o kfifo.o sys_ni.o posix-cpu-timers.o 10 kthread.o wait.o kfifo.o sys_ni.o posix-cpu-timers.o mutex.o
11 11
12obj-$(CONFIG_DEBUG_MUTEXES) += mutex-debug.o
12obj-$(CONFIG_FUTEX) += futex.o 13obj-$(CONFIG_FUTEX) += futex.o
13obj-$(CONFIG_GENERIC_ISA_DMA) += dma.o 14obj-$(CONFIG_GENERIC_ISA_DMA) += dma.o
14obj-$(CONFIG_SMP) += cpu.o spinlock.o 15obj-$(CONFIG_SMP) += cpu.o spinlock.o
diff --git a/kernel/cpuset.c b/kernel/cpuset.c
index eab64e23bcae..2a75e44e1a41 100644
--- a/kernel/cpuset.c
+++ b/kernel/cpuset.c
@@ -1513,7 +1513,7 @@ static int cpuset_add_file(struct dentry *dir, const struct cftype *cft)
1513 struct dentry *dentry; 1513 struct dentry *dentry;
1514 int error; 1514 int error;
1515 1515
1516 down(&dir->d_inode->i_sem); 1516 mutex_lock(&dir->d_inode->i_mutex);
1517 dentry = cpuset_get_dentry(dir, cft->name); 1517 dentry = cpuset_get_dentry(dir, cft->name);
1518 if (!IS_ERR(dentry)) { 1518 if (!IS_ERR(dentry)) {
1519 error = cpuset_create_file(dentry, 0644 | S_IFREG); 1519 error = cpuset_create_file(dentry, 0644 | S_IFREG);
@@ -1522,7 +1522,7 @@ static int cpuset_add_file(struct dentry *dir, const struct cftype *cft)
1522 dput(dentry); 1522 dput(dentry);
1523 } else 1523 } else
1524 error = PTR_ERR(dentry); 1524 error = PTR_ERR(dentry);
1525 up(&dir->d_inode->i_sem); 1525 mutex_unlock(&dir->d_inode->i_mutex);
1526 return error; 1526 return error;
1527} 1527}
1528 1528
@@ -1793,7 +1793,7 @@ static long cpuset_create(struct cpuset *parent, const char *name, int mode)
1793 1793
1794 /* 1794 /*
1795 * Release manage_sem before cpuset_populate_dir() because it 1795 * Release manage_sem before cpuset_populate_dir() because it
1796 * will down() this new directory's i_sem and if we race with 1796 * will down() this new directory's i_mutex and if we race with
1797 * another mkdir, we might deadlock. 1797 * another mkdir, we might deadlock.
1798 */ 1798 */
1799 up(&manage_sem); 1799 up(&manage_sem);
@@ -1812,7 +1812,7 @@ static int cpuset_mkdir(struct inode *dir, struct dentry *dentry, int mode)
1812{ 1812{
1813 struct cpuset *c_parent = dentry->d_parent->d_fsdata; 1813 struct cpuset *c_parent = dentry->d_parent->d_fsdata;
1814 1814
1815 /* the vfs holds inode->i_sem already */ 1815 /* the vfs holds inode->i_mutex already */
1816 return cpuset_create(c_parent, dentry->d_name.name, mode | S_IFDIR); 1816 return cpuset_create(c_parent, dentry->d_name.name, mode | S_IFDIR);
1817} 1817}
1818 1818
@@ -1823,7 +1823,7 @@ static int cpuset_rmdir(struct inode *unused_dir, struct dentry *dentry)
1823 struct cpuset *parent; 1823 struct cpuset *parent;
1824 char *pathbuf = NULL; 1824 char *pathbuf = NULL;
1825 1825
1826 /* the vfs holds both inode->i_sem already */ 1826 /* the vfs holds both inode->i_mutex already */
1827 1827
1828 down(&manage_sem); 1828 down(&manage_sem);
1829 cpuset_update_task_memory_state(); 1829 cpuset_update_task_memory_state();
diff --git a/kernel/exit.c b/kernel/exit.c
index caceabf3f230..309a46fa16f8 100644
--- a/kernel/exit.c
+++ b/kernel/exit.c
@@ -29,6 +29,7 @@
29#include <linux/syscalls.h> 29#include <linux/syscalls.h>
30#include <linux/signal.h> 30#include <linux/signal.h>
31#include <linux/cn_proc.h> 31#include <linux/cn_proc.h>
32#include <linux/mutex.h>
32 33
33#include <asm/uaccess.h> 34#include <asm/uaccess.h>
34#include <asm/unistd.h> 35#include <asm/unistd.h>
@@ -869,6 +870,10 @@ fastcall NORET_TYPE void do_exit(long code)
869 mpol_free(tsk->mempolicy); 870 mpol_free(tsk->mempolicy);
870 tsk->mempolicy = NULL; 871 tsk->mempolicy = NULL;
871#endif 872#endif
873 /*
874 * If DEBUG_MUTEXES is on, make sure we are holding no locks:
875 */
876 mutex_debug_check_no_locks_held(tsk);
872 877
873 /* PF_DEAD causes final put_task_struct after we schedule. */ 878 /* PF_DEAD causes final put_task_struct after we schedule. */
874 preempt_disable(); 879 preempt_disable();
diff --git a/kernel/fork.c b/kernel/fork.c
index 72e3252c6763..b18d64554feb 100644
--- a/kernel/fork.c
+++ b/kernel/fork.c
@@ -979,6 +979,10 @@ static task_t *copy_process(unsigned long clone_flags,
979 } 979 }
980#endif 980#endif
981 981
982#ifdef CONFIG_DEBUG_MUTEXES
983 p->blocked_on = NULL; /* not blocked yet */
984#endif
985
982 p->tgid = p->pid; 986 p->tgid = p->pid;
983 if (clone_flags & CLONE_THREAD) 987 if (clone_flags & CLONE_THREAD)
984 p->tgid = current->tgid; 988 p->tgid = current->tgid;
diff --git a/kernel/mutex-debug.c b/kernel/mutex-debug.c
new file mode 100644
index 000000000000..4fcb051a8b9e
--- /dev/null
+++ b/kernel/mutex-debug.c
@@ -0,0 +1,464 @@
1/*
2 * kernel/mutex-debug.c
3 *
4 * Debugging code for mutexes
5 *
6 * Started by Ingo Molnar:
7 *
8 * Copyright (C) 2004, 2005, 2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
9 *
10 * lock debugging, locking tree, deadlock detection started by:
11 *
12 * Copyright (C) 2004, LynuxWorks, Inc., Igor Manyilov, Bill Huey
13 * Released under the General Public License (GPL).
14 */
15#include <linux/mutex.h>
16#include <linux/sched.h>
17#include <linux/delay.h>
18#include <linux/module.h>
19#include <linux/spinlock.h>
20#include <linux/kallsyms.h>
21#include <linux/interrupt.h>
22
23#include <asm/mutex.h>
24
25#include "mutex-debug.h"
26
27/*
28 * We need a global lock when we walk through the multi-process
29 * lock tree. Only used in the deadlock-debugging case.
30 */
31DEFINE_SPINLOCK(debug_mutex_lock);
32
33/*
34 * All locks held by all tasks, in a single global list:
35 */
36LIST_HEAD(debug_mutex_held_locks);
37
38/*
39 * In the debug case we carry the caller's instruction pointer into
40 * other functions, but we dont want the function argument overhead
41 * in the nondebug case - hence these macros:
42 */
43#define __IP_DECL__ , unsigned long ip
44#define __IP__ , ip
45#define __RET_IP__ , (unsigned long)__builtin_return_address(0)
46
47/*
48 * "mutex debugging enabled" flag. We turn it off when we detect
49 * the first problem because we dont want to recurse back
50 * into the tracing code when doing error printk or
51 * executing a BUG():
52 */
53int debug_mutex_on = 1;
54
55static void printk_task(struct task_struct *p)
56{
57 if (p)
58 printk("%16s:%5d [%p, %3d]", p->comm, p->pid, p, p->prio);
59 else
60 printk("<none>");
61}
62
63static void printk_ti(struct thread_info *ti)
64{
65 if (ti)
66 printk_task(ti->task);
67 else
68 printk("<none>");
69}
70
71static void printk_task_short(struct task_struct *p)
72{
73 if (p)
74 printk("%s/%d [%p, %3d]", p->comm, p->pid, p, p->prio);
75 else
76 printk("<none>");
77}
78
79static void printk_lock(struct mutex *lock, int print_owner)
80{
81 printk(" [%p] {%s}\n", lock, lock->name);
82
83 if (print_owner && lock->owner) {
84 printk(".. held by: ");
85 printk_ti(lock->owner);
86 printk("\n");
87 }
88 if (lock->owner) {
89 printk("... acquired at: ");
90 print_symbol("%s\n", lock->acquire_ip);
91 }
92}
93
94/*
95 * printk locks held by a task:
96 */
97static void show_task_locks(struct task_struct *p)
98{
99 switch (p->state) {
100 case TASK_RUNNING: printk("R"); break;
101 case TASK_INTERRUPTIBLE: printk("S"); break;
102 case TASK_UNINTERRUPTIBLE: printk("D"); break;
103 case TASK_STOPPED: printk("T"); break;
104 case EXIT_ZOMBIE: printk("Z"); break;
105 case EXIT_DEAD: printk("X"); break;
106 default: printk("?"); break;
107 }
108 printk_task(p);
109 if (p->blocked_on) {
110 struct mutex *lock = p->blocked_on->lock;
111
112 printk(" blocked on mutex:");
113 printk_lock(lock, 1);
114 } else
115 printk(" (not blocked on mutex)\n");
116}
117
118/*
119 * printk all locks held in the system (if filter == NULL),
120 * or all locks belonging to a single task (if filter != NULL):
121 */
122void show_held_locks(struct task_struct *filter)
123{
124 struct list_head *curr, *cursor = NULL;
125 struct mutex *lock;
126 struct thread_info *t;
127 unsigned long flags;
128 int count = 0;
129
130 if (filter) {
131 printk("------------------------------\n");
132 printk("| showing all locks held by: | (");
133 printk_task_short(filter);
134 printk("):\n");
135 printk("------------------------------\n");
136 } else {
137 printk("---------------------------\n");
138 printk("| showing all locks held: |\n");
139 printk("---------------------------\n");
140 }
141
142 /*
143 * Play safe and acquire the global trace lock. We
144 * cannot printk with that lock held so we iterate
145 * very carefully:
146 */
147next:
148 debug_spin_lock_save(&debug_mutex_lock, flags);
149 list_for_each(curr, &debug_mutex_held_locks) {
150 if (cursor && curr != cursor)
151 continue;
152 lock = list_entry(curr, struct mutex, held_list);
153 t = lock->owner;
154 if (filter && (t != filter->thread_info))
155 continue;
156 count++;
157 cursor = curr->next;
158 debug_spin_lock_restore(&debug_mutex_lock, flags);
159
160 printk("\n#%03d: ", count);
161 printk_lock(lock, filter ? 0 : 1);
162 goto next;
163 }
164 debug_spin_lock_restore(&debug_mutex_lock, flags);
165 printk("\n");
166}
167
168void mutex_debug_show_all_locks(void)
169{
170 struct task_struct *g, *p;
171 int count = 10;
172 int unlock = 1;
173
174 printk("\nShowing all blocking locks in the system:\n");
175
176 /*
177 * Here we try to get the tasklist_lock as hard as possible,
178 * if not successful after 2 seconds we ignore it (but keep
179 * trying). This is to enable a debug printout even if a
180 * tasklist_lock-holding task deadlocks or crashes.
181 */
182retry:
183 if (!read_trylock(&tasklist_lock)) {
184 if (count == 10)
185 printk("hm, tasklist_lock locked, retrying... ");
186 if (count) {
187 count--;
188 printk(" #%d", 10-count);
189 mdelay(200);
190 goto retry;
191 }
192 printk(" ignoring it.\n");
193 unlock = 0;
194 }
195 if (count != 10)
196 printk(" locked it.\n");
197
198 do_each_thread(g, p) {
199 show_task_locks(p);
200 if (!unlock)
201 if (read_trylock(&tasklist_lock))
202 unlock = 1;
203 } while_each_thread(g, p);
204
205 printk("\n");
206 show_held_locks(NULL);
207 printk("=============================================\n\n");
208
209 if (unlock)
210 read_unlock(&tasklist_lock);
211}
212
213static void report_deadlock(struct task_struct *task, struct mutex *lock,
214 struct mutex *lockblk, unsigned long ip)
215{
216 printk("\n%s/%d is trying to acquire this lock:\n",
217 current->comm, current->pid);
218 printk_lock(lock, 1);
219 printk("... trying at: ");
220 print_symbol("%s\n", ip);
221 show_held_locks(current);
222
223 if (lockblk) {
224 printk("but %s/%d is deadlocking current task %s/%d!\n\n",
225 task->comm, task->pid, current->comm, current->pid);
226 printk("\n%s/%d is blocked on this lock:\n",
227 task->comm, task->pid);
228 printk_lock(lockblk, 1);
229
230 show_held_locks(task);
231
232 printk("\n%s/%d's [blocked] stackdump:\n\n",
233 task->comm, task->pid);
234 show_stack(task, NULL);
235 }
236
237 printk("\n%s/%d's [current] stackdump:\n\n",
238 current->comm, current->pid);
239 dump_stack();
240 mutex_debug_show_all_locks();
241 printk("[ turning off deadlock detection. Please report this. ]\n\n");
242 local_irq_disable();
243}
244
245/*
246 * Recursively check for mutex deadlocks:
247 */
248static int check_deadlock(struct mutex *lock, int depth,
249 struct thread_info *ti, unsigned long ip)
250{
251 struct mutex *lockblk;
252 struct task_struct *task;
253
254 if (!debug_mutex_on)
255 return 0;
256
257 ti = lock->owner;
258 if (!ti)
259 return 0;
260
261 task = ti->task;
262 lockblk = NULL;
263 if (task->blocked_on)
264 lockblk = task->blocked_on->lock;
265
266 /* Self-deadlock: */
267 if (current == task) {
268 DEBUG_OFF();
269 if (depth)
270 return 1;
271 printk("\n==========================================\n");
272 printk( "[ BUG: lock recursion deadlock detected! |\n");
273 printk( "------------------------------------------\n");
274 report_deadlock(task, lock, NULL, ip);
275 return 0;
276 }
277
278 /* Ugh, something corrupted the lock data structure? */
279 if (depth > 20) {
280 DEBUG_OFF();
281 printk("\n===========================================\n");
282 printk( "[ BUG: infinite lock dependency detected!? |\n");
283 printk( "-------------------------------------------\n");
284 report_deadlock(task, lock, lockblk, ip);
285 return 0;
286 }
287
288 /* Recursively check for dependencies: */
289 if (lockblk && check_deadlock(lockblk, depth+1, ti, ip)) {
290 printk("\n============================================\n");
291 printk( "[ BUG: circular locking deadlock detected! ]\n");
292 printk( "--------------------------------------------\n");
293 report_deadlock(task, lock, lockblk, ip);
294 return 0;
295 }
296 return 0;
297}
298
299/*
300 * Called when a task exits, this function checks whether the
301 * task is holding any locks, and reports the first one if so:
302 */
303void mutex_debug_check_no_locks_held(struct task_struct *task)
304{
305 struct list_head *curr, *next;
306 struct thread_info *t;
307 unsigned long flags;
308 struct mutex *lock;
309
310 if (!debug_mutex_on)
311 return;
312
313 debug_spin_lock_save(&debug_mutex_lock, flags);
314 list_for_each_safe(curr, next, &debug_mutex_held_locks) {
315 lock = list_entry(curr, struct mutex, held_list);
316 t = lock->owner;
317 if (t != task->thread_info)
318 continue;
319 list_del_init(curr);
320 DEBUG_OFF();
321 debug_spin_lock_restore(&debug_mutex_lock, flags);
322
323 printk("BUG: %s/%d, lock held at task exit time!\n",
324 task->comm, task->pid);
325 printk_lock(lock, 1);
326 if (lock->owner != task->thread_info)
327 printk("exiting task is not even the owner??\n");
328 return;
329 }
330 debug_spin_lock_restore(&debug_mutex_lock, flags);
331}
332
333/*
334 * Called when kernel memory is freed (or unmapped), or if a mutex
335 * is destroyed or reinitialized - this code checks whether there is
336 * any held lock in the memory range of <from> to <to>:
337 */
338void mutex_debug_check_no_locks_freed(const void *from, const void *to)
339{
340 struct list_head *curr, *next;
341 unsigned long flags;
342 struct mutex *lock;
343 void *lock_addr;
344
345 if (!debug_mutex_on)
346 return;
347
348 debug_spin_lock_save(&debug_mutex_lock, flags);
349 list_for_each_safe(curr, next, &debug_mutex_held_locks) {
350 lock = list_entry(curr, struct mutex, held_list);
351 lock_addr = lock;
352 if (lock_addr < from || lock_addr >= to)
353 continue;
354 list_del_init(curr);
355 DEBUG_OFF();
356 debug_spin_lock_restore(&debug_mutex_lock, flags);
357
358 printk("BUG: %s/%d, active lock [%p(%p-%p)] freed!\n",
359 current->comm, current->pid, lock, from, to);
360 dump_stack();
361 printk_lock(lock, 1);
362 if (lock->owner != current_thread_info())
363 printk("freeing task is not even the owner??\n");
364 return;
365 }
366 debug_spin_lock_restore(&debug_mutex_lock, flags);
367}
368
369/*
370 * Must be called with lock->wait_lock held.
371 */
372void debug_mutex_set_owner(struct mutex *lock,
373 struct thread_info *new_owner __IP_DECL__)
374{
375 lock->owner = new_owner;
376 DEBUG_WARN_ON(!list_empty(&lock->held_list));
377 if (debug_mutex_on) {
378 list_add_tail(&lock->held_list, &debug_mutex_held_locks);
379 lock->acquire_ip = ip;
380 }
381}
382
383void debug_mutex_init_waiter(struct mutex_waiter *waiter)
384{
385 memset(waiter, 0x11, sizeof(*waiter));
386 waiter->magic = waiter;
387 INIT_LIST_HEAD(&waiter->list);
388}
389
390void debug_mutex_wake_waiter(struct mutex *lock, struct mutex_waiter *waiter)
391{
392 SMP_DEBUG_WARN_ON(!spin_is_locked(&lock->wait_lock));
393 DEBUG_WARN_ON(list_empty(&lock->wait_list));
394 DEBUG_WARN_ON(waiter->magic != waiter);
395 DEBUG_WARN_ON(list_empty(&waiter->list));
396}
397
398void debug_mutex_free_waiter(struct mutex_waiter *waiter)
399{
400 DEBUG_WARN_ON(!list_empty(&waiter->list));
401 memset(waiter, 0x22, sizeof(*waiter));
402}
403
404void debug_mutex_add_waiter(struct mutex *lock, struct mutex_waiter *waiter,
405 struct thread_info *ti __IP_DECL__)
406{
407 SMP_DEBUG_WARN_ON(!spin_is_locked(&lock->wait_lock));
408 check_deadlock(lock, 0, ti, ip);
409 /* Mark the current thread as blocked on the lock: */
410 ti->task->blocked_on = waiter;
411 waiter->lock = lock;
412}
413
414void mutex_remove_waiter(struct mutex *lock, struct mutex_waiter *waiter,
415 struct thread_info *ti)
416{
417 DEBUG_WARN_ON(list_empty(&waiter->list));
418 DEBUG_WARN_ON(waiter->task != ti->task);
419 DEBUG_WARN_ON(ti->task->blocked_on != waiter);
420 ti->task->blocked_on = NULL;
421
422 list_del_init(&waiter->list);
423 waiter->task = NULL;
424}
425
426void debug_mutex_unlock(struct mutex *lock)
427{
428 DEBUG_WARN_ON(lock->magic != lock);
429 DEBUG_WARN_ON(!lock->wait_list.prev && !lock->wait_list.next);
430 DEBUG_WARN_ON(lock->owner != current_thread_info());
431 if (debug_mutex_on) {
432 DEBUG_WARN_ON(list_empty(&lock->held_list));
433 list_del_init(&lock->held_list);
434 }
435}
436
437void debug_mutex_init(struct mutex *lock, const char *name)
438{
439 /*
440 * Make sure we are not reinitializing a held lock:
441 */
442 mutex_debug_check_no_locks_freed((void *)lock, (void *)(lock + 1));
443 lock->owner = NULL;
444 INIT_LIST_HEAD(&lock->held_list);
445 lock->name = name;
446 lock->magic = lock;
447}
448
449/***
450 * mutex_destroy - mark a mutex unusable
451 * @lock: the mutex to be destroyed
452 *
453 * This function marks the mutex uninitialized, and any subsequent
454 * use of the mutex is forbidden. The mutex must not be locked when
455 * this function is called.
456 */
457void fastcall mutex_destroy(struct mutex *lock)
458{
459 DEBUG_WARN_ON(mutex_is_locked(lock));
460 lock->magic = NULL;
461}
462
463EXPORT_SYMBOL_GPL(mutex_destroy);
464
diff --git a/kernel/mutex-debug.h b/kernel/mutex-debug.h
new file mode 100644
index 000000000000..fd384050acb1
--- /dev/null
+++ b/kernel/mutex-debug.h
@@ -0,0 +1,134 @@
1/*
2 * Mutexes: blocking mutual exclusion locks
3 *
4 * started by Ingo Molnar:
5 *
6 * Copyright (C) 2004, 2005, 2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
7 *
8 * This file contains mutex debugging related internal declarations,
9 * prototypes and inline functions, for the CONFIG_DEBUG_MUTEXES case.
10 * More details are in kernel/mutex-debug.c.
11 */
12
13extern spinlock_t debug_mutex_lock;
14extern struct list_head debug_mutex_held_locks;
15extern int debug_mutex_on;
16
17/*
18 * In the debug case we carry the caller's instruction pointer into
19 * other functions, but we dont want the function argument overhead
20 * in the nondebug case - hence these macros:
21 */
22#define __IP_DECL__ , unsigned long ip
23#define __IP__ , ip
24#define __RET_IP__ , (unsigned long)__builtin_return_address(0)
25
26/*
27 * This must be called with lock->wait_lock held.
28 */
29extern void debug_mutex_set_owner(struct mutex *lock,
30 struct thread_info *new_owner __IP_DECL__);
31
32static inline void debug_mutex_clear_owner(struct mutex *lock)
33{
34 lock->owner = NULL;
35}
36
37extern void debug_mutex_init_waiter(struct mutex_waiter *waiter);
38extern void debug_mutex_wake_waiter(struct mutex *lock,
39 struct mutex_waiter *waiter);
40extern void debug_mutex_free_waiter(struct mutex_waiter *waiter);
41extern void debug_mutex_add_waiter(struct mutex *lock,
42 struct mutex_waiter *waiter,
43 struct thread_info *ti __IP_DECL__);
44extern void mutex_remove_waiter(struct mutex *lock, struct mutex_waiter *waiter,
45 struct thread_info *ti);
46extern void debug_mutex_unlock(struct mutex *lock);
47extern void debug_mutex_init(struct mutex *lock, const char *name);
48
49#define debug_spin_lock(lock) \
50 do { \
51 local_irq_disable(); \
52 if (debug_mutex_on) \
53 spin_lock(lock); \
54 } while (0)
55
56#define debug_spin_unlock(lock) \
57 do { \
58 if (debug_mutex_on) \
59 spin_unlock(lock); \
60 local_irq_enable(); \
61 preempt_check_resched(); \
62 } while (0)
63
64#define debug_spin_lock_save(lock, flags) \
65 do { \
66 local_irq_save(flags); \
67 if (debug_mutex_on) \
68 spin_lock(lock); \
69 } while (0)
70
71#define debug_spin_lock_restore(lock, flags) \
72 do { \
73 if (debug_mutex_on) \
74 spin_unlock(lock); \
75 local_irq_restore(flags); \
76 preempt_check_resched(); \
77 } while (0)
78
79#define spin_lock_mutex(lock) \
80 do { \
81 struct mutex *l = container_of(lock, struct mutex, wait_lock); \
82 \
83 DEBUG_WARN_ON(in_interrupt()); \
84 debug_spin_lock(&debug_mutex_lock); \
85 spin_lock(lock); \
86 DEBUG_WARN_ON(l->magic != l); \
87 } while (0)
88
89#define spin_unlock_mutex(lock) \
90 do { \
91 spin_unlock(lock); \
92 debug_spin_unlock(&debug_mutex_lock); \
93 } while (0)
94
95#define DEBUG_OFF() \
96do { \
97 if (debug_mutex_on) { \
98 debug_mutex_on = 0; \
99 console_verbose(); \
100 if (spin_is_locked(&debug_mutex_lock)) \
101 spin_unlock(&debug_mutex_lock); \
102 } \
103} while (0)
104
105#define DEBUG_BUG() \
106do { \
107 if (debug_mutex_on) { \
108 DEBUG_OFF(); \
109 BUG(); \
110 } \
111} while (0)
112
113#define DEBUG_WARN_ON(c) \
114do { \
115 if (unlikely(c && debug_mutex_on)) { \
116 DEBUG_OFF(); \
117 WARN_ON(1); \
118 } \
119} while (0)
120
121# define DEBUG_BUG_ON(c) \
122do { \
123 if (unlikely(c)) \
124 DEBUG_BUG(); \
125} while (0)
126
127#ifdef CONFIG_SMP
128# define SMP_DEBUG_WARN_ON(c) DEBUG_WARN_ON(c)
129# define SMP_DEBUG_BUG_ON(c) DEBUG_BUG_ON(c)
130#else
131# define SMP_DEBUG_WARN_ON(c) do { } while (0)
132# define SMP_DEBUG_BUG_ON(c) do { } while (0)
133#endif
134
diff --git a/kernel/mutex.c b/kernel/mutex.c
new file mode 100644
index 000000000000..7eb960661441
--- /dev/null
+++ b/kernel/mutex.c
@@ -0,0 +1,325 @@
1/*
2 * kernel/mutex.c
3 *
4 * Mutexes: blocking mutual exclusion locks
5 *
6 * Started by Ingo Molnar:
7 *
8 * Copyright (C) 2004, 2005, 2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
9 *
10 * Many thanks to Arjan van de Ven, Thomas Gleixner, Steven Rostedt and
11 * David Howells for suggestions and improvements.
12 *
13 * Also see Documentation/mutex-design.txt.
14 */
15#include <linux/mutex.h>
16#include <linux/sched.h>
17#include <linux/module.h>
18#include <linux/spinlock.h>
19#include <linux/interrupt.h>
20
21/*
22 * In the DEBUG case we are using the "NULL fastpath" for mutexes,
23 * which forces all calls into the slowpath:
24 */
25#ifdef CONFIG_DEBUG_MUTEXES
26# include "mutex-debug.h"
27# include <asm-generic/mutex-null.h>
28#else
29# include "mutex.h"
30# include <asm/mutex.h>
31#endif
32
33/***
34 * mutex_init - initialize the mutex
35 * @lock: the mutex to be initialized
36 *
37 * Initialize the mutex to unlocked state.
38 *
39 * It is not allowed to initialize an already locked mutex.
40 */
41void fastcall __mutex_init(struct mutex *lock, const char *name)
42{
43 atomic_set(&lock->count, 1);
44 spin_lock_init(&lock->wait_lock);
45 INIT_LIST_HEAD(&lock->wait_list);
46
47 debug_mutex_init(lock, name);
48}
49
50EXPORT_SYMBOL(__mutex_init);
51
52/*
53 * We split the mutex lock/unlock logic into separate fastpath and
54 * slowpath functions, to reduce the register pressure on the fastpath.
55 * We also put the fastpath first in the kernel image, to make sure the
56 * branch is predicted by the CPU as default-untaken.
57 */
58static void fastcall noinline __sched
59__mutex_lock_slowpath(atomic_t *lock_count __IP_DECL__);
60
61/***
62 * mutex_lock - acquire the mutex
63 * @lock: the mutex to be acquired
64 *
65 * Lock the mutex exclusively for this task. If the mutex is not
66 * available right now, it will sleep until it can get it.
67 *
68 * The mutex must later on be released by the same task that
69 * acquired it. Recursive locking is not allowed. The task
70 * may not exit without first unlocking the mutex. Also, kernel
71 * memory where the mutex resides mutex must not be freed with
72 * the mutex still locked. The mutex must first be initialized
73 * (or statically defined) before it can be locked. memset()-ing
74 * the mutex to 0 is not allowed.
75 *
76 * ( The CONFIG_DEBUG_MUTEXES .config option turns on debugging
77 * checks that will enforce the restrictions and will also do
78 * deadlock debugging. )
79 *
80 * This function is similar to (but not equivalent to) down().
81 */
82void fastcall __sched mutex_lock(struct mutex *lock)
83{
84 /*
85 * The locking fastpath is the 1->0 transition from
86 * 'unlocked' into 'locked' state.
87 *
88 * NOTE: if asm/mutex.h is included, then some architectures
89 * rely on mutex_lock() having _no other code_ here but this
90 * fastpath. That allows the assembly fastpath to do
91 * tail-merging optimizations. (If you want to put testcode
92 * here, do it under #ifndef CONFIG_MUTEX_DEBUG.)
93 */
94 __mutex_fastpath_lock(&lock->count, __mutex_lock_slowpath);
95}
96
97EXPORT_SYMBOL(mutex_lock);
98
99static void fastcall noinline __sched
100__mutex_unlock_slowpath(atomic_t *lock_count __IP_DECL__);
101
102/***
103 * mutex_unlock - release the mutex
104 * @lock: the mutex to be released
105 *
106 * Unlock a mutex that has been locked by this task previously.
107 *
108 * This function must not be used in interrupt context. Unlocking
109 * of a not locked mutex is not allowed.
110 *
111 * This function is similar to (but not equivalent to) up().
112 */
113void fastcall __sched mutex_unlock(struct mutex *lock)
114{
115 /*
116 * The unlocking fastpath is the 0->1 transition from 'locked'
117 * into 'unlocked' state:
118 *
119 * NOTE: no other code must be here - see mutex_lock() .
120 */
121 __mutex_fastpath_unlock(&lock->count, __mutex_unlock_slowpath);
122}
123
124EXPORT_SYMBOL(mutex_unlock);
125
126/*
127 * Lock a mutex (possibly interruptible), slowpath:
128 */
129static inline int __sched
130__mutex_lock_common(struct mutex *lock, long state __IP_DECL__)
131{
132 struct task_struct *task = current;
133 struct mutex_waiter waiter;
134 unsigned int old_val;
135
136 debug_mutex_init_waiter(&waiter);
137
138 spin_lock_mutex(&lock->wait_lock);
139
140 debug_mutex_add_waiter(lock, &waiter, task->thread_info, ip);
141
142 /* add waiting tasks to the end of the waitqueue (FIFO): */
143 list_add_tail(&waiter.list, &lock->wait_list);
144 waiter.task = task;
145
146 for (;;) {
147 /*
148 * Lets try to take the lock again - this is needed even if
149 * we get here for the first time (shortly after failing to
150 * acquire the lock), to make sure that we get a wakeup once
151 * it's unlocked. Later on, if we sleep, this is the
152 * operation that gives us the lock. We xchg it to -1, so
153 * that when we release the lock, we properly wake up the
154 * other waiters:
155 */
156 old_val = atomic_xchg(&lock->count, -1);
157 if (old_val == 1)
158 break;
159
160 /*
161 * got a signal? (This code gets eliminated in the
162 * TASK_UNINTERRUPTIBLE case.)
163 */
164 if (unlikely(state == TASK_INTERRUPTIBLE &&
165 signal_pending(task))) {
166 mutex_remove_waiter(lock, &waiter, task->thread_info);
167 spin_unlock_mutex(&lock->wait_lock);
168
169 debug_mutex_free_waiter(&waiter);
170 return -EINTR;
171 }
172 __set_task_state(task, state);
173
174 /* didnt get the lock, go to sleep: */
175 spin_unlock_mutex(&lock->wait_lock);
176 schedule();
177 spin_lock_mutex(&lock->wait_lock);
178 }
179
180 /* got the lock - rejoice! */
181 mutex_remove_waiter(lock, &waiter, task->thread_info);
182 debug_mutex_set_owner(lock, task->thread_info __IP__);
183
184 /* set it to 0 if there are no waiters left: */
185 if (likely(list_empty(&lock->wait_list)))
186 atomic_set(&lock->count, 0);
187
188 spin_unlock_mutex(&lock->wait_lock);
189
190 debug_mutex_free_waiter(&waiter);
191
192 DEBUG_WARN_ON(list_empty(&lock->held_list));
193 DEBUG_WARN_ON(lock->owner != task->thread_info);
194
195 return 0;
196}
197
198static void fastcall noinline __sched
199__mutex_lock_slowpath(atomic_t *lock_count __IP_DECL__)
200{
201 struct mutex *lock = container_of(lock_count, struct mutex, count);
202
203 __mutex_lock_common(lock, TASK_UNINTERRUPTIBLE __IP__);
204}
205
206/*
207 * Release the lock, slowpath:
208 */
209static fastcall noinline void
210__mutex_unlock_slowpath(atomic_t *lock_count __IP_DECL__)
211{
212 struct mutex *lock = container_of(lock_count, struct mutex, count);
213
214 DEBUG_WARN_ON(lock->owner != current_thread_info());
215
216 spin_lock_mutex(&lock->wait_lock);
217
218 /*
219 * some architectures leave the lock unlocked in the fastpath failure
220 * case, others need to leave it locked. In the later case we have to
221 * unlock it here
222 */
223 if (__mutex_slowpath_needs_to_unlock())
224 atomic_set(&lock->count, 1);
225
226 debug_mutex_unlock(lock);
227
228 if (!list_empty(&lock->wait_list)) {
229 /* get the first entry from the wait-list: */
230 struct mutex_waiter *waiter =
231 list_entry(lock->wait_list.next,
232 struct mutex_waiter, list);
233
234 debug_mutex_wake_waiter(lock, waiter);
235
236 wake_up_process(waiter->task);
237 }
238
239 debug_mutex_clear_owner(lock);
240
241 spin_unlock_mutex(&lock->wait_lock);
242}
243
244/*
245 * Here come the less common (and hence less performance-critical) APIs:
246 * mutex_lock_interruptible() and mutex_trylock().
247 */
248static int fastcall noinline __sched
249__mutex_lock_interruptible_slowpath(atomic_t *lock_count __IP_DECL__);
250
251/***
252 * mutex_lock_interruptible - acquire the mutex, interruptable
253 * @lock: the mutex to be acquired
254 *
255 * Lock the mutex like mutex_lock(), and return 0 if the mutex has
256 * been acquired or sleep until the mutex becomes available. If a
257 * signal arrives while waiting for the lock then this function
258 * returns -EINTR.
259 *
260 * This function is similar to (but not equivalent to) down_interruptible().
261 */
262int fastcall __sched mutex_lock_interruptible(struct mutex *lock)
263{
264 /* NOTE: no other code must be here - see mutex_lock() */
265 return __mutex_fastpath_lock_retval
266 (&lock->count, __mutex_lock_interruptible_slowpath);
267}
268
269EXPORT_SYMBOL(mutex_lock_interruptible);
270
271static int fastcall noinline __sched
272__mutex_lock_interruptible_slowpath(atomic_t *lock_count __IP_DECL__)
273{
274 struct mutex *lock = container_of(lock_count, struct mutex, count);
275
276 return __mutex_lock_common(lock, TASK_INTERRUPTIBLE __IP__);
277}
278
279/*
280 * Spinlock based trylock, we take the spinlock and check whether we
281 * can get the lock:
282 */
283static inline int __mutex_trylock_slowpath(atomic_t *lock_count)
284{
285 struct mutex *lock = container_of(lock_count, struct mutex, count);
286 int prev;
287
288 spin_lock_mutex(&lock->wait_lock);
289
290 prev = atomic_xchg(&lock->count, -1);
291 if (likely(prev == 1))
292 debug_mutex_set_owner(lock, current_thread_info() __RET_IP__);
293 /* Set it back to 0 if there are no waiters: */
294 if (likely(list_empty(&lock->wait_list)))
295 atomic_set(&lock->count, 0);
296
297 spin_unlock_mutex(&lock->wait_lock);
298
299 return prev == 1;
300}
301
302/***
303 * mutex_trylock - try acquire the mutex, without waiting
304 * @lock: the mutex to be acquired
305 *
306 * Try to acquire the mutex atomically. Returns 1 if the mutex
307 * has been acquired successfully, and 0 on contention.
308 *
309 * NOTE: this function follows the spin_trylock() convention, so
310 * it is negated to the down_trylock() return values! Be careful
311 * about this when converting semaphore users to mutexes.
312 *
313 * This function must not be used in interrupt context. The
314 * mutex must be released by the same task that acquired it.
315 */
316int fastcall mutex_trylock(struct mutex *lock)
317{
318 return __mutex_fastpath_trylock(&lock->count,
319 __mutex_trylock_slowpath);
320}
321
322EXPORT_SYMBOL(mutex_trylock);
323
324
325
diff --git a/kernel/mutex.h b/kernel/mutex.h
new file mode 100644
index 000000000000..00fe84e7b672
--- /dev/null
+++ b/kernel/mutex.h
@@ -0,0 +1,35 @@
1/*
2 * Mutexes: blocking mutual exclusion locks
3 *
4 * started by Ingo Molnar:
5 *
6 * Copyright (C) 2004, 2005, 2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
7 *
8 * This file contains mutex debugging related internal prototypes, for the
9 * !CONFIG_DEBUG_MUTEXES case. Most of them are NOPs:
10 */
11
12#define spin_lock_mutex(lock) spin_lock(lock)
13#define spin_unlock_mutex(lock) spin_unlock(lock)
14#define mutex_remove_waiter(lock, waiter, ti) \
15 __list_del((waiter)->list.prev, (waiter)->list.next)
16
17#define DEBUG_WARN_ON(c) do { } while (0)
18#define debug_mutex_set_owner(lock, new_owner) do { } while (0)
19#define debug_mutex_clear_owner(lock) do { } while (0)
20#define debug_mutex_init_waiter(waiter) do { } while (0)
21#define debug_mutex_wake_waiter(lock, waiter) do { } while (0)
22#define debug_mutex_free_waiter(waiter) do { } while (0)
23#define debug_mutex_add_waiter(lock, waiter, ti, ip) do { } while (0)
24#define debug_mutex_unlock(lock) do { } while (0)
25#define debug_mutex_init(lock, name) do { } while (0)
26
27/*
28 * Return-address parameters/declarations. They are very useful for
29 * debugging, but add overhead in the !DEBUG case - so we go the
30 * trouble of using this not too elegant but zero-cost solution:
31 */
32#define __IP_DECL__
33#define __IP__
34#define __RET_IP__
35
diff --git a/kernel/sched.c b/kernel/sched.c
index 92733091154c..34a945bcc022 100644
--- a/kernel/sched.c
+++ b/kernel/sched.c
@@ -4386,6 +4386,7 @@ void show_state(void)
4386 } while_each_thread(g, p); 4386 } while_each_thread(g, p);
4387 4387
4388 read_unlock(&tasklist_lock); 4388 read_unlock(&tasklist_lock);
4389 mutex_debug_show_all_locks();
4389} 4390}
4390 4391
4391/** 4392/**