spinlock.h 6.0 KB
Newer Older
H
H. Peter Anvin 已提交
1 2
#ifndef _ASM_X86_SPINLOCK_H
#define _ASM_X86_SPINLOCK_H
3

A
Arun Sharma 已提交
4
#include <linux/atomic.h>
T
Thomas Gleixner 已提交
5 6
#include <asm/page.h>
#include <asm/processor.h>
N
Nick Piggin 已提交
7
#include <linux/compiler.h>
8
#include <asm/paravirt.h>
T
Thomas Gleixner 已提交
9 10 11 12 13 14
/*
 * Your basic SMP spinlocks, allowing only a single CPU anywhere
 *
 * Simple spin lock operations.  There are two variants, one clears IRQ's
 * on the local processor, one does not.
 *
15
 * These are fair FIFO ticket locks, which support up to 2^16 CPUs.
T
Thomas Gleixner 已提交
16 17 18 19
 *
 * (the type definitions are in asm/spinlock_types.h)
 */

20
#ifdef CONFIG_X86_32
T
Thomas Gleixner 已提交
21
# define LOCK_PTR_REG "a"
22
#else
T
Thomas Gleixner 已提交
23 24 25
# define LOCK_PTR_REG "D"
#endif

N
Nick Piggin 已提交
26 27 28 29 30 31 32 33 34
#if defined(CONFIG_X86_32) && \
	(defined(CONFIG_X86_OOSTORE) || defined(CONFIG_X86_PPRO_FENCE))
/*
 * On PPro SMP or if we are using OOSTORE, we use a locked operation to unlock
 * (PPro errata 66, 92)
 */
# define UNLOCK_LOCK_PREFIX LOCK_PREFIX
#else
# define UNLOCK_LOCK_PREFIX
N
Nick Piggin 已提交
35 36
#endif

N
Nick Piggin 已提交
37 38 39 40 41 42 43 44 45 46 47 48 49
/*
 * Ticket locks are conceptually two parts, one indicating the current head of
 * the queue, and the other indicating the current tail. The lock is acquired
 * by atomically noting the tail and incrementing it by one (thus adding
 * ourself to the queue and noting our position), then waiting until the head
 * becomes equal to the the initial value of the tail.
 *
 * We use an xadd covering *both* parts of the lock, to increment the tail and
 * also load the position of the head, which takes care of memory ordering
 * issues and should be optimal for the uncontended case. Note the tail must be
 * in the high part, because a wide xadd increment of the low part would carry
 * up and contaminate the high part.
 */
50
static __always_inline void __ticket_spin_lock(arch_spinlock_t *lock)
T
Thomas Gleixner 已提交
51
{
52
	register struct __raw_tickets inc = { .tail = 1 };
N
Nick Piggin 已提交
53

54
	inc = xadd(&lock->tickets, inc);
55 56

	for (;;) {
57
		if (inc.head == inc.tail)
58 59
			break;
		cpu_relax();
60
		inc.head = ACCESS_ONCE(lock->tickets.head);
61 62
	}
	barrier();		/* make sure nothing creeps before the lock is taken */
T
Thomas Gleixner 已提交
63
}
N
Nick Piggin 已提交
64

65
static __always_inline int __ticket_spin_trylock(arch_spinlock_t *lock)
T
Thomas Gleixner 已提交
66
{
67 68 69 70 71
	arch_spinlock_t old, new;

	old.tickets = ACCESS_ONCE(lock->tickets);
	if (old.tickets.head != old.tickets.tail)
		return 0;
N
Nick Piggin 已提交
72

73 74 75 76
	new.head_tail = old.head_tail + (1 << TICKET_SHIFT);

	/* cmpxchg is a full barrier, so nothing can move before it */
	return cmpxchg(&lock->head_tail, old.head_tail, new.head_tail) == old.head_tail;
T
Thomas Gleixner 已提交
77 78
}

79
static __always_inline void __ticket_spin_unlock(arch_spinlock_t *lock)
N
Nick Piggin 已提交
80
{
81
	__add(&lock->tickets.head, 1, UNLOCK_LOCK_PREFIX);
N
Nick Piggin 已提交
82
}
T
Thomas Gleixner 已提交
83

84
static inline int __ticket_spin_is_locked(arch_spinlock_t *lock)
85
{
86
	struct __raw_tickets tmp = ACCESS_ONCE(lock->tickets);
87

88
	return tmp.tail != tmp.head;
89 90
}

91
static inline int __ticket_spin_is_contended(arch_spinlock_t *lock)
92
{
93
	struct __raw_tickets tmp = ACCESS_ONCE(lock->tickets);
94

95
	return (__ticket_t)(tmp.tail - tmp.head) > 1;
96
}
97

98
#ifndef CONFIG_PARAVIRT_SPINLOCKS
99

100
static inline int arch_spin_is_locked(arch_spinlock_t *lock)
101 102 103 104
{
	return __ticket_spin_is_locked(lock);
}

105
static inline int arch_spin_is_contended(arch_spinlock_t *lock)
106 107 108
{
	return __ticket_spin_is_contended(lock);
}
109
#define arch_spin_is_contended	arch_spin_is_contended
110

111
static __always_inline void arch_spin_lock(arch_spinlock_t *lock)
112 113 114 115
{
	__ticket_spin_lock(lock);
}

116
static __always_inline int arch_spin_trylock(arch_spinlock_t *lock)
117 118 119 120
{
	return __ticket_spin_trylock(lock);
}

121
static __always_inline void arch_spin_unlock(arch_spinlock_t *lock)
122 123 124
{
	__ticket_spin_unlock(lock);
}
125

126
static __always_inline void arch_spin_lock_flags(arch_spinlock_t *lock,
127 128
						  unsigned long flags)
{
129
	arch_spin_lock(lock);
130 131
}

132
#endif	/* CONFIG_PARAVIRT_SPINLOCKS */
133

134
static inline void arch_spin_unlock_wait(arch_spinlock_t *lock)
T
Thomas Gleixner 已提交
135
{
136
	while (arch_spin_is_locked(lock))
T
Thomas Gleixner 已提交
137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
		cpu_relax();
}

/*
 * Read-write spinlocks, allowing multiple readers
 * but only one writer.
 *
 * NOTE! it is quite common to have readers in interrupts
 * but no interrupt writers. For those circumstances we
 * can "mix" irq-safe locks - any writer needs to get a
 * irq-safe write-lock, but readers can get non-irqsafe
 * read-locks.
 *
 * On x86, we implement read-write locks as a 32-bit counter
 * with the high bit (sign) being the "contended" bit.
 */

N
Nick Piggin 已提交
154 155 156 157
/**
 * read_can_lock - would read_trylock() succeed?
 * @lock: the rwlock in question.
 */
158
static inline int arch_read_can_lock(arch_rwlock_t *lock)
T
Thomas Gleixner 已提交
159
{
160
	return lock->lock > 0;
T
Thomas Gleixner 已提交
161 162
}

N
Nick Piggin 已提交
163 164 165 166
/**
 * write_can_lock - would write_trylock() succeed?
 * @lock: the rwlock in question.
 */
167
static inline int arch_write_can_lock(arch_rwlock_t *lock)
T
Thomas Gleixner 已提交
168
{
169
	return lock->write == WRITE_LOCK_CMP;
T
Thomas Gleixner 已提交
170 171
}

172
static inline void arch_read_lock(arch_rwlock_t *rw)
T
Thomas Gleixner 已提交
173
{
174
	asm volatile(LOCK_PREFIX READ_LOCK_SIZE(dec) " (%0)\n\t"
T
Thomas Gleixner 已提交
175 176 177 178 179 180
		     "jns 1f\n"
		     "call __read_lock_failed\n\t"
		     "1:\n"
		     ::LOCK_PTR_REG (rw) : "memory");
}

181
static inline void arch_write_lock(arch_rwlock_t *rw)
T
Thomas Gleixner 已提交
182
{
183
	asm volatile(LOCK_PREFIX WRITE_LOCK_SUB(%1) "(%0)\n\t"
T
Thomas Gleixner 已提交
184 185 186
		     "jz 1f\n"
		     "call __write_lock_failed\n\t"
		     "1:\n"
187 188
		     ::LOCK_PTR_REG (&rw->write), "i" (RW_LOCK_BIAS)
		     : "memory");
T
Thomas Gleixner 已提交
189 190
}

191
static inline int arch_read_trylock(arch_rwlock_t *lock)
T
Thomas Gleixner 已提交
192
{
193
	READ_LOCK_ATOMIC(t) *count = (READ_LOCK_ATOMIC(t) *)lock;
T
Thomas Gleixner 已提交
194

195
	if (READ_LOCK_ATOMIC(dec_return)(count) >= 0)
T
Thomas Gleixner 已提交
196
		return 1;
197
	READ_LOCK_ATOMIC(inc)(count);
T
Thomas Gleixner 已提交
198 199 200
	return 0;
}

201
static inline int arch_write_trylock(arch_rwlock_t *lock)
T
Thomas Gleixner 已提交
202
{
203
	atomic_t *count = (atomic_t *)&lock->write;
T
Thomas Gleixner 已提交
204

205
	if (atomic_sub_and_test(WRITE_LOCK_CMP, count))
T
Thomas Gleixner 已提交
206
		return 1;
207
	atomic_add(WRITE_LOCK_CMP, count);
T
Thomas Gleixner 已提交
208 209 210
	return 0;
}

211
static inline void arch_read_unlock(arch_rwlock_t *rw)
T
Thomas Gleixner 已提交
212
{
213 214
	asm volatile(LOCK_PREFIX READ_LOCK_SIZE(inc) " %0"
		     :"+m" (rw->lock) : : "memory");
T
Thomas Gleixner 已提交
215 216
}

217
static inline void arch_write_unlock(arch_rwlock_t *rw)
T
Thomas Gleixner 已提交
218
{
219 220
	asm volatile(LOCK_PREFIX WRITE_LOCK_ADD(%1) "%0"
		     : "+m" (rw->write) : "i" (RW_LOCK_BIAS) : "memory");
T
Thomas Gleixner 已提交
221 222
}

223 224
#define arch_read_lock_flags(lock, flags) arch_read_lock(lock)
#define arch_write_lock_flags(lock, flags) arch_write_lock(lock)
225

226 227 228 229 230 231
#undef READ_LOCK_SIZE
#undef READ_LOCK_ATOMIC
#undef WRITE_LOCK_ADD
#undef WRITE_LOCK_SUB
#undef WRITE_LOCK_CMP

232 233 234
#define arch_spin_relax(lock)	cpu_relax()
#define arch_read_relax(lock)	cpu_relax()
#define arch_write_relax(lock)	cpu_relax()
T
Thomas Gleixner 已提交
235

H
H. Peter Anvin 已提交
236
#endif /* _ASM_X86_SPINLOCK_H */