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