lwproc.c revision 1.36 1 1.36 pooka /* $NetBSD: lwproc.c,v 1.36 2016/01/18 23:27:20 pooka Exp $ */
2 1.1 pooka
3 1.1 pooka /*
4 1.7 pooka * Copyright (c) 2010, 2011 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.28 pooka #define RUMP__CURLWP_PRIVATE
29 1.27 pooka
30 1.1 pooka #include <sys/cdefs.h>
31 1.36 pooka __KERNEL_RCSID(0, "$NetBSD: lwproc.c,v 1.36 2016/01/18 23:27:20 pooka Exp $");
32 1.1 pooka
33 1.1 pooka #include <sys/param.h>
34 1.1 pooka #include <sys/atomic.h>
35 1.1 pooka #include <sys/filedesc.h>
36 1.1 pooka #include <sys/kauth.h>
37 1.1 pooka #include <sys/kmem.h>
38 1.1 pooka #include <sys/lwp.h>
39 1.25 pooka #include <sys/ktrace.h>
40 1.1 pooka #include <sys/pool.h>
41 1.1 pooka #include <sys/proc.h>
42 1.1 pooka #include <sys/queue.h>
43 1.1 pooka #include <sys/resourcevar.h>
44 1.1 pooka #include <sys/uidinfo.h>
45 1.1 pooka
46 1.1 pooka #include <rump/rumpuser.h>
47 1.1 pooka #include "rump_private.h"
48 1.27 pooka #include "rump_curlwp.h"
49 1.1 pooka
50 1.36 pooka struct lwp lwp0 = {
51 1.36 pooka .l_lid = 1,
52 1.36 pooka .l_proc = &proc0,
53 1.36 pooka .l_fd = &filedesc0,
54 1.36 pooka };
55 1.36 pooka struct lwplist alllwp = LIST_HEAD_INITIALIZER(alllwp);
56 1.36 pooka
57 1.36 pooka u_int nprocs = 1;
58 1.36 pooka
59 1.20 pooka struct emul *emul_default = &emul_netbsd;
60 1.20 pooka
61 1.27 pooka void
62 1.36 pooka lwp_unsleep(lwp_t *l, bool cleanup)
63 1.36 pooka {
64 1.36 pooka
65 1.36 pooka KASSERT(mutex_owned(l->l_mutex));
66 1.36 pooka
67 1.36 pooka (*l->l_syncobj->sobj_unsleep)(l, cleanup);
68 1.36 pooka }
69 1.36 pooka
70 1.36 pooka void
71 1.36 pooka lwp_update_creds(struct lwp *l)
72 1.36 pooka {
73 1.36 pooka struct proc *p;
74 1.36 pooka kauth_cred_t oldcred;
75 1.36 pooka
76 1.36 pooka p = l->l_proc;
77 1.36 pooka oldcred = l->l_cred;
78 1.36 pooka l->l_prflag &= ~LPR_CRMOD;
79 1.36 pooka
80 1.36 pooka mutex_enter(p->p_lock);
81 1.36 pooka kauth_cred_hold(p->p_cred);
82 1.36 pooka l->l_cred = p->p_cred;
83 1.36 pooka mutex_exit(p->p_lock);
84 1.36 pooka
85 1.36 pooka if (oldcred != NULL)
86 1.36 pooka kauth_cred_free(oldcred);
87 1.36 pooka }
88 1.36 pooka
89 1.36 pooka void
90 1.27 pooka rump_lwproc_init(void)
91 1.27 pooka {
92 1.27 pooka
93 1.27 pooka lwproc_curlwpop(RUMPUSER_LWP_CREATE, &lwp0);
94 1.27 pooka }
95 1.27 pooka
96 1.27 pooka struct lwp *
97 1.27 pooka rump_lwproc_curlwp_hypercall(void)
98 1.27 pooka {
99 1.27 pooka
100 1.27 pooka return rumpuser_curlwp();
101 1.27 pooka }
102 1.27 pooka
103 1.27 pooka void
104 1.27 pooka rump_lwproc_curlwp_set(struct lwp *l)
105 1.27 pooka {
106 1.27 pooka
107 1.27 pooka KASSERT(curlwp == NULL);
108 1.27 pooka lwproc_curlwpop(RUMPUSER_LWP_SET, l);
109 1.27 pooka }
110 1.27 pooka
111 1.27 pooka void
112 1.27 pooka rump_lwproc_curlwp_clear(struct lwp *l)
113 1.27 pooka {
114 1.27 pooka
115 1.27 pooka KASSERT(l == curlwp);
116 1.27 pooka lwproc_curlwpop(RUMPUSER_LWP_CLEAR, l);
117 1.27 pooka }
118 1.27 pooka
119 1.1 pooka static void
120 1.1 pooka lwproc_proc_free(struct proc *p)
121 1.1 pooka {
122 1.1 pooka kauth_cred_t cred;
123 1.30 pooka struct proc *child;
124 1.1 pooka
125 1.25 pooka KASSERT(p->p_stat == SDYING || p->p_stat == SDEAD);
126 1.25 pooka
127 1.25 pooka #ifdef KTRACE
128 1.25 pooka if (p->p_tracep) {
129 1.25 pooka mutex_enter(&ktrace_lock);
130 1.25 pooka ktrderef(p);
131 1.25 pooka mutex_exit(&ktrace_lock);
132 1.25 pooka }
133 1.25 pooka #endif
134 1.25 pooka
135 1.1 pooka mutex_enter(proc_lock);
136 1.1 pooka
137 1.30 pooka /* childranee eunt initus */
138 1.30 pooka while ((child = LIST_FIRST(&p->p_children)) != NULL) {
139 1.30 pooka LIST_REMOVE(child, p_sibling);
140 1.30 pooka child->p_pptr = initproc;
141 1.30 pooka child->p_ppid = 1;
142 1.30 pooka LIST_INSERT_HEAD(&initproc->p_children, child, p_sibling);
143 1.30 pooka }
144 1.30 pooka
145 1.1 pooka KASSERT(p->p_nlwps == 0);
146 1.1 pooka KASSERT(LIST_EMPTY(&p->p_lwps));
147 1.1 pooka
148 1.1 pooka LIST_REMOVE(p, p_list);
149 1.1 pooka LIST_REMOVE(p, p_sibling);
150 1.1 pooka proc_free_pid(p->p_pid); /* decrements nprocs */
151 1.1 pooka proc_leavepgrp(p); /* releases proc_lock */
152 1.1 pooka
153 1.1 pooka cred = p->p_cred;
154 1.1 pooka chgproccnt(kauth_cred_getuid(cred), -1);
155 1.31 pooka rump_proc_vfs_release(p);
156 1.1 pooka
157 1.29 pooka doexithooks(p);
158 1.18 pgoyette lim_free(p->p_limit);
159 1.1 pooka pstatsfree(p->p_stats);
160 1.1 pooka kauth_cred_free(p->p_cred);
161 1.1 pooka proc_finispecific(p);
162 1.1 pooka
163 1.1 pooka mutex_obj_free(p->p_lock);
164 1.1 pooka mutex_destroy(&p->p_stmutex);
165 1.1 pooka mutex_destroy(&p->p_auxlock);
166 1.1 pooka rw_destroy(&p->p_reflock);
167 1.1 pooka cv_destroy(&p->p_waitcv);
168 1.1 pooka cv_destroy(&p->p_lwpcv);
169 1.1 pooka
170 1.33 pooka /* non-local vmspaces are not shared */
171 1.10 pooka if (!RUMP_LOCALPROC_P(p)) {
172 1.35 pooka struct rump_spctl *ctl = (struct rump_spctl *)p->p_vmspace;
173 1.6 pooka KASSERT(p->p_vmspace->vm_refcnt == 1);
174 1.35 pooka kmem_free(ctl, sizeof(*ctl));
175 1.6 pooka }
176 1.6 pooka
177 1.1 pooka proc_free_mem(p);
178 1.1 pooka }
179 1.1 pooka
180 1.1 pooka /*
181 1.1 pooka * Allocate a new process. Mostly mimic fork by
182 1.1 pooka * copying the properties of the parent. However, there are some
183 1.20 pooka * differences.
184 1.1 pooka *
185 1.1 pooka * Switch to the new lwp and return a pointer to it.
186 1.1 pooka */
187 1.1 pooka static struct proc *
188 1.33 pooka lwproc_newproc(struct proc *parent, struct vmspace *vm, int flags)
189 1.1 pooka {
190 1.1 pooka uid_t uid = kauth_cred_getuid(parent->p_cred);
191 1.1 pooka struct proc *p;
192 1.1 pooka
193 1.1 pooka /* maxproc not enforced */
194 1.1 pooka atomic_inc_uint(&nprocs);
195 1.1 pooka
196 1.1 pooka /* allocate process */
197 1.1 pooka p = proc_alloc();
198 1.1 pooka memset(&p->p_startzero, 0,
199 1.1 pooka offsetof(struct proc, p_endzero)
200 1.1 pooka - offsetof(struct proc, p_startzero));
201 1.1 pooka memcpy(&p->p_startcopy, &parent->p_startcopy,
202 1.1 pooka offsetof(struct proc, p_endcopy)
203 1.1 pooka - offsetof(struct proc, p_startcopy));
204 1.1 pooka
205 1.15 pooka /* some other garbage we need to zero */
206 1.15 pooka p->p_sigacts = NULL;
207 1.15 pooka p->p_aio = NULL;
208 1.15 pooka p->p_dtrace = NULL;
209 1.15 pooka p->p_mqueue_cnt = p->p_exitsig = 0;
210 1.15 pooka p->p_flag = p->p_sflag = p->p_slflag = p->p_lflag = p->p_stflag = 0;
211 1.15 pooka p->p_trace_enabled = 0;
212 1.15 pooka p->p_xstat = p->p_acflag = 0;
213 1.15 pooka p->p_stackbase = 0;
214 1.15 pooka
215 1.1 pooka p->p_stats = pstatscopy(parent->p_stats);
216 1.1 pooka
217 1.33 pooka p->p_vmspace = vm;
218 1.20 pooka p->p_emul = emul_default;
219 1.26 pooka #ifdef __HAVE_SYSCALL_INTERN
220 1.26 pooka p->p_emul->e_syscall_intern(p);
221 1.26 pooka #endif
222 1.14 pooka if (*parent->p_comm)
223 1.14 pooka strcpy(p->p_comm, parent->p_comm);
224 1.14 pooka else
225 1.14 pooka strcpy(p->p_comm, "rumproc");
226 1.7 pooka
227 1.7 pooka if ((flags & RUMP_RFCFDG) == 0)
228 1.7 pooka KASSERT(parent == curproc);
229 1.7 pooka if (flags & RUMP_RFFDG)
230 1.7 pooka p->p_fd = fd_copy();
231 1.7 pooka else if (flags & RUMP_RFCFDG)
232 1.7 pooka p->p_fd = fd_init(NULL);
233 1.7 pooka else
234 1.7 pooka fd_share(p);
235 1.7 pooka
236 1.1 pooka lim_addref(parent->p_limit);
237 1.1 pooka p->p_limit = parent->p_limit;
238 1.1 pooka
239 1.1 pooka LIST_INIT(&p->p_lwps);
240 1.1 pooka LIST_INIT(&p->p_children);
241 1.1 pooka
242 1.1 pooka p->p_lock = mutex_obj_alloc(MUTEX_DEFAULT, IPL_NONE);
243 1.21 pooka mutex_init(&p->p_stmutex, MUTEX_DEFAULT, IPL_HIGH);
244 1.1 pooka mutex_init(&p->p_auxlock, MUTEX_DEFAULT, IPL_NONE);
245 1.1 pooka rw_init(&p->p_reflock);
246 1.1 pooka cv_init(&p->p_waitcv, "pwait");
247 1.1 pooka cv_init(&p->p_lwpcv, "plwp");
248 1.1 pooka
249 1.1 pooka p->p_pptr = parent;
250 1.1 pooka p->p_ppid = parent->p_pid;
251 1.12 pooka p->p_stat = SACTIVE;
252 1.1 pooka
253 1.1 pooka kauth_proc_fork(parent, p);
254 1.1 pooka
255 1.1 pooka /* initialize cwd in rump kernels with vfs */
256 1.31 pooka rump_proc_vfs_init(p);
257 1.1 pooka
258 1.1 pooka chgproccnt(uid, 1); /* not enforced */
259 1.1 pooka
260 1.1 pooka /* publish proc various proc lists */
261 1.1 pooka mutex_enter(proc_lock);
262 1.1 pooka LIST_INSERT_HEAD(&allproc, p, p_list);
263 1.1 pooka LIST_INSERT_HEAD(&parent->p_children, p, p_sibling);
264 1.1 pooka LIST_INSERT_AFTER(parent, p, p_pglist);
265 1.1 pooka mutex_exit(proc_lock);
266 1.1 pooka
267 1.1 pooka return p;
268 1.1 pooka }
269 1.1 pooka
270 1.1 pooka static void
271 1.1 pooka lwproc_freelwp(struct lwp *l)
272 1.1 pooka {
273 1.1 pooka struct proc *p;
274 1.1 pooka
275 1.1 pooka p = l->l_proc;
276 1.1 pooka mutex_enter(p->p_lock);
277 1.1 pooka
278 1.1 pooka KASSERT(l->l_flag & LW_WEXIT);
279 1.1 pooka KASSERT(l->l_refcnt == 0);
280 1.1 pooka
281 1.1 pooka /* ok, zero references, continue with nuke */
282 1.1 pooka LIST_REMOVE(l, l_sibling);
283 1.1 pooka KASSERT(p->p_nlwps >= 1);
284 1.1 pooka if (--p->p_nlwps == 0) {
285 1.1 pooka KASSERT(p != &proc0);
286 1.1 pooka p->p_stat = SDEAD;
287 1.32 pooka } else {
288 1.32 pooka chglwpcnt(kauth_cred_getuid(p->p_cred), -1);
289 1.1 pooka }
290 1.22 pooka cv_broadcast(&p->p_lwpcv); /* nobody sleeps on this in a rump kernel? */
291 1.1 pooka kauth_cred_free(l->l_cred);
292 1.1 pooka mutex_exit(p->p_lock);
293 1.1 pooka
294 1.1 pooka mutex_enter(proc_lock);
295 1.1 pooka LIST_REMOVE(l, l_list);
296 1.1 pooka mutex_exit(proc_lock);
297 1.1 pooka
298 1.1 pooka if (l->l_name)
299 1.1 pooka kmem_free(l->l_name, MAXCOMLEN);
300 1.1 pooka lwp_finispecific(l);
301 1.1 pooka
302 1.27 pooka lwproc_curlwpop(RUMPUSER_LWP_DESTROY, l);
303 1.22 pooka membar_exit();
304 1.1 pooka kmem_free(l, sizeof(*l));
305 1.1 pooka
306 1.1 pooka if (p->p_stat == SDEAD)
307 1.1 pooka lwproc_proc_free(p);
308 1.1 pooka }
309 1.1 pooka
310 1.12 pooka extern kmutex_t unruntime_lock;
311 1.12 pooka
312 1.1 pooka /*
313 1.1 pooka * called with p_lock held, releases lock before return
314 1.1 pooka */
315 1.1 pooka static void
316 1.1 pooka lwproc_makelwp(struct proc *p, struct lwp *l, bool doswitch, bool procmake)
317 1.1 pooka {
318 1.1 pooka
319 1.32 pooka /*
320 1.32 pooka * Account the new lwp to the owner of the process.
321 1.32 pooka * For some reason, NetBSD doesn't count the first lwp
322 1.32 pooka * in a process as a lwp, so skip that.
323 1.32 pooka */
324 1.32 pooka if (p->p_nlwps++) {
325 1.32 pooka chglwpcnt(kauth_cred_getuid(p->p_cred), 1);
326 1.32 pooka }
327 1.32 pooka
328 1.1 pooka l->l_refcnt = 1;
329 1.1 pooka l->l_proc = p;
330 1.1 pooka
331 1.1 pooka l->l_lid = p->p_nlwpid++;
332 1.1 pooka LIST_INSERT_HEAD(&p->p_lwps, l, l_sibling);
333 1.1 pooka
334 1.1 pooka l->l_fd = p->p_fd;
335 1.12 pooka l->l_cpu = rump_cpu;
336 1.1 pooka l->l_target_cpu = rump_cpu; /* Initial target CPU always the same */
337 1.9 pooka l->l_stat = LSRUN;
338 1.12 pooka l->l_mutex = &unruntime_lock;
339 1.8 pooka TAILQ_INIT(&l->l_ld_locks);
340 1.16 pooka mutex_exit(p->p_lock);
341 1.1 pooka
342 1.16 pooka lwp_update_creds(l);
343 1.1 pooka lwp_initspecific(l);
344 1.1 pooka
345 1.22 pooka membar_enter();
346 1.27 pooka lwproc_curlwpop(RUMPUSER_LWP_CREATE, l);
347 1.1 pooka if (doswitch) {
348 1.1 pooka rump_lwproc_switch(l);
349 1.1 pooka }
350 1.1 pooka
351 1.1 pooka /* filedesc already has refcount 1 when process is created */
352 1.1 pooka if (!procmake) {
353 1.1 pooka fd_hold(l);
354 1.1 pooka }
355 1.1 pooka
356 1.1 pooka mutex_enter(proc_lock);
357 1.1 pooka LIST_INSERT_HEAD(&alllwp, l, l_list);
358 1.1 pooka mutex_exit(proc_lock);
359 1.1 pooka }
360 1.1 pooka
361 1.1 pooka struct lwp *
362 1.3 pooka rump__lwproc_alloclwp(struct proc *p)
363 1.1 pooka {
364 1.1 pooka struct lwp *l;
365 1.3 pooka bool newproc = false;
366 1.3 pooka
367 1.3 pooka if (p == NULL) {
368 1.34 pooka p = lwproc_newproc(&proc0, rump_vmspace_local, RUMP_RFCFDG);
369 1.3 pooka newproc = true;
370 1.3 pooka }
371 1.1 pooka
372 1.1 pooka l = kmem_zalloc(sizeof(*l), KM_SLEEP);
373 1.1 pooka
374 1.1 pooka mutex_enter(p->p_lock);
375 1.17 pooka KASSERT((p->p_sflag & PS_RUMP_LWPEXIT) == 0);
376 1.3 pooka lwproc_makelwp(p, l, false, newproc);
377 1.1 pooka
378 1.1 pooka return l;
379 1.1 pooka }
380 1.1 pooka
381 1.1 pooka int
382 1.1 pooka rump_lwproc_newlwp(pid_t pid)
383 1.1 pooka {
384 1.1 pooka struct proc *p;
385 1.1 pooka struct lwp *l;
386 1.1 pooka
387 1.1 pooka l = kmem_zalloc(sizeof(*l), KM_SLEEP);
388 1.1 pooka mutex_enter(proc_lock);
389 1.1 pooka p = proc_find_raw(pid);
390 1.1 pooka if (p == NULL) {
391 1.1 pooka mutex_exit(proc_lock);
392 1.1 pooka kmem_free(l, sizeof(*l));
393 1.1 pooka return ESRCH;
394 1.1 pooka }
395 1.1 pooka mutex_enter(p->p_lock);
396 1.17 pooka if (p->p_sflag & PS_RUMP_LWPEXIT) {
397 1.17 pooka mutex_exit(proc_lock);
398 1.17 pooka mutex_exit(p->p_lock);
399 1.17 pooka kmem_free(l, sizeof(*l));
400 1.17 pooka return EBUSY;
401 1.17 pooka }
402 1.1 pooka mutex_exit(proc_lock);
403 1.1 pooka lwproc_makelwp(p, l, true, false);
404 1.1 pooka
405 1.1 pooka return 0;
406 1.1 pooka }
407 1.1 pooka
408 1.1 pooka int
409 1.33 pooka rump_lwproc_rfork_vmspace(struct vmspace *vm, int flags)
410 1.1 pooka {
411 1.1 pooka struct proc *p;
412 1.1 pooka struct lwp *l;
413 1.1 pooka
414 1.7 pooka if (flags & ~(RUMP_RFFDG|RUMP_RFCFDG) ||
415 1.7 pooka (~flags & (RUMP_RFFDG|RUMP_RFCFDG)) == 0)
416 1.7 pooka return EINVAL;
417 1.7 pooka
418 1.33 pooka p = lwproc_newproc(curproc, vm, flags);
419 1.1 pooka l = kmem_zalloc(sizeof(*l), KM_SLEEP);
420 1.1 pooka mutex_enter(p->p_lock);
421 1.17 pooka KASSERT((p->p_sflag & PS_RUMP_LWPEXIT) == 0);
422 1.1 pooka lwproc_makelwp(p, l, true, true);
423 1.1 pooka
424 1.1 pooka return 0;
425 1.1 pooka }
426 1.1 pooka
427 1.33 pooka int
428 1.33 pooka rump_lwproc_rfork(int flags)
429 1.33 pooka {
430 1.33 pooka
431 1.33 pooka return rump_lwproc_rfork_vmspace(rump_vmspace_local, flags);
432 1.33 pooka }
433 1.33 pooka
434 1.1 pooka /*
435 1.1 pooka * Switch to a new process/thread. Release previous one if
436 1.4 pooka * deemed to be exiting. This is considered a slow path for
437 1.4 pooka * rump kernel entry.
438 1.1 pooka */
439 1.1 pooka void
440 1.1 pooka rump_lwproc_switch(struct lwp *newlwp)
441 1.1 pooka {
442 1.1 pooka struct lwp *l = curlwp;
443 1.1 pooka
444 1.1 pooka KASSERT(!(l->l_flag & LW_WEXIT) || newlwp);
445 1.1 pooka
446 1.1 pooka if (__predict_false(newlwp && (newlwp->l_pflag & LP_RUNNING)))
447 1.1 pooka panic("lwp %p (%d:%d) already running",
448 1.1 pooka newlwp, newlwp->l_proc->p_pid, newlwp->l_lid);
449 1.1 pooka
450 1.1 pooka if (newlwp == NULL) {
451 1.1 pooka l->l_pflag &= ~LP_RUNNING;
452 1.1 pooka l->l_flag |= LW_RUMP_CLEAR;
453 1.1 pooka return;
454 1.1 pooka }
455 1.1 pooka
456 1.1 pooka /* fd_free() must be called from curlwp context. talk about ugh */
457 1.1 pooka if (l->l_flag & LW_WEXIT) {
458 1.1 pooka fd_free();
459 1.1 pooka }
460 1.1 pooka
461 1.24 pooka KERNEL_UNLOCK_ALL(NULL, &l->l_biglocks);
462 1.27 pooka lwproc_curlwpop(RUMPUSER_LWP_CLEAR, l);
463 1.1 pooka
464 1.1 pooka newlwp->l_cpu = newlwp->l_target_cpu = l->l_cpu;
465 1.1 pooka newlwp->l_mutex = l->l_mutex;
466 1.1 pooka newlwp->l_pflag |= LP_RUNNING;
467 1.1 pooka
468 1.27 pooka lwproc_curlwpop(RUMPUSER_LWP_SET, newlwp);
469 1.24 pooka curcpu()->ci_curlwp = newlwp;
470 1.24 pooka KERNEL_LOCK(newlwp->l_biglocks, NULL);
471 1.1 pooka
472 1.4 pooka /*
473 1.4 pooka * Check if the thread should get a signal. This is
474 1.4 pooka * mostly to satisfy the "record" rump sigmodel.
475 1.4 pooka */
476 1.4 pooka mutex_enter(newlwp->l_proc->p_lock);
477 1.4 pooka if (sigispending(newlwp, 0)) {
478 1.4 pooka newlwp->l_flag |= LW_PENDSIG;
479 1.4 pooka }
480 1.4 pooka mutex_exit(newlwp->l_proc->p_lock);
481 1.4 pooka
482 1.12 pooka l->l_mutex = &unruntime_lock;
483 1.1 pooka l->l_pflag &= ~LP_RUNNING;
484 1.4 pooka l->l_flag &= ~LW_PENDSIG;
485 1.13 pooka l->l_stat = LSRUN;
486 1.1 pooka
487 1.1 pooka if (l->l_flag & LW_WEXIT) {
488 1.1 pooka lwproc_freelwp(l);
489 1.1 pooka }
490 1.1 pooka }
491 1.1 pooka
492 1.24 pooka /*
493 1.24 pooka * Mark the current thread to be released upon return from
494 1.24 pooka * kernel.
495 1.24 pooka */
496 1.1 pooka void
497 1.1 pooka rump_lwproc_releaselwp(void)
498 1.1 pooka {
499 1.1 pooka struct lwp *l = curlwp;
500 1.1 pooka
501 1.24 pooka if (l->l_refcnt == 0 || l->l_flag & LW_WEXIT)
502 1.2 pooka panic("releasing non-pertinent lwp");
503 1.2 pooka
504 1.24 pooka rump__lwproc_lwprele();
505 1.24 pooka KASSERT(l->l_refcnt == 0 && (l->l_flag & LW_WEXIT));
506 1.24 pooka }
507 1.24 pooka
508 1.24 pooka /*
509 1.24 pooka * In-kernel routines used to add and remove references for the
510 1.24 pooka * current thread. The main purpose is to make it possible for
511 1.24 pooka * implicit threads to persist over scheduling operations in
512 1.24 pooka * rump kernel drivers. Note that we don't need p_lock in a
513 1.24 pooka * rump kernel, since we do refcounting only for curlwp.
514 1.24 pooka */
515 1.24 pooka void
516 1.24 pooka rump__lwproc_lwphold(void)
517 1.24 pooka {
518 1.24 pooka struct lwp *l = curlwp;
519 1.24 pooka
520 1.24 pooka l->l_refcnt++;
521 1.24 pooka l->l_flag &= ~LW_WEXIT;
522 1.24 pooka }
523 1.24 pooka
524 1.24 pooka void
525 1.24 pooka rump__lwproc_lwprele(void)
526 1.24 pooka {
527 1.24 pooka struct lwp *l = curlwp;
528 1.24 pooka
529 1.1 pooka l->l_refcnt--;
530 1.24 pooka if (l->l_refcnt == 0)
531 1.24 pooka l->l_flag |= LW_WEXIT;
532 1.1 pooka }
533 1.1 pooka
534 1.1 pooka struct lwp *
535 1.1 pooka rump_lwproc_curlwp(void)
536 1.1 pooka {
537 1.1 pooka struct lwp *l = curlwp;
538 1.1 pooka
539 1.1 pooka if (l->l_flag & LW_WEXIT)
540 1.1 pooka return NULL;
541 1.1 pooka return l;
542 1.1 pooka }
543 1.20 pooka
544 1.20 pooka /* this interface is under construction (like the proverbial 90's web page) */
545 1.20 pooka int rump_i_know_what_i_am_doing_with_sysents = 0;
546 1.20 pooka void
547 1.20 pooka rump_lwproc_sysent_usenative()
548 1.20 pooka {
549 1.20 pooka
550 1.20 pooka if (!rump_i_know_what_i_am_doing_with_sysents)
551 1.20 pooka panic("don't use rump_lwproc_sysent_usenative()");
552 1.20 pooka curproc->p_emul = &emul_netbsd;
553 1.20 pooka }
554