3 * The Regents of the University of California. All rights reserved.
6 * John S. Dyson. All rights reserved.
8 * This code contains ideas from software contributed to Berkeley by
9 * Avadis Tevanian, Jr., Michael Wayne Young, and the Mach Operating
10 * System project at Carnegie-Mellon University.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 * @(#)kern_lock.c 8.18 (Berkeley) 5/21/95
41 * $FreeBSD: src/sys/kern/kern_lock.c,v 1.31.2.3 2001/12/25 01:44:44 dillon Exp $
42 * $DragonFly: src/sys/kern/kern_lock.c,v 1.27 2008/01/09 10:59:12 corecode Exp $
47 #include <sys/param.h>
48 #include <sys/systm.h>
49 #include <sys/kernel.h>
52 #include <sys/sysctl.h>
53 #include <sys/spinlock.h>
54 #include <sys/thread2.h>
55 #include <sys/spinlock2.h>
58 * Locking primitives implementation.
59 * Locks provide shared/exclusive sychronization.
62 #ifdef SIMPLELOCK_DEBUG
63 #define COUNT(td, x) (td)->td_locks += (x)
68 #define LOCK_WAIT_TIME 100
69 #define LOCK_SAMPLE_WAIT 7
71 #if defined(DIAGNOSTIC)
74 #define LOCK_INLINE __inline
77 #define LK_ALL (LK_HAVE_EXCL | LK_WANT_EXCL | LK_WANT_UPGRADE | \
78 LK_SHARE_NONZERO | LK_WAIT_NONZERO)
80 static int acquire(struct lock
*lkp
, int extflags
, int wanted
);
82 static LOCK_INLINE
void
83 sharelock(struct lock
*lkp
, int incr
) {
84 lkp
->lk_flags
|= LK_SHARE_NONZERO
;
85 lkp
->lk_sharecount
+= incr
;
88 static LOCK_INLINE
int
89 shareunlock(struct lock
*lkp
, int decr
)
93 KASSERT(lkp
->lk_sharecount
>= decr
, ("shareunlock: count < decr"));
95 if (lkp
->lk_sharecount
== decr
) {
96 lkp
->lk_flags
&= ~LK_SHARE_NONZERO
;
97 if (lkp
->lk_flags
& (LK_WANT_UPGRADE
| LK_WANT_EXCL
)) {
100 lkp
->lk_sharecount
= 0;
102 lkp
->lk_sharecount
-= decr
;
108 * lock acquisition helper routine. Called with the lock's spinlock held.
111 acquire(struct lock
*lkp
, int extflags
, int wanted
)
115 if ((extflags
& LK_NOWAIT
) && (lkp
->lk_flags
& wanted
)) {
119 while ((lkp
->lk_flags
& wanted
) != 0) {
120 lkp
->lk_flags
|= LK_WAIT_NONZERO
;
124 * Atomic spinlock release/sleep/reacquire.
126 error
= ssleep(lkp
, &lkp
->lk_spinlock
,
127 ((extflags
& LK_PCATCH
) ? PCATCH
: 0),
129 ((extflags
& LK_TIMELOCK
) ? lkp
->lk_timo
: 0));
130 if (lkp
->lk_waitcount
== 1) {
131 lkp
->lk_flags
&= ~LK_WAIT_NONZERO
;
132 lkp
->lk_waitcount
= 0;
138 if (extflags
& LK_SLEEPFAIL
)
145 * Set, change, or release a lock.
147 * Shared requests increment the shared count. Exclusive requests set the
148 * LK_WANT_EXCL flag (preventing further shared locks), and wait for already
149 * accepted shared locks and shared-to-exclusive upgrades to go away.
151 * A spinlock is held for most of the procedure. We must not do anything
152 * fancy while holding the spinlock.
156 lockmgr(struct lock
*lkp
, u_int flags
)
158 debuglockmgr(struct lock
*lkp
, u_int flags
,
159 const char *name
, const char *file
, int line
)
170 if (mycpu
->gd_intr_nesting_level
&&
171 (flags
& LK_NOWAIT
) == 0 &&
172 (flags
& LK_TYPE_MASK
) != LK_RELEASE
&&
173 panic_cpu_gd
!= mycpu
177 panic("lockmgr %s from %p: called from interrupt, ipi, "
178 "or hard code section",
179 lkp
->lk_wmesg
, ((int **)&lkp
)[-1]);
181 panic("lockmgr %s from %s:%d: called from interrupt, ipi, "
182 "or hard code section",
183 lkp
->lk_wmesg
, file
, line
);
188 * So sue me, I'm too tired.
190 if (spin_trylock(&lkp
->lk_spinlock
) == FALSE
) {
191 if (flags
& LK_NOSPINWAIT
)
193 spin_lock(&lkp
->lk_spinlock
);
196 extflags
= (flags
| lkp
->lk_flags
) & LK_EXTFLG_MASK
;
199 switch (flags
& LK_TYPE_MASK
) {
202 * If we are not the exclusive lock holder, we have to block
203 * while there is an exclusive lock holder or while an
204 * exclusive lock request or upgrade request is in progress.
206 * However, if P_DEADLKTREAT is set, we override exclusive
207 * lock requests or upgrade requests ( but not the exclusive
210 if (lkp
->lk_lockholder
!= td
) {
211 if (td
->td_flags
& TDF_DEADLKTREAT
) {
221 LK_HAVE_EXCL
| LK_WANT_EXCL
|
232 * We hold an exclusive lock, so downgrade it to shared.
233 * An alternative would be to fail with EDEADLK.
237 /* fall into downgrade */
240 if (lkp
->lk_lockholder
!= td
|| lkp
->lk_exclusivecount
== 0) {
241 spin_unlock(&lkp
->lk_spinlock
);
242 panic("lockmgr: not holding exclusive lock");
244 sharelock(lkp
, lkp
->lk_exclusivecount
);
245 lkp
->lk_exclusivecount
= 0;
246 lkp
->lk_flags
&= ~LK_HAVE_EXCL
;
247 lkp
->lk_lockholder
= LK_NOTHREAD
;
248 if (lkp
->lk_waitcount
)
254 * If another process is ahead of us to get an upgrade,
255 * then we want to fail rather than have an intervening
258 if (lkp
->lk_flags
& LK_WANT_UPGRADE
) {
259 dowakeup
= shareunlock(lkp
, 1);
264 /* fall into normal upgrade */
268 * Upgrade a shared lock to an exclusive one. If another
269 * shared lock has already requested an upgrade to an
270 * exclusive lock, our shared lock is released and an
271 * exclusive lock is requested (which will be granted
272 * after the upgrade). If we return an error, the file
273 * will always be unlocked.
275 if ((lkp
->lk_lockholder
== td
) || (lkp
->lk_sharecount
<= 0)) {
276 spin_unlock(&lkp
->lk_spinlock
);
277 panic("lockmgr: upgrade exclusive lock");
279 dowakeup
+= shareunlock(lkp
, 1);
282 * If we are just polling, check to see if we will block.
284 if ((extflags
& LK_NOWAIT
) &&
285 ((lkp
->lk_flags
& LK_WANT_UPGRADE
) ||
286 lkp
->lk_sharecount
> 1)) {
290 if ((lkp
->lk_flags
& LK_WANT_UPGRADE
) == 0) {
292 * We are first shared lock to request an upgrade, so
293 * request upgrade and wait for the shared count to
294 * drop to zero, then take exclusive lock.
296 lkp
->lk_flags
|= LK_WANT_UPGRADE
;
297 error
= acquire(lkp
, extflags
, LK_SHARE_NONZERO
);
298 lkp
->lk_flags
&= ~LK_WANT_UPGRADE
;
302 lkp
->lk_flags
|= LK_HAVE_EXCL
;
303 lkp
->lk_lockholder
= td
;
304 if (lkp
->lk_exclusivecount
!= 0) {
305 spin_unlock(&lkp
->lk_spinlock
);
306 panic("lockmgr: non-zero exclusive count");
308 lkp
->lk_exclusivecount
= 1;
309 #if defined(DEBUG_LOCKS)
310 lkp
->lk_filename
= file
;
311 lkp
->lk_lineno
= line
;
312 lkp
->lk_lockername
= name
;
318 * Someone else has requested upgrade. Release our shared
319 * lock, awaken upgrade requestor if we are the last shared
320 * lock, then request an exclusive lock.
322 if ( (lkp
->lk_flags
& (LK_SHARE_NONZERO
|LK_WAIT_NONZERO
)) ==
326 /* fall into exclusive request */
329 if (lkp
->lk_lockholder
== td
&& td
!= LK_KERNTHREAD
) {
333 if ((extflags
& (LK_NOWAIT
| LK_CANRECURSE
)) == 0) {
334 spin_unlock(&lkp
->lk_spinlock
);
335 panic("lockmgr: locking against myself");
337 if ((extflags
& LK_CANRECURSE
) != 0) {
338 lkp
->lk_exclusivecount
++;
344 * If we are just polling, check to see if we will sleep.
346 if ((extflags
& LK_NOWAIT
) &&
347 (lkp
->lk_flags
& (LK_HAVE_EXCL
| LK_WANT_EXCL
| LK_WANT_UPGRADE
| LK_SHARE_NONZERO
))) {
352 * Try to acquire the want_exclusive flag.
354 error
= acquire(lkp
, extflags
, (LK_HAVE_EXCL
| LK_WANT_EXCL
));
357 lkp
->lk_flags
|= LK_WANT_EXCL
;
359 * Wait for shared locks and upgrades to finish.
361 error
= acquire(lkp
, extflags
, LK_WANT_UPGRADE
| LK_SHARE_NONZERO
);
362 lkp
->lk_flags
&= ~LK_WANT_EXCL
;
365 lkp
->lk_flags
|= LK_HAVE_EXCL
;
366 lkp
->lk_lockholder
= td
;
367 if (lkp
->lk_exclusivecount
!= 0) {
368 spin_unlock(&lkp
->lk_spinlock
);
369 panic("lockmgr: non-zero exclusive count");
371 lkp
->lk_exclusivecount
= 1;
372 #if defined(DEBUG_LOCKS)
373 lkp
->lk_filename
= file
;
374 lkp
->lk_lineno
= line
;
375 lkp
->lk_lockername
= name
;
381 if (lkp
->lk_exclusivecount
!= 0) {
382 if (lkp
->lk_lockholder
!= td
&&
383 lkp
->lk_lockholder
!= LK_KERNTHREAD
) {
384 spin_unlock(&lkp
->lk_spinlock
);
385 panic("lockmgr: pid %d, not %s thr %p/%p unlocking",
386 (td
->td_proc
? td
->td_proc
->p_pid
: -1),
387 "exclusive lock holder",
388 td
, lkp
->lk_lockholder
);
390 if (lkp
->lk_lockholder
!= LK_KERNTHREAD
) {
393 if (lkp
->lk_exclusivecount
== 1) {
394 lkp
->lk_flags
&= ~LK_HAVE_EXCL
;
395 lkp
->lk_lockholder
= LK_NOTHREAD
;
396 lkp
->lk_exclusivecount
= 0;
398 lkp
->lk_exclusivecount
--;
400 } else if (lkp
->lk_flags
& LK_SHARE_NONZERO
) {
401 dowakeup
+= shareunlock(lkp
, 1);
404 if (lkp
->lk_flags
& LK_WAIT_NONZERO
)
409 spin_unlock(&lkp
->lk_spinlock
);
410 panic("lockmgr: unknown locktype request %d",
411 flags
& LK_TYPE_MASK
);
414 spin_unlock(&lkp
->lk_spinlock
);
421 lockmgr_kernproc(struct lock
*lp
)
423 struct thread
*td __debugvar
= curthread
;
425 if (lp
->lk_lockholder
!= LK_KERNTHREAD
) {
426 KASSERT(lp
->lk_lockholder
== td
,
427 ("lockmgr_kernproc: lock not owned by curthread %p", td
));
429 lp
->lk_lockholder
= LK_KERNTHREAD
;
434 * Set the lock to be exclusively held. The caller is holding the lock's
435 * spinlock and the spinlock remains held on return. A panic will occur
436 * if the lock cannot be set to exclusive.
439 lockmgr_setexclusive_interlocked(struct lock
*lkp
)
441 thread_t td
= curthread
;
443 KKASSERT((lkp
->lk_flags
& (LK_HAVE_EXCL
|LK_SHARE_NONZERO
)) == 0);
444 KKASSERT(lkp
->lk_exclusivecount
== 0);
445 lkp
->lk_flags
|= LK_HAVE_EXCL
;
446 lkp
->lk_lockholder
= td
;
447 lkp
->lk_exclusivecount
= 1;
452 * Clear the caller's exclusive lock. The caller is holding the lock's
453 * spinlock. THIS FUNCTION WILL UNLOCK THE SPINLOCK.
455 * A panic will occur if the caller does not hold the lock.
458 lockmgr_clrexclusive_interlocked(struct lock
*lkp
)
460 thread_t td __debugvar
= curthread
;
463 KKASSERT((lkp
->lk_flags
& LK_HAVE_EXCL
) && lkp
->lk_exclusivecount
== 1
464 && lkp
->lk_lockholder
== td
);
465 lkp
->lk_lockholder
= LK_NOTHREAD
;
466 lkp
->lk_flags
&= ~LK_HAVE_EXCL
;
467 lkp
->lk_exclusivecount
= 0;
468 if (lkp
->lk_flags
& LK_WAIT_NONZERO
)
471 spin_unlock(&lkp
->lk_spinlock
);
477 * Initialize a lock; required before use.
480 lockinit(struct lock
*lkp
, char *wmesg
, int timo
, int flags
)
482 spin_init(&lkp
->lk_spinlock
);
483 lkp
->lk_flags
= (flags
& LK_EXTFLG_MASK
);
484 lkp
->lk_sharecount
= 0;
485 lkp
->lk_waitcount
= 0;
486 lkp
->lk_exclusivecount
= 0;
487 lkp
->lk_wmesg
= wmesg
;
489 lkp
->lk_lockholder
= LK_NOTHREAD
;
493 * Reinitialize a lock that is being reused for a different purpose, but
494 * which may have pending (blocked) threads sitting on it. The caller
495 * must already hold the interlock.
498 lockreinit(struct lock
*lkp
, char *wmesg
, int timo
, int flags
)
500 spin_lock(&lkp
->lk_spinlock
);
501 lkp
->lk_flags
= (lkp
->lk_flags
& ~LK_EXTFLG_MASK
) |
502 (flags
& LK_EXTFLG_MASK
);
503 lkp
->lk_wmesg
= wmesg
;
505 spin_unlock(&lkp
->lk_spinlock
);
509 * Requires that the caller is the exclusive owner of this lock.
512 lockuninit(struct lock
*l
)
515 * At this point we should have removed all the references to this lock
516 * so there can't be anyone waiting on it.
518 KKASSERT(l
->lk_waitcount
== 0);
520 spin_uninit(&l
->lk_spinlock
);
524 * Determine the status of a lock.
527 lockstatus(struct lock
*lkp
, struct thread
*td
)
531 spin_lock(&lkp
->lk_spinlock
);
532 if (lkp
->lk_exclusivecount
!= 0) {
533 if (td
== NULL
|| lkp
->lk_lockholder
== td
)
534 lock_type
= LK_EXCLUSIVE
;
536 lock_type
= LK_EXCLOTHER
;
537 } else if (lkp
->lk_sharecount
!= 0) {
538 lock_type
= LK_SHARED
;
540 spin_unlock(&lkp
->lk_spinlock
);
545 * Return non-zero if the caller owns the lock shared or exclusive.
546 * We can only guess re: shared locks.
549 lockowned(struct lock
*lkp
)
551 thread_t td
= curthread
;
553 if (lkp
->lk_exclusivecount
)
554 return(lkp
->lk_lockholder
== td
);
555 return(lkp
->lk_sharecount
!= 0);
559 * Determine the number of holders of a lock.
561 * The non-blocking version can usually be used for assertions.
564 lockcount(struct lock
*lkp
)
568 spin_lock(&lkp
->lk_spinlock
);
569 count
= lkp
->lk_exclusivecount
+ lkp
->lk_sharecount
;
570 spin_unlock(&lkp
->lk_spinlock
);
575 lockcountnb(struct lock
*lkp
)
577 return (lkp
->lk_exclusivecount
+ lkp
->lk_sharecount
);
581 * Print out information about state of a lock. Used by VOP_PRINT
582 * routines to display status about contained locks.
585 lockmgr_printinfo(struct lock
*lkp
)
587 struct thread
*td
= lkp
->lk_lockholder
;
590 if (td
&& td
!= LK_KERNTHREAD
&& td
!= LK_NOTHREAD
)
595 if (lkp
->lk_sharecount
)
596 kprintf(" lock type %s: SHARED (count %d)", lkp
->lk_wmesg
,
598 else if (lkp
->lk_flags
& LK_HAVE_EXCL
)
599 kprintf(" lock type %s: EXCL (count %d) by td %p pid %d",
600 lkp
->lk_wmesg
, lkp
->lk_exclusivecount
, td
,
602 if (lkp
->lk_waitcount
> 0)
603 kprintf(" with %d pending", lkp
->lk_waitcount
);