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