sleepq.c revision 1.13.4.1 1 1.13.4.1 yamt /* $NetBSD: sleepq.c,v 1.13.4.1 2014/05/22 11:41:15 yamt Exp $ */
2 1.1 pooka
3 1.1 pooka /*
4 1.1 pooka * Copyright (c) 2008 Antti Kantee. All Rights Reserved.
5 1.1 pooka *
6 1.1 pooka * Redistribution and use in source and binary forms, with or without
7 1.1 pooka * modification, are permitted provided that the following conditions
8 1.1 pooka * are met:
9 1.1 pooka * 1. Redistributions of source code must retain the above copyright
10 1.1 pooka * notice, this list of conditions and the following disclaimer.
11 1.1 pooka * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 pooka * notice, this list of conditions and the following disclaimer in the
13 1.1 pooka * documentation and/or other materials provided with the distribution.
14 1.1 pooka *
15 1.1 pooka * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
16 1.1 pooka * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
17 1.1 pooka * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
18 1.1 pooka * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 1.1 pooka * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 1.1 pooka * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
21 1.1 pooka * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 1.1 pooka * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 1.1 pooka * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 1.1 pooka * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25 1.1 pooka * SUCH DAMAGE.
26 1.1 pooka */
27 1.1 pooka
28 1.2 pooka #include <sys/cdefs.h>
29 1.13.4.1 yamt __KERNEL_RCSID(0, "$NetBSD: sleepq.c,v 1.13.4.1 2014/05/22 11:41:15 yamt Exp $");
30 1.2 pooka
31 1.1 pooka #include <sys/param.h>
32 1.1 pooka #include <sys/condvar.h>
33 1.1 pooka #include <sys/mutex.h>
34 1.6 pooka #include <sys/once.h>
35 1.1 pooka #include <sys/queue.h>
36 1.1 pooka #include <sys/sleepq.h>
37 1.1 pooka #include <sys/syncobj.h>
38 1.10 skrll #include <sys/atomic.h>
39 1.1 pooka
40 1.3 pooka #include "rump_private.h"
41 1.3 pooka
42 1.1 pooka syncobj_t sleep_syncobj;
43 1.1 pooka static kcondvar_t sq_cv;
44 1.1 pooka
45 1.6 pooka static int
46 1.6 pooka sqinit1(void)
47 1.6 pooka {
48 1.6 pooka
49 1.6 pooka cv_init(&sq_cv, "sleepq");
50 1.6 pooka
51 1.6 pooka return 0;
52 1.6 pooka }
53 1.6 pooka
54 1.1 pooka void
55 1.1 pooka sleepq_init(sleepq_t *sq)
56 1.1 pooka {
57 1.13.4.1 yamt static ONCE_DECL(sqctl);
58 1.6 pooka
59 1.6 pooka RUN_ONCE(&sqctl, sqinit1);
60 1.1 pooka
61 1.1 pooka TAILQ_INIT(sq);
62 1.1 pooka }
63 1.1 pooka
64 1.1 pooka void
65 1.1 pooka sleepq_enqueue(sleepq_t *sq, wchan_t wc, const char *wmsg, syncobj_t *sob)
66 1.1 pooka {
67 1.1 pooka struct lwp *l = curlwp;
68 1.1 pooka
69 1.1 pooka l->l_wchan = wc;
70 1.12 pooka l->l_wmesg = wmsg;
71 1.3 pooka l->l_sleepq = sq;
72 1.1 pooka TAILQ_INSERT_TAIL(sq, l, l_sleepchain);
73 1.1 pooka }
74 1.1 pooka
75 1.1 pooka int
76 1.3 pooka sleepq_block(int timo, bool catch)
77 1.1 pooka {
78 1.1 pooka struct lwp *l = curlwp;
79 1.3 pooka int error = 0;
80 1.3 pooka kmutex_t *mp = l->l_mutex;
81 1.3 pooka int biglocks = l->l_biglocks;
82 1.1 pooka
83 1.3 pooka while (l->l_wchan) {
84 1.13 pooka l->l_mutex = mp; /* keep sleepq lock until woken up */
85 1.11 pooka error = cv_timedwait(&sq_cv, mp, timo);
86 1.11 pooka if (error == EWOULDBLOCK || error == EINTR) {
87 1.13 pooka if (l->l_wchan) {
88 1.13 pooka TAILQ_REMOVE(l->l_sleepq, l, l_sleepchain);
89 1.13 pooka l->l_wchan = NULL;
90 1.13 pooka l->l_wmesg = NULL;
91 1.13 pooka }
92 1.4 pooka }
93 1.3 pooka }
94 1.3 pooka mutex_spin_exit(mp);
95 1.1 pooka
96 1.3 pooka if (biglocks)
97 1.3 pooka KERNEL_LOCK(biglocks, curlwp);
98 1.1 pooka
99 1.3 pooka return error;
100 1.1 pooka }
101 1.1 pooka
102 1.13.4.1 yamt void
103 1.1 pooka sleepq_wake(sleepq_t *sq, wchan_t wchan, u_int expected, kmutex_t *mp)
104 1.1 pooka {
105 1.3 pooka struct lwp *l, *l_next;
106 1.1 pooka bool found = false;
107 1.1 pooka
108 1.3 pooka for (l = TAILQ_FIRST(sq); l; l = l_next) {
109 1.3 pooka l_next = TAILQ_NEXT(l, l_sleepchain);
110 1.1 pooka if (l->l_wchan == wchan) {
111 1.1 pooka found = true;
112 1.1 pooka l->l_wchan = NULL;
113 1.12 pooka l->l_wmesg = NULL;
114 1.3 pooka TAILQ_REMOVE(sq, l, l_sleepchain);
115 1.13.4.1 yamt if (--expected == 0)
116 1.13.4.1 yamt break;
117 1.1 pooka }
118 1.1 pooka }
119 1.1 pooka if (found)
120 1.1 pooka cv_broadcast(&sq_cv);
121 1.1 pooka
122 1.1 pooka mutex_spin_exit(mp);
123 1.1 pooka }
124 1.1 pooka
125 1.5 rmind void
126 1.3 pooka sleepq_unsleep(struct lwp *l, bool cleanup)
127 1.3 pooka {
128 1.3 pooka
129 1.3 pooka l->l_wchan = NULL;
130 1.12 pooka l->l_wmesg = NULL;
131 1.3 pooka TAILQ_REMOVE(l->l_sleepq, l, l_sleepchain);
132 1.3 pooka cv_broadcast(&sq_cv);
133 1.3 pooka
134 1.3 pooka if (cleanup) {
135 1.3 pooka mutex_spin_exit(l->l_mutex);
136 1.3 pooka }
137 1.3 pooka }
138 1.3 pooka
139 1.1 pooka /*
140 1.3 pooka * Thread scheduler handles priorities. Therefore no action here.
141 1.3 pooka * (maybe do something if we're deperate?)
142 1.3 pooka */
143 1.3 pooka void
144 1.3 pooka sleepq_changepri(struct lwp *l, pri_t pri)
145 1.3 pooka {
146 1.3 pooka
147 1.3 pooka }
148 1.3 pooka
149 1.3 pooka void
150 1.3 pooka sleepq_lendpri(struct lwp *l, pri_t pri)
151 1.3 pooka {
152 1.3 pooka
153 1.3 pooka }
154 1.3 pooka
155 1.3 pooka struct lwp *
156 1.3 pooka syncobj_noowner(wchan_t wc)
157 1.3 pooka {
158 1.3 pooka
159 1.3 pooka return NULL;
160 1.3 pooka }
161 1.3 pooka
162 1.9 rmind void
163 1.9 rmind lwp_unlock_to(struct lwp *l, kmutex_t *new)
164 1.1 pooka {
165 1.9 rmind kmutex_t *old;
166 1.1 pooka
167 1.9 rmind KASSERT(mutex_owned(l->l_mutex));
168 1.9 rmind
169 1.9 rmind old = l->l_mutex;
170 1.9 rmind membar_exit();
171 1.9 rmind l->l_mutex = new;
172 1.9 rmind mutex_spin_exit(old);
173 1.1 pooka }
174