1 #ifndef _ASM_X86_SPINLOCK_H
2 #define _ASM_X86_SPINLOCK_H
4 #include <linux/atomic.h>
6 #include <asm/processor.h>
7 #include <linux/compiler.h>
8 #include <asm/paravirt.h>
10 * Your basic SMP spinlocks, allowing only a single CPU anywhere
12 * Simple spin lock operations. There are two variants, one clears IRQ's
13 * on the local processor, one does not.
15 * These are fair FIFO ticket locks, which are currently limited to 256
18 * (the type definitions are in asm/spinlock_types.h)
22 # define LOCK_PTR_REG "a"
23 # define REG_PTR_MODE "k"
25 # define LOCK_PTR_REG "D"
26 # define REG_PTR_MODE "q"
29 #if defined(CONFIG_X86_32) && \
30 (defined(CONFIG_X86_OOSTORE) || defined(CONFIG_X86_PPRO_FENCE))
32 * On PPro SMP or if we are using OOSTORE, we use a locked operation to unlock
33 * (PPro errata 66, 92)
35 # define UNLOCK_LOCK_PREFIX LOCK_PREFIX
37 # define UNLOCK_LOCK_PREFIX
41 * Ticket locks are conceptually two parts, one indicating the current head of
42 * the queue, and the other indicating the current tail. The lock is acquired
43 * by atomically noting the tail and incrementing it by one (thus adding
44 * ourself to the queue and noting our position), then waiting until the head
45 * becomes equal to the the initial value of the tail.
47 * We use an xadd covering *both* parts of the lock, to increment the tail and
48 * also load the position of the head, which takes care of memory ordering
49 * issues and should be optimal for the uncontended case. Note the tail must be
50 * in the high part, because a wide xadd increment of the low part would carry
51 * up and contaminate the high part.
53 static __always_inline
void __ticket_spin_lock(arch_spinlock_t
*lock
)
55 register struct __raw_tickets inc
= { .tail
= 1 };
57 inc
= xadd(&lock
->tickets
, inc
);
60 if (inc
.head
== inc
.tail
)
63 inc
.head
= ACCESS_ONCE(lock
->tickets
.head
);
65 barrier(); /* make sure nothing creeps before the lock is taken */
68 static __always_inline
int __ticket_spin_trylock(arch_spinlock_t
*lock
)
70 arch_spinlock_t old
, new;
72 old
.tickets
= ACCESS_ONCE(lock
->tickets
);
73 if (old
.tickets
.head
!= old
.tickets
.tail
)
76 new.head_tail
= old
.head_tail
+ (1 << TICKET_SHIFT
);
78 /* cmpxchg is a full barrier, so nothing can move before it */
79 return cmpxchg(&lock
->head_tail
, old
.head_tail
, new.head_tail
) == old
.head_tail
;
82 static __always_inline
void __ticket_spin_unlock(arch_spinlock_t
*lock
)
84 __add(&lock
->tickets
.head
, 1, UNLOCK_LOCK_PREFIX
);
87 static inline int __ticket_spin_is_locked(arch_spinlock_t
*lock
)
89 struct __raw_tickets tmp
= ACCESS_ONCE(lock
->tickets
);
91 return !!(tmp
.tail
^ tmp
.head
);
94 static inline int __ticket_spin_is_contended(arch_spinlock_t
*lock
)
96 struct __raw_tickets tmp
= ACCESS_ONCE(lock
->tickets
);
98 return ((tmp
.tail
- tmp
.head
) & TICKET_MASK
) > 1;
101 #ifndef CONFIG_PARAVIRT_SPINLOCKS
103 static inline int arch_spin_is_locked(arch_spinlock_t
*lock
)
105 return __ticket_spin_is_locked(lock
);
108 static inline int arch_spin_is_contended(arch_spinlock_t
*lock
)
110 return __ticket_spin_is_contended(lock
);
112 #define arch_spin_is_contended arch_spin_is_contended
114 static __always_inline
void arch_spin_lock(arch_spinlock_t
*lock
)
116 __ticket_spin_lock(lock
);
119 static __always_inline
int arch_spin_trylock(arch_spinlock_t
*lock
)
121 return __ticket_spin_trylock(lock
);
124 static __always_inline
void arch_spin_unlock(arch_spinlock_t
*lock
)
126 __ticket_spin_unlock(lock
);
129 static __always_inline
void arch_spin_lock_flags(arch_spinlock_t
*lock
,
132 arch_spin_lock(lock
);
135 #endif /* CONFIG_PARAVIRT_SPINLOCKS */
137 static inline void arch_spin_unlock_wait(arch_spinlock_t
*lock
)
139 while (arch_spin_is_locked(lock
))
144 * Read-write spinlocks, allowing multiple readers
145 * but only one writer.
147 * NOTE! it is quite common to have readers in interrupts
148 * but no interrupt writers. For those circumstances we
149 * can "mix" irq-safe locks - any writer needs to get a
150 * irq-safe write-lock, but readers can get non-irqsafe
153 * On x86, we implement read-write locks as a 32-bit counter
154 * with the high bit (sign) being the "contended" bit.
158 * read_can_lock - would read_trylock() succeed?
159 * @lock: the rwlock in question.
161 static inline int arch_read_can_lock(arch_rwlock_t
*lock
)
163 return lock
->lock
> 0;
167 * write_can_lock - would write_trylock() succeed?
168 * @lock: the rwlock in question.
170 static inline int arch_write_can_lock(arch_rwlock_t
*lock
)
172 return lock
->write
== WRITE_LOCK_CMP
;
175 static inline void arch_read_lock(arch_rwlock_t
*rw
)
177 asm volatile(LOCK_PREFIX
READ_LOCK_SIZE(dec
) " (%0)\n\t"
179 "call __read_lock_failed\n\t"
181 ::LOCK_PTR_REG (rw
) : "memory");
184 static inline void arch_write_lock(arch_rwlock_t
*rw
)
186 asm volatile(LOCK_PREFIX
WRITE_LOCK_SUB(%1) "(%0)\n\t"
188 "call __write_lock_failed\n\t"
190 ::LOCK_PTR_REG (&rw
->write
), "i" (RW_LOCK_BIAS
)
194 static inline int arch_read_trylock(arch_rwlock_t
*lock
)
196 READ_LOCK_ATOMIC(t
) *count
= (READ_LOCK_ATOMIC(t
) *)lock
;
198 if (READ_LOCK_ATOMIC(dec_return
)(count
) >= 0)
200 READ_LOCK_ATOMIC(inc
)(count
);
204 static inline int arch_write_trylock(arch_rwlock_t
*lock
)
206 atomic_t
*count
= (atomic_t
*)&lock
->write
;
208 if (atomic_sub_and_test(WRITE_LOCK_CMP
, count
))
210 atomic_add(WRITE_LOCK_CMP
, count
);
214 static inline void arch_read_unlock(arch_rwlock_t
*rw
)
216 asm volatile(LOCK_PREFIX
READ_LOCK_SIZE(inc
) " %0"
217 :"+m" (rw
->lock
) : : "memory");
220 static inline void arch_write_unlock(arch_rwlock_t
*rw
)
222 asm volatile(LOCK_PREFIX
WRITE_LOCK_ADD(%1) "%0"
223 : "+m" (rw
->write
) : "i" (RW_LOCK_BIAS
) : "memory");
226 #define arch_read_lock_flags(lock, flags) arch_read_lock(lock)
227 #define arch_write_lock_flags(lock, flags) arch_write_lock(lock)
229 #undef READ_LOCK_SIZE
230 #undef READ_LOCK_ATOMIC
231 #undef WRITE_LOCK_ADD
232 #undef WRITE_LOCK_SUB
233 #undef WRITE_LOCK_CMP
235 #define arch_spin_relax(lock) cpu_relax()
236 #define arch_read_relax(lock) cpu_relax()
237 #define arch_write_relax(lock) cpu_relax()
239 /* The {read|write|spin}_lock() on x86 are full memory barriers. */
240 static inline void smp_mb__after_lock(void) { }
241 #define ARCH_HAS_SMP_MB_AFTER_LOCK
243 #endif /* _ASM_X86_SPINLOCK_H */