lock.h revision 27632
1/*
2 * Copyright (c) 1995
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * This code contains ideas from software contributed to Berkeley by
6 * Avadis Tevanian, Jr., Michael Wayne Young, and the Mach Operating
7 * System project at Carnegie-Mellon University.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 *    notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 *    notice, this list of conditions and the following disclaimer in the
16 *    documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 *    must display the following acknowledgement:
19 *	This product includes software developed by the University of
20 *	California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 *    may be used to endorse or promote products derived from this software
23 *    without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 *
37 *	@(#)lock.h	8.12 (Berkeley) 5/19/95
38 * $Id: lock.h,v 1.2 1997/07/23 18:34:21 smp Exp smp $
39 */
40
41#ifndef	_LOCK_H_
42#define	_LOCK_H_
43
44/*
45 * The general lock structure.  Provides for multiple shared locks,
46 * upgrading from shared to exclusive, and sleeping until the lock
47 * can be gained. The simple locks are defined in <machine/param.h>.
48 */
49struct lock {
50	struct	simplelock lk_interlock __attribute__ ((aligned (4)));
51					/* lock on remaining fields */
52	u_int	lk_flags;		/* see below */
53	int	lk_sharecount;		/* # of accepted shared locks */
54	int	lk_waitcount;		/* # of processes sleeping for lock */
55	short	lk_exclusivecount;	/* # of recursive exclusive locks */
56	short	lk_prio;		/* priority at which to sleep */
57	char	*lk_wmesg;		/* resource sleeping (for tsleep) */
58	int	lk_timo;		/* maximum sleep time (for tsleep) */
59	pid_t	lk_lockholder;		/* pid of exclusive lock holder */
60};
61/*
62 * Lock request types:
63 *   LK_SHARED - get one of many possible shared locks. If a process
64 *	holding an exclusive lock requests a shared lock, the exclusive
65 *	lock(s) will be downgraded to shared locks.
66 *   LK_EXCLUSIVE - stop further shared locks, when they are cleared,
67 *	grant a pending upgrade if it exists, then grant an exclusive
68 *	lock. Only one exclusive lock may exist at a time, except that
69 *	a process holding an exclusive lock may get additional exclusive
70 *	locks if it explicitly sets the LK_CANRECURSE flag in the lock
71 *	request, or if the LK_CANRECUSE flag was set when the lock was
72 *	initialized.
73 *   LK_UPGRADE - the process must hold a shared lock that it wants to
74 *	have upgraded to an exclusive lock. Other processes may get
75 *	exclusive access to the resource between the time that the upgrade
76 *	is requested and the time that it is granted.
77 *   LK_EXCLUPGRADE - the process must hold a shared lock that it wants to
78 *	have upgraded to an exclusive lock. If the request succeeds, no
79 *	other processes will have gotten exclusive access to the resource
80 *	between the time that the upgrade is requested and the time that
81 *	it is granted. However, if another process has already requested
82 *	an upgrade, the request will fail (see error returns below).
83 *   LK_DOWNGRADE - the process must hold an exclusive lock that it wants
84 *	to have downgraded to a shared lock. If the process holds multiple
85 *	(recursive) exclusive locks, they will all be downgraded to shared
86 *	locks.
87 *   LK_RELEASE - release one instance of a lock.
88 *   LK_DRAIN - wait for all activity on the lock to end, then mark it
89 *	decommissioned. This feature is used before freeing a lock that
90 *	is part of a piece of memory that is about to be freed.
91 *
92 * These are flags that are passed to the lockmgr routine.
93 */
94#define LK_TYPE_MASK	0x0000000f	/* type of lock sought */
95#define LK_SHARED	0x00000001	/* shared lock */
96#define LK_EXCLUSIVE	0x00000002	/* exclusive lock */
97#define LK_UPGRADE	0x00000003	/* shared-to-exclusive upgrade */
98#define LK_EXCLUPGRADE	0x00000004	/* first shared-to-exclusive upgrade */
99#define LK_DOWNGRADE	0x00000005	/* exclusive-to-shared downgrade */
100#define LK_RELEASE	0x00000006	/* release any type of lock */
101#define LK_DRAIN	0x00000007	/* wait for all lock activity to end */
102/*
103 * External lock flags.
104 *
105 * The first three flags may be set in lock_init to set their mode permanently,
106 * or passed in as arguments to the lock manager. The LK_REENABLE flag may be
107 * set only at the release of a lock obtained by drain.
108 */
109#define LK_EXTFLG_MASK	0x00000070	/* mask of external flags */
110#define LK_NOWAIT	0x00000010	/* do not sleep to await lock */
111#define LK_SLEEPFAIL	0x00000020	/* sleep, then return failure */
112#define LK_CANRECURSE	0x00000040	/* allow recursive exclusive lock */
113#define LK_REENABLE	0x00000080	/* lock is be reenabled after drain */
114/*
115 * Internal lock flags.
116 *
117 * These flags are used internally to the lock manager.
118 */
119#define LK_WANT_UPGRADE	0x00000100	/* waiting for share-to-excl upgrade */
120#define LK_WANT_EXCL	0x00000200	/* exclusive lock sought */
121#define LK_HAVE_EXCL	0x00000400	/* exclusive lock obtained */
122#define LK_WAITDRAIN	0x00000800	/* process waiting for lock to drain */
123#define LK_DRAINING	0x00004000	/* lock is being drained */
124#define LK_DRAINED	0x00008000	/* lock has been decommissioned */
125/*
126 * Control flags
127 *
128 * Non-persistent external flags.
129 */
130#define LK_INTERLOCK	0x00010000	/* unlock passed simple lock after
131					   getting lk_interlock */
132#define LK_RETRY	0x00020000	/* vn_lock: retry until locked */
133
134/*
135 * Lock return status.
136 *
137 * Successfully obtained locks return 0. Locks will always succeed
138 * unless one of the following is true:
139 *	LK_FORCEUPGRADE is requested and some other process has already
140 *	    requested a lock upgrade (returns EBUSY).
141 *	LK_WAIT is set and a sleep would be required (returns EBUSY).
142 *	LK_SLEEPFAIL is set and a sleep was done (returns ENOLCK).
143 *	PCATCH is set in lock priority and a signal arrives (returns
144 *	    either EINTR or ERESTART if system calls is to be restarted).
145 *	Non-null lock timeout and timeout expires (returns EWOULDBLOCK).
146 * A failed lock attempt always returns a non-zero error value. No lock
147 * is held after an error return (in particular, a failed LK_UPGRADE
148 * or LK_FORCEUPGRADE will have released its shared access lock).
149 */
150
151/*
152 * Indicator that no process holds exclusive lock
153 */
154#define LK_KERNPROC ((pid_t) -2)
155#define LK_NOPROC ((pid_t) -1)
156
157struct proc;
158
159void	lockinit __P((struct lock *, int prio, char *wmesg, int timo,
160			int flags));
161int	lockmgr __P((__volatile struct lock *, u_int flags,
162			struct simplelock *, struct proc *p));
163void	lockmgr_printinfo __P((struct lock *));
164int	lockstatus __P((struct lock *));
165
166#ifdef SIMPLELOCK_DEBUG
167void _simple_unlock __P((__volatile struct simplelock *alp, const char *, int));
168#define simple_unlock(alp) _simple_unlock(alp, __FILE__, __LINE__)
169int _simple_lock_try __P((__volatile struct simplelock *alp, const char *, int));
170#define simple_lock_try(alp) _simple_lock_try(alp, __FILE__, __LINE__)
171void _simple_lock __P((__volatile struct simplelock *alp, const char *, int));
172#define simple_lock(alp) _simple_lock(alp, __FILE__, __LINE__)
173void simple_lock_init __P((struct simplelock *alp));
174#else /* !SIMPLELOCK_DEBUG */
175#if NCPUS == 1 /* no multiprocessor locking is necessary */
176#define	simple_lock_init(alp)
177#define	simple_lock(alp)
178#define	simple_lock_try(alp)	(1)	/* always succeeds */
179#define	simple_unlock(alp)
180#endif /* NCPUS == 1 */
181#endif /* !SIMPLELOCK_DEBUG */
182
183#endif /* !_LOCK_H_ */
184