kern_condvar.c revision 1.5 1 1.4 yamt /* $NetBSD: kern_condvar.c,v 1.5 2007/02/27 15:07:28 yamt Exp $ */
2 1.2 ad
3 1.2 ad /*-
4 1.2 ad * Copyright (c) 2006, 2007 The NetBSD Foundation, Inc.
5 1.2 ad * All rights reserved.
6 1.2 ad *
7 1.2 ad * This code is derived from software contributed to The NetBSD Foundation
8 1.2 ad * by Andrew Doran.
9 1.2 ad *
10 1.2 ad * Redistribution and use in source and binary forms, with or without
11 1.2 ad * modification, are permitted provided that the following conditions
12 1.2 ad * are met:
13 1.2 ad * 1. Redistributions of source code must retain the above copyright
14 1.2 ad * notice, this list of conditions and the following disclaimer.
15 1.2 ad * 2. Redistributions in binary form must reproduce the above copyright
16 1.2 ad * notice, this list of conditions and the following disclaimer in the
17 1.2 ad * documentation and/or other materials provided with the distribution.
18 1.2 ad * 3. All advertising materials mentioning features or use of this software
19 1.2 ad * must display the following acknowledgement:
20 1.2 ad * This product includes software developed by the NetBSD
21 1.2 ad * Foundation, Inc. and its contributors.
22 1.2 ad * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.2 ad * contributors may be used to endorse or promote products derived
24 1.2 ad * from this software without specific prior written permission.
25 1.2 ad *
26 1.2 ad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.2 ad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.2 ad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.2 ad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.2 ad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.2 ad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.2 ad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.2 ad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.2 ad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.2 ad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.2 ad * POSSIBILITY OF SUCH DAMAGE.
37 1.2 ad */
38 1.2 ad
39 1.2 ad /*
40 1.2 ad * Kernel condition variable implementation, modeled after those found in
41 1.2 ad * Solaris, a description of which can be found in:
42 1.2 ad *
43 1.2 ad * Solaris Internals: Core Kernel Architecture, Jim Mauro and
44 1.2 ad * Richard McDougall.
45 1.2 ad */
46 1.2 ad
47 1.2 ad #include <sys/cdefs.h>
48 1.4 yamt __KERNEL_RCSID(0, "$NetBSD: kern_condvar.c,v 1.5 2007/02/27 15:07:28 yamt Exp $");
49 1.2 ad
50 1.2 ad #include <sys/param.h>
51 1.2 ad #include <sys/proc.h>
52 1.2 ad #include <sys/sched.h>
53 1.2 ad #include <sys/systm.h>
54 1.2 ad #include <sys/condvar.h>
55 1.2 ad #include <sys/sleepq.h>
56 1.2 ad
57 1.2 ad static void cv_unsleep(struct lwp *);
58 1.5 yamt static void cv_changepri(struct lwp *, pri_t);
59 1.2 ad
60 1.2 ad syncobj_t cv_syncobj = {
61 1.2 ad SOBJ_SLEEPQ_SORTED,
62 1.2 ad cv_unsleep,
63 1.2 ad cv_changepri,
64 1.4 yamt sleepq_lendpri,
65 1.4 yamt syncobj_noowner,
66 1.2 ad };
67 1.2 ad
68 1.2 ad /*
69 1.2 ad * cv_init:
70 1.2 ad *
71 1.2 ad * Initialize a condition variable for use.
72 1.2 ad */
73 1.2 ad void
74 1.2 ad cv_init(kcondvar_t *cv, const char *wmesg)
75 1.2 ad {
76 1.2 ad
77 1.2 ad KASSERT(wmesg != NULL);
78 1.2 ad
79 1.2 ad cv->cv_wmesg = wmesg;
80 1.2 ad cv->cv_waiters = 0;
81 1.2 ad }
82 1.2 ad
83 1.2 ad /*
84 1.2 ad * cv_destroy:
85 1.2 ad *
86 1.2 ad * Tear down a condition variable.
87 1.2 ad */
88 1.2 ad void
89 1.2 ad cv_destroy(kcondvar_t *cv)
90 1.2 ad {
91 1.2 ad
92 1.2 ad #ifdef DIAGNOSTIC
93 1.2 ad KASSERT(cv->cv_waiters == 0 && cv->cv_wmesg != NULL);
94 1.2 ad cv->cv_wmesg = NULL;
95 1.2 ad #endif
96 1.2 ad }
97 1.2 ad
98 1.2 ad /*
99 1.2 ad * cv_enter:
100 1.2 ad *
101 1.2 ad * Look up and lock the sleep queue corresponding to the given
102 1.2 ad * condition variable, and increment the number of waiters.
103 1.2 ad */
104 1.2 ad static inline sleepq_t *
105 1.2 ad cv_enter(kcondvar_t *cv, kmutex_t *mtx, struct lwp *l)
106 1.2 ad {
107 1.2 ad sleepq_t *sq;
108 1.2 ad
109 1.2 ad KASSERT(cv->cv_wmesg != NULL);
110 1.2 ad
111 1.2 ad sq = sleeptab_lookup(&sleeptab, cv);
112 1.2 ad cv->cv_waiters++;
113 1.2 ad sleepq_enter(sq, l);
114 1.2 ad mutex_exit(mtx);
115 1.2 ad
116 1.2 ad return sq;
117 1.2 ad }
118 1.2 ad
119 1.2 ad /*
120 1.2 ad * cv_unsleep:
121 1.2 ad *
122 1.2 ad * Remove an LWP from the condition variable and sleep queue. This
123 1.2 ad * is called when the LWP has not been awoken normally but instead
124 1.2 ad * interrupted: for example, when a signal is received. Must be
125 1.2 ad * called with the LWP locked, and must return it unlocked.
126 1.2 ad */
127 1.2 ad static void
128 1.2 ad cv_unsleep(struct lwp *l)
129 1.2 ad {
130 1.2 ad uintptr_t addr;
131 1.2 ad
132 1.2 ad KASSERT(l->l_wchan != NULL);
133 1.2 ad LOCK_ASSERT(lwp_locked(l, l->l_sleepq->sq_mutex));
134 1.2 ad
135 1.2 ad addr = (uintptr_t)l->l_wchan;
136 1.2 ad ((kcondvar_t *)addr)->cv_waiters--;
137 1.2 ad
138 1.2 ad sleepq_unsleep(l);
139 1.2 ad }
140 1.2 ad
141 1.2 ad /*
142 1.2 ad * cv_changepri:
143 1.2 ad *
144 1.2 ad * Adjust the real (user) priority of an LWP blocked on a CV.
145 1.2 ad */
146 1.2 ad static void
147 1.5 yamt cv_changepri(struct lwp *l, pri_t pri)
148 1.2 ad {
149 1.2 ad sleepq_t *sq = l->l_sleepq;
150 1.5 yamt pri_t opri;
151 1.2 ad
152 1.2 ad KASSERT(lwp_locked(l, sq->sq_mutex));
153 1.2 ad
154 1.4 yamt opri = lwp_eprio(l);
155 1.2 ad l->l_usrpri = pri;
156 1.2 ad l->l_priority = sched_kpri(l);
157 1.2 ad
158 1.4 yamt if (lwp_eprio(l) != opri) {
159 1.2 ad TAILQ_REMOVE(&sq->sq_queue, l, l_sleepchain);
160 1.4 yamt sleepq_insert(sq, l, l->l_syncobj);
161 1.2 ad }
162 1.2 ad }
163 1.2 ad
164 1.2 ad /*
165 1.2 ad * cv_wait:
166 1.2 ad *
167 1.2 ad * Wait non-interruptably on a condition variable until awoken.
168 1.2 ad */
169 1.2 ad void
170 1.2 ad cv_wait(kcondvar_t *cv, kmutex_t *mtx)
171 1.2 ad {
172 1.2 ad struct lwp *l = curlwp;
173 1.2 ad sleepq_t *sq;
174 1.2 ad
175 1.2 ad LOCK_ASSERT(mutex_owned(mtx));
176 1.2 ad
177 1.2 ad if (sleepq_dontsleep(l)) {
178 1.2 ad (void)sleepq_abort(mtx, 0);
179 1.2 ad return;
180 1.2 ad }
181 1.2 ad
182 1.2 ad sq = cv_enter(cv, mtx, l);
183 1.3 yamt sleepq_block(sq, sched_kpri(l), cv, cv->cv_wmesg, 0, 0, &cv_syncobj);
184 1.2 ad (void)sleepq_unblock(0, 0);
185 1.2 ad mutex_enter(mtx);
186 1.2 ad }
187 1.2 ad
188 1.2 ad /*
189 1.2 ad * cv_wait_sig:
190 1.2 ad *
191 1.2 ad * Wait on a condition variable until a awoken or a signal is received.
192 1.2 ad * Will also return early if the process is exiting. Returns zero if
193 1.2 ad * awoken normallly, ERESTART if a signal was received and the system
194 1.2 ad * call is restartable, or EINTR otherwise.
195 1.2 ad */
196 1.2 ad int
197 1.2 ad cv_wait_sig(kcondvar_t *cv, kmutex_t *mtx)
198 1.2 ad {
199 1.2 ad struct lwp *l = curlwp;
200 1.2 ad sleepq_t *sq;
201 1.2 ad int error;
202 1.2 ad
203 1.2 ad LOCK_ASSERT(mutex_owned(mtx));
204 1.2 ad
205 1.2 ad if (sleepq_dontsleep(l))
206 1.2 ad return sleepq_abort(mtx, 0);
207 1.2 ad
208 1.2 ad sq = cv_enter(cv, mtx, l);
209 1.3 yamt sleepq_block(sq, sched_kpri(l), cv, cv->cv_wmesg, 0, 1, &cv_syncobj);
210 1.2 ad error = sleepq_unblock(0, 1);
211 1.2 ad mutex_enter(mtx);
212 1.2 ad
213 1.2 ad return error;
214 1.2 ad }
215 1.2 ad
216 1.2 ad /*
217 1.2 ad * cv_timedwait:
218 1.2 ad *
219 1.2 ad * Wait on a condition variable until awoken or the specified timeout
220 1.2 ad * expires. Returns zero if awoken normally or EWOULDBLOCK if the
221 1.2 ad * timeout expired.
222 1.2 ad */
223 1.2 ad int
224 1.2 ad cv_timedwait(kcondvar_t *cv, kmutex_t *mtx, int timo)
225 1.2 ad {
226 1.2 ad struct lwp *l = curlwp;
227 1.2 ad sleepq_t *sq;
228 1.2 ad int error;
229 1.2 ad
230 1.2 ad LOCK_ASSERT(mutex_owned(mtx));
231 1.2 ad
232 1.2 ad if (sleepq_dontsleep(l))
233 1.2 ad return sleepq_abort(mtx, 0);
234 1.2 ad
235 1.2 ad sq = cv_enter(cv, mtx, l);
236 1.3 yamt sleepq_block(sq, sched_kpri(l), cv, cv->cv_wmesg, timo, 0, &cv_syncobj);
237 1.2 ad error = sleepq_unblock(timo, 0);
238 1.2 ad mutex_enter(mtx);
239 1.2 ad
240 1.2 ad return error;
241 1.2 ad }
242 1.2 ad
243 1.2 ad /*
244 1.2 ad * cv_timedwait_sig:
245 1.2 ad *
246 1.2 ad * Wait on a condition variable until a timeout expires, awoken or a
247 1.2 ad * signal is received. Will also return early if the process is
248 1.2 ad * exiting. Returns zero if awoken normallly, EWOULDBLOCK if the
249 1.2 ad * timeout expires, ERESTART if a signal was received and the system
250 1.2 ad * call is restartable, or EINTR otherwise.
251 1.2 ad */
252 1.2 ad int
253 1.2 ad cv_timedwait_sig(kcondvar_t *cv, kmutex_t *mtx, int timo)
254 1.2 ad {
255 1.2 ad struct lwp *l = curlwp;
256 1.2 ad sleepq_t *sq;
257 1.2 ad int error;
258 1.2 ad
259 1.2 ad LOCK_ASSERT(mutex_owned(mtx));
260 1.2 ad
261 1.2 ad if (sleepq_dontsleep(l))
262 1.2 ad return sleepq_abort(mtx, 0);
263 1.2 ad
264 1.2 ad sq = cv_enter(cv, mtx, l);
265 1.3 yamt sleepq_block(sq, sched_kpri(l), cv, cv->cv_wmesg, timo, 1, &cv_syncobj);
266 1.2 ad error = sleepq_unblock(timo, 1);
267 1.2 ad mutex_enter(mtx);
268 1.2 ad
269 1.2 ad return error;
270 1.2 ad }
271 1.2 ad
272 1.2 ad /*
273 1.2 ad * cv_signal:
274 1.2 ad *
275 1.2 ad * Wake the highest priority LWP waiting on a condition variable.
276 1.2 ad * Must be called with the interlocking mutex held.
277 1.2 ad */
278 1.2 ad void
279 1.2 ad cv_signal(kcondvar_t *cv)
280 1.2 ad {
281 1.2 ad sleepq_t *sq;
282 1.2 ad
283 1.2 ad if (cv->cv_waiters == 0)
284 1.2 ad return;
285 1.2 ad
286 1.2 ad /*
287 1.2 ad * cv->cv_waiters may be stale and have dropped to zero, but
288 1.2 ad * while holding the interlock (the mutex passed to cv_wait()
289 1.2 ad * and similar) we will see non-zero values when it matters.
290 1.2 ad */
291 1.2 ad
292 1.2 ad sq = sleeptab_lookup(&sleeptab, cv);
293 1.2 ad if (cv->cv_waiters != 0) {
294 1.2 ad cv->cv_waiters--;
295 1.2 ad sleepq_wake(sq, cv, 1);
296 1.2 ad } else
297 1.2 ad sleepq_unlock(sq);
298 1.2 ad }
299 1.2 ad
300 1.2 ad /*
301 1.2 ad * cv_broadcast:
302 1.2 ad *
303 1.2 ad * Wake all LWPs waiting on a condition variable. Must be called
304 1.2 ad * with the interlocking mutex held.
305 1.2 ad */
306 1.2 ad void
307 1.2 ad cv_broadcast(kcondvar_t *cv)
308 1.2 ad {
309 1.2 ad sleepq_t *sq;
310 1.2 ad u_int cnt;
311 1.2 ad
312 1.2 ad if (cv->cv_waiters == 0)
313 1.2 ad return;
314 1.2 ad
315 1.2 ad sq = sleeptab_lookup(&sleeptab, cv);
316 1.2 ad if ((cnt = cv->cv_waiters) != 0) {
317 1.2 ad cv->cv_waiters = 0;
318 1.2 ad sleepq_wake(sq, cv, cnt);
319 1.2 ad } else
320 1.2 ad sleepq_unlock(sq);
321 1.2 ad }
322 1.2 ad
323 1.2 ad /*
324 1.2 ad * cv_wakeup:
325 1.2 ad *
326 1.2 ad * Wake all LWPs waiting on a condition variable. The interlock
327 1.2 ad * need not be held, but it is the caller's responsibility to
328 1.2 ad * ensure correct synchronization.
329 1.2 ad */
330 1.2 ad void
331 1.2 ad cv_wakeup(kcondvar_t *cv)
332 1.2 ad {
333 1.2 ad sleepq_t *sq;
334 1.2 ad u_int cnt;
335 1.2 ad
336 1.2 ad sq = sleeptab_lookup(&sleeptab, cv);
337 1.2 ad if ((cnt = cv->cv_waiters) != 0) {
338 1.2 ad cv->cv_waiters = 0;
339 1.2 ad sleepq_wake(sq, cv, cnt);
340 1.2 ad } else
341 1.2 ad sleepq_unlock(sq);
342 1.2 ad }
343 1.2 ad
344 1.2 ad /*
345 1.2 ad * cv_has_waiters:
346 1.2 ad *
347 1.2 ad * For diagnostic assertions: return non-zero if a condition
348 1.2 ad * variable has waiters.
349 1.2 ad */
350 1.2 ad int
351 1.2 ad cv_has_waiters(kcondvar_t *cv)
352 1.2 ad {
353 1.2 ad
354 1.2 ad /* No need to interlock here */
355 1.2 ad return (int)cv->cv_waiters;
356 1.2 ad }
357