kern_condvar.c revision 1.14 1 1.14 ad /* $NetBSD: kern_condvar.c,v 1.14 2007/11/06 00:42:41 ad 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.14 ad __KERNEL_RCSID(0, "$NetBSD: kern_condvar.c,v 1.14 2007/11/06 00:42:41 ad 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.6 ad static void cv_unsleep(lwp_t *);
58 1.2 ad
59 1.10 ad static syncobj_t cv_syncobj = {
60 1.2 ad SOBJ_SLEEPQ_SORTED,
61 1.2 ad cv_unsleep,
62 1.14 ad sleepq_changepri,
63 1.4 yamt sleepq_lendpri,
64 1.4 yamt syncobj_noowner,
65 1.2 ad };
66 1.2 ad
67 1.10 ad static const char deadcv[] = "deadcv";
68 1.10 ad
69 1.2 ad /*
70 1.2 ad * cv_init:
71 1.2 ad *
72 1.2 ad * Initialize a condition variable for use.
73 1.2 ad */
74 1.2 ad void
75 1.2 ad cv_init(kcondvar_t *cv, const char *wmesg)
76 1.2 ad {
77 1.2 ad
78 1.2 ad KASSERT(wmesg != NULL);
79 1.2 ad
80 1.2 ad cv->cv_wmesg = wmesg;
81 1.2 ad cv->cv_waiters = 0;
82 1.2 ad }
83 1.2 ad
84 1.2 ad /*
85 1.2 ad * cv_destroy:
86 1.2 ad *
87 1.2 ad * Tear down a condition variable.
88 1.2 ad */
89 1.2 ad void
90 1.2 ad cv_destroy(kcondvar_t *cv)
91 1.2 ad {
92 1.2 ad
93 1.2 ad #ifdef DIAGNOSTIC
94 1.10 ad KASSERT(cv->cv_wmesg != deadcv && cv->cv_wmesg != NULL);
95 1.10 ad KASSERT(cv->cv_waiters == 0);
96 1.10 ad cv->cv_wmesg = deadcv;
97 1.2 ad #endif
98 1.2 ad }
99 1.2 ad
100 1.2 ad /*
101 1.2 ad * cv_enter:
102 1.2 ad *
103 1.2 ad * Look up and lock the sleep queue corresponding to the given
104 1.2 ad * condition variable, and increment the number of waiters.
105 1.2 ad */
106 1.2 ad static inline sleepq_t *
107 1.6 ad cv_enter(kcondvar_t *cv, kmutex_t *mtx, lwp_t *l)
108 1.2 ad {
109 1.2 ad sleepq_t *sq;
110 1.2 ad
111 1.10 ad KASSERT(cv->cv_wmesg != deadcv && cv->cv_wmesg != NULL);
112 1.14 ad KASSERT((l->l_pflag & LP_INTR) == 0 || panicstr != NULL);
113 1.2 ad
114 1.6 ad l->l_cv_signalled = 0;
115 1.14 ad l->l_kpriority = true;
116 1.2 ad sq = sleeptab_lookup(&sleeptab, cv);
117 1.2 ad cv->cv_waiters++;
118 1.2 ad sleepq_enter(sq, l);
119 1.14 ad sleepq_enqueue(sq, cv, cv->cv_wmesg, &cv_syncobj);
120 1.2 ad mutex_exit(mtx);
121 1.2 ad
122 1.2 ad return sq;
123 1.2 ad }
124 1.2 ad
125 1.2 ad /*
126 1.6 ad * cv_exit:
127 1.6 ad *
128 1.6 ad * After resuming execution, check to see if we have been restarted
129 1.6 ad * as a result of cv_signal(). If we have, but cannot take the
130 1.6 ad * wakeup (because of eg a pending Unix signal or timeout) then try
131 1.6 ad * to ensure that another LWP sees it. This is necessary because
132 1.6 ad * there may be multiple waiters, and at least one should take the
133 1.6 ad * wakeup if possible.
134 1.6 ad */
135 1.6 ad static inline int
136 1.6 ad cv_exit(kcondvar_t *cv, kmutex_t *mtx, lwp_t *l, const int error)
137 1.6 ad {
138 1.6 ad
139 1.6 ad mutex_enter(mtx);
140 1.6 ad if (__predict_false(error != 0) && l->l_cv_signalled != 0)
141 1.6 ad cv_signal(cv);
142 1.6 ad
143 1.10 ad KASSERT(cv->cv_wmesg != deadcv && cv->cv_wmesg != NULL);
144 1.10 ad
145 1.6 ad return error;
146 1.6 ad }
147 1.6 ad
148 1.6 ad /*
149 1.2 ad * cv_unsleep:
150 1.2 ad *
151 1.2 ad * Remove an LWP from the condition variable and sleep queue. This
152 1.2 ad * is called when the LWP has not been awoken normally but instead
153 1.2 ad * interrupted: for example, when a signal is received. Must be
154 1.2 ad * called with the LWP locked, and must return it unlocked.
155 1.2 ad */
156 1.2 ad static void
157 1.6 ad cv_unsleep(lwp_t *l)
158 1.2 ad {
159 1.10 ad kcondvar_t *cv;
160 1.2 ad
161 1.2 ad KASSERT(l->l_wchan != NULL);
162 1.8 yamt KASSERT(lwp_locked(l, l->l_sleepq->sq_mutex));
163 1.2 ad
164 1.10 ad cv = (kcondvar_t *)(uintptr_t)l->l_wchan;
165 1.10 ad KASSERT(cv->cv_wmesg != deadcv && cv->cv_wmesg != NULL);
166 1.10 ad cv->cv_waiters--;
167 1.2 ad
168 1.2 ad sleepq_unsleep(l);
169 1.2 ad }
170 1.2 ad
171 1.2 ad /*
172 1.2 ad * cv_wait:
173 1.2 ad *
174 1.2 ad * Wait non-interruptably on a condition variable until awoken.
175 1.2 ad */
176 1.2 ad void
177 1.2 ad cv_wait(kcondvar_t *cv, kmutex_t *mtx)
178 1.2 ad {
179 1.6 ad lwp_t *l = curlwp;
180 1.2 ad sleepq_t *sq;
181 1.2 ad
182 1.8 yamt KASSERT(mutex_owned(mtx));
183 1.2 ad
184 1.2 ad if (sleepq_dontsleep(l)) {
185 1.2 ad (void)sleepq_abort(mtx, 0);
186 1.2 ad return;
187 1.2 ad }
188 1.2 ad
189 1.2 ad sq = cv_enter(cv, mtx, l);
190 1.8 yamt (void)sleepq_block(0, false);
191 1.6 ad (void)cv_exit(cv, mtx, l, 0);
192 1.2 ad }
193 1.2 ad
194 1.2 ad /*
195 1.2 ad * cv_wait_sig:
196 1.2 ad *
197 1.2 ad * Wait on a condition variable until a awoken or a signal is received.
198 1.2 ad * Will also return early if the process is exiting. Returns zero if
199 1.2 ad * awoken normallly, ERESTART if a signal was received and the system
200 1.2 ad * call is restartable, or EINTR otherwise.
201 1.2 ad */
202 1.2 ad int
203 1.2 ad cv_wait_sig(kcondvar_t *cv, kmutex_t *mtx)
204 1.2 ad {
205 1.6 ad lwp_t *l = curlwp;
206 1.2 ad sleepq_t *sq;
207 1.2 ad int error;
208 1.2 ad
209 1.8 yamt KASSERT(mutex_owned(mtx));
210 1.2 ad
211 1.2 ad if (sleepq_dontsleep(l))
212 1.2 ad return sleepq_abort(mtx, 0);
213 1.2 ad
214 1.2 ad sq = cv_enter(cv, mtx, l);
215 1.8 yamt error = sleepq_block(0, true);
216 1.6 ad return cv_exit(cv, mtx, l, error);
217 1.2 ad }
218 1.2 ad
219 1.2 ad /*
220 1.2 ad * cv_timedwait:
221 1.2 ad *
222 1.2 ad * Wait on a condition variable until awoken or the specified timeout
223 1.2 ad * expires. Returns zero if awoken normally or EWOULDBLOCK if the
224 1.2 ad * timeout expired.
225 1.2 ad */
226 1.2 ad int
227 1.2 ad cv_timedwait(kcondvar_t *cv, kmutex_t *mtx, int timo)
228 1.2 ad {
229 1.6 ad lwp_t *l = curlwp;
230 1.2 ad sleepq_t *sq;
231 1.2 ad int error;
232 1.2 ad
233 1.8 yamt KASSERT(mutex_owned(mtx));
234 1.2 ad
235 1.2 ad if (sleepq_dontsleep(l))
236 1.2 ad return sleepq_abort(mtx, 0);
237 1.2 ad
238 1.2 ad sq = cv_enter(cv, mtx, l);
239 1.8 yamt error = sleepq_block(timo, false);
240 1.6 ad return cv_exit(cv, mtx, l, 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.6 ad lwp_t *l = curlwp;
256 1.2 ad sleepq_t *sq;
257 1.2 ad int error;
258 1.2 ad
259 1.8 yamt KASSERT(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.8 yamt error = sleepq_block(timo, true);
266 1.6 ad return cv_exit(cv, mtx, l, error);
267 1.2 ad }
268 1.2 ad
269 1.2 ad /*
270 1.2 ad * cv_signal:
271 1.2 ad *
272 1.2 ad * Wake the highest priority LWP waiting on a condition variable.
273 1.2 ad * Must be called with the interlocking mutex held.
274 1.2 ad */
275 1.2 ad void
276 1.2 ad cv_signal(kcondvar_t *cv)
277 1.2 ad {
278 1.6 ad lwp_t *l;
279 1.2 ad sleepq_t *sq;
280 1.2 ad
281 1.2 ad if (cv->cv_waiters == 0)
282 1.2 ad return;
283 1.2 ad
284 1.2 ad /*
285 1.2 ad * cv->cv_waiters may be stale and have dropped to zero, but
286 1.2 ad * while holding the interlock (the mutex passed to cv_wait()
287 1.2 ad * and similar) we will see non-zero values when it matters.
288 1.2 ad */
289 1.2 ad
290 1.2 ad sq = sleeptab_lookup(&sleeptab, cv);
291 1.2 ad if (cv->cv_waiters != 0) {
292 1.2 ad cv->cv_waiters--;
293 1.6 ad l = sleepq_wake(sq, cv, 1);
294 1.6 ad l->l_cv_signalled = 1;
295 1.2 ad } else
296 1.2 ad sleepq_unlock(sq);
297 1.2 ad }
298 1.2 ad
299 1.2 ad /*
300 1.2 ad * cv_broadcast:
301 1.2 ad *
302 1.2 ad * Wake all LWPs waiting on a condition variable. Must be called
303 1.2 ad * with the interlocking mutex held.
304 1.2 ad */
305 1.2 ad void
306 1.2 ad cv_broadcast(kcondvar_t *cv)
307 1.2 ad {
308 1.2 ad sleepq_t *sq;
309 1.2 ad u_int cnt;
310 1.2 ad
311 1.2 ad if (cv->cv_waiters == 0)
312 1.2 ad return;
313 1.2 ad
314 1.2 ad sq = sleeptab_lookup(&sleeptab, cv);
315 1.2 ad if ((cnt = cv->cv_waiters) != 0) {
316 1.2 ad cv->cv_waiters = 0;
317 1.2 ad sleepq_wake(sq, cv, cnt);
318 1.2 ad } else
319 1.2 ad sleepq_unlock(sq);
320 1.2 ad }
321 1.2 ad
322 1.2 ad /*
323 1.11 ad * cv_wakeup:
324 1.11 ad *
325 1.11 ad * Wake all LWPs waiting on a condition variable. For cases
326 1.11 ad * where the address may be waited on by mtsleep()/tsleep().
327 1.11 ad * Not a documented call.
328 1.11 ad */
329 1.11 ad void
330 1.11 ad cv_wakeup(kcondvar_t *cv)
331 1.11 ad {
332 1.11 ad sleepq_t *sq;
333 1.11 ad
334 1.11 ad sq = sleeptab_lookup(&sleeptab, cv);
335 1.12 ad cv->cv_waiters = 0;
336 1.12 ad sleepq_wake(sq, cv, (u_int)-1);
337 1.11 ad }
338 1.11 ad
339 1.11 ad /*
340 1.2 ad * cv_has_waiters:
341 1.2 ad *
342 1.2 ad * For diagnostic assertions: return non-zero if a condition
343 1.2 ad * variable has waiters.
344 1.2 ad */
345 1.7 ad bool
346 1.2 ad cv_has_waiters(kcondvar_t *cv)
347 1.2 ad {
348 1.2 ad
349 1.2 ad /* No need to interlock here */
350 1.7 ad return cv->cv_waiters != 0;
351 1.2 ad }
352