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