2 * Copyright (c) 2007 Attilio Rao <attilio@freebsd.org>
3 * Copyright (c) 2001 Jason Evans <jasone@freebsd.org>
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice(s), this list of conditions and the following disclaimer as
11 * the first lines of this file unmodified other than the possible
12 * addition of one or more copyright notices.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice(s), this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY
18 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
19 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
20 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER(S) BE LIABLE FOR ANY
21 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
22 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
23 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
24 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
35 #include <sys/_lock.h>
40 #include <sys/lock_profile.h>
41 #include <sys/lockstat.h>
42 #include <machine/atomic.h>
46 * In general, the sx locks and rwlocks use very similar algorithms.
47 * The main difference in the implementations is how threads are
48 * blocked when a lock is unavailable. For this, sx locks use sleep
49 * queues which do not support priority propagation, and rwlocks use
50 * turnstiles which do.
52 * The sx_lock field consists of several fields. The low bit
53 * indicates if the lock is locked with a shared or exclusive lock. A
54 * value of 0 indicates an exclusive lock, and a value of 1 indicates
55 * a shared lock. Bit 1 is a boolean indicating if there are any
56 * threads waiting for a shared lock. Bit 2 is a boolean indicating
57 * if there are any threads waiting for an exclusive lock. Bit 3 is a
58 * boolean indicating if an exclusive lock is recursively held. The
59 * rest of the variable's definition is dependent on the value of the
60 * first bit. For an exclusive lock, it is a pointer to the thread
61 * holding the lock, similar to the mtx_lock field of mutexes. For
62 * shared locks, it is a count of read locks that are held.
64 * When the lock is not locked by any thread, it is encoded as a
65 * shared lock with zero waiters.
68 #define SX_LOCK_SHARED 0x01
69 #define SX_LOCK_SHARED_WAITERS 0x02
70 #define SX_LOCK_EXCLUSIVE_WAITERS 0x04
71 #define SX_LOCK_RECURSED 0x08
72 #define SX_LOCK_FLAGMASK \
73 (SX_LOCK_SHARED | SX_LOCK_SHARED_WAITERS | \
74 SX_LOCK_EXCLUSIVE_WAITERS | SX_LOCK_RECURSED)
76 #define SX_OWNER(x) ((x) & ~SX_LOCK_FLAGMASK)
77 #define SX_SHARERS_SHIFT 4
78 #define SX_SHARERS(x) (SX_OWNER(x) >> SX_SHARERS_SHIFT)
79 #define SX_SHARERS_LOCK(x) \
80 ((x) << SX_SHARERS_SHIFT | SX_LOCK_SHARED)
81 #define SX_ONE_SHARER (1 << SX_SHARERS_SHIFT)
83 #define SX_LOCK_UNLOCKED SX_SHARERS_LOCK(0)
84 #define SX_LOCK_DESTROYED \
85 (SX_LOCK_SHARED_WAITERS | SX_LOCK_EXCLUSIVE_WAITERS)
90 * Function prototipes. Routines that start with an underscore are not part
91 * of the public interface and are wrappered with a macro.
93 void sx_sysinit(void *arg);
94 #define sx_init(sx, desc) sx_init_flags((sx), (desc), 0)
95 void sx_init_flags(struct sx *sx, const char *description, int opts);
96 void sx_destroy(struct sx *sx);
97 int _sx_slock(struct sx *sx, int opts, const char *file, int line);
98 int _sx_xlock(struct sx *sx, int opts, const char *file, int line);
99 int _sx_try_slock(struct sx *sx, const char *file, int line);
100 int _sx_try_xlock(struct sx *sx, const char *file, int line);
101 void _sx_sunlock(struct sx *sx, const char *file, int line);
102 void _sx_xunlock(struct sx *sx, const char *file, int line);
103 int _sx_try_upgrade(struct sx *sx, const char *file, int line);
104 void _sx_downgrade(struct sx *sx, const char *file, int line);
105 int _sx_xlock_hard(struct sx *sx, uintptr_t tid, int opts,
106 const char *file, int line);
107 int _sx_slock_hard(struct sx *sx, int opts, const char *file, int line);
108 void _sx_xunlock_hard(struct sx *sx, uintptr_t tid, const char *file, int
110 void _sx_sunlock_hard(struct sx *sx, const char *file, int line);
111 #if defined(INVARIANTS) || defined(INVARIANT_SUPPORT)
112 void _sx_assert(struct sx *sx, int what, const char *file, int line);
115 int sx_chain(struct thread *td, struct thread **ownerp);
124 #define SX_SYSINIT_FLAGS(name, sxa, desc, flags) \
125 static struct sx_args name##_args = { \
130 SYSINIT(name##_sx_sysinit, SI_SUB_LOCK, SI_ORDER_MIDDLE, \
131 sx_sysinit, &name##_args); \
132 SYSUNINIT(name##_sx_sysuninit, SI_SUB_LOCK, SI_ORDER_MIDDLE, \
135 #define SX_SYSINIT(name, sxa, desc) SX_SYSINIT_FLAGS(name, sxa, desc, 0)
138 * Full lock operations that are suitable to be inlined in non-debug kernels.
139 * If the lock can't be acquired or released trivially then the work is
140 * deferred to 'tougher' functions.
143 /* Acquire an exclusive lock. */
145 __sx_xlock(struct sx *sx, struct thread *td, int opts, const char *file,
148 uintptr_t tid = (uintptr_t)td;
151 if (!atomic_cmpset_acq_ptr(&sx->sx_lock, SX_LOCK_UNLOCKED, tid))
152 error = _sx_xlock_hard(sx, tid, opts, file, line);
154 LOCKSTAT_PROFILE_OBTAIN_LOCK_SUCCESS(LS_SX_XLOCK_ACQUIRE,
155 sx, 0, 0, file, line);
160 /* Release an exclusive lock. */
162 __sx_xunlock(struct sx *sx, struct thread *td, const char *file, int line)
164 uintptr_t tid = (uintptr_t)td;
166 if (!atomic_cmpset_rel_ptr(&sx->sx_lock, tid, SX_LOCK_UNLOCKED))
167 _sx_xunlock_hard(sx, tid, file, line);
170 /* Acquire a shared lock. */
172 __sx_slock(struct sx *sx, int opts, const char *file, int line)
174 uintptr_t x = sx->sx_lock;
177 if (!(x & SX_LOCK_SHARED) ||
178 !atomic_cmpset_acq_ptr(&sx->sx_lock, x, x + SX_ONE_SHARER))
179 error = _sx_slock_hard(sx, opts, file, line);
181 LOCKSTAT_PROFILE_OBTAIN_LOCK_SUCCESS(LS_SX_SLOCK_ACQUIRE, sx, 0,
188 * Release a shared lock. We can just drop a single shared lock so
189 * long as we aren't trying to drop the last shared lock when other
190 * threads are waiting for an exclusive lock. This takes advantage of
191 * the fact that an unlocked lock is encoded as a shared lock with a
195 __sx_sunlock(struct sx *sx, const char *file, int line)
197 uintptr_t x = sx->sx_lock;
199 if (x == (SX_SHARERS_LOCK(1) | SX_LOCK_EXCLUSIVE_WAITERS) ||
200 !atomic_cmpset_rel_ptr(&sx->sx_lock, x, x - SX_ONE_SHARER))
201 _sx_sunlock_hard(sx, file, line);
205 * Public interface for lock operations.
208 #error "LOCK_DEBUG not defined, include <sys/lock.h> before <sys/sx.h>"
210 #if (LOCK_DEBUG > 0) || defined(SX_NOINLINE)
211 #define sx_xlock(sx) (void)_sx_xlock((sx), 0, LOCK_FILE, LOCK_LINE)
212 #define sx_xlock_sig(sx) \
213 _sx_xlock((sx), SX_INTERRUPTIBLE, LOCK_FILE, LOCK_LINE)
214 #define sx_xunlock(sx) _sx_xunlock((sx), LOCK_FILE, LOCK_LINE)
215 #define sx_slock(sx) (void)_sx_slock((sx), 0, LOCK_FILE, LOCK_LINE)
216 #define sx_slock_sig(sx) \
217 _sx_slock((sx), SX_INTERRUPTIBLE, LOCK_FILE, LOCK_LINE)
218 #define sx_sunlock(sx) _sx_sunlock((sx), LOCK_FILE, LOCK_LINE)
220 #define sx_xlock(sx) \
221 (void)__sx_xlock((sx), curthread, 0, LOCK_FILE, LOCK_LINE)
222 #define sx_xlock_sig(sx) \
223 __sx_xlock((sx), curthread, SX_INTERRUPTIBLE, LOCK_FILE, LOCK_LINE)
224 #define sx_xunlock(sx) \
225 __sx_xunlock((sx), curthread, LOCK_FILE, LOCK_LINE)
226 #define sx_slock(sx) (void)__sx_slock((sx), 0, LOCK_FILE, LOCK_LINE)
227 #define sx_slock_sig(sx) \
228 __sx_slock((sx), SX_INTERRUPTIBLE, LOCK_FILE, LOCK_LINE)
229 #define sx_sunlock(sx) __sx_sunlock((sx), LOCK_FILE, LOCK_LINE)
230 #endif /* LOCK_DEBUG > 0 || SX_NOINLINE */
231 #define sx_try_slock(sx) _sx_try_slock((sx), LOCK_FILE, LOCK_LINE)
232 #define sx_try_xlock(sx) _sx_try_xlock((sx), LOCK_FILE, LOCK_LINE)
233 #define sx_try_upgrade(sx) _sx_try_upgrade((sx), LOCK_FILE, LOCK_LINE)
234 #define sx_downgrade(sx) _sx_downgrade((sx), LOCK_FILE, LOCK_LINE)
237 * Return a pointer to the owning thread if the lock is exclusively
240 #define sx_xholder(sx) \
241 ((sx)->sx_lock & SX_LOCK_SHARED ? NULL : \
242 (struct thread *)SX_OWNER((sx)->sx_lock))
244 #define sx_xlocked(sx) \
245 (((sx)->sx_lock & ~(SX_LOCK_FLAGMASK & ~SX_LOCK_SHARED)) == \
246 (uintptr_t)curthread)
248 #define sx_unlock(sx) do { \
249 if (sx_xlocked(sx)) \
255 #define sx_sleep(chan, sx, pri, wmesg, timo) \
256 _sleep((chan), &(sx)->lock_object, (pri), (wmesg), (timo))
259 * Options passed to sx_init_flags().
261 #define SX_DUPOK 0x01
262 #define SX_NOPROFILE 0x02
263 #define SX_NOWITNESS 0x04
264 #define SX_QUIET 0x08
265 #define SX_NOADAPTIVE 0x10
266 #define SX_RECURSE 0x20
269 * Options passed to sx_*lock_hard().
271 #define SX_INTERRUPTIBLE 0x40
273 #if defined(INVARIANTS) || defined(INVARIANT_SUPPORT)
274 #define SA_LOCKED LA_LOCKED
275 #define SA_SLOCKED LA_SLOCKED
276 #define SA_XLOCKED LA_XLOCKED
277 #define SA_UNLOCKED LA_UNLOCKED
278 #define SA_RECURSED LA_RECURSED
279 #define SA_NOTRECURSED LA_NOTRECURSED
281 /* Backwards compatability. */
282 #define SX_LOCKED LA_LOCKED
283 #define SX_SLOCKED LA_SLOCKED
284 #define SX_XLOCKED LA_XLOCKED
285 #define SX_UNLOCKED LA_UNLOCKED
286 #define SX_RECURSED LA_RECURSED
287 #define SX_NOTRECURSED LA_NOTRECURSED
291 #define sx_assert(sx, what) _sx_assert((sx), (what), LOCK_FILE, LOCK_LINE)
293 #define sx_assert(sx, what) (void)0
298 #endif /* !_SYS_SX_H_ */