CINXE.COM

<?xml version="1.0" encoding="UTF-8" standalone="yes"?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>LKML: David Howells: [PATCH 1/19] MUTEX: Introduce simple mutex implementation</title><link href="/css/message.css" rel="stylesheet" type="text/css" /><link href="/css/wrap.css" rel="alternate stylesheet" type="text/css" title="wrap" /><link href="/css/nowrap.css" rel="stylesheet" type="text/css" title="nowrap" /><link href="/favicon.ico" rel="shortcut icon" /><script src="/js/simple-calendar.js" type="text/javascript"></script><script src="/js/styleswitcher.js" type="text/javascript"></script><link rel="alternate" type="application/rss+xml" title="lkml.org : last 100 messages" href="/rss.php" /><link rel="alternate" type="application/rss+xml" title="lkml.org : last messages by David Howells" href="/groupie.php?aid=345" /><script> var _paq = window._paq = window._paq || []; /* tracker methods like "setCustomDimension" should be called before "trackPageView" */ _paq.push(["setDoNotTrack", true]); _paq.push(["disableCookies"]); _paq.push(['trackPageView']); _paq.push(['enableLinkTracking']); (function() { var u="//m.lkml.org/"; _paq.push(['setTrackerUrl', u+'matomo.php']); _paq.push(['setSiteId', '1']); var d=document, g=d.createElement('script'), s=d.getElementsByTagName('script')[0]; g.async=true; g.src=u+'matomo.js'; s.parentNode.insertBefore(g,s); })(); </script></head><body onload="es.jasper.simpleCalendar.init();" itemscope="itemscope" itemtype="http://schema.org/BlogPosting"><table border="0" cellpadding="0" cellspacing="0"><tr><td width="180" align="center"><a href="/"><img style="border:0;width:135px;height:32px" src="/images/toprowlk.gif" alt="lkml.org" /></a></td><td width="32">聽</td><td class="nb"><div><a class="nb" href="/lkml"> [lkml]</a> 聽 <a class="nb" href="/lkml/2005"> [2005]</a> 聽 <a class="nb" href="/lkml/2005/12"> [Dec]</a> 聽 <a class="nb" href="/lkml/2005/12/12"> [12]</a> 聽 <a class="nb" href="/lkml/last100"> [last100]</a> 聽 <a href="/rss.php"><img src="/images/rss-or.gif" border="0" alt="RSS Feed" /></a></div><div>Views: <a href="#" class="nowrap" onclick="setActiveStyleSheet('wrap');return false;">[wrap]</a><a href="#" class="wrap" onclick="setActiveStyleSheet('nowrap');return false;">[no wrap]</a> 聽 <a class="nb" href="/lkml/mheaders/2005/12/12/244" onclick="this.href='/lkml/headers'+'/2005/12/12/244';">[headers]</a>聽 <a href="/lkml/bounce/2005/12/12/244">[forward]</a>聽 </div></td><td width="32">聽</td></tr><tr><td valign="top"><div class="es-jasper-simpleCalendar" baseurl="/lkml/"></div><div class="threadlist">Messages in this thread</div><ul class="threadlist"><li class="root"><a href="/lkml/2005/12/12/244">First message in thread</a></li><li class="origin"><a href="/lkml/2005/12/12/241">David Howells</a><ul><li><a href="/lkml/2005/12/12/241">David Howells</a></li><li><a href="/lkml/2005/12/12/242">David Howells</a></li><li><a href="/lkml/2005/12/12/243">David Howells</a></li><li><a href="/lkml/2005/12/12/245">David Howells</a></li><li><a href="/lkml/2005/12/12/246">David Howells</a></li><li><a href="/lkml/2005/12/12/247">David Howells</a></li><li><a href="/lkml/2005/12/12/248">David Howells</a></li><li><a href="/lkml/2005/12/12/249">David Howells</a></li><li><a href="/lkml/2005/12/12/250">David Howells</a></li><li><a href="/lkml/2005/12/12/251">David Howells</a></li><li><a href="/lkml/2005/12/12/252">David Howells</a></li><li><a href="/lkml/2005/12/12/253">David Howells</a></li><li><a href="/lkml/2005/12/12/254">David Howells</a></li><li><a href="/lkml/2005/12/12/255">David Howells</a></li><li><a href="/lkml/2005/12/12/256">David Howells</a></li><li><a href="/lkml/2005/12/12/257">David Howells</a></li><li><a href="/lkml/2005/12/12/259">David Howells</a></li><li><a href="/lkml/2005/12/12/260">David Howells</a></li><li><a href="/lkml/2005/12/12/266">Nick Piggin</a><ul><li><a href="/lkml/2005/12/13/107">David Howells</a><ul><li><a href="/lkml/2005/12/13/114">Ingo Molnar</a><ul><li><a href="/lkml/2005/12/13/125">Ingo Molnar</a></li></ul></li><li><a href="/lkml/2005/12/13/431">Nick Piggin</a><ul><li><a href="/lkml/2005/12/14/82">David Howells</a></li></ul></li></ul></li></ul></li><li><a href="/lkml/2005/12/12/268">Andrew Morton</a><ul><li><a href="/lkml/2005/12/13/30">Ingo Molnar</a><ul><li><a href="/lkml/2005/12/13/32">Andi Kleen</a><ul><li><a href="/lkml/2005/12/13/74">Andrew Morton</a></li></ul></li><li><a href="/lkml/2005/12/13/33">Arjan van de Ven</a><ul><li><a href="/lkml/2005/12/13/83">Ingo Molnar</a></li></ul></li><li><a href="/lkml/2005/12/13/78">Christoph Hellwig</a><ul><li><a href="/lkml/2005/12/13/102">Ingo Molnar</a></li></ul></li><li><a href="/lkml/2005/12/13/108">Ingo Molnar</a></li></ul></li><li><a href="/lkml/2005/12/13/127">David Howells</a><ul><li><a href="/lkml/2005/12/13/139">Matthew Wilcox</a></li></ul></li></ul></li><li><a href="/lkml/2005/12/12/269">Nick Piggin</a><ul><li><a href="/lkml/2005/12/13/131">David Howells</a><ul><li><a href="/lkml/2005/12/13/133">David Howells</a></li></ul></li></ul></li><li><a href="/lkml/2005/12/12/272">Arnd Bergmann</a><ul><li><a href="/lkml/2005/12/13/323">David Howells</a></li></ul></li><li><a href="/lkml/2005/12/12/276">Daniel Walker</a><ul><li><a href="/lkml/2005/12/12/311">Steven Rostedt</a></li></ul></li><li><a href="/lkml/2005/12/12/296">Mark Lord</a><ul><li><a href="/lkml/2005/12/12/310">Steven Rostedt</a></li><li><a href="/lkml/2005/12/13/85">Christoph Hellwig</a></li></ul></li><li><a href="/lkml/2005/12/13/128">Ingo Molnar</a><ul><li><a href="/lkml/2005/12/13/132">David Howells</a><ul><li><a href="/lkml/2005/12/13/166">Ingo Molnar</a></li></ul></li></ul></li><li><a href="/lkml/2005/12/13/142">Alan Cox</a><ul><li><a href="/lkml/2005/12/13/147">Alan Cox</a><ul><li><a href="/lkml/2005/12/13/406">Nikita Danilov</a></li></ul></li><li><a href="/lkml/2005/12/13/151">David Howells</a><ul><li><a href="/lkml/2005/12/13/172">Alan Cox</a><ul><li><a href="/lkml/2005/12/13/205">David Howells</a></li></ul></li><li><a href="/lkml/2005/12/13/187">"Christopher Friesen"</a><ul><li><a href="/lkml/2005/12/13/188">Arjan van de Ven</a></li><li><a href="/lkml/2005/12/13/213">David Howells</a></li></ul></li><li><a href="/lkml/2005/12/13/306">Steven Rostedt</a></li></ul></li></ul></li></ul></li></ul><div class="threadlist">Patch in this message</div><ul class="threadlist"><li><a href="/lkml/diff/2005/12/12/244/1">Get diff 1</a></li></ul></td><td width="32" rowspan="2" class="c" valign="top"><img src="/images/icornerl.gif" width="32" height="32" alt="/" /></td><td class="c" rowspan="2" valign="top" style="padding-top: 1em"><table><tr><td><table><tr><td class="lp">Date</td><td class="rp" itemprop="datePublished">Mon, 12 Dec 2005 23:45:45 GMT</td></tr><tr><td class="lp">From</td><td class="rp" itemprop="author">David Howells <></td></tr><tr><td class="lp">Subject</td><td class="rp" itemprop="name">[PATCH 1/19] MUTEX: Introduce simple mutex implementation</td></tr></table></td><td></td></tr></table><pre itemprop="articleBody">The attached patch introduces a simple mutex implementation as an alternative to the usual semaphore implementation where simple mutex functionality is all that is required. This is useful in two ways: (1) A number of archs only provide very simple atomic instructions (such as XCHG on i386, TAS on M68K, SWAP on FRV) which aren't sufficient to implement full semaphore support directly. Instead spinlocks must be employed to implement fuller functionality. (2) This makes it obvious in what way the semaphore is being used: whether it's being used as a mutex or being used as a counter. This patch set does the following: (1) Provides a simple xchg() based semaphore as a default for all architectures that don't wish to override it and provide their own. Overriding is possible by setting CONFIG_ARCH_IMPLEMENTS_MUTEX and supplying asm/mutex.h Partial overriding is possible by #defining mutex_grab(), mutex_release() and is_mutex_locked() to perform the appropriate optimised functions. (2) Provides linux/mutex.h as a common include for gaining access to mutex semaphores. (3) Provides linux/semaphore.h as a common include for gaining access to all the different types of semaphore that may be used from within the kernel. (4) Renames down*() to down_sem*() and up() to up_sem() for the traditional semaphores, and removes init_MUTEX*() and DECLARE_MUTEX*() from asm/semaphore.h (5) Redirects the following to apply to the new mutexes rather than the traditional semaphores: down() down_trylock() down_interruptible() up() init_MUTEX() init_MUTEX_LOCKED() DECLARE_MUTEX() DECLARE_MUTEX_LOCKED() On the basis that most usages of semaphores are as mutexes, this makes sense for in most cases it's just then a matter of changing the type from struct semaphore to struct mutex. In some cases, sema_init() has to be changed to init_MUTEX*() also. (6) Generally include linux/semaphore.h in place of asm/semaphore.h. (7) Provides a debugging config option CONFIG_DEBUG_MUTEX_OWNER by which the mutex owner can be tracked and by which over-upping can be detected. Signed-Off-By: David Howells <dhowells@redhat.com> --- warthog>diffstat -p1 mutex-simple-2615rc5.diff include/linux/mutex-simple.h | 194 +++++++++++++++++++++++++++++++++++++++++++ include/linux/mutex.h | 32 +++++++ include/linux/semaphore.h | 30 ++++++ lib/Kconfig.debug | 8 + lib/Makefile | 4 lib/mutex-simple.c | 178 +++++++++++++++++++++++++++++++++++++++ lib/semaphore-sleepers.c | 8 - 7 files changed, 450 insertions(+), 4 deletions(-) diff -uNrp /warthog/kernels/linux-2.6.15-rc5/include/linux/semaphore.h linux-2.6.15-rc5-mutex/include/linux/semaphore.h --- /warthog/kernels/linux-2.6.15-rc5/include/linux/semaphore.h 1970-01-01 01:00:00.000000000 +0100 +++ linux-2.6.15-rc5-mutex/include/linux/semaphore.h 2005-12-12 22:03:53.000000000 +0000 @@ -0,0 +1,30 @@ +/* semaphore.h: include the various types of semaphore in one package + * + * Copyright (C) 2005 Red Hat, Inc. All Rights Reserved. + * Written by David Howells (dhowells@redhat.com) + * + * This program is free software; you can redistribute it and/or + * modify it under the terms of the GNU General Public License + * as published by the Free Software Foundation; either version + * 2 of the License, or (at your option) any later version. + */ + +#ifndef _LINUX_SEMAPHORE_H +#define _LINUX_SEMAPHORE_H + +/* + * simple mutex semaphores + */ +#include <linux/mutex.h> + +/* + * multiple-count semaphores + */ +#include <asm/semaphore.h> + +/* + * read/write semaphores + */ +#include <linux/rwsem.h> + +#endif /* _LINUX_SEMAPHORE_H */ diff -uNrp /warthog/kernels/linux-2.6.15-rc5/include/linux/mutex.h linux-2.6.15-rc5-mutex/include/linux/mutex.h --- /warthog/kernels/linux-2.6.15-rc5/include/linux/mutex.h 1970-01-01 01:00:00.000000000 +0100 +++ linux-2.6.15-rc5-mutex/include/linux/mutex.h 2005-12-12 22:13:30.000000000 +0000 @@ -0,0 +1,32 @@ +/* mutex.h: mutex semaphore implementation base + * + * Copyright (C) 2005 Red Hat, Inc. All Rights Reserved. + * Written by David Howells (dhowells@redhat.com) + * + * This program is free software; you can redistribute it and/or + * modify it under the terms of the GNU General Public License + * as published by the Free Software Foundation; either version + * 2 of the License, or (at your option) any later version. + */ +#ifndef _LINUX_MUTEX_H +#define _LINUX_MUTEX_H + +#include <linux/config.h> + +#ifdef CONFIG_ARCH_IMPLEMENTS_MUTEX + +/* + * the arch wants to implement the whole mutex itself + */ +#include <asm/mutex.h> +#else + +/* + * simple exchange-based mutex + * - the arch may override mutex_grab(), mutex_release() and is_mutex_locked() + * to use something other than xchg() by #defining mutex_grab + */ +#include <linux/mutex-simple.h> +#endif + +#endif /* _LINUX_MUTEX_H */ diff -uNrp /warthog/kernels/linux-2.6.15-rc5/include/linux/mutex-simple.h linux-2.6.15-rc5-mutex/include/linux/mutex-simple.h --- /warthog/kernels/linux-2.6.15-rc5/include/linux/mutex-simple.h 1970-01-01 01:00:00.000000000 +0100 +++ linux-2.6.15-rc5-mutex/include/linux/mutex-simple.h 2005-12-12 22:26:11.000000000 +0000 @@ -0,0 +1,194 @@ +/* mutex-simple.h: simple exchange-based mutexes + * + * Copyright (C) 2005 Red Hat, Inc. All Rights Reserved. + * Written by David Howells (dhowells@redhat.com) + * + * This program is free software; you can redistribute it and/or + * modify it under the terms of the GNU General Public License + * as published by the Free Software Foundation; either version + * 2 of the License, or (at your option) any later version. + * + * + * This doesn't require the arch to do anything for straightforward xchg() + * based mutexes + * + * If the sets CONFIG_ARCH_IMPLEMENTS_MUTEX then this implementation will not + * be used, and the arch should supply asm/mutex.h. + * + * If the arch defines mutex_grab(), mutex_release() and is_mutex_locked() for + * itself, then those will be used to provide the appropriate functionality + * + * See lib/mutex-simple.c for the slow-path implementation. + */ +#ifndef _LINUX_MUTEX_SIMPLE_H +#define _LINUX_MUTEX_SIMPLE_H + +#ifndef _LINUX_MUTEX_H +#error linux/mutex-xchg.h should not be included directly; use linux/mutex.h instead +#endif + +#ifndef __ASSEMBLY__ + +#include <linux/linkage.h> +#include <linux/wait.h> +#include <linux/spinlock.h> +#include <asm/system.h> + +/* + * the mutex semaphore definition + * - if state is 0, then the mutex is available + * - if state is non-zero, then the mutex is busy + * - if wait_list is not empty, then there are processes waiting for the mutex + */ +struct mutex { + int state; + spinlock_t wait_lock; + struct list_head wait_list; +#ifdef CONFIG_DEBUG_MUTEX_OWNER + struct task_struct *__owner; +#endif +}; + +#ifndef mutex_grab +/* + * mutex_grab() attempts to grab the mutex and returns true if successful + */ +#define mutex_grab(mutex) (xchg(&(mutex)->state, 1) == 0) + +/* + * mutex_release() releases the mutex + */ +#define mutex_release(mutex) do { (mutex)->state = 0; } while(0) + +/* + * is_mutex_locked() returns non-zero if the mutex is locked + */ +#define is_mutex_locked(mutex) ((mutex)->state) +#endif + +#ifdef CONFIG_DEBUG_MUTEX_OWNER +# define __MUTEX_OWNER_INIT(owner) , .__owner = (owner) +#else +# define __MUTEX_OWNER_INIT(owner) +#endif + +#define __MUTEX_INITIALISER(name,_state,owner) \ +{ \ + .state = (_state), \ + .wait_lock = SPIN_LOCK_UNLOCKED, \ + .wait_list = LIST_HEAD_INIT((name).wait_list) \ + __MUTEX_OWNER_INIT(owner) \ +} + +#define __DECLARE_MUTEX_GENERIC(name, owner, state) \ + struct mutex name = __MUTEX_INITIALISER(name, owner, state) + +#define DECLARE_MUTEX(name) \ + __DECLARE_MUTEX_GENERIC(name, 0, NULL) + +#define DECLARE_MUTEX_LOCKED(name, owner) \ + __DECLARE_MUTEX_GENERIC(name, 1, (owner)) + +static inline void mutex_init(struct mutex *mutex, + unsigned state, + struct task_struct *owner) +{ + mutex->state = state; + spin_lock_init(&mutex->wait_lock); + INIT_LIST_HEAD(&mutex->wait_list); +#ifdef CONFIG_DEBUG_MUTEX_OWNER + mutex->__owner = owner; +#endif +} + +static inline void init_MUTEX(struct mutex *mutex) +{ + mutex_init(mutex, 0, NULL); +} + +static inline void init_MUTEX_LOCKED (struct mutex *mutex) +{ + mutex_init(mutex, 1, current); +} + +extern void __down(struct mutex *mutex); +extern int __down_interruptible(struct mutex *mutex); +extern void __up(struct mutex *mutex); + +#ifdef CONFIG_DEBUG_MUTEX_OWNER +extern void __up_bad(struct mutex *mutex); +#endif + +/* + * sleep until we get the mutex + */ +static inline void down(struct mutex *mutex) +{ + if (mutex_grab(mutex)) { +#ifdef CONFIG_DEBUG_MUTEX_OWNER + mutex->__owner = current; +#endif + } + else { + __down(mutex); + } +} + +/* + * sleep interruptibly until we get the mutex + * - return 0 if successful, -EINTR if interrupted + */ +static inline int down_interruptible(struct mutex *mutex) +{ + if (mutex_grab(mutex)) { +#ifdef CONFIG_DEBUG_MUTEX_OWNER + mutex->__owner = current; +#endif + return 0; + } + + return __down_interruptible(mutex); +} + +/* + * attempt to grab the mutex without waiting for it to become available + * - returns zero if we acquired it + */ +static inline int down_trylock(struct mutex *mutex) +{ + if (mutex_grab(mutex)) { + /* success */ +#ifdef CONFIG_DEBUG_MUTEX_OWNER + mutex->__owner = current; +#endif + return 0; + } + + /* failure */ + return 1; +} + +/* + * release the mutex + */ +static inline void up(struct mutex *mutex) +{ + unsigned long flags; + +#ifdef CONFIG_DEBUG_MUTEX_OWNER + if (mutex->__owner != current) + __up_bad(mutex); + mutex->__owner = NULL; +#endif + + /* must prevent a race */ + spin_lock_irqsave(&mutex->wait_lock, flags); + if (!list_empty(&mutex->wait_list)) + __up(mutex); + else + mutex_release(mutex); + spin_unlock_irqrestore(&mutex->wait_lock, flags); +} + +#endif /* __ASSEMBLY__ */ +#endif /* _LINUX_MUTEX_SIMPLE_H */ diff -uNrp /warthog/kernels/linux-2.6.15-rc5/lib/Kconfig.debug linux-2.6.15-rc5-mutex/lib/Kconfig.debug --- /warthog/kernels/linux-2.6.15-rc5/lib/Kconfig.debug 2005-12-08 16:23:56.000000000 +0000 +++ linux-2.6.15-rc5-mutex/lib/Kconfig.debug 2005-12-12 16:59:35.000000000 +0000 @@ -111,6 +111,14 @@ config DEBUG_SPINLOCK_SLEEP If you say Y here, various routines which may sleep will become very noisy if they are called with a spinlock held. +config DEBUG_MUTEX_OWNER + bool "Mutex owner tracking and checking" + depends on DEBUG_KERNEL + help + If you say Y here, the process currently owning a mutex will be + remembered, and a warning will be issued if anyone other than that + process releases it. + config DEBUG_KOBJECT bool "kobject debugging" depends on DEBUG_KERNEL diff -uNrp /warthog/kernels/linux-2.6.15-rc5/lib/Makefile linux-2.6.15-rc5-mutex/lib/Makefile --- /warthog/kernels/linux-2.6.15-rc5/lib/Makefile 2005-12-08 16:23:56.000000000 +0000 +++ linux-2.6.15-rc5-mutex/lib/Makefile 2005-12-12 18:59:21.000000000 +0000 @@ -28,6 +28,10 @@ ifneq ($(CONFIG_HAVE_DEC_LOCK),y) lib-y += dec_and_lock.o endif +ifneq ($(CONFIG_ARCH_IMPLEMENTS_MUTEX),y) + lib-y += mutex-simple.o +endif + obj-$(CONFIG_CRC_CCITT) += crc-ccitt.o obj-$(CONFIG_CRC16) += crc16.o obj-$(CONFIG_CRC32) += crc32.o diff -uNrp /warthog/kernels/linux-2.6.15-rc5/lib/mutex-simple.c linux-2.6.15-rc5-mutex/lib/mutex-simple.c --- /warthog/kernels/linux-2.6.15-rc5/lib/mutex-simple.c 1970-01-01 01:00:00.000000000 +0100 +++ linux-2.6.15-rc5-mutex/lib/mutex-simple.c 2005-12-12 22:27:00.000000000 +0000 @@ -0,0 +1,178 @@ +/* mutex-simple.c: simple mutex slow paths + * + * Copyright (C) 2005 Red Hat, Inc. All Rights Reserved. + * Written by David Howells (dhowells@redhat.com) + * + * This program is free software; you can redistribute it and/or + * modify it under the terms of the GNU General Public License + * as published by the Free Software Foundation; either version + * 2 of the License, or (at your option) any later version. + */ + +#include <linux/config.h> +#include <linux/sched.h> +#include <linux/module.h> +#include <linux/mutex.h> + +struct mutex_waiter { + struct list_head list; + struct task_struct *task; +}; + +/* + * wait for a token to be granted from a mutex + */ +void __down(struct mutex *mutex) +{ + struct mutex_waiter waiter; + struct task_struct *tsk = current; + unsigned long flags; + + /* set up my own style of waitqueue */ + waiter.task = tsk; + + spin_lock_irqsave(&mutex->wait_lock, flags); + + if (mutex_grab(mutex)) { + /* we got the mutex anyway */ + spin_unlock_irqrestore(&mutex->wait_lock, flags); + return; + } + + /* need to sleep */ + get_task_struct(tsk); + list_add_tail(&waiter.list, &mutex->wait_list); + + /* we don't need to touch the mutex struct anymore */ + spin_unlock_irqrestore(&mutex->wait_lock, flags); + + /* wait to be given the mutex */ + set_task_state(tsk, TASK_UNINTERRUPTIBLE); + + for (;;) { + if (list_empty(&waiter.list)) + break; + schedule(); + set_task_state(tsk, TASK_UNINTERRUPTIBLE); + } + + tsk->state = TASK_RUNNING; +} + +EXPORT_SYMBOL(__down); + +/* + * interruptibly wait for a token to be granted from a mutex + */ +int __down_interruptible(struct mutex *mutex) +{ + struct mutex_waiter waiter; + struct task_struct *tsk = current; + unsigned long flags; + int ret; + + /* set up my own style of waitqueue */ + waiter.task = tsk; + + spin_lock_irqsave(&mutex->wait_lock, flags); + + if (mutex_grab(mutex)) { + /* we got the mutex anyway */ + spin_unlock_irqrestore(&mutex->wait_lock, flags); + return 0; + } + + /* need to sleep */ + get_task_struct(tsk); + list_add_tail(&waiter.list, &mutex->wait_list); + + /* we don't need to touch the mutex struct anymore */ + set_task_state(tsk, TASK_INTERRUPTIBLE); + + spin_unlock_irqrestore(&mutex->wait_lock, flags); + + /* wait to be given the mutex */ + for (;;) { + if (list_empty(&waiter.list)) + break; + if (unlikely(signal_pending(current))) + goto interrupted; + schedule(); + set_task_state(tsk, TASK_INTERRUPTIBLE); + } + + tsk->state = TASK_RUNNING; + return 0; + +interrupted: + spin_lock_irqsave(&mutex->wait_lock, flags); + + /* we may still have been given the mutex */ + ret = 0; + if (!list_empty(&waiter.list)) { + list_del(&waiter.list); + ret = -EINTR; + } + + spin_unlock_irqrestore(&mutex->wait_lock, flags); + if (ret == -EINTR) + put_task_struct(current); + return ret; +} + +EXPORT_SYMBOL(__down_interruptible); + +/* + * release a single token back to a mutex + * - entered with lock held and interrupts disabled + * - the queue will not be empty + */ +void __up(struct mutex *mutex) +{ + struct mutex_waiter *waiter; + struct task_struct *tsk; + + /* grant the token to the process at the front of the queue */ + waiter = list_entry(mutex->wait_list.next, struct mutex_waiter, list); + + /* we must be careful not to touch 'waiter' after we set ->task = NULL. + * - it is an allocated on the waiter's stack and may become invalid at + * any time after that point (due to a wakeup from another source). + */ + list_del_init(&waiter->list); + tsk = waiter->task; +#ifdef CONFIG_DEBUG_MUTEX_OWNER + mutex->__owner = tsk; +#endif + mb(); + waiter->task = NULL; + wake_up_process(tsk); + put_task_struct(tsk); +} + +EXPORT_SYMBOL(__up); + +/* + * report an up() that doesn't match a down() + */ +#ifdef CONFIG_DEBUG_MUTEX_OWNER +void __up_bad(struct mutex *mutex) +{ + if (!mutex->__owner) { + printk(KERN_ERR + "BUG: process %d [%s] releasing unowned mutex\n", + current->pid, + current->comm); + } + else { + printk(KERN_ERR + "BUG: process %d [%s] releasing mutex owned by %d [%s]\n", + current->pid, + current->comm, + mutex->__owner->pid, + mutex->__owner->comm); + } +} + +EXPORT_SYMBOL(__up_bad); +#endif diff -uNrp /warthog/kernels/linux-2.6.15-rc5/lib/semaphore-sleepers.c linux-2.6.15-rc5-mutex/lib/semaphore-sleepers.c --- /warthog/kernels/linux-2.6.15-rc5/lib/semaphore-sleepers.c 2005-11-01 13:19:22.000000000 +0000 +++ linux-2.6.15-rc5-mutex/lib/semaphore-sleepers.c 2005-12-12 17:58:35.000000000 +0000 @@ -49,12 +49,12 @@ * we cannot lose wakeup events. */ -fastcall void __up(struct semaphore *sem) +fastcall void __up_sem(struct semaphore *sem) { wake_up(&sem->wait); } -fastcall void __sched __down(struct semaphore * sem) +fastcall void __sched __down_sem(struct semaphore * sem) { struct task_struct *tsk = current; DECLARE_WAITQUEUE(wait, tsk); @@ -91,7 +91,7 @@ fastcall void __sched __down(struct sema tsk->state = TASK_RUNNING; } -fastcall int __sched __down_interruptible(struct semaphore * sem) +fastcall int __sched __down_sem_interruptible(struct semaphore * sem) { int retval = 0; struct task_struct *tsk = current; @@ -154,7 +154,7 @@ fastcall int __sched __down_interruptibl * single "cmpxchg" without failure cases, * but then it wouldn't work on a 386. */ -fastcall int __down_trylock(struct semaphore * sem) +fastcall int __down_sem_trylock(struct semaphore * sem) { int sleepers; unsigned long flags; - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at <a href="http://vger.kernel.org/majordomo-info.html">http://vger.kernel.org/majordomo-info.html</a> Please read the FAQ at <a href="http://www.tux.org/lkml/">http://www.tux.org/lkml/</a> </pre></td><td width="32" rowspan="2" class="c" valign="top"><img src="/images/icornerr.gif" width="32" height="32" alt="\" /></td></tr><tr><td align="right" valign="bottom"> 聽 </td></tr><tr><td align="right" valign="bottom">聽</td><td class="c" valign="bottom" style="padding-bottom: 0px"><img src="/images/bcornerl.gif" width="32" height="32" alt="\" /></td><td class="c">聽</td><td class="c" valign="bottom" style="padding-bottom: 0px"><img src="/images/bcornerr.gif" width="32" height="32" alt="/" /></td></tr><tr><td align="right" valign="top" colspan="2"> 聽 </td><td class="lm">Last update: 2005-12-13 00:51 聽聽 [from the cache] 漏2003-2020 <a href="http://blog.jasper.es/">Jasper Spaans</a>|hosted at <a href="https://www.digitalocean.com/?refcode=9a8e99d24cf9">Digital Ocean</a> and my Meterkast|<a href="http://blog.jasper.es/categories.html#lkml-ref">Read the blog</a></td><td>聽</td></tr></table><script language="javascript" src="/js/styleswitcher.js" type="text/javascript"></script></body></html>