kern_condvar.c revision 1.35 1 1.35 uebayasi /* $NetBSD: kern_condvar.c,v 1.35 2015/08/07 06:22:12 uebayasi Exp $ */
2 1.2 ad
3 1.2 ad /*-
4 1.15 ad * Copyright (c) 2006, 2007, 2008 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 *
19 1.2 ad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.2 ad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.2 ad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.2 ad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.2 ad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.2 ad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.2 ad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.2 ad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.2 ad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.2 ad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.2 ad * POSSIBILITY OF SUCH DAMAGE.
30 1.2 ad */
31 1.2 ad
32 1.2 ad /*
33 1.24 ad * Kernel condition variable implementation.
34 1.2 ad */
35 1.2 ad
36 1.2 ad #include <sys/cdefs.h>
37 1.35 uebayasi __KERNEL_RCSID(0, "$NetBSD: kern_condvar.c,v 1.35 2015/08/07 06:22:12 uebayasi Exp $");
38 1.2 ad
39 1.2 ad #include <sys/param.h>
40 1.2 ad #include <sys/systm.h>
41 1.35 uebayasi #include <sys/lwp.h>
42 1.2 ad #include <sys/condvar.h>
43 1.2 ad #include <sys/sleepq.h>
44 1.20 ad #include <sys/lockdebug.h>
45 1.24 ad #include <sys/cpu.h>
46 1.20 ad
47 1.26 thorpej /*
48 1.26 thorpej * Accessors for the private contents of the kcondvar_t data type.
49 1.26 thorpej *
50 1.26 thorpej * cv_opaque[0] sleepq...
51 1.26 thorpej * cv_opaque[1] ...pointers
52 1.26 thorpej * cv_opaque[2] description for ps(1)
53 1.26 thorpej *
54 1.26 thorpej * cv_opaque[0..1] is protected by the interlock passed to cv_wait() (enqueue
55 1.26 thorpej * only), and the sleep queue lock acquired with sleeptab_lookup() (enqueue
56 1.26 thorpej * and dequeue).
57 1.26 thorpej *
58 1.26 thorpej * cv_opaque[2] (the wmesg) is static and does not change throughout the life
59 1.26 thorpej * of the CV.
60 1.26 thorpej */
61 1.26 thorpej #define CV_SLEEPQ(cv) ((sleepq_t *)(cv)->cv_opaque)
62 1.26 thorpej #define CV_WMESG(cv) ((const char *)(cv)->cv_opaque[2])
63 1.26 thorpej #define CV_SET_WMESG(cv, v) (cv)->cv_opaque[2] = __UNCONST(v)
64 1.26 thorpej
65 1.26 thorpej #define CV_DEBUG_P(cv) (CV_WMESG(cv) != nodebug)
66 1.20 ad #define CV_RA ((uintptr_t)__builtin_return_address(0))
67 1.2 ad
68 1.27 rmind static void cv_unsleep(lwp_t *, bool);
69 1.20 ad static void cv_wakeup_one(kcondvar_t *);
70 1.20 ad static void cv_wakeup_all(kcondvar_t *);
71 1.2 ad
72 1.10 ad static syncobj_t cv_syncobj = {
73 1.2 ad SOBJ_SLEEPQ_SORTED,
74 1.2 ad cv_unsleep,
75 1.14 ad sleepq_changepri,
76 1.4 yamt sleepq_lendpri,
77 1.4 yamt syncobj_noowner,
78 1.2 ad };
79 1.2 ad
80 1.20 ad lockops_t cv_lockops = {
81 1.20 ad "Condition variable",
82 1.20 ad LOCKOPS_CV,
83 1.20 ad NULL
84 1.20 ad };
85 1.20 ad
86 1.10 ad static const char deadcv[] = "deadcv";
87 1.33 joerg #ifdef LOCKDEBUG
88 1.20 ad static const char nodebug[] = "nodebug";
89 1.33 joerg #endif
90 1.10 ad
91 1.2 ad /*
92 1.2 ad * cv_init:
93 1.2 ad *
94 1.2 ad * Initialize a condition variable for use.
95 1.2 ad */
96 1.2 ad void
97 1.2 ad cv_init(kcondvar_t *cv, const char *wmesg)
98 1.2 ad {
99 1.21 ad #ifdef LOCKDEBUG
100 1.20 ad bool dodebug;
101 1.2 ad
102 1.20 ad dodebug = LOCKDEBUG_ALLOC(cv, &cv_lockops,
103 1.20 ad (uintptr_t)__builtin_return_address(0));
104 1.21 ad if (!dodebug) {
105 1.20 ad /* XXX This will break vfs_lockf. */
106 1.21 ad wmesg = nodebug;
107 1.20 ad }
108 1.21 ad #endif
109 1.21 ad KASSERT(wmesg != NULL);
110 1.26 thorpej CV_SET_WMESG(cv, wmesg);
111 1.20 ad sleepq_init(CV_SLEEPQ(cv));
112 1.2 ad }
113 1.2 ad
114 1.2 ad /*
115 1.2 ad * cv_destroy:
116 1.2 ad *
117 1.2 ad * Tear down a condition variable.
118 1.2 ad */
119 1.2 ad void
120 1.2 ad cv_destroy(kcondvar_t *cv)
121 1.2 ad {
122 1.2 ad
123 1.20 ad LOCKDEBUG_FREE(CV_DEBUG_P(cv), cv);
124 1.2 ad #ifdef DIAGNOSTIC
125 1.15 ad KASSERT(cv_is_valid(cv));
126 1.26 thorpej CV_SET_WMESG(cv, deadcv);
127 1.2 ad #endif
128 1.2 ad }
129 1.2 ad
130 1.2 ad /*
131 1.2 ad * cv_enter:
132 1.2 ad *
133 1.2 ad * Look up and lock the sleep queue corresponding to the given
134 1.2 ad * condition variable, and increment the number of waiters.
135 1.2 ad */
136 1.20 ad static inline void
137 1.6 ad cv_enter(kcondvar_t *cv, kmutex_t *mtx, lwp_t *l)
138 1.2 ad {
139 1.2 ad sleepq_t *sq;
140 1.18 ad kmutex_t *mp;
141 1.2 ad
142 1.15 ad KASSERT(cv_is_valid(cv));
143 1.24 ad KASSERT(!cpu_intr_p());
144 1.14 ad KASSERT((l->l_pflag & LP_INTR) == 0 || panicstr != NULL);
145 1.2 ad
146 1.20 ad LOCKDEBUG_LOCKED(CV_DEBUG_P(cv), cv, mtx, CV_RA, 0);
147 1.20 ad
148 1.14 ad l->l_kpriority = true;
149 1.24 ad mp = sleepq_hashlock(cv);
150 1.20 ad sq = CV_SLEEPQ(cv);
151 1.18 ad sleepq_enter(sq, l, mp);
152 1.26 thorpej sleepq_enqueue(sq, cv, CV_WMESG(cv), &cv_syncobj);
153 1.2 ad mutex_exit(mtx);
154 1.24 ad KASSERT(cv_has_waiters(cv));
155 1.2 ad }
156 1.2 ad
157 1.2 ad /*
158 1.6 ad * cv_exit:
159 1.6 ad *
160 1.6 ad * After resuming execution, check to see if we have been restarted
161 1.6 ad * as a result of cv_signal(). If we have, but cannot take the
162 1.6 ad * wakeup (because of eg a pending Unix signal or timeout) then try
163 1.6 ad * to ensure that another LWP sees it. This is necessary because
164 1.6 ad * there may be multiple waiters, and at least one should take the
165 1.6 ad * wakeup if possible.
166 1.6 ad */
167 1.6 ad static inline int
168 1.6 ad cv_exit(kcondvar_t *cv, kmutex_t *mtx, lwp_t *l, const int error)
169 1.6 ad {
170 1.6 ad
171 1.6 ad mutex_enter(mtx);
172 1.20 ad if (__predict_false(error != 0))
173 1.6 ad cv_signal(cv);
174 1.6 ad
175 1.20 ad LOCKDEBUG_UNLOCKED(CV_DEBUG_P(cv), cv, CV_RA, 0);
176 1.15 ad KASSERT(cv_is_valid(cv));
177 1.10 ad
178 1.6 ad return error;
179 1.6 ad }
180 1.6 ad
181 1.6 ad /*
182 1.2 ad * cv_unsleep:
183 1.2 ad *
184 1.2 ad * Remove an LWP from the condition variable and sleep queue. This
185 1.2 ad * is called when the LWP has not been awoken normally but instead
186 1.2 ad * interrupted: for example, when a signal is received. Must be
187 1.2 ad * called with the LWP locked, and must return it unlocked.
188 1.2 ad */
189 1.27 rmind static void
190 1.16 ad cv_unsleep(lwp_t *l, bool cleanup)
191 1.2 ad {
192 1.34 martin kcondvar_t *cv __diagused;
193 1.2 ad
194 1.15 ad cv = (kcondvar_t *)(uintptr_t)l->l_wchan;
195 1.15 ad
196 1.20 ad KASSERT(l->l_wchan == (wchan_t)cv);
197 1.20 ad KASSERT(l->l_sleepq == CV_SLEEPQ(cv));
198 1.15 ad KASSERT(cv_is_valid(cv));
199 1.24 ad KASSERT(cv_has_waiters(cv));
200 1.2 ad
201 1.27 rmind sleepq_unsleep(l, cleanup);
202 1.2 ad }
203 1.2 ad
204 1.2 ad /*
205 1.2 ad * cv_wait:
206 1.2 ad *
207 1.2 ad * Wait non-interruptably on a condition variable until awoken.
208 1.2 ad */
209 1.2 ad void
210 1.2 ad cv_wait(kcondvar_t *cv, kmutex_t *mtx)
211 1.2 ad {
212 1.6 ad lwp_t *l = curlwp;
213 1.2 ad
214 1.8 yamt KASSERT(mutex_owned(mtx));
215 1.2 ad
216 1.20 ad cv_enter(cv, mtx, l);
217 1.8 yamt (void)sleepq_block(0, false);
218 1.6 ad (void)cv_exit(cv, mtx, l, 0);
219 1.2 ad }
220 1.2 ad
221 1.2 ad /*
222 1.2 ad * cv_wait_sig:
223 1.2 ad *
224 1.2 ad * Wait on a condition variable until a awoken or a signal is received.
225 1.2 ad * Will also return early if the process is exiting. Returns zero if
226 1.29 jym * awoken normally, ERESTART if a signal was received and the system
227 1.2 ad * call is restartable, or EINTR otherwise.
228 1.2 ad */
229 1.2 ad int
230 1.2 ad cv_wait_sig(kcondvar_t *cv, kmutex_t *mtx)
231 1.2 ad {
232 1.6 ad lwp_t *l = curlwp;
233 1.2 ad int error;
234 1.2 ad
235 1.8 yamt KASSERT(mutex_owned(mtx));
236 1.2 ad
237 1.20 ad cv_enter(cv, mtx, l);
238 1.8 yamt error = sleepq_block(0, true);
239 1.6 ad return cv_exit(cv, mtx, l, error);
240 1.2 ad }
241 1.2 ad
242 1.2 ad /*
243 1.2 ad * cv_timedwait:
244 1.2 ad *
245 1.2 ad * Wait on a condition variable until awoken or the specified timeout
246 1.2 ad * expires. Returns zero if awoken normally or EWOULDBLOCK if the
247 1.2 ad * timeout expired.
248 1.31 apb *
249 1.31 apb * timo is a timeout in ticks. timo = 0 specifies an infinite timeout.
250 1.2 ad */
251 1.2 ad int
252 1.2 ad cv_timedwait(kcondvar_t *cv, kmutex_t *mtx, int timo)
253 1.2 ad {
254 1.6 ad lwp_t *l = curlwp;
255 1.2 ad int error;
256 1.2 ad
257 1.8 yamt KASSERT(mutex_owned(mtx));
258 1.2 ad
259 1.20 ad cv_enter(cv, mtx, l);
260 1.8 yamt error = sleepq_block(timo, false);
261 1.6 ad return cv_exit(cv, mtx, l, error);
262 1.2 ad }
263 1.2 ad
264 1.2 ad /*
265 1.2 ad * cv_timedwait_sig:
266 1.2 ad *
267 1.2 ad * Wait on a condition variable until a timeout expires, awoken or a
268 1.2 ad * signal is received. Will also return early if the process is
269 1.29 jym * exiting. Returns zero if awoken normally, EWOULDBLOCK if the
270 1.2 ad * timeout expires, ERESTART if a signal was received and the system
271 1.2 ad * call is restartable, or EINTR otherwise.
272 1.32 apb *
273 1.32 apb * timo is a timeout in ticks. timo = 0 specifies an infinite timeout.
274 1.2 ad */
275 1.2 ad int
276 1.2 ad cv_timedwait_sig(kcondvar_t *cv, kmutex_t *mtx, int timo)
277 1.2 ad {
278 1.6 ad lwp_t *l = curlwp;
279 1.2 ad int error;
280 1.2 ad
281 1.8 yamt KASSERT(mutex_owned(mtx));
282 1.2 ad
283 1.20 ad cv_enter(cv, mtx, l);
284 1.8 yamt error = sleepq_block(timo, true);
285 1.6 ad return cv_exit(cv, mtx, l, error);
286 1.2 ad }
287 1.2 ad
288 1.2 ad /*
289 1.2 ad * cv_signal:
290 1.2 ad *
291 1.2 ad * Wake the highest priority LWP waiting on a condition variable.
292 1.2 ad * Must be called with the interlocking mutex held.
293 1.2 ad */
294 1.2 ad void
295 1.2 ad cv_signal(kcondvar_t *cv)
296 1.2 ad {
297 1.20 ad
298 1.22 ad /* LOCKDEBUG_WAKEUP(CV_DEBUG_P(cv), cv, CV_RA); */
299 1.20 ad KASSERT(cv_is_valid(cv));
300 1.20 ad
301 1.24 ad if (__predict_false(!TAILQ_EMPTY(CV_SLEEPQ(cv))))
302 1.24 ad cv_wakeup_one(cv);
303 1.20 ad }
304 1.20 ad
305 1.20 ad static void __noinline
306 1.20 ad cv_wakeup_one(kcondvar_t *cv)
307 1.20 ad {
308 1.2 ad sleepq_t *sq;
309 1.18 ad kmutex_t *mp;
310 1.20 ad lwp_t *l;
311 1.2 ad
312 1.15 ad KASSERT(cv_is_valid(cv));
313 1.15 ad
314 1.24 ad mp = sleepq_hashlock(cv);
315 1.20 ad sq = CV_SLEEPQ(cv);
316 1.20 ad l = TAILQ_FIRST(sq);
317 1.20 ad if (l == NULL) {
318 1.20 ad mutex_spin_exit(mp);
319 1.2 ad return;
320 1.20 ad }
321 1.20 ad KASSERT(l->l_sleepq == sq);
322 1.20 ad KASSERT(l->l_mutex == mp);
323 1.20 ad KASSERT(l->l_wchan == cv);
324 1.27 rmind sleepq_remove(sq, l);
325 1.20 ad mutex_spin_exit(mp);
326 1.2 ad
327 1.15 ad KASSERT(cv_is_valid(cv));
328 1.2 ad }
329 1.2 ad
330 1.2 ad /*
331 1.2 ad * cv_broadcast:
332 1.2 ad *
333 1.2 ad * Wake all LWPs waiting on a condition variable. Must be called
334 1.2 ad * with the interlocking mutex held.
335 1.2 ad */
336 1.2 ad void
337 1.2 ad cv_broadcast(kcondvar_t *cv)
338 1.2 ad {
339 1.20 ad
340 1.22 ad /* LOCKDEBUG_WAKEUP(CV_DEBUG_P(cv), cv, CV_RA); */
341 1.20 ad KASSERT(cv_is_valid(cv));
342 1.20 ad
343 1.24 ad if (__predict_false(!TAILQ_EMPTY(CV_SLEEPQ(cv))))
344 1.24 ad cv_wakeup_all(cv);
345 1.20 ad }
346 1.20 ad
347 1.20 ad static void __noinline
348 1.20 ad cv_wakeup_all(kcondvar_t *cv)
349 1.20 ad {
350 1.2 ad sleepq_t *sq;
351 1.18 ad kmutex_t *mp;
352 1.20 ad lwp_t *l, *next;
353 1.2 ad
354 1.15 ad KASSERT(cv_is_valid(cv));
355 1.15 ad
356 1.24 ad mp = sleepq_hashlock(cv);
357 1.20 ad sq = CV_SLEEPQ(cv);
358 1.20 ad for (l = TAILQ_FIRST(sq); l != NULL; l = next) {
359 1.20 ad KASSERT(l->l_sleepq == sq);
360 1.20 ad KASSERT(l->l_mutex == mp);
361 1.20 ad KASSERT(l->l_wchan == cv);
362 1.20 ad next = TAILQ_NEXT(l, l_sleepchain);
363 1.27 rmind sleepq_remove(sq, l);
364 1.20 ad }
365 1.20 ad mutex_spin_exit(mp);
366 1.2 ad
367 1.15 ad KASSERT(cv_is_valid(cv));
368 1.2 ad }
369 1.2 ad
370 1.2 ad /*
371 1.2 ad * cv_has_waiters:
372 1.2 ad *
373 1.2 ad * For diagnostic assertions: return non-zero if a condition
374 1.2 ad * variable has waiters.
375 1.2 ad */
376 1.7 ad bool
377 1.2 ad cv_has_waiters(kcondvar_t *cv)
378 1.2 ad {
379 1.23 chris
380 1.25 ad return !TAILQ_EMPTY(CV_SLEEPQ(cv));
381 1.2 ad }
382 1.15 ad
383 1.15 ad /*
384 1.15 ad * cv_is_valid:
385 1.15 ad *
386 1.15 ad * For diagnostic assertions: return non-zero if a condition
387 1.15 ad * variable appears to be valid. No locks need be held.
388 1.15 ad */
389 1.15 ad bool
390 1.15 ad cv_is_valid(kcondvar_t *cv)
391 1.15 ad {
392 1.15 ad
393 1.26 thorpej return CV_WMESG(cv) != deadcv && CV_WMESG(cv) != NULL;
394 1.15 ad }
395