kern_exec.c revision 1.349 1 1.349 martin /* $NetBSD: kern_exec.c,v 1.349 2012/04/09 19:42:06 martin Exp $ */
2 1.277 ad
3 1.277 ad /*-
4 1.277 ad * Copyright (c) 2008 The NetBSD Foundation, Inc.
5 1.277 ad * All rights reserved.
6 1.277 ad *
7 1.277 ad * Redistribution and use in source and binary forms, with or without
8 1.277 ad * modification, are permitted provided that the following conditions
9 1.277 ad * are met:
10 1.277 ad * 1. Redistributions of source code must retain the above copyright
11 1.277 ad * notice, this list of conditions and the following disclaimer.
12 1.277 ad * 2. Redistributions in binary form must reproduce the above copyright
13 1.277 ad * notice, this list of conditions and the following disclaimer in the
14 1.277 ad * documentation and/or other materials provided with the distribution.
15 1.277 ad *
16 1.277 ad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
17 1.277 ad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
18 1.277 ad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
19 1.277 ad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
20 1.277 ad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 1.277 ad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 1.277 ad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 1.277 ad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 1.277 ad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 1.277 ad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 1.277 ad * POSSIBILITY OF SUCH DAMAGE.
27 1.277 ad */
28 1.55 cgd
29 1.55 cgd /*-
30 1.77 cgd * Copyright (C) 1993, 1994, 1996 Christopher G. Demetriou
31 1.55 cgd * Copyright (C) 1992 Wolfgang Solfrank.
32 1.55 cgd * Copyright (C) 1992 TooLs GmbH.
33 1.55 cgd * All rights reserved.
34 1.55 cgd *
35 1.55 cgd * Redistribution and use in source and binary forms, with or without
36 1.55 cgd * modification, are permitted provided that the following conditions
37 1.55 cgd * are met:
38 1.55 cgd * 1. Redistributions of source code must retain the above copyright
39 1.55 cgd * notice, this list of conditions and the following disclaimer.
40 1.55 cgd * 2. Redistributions in binary form must reproduce the above copyright
41 1.55 cgd * notice, this list of conditions and the following disclaimer in the
42 1.55 cgd * documentation and/or other materials provided with the distribution.
43 1.55 cgd * 3. All advertising materials mentioning features or use of this software
44 1.55 cgd * must display the following acknowledgement:
45 1.55 cgd * This product includes software developed by TooLs GmbH.
46 1.55 cgd * 4. The name of TooLs GmbH may not be used to endorse or promote products
47 1.55 cgd * derived from this software without specific prior written permission.
48 1.55 cgd *
49 1.55 cgd * THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR
50 1.55 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
51 1.55 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
52 1.55 cgd * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
53 1.55 cgd * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
54 1.55 cgd * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
55 1.55 cgd * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
56 1.55 cgd * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
57 1.55 cgd * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
58 1.55 cgd * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
59 1.55 cgd */
60 1.146 lukem
61 1.146 lukem #include <sys/cdefs.h>
62 1.349 martin __KERNEL_RCSID(0, "$NetBSD: kern_exec.c,v 1.349 2012/04/09 19:42:06 martin Exp $");
63 1.89 mrg
64 1.325 jmcneill #include "opt_exec.h"
65 1.92 thorpej #include "opt_ktrace.h"
66 1.285 apb #include "opt_modular.h"
67 1.124 jdolecek #include "opt_syscall_debug.h"
68 1.226 dogcow #include "veriexec.h"
69 1.232 elad #include "opt_pax.h"
70 1.55 cgd
71 1.55 cgd #include <sys/param.h>
72 1.55 cgd #include <sys/systm.h>
73 1.55 cgd #include <sys/filedesc.h>
74 1.55 cgd #include <sys/kernel.h>
75 1.55 cgd #include <sys/proc.h>
76 1.55 cgd #include <sys/mount.h>
77 1.55 cgd #include <sys/malloc.h>
78 1.265 yamt #include <sys/kmem.h>
79 1.55 cgd #include <sys/namei.h>
80 1.55 cgd #include <sys/vnode.h>
81 1.55 cgd #include <sys/file.h>
82 1.55 cgd #include <sys/acct.h>
83 1.337 martin #include <sys/atomic.h>
84 1.55 cgd #include <sys/exec.h>
85 1.55 cgd #include <sys/ktrace.h>
86 1.278 pooka #include <sys/uidinfo.h>
87 1.55 cgd #include <sys/wait.h>
88 1.55 cgd #include <sys/mman.h>
89 1.155 gmcgarry #include <sys/ras.h>
90 1.55 cgd #include <sys/signalvar.h>
91 1.55 cgd #include <sys/stat.h>
92 1.124 jdolecek #include <sys/syscall.h>
93 1.218 elad #include <sys/kauth.h>
94 1.253 ad #include <sys/lwpctl.h>
95 1.260 christos #include <sys/pax.h>
96 1.263 ad #include <sys/cpu.h>
97 1.282 ad #include <sys/module.h>
98 1.289 pooka #include <sys/syscallvar.h>
99 1.56 cgd #include <sys/syscallargs.h>
100 1.222 elad #if NVERIEXEC > 0
101 1.197 blymn #include <sys/verified_exec.h>
102 1.222 elad #endif /* NVERIEXEC > 0 */
103 1.294 darran #include <sys/sdt.h>
104 1.337 martin #include <sys/spawn.h>
105 1.337 martin #include <sys/prot.h>
106 1.330 tls #include <sys/cprng.h>
107 1.55 cgd
108 1.88 mrg #include <uvm/uvm_extern.h>
109 1.88 mrg
110 1.55 cgd #include <machine/reg.h>
111 1.55 cgd
112 1.244 dsl #include <compat/common/compat_util.h>
113 1.244 dsl
114 1.171 chs static int exec_sigcode_map(struct proc *, const struct emul *);
115 1.171 chs
116 1.143 christos #ifdef DEBUG_EXEC
117 1.305 matt #define DPRINTF(a) printf a
118 1.312 christos #define COPYPRINTF(s, a, b) printf("%s, %d: copyout%s @%p %zu\n", __func__, \
119 1.312 christos __LINE__, (s), (a), (b))
120 1.143 christos #else
121 1.143 christos #define DPRINTF(a)
122 1.312 christos #define COPYPRINTF(s, a, b)
123 1.143 christos #endif /* DEBUG_EXEC */
124 1.165 thorpej
125 1.130 jdolecek /*
126 1.294 darran * DTrace SDT provider definitions
127 1.294 darran */
128 1.294 darran SDT_PROBE_DEFINE(proc,,,exec,
129 1.294 darran "char *", NULL,
130 1.294 darran NULL, NULL, NULL, NULL,
131 1.294 darran NULL, NULL, NULL, NULL);
132 1.294 darran SDT_PROBE_DEFINE(proc,,,exec_success,
133 1.294 darran "char *", NULL,
134 1.294 darran NULL, NULL, NULL, NULL,
135 1.294 darran NULL, NULL, NULL, NULL);
136 1.294 darran SDT_PROBE_DEFINE(proc,,,exec_failure,
137 1.294 darran "int", NULL,
138 1.294 darran NULL, NULL, NULL, NULL,
139 1.294 darran NULL, NULL, NULL, NULL);
140 1.294 darran
141 1.294 darran /*
142 1.130 jdolecek * Exec function switch:
143 1.130 jdolecek *
144 1.130 jdolecek * Note that each makecmds function is responsible for loading the
145 1.130 jdolecek * exec package with the necessary functions for any exec-type-specific
146 1.130 jdolecek * handling.
147 1.130 jdolecek *
148 1.130 jdolecek * Functions for specific exec types should be defined in their own
149 1.130 jdolecek * header file.
150 1.130 jdolecek */
151 1.138 lukem static const struct execsw **execsw = NULL;
152 1.138 lukem static int nexecs;
153 1.138 lukem
154 1.282 ad u_int exec_maxhdrsz; /* must not be static - used by netbsd32 */
155 1.130 jdolecek
156 1.130 jdolecek /* list of dynamically loaded execsw entries */
157 1.282 ad static LIST_HEAD(execlist_head, exec_entry) ex_head =
158 1.282 ad LIST_HEAD_INITIALIZER(ex_head);
159 1.130 jdolecek struct exec_entry {
160 1.138 lukem LIST_ENTRY(exec_entry) ex_list;
161 1.282 ad SLIST_ENTRY(exec_entry) ex_slist;
162 1.282 ad const struct execsw *ex_sw;
163 1.130 jdolecek };
164 1.130 jdolecek
165 1.203 christos #ifndef __HAVE_SYSCALL_INTERN
166 1.203 christos void syscall(void);
167 1.203 christos #endif
168 1.203 christos
169 1.173 christos /* NetBSD emul struct */
170 1.282 ad struct emul emul_netbsd = {
171 1.291 rmind .e_name = "netbsd",
172 1.291 rmind .e_path = NULL,
173 1.133 mycroft #ifndef __HAVE_MINIMAL_EMUL
174 1.291 rmind .e_flags = EMUL_HAS_SYS___syscall,
175 1.291 rmind .e_errno = NULL,
176 1.291 rmind .e_nosys = SYS_syscall,
177 1.291 rmind .e_nsysent = SYS_NSYSENT,
178 1.133 mycroft #endif
179 1.291 rmind .e_sysent = sysent,
180 1.124 jdolecek #ifdef SYSCALL_DEBUG
181 1.291 rmind .e_syscallnames = syscallnames,
182 1.124 jdolecek #else
183 1.291 rmind .e_syscallnames = NULL,
184 1.124 jdolecek #endif
185 1.291 rmind .e_sendsig = sendsig,
186 1.291 rmind .e_trapsignal = trapsignal,
187 1.291 rmind .e_tracesig = NULL,
188 1.291 rmind .e_sigcode = NULL,
189 1.291 rmind .e_esigcode = NULL,
190 1.291 rmind .e_sigobject = NULL,
191 1.291 rmind .e_setregs = setregs,
192 1.291 rmind .e_proc_exec = NULL,
193 1.291 rmind .e_proc_fork = NULL,
194 1.291 rmind .e_proc_exit = NULL,
195 1.291 rmind .e_lwp_fork = NULL,
196 1.291 rmind .e_lwp_exit = NULL,
197 1.133 mycroft #ifdef __HAVE_SYSCALL_INTERN
198 1.291 rmind .e_syscall_intern = syscall_intern,
199 1.133 mycroft #else
200 1.291 rmind .e_syscall = syscall,
201 1.133 mycroft #endif
202 1.291 rmind .e_sysctlovly = NULL,
203 1.291 rmind .e_fault = NULL,
204 1.291 rmind .e_vm_default_addr = uvm_default_mapaddr,
205 1.291 rmind .e_usertrap = NULL,
206 1.291 rmind .e_ucsize = sizeof(ucontext_t),
207 1.291 rmind .e_startlwp = startlwp
208 1.124 jdolecek };
209 1.124 jdolecek
210 1.55 cgd /*
211 1.130 jdolecek * Exec lock. Used to control access to execsw[] structures.
212 1.130 jdolecek * This must not be static so that netbsd32 can access it, too.
213 1.130 jdolecek */
214 1.237 ad krwlock_t exec_lock;
215 1.183 junyoung
216 1.259 ad static kmutex_t sigobject_lock;
217 1.259 ad
218 1.337 martin /*
219 1.337 martin * Data used between a loadvm and execve part of an "exec" operation
220 1.337 martin */
221 1.337 martin struct execve_data {
222 1.337 martin struct exec_package ed_pack;
223 1.337 martin struct pathbuf *ed_pathbuf;
224 1.337 martin struct vattr ed_attr;
225 1.337 martin struct ps_strings ed_arginfo;
226 1.337 martin char *ed_argp;
227 1.337 martin const char *ed_pathstring;
228 1.337 martin char *ed_resolvedpathbuf;
229 1.337 martin size_t ed_ps_strings_sz;
230 1.337 martin int ed_szsigcode;
231 1.337 martin long ed_argc;
232 1.337 martin long ed_envc;
233 1.337 martin };
234 1.337 martin
235 1.337 martin /*
236 1.337 martin * data passed from parent lwp to child during a posix_spawn()
237 1.337 martin */
238 1.337 martin struct spawn_exec_data {
239 1.337 martin struct execve_data sed_exec;
240 1.348 martin struct posix_spawn_file_actions
241 1.337 martin *sed_actions;
242 1.337 martin struct posix_spawnattr *sed_attrs;
243 1.337 martin struct proc *sed_parent;
244 1.337 martin kcondvar_t sed_cv_child_ready;
245 1.337 martin kmutex_t sed_mtx_child;
246 1.337 martin int sed_error;
247 1.348 martin volatile uint32_t sed_refcnt;
248 1.337 martin };
249 1.337 martin
250 1.277 ad static void *
251 1.277 ad exec_pool_alloc(struct pool *pp, int flags)
252 1.277 ad {
253 1.277 ad
254 1.277 ad return (void *)uvm_km_alloc(kernel_map, NCARGS, 0,
255 1.277 ad UVM_KMF_PAGEABLE | UVM_KMF_WAITVA);
256 1.277 ad }
257 1.277 ad
258 1.277 ad static void
259 1.277 ad exec_pool_free(struct pool *pp, void *addr)
260 1.277 ad {
261 1.277 ad
262 1.277 ad uvm_km_free(kernel_map, (vaddr_t)addr, NCARGS, UVM_KMF_PAGEABLE);
263 1.277 ad }
264 1.277 ad
265 1.277 ad static struct pool exec_pool;
266 1.277 ad
267 1.277 ad static struct pool_allocator exec_palloc = {
268 1.277 ad .pa_alloc = exec_pool_alloc,
269 1.277 ad .pa_free = exec_pool_free,
270 1.277 ad .pa_pagesz = NCARGS
271 1.277 ad };
272 1.277 ad
273 1.130 jdolecek /*
274 1.55 cgd * check exec:
275 1.55 cgd * given an "executable" described in the exec package's namei info,
276 1.55 cgd * see what we can do with it.
277 1.55 cgd *
278 1.55 cgd * ON ENTRY:
279 1.55 cgd * exec package with appropriate namei info
280 1.212 christos * lwp pointer of exec'ing lwp
281 1.55 cgd * NO SELF-LOCKED VNODES
282 1.55 cgd *
283 1.55 cgd * ON EXIT:
284 1.55 cgd * error: nothing held, etc. exec header still allocated.
285 1.77 cgd * ok: filled exec package, executable's vnode (unlocked).
286 1.55 cgd *
287 1.55 cgd * EXEC SWITCH ENTRY:
288 1.55 cgd * Locked vnode to check, exec package, proc.
289 1.55 cgd *
290 1.55 cgd * EXEC SWITCH EXIT:
291 1.77 cgd * ok: return 0, filled exec package, executable's vnode (unlocked).
292 1.55 cgd * error: destructive:
293 1.55 cgd * everything deallocated execept exec header.
294 1.76 cgd * non-destructive:
295 1.77 cgd * error code, executable's vnode (unlocked),
296 1.76 cgd * exec header unmodified.
297 1.55 cgd */
298 1.55 cgd int
299 1.205 christos /*ARGSUSED*/
300 1.301 dholland check_exec(struct lwp *l, struct exec_package *epp, struct pathbuf *pb)
301 1.55 cgd {
302 1.138 lukem int error, i;
303 1.138 lukem struct vnode *vp;
304 1.295 dholland struct nameidata nd;
305 1.138 lukem size_t resid;
306 1.55 cgd
307 1.303 dholland NDINIT(&nd, LOOKUP, FOLLOW | LOCKLEAF | TRYEMULROOT, pb);
308 1.295 dholland
309 1.55 cgd /* first get the vnode */
310 1.295 dholland if ((error = namei(&nd)) != 0)
311 1.55 cgd return error;
312 1.295 dholland epp->ep_vp = vp = nd.ni_vp;
313 1.295 dholland /* this cannot overflow as both are size PATH_MAX */
314 1.302 dholland strcpy(epp->ep_resolvedname, nd.ni_pnbuf);
315 1.295 dholland
316 1.296 dholland #ifdef DIAGNOSTIC
317 1.296 dholland /* paranoia (take this out once namei stuff stabilizes) */
318 1.302 dholland memset(nd.ni_pnbuf, '~', PATH_MAX);
319 1.295 dholland #endif
320 1.55 cgd
321 1.84 mycroft /* check access and type */
322 1.55 cgd if (vp->v_type != VREG) {
323 1.81 kleink error = EACCES;
324 1.55 cgd goto bad1;
325 1.55 cgd }
326 1.254 pooka if ((error = VOP_ACCESS(vp, VEXEC, l->l_cred)) != 0)
327 1.84 mycroft goto bad1;
328 1.55 cgd
329 1.55 cgd /* get attributes */
330 1.254 pooka if ((error = VOP_GETATTR(vp, epp->ep_vap, l->l_cred)) != 0)
331 1.55 cgd goto bad1;
332 1.55 cgd
333 1.55 cgd /* Check mount point */
334 1.55 cgd if (vp->v_mount->mnt_flag & MNT_NOEXEC) {
335 1.55 cgd error = EACCES;
336 1.55 cgd goto bad1;
337 1.55 cgd }
338 1.141 thorpej if (vp->v_mount->mnt_flag & MNT_NOSUID)
339 1.83 mycroft epp->ep_vap->va_mode &= ~(S_ISUID | S_ISGID);
340 1.55 cgd
341 1.55 cgd /* try to open it */
342 1.254 pooka if ((error = VOP_OPEN(vp, FREAD, l->l_cred)) != 0)
343 1.55 cgd goto bad1;
344 1.55 cgd
345 1.99 wrstuden /* unlock vp, since we need it unlocked from here on out. */
346 1.298 hannken VOP_UNLOCK(vp);
347 1.77 cgd
348 1.222 elad #if NVERIEXEC > 0
349 1.295 dholland error = veriexec_verify(l, vp, epp->ep_resolvedname,
350 1.233 elad epp->ep_flags & EXEC_INDIR ? VERIEXEC_INDIRECT : VERIEXEC_DIRECT,
351 1.236 elad NULL);
352 1.236 elad if (error)
353 1.234 elad goto bad2;
354 1.222 elad #endif /* NVERIEXEC > 0 */
355 1.160 blymn
356 1.232 elad #ifdef PAX_SEGVGUARD
357 1.295 dholland error = pax_segvguard(l, vp, epp->ep_resolvedname, false);
358 1.234 elad if (error)
359 1.234 elad goto bad2;
360 1.232 elad #endif /* PAX_SEGVGUARD */
361 1.232 elad
362 1.55 cgd /* now we have the file, get the exec header */
363 1.74 christos error = vn_rdwr(UIO_READ, vp, epp->ep_hdr, epp->ep_hdrlen, 0,
364 1.223 ad UIO_SYSSPACE, 0, l->l_cred, &resid, NULL);
365 1.74 christos if (error)
366 1.55 cgd goto bad2;
367 1.55 cgd epp->ep_hdrvalid = epp->ep_hdrlen - resid;
368 1.55 cgd
369 1.55 cgd /*
370 1.136 eeh * Set up default address space limits. Can be overridden
371 1.136 eeh * by individual exec packages.
372 1.183 junyoung *
373 1.235 rillig * XXX probably should be all done in the exec packages.
374 1.136 eeh */
375 1.136 eeh epp->ep_vm_minaddr = VM_MIN_ADDRESS;
376 1.136 eeh epp->ep_vm_maxaddr = VM_MAXUSER_ADDRESS;
377 1.136 eeh /*
378 1.55 cgd * set up the vmcmds for creation of the process
379 1.55 cgd * address space
380 1.55 cgd */
381 1.55 cgd error = ENOEXEC;
382 1.244 dsl for (i = 0; i < nexecs; i++) {
383 1.68 cgd int newerror;
384 1.68 cgd
385 1.130 jdolecek epp->ep_esch = execsw[i];
386 1.212 christos newerror = (*execsw[i]->es_makecmds)(l, epp);
387 1.244 dsl
388 1.244 dsl if (!newerror) {
389 1.318 reinoud /* Seems ok: check that entry point is not too high */
390 1.323 reinoud if (epp->ep_entry > epp->ep_vm_maxaddr) {
391 1.322 reinoud #ifdef DIAGNOSTIC
392 1.329 reinoud printf("%s: rejecting %p due to "
393 1.331 christos "too high entry address (> %p)\n",
394 1.331 christos __func__, (void *)epp->ep_entry,
395 1.331 christos (void *)epp->ep_vm_maxaddr);
396 1.322 reinoud #endif
397 1.318 reinoud error = ENOEXEC;
398 1.318 reinoud break;
399 1.318 reinoud }
400 1.318 reinoud /* Seems ok: check that entry point is not too low */
401 1.323 reinoud if (epp->ep_entry < epp->ep_vm_minaddr) {
402 1.322 reinoud #ifdef DIAGNOSTIC
403 1.329 reinoud printf("%s: rejecting %p due to "
404 1.331 christos "too low entry address (< %p)\n",
405 1.331 christos __func__, (void *)epp->ep_entry,
406 1.331 christos (void *)epp->ep_vm_minaddr);
407 1.322 reinoud #endif
408 1.244 dsl error = ENOEXEC;
409 1.244 dsl break;
410 1.244 dsl }
411 1.244 dsl
412 1.244 dsl /* check limits */
413 1.244 dsl if ((epp->ep_tsize > MAXTSIZ) ||
414 1.244 dsl (epp->ep_dsize > (u_quad_t)l->l_proc->p_rlimit
415 1.244 dsl [RLIMIT_DATA].rlim_cur)) {
416 1.322 reinoud #ifdef DIAGNOSTIC
417 1.323 reinoud printf("%s: rejecting due to "
418 1.331 christos "limits (t=%llu > %llu || d=%llu > %llu)\n",
419 1.331 christos __func__,
420 1.331 christos (unsigned long long)epp->ep_tsize,
421 1.331 christos (unsigned long long)MAXTSIZ,
422 1.331 christos (unsigned long long)epp->ep_dsize,
423 1.332 christos (unsigned long long)
424 1.332 christos l->l_proc->p_rlimit[RLIMIT_DATA].rlim_cur);
425 1.322 reinoud #endif
426 1.244 dsl error = ENOMEM;
427 1.244 dsl break;
428 1.244 dsl }
429 1.244 dsl return 0;
430 1.244 dsl }
431 1.244 dsl
432 1.244 dsl if (epp->ep_emul_root != NULL) {
433 1.244 dsl vrele(epp->ep_emul_root);
434 1.244 dsl epp->ep_emul_root = NULL;
435 1.244 dsl }
436 1.244 dsl if (epp->ep_interp != NULL) {
437 1.244 dsl vrele(epp->ep_interp);
438 1.244 dsl epp->ep_interp = NULL;
439 1.244 dsl }
440 1.244 dsl
441 1.68 cgd /* make sure the first "interesting" error code is saved. */
442 1.244 dsl if (error == ENOEXEC)
443 1.68 cgd error = newerror;
444 1.124 jdolecek
445 1.244 dsl if (epp->ep_flags & EXEC_DESTR)
446 1.244 dsl /* Error from "#!" code, tidied up by recursive call */
447 1.55 cgd return error;
448 1.55 cgd }
449 1.55 cgd
450 1.249 pooka /* not found, error */
451 1.249 pooka
452 1.55 cgd /*
453 1.55 cgd * free any vmspace-creation commands,
454 1.55 cgd * and release their references
455 1.55 cgd */
456 1.55 cgd kill_vmcmds(&epp->ep_vmcmds);
457 1.55 cgd
458 1.55 cgd bad2:
459 1.55 cgd /*
460 1.99 wrstuden * close and release the vnode, restore the old one, free the
461 1.55 cgd * pathname buf, and punt.
462 1.55 cgd */
463 1.99 wrstuden vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
464 1.254 pooka VOP_CLOSE(vp, FREAD, l->l_cred);
465 1.99 wrstuden vput(vp);
466 1.55 cgd return error;
467 1.55 cgd
468 1.55 cgd bad1:
469 1.55 cgd /*
470 1.55 cgd * free the namei pathname buffer, and put the vnode
471 1.55 cgd * (which we don't yet have open).
472 1.55 cgd */
473 1.77 cgd vput(vp); /* was still locked */
474 1.55 cgd return error;
475 1.55 cgd }
476 1.55 cgd
477 1.188 chs #ifdef __MACHINE_STACK_GROWS_UP
478 1.188 chs #define STACK_PTHREADSPACE NBPG
479 1.188 chs #else
480 1.188 chs #define STACK_PTHREADSPACE 0
481 1.188 chs #endif
482 1.188 chs
483 1.204 cube static int
484 1.204 cube execve_fetch_element(char * const *array, size_t index, char **value)
485 1.204 cube {
486 1.204 cube return copyin(array + index, value, sizeof(*value));
487 1.204 cube }
488 1.204 cube
489 1.55 cgd /*
490 1.55 cgd * exec system call
491 1.55 cgd */
492 1.75 christos int
493 1.258 dsl sys_execve(struct lwp *l, const struct sys_execve_args *uap, register_t *retval)
494 1.71 thorpej {
495 1.258 dsl /* {
496 1.138 lukem syscallarg(const char *) path;
497 1.138 lukem syscallarg(char * const *) argp;
498 1.138 lukem syscallarg(char * const *) envp;
499 1.258 dsl } */
500 1.204 cube
501 1.204 cube return execve1(l, SCARG(uap, path), SCARG(uap, argp),
502 1.204 cube SCARG(uap, envp), execve_fetch_element);
503 1.204 cube }
504 1.204 cube
505 1.317 manu int
506 1.317 manu sys_fexecve(struct lwp *l, const struct sys_fexecve_args *uap,
507 1.317 manu register_t *retval)
508 1.317 manu {
509 1.317 manu /* {
510 1.317 manu syscallarg(int) fd;
511 1.317 manu syscallarg(char * const *) argp;
512 1.317 manu syscallarg(char * const *) envp;
513 1.317 manu } */
514 1.317 manu
515 1.317 manu return ENOSYS;
516 1.317 manu }
517 1.317 manu
518 1.282 ad /*
519 1.282 ad * Load modules to try and execute an image that we do not understand.
520 1.282 ad * If no execsw entries are present, we load those likely to be needed
521 1.282 ad * in order to run native images only. Otherwise, we autoload all
522 1.282 ad * possible modules that could let us run the binary. XXX lame
523 1.282 ad */
524 1.282 ad static void
525 1.282 ad exec_autoload(void)
526 1.282 ad {
527 1.282 ad #ifdef MODULAR
528 1.282 ad static const char * const native[] = {
529 1.282 ad "exec_elf32",
530 1.282 ad "exec_elf64",
531 1.282 ad "exec_script",
532 1.282 ad NULL
533 1.282 ad };
534 1.282 ad static const char * const compat[] = {
535 1.282 ad "exec_elf32",
536 1.282 ad "exec_elf64",
537 1.282 ad "exec_script",
538 1.282 ad "exec_aout",
539 1.282 ad "exec_coff",
540 1.282 ad "exec_ecoff",
541 1.282 ad "compat_aoutm68k",
542 1.282 ad "compat_freebsd",
543 1.282 ad "compat_ibcs2",
544 1.282 ad "compat_linux",
545 1.282 ad "compat_linux32",
546 1.282 ad "compat_netbsd32",
547 1.282 ad "compat_sunos",
548 1.282 ad "compat_sunos32",
549 1.282 ad "compat_svr4",
550 1.282 ad "compat_svr4_32",
551 1.282 ad "compat_ultrix",
552 1.282 ad NULL
553 1.282 ad };
554 1.282 ad char const * const *list;
555 1.282 ad int i;
556 1.282 ad
557 1.282 ad list = (nexecs == 0 ? native : compat);
558 1.282 ad for (i = 0; list[i] != NULL; i++) {
559 1.282 ad if (module_autoload(list[i], MODULE_CLASS_MISC) != 0) {
560 1.282 ad continue;
561 1.282 ad }
562 1.282 ad yield();
563 1.282 ad }
564 1.282 ad #endif
565 1.282 ad }
566 1.282 ad
567 1.337 martin static int
568 1.337 martin execve_loadvm(struct lwp *l, const char *path, char * const *args,
569 1.337 martin char * const *envs, execve_fetch_element_t fetch_element,
570 1.337 martin struct execve_data * restrict data)
571 1.204 cube {
572 1.153 thorpej int error;
573 1.164 thorpej struct proc *p;
574 1.138 lukem char *dp, *sp;
575 1.248 christos size_t i, len;
576 1.265 yamt struct exec_fakearg *tmpfap;
577 1.282 ad u_int modgen;
578 1.337 martin
579 1.337 martin KASSERT(data != NULL);
580 1.55 cgd
581 1.237 ad p = l->l_proc;
582 1.282 ad modgen = 0;
583 1.164 thorpej
584 1.294 darran SDT_PROBE(proc,,,exec, path, 0, 0, 0, 0);
585 1.294 darran
586 1.149 christos /*
587 1.269 christos * Check if we have exceeded our number of processes limit.
588 1.269 christos * This is so that we handle the case where a root daemon
589 1.269 christos * forked, ran setuid to become the desired user and is trying
590 1.269 christos * to exec. The obvious place to do the reference counting check
591 1.269 christos * is setuid(), but we don't do the reference counting check there
592 1.269 christos * like other OS's do because then all the programs that use setuid()
593 1.269 christos * must be modified to check the return code of setuid() and exit().
594 1.269 christos * It is dangerous to make setuid() fail, because it fails open and
595 1.269 christos * the program will continue to run as root. If we make it succeed
596 1.269 christos * and return an error code, again we are not enforcing the limit.
597 1.269 christos * The best place to enforce the limit is here, when the process tries
598 1.269 christos * to execute a new image, because eventually the process will need
599 1.269 christos * to call exec in order to do something useful.
600 1.269 christos */
601 1.282 ad retry:
602 1.347 elad if (p->p_flag & PK_SUGID) {
603 1.347 elad if (kauth_authorize_process(l->l_cred, KAUTH_PROCESS_RLIMIT,
604 1.347 elad p, KAUTH_ARG(KAUTH_REQ_PROCESS_RLIMIT_BYPASS),
605 1.347 elad &p->p_rlimit[RLIMIT_NPROC],
606 1.347 elad KAUTH_ARG(RLIMIT_NPROC)) != 0 &&
607 1.347 elad chgproccnt(kauth_cred_getuid(l->l_cred), 0) >
608 1.347 elad p->p_rlimit[RLIMIT_NPROC].rlim_cur)
609 1.269 christos return EAGAIN;
610 1.347 elad }
611 1.269 christos
612 1.269 christos /*
613 1.237 ad * Drain existing references and forbid new ones. The process
614 1.237 ad * should be left alone until we're done here. This is necessary
615 1.237 ad * to avoid race conditions - e.g. in ptrace() - that might allow
616 1.237 ad * a local user to illicitly obtain elevated privileges.
617 1.237 ad */
618 1.252 ad rw_enter(&p->p_reflock, RW_WRITER);
619 1.149 christos
620 1.55 cgd /*
621 1.129 jdolecek * Init the namei data to point the file user's program name.
622 1.129 jdolecek * This is done here rather than in check_exec(), so that it's
623 1.129 jdolecek * possible to override this settings if any of makecmd/probe
624 1.129 jdolecek * functions call check_exec() recursively - for example,
625 1.129 jdolecek * see exec_script_makecmds().
626 1.129 jdolecek */
627 1.337 martin error = pathbuf_copyin(path, &data->ed_pathbuf);
628 1.248 christos if (error) {
629 1.312 christos DPRINTF(("%s: pathbuf_copyin path @%p %d\n", __func__,
630 1.312 christos path, error));
631 1.200 elad goto clrflg;
632 1.248 christos }
633 1.337 martin data->ed_pathstring = pathbuf_stringcopy_get(data->ed_pathbuf);
634 1.337 martin
635 1.337 martin data->ed_resolvedpathbuf = PNBUF_GET();
636 1.295 dholland #ifdef DIAGNOSTIC
637 1.337 martin strcpy(data->ed_resolvedpathbuf, "/wrong");
638 1.295 dholland #endif
639 1.55 cgd
640 1.55 cgd /*
641 1.55 cgd * initialize the fields of the exec package.
642 1.55 cgd */
643 1.337 martin data->ed_pack.ep_name = path;
644 1.337 martin data->ed_pack.ep_kname = data->ed_pathstring;
645 1.337 martin data->ed_pack.ep_resolvedname = data->ed_resolvedpathbuf;
646 1.337 martin data->ed_pack.ep_hdr = kmem_alloc(exec_maxhdrsz, KM_SLEEP);
647 1.337 martin data->ed_pack.ep_hdrlen = exec_maxhdrsz;
648 1.337 martin data->ed_pack.ep_hdrvalid = 0;
649 1.337 martin data->ed_pack.ep_emul_arg = NULL;
650 1.337 martin data->ed_pack.ep_emul_arg_free = NULL;
651 1.337 martin data->ed_pack.ep_vmcmds.evs_cnt = 0;
652 1.337 martin data->ed_pack.ep_vmcmds.evs_used = 0;
653 1.337 martin data->ed_pack.ep_vap = &data->ed_attr;
654 1.337 martin data->ed_pack.ep_flags = 0;
655 1.337 martin data->ed_pack.ep_emul_root = NULL;
656 1.337 martin data->ed_pack.ep_interp = NULL;
657 1.337 martin data->ed_pack.ep_esch = NULL;
658 1.337 martin data->ed_pack.ep_pax_flags = 0;
659 1.55 cgd
660 1.237 ad rw_enter(&exec_lock, RW_READER);
661 1.130 jdolecek
662 1.55 cgd /* see if we can run it. */
663 1.337 martin if ((error = check_exec(l, &data->ed_pack, data->ed_pathbuf)) != 0) {
664 1.261 xtraeme if (error != ENOENT) {
665 1.312 christos DPRINTF(("%s: check exec failed %d\n",
666 1.312 christos __func__, error));
667 1.261 xtraeme }
668 1.55 cgd goto freehdr;
669 1.248 christos }
670 1.55 cgd
671 1.55 cgd /* XXX -- THE FOLLOWING SECTION NEEDS MAJOR CLEANUP */
672 1.55 cgd
673 1.55 cgd /* allocate an argument buffer */
674 1.337 martin data->ed_argp = pool_get(&exec_pool, PR_WAITOK);
675 1.337 martin KASSERT(data->ed_argp != NULL);
676 1.337 martin dp = data->ed_argp;
677 1.337 martin data->ed_argc = 0;
678 1.55 cgd
679 1.55 cgd /* copy the fake args list, if there's one, freeing it as we go */
680 1.337 martin if (data->ed_pack.ep_flags & EXEC_HASARGL) {
681 1.337 martin tmpfap = data->ed_pack.ep_fa;
682 1.265 yamt while (tmpfap->fa_arg != NULL) {
683 1.265 yamt const char *cp;
684 1.55 cgd
685 1.265 yamt cp = tmpfap->fa_arg;
686 1.55 cgd while (*cp)
687 1.55 cgd *dp++ = *cp++;
688 1.276 ad *dp++ = '\0';
689 1.290 dsl ktrexecarg(tmpfap->fa_arg, cp - tmpfap->fa_arg);
690 1.55 cgd
691 1.265 yamt kmem_free(tmpfap->fa_arg, tmpfap->fa_len);
692 1.337 martin tmpfap++; data->ed_argc++;
693 1.55 cgd }
694 1.337 martin kmem_free(data->ed_pack.ep_fa, data->ed_pack.ep_fa_len);
695 1.337 martin data->ed_pack.ep_flags &= ~EXEC_HASARGL;
696 1.55 cgd }
697 1.55 cgd
698 1.55 cgd /* Now get argv & environment */
699 1.204 cube if (args == NULL) {
700 1.312 christos DPRINTF(("%s: null args\n", __func__));
701 1.55 cgd error = EINVAL;
702 1.55 cgd goto bad;
703 1.55 cgd }
704 1.204 cube /* 'i' will index the argp/envp element to be retrieved */
705 1.204 cube i = 0;
706 1.337 martin if (data->ed_pack.ep_flags & EXEC_SKIPARG)
707 1.204 cube i++;
708 1.55 cgd
709 1.55 cgd while (1) {
710 1.337 martin len = data->ed_argp + ARG_MAX - dp;
711 1.248 christos if ((error = (*fetch_element)(args, i, &sp)) != 0) {
712 1.312 christos DPRINTF(("%s: fetch_element args %d\n",
713 1.313 jakllsch __func__, error));
714 1.55 cgd goto bad;
715 1.248 christos }
716 1.55 cgd if (!sp)
717 1.55 cgd break;
718 1.74 christos if ((error = copyinstr(sp, dp, len, &len)) != 0) {
719 1.312 christos DPRINTF(("%s: copyinstr args %d\n", __func__, error));
720 1.55 cgd if (error == ENAMETOOLONG)
721 1.55 cgd error = E2BIG;
722 1.55 cgd goto bad;
723 1.55 cgd }
724 1.247 ad ktrexecarg(dp, len - 1);
725 1.55 cgd dp += len;
726 1.204 cube i++;
727 1.337 martin data->ed_argc++;
728 1.55 cgd }
729 1.55 cgd
730 1.337 martin data->ed_envc = 0;
731 1.74 christos /* environment need not be there */
732 1.204 cube if (envs != NULL) {
733 1.204 cube i = 0;
734 1.55 cgd while (1) {
735 1.337 martin len = data->ed_argp + ARG_MAX - dp;
736 1.248 christos if ((error = (*fetch_element)(envs, i, &sp)) != 0) {
737 1.312 christos DPRINTF(("%s: fetch_element env %d\n",
738 1.312 christos __func__, error));
739 1.55 cgd goto bad;
740 1.248 christos }
741 1.55 cgd if (!sp)
742 1.55 cgd break;
743 1.74 christos if ((error = copyinstr(sp, dp, len, &len)) != 0) {
744 1.312 christos DPRINTF(("%s: copyinstr env %d\n",
745 1.312 christos __func__, error));
746 1.55 cgd if (error == ENAMETOOLONG)
747 1.55 cgd error = E2BIG;
748 1.55 cgd goto bad;
749 1.55 cgd }
750 1.337 martin
751 1.247 ad ktrexecenv(dp, len - 1);
752 1.55 cgd dp += len;
753 1.204 cube i++;
754 1.337 martin data->ed_envc++;
755 1.55 cgd }
756 1.55 cgd }
757 1.61 mycroft
758 1.61 mycroft dp = (char *) ALIGN(dp);
759 1.55 cgd
760 1.337 martin data->ed_szsigcode = data->ed_pack.ep_esch->es_emul->e_esigcode -
761 1.337 martin data->ed_pack.ep_esch->es_emul->e_sigcode;
762 1.65 fvdl
763 1.267 dsl #ifdef __MACHINE_STACK_GROWS_UP
764 1.267 dsl /* See big comment lower down */
765 1.267 dsl #define RTLD_GAP 32
766 1.267 dsl #else
767 1.267 dsl #define RTLD_GAP 0
768 1.267 dsl #endif
769 1.267 dsl
770 1.55 cgd /* Now check if args & environ fit into new stack */
771 1.337 martin if (data->ed_pack.ep_flags & EXEC_32) {
772 1.337 martin data->ed_ps_strings_sz = sizeof(struct ps_strings32);
773 1.337 martin len = ((data->ed_argc + data->ed_envc + 2 +
774 1.337 martin data->ed_pack.ep_esch->es_arglen) *
775 1.267 dsl sizeof(int) + sizeof(int) + dp + RTLD_GAP +
776 1.337 martin data->ed_szsigcode + data->ed_ps_strings_sz + STACK_PTHREADSPACE)
777 1.337 martin - data->ed_argp;
778 1.311 joerg } else {
779 1.337 martin data->ed_ps_strings_sz = sizeof(struct ps_strings);
780 1.337 martin len = ((data->ed_argc + data->ed_envc + 2 +
781 1.337 martin data->ed_pack.ep_esch->es_arglen) *
782 1.267 dsl sizeof(char *) + sizeof(int) + dp + RTLD_GAP +
783 1.337 martin data->ed_szsigcode + data->ed_ps_strings_sz + STACK_PTHREADSPACE)
784 1.337 martin - data->ed_argp;
785 1.311 joerg }
786 1.67 christos
787 1.262 elad #ifdef PAX_ASLR
788 1.262 elad if (pax_aslr_active(l))
789 1.330 tls len += (cprng_fast32() % PAGE_SIZE);
790 1.262 elad #endif /* PAX_ASLR */
791 1.262 elad
792 1.334 christos /* make the stack "safely" aligned */
793 1.335 christos len = STACK_LEN_ALIGN(len, STACK_ALIGNBYTES);
794 1.55 cgd
795 1.337 martin if (len > data->ed_pack.ep_ssize) {
796 1.337 martin /* in effect, compare to initial limit */
797 1.312 christos DPRINTF(("%s: stack limit exceeded %zu\n", __func__, len));
798 1.55 cgd goto bad;
799 1.55 cgd }
800 1.337 martin /* adjust "active stack depth" for process VSZ */
801 1.337 martin data->ed_pack.ep_ssize = len;
802 1.337 martin
803 1.337 martin return 0;
804 1.337 martin
805 1.337 martin bad:
806 1.337 martin /* free the vmspace-creation commands, and release their references */
807 1.337 martin kill_vmcmds(&data->ed_pack.ep_vmcmds);
808 1.337 martin /* kill any opened file descriptor, if necessary */
809 1.337 martin if (data->ed_pack.ep_flags & EXEC_HASFD) {
810 1.337 martin data->ed_pack.ep_flags &= ~EXEC_HASFD;
811 1.337 martin fd_close(data->ed_pack.ep_fd);
812 1.337 martin }
813 1.337 martin /* close and put the exec'd file */
814 1.337 martin vn_lock(data->ed_pack.ep_vp, LK_EXCLUSIVE | LK_RETRY);
815 1.337 martin VOP_CLOSE(data->ed_pack.ep_vp, FREAD, l->l_cred);
816 1.337 martin vput(data->ed_pack.ep_vp);
817 1.337 martin pool_put(&exec_pool, data->ed_argp);
818 1.337 martin
819 1.337 martin freehdr:
820 1.337 martin kmem_free(data->ed_pack.ep_hdr, data->ed_pack.ep_hdrlen);
821 1.337 martin if (data->ed_pack.ep_emul_root != NULL)
822 1.337 martin vrele(data->ed_pack.ep_emul_root);
823 1.337 martin if (data->ed_pack.ep_interp != NULL)
824 1.337 martin vrele(data->ed_pack.ep_interp);
825 1.337 martin
826 1.337 martin rw_exit(&exec_lock);
827 1.337 martin
828 1.337 martin pathbuf_stringcopy_put(data->ed_pathbuf, data->ed_pathstring);
829 1.337 martin pathbuf_destroy(data->ed_pathbuf);
830 1.337 martin PNBUF_PUT(data->ed_resolvedpathbuf);
831 1.337 martin
832 1.337 martin clrflg:
833 1.337 martin rw_exit(&p->p_reflock);
834 1.337 martin
835 1.337 martin if (modgen != module_gen && error == ENOEXEC) {
836 1.337 martin modgen = module_gen;
837 1.337 martin exec_autoload();
838 1.337 martin goto retry;
839 1.337 martin }
840 1.337 martin
841 1.337 martin SDT_PROBE(proc,,,exec_failure, error, 0, 0, 0, 0);
842 1.337 martin return error;
843 1.337 martin }
844 1.337 martin
845 1.348 martin static void
846 1.348 martin execve_free_data(struct execve_data *data)
847 1.348 martin {
848 1.348 martin
849 1.348 martin /* free the vmspace-creation commands, and release their references */
850 1.348 martin kill_vmcmds(&data->ed_pack.ep_vmcmds);
851 1.348 martin /* kill any opened file descriptor, if necessary */
852 1.348 martin if (data->ed_pack.ep_flags & EXEC_HASFD) {
853 1.348 martin data->ed_pack.ep_flags &= ~EXEC_HASFD;
854 1.348 martin fd_close(data->ed_pack.ep_fd);
855 1.348 martin }
856 1.348 martin
857 1.348 martin /* close and put the exec'd file */
858 1.348 martin vn_lock(data->ed_pack.ep_vp, LK_EXCLUSIVE | LK_RETRY);
859 1.348 martin VOP_CLOSE(data->ed_pack.ep_vp, FREAD, curlwp->l_cred);
860 1.348 martin vput(data->ed_pack.ep_vp);
861 1.348 martin pool_put(&exec_pool, data->ed_argp);
862 1.348 martin
863 1.348 martin kmem_free(data->ed_pack.ep_hdr, data->ed_pack.ep_hdrlen);
864 1.348 martin if (data->ed_pack.ep_emul_root != NULL)
865 1.348 martin vrele(data->ed_pack.ep_emul_root);
866 1.348 martin if (data->ed_pack.ep_interp != NULL)
867 1.348 martin vrele(data->ed_pack.ep_interp);
868 1.348 martin
869 1.348 martin pathbuf_stringcopy_put(data->ed_pathbuf, data->ed_pathstring);
870 1.348 martin pathbuf_destroy(data->ed_pathbuf);
871 1.348 martin PNBUF_PUT(data->ed_resolvedpathbuf);
872 1.348 martin }
873 1.348 martin
874 1.337 martin static int
875 1.348 martin execve_runproc(struct lwp *l, struct execve_data * restrict data,
876 1.348 martin bool no_local_exec_lock, bool is_spawn)
877 1.337 martin {
878 1.337 martin int error = 0;
879 1.337 martin struct proc *p;
880 1.337 martin size_t i;
881 1.337 martin char *stack, *dp;
882 1.337 martin const char *commandname;
883 1.337 martin struct ps_strings32 arginfo32;
884 1.337 martin struct exec_vmcmd *base_vcp;
885 1.337 martin void *aip;
886 1.337 martin struct vmspace *vm;
887 1.337 martin ksiginfo_t ksi;
888 1.337 martin ksiginfoq_t kq;
889 1.337 martin
890 1.348 martin /*
891 1.348 martin * In case of a posix_spawn operation, the child doing the exec
892 1.348 martin * might not hold the reader lock on exec_lock, but the parent
893 1.348 martin * will do this instead.
894 1.348 martin */
895 1.348 martin KASSERT(no_local_exec_lock || rw_lock_held(&exec_lock));
896 1.337 martin KASSERT(data != NULL);
897 1.337 martin if (data == NULL)
898 1.337 martin return (EINVAL);
899 1.337 martin
900 1.337 martin p = l->l_proc;
901 1.348 martin if (no_local_exec_lock)
902 1.348 martin KASSERT(is_spawn);
903 1.337 martin
904 1.337 martin base_vcp = NULL;
905 1.337 martin
906 1.337 martin if (data->ed_pack.ep_flags & EXEC_32)
907 1.337 martin aip = &arginfo32;
908 1.337 martin else
909 1.337 martin aip = &data->ed_arginfo;
910 1.55 cgd
911 1.237 ad /* Get rid of other LWPs. */
912 1.340 rmind if (p->p_nlwps > 1) {
913 1.272 ad mutex_enter(p->p_lock);
914 1.237 ad exit_lwps(l);
915 1.272 ad mutex_exit(p->p_lock);
916 1.237 ad }
917 1.164 thorpej KDASSERT(p->p_nlwps == 1);
918 1.164 thorpej
919 1.253 ad /* Destroy any lwpctl info. */
920 1.253 ad if (p->p_lwpctl != NULL)
921 1.253 ad lwp_ctl_exit();
922 1.253 ad
923 1.164 thorpej /* Remove POSIX timers */
924 1.164 thorpej timers_free(p, TIMERS_POSIX);
925 1.164 thorpej
926 1.86 thorpej /*
927 1.86 thorpej * Do whatever is necessary to prepare the address space
928 1.86 thorpej * for remapping. Note that this might replace the current
929 1.86 thorpej * vmspace with another!
930 1.86 thorpej */
931 1.348 martin if (is_spawn)
932 1.348 martin uvmspace_spawn(l, data->ed_pack.ep_vm_minaddr,
933 1.348 martin data->ed_pack.ep_vm_maxaddr);
934 1.348 martin else
935 1.348 martin uvmspace_exec(l, data->ed_pack.ep_vm_minaddr,
936 1.348 martin data->ed_pack.ep_vm_maxaddr);
937 1.55 cgd
938 1.186 chs /* record proc's vnode, for use by procfs and others */
939 1.186 chs if (p->p_textvp)
940 1.186 chs vrele(p->p_textvp);
941 1.337 martin vref(data->ed_pack.ep_vp);
942 1.337 martin p->p_textvp = data->ed_pack.ep_vp;
943 1.186 chs
944 1.55 cgd /* Now map address space */
945 1.86 thorpej vm = p->p_vmspace;
946 1.337 martin vm->vm_taddr = (void *)data->ed_pack.ep_taddr;
947 1.337 martin vm->vm_tsize = btoc(data->ed_pack.ep_tsize);
948 1.337 martin vm->vm_daddr = (void*)data->ed_pack.ep_daddr;
949 1.337 martin vm->vm_dsize = btoc(data->ed_pack.ep_dsize);
950 1.337 martin vm->vm_ssize = btoc(data->ed_pack.ep_ssize);
951 1.288 mrg vm->vm_issize = 0;
952 1.337 martin vm->vm_maxsaddr = (void *)data->ed_pack.ep_maxsaddr;
953 1.337 martin vm->vm_minsaddr = (void *)data->ed_pack.ep_minsaddr;
954 1.55 cgd
955 1.260 christos #ifdef PAX_ASLR
956 1.260 christos pax_aslr_init(l, vm);
957 1.260 christos #endif /* PAX_ASLR */
958 1.260 christos
959 1.55 cgd /* create the new process's VM space by running the vmcmds */
960 1.55 cgd #ifdef DIAGNOSTIC
961 1.337 martin if (data->ed_pack.ep_vmcmds.evs_used == 0)
962 1.312 christos panic("%s: no vmcmds", __func__);
963 1.55 cgd #endif
964 1.326 reinoud
965 1.326 reinoud #ifdef DEBUG_EXEC
966 1.326 reinoud {
967 1.326 reinoud size_t j;
968 1.337 martin struct exec_vmcmd *vp = &data->ed_pack.ep_vmcmds.evs_cmds[0];
969 1.337 martin DPRINTF(("vmcmds %u\n", data->ed_pack.ep_vmcmds.evs_used));
970 1.337 martin for (j = 0; j < data->ed_pack.ep_vmcmds.evs_used; j++) {
971 1.328 reinoud DPRINTF(("vmcmd[%zu] = vmcmd_map_%s %#"
972 1.326 reinoud PRIxVADDR"/%#"PRIxVSIZE" fd@%#"
973 1.326 reinoud PRIxVSIZE" prot=0%o flags=%d\n", j,
974 1.326 reinoud vp[j].ev_proc == vmcmd_map_pagedvn ?
975 1.326 reinoud "pagedvn" :
976 1.326 reinoud vp[j].ev_proc == vmcmd_map_readvn ?
977 1.326 reinoud "readvn" :
978 1.326 reinoud vp[j].ev_proc == vmcmd_map_zero ?
979 1.326 reinoud "zero" : "*unknown*",
980 1.326 reinoud vp[j].ev_addr, vp[j].ev_len,
981 1.326 reinoud vp[j].ev_offset, vp[j].ev_prot,
982 1.327 reinoud vp[j].ev_flags));
983 1.326 reinoud }
984 1.326 reinoud }
985 1.326 reinoud #endif /* DEBUG_EXEC */
986 1.326 reinoud
987 1.337 martin for (i = 0; i < data->ed_pack.ep_vmcmds.evs_used && !error; i++) {
988 1.55 cgd struct exec_vmcmd *vcp;
989 1.55 cgd
990 1.337 martin vcp = &data->ed_pack.ep_vmcmds.evs_cmds[i];
991 1.114 matt if (vcp->ev_flags & VMCMD_RELATIVE) {
992 1.114 matt #ifdef DIAGNOSTIC
993 1.114 matt if (base_vcp == NULL)
994 1.312 christos panic("%s: relative vmcmd with no base",
995 1.312 christos __func__);
996 1.114 matt if (vcp->ev_flags & VMCMD_BASE)
997 1.312 christos panic("%s: illegal base & relative vmcmd",
998 1.312 christos __func__);
999 1.114 matt #endif
1000 1.114 matt vcp->ev_addr += base_vcp->ev_addr;
1001 1.114 matt }
1002 1.212 christos error = (*vcp->ev_proc)(l, vcp);
1003 1.143 christos #ifdef DEBUG_EXEC
1004 1.111 matt if (error) {
1005 1.248 christos size_t j;
1006 1.337 martin struct exec_vmcmd *vp =
1007 1.337 martin &data->ed_pack.ep_vmcmds.evs_cmds[0];
1008 1.327 reinoud DPRINTF(("vmcmds %zu/%u, error %d\n", i,
1009 1.337 martin data->ed_pack.ep_vmcmds.evs_used, error));
1010 1.337 martin for (j = 0; j < data->ed_pack.ep_vmcmds.evs_used; j++) {
1011 1.327 reinoud DPRINTF(("vmcmd[%zu] = vmcmd_map_%s %#"
1012 1.310 christos PRIxVADDR"/%#"PRIxVSIZE" fd@%#"
1013 1.310 christos PRIxVSIZE" prot=0%o flags=%d\n", j,
1014 1.310 christos vp[j].ev_proc == vmcmd_map_pagedvn ?
1015 1.310 christos "pagedvn" :
1016 1.310 christos vp[j].ev_proc == vmcmd_map_readvn ?
1017 1.310 christos "readvn" :
1018 1.310 christos vp[j].ev_proc == vmcmd_map_zero ?
1019 1.310 christos "zero" : "*unknown*",
1020 1.310 christos vp[j].ev_addr, vp[j].ev_len,
1021 1.143 christos vp[j].ev_offset, vp[j].ev_prot,
1022 1.327 reinoud vp[j].ev_flags));
1023 1.326 reinoud if (j == i)
1024 1.327 reinoud DPRINTF((" ^--- failed\n"));
1025 1.326 reinoud }
1026 1.111 matt }
1027 1.143 christos #endif /* DEBUG_EXEC */
1028 1.114 matt if (vcp->ev_flags & VMCMD_BASE)
1029 1.114 matt base_vcp = vcp;
1030 1.55 cgd }
1031 1.55 cgd
1032 1.55 cgd /* free the vmspace-creation commands, and release their references */
1033 1.337 martin kill_vmcmds(&data->ed_pack.ep_vmcmds);
1034 1.55 cgd
1035 1.337 martin vn_lock(data->ed_pack.ep_vp, LK_EXCLUSIVE | LK_RETRY);
1036 1.337 martin VOP_CLOSE(data->ed_pack.ep_vp, FREAD, l->l_cred);
1037 1.337 martin vput(data->ed_pack.ep_vp);
1038 1.186 chs
1039 1.55 cgd /* if an error happened, deallocate and punt */
1040 1.111 matt if (error) {
1041 1.312 christos DPRINTF(("%s: vmcmd %zu failed: %d\n", __func__, i - 1, error));
1042 1.55 cgd goto exec_abort;
1043 1.111 matt }
1044 1.55 cgd
1045 1.55 cgd /* remember information about the process */
1046 1.337 martin data->ed_arginfo.ps_nargvstr = data->ed_argc;
1047 1.337 martin data->ed_arginfo.ps_nenvstr = data->ed_envc;
1048 1.55 cgd
1049 1.255 christos /* set command name & other accounting info */
1050 1.337 martin commandname = strrchr(data->ed_pack.ep_resolvedname, '/');
1051 1.295 dholland if (commandname != NULL) {
1052 1.295 dholland commandname++;
1053 1.295 dholland } else {
1054 1.337 martin commandname = data->ed_pack.ep_resolvedname;
1055 1.295 dholland }
1056 1.295 dholland i = min(strlen(commandname), MAXCOMLEN);
1057 1.295 dholland (void)memcpy(p->p_comm, commandname, i);
1058 1.255 christos p->p_comm[i] = '\0';
1059 1.255 christos
1060 1.255 christos dp = PNBUF_GET();
1061 1.255 christos /*
1062 1.255 christos * If the path starts with /, we don't need to do any work.
1063 1.255 christos * This handles the majority of the cases.
1064 1.255 christos * In the future perhaps we could canonicalize it?
1065 1.255 christos */
1066 1.337 martin if (data->ed_pathstring[0] == '/')
1067 1.337 martin (void)strlcpy(data->ed_pack.ep_path = dp, data->ed_pathstring,
1068 1.337 martin MAXPATHLEN);
1069 1.333 dholland #ifdef notyet
1070 1.255 christos /*
1071 1.255 christos * Although this works most of the time [since the entry was just
1072 1.255 christos * entered in the cache] we don't use it because it theoretically
1073 1.255 christos * can fail and it is not the cleanest interface, because there
1074 1.255 christos * could be races. When the namei cache is re-written, this can
1075 1.255 christos * be changed to use the appropriate function.
1076 1.255 christos */
1077 1.255 christos else if (!(error = vnode_to_path(dp, MAXPATHLEN, p->p_textvp, l, p)))
1078 1.337 martin data->ed_pack.ep_path = dp;
1079 1.255 christos #endif
1080 1.255 christos else {
1081 1.333 dholland #ifdef notyet
1082 1.255 christos printf("Cannot get path for pid %d [%s] (error %d)",
1083 1.255 christos (int)p->p_pid, p->p_comm, error);
1084 1.255 christos #endif
1085 1.337 martin data->ed_pack.ep_path = NULL;
1086 1.255 christos PNBUF_PUT(dp);
1087 1.255 christos }
1088 1.255 christos
1089 1.163 chs stack = (char *)STACK_ALLOC(STACK_GROW(vm->vm_minsaddr,
1090 1.337 martin STACK_PTHREADSPACE + data->ed_ps_strings_sz + data->ed_szsigcode),
1091 1.337 martin data->ed_pack.ep_ssize - (data->ed_ps_strings_sz + data->ed_szsigcode));
1092 1.267 dsl
1093 1.163 chs #ifdef __MACHINE_STACK_GROWS_UP
1094 1.163 chs /*
1095 1.163 chs * The copyargs call always copies into lower addresses
1096 1.163 chs * first, moving towards higher addresses, starting with
1097 1.183 junyoung * the stack pointer that we give. When the stack grows
1098 1.183 junyoung * down, this puts argc/argv/envp very shallow on the
1099 1.267 dsl * stack, right at the first user stack pointer.
1100 1.267 dsl * When the stack grows up, the situation is reversed.
1101 1.163 chs *
1102 1.163 chs * Normally, this is no big deal. But the ld_elf.so _rtld()
1103 1.183 junyoung * function expects to be called with a single pointer to
1104 1.183 junyoung * a region that has a few words it can stash values into,
1105 1.163 chs * followed by argc/argv/envp. When the stack grows down,
1106 1.163 chs * it's easy to decrement the stack pointer a little bit to
1107 1.163 chs * allocate the space for these few words and pass the new
1108 1.163 chs * stack pointer to _rtld. When the stack grows up, however,
1109 1.171 chs * a few words before argc is part of the signal trampoline, XXX
1110 1.163 chs * so we have a problem.
1111 1.163 chs *
1112 1.183 junyoung * Instead of changing how _rtld works, we take the easy way
1113 1.267 dsl * out and steal 32 bytes before we call copyargs.
1114 1.337 martin * This extra space was allowed for when 'pack.ep_ssize' was calculated.
1115 1.163 chs */
1116 1.267 dsl stack += RTLD_GAP;
1117 1.163 chs #endif /* __MACHINE_STACK_GROWS_UP */
1118 1.337 martin
1119 1.337 martin /* Now copy argc, args & environ to new stack */
1120 1.337 martin error = (*data->ed_pack.ep_esch->es_copyargs)(l, &data->ed_pack,
1121 1.337 martin &data->ed_arginfo, &stack, data->ed_argp);
1122 1.163 chs
1123 1.337 martin if (data->ed_pack.ep_path) {
1124 1.337 martin PNBUF_PUT(data->ed_pack.ep_path);
1125 1.337 martin data->ed_pack.ep_path = NULL;
1126 1.255 christos }
1127 1.144 christos if (error) {
1128 1.312 christos DPRINTF(("%s: copyargs failed %d\n", __func__, error));
1129 1.55 cgd goto exec_abort;
1130 1.111 matt }
1131 1.144 christos /* Move the stack back to original point */
1132 1.337 martin stack = (char *)STACK_GROW(vm->vm_minsaddr, data->ed_pack.ep_ssize);
1133 1.55 cgd
1134 1.121 eeh /* fill process ps_strings info */
1135 1.311 joerg p->p_psstrp = (vaddr_t)STACK_ALLOC(STACK_GROW(vm->vm_minsaddr,
1136 1.337 martin STACK_PTHREADSPACE), data->ed_ps_strings_sz);
1137 1.311 joerg
1138 1.337 martin if (data->ed_pack.ep_flags & EXEC_32) {
1139 1.337 martin arginfo32.ps_argvstr = (vaddr_t)data->ed_arginfo.ps_argvstr;
1140 1.337 martin arginfo32.ps_nargvstr = data->ed_arginfo.ps_nargvstr;
1141 1.337 martin arginfo32.ps_envstr = (vaddr_t)data->ed_arginfo.ps_envstr;
1142 1.337 martin arginfo32.ps_nenvstr = data->ed_arginfo.ps_nenvstr;
1143 1.311 joerg }
1144 1.121 eeh
1145 1.55 cgd /* copy out the process's ps_strings structure */
1146 1.337 martin if ((error = copyout(aip, (void *)p->p_psstrp, data->ed_ps_strings_sz))
1147 1.337 martin != 0) {
1148 1.312 christos DPRINTF(("%s: ps_strings copyout %p->%p size %zu failed\n",
1149 1.337 martin __func__, aip, (void *)p->p_psstrp, data->ed_ps_strings_sz));
1150 1.55 cgd goto exec_abort;
1151 1.111 matt }
1152 1.109 simonb
1153 1.307 pooka cwdexec(p);
1154 1.270 ad fd_closeexec(); /* handle close on exec */
1155 1.315 alnsn
1156 1.315 alnsn if (__predict_false(ktrace_on))
1157 1.315 alnsn fd_ktrexecfd();
1158 1.315 alnsn
1159 1.55 cgd execsigs(p); /* reset catched signals */
1160 1.183 junyoung
1161 1.164 thorpej l->l_ctxlink = NULL; /* reset ucontext link */
1162 1.55 cgd
1163 1.255 christos
1164 1.55 cgd p->p_acflag &= ~AFORK;
1165 1.272 ad mutex_enter(p->p_lock);
1166 1.238 pavel p->p_flag |= PK_EXEC;
1167 1.272 ad mutex_exit(p->p_lock);
1168 1.237 ad
1169 1.237 ad /*
1170 1.237 ad * Stop profiling.
1171 1.237 ad */
1172 1.237 ad if ((p->p_stflag & PST_PROFIL) != 0) {
1173 1.237 ad mutex_spin_enter(&p->p_stmutex);
1174 1.237 ad stopprofclock(p);
1175 1.237 ad mutex_spin_exit(&p->p_stmutex);
1176 1.237 ad }
1177 1.237 ad
1178 1.237 ad /*
1179 1.275 ad * It's OK to test PL_PPWAIT unlocked here, as other LWPs have
1180 1.237 ad * exited and exec()/exit() are the only places it will be cleared.
1181 1.237 ad */
1182 1.275 ad if ((p->p_lflag & PL_PPWAIT) != 0) {
1183 1.271 ad mutex_enter(proc_lock);
1184 1.308 pooka l->l_lwpctl = NULL; /* was on loan from blocked parent */
1185 1.275 ad p->p_lflag &= ~PL_PPWAIT;
1186 1.237 ad cv_broadcast(&p->p_pptr->p_waitcv);
1187 1.271 ad mutex_exit(proc_lock);
1188 1.55 cgd }
1189 1.55 cgd
1190 1.55 cgd /*
1191 1.237 ad * Deal with set[ug]id. MNT_NOSUID has already been used to disable
1192 1.237 ad * s[ug]id. It's OK to check for PSL_TRACED here as we have blocked
1193 1.237 ad * out additional references on the process for the moment.
1194 1.55 cgd */
1195 1.237 ad if ((p->p_slflag & PSL_TRACED) == 0 &&
1196 1.141 thorpej
1197 1.337 martin (((data->ed_attr.va_mode & S_ISUID) != 0 &&
1198 1.337 martin kauth_cred_geteuid(l->l_cred) != data->ed_attr.va_uid) ||
1199 1.141 thorpej
1200 1.337 martin ((data->ed_attr.va_mode & S_ISGID) != 0 &&
1201 1.337 martin kauth_cred_getegid(l->l_cred) != data->ed_attr.va_gid))) {
1202 1.141 thorpej /*
1203 1.141 thorpej * Mark the process as SUGID before we do
1204 1.141 thorpej * anything that might block.
1205 1.141 thorpej */
1206 1.237 ad proc_crmod_enter();
1207 1.240 thorpej proc_crmod_leave(NULL, NULL, true);
1208 1.152 christos
1209 1.152 christos /* Make sure file descriptors 0..2 are in use. */
1210 1.270 ad if ((error = fd_checkstd()) != 0) {
1211 1.312 christos DPRINTF(("%s: fdcheckstd failed %d\n",
1212 1.312 christos __func__, error));
1213 1.152 christos goto exec_abort;
1214 1.209 christos }
1215 1.141 thorpej
1216 1.220 ad /*
1217 1.220 ad * Copy the credential so other references don't see our
1218 1.220 ad * changes.
1219 1.220 ad */
1220 1.221 ad l->l_cred = kauth_cred_copy(l->l_cred);
1221 1.55 cgd #ifdef KTRACE
1222 1.55 cgd /*
1223 1.268 elad * If the persistent trace flag isn't set, turn off.
1224 1.55 cgd */
1225 1.237 ad if (p->p_tracep) {
1226 1.247 ad mutex_enter(&ktrace_lock);
1227 1.268 elad if (!(p->p_traceflag & KTRFAC_PERSISTENT))
1228 1.237 ad ktrderef(p);
1229 1.247 ad mutex_exit(&ktrace_lock);
1230 1.237 ad }
1231 1.55 cgd #endif
1232 1.337 martin if (data->ed_attr.va_mode & S_ISUID)
1233 1.337 martin kauth_cred_seteuid(l->l_cred, data->ed_attr.va_uid);
1234 1.337 martin if (data->ed_attr.va_mode & S_ISGID)
1235 1.337 martin kauth_cred_setegid(l->l_cred, data->ed_attr.va_gid);
1236 1.210 christos } else {
1237 1.221 ad if (kauth_cred_geteuid(l->l_cred) ==
1238 1.221 ad kauth_cred_getuid(l->l_cred) &&
1239 1.221 ad kauth_cred_getegid(l->l_cred) ==
1240 1.221 ad kauth_cred_getgid(l->l_cred))
1241 1.238 pavel p->p_flag &= ~PK_SUGID;
1242 1.210 christos }
1243 1.220 ad
1244 1.220 ad /*
1245 1.220 ad * Copy the credential so other references don't see our changes.
1246 1.220 ad * Test to see if this is necessary first, since in the common case
1247 1.220 ad * we won't need a private reference.
1248 1.220 ad */
1249 1.221 ad if (kauth_cred_geteuid(l->l_cred) != kauth_cred_getsvuid(l->l_cred) ||
1250 1.221 ad kauth_cred_getegid(l->l_cred) != kauth_cred_getsvgid(l->l_cred)) {
1251 1.221 ad l->l_cred = kauth_cred_copy(l->l_cred);
1252 1.221 ad kauth_cred_setsvuid(l->l_cred, kauth_cred_geteuid(l->l_cred));
1253 1.221 ad kauth_cred_setsvgid(l->l_cred, kauth_cred_getegid(l->l_cred));
1254 1.220 ad }
1255 1.155 gmcgarry
1256 1.221 ad /* Update the master credentials. */
1257 1.227 ad if (l->l_cred != p->p_cred) {
1258 1.227 ad kauth_cred_t ocred;
1259 1.227 ad
1260 1.227 ad kauth_cred_hold(l->l_cred);
1261 1.272 ad mutex_enter(p->p_lock);
1262 1.227 ad ocred = p->p_cred;
1263 1.227 ad p->p_cred = l->l_cred;
1264 1.272 ad mutex_exit(p->p_lock);
1265 1.227 ad kauth_cred_free(ocred);
1266 1.227 ad }
1267 1.221 ad
1268 1.155 gmcgarry #if defined(__HAVE_RAS)
1269 1.155 gmcgarry /*
1270 1.155 gmcgarry * Remove all RASs from the address space.
1271 1.155 gmcgarry */
1272 1.251 ad ras_purgeall();
1273 1.155 gmcgarry #endif
1274 1.107 fvdl
1275 1.107 fvdl doexechooks(p);
1276 1.55 cgd
1277 1.55 cgd /* setup new registers and do misc. setup. */
1278 1.337 martin (*data->ed_pack.ep_esch->es_emul->e_setregs)(l, &data->ed_pack,
1279 1.337 martin (vaddr_t)stack);
1280 1.337 martin if (data->ed_pack.ep_esch->es_setregs)
1281 1.337 martin (*data->ed_pack.ep_esch->es_setregs)(l, &data->ed_pack,
1282 1.337 martin (vaddr_t)stack);
1283 1.55 cgd
1284 1.309 joerg /* Provide a consistent LWP private setting */
1285 1.309 joerg (void)lwp_setprivate(l, NULL);
1286 1.309 joerg
1287 1.316 matt /* Discard all PCU state; need to start fresh */
1288 1.316 matt pcu_discard_all(l);
1289 1.316 matt
1290 1.171 chs /* map the process's signal trampoline code */
1291 1.337 martin if ((error = exec_sigcode_map(p, data->ed_pack.ep_esch->es_emul)) != 0) {
1292 1.312 christos DPRINTF(("%s: map sigcode failed %d\n", __func__, error));
1293 1.171 chs goto exec_abort;
1294 1.209 christos }
1295 1.171 chs
1296 1.337 martin pool_put(&exec_pool, data->ed_argp);
1297 1.276 ad
1298 1.276 ad /* notify others that we exec'd */
1299 1.276 ad KNOTE(&p->p_klist, NOTE_EXEC);
1300 1.276 ad
1301 1.337 martin kmem_free(data->ed_pack.ep_hdr, data->ed_pack.ep_hdrlen);
1302 1.122 jdolecek
1303 1.339 martin SDT_PROBE(proc,,,exec_success, data->ed_pack.ep_name, 0, 0, 0, 0);
1304 1.294 darran
1305 1.244 dsl /* The emulation root will usually have been found when we looked
1306 1.244 dsl * for the elf interpreter (or similar), if not look now. */
1307 1.337 martin if (data->ed_pack.ep_esch->es_emul->e_path != NULL &&
1308 1.337 martin data->ed_pack.ep_emul_root == NULL)
1309 1.337 martin emul_find_root(l, &data->ed_pack);
1310 1.244 dsl
1311 1.244 dsl /* Any old emulation root got removed by fdcloseexec */
1312 1.259 ad rw_enter(&p->p_cwdi->cwdi_lock, RW_WRITER);
1313 1.337 martin p->p_cwdi->cwdi_edir = data->ed_pack.ep_emul_root;
1314 1.259 ad rw_exit(&p->p_cwdi->cwdi_lock);
1315 1.337 martin data->ed_pack.ep_emul_root = NULL;
1316 1.337 martin if (data->ed_pack.ep_interp != NULL)
1317 1.337 martin vrele(data->ed_pack.ep_interp);
1318 1.244 dsl
1319 1.122 jdolecek /*
1320 1.194 peter * Call emulation specific exec hook. This can setup per-process
1321 1.122 jdolecek * p->p_emuldata or do any other per-process stuff an emulation needs.
1322 1.122 jdolecek *
1323 1.122 jdolecek * If we are executing process of different emulation than the
1324 1.122 jdolecek * original forked process, call e_proc_exit() of the old emulation
1325 1.122 jdolecek * first, then e_proc_exec() of new emulation. If the emulation is
1326 1.122 jdolecek * same, the exec hook code should deallocate any old emulation
1327 1.122 jdolecek * resources held previously by this process.
1328 1.122 jdolecek */
1329 1.124 jdolecek if (p->p_emul && p->p_emul->e_proc_exit
1330 1.337 martin && p->p_emul != data->ed_pack.ep_esch->es_emul)
1331 1.122 jdolecek (*p->p_emul->e_proc_exit)(p);
1332 1.122 jdolecek
1333 1.123 jdolecek /*
1334 1.299 chs * This is now LWP 1.
1335 1.299 chs */
1336 1.299 chs mutex_enter(p->p_lock);
1337 1.299 chs p->p_nlwpid = 1;
1338 1.299 chs l->l_lid = 1;
1339 1.299 chs mutex_exit(p->p_lock);
1340 1.299 chs
1341 1.299 chs /*
1342 1.123 jdolecek * Call exec hook. Emulation code may NOT store reference to anything
1343 1.123 jdolecek * from &pack.
1344 1.123 jdolecek */
1345 1.337 martin if (data->ed_pack.ep_esch->es_emul->e_proc_exec)
1346 1.337 martin (*data->ed_pack.ep_esch->es_emul->e_proc_exec)(p, &data->ed_pack);
1347 1.122 jdolecek
1348 1.122 jdolecek /* update p_emul, the old value is no longer needed */
1349 1.337 martin p->p_emul = data->ed_pack.ep_esch->es_emul;
1350 1.148 thorpej
1351 1.148 thorpej /* ...and the same for p_execsw */
1352 1.337 martin p->p_execsw = data->ed_pack.ep_esch;
1353 1.148 thorpej
1354 1.133 mycroft #ifdef __HAVE_SYSCALL_INTERN
1355 1.133 mycroft (*p->p_emul->e_syscall_intern)(p);
1356 1.133 mycroft #endif
1357 1.247 ad ktremul();
1358 1.85 mycroft
1359 1.252 ad /* Allow new references from the debugger/procfs. */
1360 1.341 martin rw_exit(&p->p_reflock);
1361 1.348 martin if (!no_local_exec_lock)
1362 1.348 martin rw_exit(&exec_lock);
1363 1.162 manu
1364 1.271 ad mutex_enter(proc_lock);
1365 1.237 ad
1366 1.237 ad if ((p->p_slflag & (PSL_TRACED|PSL_SYSCALL)) == PSL_TRACED) {
1367 1.237 ad KSI_INIT_EMPTY(&ksi);
1368 1.237 ad ksi.ksi_signo = SIGTRAP;
1369 1.237 ad ksi.ksi_lid = l->l_lid;
1370 1.237 ad kpsignal(p, &ksi, NULL);
1371 1.237 ad }
1372 1.162 manu
1373 1.237 ad if (p->p_sflag & PS_STOPEXEC) {
1374 1.237 ad KERNEL_UNLOCK_ALL(l, &l->l_biglocks);
1375 1.175 dsl p->p_pptr->p_nstopchild++;
1376 1.237 ad p->p_pptr->p_waited = 0;
1377 1.272 ad mutex_enter(p->p_lock);
1378 1.237 ad ksiginfo_queue_init(&kq);
1379 1.237 ad sigclearall(p, &contsigmask, &kq);
1380 1.237 ad lwp_lock(l);
1381 1.237 ad l->l_stat = LSSTOP;
1382 1.162 manu p->p_stat = SSTOP;
1383 1.164 thorpej p->p_nrlwps--;
1384 1.304 rmind lwp_unlock(l);
1385 1.272 ad mutex_exit(p->p_lock);
1386 1.271 ad mutex_exit(proc_lock);
1387 1.304 rmind lwp_lock(l);
1388 1.245 yamt mi_switch(l);
1389 1.237 ad ksiginfo_queue_drain(&kq);
1390 1.237 ad KERNEL_LOCK(l->l_biglocks, l);
1391 1.237 ad } else {
1392 1.271 ad mutex_exit(proc_lock);
1393 1.162 manu }
1394 1.162 manu
1395 1.337 martin pathbuf_stringcopy_put(data->ed_pathbuf, data->ed_pathstring);
1396 1.337 martin pathbuf_destroy(data->ed_pathbuf);
1397 1.337 martin PNBUF_PUT(data->ed_resolvedpathbuf);
1398 1.327 reinoud DPRINTF(("%s finished\n", __func__));
1399 1.85 mycroft return (EJUSTRETURN);
1400 1.55 cgd
1401 1.138 lukem exec_abort:
1402 1.294 darran SDT_PROBE(proc,,,exec_failure, error, 0, 0, 0, 0);
1403 1.297 rmind rw_exit(&p->p_reflock);
1404 1.348 martin if (!no_local_exec_lock)
1405 1.348 martin rw_exit(&exec_lock);
1406 1.297 rmind
1407 1.337 martin pathbuf_stringcopy_put(data->ed_pathbuf, data->ed_pathstring);
1408 1.337 martin pathbuf_destroy(data->ed_pathbuf);
1409 1.337 martin PNBUF_PUT(data->ed_resolvedpathbuf);
1410 1.130 jdolecek
1411 1.55 cgd /*
1412 1.55 cgd * the old process doesn't exist anymore. exit gracefully.
1413 1.55 cgd * get rid of the (new) address space we have created, if any, get rid
1414 1.55 cgd * of our namei data and vnode, and exit noting failure
1415 1.55 cgd */
1416 1.88 mrg uvm_deallocate(&vm->vm_map, VM_MIN_ADDRESS,
1417 1.88 mrg VM_MAXUSER_ADDRESS - VM_MIN_ADDRESS);
1418 1.348 martin
1419 1.337 martin exec_free_emul_arg(&data->ed_pack);
1420 1.337 martin pool_put(&exec_pool, data->ed_argp);
1421 1.337 martin kmem_free(data->ed_pack.ep_hdr, data->ed_pack.ep_hdrlen);
1422 1.337 martin if (data->ed_pack.ep_emul_root != NULL)
1423 1.337 martin vrele(data->ed_pack.ep_emul_root);
1424 1.337 martin if (data->ed_pack.ep_interp != NULL)
1425 1.337 martin vrele(data->ed_pack.ep_interp);
1426 1.237 ad
1427 1.252 ad /* Acquire the sched-state mutex (exit1() will release it). */
1428 1.348 martin if (!is_spawn) {
1429 1.337 martin mutex_enter(p->p_lock);
1430 1.337 martin exit1(l, W_EXITCODE(error, SIGABRT));
1431 1.337 martin }
1432 1.55 cgd
1433 1.348 martin return error;
1434 1.67 christos }
1435 1.67 christos
1436 1.144 christos int
1437 1.337 martin execve1(struct lwp *l, const char *path, char * const *args,
1438 1.337 martin char * const *envs, execve_fetch_element_t fetch_element)
1439 1.337 martin {
1440 1.337 martin struct execve_data data;
1441 1.337 martin int error;
1442 1.337 martin
1443 1.337 martin error = execve_loadvm(l, path, args, envs, fetch_element, &data);
1444 1.337 martin if (error)
1445 1.337 martin return error;
1446 1.348 martin error = execve_runproc(l, &data, false, false);
1447 1.337 martin return error;
1448 1.337 martin }
1449 1.337 martin
1450 1.337 martin int
1451 1.231 yamt copyargs(struct lwp *l, struct exec_package *pack, struct ps_strings *arginfo,
1452 1.231 yamt char **stackp, void *argp)
1453 1.67 christos {
1454 1.138 lukem char **cpp, *dp, *sp;
1455 1.138 lukem size_t len;
1456 1.138 lukem void *nullp;
1457 1.138 lukem long argc, envc;
1458 1.144 christos int error;
1459 1.138 lukem
1460 1.144 christos cpp = (char **)*stackp;
1461 1.138 lukem nullp = NULL;
1462 1.138 lukem argc = arginfo->ps_nargvstr;
1463 1.138 lukem envc = arginfo->ps_nenvstr;
1464 1.305 matt if ((error = copyout(&argc, cpp++, sizeof(argc))) != 0) {
1465 1.312 christos COPYPRINTF("", cpp - 1, sizeof(argc));
1466 1.144 christos return error;
1467 1.305 matt }
1468 1.67 christos
1469 1.244 dsl dp = (char *) (cpp + argc + envc + 2 + pack->ep_esch->es_arglen);
1470 1.67 christos sp = argp;
1471 1.67 christos
1472 1.67 christos /* XXX don't copy them out, remap them! */
1473 1.69 mycroft arginfo->ps_argvstr = cpp; /* remember location of argv for later */
1474 1.67 christos
1475 1.305 matt for (; --argc >= 0; sp += len, dp += len) {
1476 1.305 matt if ((error = copyout(&dp, cpp++, sizeof(dp))) != 0) {
1477 1.312 christos COPYPRINTF("", cpp - 1, sizeof(dp));
1478 1.305 matt return error;
1479 1.305 matt }
1480 1.305 matt if ((error = copyoutstr(sp, dp, ARG_MAX, &len)) != 0) {
1481 1.313 jakllsch COPYPRINTF("str", dp, (size_t)ARG_MAX);
1482 1.144 christos return error;
1483 1.305 matt }
1484 1.305 matt }
1485 1.67 christos
1486 1.305 matt if ((error = copyout(&nullp, cpp++, sizeof(nullp))) != 0) {
1487 1.312 christos COPYPRINTF("", cpp - 1, sizeof(nullp));
1488 1.144 christos return error;
1489 1.305 matt }
1490 1.67 christos
1491 1.69 mycroft arginfo->ps_envstr = cpp; /* remember location of envp for later */
1492 1.67 christos
1493 1.305 matt for (; --envc >= 0; sp += len, dp += len) {
1494 1.305 matt if ((error = copyout(&dp, cpp++, sizeof(dp))) != 0) {
1495 1.312 christos COPYPRINTF("", cpp - 1, sizeof(dp));
1496 1.144 christos return error;
1497 1.305 matt }
1498 1.305 matt if ((error = copyoutstr(sp, dp, ARG_MAX, &len)) != 0) {
1499 1.313 jakllsch COPYPRINTF("str", dp, (size_t)ARG_MAX);
1500 1.305 matt return error;
1501 1.305 matt }
1502 1.337 martin
1503 1.305 matt }
1504 1.67 christos
1505 1.305 matt if ((error = copyout(&nullp, cpp++, sizeof(nullp))) != 0) {
1506 1.312 christos COPYPRINTF("", cpp - 1, sizeof(nullp));
1507 1.144 christos return error;
1508 1.305 matt }
1509 1.67 christos
1510 1.144 christos *stackp = (char *)cpp;
1511 1.144 christos return 0;
1512 1.55 cgd }
1513 1.130 jdolecek
1514 1.130 jdolecek
1515 1.130 jdolecek /*
1516 1.282 ad * Add execsw[] entries.
1517 1.130 jdolecek */
1518 1.130 jdolecek int
1519 1.282 ad exec_add(struct execsw *esp, int count)
1520 1.130 jdolecek {
1521 1.282 ad struct exec_entry *it;
1522 1.282 ad int i;
1523 1.130 jdolecek
1524 1.283 ad if (count == 0) {
1525 1.283 ad return 0;
1526 1.283 ad }
1527 1.130 jdolecek
1528 1.282 ad /* Check for duplicates. */
1529 1.237 ad rw_enter(&exec_lock, RW_WRITER);
1530 1.282 ad for (i = 0; i < count; i++) {
1531 1.282 ad LIST_FOREACH(it, &ex_head, ex_list) {
1532 1.282 ad /* assume unique (makecmds, probe_func, emulation) */
1533 1.282 ad if (it->ex_sw->es_makecmds == esp[i].es_makecmds &&
1534 1.282 ad it->ex_sw->u.elf_probe_func ==
1535 1.282 ad esp[i].u.elf_probe_func &&
1536 1.282 ad it->ex_sw->es_emul == esp[i].es_emul) {
1537 1.282 ad rw_exit(&exec_lock);
1538 1.282 ad return EEXIST;
1539 1.130 jdolecek }
1540 1.130 jdolecek }
1541 1.130 jdolecek }
1542 1.130 jdolecek
1543 1.282 ad /* Allocate new entries. */
1544 1.282 ad for (i = 0; i < count; i++) {
1545 1.282 ad it = kmem_alloc(sizeof(*it), KM_SLEEP);
1546 1.282 ad it->ex_sw = &esp[i];
1547 1.282 ad LIST_INSERT_HEAD(&ex_head, it, ex_list);
1548 1.130 jdolecek }
1549 1.130 jdolecek
1550 1.130 jdolecek /* update execsw[] */
1551 1.130 jdolecek exec_init(0);
1552 1.237 ad rw_exit(&exec_lock);
1553 1.282 ad return 0;
1554 1.130 jdolecek }
1555 1.130 jdolecek
1556 1.130 jdolecek /*
1557 1.130 jdolecek * Remove execsw[] entry.
1558 1.130 jdolecek */
1559 1.130 jdolecek int
1560 1.282 ad exec_remove(struct execsw *esp, int count)
1561 1.130 jdolecek {
1562 1.282 ad struct exec_entry *it, *next;
1563 1.282 ad int i;
1564 1.282 ad const struct proclist_desc *pd;
1565 1.282 ad proc_t *p;
1566 1.282 ad
1567 1.283 ad if (count == 0) {
1568 1.283 ad return 0;
1569 1.283 ad }
1570 1.130 jdolecek
1571 1.282 ad /* Abort if any are busy. */
1572 1.237 ad rw_enter(&exec_lock, RW_WRITER);
1573 1.282 ad for (i = 0; i < count; i++) {
1574 1.282 ad mutex_enter(proc_lock);
1575 1.282 ad for (pd = proclists; pd->pd_list != NULL; pd++) {
1576 1.282 ad PROCLIST_FOREACH(p, pd->pd_list) {
1577 1.282 ad if (p->p_execsw == &esp[i]) {
1578 1.282 ad mutex_exit(proc_lock);
1579 1.282 ad rw_exit(&exec_lock);
1580 1.282 ad return EBUSY;
1581 1.282 ad }
1582 1.282 ad }
1583 1.282 ad }
1584 1.282 ad mutex_exit(proc_lock);
1585 1.282 ad }
1586 1.130 jdolecek
1587 1.282 ad /* None are busy, so remove them all. */
1588 1.282 ad for (i = 0; i < count; i++) {
1589 1.282 ad for (it = LIST_FIRST(&ex_head); it != NULL; it = next) {
1590 1.282 ad next = LIST_NEXT(it, ex_list);
1591 1.282 ad if (it->ex_sw == &esp[i]) {
1592 1.282 ad LIST_REMOVE(it, ex_list);
1593 1.282 ad kmem_free(it, sizeof(*it));
1594 1.282 ad break;
1595 1.282 ad }
1596 1.282 ad }
1597 1.130 jdolecek }
1598 1.130 jdolecek
1599 1.130 jdolecek /* update execsw[] */
1600 1.130 jdolecek exec_init(0);
1601 1.237 ad rw_exit(&exec_lock);
1602 1.282 ad return 0;
1603 1.130 jdolecek }
1604 1.130 jdolecek
1605 1.130 jdolecek /*
1606 1.130 jdolecek * Initialize exec structures. If init_boot is true, also does necessary
1607 1.130 jdolecek * one-time initialization (it's called from main() that way).
1608 1.147 jdolecek * Once system is multiuser, this should be called with exec_lock held,
1609 1.130 jdolecek * i.e. via exec_{add|remove}().
1610 1.130 jdolecek */
1611 1.130 jdolecek int
1612 1.138 lukem exec_init(int init_boot)
1613 1.130 jdolecek {
1614 1.282 ad const struct execsw **sw;
1615 1.282 ad struct exec_entry *ex;
1616 1.282 ad SLIST_HEAD(,exec_entry) first;
1617 1.282 ad SLIST_HEAD(,exec_entry) any;
1618 1.282 ad SLIST_HEAD(,exec_entry) last;
1619 1.282 ad int i, sz;
1620 1.130 jdolecek
1621 1.130 jdolecek if (init_boot) {
1622 1.130 jdolecek /* do one-time initializations */
1623 1.237 ad rw_init(&exec_lock);
1624 1.259 ad mutex_init(&sigobject_lock, MUTEX_DEFAULT, IPL_NONE);
1625 1.277 ad pool_init(&exec_pool, NCARGS, 0, 0, PR_NOALIGN|PR_NOTOUCH,
1626 1.277 ad "execargs", &exec_palloc, IPL_NONE);
1627 1.277 ad pool_sethardlimit(&exec_pool, maxexec, "should not happen", 0);
1628 1.282 ad } else {
1629 1.282 ad KASSERT(rw_write_held(&exec_lock));
1630 1.282 ad }
1631 1.130 jdolecek
1632 1.282 ad /* Sort each entry onto the appropriate queue. */
1633 1.282 ad SLIST_INIT(&first);
1634 1.282 ad SLIST_INIT(&any);
1635 1.282 ad SLIST_INIT(&last);
1636 1.282 ad sz = 0;
1637 1.282 ad LIST_FOREACH(ex, &ex_head, ex_list) {
1638 1.282 ad switch(ex->ex_sw->es_prio) {
1639 1.282 ad case EXECSW_PRIO_FIRST:
1640 1.282 ad SLIST_INSERT_HEAD(&first, ex, ex_slist);
1641 1.282 ad break;
1642 1.282 ad case EXECSW_PRIO_ANY:
1643 1.282 ad SLIST_INSERT_HEAD(&any, ex, ex_slist);
1644 1.282 ad break;
1645 1.282 ad case EXECSW_PRIO_LAST:
1646 1.282 ad SLIST_INSERT_HEAD(&last, ex, ex_slist);
1647 1.282 ad break;
1648 1.282 ad default:
1649 1.312 christos panic("%s", __func__);
1650 1.282 ad break;
1651 1.130 jdolecek }
1652 1.282 ad sz++;
1653 1.130 jdolecek }
1654 1.130 jdolecek
1655 1.130 jdolecek /*
1656 1.282 ad * Create new execsw[]. Ensure we do not try a zero-sized
1657 1.282 ad * allocation.
1658 1.130 jdolecek */
1659 1.282 ad sw = kmem_alloc(sz * sizeof(struct execsw *) + 1, KM_SLEEP);
1660 1.282 ad i = 0;
1661 1.282 ad SLIST_FOREACH(ex, &first, ex_slist) {
1662 1.282 ad sw[i++] = ex->ex_sw;
1663 1.282 ad }
1664 1.282 ad SLIST_FOREACH(ex, &any, ex_slist) {
1665 1.282 ad sw[i++] = ex->ex_sw;
1666 1.282 ad }
1667 1.282 ad SLIST_FOREACH(ex, &last, ex_slist) {
1668 1.282 ad sw[i++] = ex->ex_sw;
1669 1.130 jdolecek }
1670 1.183 junyoung
1671 1.282 ad /* Replace old execsw[] and free used memory. */
1672 1.282 ad if (execsw != NULL) {
1673 1.282 ad kmem_free(__UNCONST(execsw),
1674 1.282 ad nexecs * sizeof(struct execsw *) + 1);
1675 1.130 jdolecek }
1676 1.282 ad execsw = sw;
1677 1.282 ad nexecs = sz;
1678 1.130 jdolecek
1679 1.282 ad /* Figure out the maximum size of an exec header. */
1680 1.282 ad exec_maxhdrsz = sizeof(int);
1681 1.130 jdolecek for (i = 0; i < nexecs; i++) {
1682 1.130 jdolecek if (execsw[i]->es_hdrsz > exec_maxhdrsz)
1683 1.130 jdolecek exec_maxhdrsz = execsw[i]->es_hdrsz;
1684 1.130 jdolecek }
1685 1.130 jdolecek
1686 1.130 jdolecek return 0;
1687 1.130 jdolecek }
1688 1.171 chs
1689 1.171 chs static int
1690 1.171 chs exec_sigcode_map(struct proc *p, const struct emul *e)
1691 1.171 chs {
1692 1.171 chs vaddr_t va;
1693 1.171 chs vsize_t sz;
1694 1.171 chs int error;
1695 1.171 chs struct uvm_object *uobj;
1696 1.171 chs
1697 1.184 drochner sz = (vaddr_t)e->e_esigcode - (vaddr_t)e->e_sigcode;
1698 1.184 drochner
1699 1.184 drochner if (e->e_sigobject == NULL || sz == 0) {
1700 1.171 chs return 0;
1701 1.171 chs }
1702 1.171 chs
1703 1.171 chs /*
1704 1.171 chs * If we don't have a sigobject for this emulation, create one.
1705 1.171 chs *
1706 1.171 chs * sigobject is an anonymous memory object (just like SYSV shared
1707 1.171 chs * memory) that we keep a permanent reference to and that we map
1708 1.171 chs * in all processes that need this sigcode. The creation is simple,
1709 1.171 chs * we create an object, add a permanent reference to it, map it in
1710 1.171 chs * kernel space, copy out the sigcode to it and unmap it.
1711 1.189 jdolecek * We map it with PROT_READ|PROT_EXEC into the process just
1712 1.189 jdolecek * the way sys_mmap() would map it.
1713 1.171 chs */
1714 1.171 chs
1715 1.171 chs uobj = *e->e_sigobject;
1716 1.171 chs if (uobj == NULL) {
1717 1.259 ad mutex_enter(&sigobject_lock);
1718 1.259 ad if ((uobj = *e->e_sigobject) == NULL) {
1719 1.259 ad uobj = uao_create(sz, 0);
1720 1.259 ad (*uobj->pgops->pgo_reference)(uobj);
1721 1.259 ad va = vm_map_min(kernel_map);
1722 1.259 ad if ((error = uvm_map(kernel_map, &va, round_page(sz),
1723 1.259 ad uobj, 0, 0,
1724 1.259 ad UVM_MAPFLAG(UVM_PROT_RW, UVM_PROT_RW,
1725 1.259 ad UVM_INH_SHARE, UVM_ADV_RANDOM, 0)))) {
1726 1.259 ad printf("kernel mapping failed %d\n", error);
1727 1.259 ad (*uobj->pgops->pgo_detach)(uobj);
1728 1.259 ad mutex_exit(&sigobject_lock);
1729 1.259 ad return (error);
1730 1.259 ad }
1731 1.259 ad memcpy((void *)va, e->e_sigcode, sz);
1732 1.171 chs #ifdef PMAP_NEED_PROCWR
1733 1.259 ad pmap_procwr(&proc0, va, sz);
1734 1.171 chs #endif
1735 1.259 ad uvm_unmap(kernel_map, va, va + round_page(sz));
1736 1.259 ad *e->e_sigobject = uobj;
1737 1.259 ad }
1738 1.259 ad mutex_exit(&sigobject_lock);
1739 1.171 chs }
1740 1.171 chs
1741 1.172 enami /* Just a hint to uvm_map where to put it. */
1742 1.195 fvdl va = e->e_vm_default_addr(p, (vaddr_t)p->p_vmspace->vm_daddr,
1743 1.195 fvdl round_page(sz));
1744 1.187 chs
1745 1.187 chs #ifdef __alpha__
1746 1.187 chs /*
1747 1.187 chs * Tru64 puts /sbin/loader at the end of user virtual memory,
1748 1.187 chs * which causes the above calculation to put the sigcode at
1749 1.187 chs * an invalid address. Put it just below the text instead.
1750 1.187 chs */
1751 1.193 jmc if (va == (vaddr_t)vm_map_max(&p->p_vmspace->vm_map)) {
1752 1.187 chs va = (vaddr_t)p->p_vmspace->vm_taddr - round_page(sz);
1753 1.187 chs }
1754 1.187 chs #endif
1755 1.187 chs
1756 1.171 chs (*uobj->pgops->pgo_reference)(uobj);
1757 1.171 chs error = uvm_map(&p->p_vmspace->vm_map, &va, round_page(sz),
1758 1.171 chs uobj, 0, 0,
1759 1.171 chs UVM_MAPFLAG(UVM_PROT_RX, UVM_PROT_RX, UVM_INH_SHARE,
1760 1.171 chs UVM_ADV_RANDOM, 0));
1761 1.171 chs if (error) {
1762 1.312 christos DPRINTF(("%s, %d: map %p "
1763 1.305 matt "uvm_map %#"PRIxVSIZE"@%#"PRIxVADDR" failed %d\n",
1764 1.312 christos __func__, __LINE__, &p->p_vmspace->vm_map, round_page(sz),
1765 1.312 christos va, error));
1766 1.171 chs (*uobj->pgops->pgo_detach)(uobj);
1767 1.171 chs return (error);
1768 1.171 chs }
1769 1.171 chs p->p_sigctx.ps_sigcode = (void *)va;
1770 1.171 chs return (0);
1771 1.171 chs }
1772 1.336 matt
1773 1.337 martin /*
1774 1.348 martin * Release a refcount on spawn_exec_data and destroy memory, if this
1775 1.348 martin * was the last one.
1776 1.348 martin */
1777 1.348 martin static void
1778 1.348 martin spawn_exec_data_release(struct spawn_exec_data *data)
1779 1.348 martin {
1780 1.348 martin if (atomic_dec_32_nv(&data->sed_refcnt) != 0)
1781 1.348 martin return;
1782 1.348 martin
1783 1.348 martin cv_destroy(&data->sed_cv_child_ready);
1784 1.348 martin mutex_destroy(&data->sed_mtx_child);
1785 1.348 martin
1786 1.348 martin if (data->sed_actions)
1787 1.348 martin posix_spawn_fa_free(data->sed_actions,
1788 1.348 martin data->sed_actions->len);
1789 1.348 martin if (data->sed_attrs)
1790 1.348 martin kmem_free(data->sed_attrs,
1791 1.348 martin sizeof(*data->sed_attrs));
1792 1.348 martin kmem_free(data, sizeof(*data));
1793 1.348 martin }
1794 1.348 martin
1795 1.348 martin /*
1796 1.337 martin * A child lwp of a posix_spawn operation starts here and ends up in
1797 1.337 martin * cpu_spawn_return, dealing with all filedescriptor and scheduler
1798 1.337 martin * manipulations in between.
1799 1.348 martin * The parent waits for the child, as it is not clear wether the child
1800 1.348 martin * will be able to aquire its own exec_lock. If it can, the parent can
1801 1.348 martin * be released early and continue running in parallel. If not (or if the
1802 1.348 martin * magic debug flag is passed in the scheduler attribute struct), the
1803 1.348 martin * child rides on the parent's exec lock untill it is ready to return to
1804 1.348 martin * to userland - and only then releases the parent. This method loses
1805 1.348 martin * concurrency, but improves error reporting.
1806 1.337 martin */
1807 1.337 martin static void
1808 1.337 martin spawn_return(void *arg)
1809 1.337 martin {
1810 1.337 martin struct spawn_exec_data *spawn_data = arg;
1811 1.337 martin struct lwp *l = curlwp;
1812 1.337 martin int error, newfd;
1813 1.337 martin size_t i;
1814 1.337 martin const struct posix_spawn_file_actions_entry *fae;
1815 1.348 martin pid_t ppid;
1816 1.337 martin register_t retval;
1817 1.341 martin bool have_reflock;
1818 1.348 martin bool parent_is_waiting = true;
1819 1.345 martin
1820 1.341 martin /*
1821 1.348 martin * Check if we can release parent early.
1822 1.348 martin * We either need to have no sed_attrs, or sed_attrs does not
1823 1.348 martin * have POSIX_SPAWN_RETURNERROR or one of the flags, that require
1824 1.348 martin * safe access to the parent proc (passed in sed_parent).
1825 1.348 martin * We then try to get the exec_lock, and only if that works, we can
1826 1.348 martin * release the parent here already.
1827 1.348 martin */
1828 1.348 martin ppid = spawn_data->sed_parent->p_pid;
1829 1.348 martin if ((!spawn_data->sed_attrs
1830 1.348 martin || (spawn_data->sed_attrs->sa_flags
1831 1.348 martin & (POSIX_SPAWN_RETURNERROR|POSIX_SPAWN_SETPGROUP)) == 0)
1832 1.348 martin && rw_tryenter(&exec_lock, RW_READER)) {
1833 1.348 martin parent_is_waiting = false;
1834 1.348 martin mutex_enter(&spawn_data->sed_mtx_child);
1835 1.348 martin cv_signal(&spawn_data->sed_cv_child_ready);
1836 1.348 martin mutex_exit(&spawn_data->sed_mtx_child);
1837 1.348 martin }
1838 1.341 martin
1839 1.341 martin /* don't allow debugger access yet */
1840 1.341 martin rw_enter(&l->l_proc->p_reflock, RW_WRITER);
1841 1.341 martin have_reflock = true;
1842 1.337 martin
1843 1.338 martin error = 0;
1844 1.337 martin /* handle posix_spawn_file_actions */
1845 1.337 martin if (spawn_data->sed_actions != NULL) {
1846 1.348 martin for (i = 0; i < spawn_data->sed_actions->len; i++) {
1847 1.348 martin fae = &spawn_data->sed_actions->fae[i];
1848 1.337 martin switch (fae->fae_action) {
1849 1.337 martin case FAE_OPEN:
1850 1.338 martin if (fd_getfile(fae->fae_fildes) != NULL) {
1851 1.338 martin error = fd_close(fae->fae_fildes);
1852 1.338 martin if (error)
1853 1.338 martin break;
1854 1.338 martin }
1855 1.337 martin error = fd_open(fae->fae_path, fae->fae_oflag,
1856 1.337 martin fae->fae_mode, &newfd);
1857 1.338 martin if (error)
1858 1.338 martin break;
1859 1.337 martin if (newfd != fae->fae_fildes) {
1860 1.337 martin error = dodup(l, newfd,
1861 1.337 martin fae->fae_fildes, 0, &retval);
1862 1.337 martin if (fd_getfile(newfd) != NULL)
1863 1.337 martin fd_close(newfd);
1864 1.337 martin }
1865 1.337 martin break;
1866 1.337 martin case FAE_DUP2:
1867 1.337 martin error = dodup(l, fae->fae_fildes,
1868 1.337 martin fae->fae_newfildes, 0, &retval);
1869 1.337 martin break;
1870 1.337 martin case FAE_CLOSE:
1871 1.337 martin if (fd_getfile(fae->fae_fildes) == NULL) {
1872 1.337 martin error = EBADF;
1873 1.337 martin break;
1874 1.337 martin }
1875 1.337 martin error = fd_close(fae->fae_fildes);
1876 1.337 martin break;
1877 1.337 martin }
1878 1.337 martin if (error)
1879 1.337 martin goto report_error;
1880 1.337 martin }
1881 1.337 martin }
1882 1.337 martin
1883 1.337 martin /* handle posix_spawnattr */
1884 1.337 martin if (spawn_data->sed_attrs != NULL) {
1885 1.337 martin struct sigaction sigact;
1886 1.337 martin sigact._sa_u._sa_handler = SIG_DFL;
1887 1.337 martin sigact.sa_flags = 0;
1888 1.337 martin
1889 1.337 martin /*
1890 1.337 martin * set state to SSTOP so that this proc can be found by pid.
1891 1.337 martin * see proc_enterprp, do_sched_setparam below
1892 1.337 martin */
1893 1.337 martin l->l_proc->p_stat = SSTOP;
1894 1.337 martin
1895 1.337 martin /* Set process group */
1896 1.337 martin if (spawn_data->sed_attrs->sa_flags & POSIX_SPAWN_SETPGROUP) {
1897 1.337 martin pid_t mypid = l->l_proc->p_pid,
1898 1.337 martin pgrp = spawn_data->sed_attrs->sa_pgroup;
1899 1.337 martin
1900 1.337 martin if (pgrp == 0)
1901 1.337 martin pgrp = mypid;
1902 1.337 martin
1903 1.337 martin error = proc_enterpgrp(spawn_data->sed_parent,
1904 1.337 martin mypid, pgrp, false);
1905 1.337 martin if (error)
1906 1.337 martin goto report_error;
1907 1.337 martin }
1908 1.337 martin
1909 1.337 martin /* Set scheduler policy */
1910 1.337 martin if (spawn_data->sed_attrs->sa_flags & POSIX_SPAWN_SETSCHEDULER)
1911 1.337 martin error = do_sched_setparam(l->l_proc->p_pid, 0,
1912 1.337 martin spawn_data->sed_attrs->sa_schedpolicy,
1913 1.337 martin &spawn_data->sed_attrs->sa_schedparam);
1914 1.337 martin else if (spawn_data->sed_attrs->sa_flags
1915 1.337 martin & POSIX_SPAWN_SETSCHEDPARAM) {
1916 1.348 martin error = do_sched_setparam(ppid, 0,
1917 1.337 martin SCHED_NONE, &spawn_data->sed_attrs->sa_schedparam);
1918 1.337 martin }
1919 1.337 martin if (error)
1920 1.337 martin goto report_error;
1921 1.337 martin
1922 1.337 martin /* Reset user ID's */
1923 1.337 martin if (spawn_data->sed_attrs->sa_flags & POSIX_SPAWN_RESETIDS) {
1924 1.337 martin error = do_setresuid(l, -1,
1925 1.337 martin kauth_cred_getgid(l->l_cred), -1,
1926 1.337 martin ID_E_EQ_R | ID_E_EQ_S);
1927 1.337 martin if (error)
1928 1.337 martin goto report_error;
1929 1.337 martin error = do_setresuid(l, -1,
1930 1.337 martin kauth_cred_getuid(l->l_cred), -1,
1931 1.337 martin ID_E_EQ_R | ID_E_EQ_S);
1932 1.337 martin if (error)
1933 1.337 martin goto report_error;
1934 1.337 martin }
1935 1.337 martin
1936 1.337 martin /* Set signal masks/defaults */
1937 1.337 martin if (spawn_data->sed_attrs->sa_flags & POSIX_SPAWN_SETSIGMASK) {
1938 1.337 martin mutex_enter(l->l_proc->p_lock);
1939 1.337 martin error = sigprocmask1(l, SIG_SETMASK,
1940 1.337 martin &spawn_data->sed_attrs->sa_sigmask, NULL);
1941 1.337 martin mutex_exit(l->l_proc->p_lock);
1942 1.337 martin if (error)
1943 1.337 martin goto report_error;
1944 1.337 martin }
1945 1.337 martin
1946 1.337 martin if (spawn_data->sed_attrs->sa_flags & POSIX_SPAWN_SETSIGDEF) {
1947 1.337 martin for (i = 1; i <= NSIG; i++) {
1948 1.337 martin if (sigismember(
1949 1.337 martin &spawn_data->sed_attrs->sa_sigdefault, i))
1950 1.337 martin sigaction1(l, i, &sigact, NULL, NULL,
1951 1.337 martin 0);
1952 1.337 martin }
1953 1.337 martin }
1954 1.337 martin }
1955 1.337 martin
1956 1.337 martin /* now do the real exec */
1957 1.348 martin error = execve_runproc(l, &spawn_data->sed_exec, parent_is_waiting,
1958 1.348 martin true);
1959 1.341 martin have_reflock = false;
1960 1.337 martin if (error == EJUSTRETURN)
1961 1.337 martin error = 0;
1962 1.337 martin else if (error)
1963 1.337 martin goto report_error;
1964 1.337 martin
1965 1.348 martin if (parent_is_waiting) {
1966 1.348 martin mutex_enter(&spawn_data->sed_mtx_child);
1967 1.348 martin cv_signal(&spawn_data->sed_cv_child_ready);
1968 1.348 martin mutex_exit(&spawn_data->sed_mtx_child);
1969 1.348 martin }
1970 1.345 martin
1971 1.348 martin /* release our refcount on the data */
1972 1.348 martin spawn_exec_data_release(spawn_data);
1973 1.337 martin
1974 1.337 martin /* and finaly: leave to userland for the first time */
1975 1.337 martin cpu_spawn_return(l);
1976 1.337 martin
1977 1.337 martin /* NOTREACHED */
1978 1.337 martin return;
1979 1.337 martin
1980 1.337 martin report_error:
1981 1.348 martin if (have_reflock)
1982 1.341 martin rw_exit(&l->l_proc->p_reflock);
1983 1.341 martin
1984 1.348 martin if (parent_is_waiting) {
1985 1.348 martin /* pass error to parent */
1986 1.348 martin mutex_enter(&spawn_data->sed_mtx_child);
1987 1.348 martin spawn_data->sed_error = error;
1988 1.348 martin cv_signal(&spawn_data->sed_cv_child_ready);
1989 1.348 martin mutex_exit(&spawn_data->sed_mtx_child);
1990 1.348 martin } else {
1991 1.348 martin rw_exit(&exec_lock);
1992 1.337 martin }
1993 1.337 martin
1994 1.348 martin /* release our refcount on the data */
1995 1.348 martin spawn_exec_data_release(spawn_data);
1996 1.348 martin
1997 1.348 martin /* done, exit */
1998 1.337 martin mutex_enter(l->l_proc->p_lock);
1999 1.348 martin /*
2000 1.348 martin * Posix explicitly asks for an exit code of 127 if we report
2001 1.348 martin * errors from the child process - so, unfortunately, there
2002 1.348 martin * is no way to report a more exact error code.
2003 1.348 martin * A NetBSD specific workaround is POSIX_SPAWN_RETURNERROR as
2004 1.348 martin * flag bit in the attrp argument to posix_spawn(2), see above.
2005 1.348 martin */
2006 1.349 martin exit1(l, W_EXITCODE(127, 0));
2007 1.337 martin }
2008 1.337 martin
2009 1.348 martin void
2010 1.344 christos posix_spawn_fa_free(struct posix_spawn_file_actions *fa, size_t len)
2011 1.342 christos {
2012 1.342 christos
2013 1.344 christos for (size_t i = 0; i < len; i++) {
2014 1.342 christos struct posix_spawn_file_actions_entry *fae = &fa->fae[i];
2015 1.342 christos if (fae->fae_action != FAE_OPEN)
2016 1.342 christos continue;
2017 1.342 christos kmem_free(fae->fae_path, strlen(fae->fae_path) + 1);
2018 1.342 christos }
2019 1.348 martin if (fa->len > 0)
2020 1.343 christos kmem_free(fa->fae, sizeof(*fa->fae) * fa->len);
2021 1.342 christos kmem_free(fa, sizeof(*fa));
2022 1.342 christos }
2023 1.342 christos
2024 1.342 christos static int
2025 1.342 christos posix_spawn_fa_alloc(struct posix_spawn_file_actions **fap,
2026 1.342 christos const struct posix_spawn_file_actions *ufa)
2027 1.342 christos {
2028 1.342 christos struct posix_spawn_file_actions *fa;
2029 1.342 christos struct posix_spawn_file_actions_entry *fae;
2030 1.342 christos char *pbuf = NULL;
2031 1.342 christos int error;
2032 1.344 christos size_t i = 0;
2033 1.342 christos
2034 1.342 christos fa = kmem_alloc(sizeof(*fa), KM_SLEEP);
2035 1.342 christos error = copyin(ufa, fa, sizeof(*fa));
2036 1.342 christos if (error) {
2037 1.342 christos fa->fae = NULL;
2038 1.342 christos fa->len = 0;
2039 1.342 christos goto out;
2040 1.342 christos }
2041 1.342 christos
2042 1.348 martin if (fa->len == 0) {
2043 1.348 martin kmem_free(fa, sizeof(*fa));
2044 1.342 christos return 0;
2045 1.348 martin }
2046 1.342 christos
2047 1.348 martin fa->size = fa->len;
2048 1.342 christos size_t fal = fa->len * sizeof(*fae);
2049 1.342 christos fae = fa->fae;
2050 1.342 christos fa->fae = kmem_alloc(fal, KM_SLEEP);
2051 1.342 christos error = copyin(fae, fa->fae, fal);
2052 1.344 christos if (error)
2053 1.342 christos goto out;
2054 1.342 christos
2055 1.342 christos pbuf = PNBUF_GET();
2056 1.344 christos for (; i < fa->len; i++) {
2057 1.342 christos fae = &fa->fae[i];
2058 1.342 christos if (fae->fae_action != FAE_OPEN)
2059 1.342 christos continue;
2060 1.342 christos error = copyinstr(fae->fae_path, pbuf, MAXPATHLEN, &fal);
2061 1.344 christos if (error)
2062 1.342 christos goto out;
2063 1.342 christos fae->fae_path = kmem_alloc(fal, KM_SLEEP);
2064 1.342 christos memcpy(fae->fae_path, pbuf, fal);
2065 1.342 christos }
2066 1.342 christos PNBUF_PUT(pbuf);
2067 1.348 martin
2068 1.342 christos *fap = fa;
2069 1.342 christos return 0;
2070 1.342 christos out:
2071 1.342 christos if (pbuf)
2072 1.342 christos PNBUF_PUT(pbuf);
2073 1.344 christos posix_spawn_fa_free(fa, i);
2074 1.342 christos return error;
2075 1.342 christos }
2076 1.342 christos
2077 1.337 martin int
2078 1.348 martin check_posix_spawn(struct lwp *l1)
2079 1.337 martin {
2080 1.348 martin int error, tnprocs, count;
2081 1.337 martin uid_t uid;
2082 1.348 martin struct proc *p1;
2083 1.337 martin
2084 1.337 martin p1 = l1->l_proc;
2085 1.337 martin uid = kauth_cred_getuid(l1->l_cred);
2086 1.337 martin tnprocs = atomic_inc_uint_nv(&nprocs);
2087 1.337 martin
2088 1.337 martin /*
2089 1.337 martin * Although process entries are dynamically created, we still keep
2090 1.337 martin * a global limit on the maximum number we will create.
2091 1.337 martin */
2092 1.337 martin if (__predict_false(tnprocs >= maxproc))
2093 1.337 martin error = -1;
2094 1.337 martin else
2095 1.337 martin error = kauth_authorize_process(l1->l_cred,
2096 1.337 martin KAUTH_PROCESS_FORK, p1, KAUTH_ARG(tnprocs), NULL, NULL);
2097 1.337 martin
2098 1.337 martin if (error) {
2099 1.337 martin atomic_dec_uint(&nprocs);
2100 1.348 martin return EAGAIN;
2101 1.337 martin }
2102 1.337 martin
2103 1.337 martin /*
2104 1.337 martin * Enforce limits.
2105 1.337 martin */
2106 1.337 martin count = chgproccnt(uid, 1);
2107 1.347 elad if (kauth_authorize_process(l1->l_cred, KAUTH_PROCESS_RLIMIT,
2108 1.347 elad p1, KAUTH_ARG(KAUTH_REQ_PROCESS_RLIMIT_BYPASS),
2109 1.347 elad &p1->p_rlimit[RLIMIT_NPROC], KAUTH_ARG(RLIMIT_NPROC)) != 0 &&
2110 1.347 elad __predict_false(count > p1->p_rlimit[RLIMIT_NPROC].rlim_cur)) {
2111 1.348 martin (void)chgproccnt(uid, -1);
2112 1.348 martin atomic_dec_uint(&nprocs);
2113 1.348 martin return EAGAIN;
2114 1.337 martin }
2115 1.337 martin
2116 1.348 martin return 0;
2117 1.348 martin }
2118 1.348 martin
2119 1.348 martin int
2120 1.348 martin do_posix_spawn(struct lwp *l1, pid_t *pid_res, bool *child_ok, const char *path,
2121 1.348 martin struct posix_spawn_file_actions *fa,
2122 1.348 martin struct posix_spawnattr *sa,
2123 1.348 martin char *const *argv, char *const *envp,
2124 1.348 martin execve_fetch_element_t fetch)
2125 1.348 martin {
2126 1.348 martin
2127 1.348 martin struct proc *p1, *p2;
2128 1.348 martin struct lwp *l2;
2129 1.348 martin int error;
2130 1.348 martin struct spawn_exec_data *spawn_data;
2131 1.348 martin vaddr_t uaddr;
2132 1.348 martin pid_t pid;
2133 1.348 martin bool have_exec_lock = false;
2134 1.348 martin
2135 1.348 martin p1 = l1->l_proc;
2136 1.342 christos
2137 1.348 martin /* Allocate and init spawn_data */
2138 1.348 martin spawn_data = kmem_zalloc(sizeof(*spawn_data), KM_SLEEP);
2139 1.348 martin spawn_data->sed_refcnt = 1; /* only parent so far */
2140 1.348 martin cv_init(&spawn_data->sed_cv_child_ready, "pspawn");
2141 1.348 martin mutex_init(&spawn_data->sed_mtx_child, MUTEX_DEFAULT, IPL_NONE);
2142 1.348 martin mutex_enter(&spawn_data->sed_mtx_child);
2143 1.337 martin
2144 1.337 martin /*
2145 1.337 martin * Do the first part of the exec now, collect state
2146 1.337 martin * in spawn_data.
2147 1.337 martin */
2148 1.348 martin error = execve_loadvm(l1, path, argv,
2149 1.348 martin envp, fetch, &spawn_data->sed_exec);
2150 1.337 martin if (error == EJUSTRETURN)
2151 1.337 martin error = 0;
2152 1.337 martin else if (error)
2153 1.337 martin goto error_exit;
2154 1.337 martin
2155 1.337 martin have_exec_lock = true;
2156 1.337 martin
2157 1.337 martin /*
2158 1.337 martin * Allocate virtual address space for the U-area now, while it
2159 1.337 martin * is still easy to abort the fork operation if we're out of
2160 1.337 martin * kernel virtual address space.
2161 1.337 martin */
2162 1.337 martin uaddr = uvm_uarea_alloc();
2163 1.337 martin if (__predict_false(uaddr == 0)) {
2164 1.337 martin error = ENOMEM;
2165 1.337 martin goto error_exit;
2166 1.337 martin }
2167 1.337 martin
2168 1.337 martin /*
2169 1.348 martin * Allocate new proc. Borrow proc0 vmspace for it, we will
2170 1.348 martin * replace it with its own before returning to userland
2171 1.348 martin * in the child.
2172 1.337 martin * This is a point of no return, we will have to go through
2173 1.337 martin * the child proc to properly clean it up past this point.
2174 1.337 martin */
2175 1.337 martin p2 = proc_alloc();
2176 1.337 martin pid = p2->p_pid;
2177 1.337 martin
2178 1.337 martin /*
2179 1.337 martin * Make a proc table entry for the new process.
2180 1.337 martin * Start by zeroing the section of proc that is zero-initialized,
2181 1.337 martin * then copy the section that is copied directly from the parent.
2182 1.337 martin */
2183 1.337 martin memset(&p2->p_startzero, 0,
2184 1.337 martin (unsigned) ((char *)&p2->p_endzero - (char *)&p2->p_startzero));
2185 1.337 martin memcpy(&p2->p_startcopy, &p1->p_startcopy,
2186 1.337 martin (unsigned) ((char *)&p2->p_endcopy - (char *)&p2->p_startcopy));
2187 1.348 martin p2->p_vmspace = proc0.p_vmspace;
2188 1.337 martin
2189 1.337 martin CIRCLEQ_INIT(&p2->p_sigpend.sp_info);
2190 1.337 martin
2191 1.337 martin LIST_INIT(&p2->p_lwps);
2192 1.337 martin LIST_INIT(&p2->p_sigwaiters);
2193 1.337 martin
2194 1.337 martin /*
2195 1.337 martin * Duplicate sub-structures as needed.
2196 1.337 martin * Increase reference counts on shared objects.
2197 1.337 martin * Inherit flags we want to keep. The flags related to SIGCHLD
2198 1.337 martin * handling are important in order to keep a consistent behaviour
2199 1.337 martin * for the child after the fork. If we are a 32-bit process, the
2200 1.337 martin * child will be too.
2201 1.337 martin */
2202 1.337 martin p2->p_flag =
2203 1.337 martin p1->p_flag & (PK_SUGID | PK_NOCLDWAIT | PK_CLDSIGIGN | PK_32);
2204 1.337 martin p2->p_emul = p1->p_emul;
2205 1.337 martin p2->p_execsw = p1->p_execsw;
2206 1.337 martin
2207 1.337 martin mutex_init(&p2->p_stmutex, MUTEX_DEFAULT, IPL_HIGH);
2208 1.337 martin mutex_init(&p2->p_auxlock, MUTEX_DEFAULT, IPL_NONE);
2209 1.337 martin rw_init(&p2->p_reflock);
2210 1.337 martin cv_init(&p2->p_waitcv, "wait");
2211 1.337 martin cv_init(&p2->p_lwpcv, "lwpwait");
2212 1.337 martin
2213 1.337 martin p2->p_lock = mutex_obj_alloc(MUTEX_DEFAULT, IPL_NONE);
2214 1.337 martin
2215 1.337 martin kauth_proc_fork(p1, p2);
2216 1.337 martin
2217 1.337 martin p2->p_raslist = NULL;
2218 1.337 martin p2->p_fd = fd_copy();
2219 1.337 martin
2220 1.337 martin /* XXX racy */
2221 1.337 martin p2->p_mqueue_cnt = p1->p_mqueue_cnt;
2222 1.337 martin
2223 1.337 martin p2->p_cwdi = cwdinit();
2224 1.337 martin
2225 1.337 martin /*
2226 1.337 martin * Note: p_limit (rlimit stuff) is copy-on-write, so normally
2227 1.337 martin * we just need increase pl_refcnt.
2228 1.337 martin */
2229 1.348 martin if (!p1->p_limit->pl_writeable) {
2230 1.348 martin lim_addref(p1->p_limit);
2231 1.348 martin p2->p_limit = p1->p_limit;
2232 1.337 martin } else {
2233 1.337 martin p2->p_limit = lim_copy(p1->p_limit);
2234 1.337 martin }
2235 1.337 martin
2236 1.337 martin p2->p_lflag = 0;
2237 1.337 martin p2->p_sflag = 0;
2238 1.337 martin p2->p_slflag = 0;
2239 1.337 martin p2->p_pptr = p1;
2240 1.337 martin p2->p_ppid = p1->p_pid;
2241 1.337 martin LIST_INIT(&p2->p_children);
2242 1.337 martin
2243 1.337 martin p2->p_aio = NULL;
2244 1.337 martin
2245 1.337 martin #ifdef KTRACE
2246 1.337 martin /*
2247 1.337 martin * Copy traceflag and tracefile if enabled.
2248 1.337 martin * If not inherited, these were zeroed above.
2249 1.337 martin */
2250 1.337 martin if (p1->p_traceflag & KTRFAC_INHERIT) {
2251 1.337 martin mutex_enter(&ktrace_lock);
2252 1.337 martin p2->p_traceflag = p1->p_traceflag;
2253 1.337 martin if ((p2->p_tracep = p1->p_tracep) != NULL)
2254 1.337 martin ktradref(p2);
2255 1.337 martin mutex_exit(&ktrace_lock);
2256 1.337 martin }
2257 1.337 martin #endif
2258 1.337 martin
2259 1.337 martin /*
2260 1.337 martin * Create signal actions for the child process.
2261 1.337 martin */
2262 1.337 martin p2->p_sigacts = sigactsinit(p1, 0);
2263 1.337 martin mutex_enter(p1->p_lock);
2264 1.337 martin p2->p_sflag |=
2265 1.337 martin (p1->p_sflag & (PS_STOPFORK | PS_STOPEXEC | PS_NOCLDSTOP));
2266 1.337 martin sched_proc_fork(p1, p2);
2267 1.337 martin mutex_exit(p1->p_lock);
2268 1.337 martin
2269 1.337 martin p2->p_stflag = p1->p_stflag;
2270 1.337 martin
2271 1.337 martin /*
2272 1.337 martin * p_stats.
2273 1.337 martin * Copy parts of p_stats, and zero out the rest.
2274 1.337 martin */
2275 1.337 martin p2->p_stats = pstatscopy(p1->p_stats);
2276 1.337 martin
2277 1.337 martin /* copy over machdep flags to the new proc */
2278 1.337 martin cpu_proc_fork(p1, p2);
2279 1.337 martin
2280 1.337 martin /*
2281 1.337 martin * Prepare remaining parts of spawn data
2282 1.337 martin */
2283 1.348 martin spawn_data->sed_actions = fa;
2284 1.348 martin spawn_data->sed_attrs = sa;
2285 1.337 martin
2286 1.337 martin spawn_data->sed_parent = p1;
2287 1.337 martin
2288 1.337 martin /* create LWP */
2289 1.337 martin lwp_create(l1, p2, uaddr, 0, NULL, 0, spawn_return, spawn_data,
2290 1.337 martin &l2, l1->l_class);
2291 1.337 martin l2->l_ctxlink = NULL; /* reset ucontext link */
2292 1.337 martin
2293 1.337 martin /*
2294 1.337 martin * Copy the credential so other references don't see our changes.
2295 1.337 martin * Test to see if this is necessary first, since in the common case
2296 1.337 martin * we won't need a private reference.
2297 1.337 martin */
2298 1.337 martin if (kauth_cred_geteuid(l2->l_cred) != kauth_cred_getsvuid(l2->l_cred) ||
2299 1.337 martin kauth_cred_getegid(l2->l_cred) != kauth_cred_getsvgid(l2->l_cred)) {
2300 1.337 martin l2->l_cred = kauth_cred_copy(l2->l_cred);
2301 1.337 martin kauth_cred_setsvuid(l2->l_cred, kauth_cred_geteuid(l2->l_cred));
2302 1.337 martin kauth_cred_setsvgid(l2->l_cred, kauth_cred_getegid(l2->l_cred));
2303 1.337 martin }
2304 1.337 martin
2305 1.337 martin /* Update the master credentials. */
2306 1.337 martin if (l2->l_cred != p2->p_cred) {
2307 1.337 martin kauth_cred_t ocred;
2308 1.337 martin
2309 1.337 martin kauth_cred_hold(l2->l_cred);
2310 1.337 martin mutex_enter(p2->p_lock);
2311 1.337 martin ocred = p2->p_cred;
2312 1.337 martin p2->p_cred = l2->l_cred;
2313 1.337 martin mutex_exit(p2->p_lock);
2314 1.337 martin kauth_cred_free(ocred);
2315 1.337 martin }
2316 1.337 martin
2317 1.348 martin *child_ok = true;
2318 1.348 martin spawn_data->sed_refcnt = 2; /* child gets it as well */
2319 1.348 martin #if 0
2320 1.345 martin l2->l_nopreempt = 1; /* start it non-preemptable */
2321 1.348 martin #endif
2322 1.345 martin
2323 1.337 martin /*
2324 1.337 martin * It's now safe for the scheduler and other processes to see the
2325 1.337 martin * child process.
2326 1.337 martin */
2327 1.337 martin mutex_enter(proc_lock);
2328 1.337 martin
2329 1.337 martin if (p1->p_session->s_ttyvp != NULL && p1->p_lflag & PL_CONTROLT)
2330 1.337 martin p2->p_lflag |= PL_CONTROLT;
2331 1.337 martin
2332 1.337 martin LIST_INSERT_HEAD(&p1->p_children, p2, p_sibling);
2333 1.337 martin p2->p_exitsig = SIGCHLD; /* signal for parent on exit */
2334 1.337 martin
2335 1.337 martin LIST_INSERT_AFTER(p1, p2, p_pglist);
2336 1.337 martin LIST_INSERT_HEAD(&allproc, p2, p_list);
2337 1.337 martin
2338 1.337 martin p2->p_trace_enabled = trace_is_enabled(p2);
2339 1.337 martin #ifdef __HAVE_SYSCALL_INTERN
2340 1.337 martin (*p2->p_emul->e_syscall_intern)(p2);
2341 1.337 martin #endif
2342 1.337 martin
2343 1.337 martin /*
2344 1.337 martin * Make child runnable, set start time, and add to run queue except
2345 1.337 martin * if the parent requested the child to start in SSTOP state.
2346 1.337 martin */
2347 1.337 martin mutex_enter(p2->p_lock);
2348 1.337 martin
2349 1.337 martin getmicrotime(&p2->p_stats->p_start);
2350 1.337 martin
2351 1.337 martin lwp_lock(l2);
2352 1.337 martin KASSERT(p2->p_nrlwps == 1);
2353 1.337 martin p2->p_nrlwps = 1;
2354 1.337 martin p2->p_stat = SACTIVE;
2355 1.337 martin l2->l_stat = LSRUN;
2356 1.337 martin sched_enqueue(l2, false);
2357 1.337 martin lwp_unlock(l2);
2358 1.337 martin
2359 1.337 martin mutex_exit(p2->p_lock);
2360 1.337 martin mutex_exit(proc_lock);
2361 1.337 martin
2362 1.337 martin cv_wait(&spawn_data->sed_cv_child_ready, &spawn_data->sed_mtx_child);
2363 1.348 martin error = spawn_data->sed_error;
2364 1.337 martin mutex_exit(&spawn_data->sed_mtx_child);
2365 1.348 martin spawn_exec_data_release(spawn_data);
2366 1.337 martin
2367 1.341 martin rw_exit(&p1->p_reflock);
2368 1.337 martin rw_exit(&exec_lock);
2369 1.337 martin have_exec_lock = false;
2370 1.337 martin
2371 1.348 martin *pid_res = pid;
2372 1.348 martin return error;
2373 1.337 martin
2374 1.348 martin error_exit:
2375 1.348 martin if (have_exec_lock) {
2376 1.348 martin execve_free_data(&spawn_data->sed_exec);
2377 1.348 martin rw_exit(&p1->p_reflock);
2378 1.348 martin rw_exit(&exec_lock);
2379 1.348 martin }
2380 1.348 martin mutex_exit(&spawn_data->sed_mtx_child);
2381 1.348 martin spawn_exec_data_release(spawn_data);
2382 1.348 martin
2383 1.348 martin return error;
2384 1.348 martin }
2385 1.337 martin
2386 1.348 martin int
2387 1.348 martin sys_posix_spawn(struct lwp *l1, const struct sys_posix_spawn_args *uap,
2388 1.348 martin register_t *retval)
2389 1.348 martin {
2390 1.348 martin /* {
2391 1.348 martin syscallarg(pid_t *) pid;
2392 1.348 martin syscallarg(const char *) path;
2393 1.348 martin syscallarg(const struct posix_spawn_file_actions *) file_actions;
2394 1.348 martin syscallarg(const struct posix_spawnattr *) attrp;
2395 1.348 martin syscallarg(char *const *) argv;
2396 1.348 martin syscallarg(char *const *) envp;
2397 1.348 martin } */
2398 1.348 martin
2399 1.348 martin int error;
2400 1.348 martin struct posix_spawn_file_actions *fa = NULL;
2401 1.348 martin struct posix_spawnattr *sa = NULL;
2402 1.348 martin pid_t pid;
2403 1.348 martin bool child_ok = false;
2404 1.348 martin
2405 1.348 martin error = check_posix_spawn(l1);
2406 1.348 martin if (error) {
2407 1.348 martin *retval = error;
2408 1.348 martin return 0;
2409 1.348 martin }
2410 1.348 martin
2411 1.348 martin /* copy in file_actions struct */
2412 1.348 martin if (SCARG(uap, file_actions) != NULL) {
2413 1.348 martin error = posix_spawn_fa_alloc(&fa, SCARG(uap, file_actions));
2414 1.348 martin if (error)
2415 1.348 martin goto error_exit;
2416 1.348 martin }
2417 1.348 martin
2418 1.348 martin /* copyin posix_spawnattr struct */
2419 1.348 martin if (SCARG(uap, attrp) != NULL) {
2420 1.348 martin sa = kmem_alloc(sizeof(*sa), KM_SLEEP);
2421 1.348 martin error = copyin(SCARG(uap, attrp), sa, sizeof(*sa));
2422 1.348 martin if (error)
2423 1.348 martin goto error_exit;
2424 1.348 martin }
2425 1.337 martin
2426 1.348 martin /*
2427 1.348 martin * Do the spawn
2428 1.348 martin */
2429 1.348 martin error = do_posix_spawn(l1, &pid, &child_ok, SCARG(uap, path), fa, sa,
2430 1.348 martin SCARG(uap, argv), SCARG(uap, envp), execve_fetch_element);
2431 1.348 martin if (error)
2432 1.348 martin goto error_exit;
2433 1.337 martin
2434 1.337 martin if (error == 0 && SCARG(uap, pid) != NULL)
2435 1.337 martin error = copyout(&pid, SCARG(uap, pid), sizeof(pid));
2436 1.337 martin
2437 1.337 martin *retval = error;
2438 1.337 martin return 0;
2439 1.337 martin
2440 1.337 martin error_exit:
2441 1.348 martin if (!child_ok) {
2442 1.348 martin (void)chgproccnt(kauth_cred_getuid(l1->l_cred), -1);
2443 1.348 martin atomic_dec_uint(&nprocs);
2444 1.337 martin
2445 1.348 martin if (sa)
2446 1.348 martin kmem_free(sa, sizeof(*sa));
2447 1.348 martin if (fa)
2448 1.348 martin posix_spawn_fa_free(fa, fa->len);
2449 1.348 martin }
2450 1.337 martin
2451 1.337 martin *retval = error;
2452 1.337 martin return 0;
2453 1.337 martin }
2454 1.337 martin
2455 1.336 matt void
2456 1.336 matt exec_free_emul_arg(struct exec_package *epp)
2457 1.336 matt {
2458 1.336 matt if (epp->ep_emul_arg_free != NULL) {
2459 1.336 matt KASSERT(epp->ep_emul_arg != NULL);
2460 1.336 matt (*epp->ep_emul_arg_free)(epp->ep_emul_arg);
2461 1.336 matt epp->ep_emul_arg_free = NULL;
2462 1.336 matt epp->ep_emul_arg = NULL;
2463 1.336 matt } else {
2464 1.336 matt KASSERT(epp->ep_emul_arg == NULL);
2465 1.336 matt }
2466 1.336 matt }
2467