sys_lwp.c revision 1.25 1 1.25 rmind /* $NetBSD: sys_lwp.c,v 1.25 2007/08/15 02:50:40 rmind Exp $ */
2 1.2 ad
3 1.2 ad /*-
4 1.2 ad * Copyright (c) 2001, 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 Nathan J. Williams, and 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 * Lightweight process (LWP) system calls. See kern_lwp.c for a description
41 1.2 ad * of LWPs.
42 1.2 ad */
43 1.2 ad
44 1.2 ad #include <sys/cdefs.h>
45 1.25 rmind __KERNEL_RCSID(0, "$NetBSD: sys_lwp.c,v 1.25 2007/08/15 02:50:40 rmind Exp $");
46 1.2 ad
47 1.2 ad #include <sys/param.h>
48 1.2 ad #include <sys/systm.h>
49 1.2 ad #include <sys/pool.h>
50 1.2 ad #include <sys/proc.h>
51 1.2 ad #include <sys/types.h>
52 1.2 ad #include <sys/syscallargs.h>
53 1.2 ad #include <sys/kauth.h>
54 1.2 ad #include <sys/kmem.h>
55 1.2 ad #include <sys/sleepq.h>
56 1.2 ad
57 1.2 ad #include <uvm/uvm_extern.h>
58 1.2 ad
59 1.2 ad #define LWP_UNPARK_MAX 1024
60 1.2 ad
61 1.2 ad syncobj_t lwp_park_sobj = {
62 1.16 ad SOBJ_SLEEPQ_FIFO,
63 1.2 ad sleepq_unsleep,
64 1.7 yamt sleepq_changepri,
65 1.7 yamt sleepq_lendpri,
66 1.7 yamt syncobj_noowner,
67 1.2 ad };
68 1.2 ad
69 1.2 ad sleeptab_t lwp_park_tab;
70 1.2 ad
71 1.2 ad void
72 1.2 ad lwp_sys_init(void)
73 1.2 ad {
74 1.2 ad sleeptab_init(&lwp_park_tab);
75 1.2 ad }
76 1.2 ad
77 1.2 ad /* ARGSUSED */
78 1.2 ad int
79 1.2 ad sys__lwp_create(struct lwp *l, void *v, register_t *retval)
80 1.2 ad {
81 1.2 ad struct sys__lwp_create_args /* {
82 1.2 ad syscallarg(const ucontext_t *) ucp;
83 1.2 ad syscallarg(u_long) flags;
84 1.2 ad syscallarg(lwpid_t *) new_lwp;
85 1.2 ad } */ *uap = v;
86 1.2 ad struct proc *p = l->l_proc;
87 1.2 ad struct lwp *l2;
88 1.2 ad vaddr_t uaddr;
89 1.6 thorpej bool inmem;
90 1.2 ad ucontext_t *newuc;
91 1.2 ad int error, lid;
92 1.2 ad
93 1.2 ad newuc = pool_get(&lwp_uc_pool, PR_WAITOK);
94 1.2 ad
95 1.2 ad error = copyin(SCARG(uap, ucp), newuc, p->p_emul->e_ucsize);
96 1.2 ad if (error) {
97 1.2 ad pool_put(&lwp_uc_pool, newuc);
98 1.2 ad return error;
99 1.2 ad }
100 1.2 ad
101 1.2 ad /* XXX check against resource limits */
102 1.2 ad
103 1.2 ad inmem = uvm_uarea_alloc(&uaddr);
104 1.2 ad if (__predict_false(uaddr == 0)) {
105 1.2 ad pool_put(&lwp_uc_pool, newuc);
106 1.2 ad return ENOMEM;
107 1.2 ad }
108 1.2 ad
109 1.18 rmind error = newlwp(l, p, uaddr, inmem,
110 1.2 ad SCARG(uap, flags) & LWP_DETACHED,
111 1.5 cube NULL, 0, p->p_emul->e_startlwp, newuc, &l2);
112 1.18 rmind if (error) {
113 1.18 rmind uvm_uarea_free(uaddr);
114 1.18 rmind pool_put(&lwp_uc_pool, newuc);
115 1.18 rmind return error;
116 1.18 rmind }
117 1.2 ad
118 1.21 rmind lid = l2->l_lid;
119 1.21 rmind error = copyout(&lid, SCARG(uap, new_lwp), sizeof(lid));
120 1.21 rmind if (error) {
121 1.21 rmind lwp_exit(l2);
122 1.21 rmind pool_put(&lwp_uc_pool, newuc);
123 1.21 rmind return error;
124 1.21 rmind }
125 1.21 rmind
126 1.2 ad /*
127 1.2 ad * Set the new LWP running, unless the caller has requested that
128 1.2 ad * it be created in suspended state. If the process is stopping,
129 1.2 ad * then the LWP is created stopped.
130 1.2 ad */
131 1.2 ad mutex_enter(&p->p_smutex);
132 1.2 ad lwp_lock(l2);
133 1.2 ad if ((SCARG(uap, flags) & LWP_SUSPENDED) == 0 &&
134 1.4 pavel (l->l_flag & (LW_WREBOOT | LW_WSUSPEND | LW_WEXIT)) == 0) {
135 1.2 ad if (p->p_stat == SSTOP || (p->p_sflag & PS_STOPPING) != 0)
136 1.2 ad l2->l_stat = LSSTOP;
137 1.2 ad else {
138 1.19 yamt KASSERT(lwp_locked(l2, l2->l_cpu->ci_schedstate.spc_mutex));
139 1.2 ad p->p_nrlwps++;
140 1.2 ad l2->l_stat = LSRUN;
141 1.19 yamt sched_enqueue(l2, false);
142 1.2 ad }
143 1.2 ad } else
144 1.2 ad l2->l_stat = LSSUSPENDED;
145 1.2 ad lwp_unlock(l2);
146 1.2 ad mutex_exit(&p->p_smutex);
147 1.2 ad
148 1.2 ad return 0;
149 1.2 ad }
150 1.2 ad
151 1.2 ad int
152 1.2 ad sys__lwp_exit(struct lwp *l, void *v, register_t *retval)
153 1.2 ad {
154 1.2 ad
155 1.2 ad lwp_exit(l);
156 1.2 ad return 0;
157 1.2 ad }
158 1.2 ad
159 1.2 ad int
160 1.2 ad sys__lwp_self(struct lwp *l, void *v, register_t *retval)
161 1.2 ad {
162 1.2 ad
163 1.2 ad *retval = l->l_lid;
164 1.2 ad return 0;
165 1.2 ad }
166 1.2 ad
167 1.2 ad int
168 1.2 ad sys__lwp_getprivate(struct lwp *l, void *v, register_t *retval)
169 1.2 ad {
170 1.2 ad
171 1.2 ad *retval = (uintptr_t)l->l_private;
172 1.2 ad return 0;
173 1.2 ad }
174 1.2 ad
175 1.2 ad int
176 1.2 ad sys__lwp_setprivate(struct lwp *l, void *v, register_t *retval)
177 1.2 ad {
178 1.2 ad struct sys__lwp_setprivate_args /* {
179 1.2 ad syscallarg(void *) ptr;
180 1.2 ad } */ *uap = v;
181 1.2 ad
182 1.2 ad l->l_private = SCARG(uap, ptr);
183 1.2 ad return 0;
184 1.2 ad }
185 1.2 ad
186 1.2 ad int
187 1.2 ad sys__lwp_suspend(struct lwp *l, void *v, register_t *retval)
188 1.2 ad {
189 1.2 ad struct sys__lwp_suspend_args /* {
190 1.2 ad syscallarg(lwpid_t) target;
191 1.2 ad } */ *uap = v;
192 1.2 ad struct proc *p = l->l_proc;
193 1.2 ad struct lwp *t;
194 1.2 ad int error;
195 1.2 ad
196 1.2 ad mutex_enter(&p->p_smutex);
197 1.2 ad if ((t = lwp_find(p, SCARG(uap, target))) == NULL) {
198 1.2 ad mutex_exit(&p->p_smutex);
199 1.2 ad return ESRCH;
200 1.2 ad }
201 1.2 ad
202 1.2 ad /*
203 1.2 ad * Check for deadlock, which is only possible when we're suspending
204 1.2 ad * ourself. XXX There is a short race here, as p_nrlwps is only
205 1.2 ad * incremented when an LWP suspends itself on the kernel/user
206 1.2 ad * boundary. It's still possible to kill -9 the process so we
207 1.2 ad * don't bother checking further.
208 1.2 ad */
209 1.2 ad lwp_lock(t);
210 1.2 ad if ((t == l && p->p_nrlwps == 1) ||
211 1.4 pavel (l->l_flag & (LW_WCORE | LW_WEXIT)) != 0) {
212 1.2 ad lwp_unlock(t);
213 1.2 ad mutex_exit(&p->p_smutex);
214 1.2 ad return EDEADLK;
215 1.2 ad }
216 1.2 ad
217 1.2 ad /*
218 1.2 ad * Suspend the LWP. XXX If it's on a different CPU, we should wait
219 1.2 ad * for it to be preempted, where it will put itself to sleep.
220 1.2 ad *
221 1.2 ad * Suspension of the current LWP will happen on return to userspace.
222 1.2 ad */
223 1.2 ad error = lwp_suspend(l, t);
224 1.23 rmind if (error) {
225 1.23 rmind mutex_exit(&p->p_smutex);
226 1.23 rmind return error;
227 1.23 rmind }
228 1.23 rmind
229 1.23 rmind /*
230 1.23 rmind * Wait for:
231 1.23 rmind * o process exiting
232 1.23 rmind * o target LWP suspended
233 1.23 rmind * o target LWP not suspended and L_WSUSPEND clear
234 1.23 rmind * o target LWP exited
235 1.23 rmind */
236 1.23 rmind for (;;) {
237 1.23 rmind error = cv_wait_sig(&p->p_lwpcv, &p->p_smutex);
238 1.23 rmind if (error) {
239 1.23 rmind error = ERESTART;
240 1.23 rmind break;
241 1.23 rmind }
242 1.25 rmind if (lwp_find(p, SCARG(uap, target)) == NULL) {
243 1.25 rmind error = ESRCH;
244 1.25 rmind break;
245 1.25 rmind }
246 1.23 rmind if ((l->l_flag | t->l_flag) & (LW_WCORE | LW_WEXIT)) {
247 1.23 rmind error = ERESTART;
248 1.23 rmind break;
249 1.23 rmind }
250 1.23 rmind if (t->l_stat == LSSUSPENDED ||
251 1.23 rmind (t->l_flag & LW_WSUSPEND) == 0)
252 1.23 rmind break;
253 1.23 rmind }
254 1.2 ad mutex_exit(&p->p_smutex);
255 1.2 ad
256 1.2 ad return error;
257 1.2 ad }
258 1.2 ad
259 1.2 ad int
260 1.2 ad sys__lwp_continue(struct lwp *l, void *v, register_t *retval)
261 1.2 ad {
262 1.2 ad struct sys__lwp_continue_args /* {
263 1.2 ad syscallarg(lwpid_t) target;
264 1.2 ad } */ *uap = v;
265 1.2 ad int error;
266 1.2 ad struct proc *p = l->l_proc;
267 1.2 ad struct lwp *t;
268 1.2 ad
269 1.2 ad error = 0;
270 1.2 ad
271 1.2 ad mutex_enter(&p->p_smutex);
272 1.2 ad if ((t = lwp_find(p, SCARG(uap, target))) == NULL) {
273 1.2 ad mutex_exit(&p->p_smutex);
274 1.2 ad return ESRCH;
275 1.2 ad }
276 1.2 ad
277 1.2 ad lwp_lock(t);
278 1.2 ad lwp_continue(t);
279 1.2 ad mutex_exit(&p->p_smutex);
280 1.2 ad
281 1.2 ad return error;
282 1.2 ad }
283 1.2 ad
284 1.2 ad int
285 1.2 ad sys__lwp_wakeup(struct lwp *l, void *v, register_t *retval)
286 1.2 ad {
287 1.2 ad struct sys__lwp_wakeup_args /* {
288 1.2 ad syscallarg(lwpid_t) target;
289 1.2 ad } */ *uap = v;
290 1.2 ad struct lwp *t;
291 1.2 ad struct proc *p;
292 1.2 ad int error;
293 1.2 ad
294 1.2 ad p = l->l_proc;
295 1.2 ad mutex_enter(&p->p_smutex);
296 1.2 ad
297 1.2 ad if ((t = lwp_find(p, SCARG(uap, target))) == NULL) {
298 1.2 ad mutex_exit(&p->p_smutex);
299 1.2 ad return ESRCH;
300 1.2 ad }
301 1.2 ad
302 1.2 ad lwp_lock(t);
303 1.15 ad t->l_flag |= (LW_CANCELLED | LW_UNPARKED);
304 1.2 ad
305 1.2 ad if (t->l_stat != LSSLEEP) {
306 1.16 ad lwp_unlock(t);
307 1.2 ad error = ENODEV;
308 1.16 ad } else if ((t->l_flag & LW_SINTR) == 0) {
309 1.16 ad lwp_unlock(t);
310 1.2 ad error = EBUSY;
311 1.16 ad } else {
312 1.16 ad /* Wake it up. lwp_unsleep() will release the LWP lock. */
313 1.16 ad lwp_unsleep(t);
314 1.16 ad error = 0;
315 1.2 ad }
316 1.2 ad
317 1.2 ad mutex_exit(&p->p_smutex);
318 1.2 ad
319 1.2 ad return error;
320 1.2 ad }
321 1.2 ad
322 1.2 ad int
323 1.2 ad sys__lwp_wait(struct lwp *l, void *v, register_t *retval)
324 1.2 ad {
325 1.2 ad struct sys__lwp_wait_args /* {
326 1.2 ad syscallarg(lwpid_t) wait_for;
327 1.2 ad syscallarg(lwpid_t *) departed;
328 1.2 ad } */ *uap = v;
329 1.2 ad struct proc *p = l->l_proc;
330 1.2 ad int error;
331 1.2 ad lwpid_t dep;
332 1.2 ad
333 1.2 ad mutex_enter(&p->p_smutex);
334 1.2 ad error = lwp_wait1(l, SCARG(uap, wait_for), &dep, 0);
335 1.2 ad mutex_exit(&p->p_smutex);
336 1.2 ad
337 1.2 ad if (error)
338 1.2 ad return error;
339 1.2 ad
340 1.2 ad if (SCARG(uap, departed)) {
341 1.2 ad error = copyout(&dep, SCARG(uap, departed), sizeof(dep));
342 1.2 ad if (error)
343 1.2 ad return error;
344 1.2 ad }
345 1.2 ad
346 1.2 ad return 0;
347 1.2 ad }
348 1.2 ad
349 1.2 ad /* ARGSUSED */
350 1.2 ad int
351 1.2 ad sys__lwp_kill(struct lwp *l, void *v, register_t *retval)
352 1.2 ad {
353 1.2 ad struct sys__lwp_kill_args /* {
354 1.2 ad syscallarg(lwpid_t) target;
355 1.2 ad syscallarg(int) signo;
356 1.2 ad } */ *uap = v;
357 1.2 ad struct proc *p = l->l_proc;
358 1.2 ad struct lwp *t;
359 1.2 ad ksiginfo_t ksi;
360 1.2 ad int signo = SCARG(uap, signo);
361 1.2 ad int error = 0;
362 1.2 ad
363 1.2 ad if ((u_int)signo >= NSIG)
364 1.2 ad return EINVAL;
365 1.2 ad
366 1.2 ad KSI_INIT(&ksi);
367 1.2 ad ksi.ksi_signo = signo;
368 1.2 ad ksi.ksi_code = SI_USER;
369 1.2 ad ksi.ksi_pid = p->p_pid;
370 1.2 ad ksi.ksi_uid = kauth_cred_geteuid(l->l_cred);
371 1.2 ad ksi.ksi_lid = SCARG(uap, target);
372 1.2 ad
373 1.2 ad mutex_enter(&proclist_mutex);
374 1.2 ad mutex_enter(&p->p_smutex);
375 1.2 ad if ((t = lwp_find(p, ksi.ksi_lid)) == NULL)
376 1.2 ad error = ESRCH;
377 1.2 ad else if (signo != 0)
378 1.2 ad kpsignal2(p, &ksi);
379 1.2 ad mutex_exit(&p->p_smutex);
380 1.2 ad mutex_exit(&proclist_mutex);
381 1.2 ad
382 1.2 ad return error;
383 1.2 ad }
384 1.2 ad
385 1.2 ad int
386 1.2 ad sys__lwp_detach(struct lwp *l, void *v, register_t *retval)
387 1.2 ad {
388 1.2 ad struct sys__lwp_detach_args /* {
389 1.2 ad syscallarg(lwpid_t) target;
390 1.2 ad } */ *uap = v;
391 1.2 ad struct proc *p;
392 1.2 ad struct lwp *t;
393 1.2 ad lwpid_t target;
394 1.2 ad int error;
395 1.2 ad
396 1.2 ad target = SCARG(uap, target);
397 1.2 ad p = l->l_proc;
398 1.2 ad
399 1.2 ad mutex_enter(&p->p_smutex);
400 1.2 ad
401 1.2 ad if (l->l_lid == target)
402 1.2 ad t = l;
403 1.2 ad else {
404 1.2 ad /*
405 1.2 ad * We can't use lwp_find() here because the target might
406 1.2 ad * be a zombie.
407 1.2 ad */
408 1.2 ad LIST_FOREACH(t, &p->p_lwps, l_sibling)
409 1.2 ad if (t->l_lid == target)
410 1.2 ad break;
411 1.2 ad }
412 1.2 ad
413 1.2 ad /*
414 1.2 ad * If the LWP is already detached, there's nothing to do.
415 1.2 ad * If it's a zombie, we need to clean up after it. LSZOMB
416 1.2 ad * is visible with the proc mutex held.
417 1.2 ad *
418 1.2 ad * After we have detached or released the LWP, kick any
419 1.2 ad * other LWPs that may be sitting in _lwp_wait(), waiting
420 1.2 ad * for the target LWP to exit.
421 1.2 ad */
422 1.2 ad if (t != NULL && t->l_stat != LSIDL) {
423 1.2 ad if ((t->l_prflag & LPR_DETACHED) == 0) {
424 1.2 ad p->p_ndlwps++;
425 1.2 ad t->l_prflag |= LPR_DETACHED;
426 1.2 ad if (t->l_stat == LSZOMB) {
427 1.17 ad /* Releases proc mutex. */
428 1.17 ad lwp_free(t, false, false);
429 1.2 ad return 0;
430 1.2 ad }
431 1.2 ad error = 0;
432 1.17 ad
433 1.17 ad /*
434 1.17 ad * Have any LWPs sleeping in lwp_wait() recheck
435 1.17 ad * for deadlock.
436 1.17 ad */
437 1.17 ad cv_broadcast(&p->p_lwpcv);
438 1.2 ad } else
439 1.2 ad error = EINVAL;
440 1.2 ad } else
441 1.2 ad error = ESRCH;
442 1.2 ad
443 1.2 ad mutex_exit(&p->p_smutex);
444 1.2 ad
445 1.2 ad return error;
446 1.2 ad }
447 1.2 ad
448 1.2 ad static inline wchan_t
449 1.2 ad lwp_park_wchan(struct proc *p, const void *hint)
450 1.2 ad {
451 1.22 ad
452 1.2 ad return (wchan_t)((uintptr_t)p ^ (uintptr_t)hint);
453 1.2 ad }
454 1.2 ad
455 1.2 ad int
456 1.24 ad lwp_unpark(lwpid_t target, const void *hint)
457 1.2 ad {
458 1.24 ad sleepq_t *sq;
459 1.24 ad wchan_t wchan;
460 1.24 ad int swapin;
461 1.24 ad proc_t *p;
462 1.24 ad lwp_t *t;
463 1.24 ad
464 1.24 ad /*
465 1.24 ad * Easy case: search for the LWP on the sleep queue. If
466 1.24 ad * it's parked, remove it from the queue and set running.
467 1.24 ad */
468 1.24 ad p = curproc;
469 1.24 ad wchan = lwp_park_wchan(p, hint);
470 1.24 ad sq = sleeptab_lookup(&lwp_park_tab, wchan);
471 1.24 ad
472 1.24 ad TAILQ_FOREACH(t, &sq->sq_queue, l_sleepchain)
473 1.24 ad if (t->l_proc == p && t->l_lid == target)
474 1.24 ad break;
475 1.24 ad
476 1.24 ad if (__predict_true(t != NULL)) {
477 1.24 ad swapin = sleepq_remove(sq, t);
478 1.24 ad sleepq_unlock(sq);
479 1.24 ad if (swapin)
480 1.24 ad uvm_kick_scheduler();
481 1.24 ad return 0;
482 1.24 ad }
483 1.24 ad
484 1.24 ad /*
485 1.24 ad * The LWP hasn't parked yet. Take the hit and mark the
486 1.24 ad * operation as pending.
487 1.24 ad */
488 1.24 ad sleepq_unlock(sq);
489 1.20 dsl
490 1.24 ad mutex_enter(&p->p_smutex);
491 1.24 ad if ((t = lwp_find(p, target)) == NULL) {
492 1.24 ad mutex_exit(&p->p_smutex);
493 1.24 ad return ESRCH;
494 1.24 ad }
495 1.20 dsl
496 1.24 ad /*
497 1.24 ad * It may not have parked yet, we may have raced, or it
498 1.24 ad * is parked on a different user sync object.
499 1.24 ad */
500 1.24 ad lwp_lock(t);
501 1.24 ad if (t->l_syncobj == &lwp_park_sobj) {
502 1.24 ad /* Releases the LWP lock. */
503 1.24 ad lwp_unsleep(t);
504 1.24 ad } else {
505 1.24 ad /*
506 1.24 ad * Set the operation pending. The next call to _lwp_park
507 1.24 ad * will return early.
508 1.24 ad */
509 1.24 ad t->l_flag |= LW_UNPARKED;
510 1.24 ad lwp_unlock(t);
511 1.24 ad }
512 1.20 dsl
513 1.24 ad mutex_exit(&p->p_smutex);
514 1.24 ad return 0;
515 1.20 dsl }
516 1.20 dsl
517 1.20 dsl int
518 1.24 ad lwp_park(struct timespec *ts, const void *hint)
519 1.20 dsl {
520 1.20 dsl struct timespec tsx;
521 1.2 ad sleepq_t *sq;
522 1.2 ad wchan_t wchan;
523 1.2 ad int timo, error;
524 1.24 ad lwp_t *l;
525 1.2 ad
526 1.2 ad /* Fix up the given timeout value. */
527 1.20 dsl if (ts != NULL) {
528 1.2 ad getnanotime(&tsx);
529 1.24 ad timespecsub(ts, &tsx, &tsx);
530 1.24 ad if (tsx.tv_sec < 0 || (tsx.tv_sec == 0 && tsx.tv_nsec <= 0))
531 1.2 ad return ETIMEDOUT;
532 1.24 ad if ((error = itimespecfix(&tsx)) != 0)
533 1.2 ad return error;
534 1.24 ad timo = tstohz(&tsx);
535 1.24 ad KASSERT(timo != 0);
536 1.2 ad } else
537 1.2 ad timo = 0;
538 1.2 ad
539 1.2 ad /* Find and lock the sleep queue. */
540 1.24 ad l = curlwp;
541 1.20 dsl wchan = lwp_park_wchan(l->l_proc, hint);
542 1.2 ad sq = sleeptab_lookup(&lwp_park_tab, wchan);
543 1.2 ad
544 1.2 ad /*
545 1.2 ad * Before going the full route and blocking, check to see if an
546 1.2 ad * unpark op is pending.
547 1.2 ad */
548 1.19 yamt lwp_lock(l);
549 1.8 ad if ((l->l_flag & (LW_CANCELLED | LW_UNPARKED)) != 0) {
550 1.8 ad l->l_flag &= ~(LW_CANCELLED | LW_UNPARKED);
551 1.19 yamt lwp_unlock(l);
552 1.2 ad sleepq_unlock(sq);
553 1.2 ad return EALREADY;
554 1.2 ad }
555 1.8 ad lwp_unlock_to(l, sq->sq_mutex);
556 1.24 ad l->l_biglocks = 0;
557 1.19 yamt sleepq_enqueue(sq, sched_kpri(l), wchan, "parked", &lwp_park_sobj);
558 1.19 yamt error = sleepq_block(timo, true);
559 1.13 yamt switch (error) {
560 1.14 yamt case EWOULDBLOCK:
561 1.14 yamt error = ETIMEDOUT;
562 1.14 yamt break;
563 1.14 yamt case ERESTART:
564 1.14 yamt error = EINTR;
565 1.14 yamt break;
566 1.14 yamt default:
567 1.14 yamt /* nothing */
568 1.14 yamt break;
569 1.13 yamt }
570 1.13 yamt return error;
571 1.2 ad }
572 1.2 ad
573 1.24 ad /*
574 1.24 ad * 'park' an LWP waiting on a user-level synchronisation object. The LWP
575 1.24 ad * will remain parked until another LWP in the same process calls in and
576 1.24 ad * requests that it be unparked.
577 1.24 ad */
578 1.2 ad int
579 1.24 ad sys__lwp_park(struct lwp *l, void *v, register_t *retval)
580 1.2 ad {
581 1.24 ad struct sys__lwp_park_args /* {
582 1.24 ad syscallarg(const struct timespec *) ts;
583 1.24 ad syscallarg(lwpid_t) unpark;
584 1.24 ad syscallarg(const void *) hint;
585 1.24 ad syscallarg(const void *) unparkhint;
586 1.2 ad } */ *uap = v;
587 1.24 ad struct timespec ts, *tsp;
588 1.24 ad int error;
589 1.2 ad
590 1.24 ad if (SCARG(uap, ts) == NULL)
591 1.24 ad tsp = NULL;
592 1.24 ad else {
593 1.24 ad error = copyin(SCARG(uap, ts), &ts, sizeof(ts));
594 1.24 ad if (error != 0)
595 1.24 ad return error;
596 1.24 ad tsp = &ts;
597 1.24 ad }
598 1.2 ad
599 1.24 ad if (SCARG(uap, unpark) != 0) {
600 1.24 ad error = lwp_unpark(SCARG(uap, unpark), SCARG(uap, unparkhint));
601 1.24 ad if (error != 0)
602 1.24 ad return error;
603 1.15 ad }
604 1.15 ad
605 1.24 ad return lwp_park(tsp, SCARG(uap, hint));
606 1.24 ad }
607 1.2 ad
608 1.24 ad int
609 1.24 ad sys__lwp_unpark(struct lwp *l, void *v, register_t *retval)
610 1.24 ad {
611 1.24 ad struct sys__lwp_unpark_args /* {
612 1.24 ad syscallarg(lwpid_t) target;
613 1.24 ad syscallarg(const void *) hint;
614 1.24 ad } */ *uap = v;
615 1.2 ad
616 1.24 ad return lwp_unpark(SCARG(uap, target), SCARG(uap, hint));
617 1.2 ad }
618 1.2 ad
619 1.2 ad int
620 1.2 ad sys__lwp_unpark_all(struct lwp *l, void *v, register_t *retval)
621 1.2 ad {
622 1.2 ad struct sys__lwp_unpark_all_args /* {
623 1.2 ad syscallarg(const lwpid_t *) targets;
624 1.2 ad syscallarg(size_t) ntargets;
625 1.2 ad syscallarg(const void *) hint;
626 1.2 ad } */ *uap = v;
627 1.2 ad struct proc *p;
628 1.2 ad struct lwp *t;
629 1.2 ad sleepq_t *sq;
630 1.2 ad wchan_t wchan;
631 1.2 ad lwpid_t targets[32], *tp, *tpp, *tmax, target;
632 1.2 ad int swapin, error;
633 1.15 ad u_int ntargets;
634 1.2 ad size_t sz;
635 1.2 ad
636 1.2 ad p = l->l_proc;
637 1.2 ad ntargets = SCARG(uap, ntargets);
638 1.2 ad
639 1.2 ad if (SCARG(uap, targets) == NULL) {
640 1.2 ad /*
641 1.2 ad * Let the caller know how much we are willing to do, and
642 1.2 ad * let it unpark the LWPs in blocks.
643 1.2 ad */
644 1.2 ad *retval = LWP_UNPARK_MAX;
645 1.2 ad return 0;
646 1.2 ad }
647 1.2 ad if (ntargets > LWP_UNPARK_MAX || ntargets == 0)
648 1.2 ad return EINVAL;
649 1.2 ad
650 1.2 ad /*
651 1.2 ad * Copy in the target array. If it's a small number of LWPs, then
652 1.2 ad * place the numbers on the stack.
653 1.2 ad */
654 1.2 ad sz = sizeof(target) * ntargets;
655 1.2 ad if (sz <= sizeof(targets))
656 1.2 ad tp = targets;
657 1.2 ad else {
658 1.2 ad KERNEL_LOCK(1, l); /* XXXSMP */
659 1.2 ad tp = kmem_alloc(sz, KM_SLEEP);
660 1.2 ad KERNEL_UNLOCK_ONE(l); /* XXXSMP */
661 1.2 ad if (tp == NULL)
662 1.2 ad return ENOMEM;
663 1.2 ad }
664 1.2 ad error = copyin(SCARG(uap, targets), tp, sz);
665 1.2 ad if (error != 0) {
666 1.2 ad if (tp != targets) {
667 1.2 ad KERNEL_LOCK(1, l); /* XXXSMP */
668 1.2 ad kmem_free(tp, sz);
669 1.2 ad KERNEL_UNLOCK_ONE(l); /* XXXSMP */
670 1.2 ad }
671 1.2 ad return error;
672 1.2 ad }
673 1.2 ad
674 1.2 ad swapin = 0;
675 1.2 ad wchan = lwp_park_wchan(p, SCARG(uap, hint));
676 1.2 ad sq = sleeptab_lookup(&lwp_park_tab, wchan);
677 1.2 ad
678 1.2 ad for (tmax = tp + ntargets, tpp = tp; tpp < tmax; tpp++) {
679 1.2 ad target = *tpp;
680 1.2 ad
681 1.2 ad /*
682 1.2 ad * Easy case: search for the LWP on the sleep queue. If
683 1.2 ad * it's parked, remove it from the queue and set running.
684 1.2 ad */
685 1.2 ad TAILQ_FOREACH(t, &sq->sq_queue, l_sleepchain)
686 1.2 ad if (t->l_proc == p && t->l_lid == target)
687 1.2 ad break;
688 1.2 ad
689 1.2 ad if (t != NULL) {
690 1.2 ad swapin |= sleepq_remove(sq, t);
691 1.2 ad continue;
692 1.2 ad }
693 1.2 ad
694 1.2 ad /*
695 1.2 ad * The LWP hasn't parked yet. Take the hit and
696 1.2 ad * mark the operation as pending.
697 1.2 ad */
698 1.2 ad sleepq_unlock(sq);
699 1.2 ad mutex_enter(&p->p_smutex);
700 1.2 ad if ((t = lwp_find(p, target)) == NULL) {
701 1.2 ad mutex_exit(&p->p_smutex);
702 1.2 ad sleepq_lock(sq);
703 1.2 ad continue;
704 1.2 ad }
705 1.2 ad lwp_lock(t);
706 1.2 ad
707 1.15 ad /*
708 1.15 ad * It may not have parked yet, we may have raced, or
709 1.15 ad * it is parked on a different user sync object.
710 1.15 ad */
711 1.15 ad if (t->l_syncobj == &lwp_park_sobj) {
712 1.15 ad /* Releases the LWP lock. */
713 1.16 ad lwp_unsleep(t);
714 1.2 ad } else {
715 1.2 ad /*
716 1.15 ad * Set the operation pending. The next call to
717 1.15 ad * _lwp_park will return early.
718 1.2 ad */
719 1.8 ad t->l_flag |= LW_UNPARKED;
720 1.2 ad lwp_unlock(t);
721 1.2 ad }
722 1.15 ad
723 1.15 ad mutex_exit(&p->p_smutex);
724 1.15 ad sleepq_lock(sq);
725 1.2 ad }
726 1.2 ad
727 1.2 ad sleepq_unlock(sq);
728 1.2 ad if (tp != targets) {
729 1.2 ad KERNEL_LOCK(1, l); /* XXXSMP */
730 1.2 ad kmem_free(tp, sz);
731 1.2 ad KERNEL_UNLOCK_ONE(l); /* XXXSMP */
732 1.2 ad }
733 1.2 ad if (swapin)
734 1.3 ad uvm_kick_scheduler();
735 1.15 ad
736 1.2 ad return 0;
737 1.2 ad }
738