2 * Copyright 2010 Tilera Corporation. All Rights Reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation, version 2.
8 * This program is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
11 * NON INFRINGEMENT. See the GNU General Public License for
14 * 32-bit SMP spinlocks.
17 #ifndef _ASM_TILE_SPINLOCK_32_H
18 #define _ASM_TILE_SPINLOCK_32_H
20 #include <linux/atomic.h>
22 #include <asm/system.h>
23 #include <linux/compiler.h>
26 * We only use even ticket numbers so the '1' inserted by a tns is
27 * an unambiguous "ticket is busy" flag.
29 #define TICKET_QUANTUM 2
33 * SMP ticket spinlocks, allowing only a single CPU anywhere
35 * (the type definitions are in asm/spinlock_types.h)
37 static inline int arch_spin_is_locked(arch_spinlock_t
*lock
)
40 * Note that even if a new ticket is in the process of being
41 * acquired, so lock->next_ticket is 1, it's still reasonable
42 * to claim the lock is held, since it will be momentarily
43 * if not already. There's no need to wait for a "valid"
44 * lock->next_ticket to become available.
46 return lock
->next_ticket
!= lock
->current_ticket
;
49 void arch_spin_lock(arch_spinlock_t
*lock
);
51 /* We cannot take an interrupt after getting a ticket, so don't enable them. */
52 #define arch_spin_lock_flags(lock, flags) arch_spin_lock(lock)
54 int arch_spin_trylock(arch_spinlock_t
*lock
);
56 static inline void arch_spin_unlock(arch_spinlock_t
*lock
)
58 /* For efficiency, overlap fetching the old ticket with the wmb(). */
59 int old_ticket
= lock
->current_ticket
;
60 wmb(); /* guarantee anything modified under the lock is visible */
61 lock
->current_ticket
= old_ticket
+ TICKET_QUANTUM
;
64 void arch_spin_unlock_wait(arch_spinlock_t
*lock
);
67 * Read-write spinlocks, allowing multiple readers
68 * but only one writer.
70 * We use a "tns/store-back" technique on a single word to manage
71 * the lock state, looping around to retry if the tns returns 1.
74 /* Internal layout of the word; do not use. */
75 #define _WR_NEXT_SHIFT 8
76 #define _WR_CURR_SHIFT 16
78 #define _RD_COUNT_SHIFT 24
79 #define _RD_COUNT_WIDTH 8
82 * arch_read_can_lock() - would read_trylock() succeed?
84 static inline int arch_read_can_lock(arch_rwlock_t
*rwlock
)
86 return (rwlock
->lock
<< _RD_COUNT_WIDTH
) == 0;
90 * arch_write_can_lock() - would write_trylock() succeed?
92 static inline int arch_write_can_lock(arch_rwlock_t
*rwlock
)
94 return rwlock
->lock
== 0;
98 * arch_read_lock() - acquire a read lock.
100 void arch_read_lock(arch_rwlock_t
*rwlock
);
103 * arch_write_lock() - acquire a write lock.
105 void arch_write_lock(arch_rwlock_t
*rwlock
);
108 * arch_read_trylock() - try to acquire a read lock.
110 int arch_read_trylock(arch_rwlock_t
*rwlock
);
113 * arch_write_trylock() - try to acquire a write lock.
115 int arch_write_trylock(arch_rwlock_t
*rwlock
);
118 * arch_read_unlock() - release a read lock.
120 void arch_read_unlock(arch_rwlock_t
*rwlock
);
123 * arch_write_unlock() - release a write lock.
125 void arch_write_unlock(arch_rwlock_t
*rwlock
);
127 #define arch_read_lock_flags(lock, flags) arch_read_lock(lock)
128 #define arch_write_lock_flags(lock, flags) arch_write_lock(lock)
130 #endif /* _ASM_TILE_SPINLOCK_32_H */