x86: FIFO ticket spinlocks
[linux-2.6/libata-dev.git] / include / asm-x86 / spinlock.h
blob97d52b506af860ed5168dbd7c1483258c2186c26
1 #ifndef _X86_SPINLOCK_H_
2 #define _X86_SPINLOCK_H_
4 #include <asm/atomic.h>
5 #include <asm/rwlock.h>
6 #include <asm/page.h>
7 #include <asm/processor.h>
8 #include <linux/compiler.h>
11 * Your basic SMP spinlocks, allowing only a single CPU anywhere
13 * Simple spin lock operations. There are two variants, one clears IRQ's
14 * on the local processor, one does not.
16 * These are fair FIFO ticket locks, which are currently limited to 256
17 * CPUs.
19 * (the type definitions are in asm/spinlock_types.h)
22 #ifdef CONFIG_PARAVIRT
23 #include <asm/paravirt.h>
24 #else
25 #define CLI_STRING "cli"
26 #define STI_STRING "sti"
27 #define CLI_STI_CLOBBERS
28 #define CLI_STI_INPUT_ARGS
29 #endif /* CONFIG_PARAVIRT */
31 #ifdef CONFIG_X86_32
32 typedef char _slock_t;
33 # define LOCK_INS_DEC "decb"
34 # define LOCK_INS_XCH "xchgb"
35 # define LOCK_INS_MOV "movb"
36 # define LOCK_INS_CMP "cmpb"
37 # define LOCK_PTR_REG "a"
38 #else
39 typedef int _slock_t;
40 # define LOCK_INS_DEC "decl"
41 # define LOCK_INS_XCH "xchgl"
42 # define LOCK_INS_MOV "movl"
43 # define LOCK_INS_CMP "cmpl"
44 # define LOCK_PTR_REG "D"
45 #endif
47 #if (NR_CPUS > 256)
48 #error spinlock supports a maximum of 256 CPUs
49 #endif
51 static inline int __raw_spin_is_locked(raw_spinlock_t *lock)
53 int tmp = *(volatile signed int *)(&(lock)->slock);
55 return (((tmp >> 8) & 0xff) != (tmp & 0xff));
58 static inline int __raw_spin_is_contended(raw_spinlock_t *lock)
60 int tmp = *(volatile signed int *)(&(lock)->slock);
62 return (((tmp >> 8) & 0xff) - (tmp & 0xff)) > 1;
65 static inline void __raw_spin_lock(raw_spinlock_t *lock)
67 short inc = 0x0100;
70 * Ticket locks are conceptually two bytes, one indicating the current
71 * head of the queue, and the other indicating the current tail. The
72 * lock is acquired by atomically noting the tail and incrementing it
73 * by one (thus adding ourself to the queue and noting our position),
74 * then waiting until the head becomes equal to the the initial value
75 * of the tail.
77 * This uses a 16-bit xadd to increment the tail and also load the
78 * position of the head, which takes care of memory ordering issues
79 * and should be optimal for the uncontended case. Note the tail must
80 * be in the high byte, otherwise the 16-bit wide increment of the low
81 * byte would carry up and contaminate the high byte.
84 __asm__ __volatile__ (
85 LOCK_PREFIX "xaddw %w0, %1\n"
86 "1:\t"
87 "cmpb %h0, %b0\n\t"
88 "je 2f\n\t"
89 "rep ; nop\n\t"
90 "movb %1, %b0\n\t"
91 /* don't need lfence here, because loads are in-order */
92 "jmp 1b\n"
93 "2:"
94 :"+Q" (inc), "+m" (lock->slock)
96 :"memory", "cc");
99 #define __raw_spin_lock_flags(lock, flags) __raw_spin_lock(lock)
101 static inline int __raw_spin_trylock(raw_spinlock_t *lock)
103 int tmp;
104 short new;
106 asm volatile(
107 "movw %2,%w0\n\t"
108 "cmpb %h0,%b0\n\t"
109 "jne 1f\n\t"
110 "movw %w0,%w1\n\t"
111 "incb %h1\n\t"
112 "lock ; cmpxchgw %w1,%2\n\t"
113 "1:"
114 "sete %b1\n\t"
115 "movzbl %b1,%0\n\t"
116 :"=&a" (tmp), "=Q" (new), "+m" (lock->slock)
118 : "memory", "cc");
120 return tmp;
123 #if defined(CONFIG_X86_32) && \
124 (defined(CONFIG_X86_OOSTORE) || defined(CONFIG_X86_PPRO_FENCE))
126 * On PPro SMP or if we are using OOSTORE, we use a locked operation to unlock
127 * (PPro errata 66, 92)
129 # define UNLOCK_LOCK_PREFIX LOCK_PREFIX
130 #else
131 # define UNLOCK_LOCK_PREFIX
132 #endif
134 static inline void __raw_spin_unlock(raw_spinlock_t *lock)
136 __asm__ __volatile__(
137 UNLOCK_LOCK_PREFIX "incb %0"
138 :"+m" (lock->slock)
140 :"memory", "cc");
143 static inline void __raw_spin_unlock_wait(raw_spinlock_t *lock)
145 while (__raw_spin_is_locked(lock))
146 cpu_relax();
150 * Read-write spinlocks, allowing multiple readers
151 * but only one writer.
153 * NOTE! it is quite common to have readers in interrupts
154 * but no interrupt writers. For those circumstances we
155 * can "mix" irq-safe locks - any writer needs to get a
156 * irq-safe write-lock, but readers can get non-irqsafe
157 * read-locks.
159 * On x86, we implement read-write locks as a 32-bit counter
160 * with the high bit (sign) being the "contended" bit.
164 * read_can_lock - would read_trylock() succeed?
165 * @lock: the rwlock in question.
167 static inline int __raw_read_can_lock(raw_rwlock_t *lock)
169 return (int)(lock)->lock > 0;
173 * write_can_lock - would write_trylock() succeed?
174 * @lock: the rwlock in question.
176 static inline int __raw_write_can_lock(raw_rwlock_t *lock)
178 return (lock)->lock == RW_LOCK_BIAS;
181 static inline void __raw_read_lock(raw_rwlock_t *rw)
183 asm volatile(LOCK_PREFIX " subl $1,(%0)\n\t"
184 "jns 1f\n"
185 "call __read_lock_failed\n\t"
186 "1:\n"
187 ::LOCK_PTR_REG (rw) : "memory");
190 static inline void __raw_write_lock(raw_rwlock_t *rw)
192 asm volatile(LOCK_PREFIX " subl %1,(%0)\n\t"
193 "jz 1f\n"
194 "call __write_lock_failed\n\t"
195 "1:\n"
196 ::LOCK_PTR_REG (rw), "i" (RW_LOCK_BIAS) : "memory");
199 static inline int __raw_read_trylock(raw_rwlock_t *lock)
201 atomic_t *count = (atomic_t *)lock;
203 atomic_dec(count);
204 if (atomic_read(count) >= 0)
205 return 1;
206 atomic_inc(count);
207 return 0;
210 static inline int __raw_write_trylock(raw_rwlock_t *lock)
212 atomic_t *count = (atomic_t *)lock;
214 if (atomic_sub_and_test(RW_LOCK_BIAS, count))
215 return 1;
216 atomic_add(RW_LOCK_BIAS, count);
217 return 0;
220 static inline void __raw_read_unlock(raw_rwlock_t *rw)
222 asm volatile(LOCK_PREFIX "incl %0" :"+m" (rw->lock) : : "memory");
225 static inline void __raw_write_unlock(raw_rwlock_t *rw)
227 asm volatile(LOCK_PREFIX "addl %1, %0"
228 : "+m" (rw->lock) : "i" (RW_LOCK_BIAS) : "memory");
231 #define _raw_spin_relax(lock) cpu_relax()
232 #define _raw_read_relax(lock) cpu_relax()
233 #define _raw_write_relax(lock) cpu_relax()
235 #endif