aboutsummaryrefslogtreecommitdiffstats
path: root/include
diff options
context:
space:
mode:
authorTim Chen <tim.c.chen@linux.intel.com>2014-01-21 18:36:00 -0500
committerIngo Molnar <mingo@kernel.org>2014-01-28 07:13:27 -0500
commite72246748ff006ab928bc774e276e6ef5542f9c5 (patch)
treeb3021f1615d2088ce20fc02bd61e9f2baab72dd1 /include
parentaff7385b5a16bca6b8d9243f01a9ea5a5b411e1d (diff)
locking/mutexes/mcs: Restructure the MCS lock defines and locking code into its own file
We will need the MCS lock code for doing optimistic spinning for rwsem and queued rwlock. Extracting the MCS code from mutex.c and put into its own file allow us to reuse this code easily. We also inline mcs_spin_lock and mcs_spin_unlock functions for better efficiency. Note that using the smp_load_acquire/smp_store_release pair used in mcs_lock and mcs_unlock is not sufficient to form a full memory barrier across cpus for many architectures (except x86). For applications that absolutely need a full barrier across multiple cpus with mcs_unlock and mcs_lock pair, smp_mb__after_unlock_lock() should be used after mcs_lock. Reviewed-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com> Signed-off-by: Tim Chen <tim.c.chen@linux.intel.com> Signed-off-by: Davidlohr Bueso <davidlohr@hp.com> Signed-off-by: Peter Zijlstra <peterz@infradead.org> Cc: Linus Torvalds <torvalds@linux-foundation.org> Cc: Andrew Morton <akpm@linux-foundation.org> Cc: Thomas Gleixner <tglx@linutronix.de> Link: http://lkml.kernel.org/r/1390347360.3138.63.camel@schen9-DESK Signed-off-by: Ingo Molnar <mingo@kernel.org>
Diffstat (limited to 'include')
-rw-r--r--include/linux/mcs_spinlock.h77
-rw-r--r--include/linux/mutex.h5
2 files changed, 80 insertions, 2 deletions
diff --git a/include/linux/mcs_spinlock.h b/include/linux/mcs_spinlock.h
new file mode 100644
index 000000000000..9578ef81940b
--- /dev/null
+++ b/include/linux/mcs_spinlock.h
@@ -0,0 +1,77 @@
1/*
2 * MCS lock defines
3 *
4 * This file contains the main data structure and API definitions of MCS lock.
5 *
6 * The MCS lock (proposed by Mellor-Crummey and Scott) is a simple spin-lock
7 * with the desirable properties of being fair, and with each cpu trying
8 * to acquire the lock spinning on a local variable.
9 * It avoids expensive cache bouncings that common test-and-set spin-lock
10 * implementations incur.
11 */
12#ifndef __LINUX_MCS_SPINLOCK_H
13#define __LINUX_MCS_SPINLOCK_H
14
15struct mcs_spinlock {
16 struct mcs_spinlock *next;
17 int locked; /* 1 if lock acquired */
18};
19
20/*
21 * Note: the smp_load_acquire/smp_store_release pair is not
22 * sufficient to form a full memory barrier across
23 * cpus for many architectures (except x86) for mcs_unlock and mcs_lock.
24 * For applications that need a full barrier across multiple cpus
25 * with mcs_unlock and mcs_lock pair, smp_mb__after_unlock_lock() should be
26 * used after mcs_lock.
27 */
28static inline
29void mcs_spin_lock(struct mcs_spinlock **lock, struct mcs_spinlock *node)
30{
31 struct mcs_spinlock *prev;
32
33 /* Init node */
34 node->locked = 0;
35 node->next = NULL;
36
37 prev = xchg(lock, node);
38 if (likely(prev == NULL)) {
39 /* Lock acquired */
40 node->locked = 1;
41 return;
42 }
43 ACCESS_ONCE(prev->next) = node;
44 /*
45 * Wait until the lock holder passes the lock down.
46 * Using smp_load_acquire() provides a memory barrier that
47 * ensures subsequent operations happen after the lock is acquired.
48 */
49 while (!(smp_load_acquire(&node->locked)))
50 arch_mutex_cpu_relax();
51}
52
53static inline
54void mcs_spin_unlock(struct mcs_spinlock **lock, struct mcs_spinlock *node)
55{
56 struct mcs_spinlock *next = ACCESS_ONCE(node->next);
57
58 if (likely(!next)) {
59 /*
60 * Release the lock by setting it to NULL
61 */
62 if (cmpxchg(lock, node, NULL) == node)
63 return;
64 /* Wait until the next pointer is set */
65 while (!(next = ACCESS_ONCE(node->next)))
66 arch_mutex_cpu_relax();
67 }
68 /*
69 * Pass lock to next waiter.
70 * smp_store_release() provides a memory barrier to ensure
71 * all operations in the critical section has been completed
72 * before unlocking.
73 */
74 smp_store_release(&next->locked, 1);
75}
76
77#endif /* __LINUX_MCS_SPINLOCK_H */
diff --git a/include/linux/mutex.h b/include/linux/mutex.h
index d3181936c138..c482e1d2cc49 100644
--- a/include/linux/mutex.h
+++ b/include/linux/mutex.h
@@ -46,6 +46,7 @@
46 * - detects multi-task circular deadlocks and prints out all affected 46 * - detects multi-task circular deadlocks and prints out all affected
47 * locks and tasks (and only those tasks) 47 * locks and tasks (and only those tasks)
48 */ 48 */
49struct mcs_spinlock;
49struct mutex { 50struct mutex {
50 /* 1: unlocked, 0: locked, negative: locked, possible waiters */ 51 /* 1: unlocked, 0: locked, negative: locked, possible waiters */
51 atomic_t count; 52 atomic_t count;
@@ -55,7 +56,7 @@ struct mutex {
55 struct task_struct *owner; 56 struct task_struct *owner;
56#endif 57#endif
57#ifdef CONFIG_MUTEX_SPIN_ON_OWNER 58#ifdef CONFIG_MUTEX_SPIN_ON_OWNER
58 void *spin_mlock; /* Spinner MCS lock */ 59 struct mcs_spinlock *mcs_lock; /* Spinner MCS lock */
59#endif 60#endif
60#ifdef CONFIG_DEBUG_MUTEXES 61#ifdef CONFIG_DEBUG_MUTEXES
61 const char *name; 62 const char *name;
@@ -179,4 +180,4 @@ extern int atomic_dec_and_mutex_lock(atomic_t *cnt, struct mutex *lock);
179# define arch_mutex_cpu_relax() cpu_relax() 180# define arch_mutex_cpu_relax() cpu_relax()
180#endif 181#endif
181 182
182#endif 183#endif /* __LINUX_MUTEX_H */