sys_lwp.c revision 1.71 1 1.71 ad /* $NetBSD: sys_lwp.c,v 1.71 2019/11/23 19:42:52 ad Exp $ */
2 1.2 ad
3 1.2 ad /*-
4 1.71 ad * Copyright (c) 2001, 2006, 2007, 2008, 2019 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 *
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.2 ad * Lightweight process (LWP) system calls. See kern_lwp.c for a description
34 1.2 ad * of LWPs.
35 1.2 ad */
36 1.2 ad
37 1.2 ad #include <sys/cdefs.h>
38 1.71 ad __KERNEL_RCSID(0, "$NetBSD: sys_lwp.c,v 1.71 2019/11/23 19:42:52 ad Exp $");
39 1.2 ad
40 1.2 ad #include <sys/param.h>
41 1.2 ad #include <sys/systm.h>
42 1.2 ad #include <sys/pool.h>
43 1.2 ad #include <sys/proc.h>
44 1.2 ad #include <sys/types.h>
45 1.2 ad #include <sys/syscallargs.h>
46 1.2 ad #include <sys/kauth.h>
47 1.2 ad #include <sys/kmem.h>
48 1.70 kamil #include <sys/ptrace.h>
49 1.2 ad #include <sys/sleepq.h>
50 1.30 ad #include <sys/lwpctl.h>
51 1.45 ad #include <sys/cpu.h>
52 1.2 ad
53 1.2 ad #include <uvm/uvm_extern.h>
54 1.2 ad
55 1.2 ad #define LWP_UNPARK_MAX 1024
56 1.2 ad
57 1.69 maxv static const stack_t lwp_ss_init = SS_INIT;
58 1.69 maxv
59 1.47 rmind static syncobj_t lwp_park_sobj = {
60 1.63 ozaki .sobj_flag = SOBJ_SLEEPQ_LIFO,
61 1.63 ozaki .sobj_unsleep = sleepq_unsleep,
62 1.63 ozaki .sobj_changepri = sleepq_changepri,
63 1.63 ozaki .sobj_lendpri = sleepq_lendpri,
64 1.63 ozaki .sobj_owner = syncobj_noowner,
65 1.2 ad };
66 1.2 ad
67 1.47 rmind static sleeptab_t lwp_park_tab;
68 1.2 ad
69 1.2 ad void
70 1.2 ad lwp_sys_init(void)
71 1.2 ad {
72 1.2 ad sleeptab_init(&lwp_park_tab);
73 1.2 ad }
74 1.2 ad
75 1.64 kamil static void
76 1.64 kamil mi_startlwp(void *arg)
77 1.64 kamil {
78 1.64 kamil struct lwp *l = curlwp;
79 1.64 kamil struct proc *p = l->l_proc;
80 1.64 kamil
81 1.65 kamil (p->p_emul->e_startlwp)(arg);
82 1.65 kamil
83 1.64 kamil /* If the process is traced, report lwp creation to a debugger */
84 1.66 kamil if ((p->p_slflag & (PSL_TRACED|PSL_TRACELWP_CREATE)) ==
85 1.64 kamil (PSL_TRACED|PSL_TRACELWP_CREATE)) {
86 1.64 kamil /* Paranoid check */
87 1.64 kamil mutex_enter(proc_lock);
88 1.66 kamil if ((p->p_slflag & (PSL_TRACED|PSL_TRACELWP_CREATE)) !=
89 1.66 kamil (PSL_TRACED|PSL_TRACELWP_CREATE)) {
90 1.64 kamil mutex_exit(proc_lock);
91 1.65 kamil return;
92 1.64 kamil }
93 1.64 kamil
94 1.64 kamil mutex_enter(p->p_lock);
95 1.70 kamil eventswitch(TRAP_LWP, PTRACE_LWP_CREATE, l->l_lid);
96 1.64 kamil }
97 1.64 kamil }
98 1.64 kamil
99 1.2 ad int
100 1.59 christos do_lwp_create(lwp_t *l, void *arg, u_long flags, lwpid_t *new_lwp,
101 1.59 christos const sigset_t *sigmask, const stack_t *sigstk)
102 1.2 ad {
103 1.2 ad struct proc *p = l->l_proc;
104 1.2 ad struct lwp *l2;
105 1.2 ad vaddr_t uaddr;
106 1.54 martin int error;
107 1.2 ad
108 1.2 ad /* XXX check against resource limits */
109 1.2 ad
110 1.46 rmind uaddr = uvm_uarea_alloc();
111 1.54 martin if (__predict_false(uaddr == 0))
112 1.2 ad return ENOMEM;
113 1.2 ad
114 1.59 christos error = lwp_create(l, p, uaddr, flags & LWP_DETACHED, NULL, 0,
115 1.69 maxv mi_startlwp, arg, &l2, l->l_class, sigmask, &lwp_ss_init);
116 1.46 rmind if (__predict_false(error)) {
117 1.46 rmind uvm_uarea_free(uaddr);
118 1.18 rmind return error;
119 1.18 rmind }
120 1.2 ad
121 1.54 martin *new_lwp = l2->l_lid;
122 1.71 ad lwp_start(l2, flags);
123 1.2 ad return 0;
124 1.2 ad }
125 1.2 ad
126 1.2 ad int
127 1.54 martin sys__lwp_create(struct lwp *l, const struct sys__lwp_create_args *uap,
128 1.54 martin register_t *retval)
129 1.54 martin {
130 1.54 martin /* {
131 1.54 martin syscallarg(const ucontext_t *) ucp;
132 1.54 martin syscallarg(u_long) flags;
133 1.54 martin syscallarg(lwpid_t *) new_lwp;
134 1.54 martin } */
135 1.54 martin struct proc *p = l->l_proc;
136 1.57 maxv ucontext_t *newuc;
137 1.54 martin lwpid_t lid;
138 1.54 martin int error;
139 1.54 martin
140 1.54 martin newuc = kmem_alloc(sizeof(ucontext_t), KM_SLEEP);
141 1.54 martin error = copyin(SCARG(uap, ucp), newuc, p->p_emul->e_ucsize);
142 1.54 martin if (error)
143 1.54 martin goto fail;
144 1.54 martin
145 1.54 martin /* validate the ucontext */
146 1.54 martin if ((newuc->uc_flags & _UC_CPU) == 0) {
147 1.54 martin error = EINVAL;
148 1.54 martin goto fail;
149 1.54 martin }
150 1.54 martin error = cpu_mcontext_validate(l, &newuc->uc_mcontext);
151 1.54 martin if (error)
152 1.54 martin goto fail;
153 1.54 martin
154 1.59 christos const sigset_t *sigmask = newuc->uc_flags & _UC_SIGMASK ?
155 1.59 christos &newuc->uc_sigmask : &l->l_sigmask;
156 1.59 christos error = do_lwp_create(l, newuc, SCARG(uap, flags), &lid, sigmask,
157 1.59 christos &SS_INIT);
158 1.54 martin if (error)
159 1.54 martin goto fail;
160 1.54 martin
161 1.54 martin /*
162 1.54 martin * do not free ucontext in case of an error here,
163 1.54 martin * the lwp will actually run and access it
164 1.54 martin */
165 1.54 martin return copyout(&lid, SCARG(uap, new_lwp), sizeof(lid));
166 1.54 martin
167 1.54 martin fail:
168 1.54 martin kmem_free(newuc, sizeof(ucontext_t));
169 1.54 martin return error;
170 1.54 martin }
171 1.54 martin
172 1.54 martin int
173 1.32 dsl sys__lwp_exit(struct lwp *l, const void *v, register_t *retval)
174 1.2 ad {
175 1.2 ad
176 1.2 ad lwp_exit(l);
177 1.2 ad return 0;
178 1.2 ad }
179 1.2 ad
180 1.2 ad int
181 1.32 dsl sys__lwp_self(struct lwp *l, const void *v, register_t *retval)
182 1.2 ad {
183 1.2 ad
184 1.2 ad *retval = l->l_lid;
185 1.2 ad return 0;
186 1.2 ad }
187 1.2 ad
188 1.2 ad int
189 1.32 dsl sys__lwp_getprivate(struct lwp *l, const void *v, register_t *retval)
190 1.2 ad {
191 1.2 ad
192 1.2 ad *retval = (uintptr_t)l->l_private;
193 1.2 ad return 0;
194 1.2 ad }
195 1.2 ad
196 1.2 ad int
197 1.47 rmind sys__lwp_setprivate(struct lwp *l, const struct sys__lwp_setprivate_args *uap,
198 1.47 rmind register_t *retval)
199 1.2 ad {
200 1.32 dsl /* {
201 1.2 ad syscallarg(void *) ptr;
202 1.32 dsl } */
203 1.2 ad
204 1.52 chs return lwp_setprivate(l, SCARG(uap, ptr));
205 1.2 ad }
206 1.2 ad
207 1.2 ad int
208 1.47 rmind sys__lwp_suspend(struct lwp *l, const struct sys__lwp_suspend_args *uap,
209 1.47 rmind register_t *retval)
210 1.2 ad {
211 1.32 dsl /* {
212 1.2 ad syscallarg(lwpid_t) target;
213 1.32 dsl } */
214 1.2 ad struct proc *p = l->l_proc;
215 1.2 ad struct lwp *t;
216 1.2 ad int error;
217 1.2 ad
218 1.39 ad mutex_enter(p->p_lock);
219 1.2 ad if ((t = lwp_find(p, SCARG(uap, target))) == NULL) {
220 1.39 ad mutex_exit(p->p_lock);
221 1.2 ad return ESRCH;
222 1.2 ad }
223 1.2 ad
224 1.2 ad /*
225 1.2 ad * Check for deadlock, which is only possible when we're suspending
226 1.2 ad * ourself. XXX There is a short race here, as p_nrlwps is only
227 1.2 ad * incremented when an LWP suspends itself on the kernel/user
228 1.2 ad * boundary. It's still possible to kill -9 the process so we
229 1.2 ad * don't bother checking further.
230 1.2 ad */
231 1.2 ad lwp_lock(t);
232 1.2 ad if ((t == l && p->p_nrlwps == 1) ||
233 1.4 pavel (l->l_flag & (LW_WCORE | LW_WEXIT)) != 0) {
234 1.2 ad lwp_unlock(t);
235 1.39 ad mutex_exit(p->p_lock);
236 1.2 ad return EDEADLK;
237 1.2 ad }
238 1.2 ad
239 1.2 ad /*
240 1.2 ad * Suspend the LWP. XXX If it's on a different CPU, we should wait
241 1.2 ad * for it to be preempted, where it will put itself to sleep.
242 1.2 ad *
243 1.2 ad * Suspension of the current LWP will happen on return to userspace.
244 1.2 ad */
245 1.2 ad error = lwp_suspend(l, t);
246 1.23 rmind if (error) {
247 1.39 ad mutex_exit(p->p_lock);
248 1.23 rmind return error;
249 1.23 rmind }
250 1.23 rmind
251 1.23 rmind /*
252 1.23 rmind * Wait for:
253 1.23 rmind * o process exiting
254 1.23 rmind * o target LWP suspended
255 1.23 rmind * o target LWP not suspended and L_WSUSPEND clear
256 1.23 rmind * o target LWP exited
257 1.23 rmind */
258 1.23 rmind for (;;) {
259 1.39 ad error = cv_wait_sig(&p->p_lwpcv, p->p_lock);
260 1.23 rmind if (error) {
261 1.23 rmind error = ERESTART;
262 1.23 rmind break;
263 1.23 rmind }
264 1.25 rmind if (lwp_find(p, SCARG(uap, target)) == NULL) {
265 1.25 rmind error = ESRCH;
266 1.25 rmind break;
267 1.25 rmind }
268 1.23 rmind if ((l->l_flag | t->l_flag) & (LW_WCORE | LW_WEXIT)) {
269 1.23 rmind error = ERESTART;
270 1.23 rmind break;
271 1.23 rmind }
272 1.23 rmind if (t->l_stat == LSSUSPENDED ||
273 1.23 rmind (t->l_flag & LW_WSUSPEND) == 0)
274 1.23 rmind break;
275 1.23 rmind }
276 1.39 ad mutex_exit(p->p_lock);
277 1.2 ad
278 1.2 ad return error;
279 1.2 ad }
280 1.2 ad
281 1.2 ad int
282 1.47 rmind sys__lwp_continue(struct lwp *l, const struct sys__lwp_continue_args *uap,
283 1.47 rmind register_t *retval)
284 1.2 ad {
285 1.32 dsl /* {
286 1.2 ad syscallarg(lwpid_t) target;
287 1.32 dsl } */
288 1.2 ad int error;
289 1.2 ad struct proc *p = l->l_proc;
290 1.2 ad struct lwp *t;
291 1.2 ad
292 1.2 ad error = 0;
293 1.2 ad
294 1.39 ad mutex_enter(p->p_lock);
295 1.2 ad if ((t = lwp_find(p, SCARG(uap, target))) == NULL) {
296 1.39 ad mutex_exit(p->p_lock);
297 1.2 ad return ESRCH;
298 1.2 ad }
299 1.2 ad
300 1.2 ad lwp_lock(t);
301 1.2 ad lwp_continue(t);
302 1.39 ad mutex_exit(p->p_lock);
303 1.2 ad
304 1.2 ad return error;
305 1.2 ad }
306 1.2 ad
307 1.2 ad int
308 1.47 rmind sys__lwp_wakeup(struct lwp *l, const struct sys__lwp_wakeup_args *uap,
309 1.47 rmind register_t *retval)
310 1.2 ad {
311 1.32 dsl /* {
312 1.2 ad syscallarg(lwpid_t) target;
313 1.32 dsl } */
314 1.2 ad struct lwp *t;
315 1.2 ad struct proc *p;
316 1.2 ad int error;
317 1.2 ad
318 1.2 ad p = l->l_proc;
319 1.39 ad mutex_enter(p->p_lock);
320 1.2 ad
321 1.2 ad if ((t = lwp_find(p, SCARG(uap, target))) == NULL) {
322 1.39 ad mutex_exit(p->p_lock);
323 1.2 ad return ESRCH;
324 1.2 ad }
325 1.2 ad
326 1.2 ad lwp_lock(t);
327 1.15 ad t->l_flag |= (LW_CANCELLED | LW_UNPARKED);
328 1.2 ad
329 1.2 ad if (t->l_stat != LSSLEEP) {
330 1.16 ad lwp_unlock(t);
331 1.2 ad error = ENODEV;
332 1.16 ad } else if ((t->l_flag & LW_SINTR) == 0) {
333 1.16 ad lwp_unlock(t);
334 1.2 ad error = EBUSY;
335 1.16 ad } else {
336 1.16 ad /* Wake it up. lwp_unsleep() will release the LWP lock. */
337 1.46 rmind lwp_unsleep(t, true);
338 1.16 ad error = 0;
339 1.2 ad }
340 1.2 ad
341 1.39 ad mutex_exit(p->p_lock);
342 1.2 ad
343 1.2 ad return error;
344 1.2 ad }
345 1.2 ad
346 1.2 ad int
347 1.47 rmind sys__lwp_wait(struct lwp *l, const struct sys__lwp_wait_args *uap,
348 1.47 rmind register_t *retval)
349 1.2 ad {
350 1.32 dsl /* {
351 1.2 ad syscallarg(lwpid_t) wait_for;
352 1.2 ad syscallarg(lwpid_t *) departed;
353 1.32 dsl } */
354 1.2 ad struct proc *p = l->l_proc;
355 1.2 ad int error;
356 1.2 ad lwpid_t dep;
357 1.2 ad
358 1.39 ad mutex_enter(p->p_lock);
359 1.55 rmind error = lwp_wait(l, SCARG(uap, wait_for), &dep, false);
360 1.39 ad mutex_exit(p->p_lock);
361 1.2 ad
362 1.55 rmind if (!error && SCARG(uap, departed)) {
363 1.2 ad error = copyout(&dep, SCARG(uap, departed), sizeof(dep));
364 1.2 ad }
365 1.2 ad
366 1.55 rmind return error;
367 1.2 ad }
368 1.2 ad
369 1.2 ad int
370 1.47 rmind sys__lwp_kill(struct lwp *l, const struct sys__lwp_kill_args *uap,
371 1.47 rmind register_t *retval)
372 1.2 ad {
373 1.32 dsl /* {
374 1.2 ad syscallarg(lwpid_t) target;
375 1.2 ad syscallarg(int) signo;
376 1.32 dsl } */
377 1.2 ad struct proc *p = l->l_proc;
378 1.2 ad struct lwp *t;
379 1.2 ad ksiginfo_t ksi;
380 1.2 ad int signo = SCARG(uap, signo);
381 1.2 ad int error = 0;
382 1.2 ad
383 1.2 ad if ((u_int)signo >= NSIG)
384 1.2 ad return EINVAL;
385 1.2 ad
386 1.2 ad KSI_INIT(&ksi);
387 1.2 ad ksi.ksi_signo = signo;
388 1.43 ad ksi.ksi_code = SI_LWP;
389 1.2 ad ksi.ksi_pid = p->p_pid;
390 1.2 ad ksi.ksi_uid = kauth_cred_geteuid(l->l_cred);
391 1.2 ad ksi.ksi_lid = SCARG(uap, target);
392 1.2 ad
393 1.38 ad mutex_enter(proc_lock);
394 1.39 ad mutex_enter(p->p_lock);
395 1.2 ad if ((t = lwp_find(p, ksi.ksi_lid)) == NULL)
396 1.2 ad error = ESRCH;
397 1.2 ad else if (signo != 0)
398 1.2 ad kpsignal2(p, &ksi);
399 1.39 ad mutex_exit(p->p_lock);
400 1.38 ad mutex_exit(proc_lock);
401 1.2 ad
402 1.2 ad return error;
403 1.2 ad }
404 1.2 ad
405 1.2 ad int
406 1.47 rmind sys__lwp_detach(struct lwp *l, const struct sys__lwp_detach_args *uap,
407 1.47 rmind register_t *retval)
408 1.2 ad {
409 1.32 dsl /* {
410 1.2 ad syscallarg(lwpid_t) target;
411 1.32 dsl } */
412 1.2 ad struct proc *p;
413 1.2 ad struct lwp *t;
414 1.2 ad lwpid_t target;
415 1.2 ad int error;
416 1.2 ad
417 1.2 ad target = SCARG(uap, target);
418 1.2 ad p = l->l_proc;
419 1.2 ad
420 1.39 ad mutex_enter(p->p_lock);
421 1.2 ad
422 1.2 ad if (l->l_lid == target)
423 1.2 ad t = l;
424 1.2 ad else {
425 1.2 ad /*
426 1.2 ad * We can't use lwp_find() here because the target might
427 1.2 ad * be a zombie.
428 1.2 ad */
429 1.2 ad LIST_FOREACH(t, &p->p_lwps, l_sibling)
430 1.2 ad if (t->l_lid == target)
431 1.2 ad break;
432 1.2 ad }
433 1.2 ad
434 1.2 ad /*
435 1.2 ad * If the LWP is already detached, there's nothing to do.
436 1.2 ad * If it's a zombie, we need to clean up after it. LSZOMB
437 1.2 ad * is visible with the proc mutex held.
438 1.2 ad *
439 1.2 ad * After we have detached or released the LWP, kick any
440 1.2 ad * other LWPs that may be sitting in _lwp_wait(), waiting
441 1.2 ad * for the target LWP to exit.
442 1.2 ad */
443 1.2 ad if (t != NULL && t->l_stat != LSIDL) {
444 1.2 ad if ((t->l_prflag & LPR_DETACHED) == 0) {
445 1.2 ad p->p_ndlwps++;
446 1.2 ad t->l_prflag |= LPR_DETACHED;
447 1.2 ad if (t->l_stat == LSZOMB) {
448 1.17 ad /* Releases proc mutex. */
449 1.17 ad lwp_free(t, false, false);
450 1.2 ad return 0;
451 1.2 ad }
452 1.2 ad error = 0;
453 1.17 ad
454 1.17 ad /*
455 1.17 ad * Have any LWPs sleeping in lwp_wait() recheck
456 1.17 ad * for deadlock.
457 1.17 ad */
458 1.17 ad cv_broadcast(&p->p_lwpcv);
459 1.2 ad } else
460 1.2 ad error = EINVAL;
461 1.2 ad } else
462 1.2 ad error = ESRCH;
463 1.2 ad
464 1.39 ad mutex_exit(p->p_lock);
465 1.2 ad
466 1.2 ad return error;
467 1.2 ad }
468 1.2 ad
469 1.2 ad static inline wchan_t
470 1.2 ad lwp_park_wchan(struct proc *p, const void *hint)
471 1.2 ad {
472 1.22 ad
473 1.2 ad return (wchan_t)((uintptr_t)p ^ (uintptr_t)hint);
474 1.2 ad }
475 1.2 ad
476 1.2 ad int
477 1.24 ad lwp_unpark(lwpid_t target, const void *hint)
478 1.2 ad {
479 1.24 ad sleepq_t *sq;
480 1.24 ad wchan_t wchan;
481 1.41 ad kmutex_t *mp;
482 1.24 ad proc_t *p;
483 1.24 ad lwp_t *t;
484 1.24 ad
485 1.24 ad /*
486 1.24 ad * Easy case: search for the LWP on the sleep queue. If
487 1.24 ad * it's parked, remove it from the queue and set running.
488 1.24 ad */
489 1.24 ad p = curproc;
490 1.24 ad wchan = lwp_park_wchan(p, hint);
491 1.41 ad sq = sleeptab_lookup(&lwp_park_tab, wchan, &mp);
492 1.24 ad
493 1.41 ad TAILQ_FOREACH(t, sq, l_sleepchain)
494 1.24 ad if (t->l_proc == p && t->l_lid == target)
495 1.24 ad break;
496 1.24 ad
497 1.24 ad if (__predict_true(t != NULL)) {
498 1.46 rmind sleepq_remove(sq, t);
499 1.41 ad mutex_spin_exit(mp);
500 1.24 ad return 0;
501 1.24 ad }
502 1.24 ad
503 1.24 ad /*
504 1.24 ad * The LWP hasn't parked yet. Take the hit and mark the
505 1.24 ad * operation as pending.
506 1.24 ad */
507 1.41 ad mutex_spin_exit(mp);
508 1.20 dsl
509 1.39 ad mutex_enter(p->p_lock);
510 1.24 ad if ((t = lwp_find(p, target)) == NULL) {
511 1.39 ad mutex_exit(p->p_lock);
512 1.24 ad return ESRCH;
513 1.24 ad }
514 1.20 dsl
515 1.24 ad /*
516 1.24 ad * It may not have parked yet, we may have raced, or it
517 1.24 ad * is parked on a different user sync object.
518 1.24 ad */
519 1.24 ad lwp_lock(t);
520 1.24 ad if (t->l_syncobj == &lwp_park_sobj) {
521 1.24 ad /* Releases the LWP lock. */
522 1.46 rmind lwp_unsleep(t, true);
523 1.24 ad } else {
524 1.24 ad /*
525 1.24 ad * Set the operation pending. The next call to _lwp_park
526 1.24 ad * will return early.
527 1.24 ad */
528 1.24 ad t->l_flag |= LW_UNPARKED;
529 1.24 ad lwp_unlock(t);
530 1.24 ad }
531 1.20 dsl
532 1.39 ad mutex_exit(p->p_lock);
533 1.24 ad return 0;
534 1.20 dsl }
535 1.20 dsl
536 1.20 dsl int
537 1.56 christos lwp_park(clockid_t clock_id, int flags, struct timespec *ts, const void *hint)
538 1.20 dsl {
539 1.2 ad sleepq_t *sq;
540 1.41 ad kmutex_t *mp;
541 1.2 ad wchan_t wchan;
542 1.2 ad int timo, error;
543 1.62 christos struct timespec start;
544 1.24 ad lwp_t *l;
545 1.62 christos bool timeremain = !(flags & TIMER_ABSTIME) && ts;
546 1.2 ad
547 1.20 dsl if (ts != NULL) {
548 1.62 christos if ((error = ts2timo(clock_id, flags, ts, &timo,
549 1.62 christos timeremain ? &start : NULL)) != 0)
550 1.2 ad return error;
551 1.24 ad KASSERT(timo != 0);
552 1.48 rmind } else {
553 1.2 ad timo = 0;
554 1.48 rmind }
555 1.2 ad
556 1.2 ad /* Find and lock the sleep queue. */
557 1.24 ad l = curlwp;
558 1.20 dsl wchan = lwp_park_wchan(l->l_proc, hint);
559 1.41 ad sq = sleeptab_lookup(&lwp_park_tab, wchan, &mp);
560 1.2 ad
561 1.2 ad /*
562 1.2 ad * Before going the full route and blocking, check to see if an
563 1.2 ad * unpark op is pending.
564 1.2 ad */
565 1.19 yamt lwp_lock(l);
566 1.8 ad if ((l->l_flag & (LW_CANCELLED | LW_UNPARKED)) != 0) {
567 1.8 ad l->l_flag &= ~(LW_CANCELLED | LW_UNPARKED);
568 1.19 yamt lwp_unlock(l);
569 1.41 ad mutex_spin_exit(mp);
570 1.2 ad return EALREADY;
571 1.2 ad }
572 1.41 ad lwp_unlock_to(l, mp);
573 1.24 ad l->l_biglocks = 0;
574 1.27 ad sleepq_enqueue(sq, wchan, "parked", &lwp_park_sobj);
575 1.19 yamt error = sleepq_block(timo, true);
576 1.13 yamt switch (error) {
577 1.14 yamt case EWOULDBLOCK:
578 1.14 yamt error = ETIMEDOUT;
579 1.62 christos if (timeremain)
580 1.62 christos memset(ts, 0, sizeof(*ts));
581 1.14 yamt break;
582 1.14 yamt case ERESTART:
583 1.14 yamt error = EINTR;
584 1.62 christos /*FALLTHROUGH*/
585 1.14 yamt default:
586 1.62 christos if (timeremain)
587 1.62 christos clock_timeleft(clock_id, ts, &start);
588 1.14 yamt break;
589 1.13 yamt }
590 1.13 yamt return error;
591 1.2 ad }
592 1.2 ad
593 1.24 ad /*
594 1.24 ad * 'park' an LWP waiting on a user-level synchronisation object. The LWP
595 1.24 ad * will remain parked until another LWP in the same process calls in and
596 1.24 ad * requests that it be unparked.
597 1.24 ad */
598 1.2 ad int
599 1.56 christos sys____lwp_park60(struct lwp *l, const struct sys____lwp_park60_args *uap,
600 1.44 christos register_t *retval)
601 1.2 ad {
602 1.32 dsl /* {
603 1.56 christos syscallarg(clockid_t) clock_id;
604 1.56 christos syscallarg(int) flags;
605 1.62 christos syscallarg(struct timespec *) ts;
606 1.24 ad syscallarg(lwpid_t) unpark;
607 1.24 ad syscallarg(const void *) hint;
608 1.24 ad syscallarg(const void *) unparkhint;
609 1.32 dsl } */
610 1.24 ad struct timespec ts, *tsp;
611 1.24 ad int error;
612 1.2 ad
613 1.24 ad if (SCARG(uap, ts) == NULL)
614 1.24 ad tsp = NULL;
615 1.24 ad else {
616 1.24 ad error = copyin(SCARG(uap, ts), &ts, sizeof(ts));
617 1.24 ad if (error != 0)
618 1.24 ad return error;
619 1.24 ad tsp = &ts;
620 1.24 ad }
621 1.2 ad
622 1.24 ad if (SCARG(uap, unpark) != 0) {
623 1.24 ad error = lwp_unpark(SCARG(uap, unpark), SCARG(uap, unparkhint));
624 1.24 ad if (error != 0)
625 1.24 ad return error;
626 1.15 ad }
627 1.15 ad
628 1.62 christos error = lwp_park(SCARG(uap, clock_id), SCARG(uap, flags), tsp,
629 1.56 christos SCARG(uap, hint));
630 1.62 christos if (SCARG(uap, ts) != NULL && (SCARG(uap, flags) & TIMER_ABSTIME) == 0)
631 1.62 christos (void)copyout(tsp, SCARG(uap, ts), sizeof(*tsp));
632 1.62 christos return error;
633 1.24 ad }
634 1.2 ad
635 1.24 ad int
636 1.47 rmind sys__lwp_unpark(struct lwp *l, const struct sys__lwp_unpark_args *uap,
637 1.47 rmind register_t *retval)
638 1.24 ad {
639 1.32 dsl /* {
640 1.24 ad syscallarg(lwpid_t) target;
641 1.24 ad syscallarg(const void *) hint;
642 1.32 dsl } */
643 1.2 ad
644 1.24 ad return lwp_unpark(SCARG(uap, target), SCARG(uap, hint));
645 1.2 ad }
646 1.2 ad
647 1.2 ad int
648 1.47 rmind sys__lwp_unpark_all(struct lwp *l, const struct sys__lwp_unpark_all_args *uap,
649 1.47 rmind register_t *retval)
650 1.2 ad {
651 1.32 dsl /* {
652 1.2 ad syscallarg(const lwpid_t *) targets;
653 1.2 ad syscallarg(size_t) ntargets;
654 1.2 ad syscallarg(const void *) hint;
655 1.32 dsl } */
656 1.2 ad struct proc *p;
657 1.2 ad struct lwp *t;
658 1.2 ad sleepq_t *sq;
659 1.2 ad wchan_t wchan;
660 1.2 ad lwpid_t targets[32], *tp, *tpp, *tmax, target;
661 1.46 rmind int error;
662 1.41 ad kmutex_t *mp;
663 1.15 ad u_int ntargets;
664 1.2 ad size_t sz;
665 1.2 ad
666 1.2 ad p = l->l_proc;
667 1.2 ad ntargets = SCARG(uap, ntargets);
668 1.2 ad
669 1.2 ad if (SCARG(uap, targets) == NULL) {
670 1.2 ad /*
671 1.2 ad * Let the caller know how much we are willing to do, and
672 1.2 ad * let it unpark the LWPs in blocks.
673 1.2 ad */
674 1.2 ad *retval = LWP_UNPARK_MAX;
675 1.2 ad return 0;
676 1.2 ad }
677 1.2 ad if (ntargets > LWP_UNPARK_MAX || ntargets == 0)
678 1.2 ad return EINVAL;
679 1.2 ad
680 1.2 ad /*
681 1.2 ad * Copy in the target array. If it's a small number of LWPs, then
682 1.2 ad * place the numbers on the stack.
683 1.2 ad */
684 1.2 ad sz = sizeof(target) * ntargets;
685 1.2 ad if (sz <= sizeof(targets))
686 1.2 ad tp = targets;
687 1.61 chs else
688 1.2 ad tp = kmem_alloc(sz, KM_SLEEP);
689 1.2 ad error = copyin(SCARG(uap, targets), tp, sz);
690 1.2 ad if (error != 0) {
691 1.2 ad if (tp != targets) {
692 1.2 ad kmem_free(tp, sz);
693 1.2 ad }
694 1.2 ad return error;
695 1.2 ad }
696 1.2 ad
697 1.2 ad wchan = lwp_park_wchan(p, SCARG(uap, hint));
698 1.41 ad sq = sleeptab_lookup(&lwp_park_tab, wchan, &mp);
699 1.2 ad
700 1.2 ad for (tmax = tp + ntargets, tpp = tp; tpp < tmax; tpp++) {
701 1.2 ad target = *tpp;
702 1.2 ad
703 1.2 ad /*
704 1.2 ad * Easy case: search for the LWP on the sleep queue. If
705 1.2 ad * it's parked, remove it from the queue and set running.
706 1.2 ad */
707 1.41 ad TAILQ_FOREACH(t, sq, l_sleepchain)
708 1.2 ad if (t->l_proc == p && t->l_lid == target)
709 1.2 ad break;
710 1.2 ad
711 1.2 ad if (t != NULL) {
712 1.46 rmind sleepq_remove(sq, t);
713 1.2 ad continue;
714 1.2 ad }
715 1.2 ad
716 1.2 ad /*
717 1.2 ad * The LWP hasn't parked yet. Take the hit and
718 1.2 ad * mark the operation as pending.
719 1.2 ad */
720 1.41 ad mutex_spin_exit(mp);
721 1.39 ad mutex_enter(p->p_lock);
722 1.2 ad if ((t = lwp_find(p, target)) == NULL) {
723 1.39 ad mutex_exit(p->p_lock);
724 1.41 ad mutex_spin_enter(mp);
725 1.2 ad continue;
726 1.2 ad }
727 1.2 ad lwp_lock(t);
728 1.2 ad
729 1.15 ad /*
730 1.15 ad * It may not have parked yet, we may have raced, or
731 1.15 ad * it is parked on a different user sync object.
732 1.15 ad */
733 1.15 ad if (t->l_syncobj == &lwp_park_sobj) {
734 1.15 ad /* Releases the LWP lock. */
735 1.46 rmind lwp_unsleep(t, true);
736 1.2 ad } else {
737 1.2 ad /*
738 1.15 ad * Set the operation pending. The next call to
739 1.15 ad * _lwp_park will return early.
740 1.2 ad */
741 1.8 ad t->l_flag |= LW_UNPARKED;
742 1.2 ad lwp_unlock(t);
743 1.2 ad }
744 1.15 ad
745 1.39 ad mutex_exit(p->p_lock);
746 1.41 ad mutex_spin_enter(mp);
747 1.2 ad }
748 1.2 ad
749 1.41 ad mutex_spin_exit(mp);
750 1.33 ad if (tp != targets)
751 1.2 ad kmem_free(tp, sz);
752 1.15 ad
753 1.2 ad return 0;
754 1.2 ad }
755 1.28 ad
756 1.28 ad int
757 1.47 rmind sys__lwp_setname(struct lwp *l, const struct sys__lwp_setname_args *uap,
758 1.47 rmind register_t *retval)
759 1.28 ad {
760 1.32 dsl /* {
761 1.28 ad syscallarg(lwpid_t) target;
762 1.28 ad syscallarg(const char *) name;
763 1.32 dsl } */
764 1.28 ad char *name, *oname;
765 1.30 ad lwpid_t target;
766 1.28 ad proc_t *p;
767 1.28 ad lwp_t *t;
768 1.28 ad int error;
769 1.28 ad
770 1.30 ad if ((target = SCARG(uap, target)) == 0)
771 1.30 ad target = l->l_lid;
772 1.30 ad
773 1.28 ad name = kmem_alloc(MAXCOMLEN, KM_SLEEP);
774 1.28 ad error = copyinstr(SCARG(uap, name), name, MAXCOMLEN, NULL);
775 1.28 ad switch (error) {
776 1.28 ad case ENAMETOOLONG:
777 1.28 ad case 0:
778 1.28 ad name[MAXCOMLEN - 1] = '\0';
779 1.28 ad break;
780 1.28 ad default:
781 1.28 ad kmem_free(name, MAXCOMLEN);
782 1.28 ad return error;
783 1.28 ad }
784 1.28 ad
785 1.28 ad p = curproc;
786 1.39 ad mutex_enter(p->p_lock);
787 1.30 ad if ((t = lwp_find(p, target)) == NULL) {
788 1.39 ad mutex_exit(p->p_lock);
789 1.28 ad kmem_free(name, MAXCOMLEN);
790 1.28 ad return ESRCH;
791 1.28 ad }
792 1.28 ad lwp_lock(t);
793 1.28 ad oname = t->l_name;
794 1.28 ad t->l_name = name;
795 1.28 ad lwp_unlock(t);
796 1.39 ad mutex_exit(p->p_lock);
797 1.28 ad
798 1.28 ad if (oname != NULL)
799 1.28 ad kmem_free(oname, MAXCOMLEN);
800 1.28 ad
801 1.28 ad return 0;
802 1.28 ad }
803 1.28 ad
804 1.28 ad int
805 1.47 rmind sys__lwp_getname(struct lwp *l, const struct sys__lwp_getname_args *uap,
806 1.47 rmind register_t *retval)
807 1.28 ad {
808 1.32 dsl /* {
809 1.28 ad syscallarg(lwpid_t) target;
810 1.28 ad syscallarg(char *) name;
811 1.28 ad syscallarg(size_t) len;
812 1.32 dsl } */
813 1.28 ad char name[MAXCOMLEN];
814 1.30 ad lwpid_t target;
815 1.68 maxv size_t len;
816 1.28 ad proc_t *p;
817 1.28 ad lwp_t *t;
818 1.28 ad
819 1.30 ad if ((target = SCARG(uap, target)) == 0)
820 1.30 ad target = l->l_lid;
821 1.30 ad
822 1.28 ad p = curproc;
823 1.39 ad mutex_enter(p->p_lock);
824 1.30 ad if ((t = lwp_find(p, target)) == NULL) {
825 1.39 ad mutex_exit(p->p_lock);
826 1.28 ad return ESRCH;
827 1.28 ad }
828 1.28 ad lwp_lock(t);
829 1.28 ad if (t->l_name == NULL)
830 1.28 ad name[0] = '\0';
831 1.28 ad else
832 1.58 maya strlcpy(name, t->l_name, sizeof(name));
833 1.28 ad lwp_unlock(t);
834 1.39 ad mutex_exit(p->p_lock);
835 1.28 ad
836 1.68 maxv len = uimin(SCARG(uap, len), sizeof(name));
837 1.68 maxv
838 1.68 maxv return copyoutstr(name, SCARG(uap, name), len, NULL);
839 1.28 ad }
840 1.30 ad
841 1.30 ad int
842 1.47 rmind sys__lwp_ctl(struct lwp *l, const struct sys__lwp_ctl_args *uap,
843 1.47 rmind register_t *retval)
844 1.30 ad {
845 1.32 dsl /* {
846 1.30 ad syscallarg(int) features;
847 1.30 ad syscallarg(struct lwpctl **) address;
848 1.32 dsl } */
849 1.30 ad int error, features;
850 1.30 ad vaddr_t vaddr;
851 1.30 ad
852 1.30 ad features = SCARG(uap, features);
853 1.35 ad features &= ~(LWPCTL_FEATURE_CURCPU | LWPCTL_FEATURE_PCTR);
854 1.35 ad if (features != 0)
855 1.30 ad return ENODEV;
856 1.30 ad if ((error = lwp_ctl_alloc(&vaddr)) != 0)
857 1.30 ad return error;
858 1.30 ad return copyout(&vaddr, SCARG(uap, address), sizeof(void *));
859 1.30 ad }
860