1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
/*
* This file is subject to the terms and conditions of the GNU General Public
* License. See the file "COPYING" in the main directory of this archive
* for more details.
*
* Copyright (C) 1999, 2000 by Ralf Baechle
* Copyright (C) 1999, 2000 Silicon Graphics, Inc.
*/
#ifndef _ASM_SPINLOCK_H
#define _ASM_SPINLOCK_H
/*
* Your basic SMP spinlocks, allowing only a single CPU anywhere
*/
typedef struct {
volatile unsigned int lock;
} spinlock_t;
#define SPIN_LOCK_UNLOCKED (spinlock_t) { 0 }
#define spin_lock_init(x) do { (x)->lock = 0; } while(0);
#define spin_is_locked(x) ((x)->lock != 0)
#define spin_unlock_wait(x) ({ do { barrier(); } while ((x)->lock); })
/*
* Simple spin lock operations. There are two variants, one clears IRQ's
* on the local processor, one does not.
*
* We make no fairness assumptions. They have a cost.
*/
static inline void spin_lock(spinlock_t *lock)
{
unsigned int tmp;
__asm__ __volatile__(
".set\tnoreorder\t\t\t# spin_lock\n"
"1:\tll\t%1, %2\n\t"
"bnez\t%1, 1b\n\t"
" li\t%1, 1\n\t"
"sc\t%1, %0\n\t"
"beqz\t%1, 1b\n\t"
" sync\n\t"
".set\treorder"
: "=o" (lock->lock), "=&r" (tmp)
: "o" (lock->lock)
: "memory");
}
static inline void spin_unlock(spinlock_t *lock)
{
__asm__ __volatile__(
".set\tnoreorder\t\t\t# spin_unlock\n\t"
"sync\n\t"
"sw\t$0, %0\n\t"
".set\treorder"
: "=o" (lock->lock)
: "o" (lock->lock)
: "memory");
}
static inline unsigned int spin_trylock(spinlock_t *lock)
{
unsigned int temp, res;
__asm__ __volatile__(
".set\tnoreorder\t\t\t# spin_trylock\n\t"
"1:\tll\t%0, %1\n\t"
"or\t%2, %0, %3\n\t"
"sc\t%2, %1\n\t"
"beqz\t%2, 1b\n\t"
" and\t%2, %0, %3\n\t"
".set\treorder"
: "=&r" (temp), "=m" (lock->lock), "=&r" (res)
: "r" (1), "m" (lock->lock)
: "memory");
return res == 0;
}
/*
* 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.
*/
typedef struct {
volatile unsigned int lock;
} rwlock_t;
#define RW_LOCK_UNLOCKED (rwlock_t) { 0 }
static inline void read_lock(rwlock_t *rw)
{
unsigned int tmp;
__asm__ __volatile__(
".set\tnoreorder\t\t\t# read_lock\n"
"1:\tll\t%1, %2\n\t"
"bltz\t%1, 1b\n\t"
" addu\t%1, 1\n\t"
"sc\t%1, %0\n\t"
"beqz\t%1, 1b\n\t"
" sync\n\t"
".set\treorder"
: "=o" (rw->lock), "=&r" (tmp)
: "o" (rw->lock)
: "memory");
}
/* Note the use of sub, not subu which will make the kernel die with an
overflow exception if we ever try to unlock an rwlock that is already
unlocked or is being held by a writer. */
static inline void read_unlock(rwlock_t *rw)
{
unsigned int tmp;
__asm__ __volatile__(
".set\tnoreorder\t\t\t# read_unlock\n"
"1:\tll\t%1, %2\n\t"
"sub\t%1, 1\n\t"
"sc\t%1, %0\n\t"
"beqz\t%1, 1b\n\t"
"sync\n\t"
".set\treorder"
: "=o" (rw->lock), "=&r" (tmp)
: "o" (rw->lock)
: "memory");
}
static inline void write_lock(rwlock_t *rw)
{
unsigned int tmp;
__asm__ __volatile__(
".set\tnoreorder\t\t\t# write_lock\n"
"1:\tll\t%1, %2\n\t"
"bnez\t%1, 1b\n\t"
" lui\t%1, 0x8000\n\t"
"sc\t%1, %0\n\t"
"beqz\t%1, 1b\n\t"
" sync\n\t"
".set\treorder"
: "=o" (rw->lock), "=&r" (tmp)
: "o" (rw->lock)
: "memory");
}
static inline void write_unlock(rwlock_t *rw)
{
__asm__ __volatile__(
".set\tnoreorder\t\t\t# write_unlock\n\t"
"sync\n\t"
"sw\t$0, %0\n\t"
".set\treorder"
: "=o" (rw->lock)
: "o" (rw->lock)
: "memory");
}
#endif /* _ASM_SPINLOCK_H */
|
