xref: /freebsd/sys/kern/sys_procdesc.c (revision f006524d)
1cfb5f768SJonathan Anderson /*-
24d846d26SWarner Losh  * SPDX-License-Identifier: BSD-2-Clause
38a36da99SPedro F. Giffuni  *
45fa69ff0SRobert Watson  * Copyright (c) 2009, 2016 Robert N. M. Watson
5cfb5f768SJonathan Anderson  * All rights reserved.
6cfb5f768SJonathan Anderson  *
7cfb5f768SJonathan Anderson  * This software was developed at the University of Cambridge Computer
8cfb5f768SJonathan Anderson  * Laboratory with support from a grant from Google, Inc.
9cfb5f768SJonathan Anderson  *
105fa69ff0SRobert Watson  * Portions of this software were developed by BAE Systems, the University of
115fa69ff0SRobert Watson  * Cambridge Computer Laboratory, and Memorial University under DARPA/AFRL
125fa69ff0SRobert Watson  * contract FA8650-15-C-7558 ("CADETS"), as part of the DARPA Transparent
135fa69ff0SRobert Watson  * Computing (TC) research program.
145fa69ff0SRobert Watson  *
15cfb5f768SJonathan Anderson  * Redistribution and use in source and binary forms, with or without
16cfb5f768SJonathan Anderson  * modification, are permitted provided that the following conditions
17cfb5f768SJonathan Anderson  * are met:
18cfb5f768SJonathan Anderson  * 1. Redistributions of source code must retain the above copyright
19cfb5f768SJonathan Anderson  *    notice, this list of conditions and the following disclaimer.
20cfb5f768SJonathan Anderson  * 2. Redistributions in binary form must reproduce the above copyright
21cfb5f768SJonathan Anderson  *    notice, this list of conditions and the following disclaimer in the
22cfb5f768SJonathan Anderson  *    documentation and/or other materials provided with the distribution.
23cfb5f768SJonathan Anderson  *
24cfb5f768SJonathan Anderson  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
25cfb5f768SJonathan Anderson  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26cfb5f768SJonathan Anderson  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27cfb5f768SJonathan Anderson  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
28cfb5f768SJonathan Anderson  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29cfb5f768SJonathan Anderson  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30cfb5f768SJonathan Anderson  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31cfb5f768SJonathan Anderson  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32cfb5f768SJonathan Anderson  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33cfb5f768SJonathan Anderson  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34cfb5f768SJonathan Anderson  * SUCH DAMAGE.
35cfb5f768SJonathan Anderson  */
36cfb5f768SJonathan Anderson 
37cfb5f768SJonathan Anderson /*-
38cfb5f768SJonathan Anderson  * FreeBSD process descriptor facility.
39cfb5f768SJonathan Anderson  *
40cfb5f768SJonathan Anderson  * Some processes are represented by a file descriptor, which will be used in
41cfb5f768SJonathan Anderson  * preference to signaling and pids for the purposes of process management,
42cfb5f768SJonathan Anderson  * and is, in effect, a form of capability.  When a process descriptor is
43cfb5f768SJonathan Anderson  * used with a process, it ceases to be visible to certain traditional UNIX
44cfb5f768SJonathan Anderson  * process facilities, such as waitpid(2).
45cfb5f768SJonathan Anderson  *
46cfb5f768SJonathan Anderson  * Some semantics:
47cfb5f768SJonathan Anderson  *
48cfb5f768SJonathan Anderson  * - At most one process descriptor will exist for any process, although
49cfb5f768SJonathan Anderson  *   references to that descriptor may be held from many processes (or even
50cfb5f768SJonathan Anderson  *   be in flight between processes over a local domain socket).
51cfb5f768SJonathan Anderson  * - Last close on the process descriptor will terminate the process using
52cfb5f768SJonathan Anderson  *   SIGKILL and reparent it to init so that there's a process to reap it
53cfb5f768SJonathan Anderson  *   when it's done exiting.
54cfb5f768SJonathan Anderson  * - If the process exits before the descriptor is closed, it will not
55cfb5f768SJonathan Anderson  *   generate SIGCHLD on termination, or be picked up by waitpid().
56cfb5f768SJonathan Anderson  * - The pdkill(2) system call may be used to deliver a signal to the process
57cfb5f768SJonathan Anderson  *   using its process descriptor.
58cfb5f768SJonathan Anderson  *
59cfb5f768SJonathan Anderson  * Open questions:
60cfb5f768SJonathan Anderson  *
61cfb5f768SJonathan Anderson  * - Will we want to add a pidtoprocdesc(2) system call to allow process
62d7a39436SEd Schouten  *   descriptors to be created for processes without pdfork(2)?
63cfb5f768SJonathan Anderson  */
64cfb5f768SJonathan Anderson 
65cfb5f768SJonathan Anderson #include <sys/param.h>
664a144410SRobert Watson #include <sys/capsicum.h>
67cfb5f768SJonathan Anderson #include <sys/fcntl.h>
68cfb5f768SJonathan Anderson #include <sys/file.h>
69cfb5f768SJonathan Anderson #include <sys/filedesc.h>
70cfb5f768SJonathan Anderson #include <sys/kernel.h>
71cfb5f768SJonathan Anderson #include <sys/lock.h>
72cfb5f768SJonathan Anderson #include <sys/mutex.h>
73cfb5f768SJonathan Anderson #include <sys/poll.h>
74cfb5f768SJonathan Anderson #include <sys/proc.h>
75cfb5f768SJonathan Anderson #include <sys/procdesc.h>
76cfb5f768SJonathan Anderson #include <sys/resourcevar.h>
77cfb5f768SJonathan Anderson #include <sys/stat.h>
78cfb5f768SJonathan Anderson #include <sys/sysproto.h>
79cfb5f768SJonathan Anderson #include <sys/sysctl.h>
80cfb5f768SJonathan Anderson #include <sys/systm.h>
81cfb5f768SJonathan Anderson #include <sys/ucred.h>
829696feebSJohn Baldwin #include <sys/user.h>
83cfb5f768SJonathan Anderson 
84cfb5f768SJonathan Anderson #include <security/audit/audit.h>
85cfb5f768SJonathan Anderson 
86cfb5f768SJonathan Anderson #include <vm/uma.h>
87cfb5f768SJonathan Anderson 
88cfb5f768SJonathan Anderson FEATURE(process_descriptors, "Process Descriptors");
89cfb5f768SJonathan Anderson 
90523d6673SMateusz Guzik MALLOC_DEFINE(M_PROCDESC, "procdesc", "process descriptors");
91cfb5f768SJonathan Anderson 
92cfb5f768SJonathan Anderson static fo_poll_t	procdesc_poll;
93cfb5f768SJonathan Anderson static fo_kqfilter_t	procdesc_kqfilter;
94cfb5f768SJonathan Anderson static fo_stat_t	procdesc_stat;
95cfb5f768SJonathan Anderson static fo_close_t	procdesc_close;
969696feebSJohn Baldwin static fo_fill_kinfo_t	procdesc_fill_kinfo;
97f006524dSKonstantin Belousov static fo_cmp_t		procdesc_cmp;
98cfb5f768SJonathan Anderson 
99cfb5f768SJonathan Anderson static struct fileops procdesc_ops = {
1002d69d0dcSJohn Baldwin 	.fo_read = invfo_rdwr,
1012d69d0dcSJohn Baldwin 	.fo_write = invfo_rdwr,
1022d69d0dcSJohn Baldwin 	.fo_truncate = invfo_truncate,
1032d69d0dcSJohn Baldwin 	.fo_ioctl = invfo_ioctl,
104cfb5f768SJonathan Anderson 	.fo_poll = procdesc_poll,
105cfb5f768SJonathan Anderson 	.fo_kqfilter = procdesc_kqfilter,
106cfb5f768SJonathan Anderson 	.fo_stat = procdesc_stat,
107cfb5f768SJonathan Anderson 	.fo_close = procdesc_close,
1082d69d0dcSJohn Baldwin 	.fo_chmod = invfo_chmod,
1092d69d0dcSJohn Baldwin 	.fo_chown = invfo_chown,
110b1dd38f4SKonstantin Belousov 	.fo_sendfile = invfo_sendfile,
1119696feebSJohn Baldwin 	.fo_fill_kinfo = procdesc_fill_kinfo,
112f006524dSKonstantin Belousov 	.fo_cmp = procdesc_cmp,
113cfb5f768SJonathan Anderson 	.fo_flags = DFLAG_PASSABLE,
114cfb5f768SJonathan Anderson };
115cfb5f768SJonathan Anderson 
116cfb5f768SJonathan Anderson /*
117cfb5f768SJonathan Anderson  * Return a locked process given a process descriptor, or ESRCH if it has
118cfb5f768SJonathan Anderson  * died.
119cfb5f768SJonathan Anderson  */
120cfb5f768SJonathan Anderson int
procdesc_find(struct thread * td,int fd,cap_rights_t * rightsp,struct proc ** p)1217008be5bSPawel Jakub Dawidek procdesc_find(struct thread *td, int fd, cap_rights_t *rightsp,
122cfb5f768SJonathan Anderson     struct proc **p)
123cfb5f768SJonathan Anderson {
124cfb5f768SJonathan Anderson 	struct procdesc *pd;
125cfb5f768SJonathan Anderson 	struct file *fp;
126cfb5f768SJonathan Anderson 	int error;
127cfb5f768SJonathan Anderson 
1287008be5bSPawel Jakub Dawidek 	error = fget(td, fd, rightsp, &fp);
129cfb5f768SJonathan Anderson 	if (error)
130cfb5f768SJonathan Anderson 		return (error);
131cfb5f768SJonathan Anderson 	if (fp->f_type != DTYPE_PROCDESC) {
132cfb5f768SJonathan Anderson 		error = EBADF;
133cfb5f768SJonathan Anderson 		goto out;
134cfb5f768SJonathan Anderson 	}
135cfb5f768SJonathan Anderson 	pd = fp->f_data;
136cfb5f768SJonathan Anderson 	sx_slock(&proctree_lock);
137cfb5f768SJonathan Anderson 	if (pd->pd_proc != NULL) {
138cfb5f768SJonathan Anderson 		*p = pd->pd_proc;
139cfb5f768SJonathan Anderson 		PROC_LOCK(*p);
140cfb5f768SJonathan Anderson 	} else
141cfb5f768SJonathan Anderson 		error = ESRCH;
142cfb5f768SJonathan Anderson 	sx_sunlock(&proctree_lock);
143cfb5f768SJonathan Anderson out:
144cfb5f768SJonathan Anderson 	fdrop(fp, td);
145cfb5f768SJonathan Anderson 	return (error);
146cfb5f768SJonathan Anderson }
147cfb5f768SJonathan Anderson 
148cfb5f768SJonathan Anderson /*
149cfb5f768SJonathan Anderson  * Function to be used by procstat(1) sysctls when returning procdesc
150cfb5f768SJonathan Anderson  * information.
151cfb5f768SJonathan Anderson  */
152cfb5f768SJonathan Anderson pid_t
procdesc_pid(struct file * fp_procdesc)153cfb5f768SJonathan Anderson procdesc_pid(struct file *fp_procdesc)
154cfb5f768SJonathan Anderson {
155cfb5f768SJonathan Anderson 	struct procdesc *pd;
156cfb5f768SJonathan Anderson 
157cfb5f768SJonathan Anderson 	KASSERT(fp_procdesc->f_type == DTYPE_PROCDESC,
158cfb5f768SJonathan Anderson 	   ("procdesc_pid: !procdesc"));
159cfb5f768SJonathan Anderson 
160cfb5f768SJonathan Anderson 	pd = fp_procdesc->f_data;
161cfb5f768SJonathan Anderson 	return (pd->pd_pid);
162cfb5f768SJonathan Anderson }
163cfb5f768SJonathan Anderson 
164cfb5f768SJonathan Anderson /*
165cfb5f768SJonathan Anderson  * Retrieve the PID associated with a process descriptor.
166cfb5f768SJonathan Anderson  */
167cfb5f768SJonathan Anderson int
kern_pdgetpid(struct thread * td,int fd,cap_rights_t * rightsp,pid_t * pidp)1687008be5bSPawel Jakub Dawidek kern_pdgetpid(struct thread *td, int fd, cap_rights_t *rightsp, pid_t *pidp)
169cfb5f768SJonathan Anderson {
170cfb5f768SJonathan Anderson 	struct file *fp;
171cfb5f768SJonathan Anderson 	int error;
172cfb5f768SJonathan Anderson 
1737008be5bSPawel Jakub Dawidek 	error = fget(td, fd, rightsp, &fp);
174cfb5f768SJonathan Anderson 	if (error)
175cfb5f768SJonathan Anderson 		return (error);
176cfb5f768SJonathan Anderson 	if (fp->f_type != DTYPE_PROCDESC) {
177cfb5f768SJonathan Anderson 		error = EBADF;
178cfb5f768SJonathan Anderson 		goto out;
179cfb5f768SJonathan Anderson 	}
180cfb5f768SJonathan Anderson 	*pidp = procdesc_pid(fp);
181cfb5f768SJonathan Anderson out:
182cfb5f768SJonathan Anderson 	fdrop(fp, td);
183cfb5f768SJonathan Anderson 	return (error);
184cfb5f768SJonathan Anderson }
185cfb5f768SJonathan Anderson 
186cfb5f768SJonathan Anderson /*
187cfb5f768SJonathan Anderson  * System call to return the pid of a process given its process descriptor.
188cfb5f768SJonathan Anderson  */
189cfb5f768SJonathan Anderson int
sys_pdgetpid(struct thread * td,struct pdgetpid_args * uap)1908451d0ddSKip Macy sys_pdgetpid(struct thread *td, struct pdgetpid_args *uap)
191cfb5f768SJonathan Anderson {
192cfb5f768SJonathan Anderson 	pid_t pid;
193cfb5f768SJonathan Anderson 	int error;
194cfb5f768SJonathan Anderson 
195cfb5f768SJonathan Anderson 	AUDIT_ARG_FD(uap->fd);
196cbd92ce6SMatt Macy 	error = kern_pdgetpid(td, uap->fd, &cap_pdgetpid_rights, &pid);
197cfb5f768SJonathan Anderson 	if (error == 0)
198cfb5f768SJonathan Anderson 		error = copyout(&pid, uap->pidp, sizeof(pid));
199cfb5f768SJonathan Anderson 	return (error);
200cfb5f768SJonathan Anderson }
201cfb5f768SJonathan Anderson 
202cfb5f768SJonathan Anderson /*
203cfb5f768SJonathan Anderson  * When a new process is forked by pdfork(), a file descriptor is allocated
204cfb5f768SJonathan Anderson  * by the fork code first, then the process is forked, and then we get a
205cfb5f768SJonathan Anderson  * chance to set up the process descriptor.  Failure is not permitted at this
206cfb5f768SJonathan Anderson  * point, so procdesc_new() must succeed.
207cfb5f768SJonathan Anderson  */
208cfb5f768SJonathan Anderson void
procdesc_new(struct proc * p,int flags)209cfb5f768SJonathan Anderson procdesc_new(struct proc *p, int flags)
210cfb5f768SJonathan Anderson {
211cfb5f768SJonathan Anderson 	struct procdesc *pd;
212cfb5f768SJonathan Anderson 
213523d6673SMateusz Guzik 	pd = malloc(sizeof(*pd), M_PROCDESC, M_WAITOK | M_ZERO);
214cfb5f768SJonathan Anderson 	pd->pd_proc = p;
215cfb5f768SJonathan Anderson 	pd->pd_pid = p->p_pid;
216cfb5f768SJonathan Anderson 	p->p_procdesc = pd;
217cfb5f768SJonathan Anderson 	pd->pd_flags = 0;
218cfb5f768SJonathan Anderson 	if (flags & PD_DAEMON)
219cfb5f768SJonathan Anderson 		pd->pd_flags |= PDF_DAEMON;
220cfb5f768SJonathan Anderson 	PROCDESC_LOCK_INIT(pd);
22138219d6aSEd Schouten 	knlist_init_mtx(&pd->pd_selinfo.si_note, &pd->pd_lock);
222cfb5f768SJonathan Anderson 
223cfb5f768SJonathan Anderson 	/*
224cfb5f768SJonathan Anderson 	 * Process descriptors start out with two references: one from their
225cfb5f768SJonathan Anderson 	 * struct file, and the other from their struct proc.
226cfb5f768SJonathan Anderson 	 */
227cfb5f768SJonathan Anderson 	refcount_init(&pd->pd_refcount, 2);
228cfb5f768SJonathan Anderson }
229cfb5f768SJonathan Anderson 
230cfb5f768SJonathan Anderson /*
231b3a73448SMariusz Zaborski  * Create a new process decriptor for the process that refers to it.
232b3a73448SMariusz Zaborski  */
233b3a73448SMariusz Zaborski int
procdesc_falloc(struct thread * td,struct file ** resultfp,int * resultfd,int flags,struct filecaps * fcaps)234b3a73448SMariusz Zaborski procdesc_falloc(struct thread *td, struct file **resultfp, int *resultfd,
235b3a73448SMariusz Zaborski     int flags, struct filecaps *fcaps)
236b3a73448SMariusz Zaborski {
237b3a73448SMariusz Zaborski 	int fflags;
238b3a73448SMariusz Zaborski 
239b3a73448SMariusz Zaborski 	fflags = 0;
240b3a73448SMariusz Zaborski 	if (flags & PD_CLOEXEC)
241b3a73448SMariusz Zaborski 		fflags = O_CLOEXEC;
242b3a73448SMariusz Zaborski 
243b3a73448SMariusz Zaborski 	return (falloc_caps(td, resultfp, resultfd, fflags, fcaps));
244b3a73448SMariusz Zaborski }
245b3a73448SMariusz Zaborski 
246b3a73448SMariusz Zaborski /*
247cfb5f768SJonathan Anderson  * Initialize a file with a process descriptor.
248cfb5f768SJonathan Anderson  */
249cfb5f768SJonathan Anderson void
procdesc_finit(struct procdesc * pdp,struct file * fp)250cfb5f768SJonathan Anderson procdesc_finit(struct procdesc *pdp, struct file *fp)
251cfb5f768SJonathan Anderson {
252cfb5f768SJonathan Anderson 
253cfb5f768SJonathan Anderson 	finit(fp, FREAD | FWRITE, DTYPE_PROCDESC, pdp, &procdesc_ops);
254cfb5f768SJonathan Anderson }
255cfb5f768SJonathan Anderson 
256cfb5f768SJonathan Anderson static void
procdesc_free(struct procdesc * pd)257cfb5f768SJonathan Anderson procdesc_free(struct procdesc *pd)
258cfb5f768SJonathan Anderson {
259cfb5f768SJonathan Anderson 
260cfb5f768SJonathan Anderson 	/*
261cfb5f768SJonathan Anderson 	 * When the last reference is released, we assert that the descriptor
262cfb5f768SJonathan Anderson 	 * has been closed, but not that the process has exited, as we will
263cfb5f768SJonathan Anderson 	 * detach the descriptor before the process dies if the descript is
264cfb5f768SJonathan Anderson 	 * closed, as we can't wait synchronously.
265cfb5f768SJonathan Anderson 	 */
266cfb5f768SJonathan Anderson 	if (refcount_release(&pd->pd_refcount)) {
267cfb5f768SJonathan Anderson 		KASSERT(pd->pd_proc == NULL,
268cfb5f768SJonathan Anderson 		    ("procdesc_free: pd_proc != NULL"));
269cfb5f768SJonathan Anderson 		KASSERT((pd->pd_flags & PDF_CLOSED),
270cfb5f768SJonathan Anderson 		    ("procdesc_free: !PDF_CLOSED"));
271cfb5f768SJonathan Anderson 
27238219d6aSEd Schouten 		knlist_destroy(&pd->pd_selinfo.si_note);
273cfb5f768SJonathan Anderson 		PROCDESC_LOCK_DESTROY(pd);
274523d6673SMateusz Guzik 		free(pd, M_PROCDESC);
275cfb5f768SJonathan Anderson 	}
276cfb5f768SJonathan Anderson }
277cfb5f768SJonathan Anderson 
278cfb5f768SJonathan Anderson /*
279cfb5f768SJonathan Anderson  * procdesc_exit() - notify a process descriptor that its process is exiting.
280cfb5f768SJonathan Anderson  * We use the proctree_lock to ensure that process exit either happens
281cfb5f768SJonathan Anderson  * strictly before or strictly after a concurrent call to procdesc_close().
282cfb5f768SJonathan Anderson  */
283cfb5f768SJonathan Anderson int
procdesc_exit(struct proc * p)284cfb5f768SJonathan Anderson procdesc_exit(struct proc *p)
285cfb5f768SJonathan Anderson {
286cfb5f768SJonathan Anderson 	struct procdesc *pd;
287cfb5f768SJonathan Anderson 
288cfb5f768SJonathan Anderson 	sx_assert(&proctree_lock, SA_XLOCKED);
289cfb5f768SJonathan Anderson 	PROC_LOCK_ASSERT(p, MA_OWNED);
290cfb5f768SJonathan Anderson 	KASSERT(p->p_procdesc != NULL, ("procdesc_exit: p_procdesc NULL"));
291cfb5f768SJonathan Anderson 
292cfb5f768SJonathan Anderson 	pd = p->p_procdesc;
293cfb5f768SJonathan Anderson 
294cfb5f768SJonathan Anderson 	PROCDESC_LOCK(pd);
295ddab8c35SMark Johnston 	KASSERT((pd->pd_flags & PDF_CLOSED) == 0 || p->p_pptr == p->p_reaper,
296ddab8c35SMark Johnston 	    ("procdesc_exit: closed && parent not reaper"));
297cfb5f768SJonathan Anderson 
298cfb5f768SJonathan Anderson 	pd->pd_flags |= PDF_EXITED;
299b4490c6eSKonstantin Belousov 	pd->pd_xstat = KW_EXITCODE(p->p_xexit, p->p_xsig);
300cfb5f768SJonathan Anderson 
301cfb5f768SJonathan Anderson 	/*
302cfb5f768SJonathan Anderson 	 * If the process descriptor has been closed, then we have nothing
303cfb5f768SJonathan Anderson 	 * to do; return 1 so that init will get SIGCHLD and do the reaping.
304cfb5f768SJonathan Anderson 	 * Clean up the procdesc now rather than letting it happen during
305cfb5f768SJonathan Anderson 	 * that reap.
306cfb5f768SJonathan Anderson 	 */
307cfb5f768SJonathan Anderson 	if (pd->pd_flags & PDF_CLOSED) {
308cfb5f768SJonathan Anderson 		PROCDESC_UNLOCK(pd);
309cfb5f768SJonathan Anderson 		pd->pd_proc = NULL;
310cfb5f768SJonathan Anderson 		p->p_procdesc = NULL;
311cfb5f768SJonathan Anderson 		procdesc_free(pd);
312cfb5f768SJonathan Anderson 		return (1);
313cfb5f768SJonathan Anderson 	}
314cfb5f768SJonathan Anderson 	if (pd->pd_flags & PDF_SELECTED) {
315cfb5f768SJonathan Anderson 		pd->pd_flags &= ~PDF_SELECTED;
316cfb5f768SJonathan Anderson 		selwakeup(&pd->pd_selinfo);
317cfb5f768SJonathan Anderson 	}
31838219d6aSEd Schouten 	KNOTE_LOCKED(&pd->pd_selinfo.si_note, NOTE_EXIT);
319cfb5f768SJonathan Anderson 	PROCDESC_UNLOCK(pd);
320cfb5f768SJonathan Anderson 	return (0);
321cfb5f768SJonathan Anderson }
322cfb5f768SJonathan Anderson 
323cfb5f768SJonathan Anderson /*
3245657e065SWarner Losh  * When a process descriptor is reaped, perhaps as a result of close(), release
3255657e065SWarner Losh  * the process's reference on the process descriptor.
326cfb5f768SJonathan Anderson  */
327cfb5f768SJonathan Anderson void
procdesc_reap(struct proc * p)328cfb5f768SJonathan Anderson procdesc_reap(struct proc *p)
329cfb5f768SJonathan Anderson {
330cfb5f768SJonathan Anderson 	struct procdesc *pd;
331cfb5f768SJonathan Anderson 
332cfb5f768SJonathan Anderson 	sx_assert(&proctree_lock, SA_XLOCKED);
333cfb5f768SJonathan Anderson 	KASSERT(p->p_procdesc != NULL, ("procdesc_reap: p_procdesc == NULL"));
334cfb5f768SJonathan Anderson 
335cfb5f768SJonathan Anderson 	pd = p->p_procdesc;
336cfb5f768SJonathan Anderson 	pd->pd_proc = NULL;
337707641ecSPawel Jakub Dawidek 	p->p_procdesc = NULL;
338cfb5f768SJonathan Anderson 	procdesc_free(pd);
339cfb5f768SJonathan Anderson }
340cfb5f768SJonathan Anderson 
341cfb5f768SJonathan Anderson /*
342cfb5f768SJonathan Anderson  * procdesc_close() - last close on a process descriptor.  If the process is
34353e16463SPawel Jakub Dawidek  * still running, terminate with SIGKILL (unless PDF_DAEMON is set) and let
344ddab8c35SMark Johnston  * its reaper clean up the mess; if not, we have to clean up the zombie
345ddab8c35SMark Johnston  * ourselves.
346cfb5f768SJonathan Anderson  */
347cfb5f768SJonathan Anderson static int
procdesc_close(struct file * fp,struct thread * td)348cfb5f768SJonathan Anderson procdesc_close(struct file *fp, struct thread *td)
349cfb5f768SJonathan Anderson {
350cfb5f768SJonathan Anderson 	struct procdesc *pd;
351cfb5f768SJonathan Anderson 	struct proc *p;
352cfb5f768SJonathan Anderson 
353cfb5f768SJonathan Anderson 	KASSERT(fp->f_type == DTYPE_PROCDESC, ("procdesc_close: !procdesc"));
354cfb5f768SJonathan Anderson 
355cfb5f768SJonathan Anderson 	pd = fp->f_data;
356cfb5f768SJonathan Anderson 	fp->f_ops = &badfileops;
357cfb5f768SJonathan Anderson 	fp->f_data = NULL;
358cfb5f768SJonathan Anderson 
359cfb5f768SJonathan Anderson 	sx_xlock(&proctree_lock);
360cfb5f768SJonathan Anderson 	PROCDESC_LOCK(pd);
361cfb5f768SJonathan Anderson 	pd->pd_flags |= PDF_CLOSED;
362cfb5f768SJonathan Anderson 	PROCDESC_UNLOCK(pd);
363cfb5f768SJonathan Anderson 	p = pd->pd_proc;
364707641ecSPawel Jakub Dawidek 	if (p == NULL) {
365707641ecSPawel Jakub Dawidek 		/*
366707641ecSPawel Jakub Dawidek 		 * This is the case where process' exit status was already
367707641ecSPawel Jakub Dawidek 		 * collected and procdesc_reap() was already called.
368707641ecSPawel Jakub Dawidek 		 */
369707641ecSPawel Jakub Dawidek 		sx_xunlock(&proctree_lock);
370a90feb39SEd Schouten 	} else {
371707641ecSPawel Jakub Dawidek 		PROC_LOCK(p);
3725fa69ff0SRobert Watson 		AUDIT_ARG_PROCESS(p);
373a90feb39SEd Schouten 		if (p->p_state == PRS_ZOMBIE) {
374a90feb39SEd Schouten 			/*
375a90feb39SEd Schouten 			 * If the process is already dead and just awaiting
376a90feb39SEd Schouten 			 * reaping, do that now.  This will release the
377a90feb39SEd Schouten 			 * process's reference to the process descriptor when it
378a90feb39SEd Schouten 			 * calls back into procdesc_reap().
379a90feb39SEd Schouten 			 */
380f13b5a0fSKonstantin Belousov 			proc_reap(curthread, p, NULL, 0);
381cfb5f768SJonathan Anderson 		} else {
382cfb5f768SJonathan Anderson 			/*
383a90feb39SEd Schouten 			 * If the process is not yet dead, we need to kill it,
384a90feb39SEd Schouten 			 * but we can't wait around synchronously for it to go
385a90feb39SEd Schouten 			 * away, as that path leads to madness (and deadlocks).
386a90feb39SEd Schouten 			 * First, detach the process from its descriptor so that
387a90feb39SEd Schouten 			 * its exit status will be reported normally.
388cfb5f768SJonathan Anderson 			 */
389cfb5f768SJonathan Anderson 			pd->pd_proc = NULL;
390cfb5f768SJonathan Anderson 			p->p_procdesc = NULL;
391cfb5f768SJonathan Anderson 			procdesc_free(pd);
392cfb5f768SJonathan Anderson 
393cfb5f768SJonathan Anderson 			/*
394ddab8c35SMark Johnston 			 * Next, reparent it to its reaper (usually init(8)) so
395ddab8c35SMark Johnston 			 * that there's someone to pick up the pieces; finally,
396ddab8c35SMark Johnston 			 * terminate with prejudice.
397cfb5f768SJonathan Anderson 			 */
398cfb5f768SJonathan Anderson 			p->p_sigparent = SIGCHLD;
399fd631bcdSMariusz Zaborski 			if ((p->p_flag & P_TRACED) == 0) {
4002c054ce9SMateusz Guzik 				proc_reparent(p, p->p_reaper, true);
401fd631bcdSMariusz Zaborski 			} else {
402c878d1ebSMariusz Zaborski 				proc_clear_orphan(p);
403fd631bcdSMariusz Zaborski 				p->p_oppid = p->p_reaper->p_pid;
404fd631bcdSMariusz Zaborski 				proc_add_orphan(p, p->p_reaper);
405fd631bcdSMariusz Zaborski 			}
40653e16463SPawel Jakub Dawidek 			if ((pd->pd_flags & PDF_DAEMON) == 0)
4078451d0ddSKip Macy 				kern_psignal(p, SIGKILL);
408cfb5f768SJonathan Anderson 			PROC_UNLOCK(p);
409cfb5f768SJonathan Anderson 			sx_xunlock(&proctree_lock);
410cfb5f768SJonathan Anderson 		}
411a90feb39SEd Schouten 	}
412cfb5f768SJonathan Anderson 
413cfb5f768SJonathan Anderson 	/*
414cfb5f768SJonathan Anderson 	 * Release the file descriptor's reference on the process descriptor.
415cfb5f768SJonathan Anderson 	 */
416cfb5f768SJonathan Anderson 	procdesc_free(pd);
417cfb5f768SJonathan Anderson 	return (0);
418cfb5f768SJonathan Anderson }
419cfb5f768SJonathan Anderson 
420cfb5f768SJonathan Anderson static int
procdesc_poll(struct file * fp,int events,struct ucred * active_cred,struct thread * td)421cfb5f768SJonathan Anderson procdesc_poll(struct file *fp, int events, struct ucred *active_cred,
422cfb5f768SJonathan Anderson     struct thread *td)
423cfb5f768SJonathan Anderson {
424cfb5f768SJonathan Anderson 	struct procdesc *pd;
425cfb5f768SJonathan Anderson 	int revents;
426cfb5f768SJonathan Anderson 
427cfb5f768SJonathan Anderson 	revents = 0;
428cfb5f768SJonathan Anderson 	pd = fp->f_data;
429cfb5f768SJonathan Anderson 	PROCDESC_LOCK(pd);
430cfb5f768SJonathan Anderson 	if (pd->pd_flags & PDF_EXITED)
431cfb5f768SJonathan Anderson 		revents |= POLLHUP;
432cfb5f768SJonathan Anderson 	if (revents == 0) {
433cfb5f768SJonathan Anderson 		selrecord(td, &pd->pd_selinfo);
434cfb5f768SJonathan Anderson 		pd->pd_flags |= PDF_SELECTED;
435cfb5f768SJonathan Anderson 	}
436cfb5f768SJonathan Anderson 	PROCDESC_UNLOCK(pd);
437cfb5f768SJonathan Anderson 	return (revents);
438cfb5f768SJonathan Anderson }
439cfb5f768SJonathan Anderson 
44038219d6aSEd Schouten static void
procdesc_kqops_detach(struct knote * kn)44138219d6aSEd Schouten procdesc_kqops_detach(struct knote *kn)
44238219d6aSEd Schouten {
44338219d6aSEd Schouten 	struct procdesc *pd;
44438219d6aSEd Schouten 
44538219d6aSEd Schouten 	pd = kn->kn_fp->f_data;
44638219d6aSEd Schouten 	knlist_remove(&pd->pd_selinfo.si_note, kn, 0);
44738219d6aSEd Schouten }
44838219d6aSEd Schouten 
44938219d6aSEd Schouten static int
procdesc_kqops_event(struct knote * kn,long hint)45038219d6aSEd Schouten procdesc_kqops_event(struct knote *kn, long hint)
45138219d6aSEd Schouten {
45238219d6aSEd Schouten 	struct procdesc *pd;
45338219d6aSEd Schouten 	u_int event;
45438219d6aSEd Schouten 
45538219d6aSEd Schouten 	pd = kn->kn_fp->f_data;
45638219d6aSEd Schouten 	if (hint == 0) {
45738219d6aSEd Schouten 		/*
45838219d6aSEd Schouten 		 * Initial test after registration. Generate a NOTE_EXIT in
45938219d6aSEd Schouten 		 * case the process already terminated before registration.
46038219d6aSEd Schouten 		 */
46138219d6aSEd Schouten 		event = pd->pd_flags & PDF_EXITED ? NOTE_EXIT : 0;
46238219d6aSEd Schouten 	} else {
46338219d6aSEd Schouten 		/* Mask off extra data. */
46438219d6aSEd Schouten 		event = (u_int)hint & NOTE_PCTRLMASK;
46538219d6aSEd Schouten 	}
46638219d6aSEd Schouten 
46738219d6aSEd Schouten 	/* If the user is interested in this event, record it. */
46838219d6aSEd Schouten 	if (kn->kn_sfflags & event)
46938219d6aSEd Schouten 		kn->kn_fflags |= event;
47038219d6aSEd Schouten 
47138219d6aSEd Schouten 	/* Process is gone, so flag the event as finished. */
47238219d6aSEd Schouten 	if (event == NOTE_EXIT) {
47338219d6aSEd Schouten 		kn->kn_flags |= EV_EOF | EV_ONESHOT;
47438219d6aSEd Schouten 		if (kn->kn_fflags & NOTE_EXIT)
47538219d6aSEd Schouten 			kn->kn_data = pd->pd_xstat;
47638219d6aSEd Schouten 		if (kn->kn_fflags == 0)
47738219d6aSEd Schouten 			kn->kn_flags |= EV_DROP;
47838219d6aSEd Schouten 		return (1);
47938219d6aSEd Schouten 	}
48038219d6aSEd Schouten 
48138219d6aSEd Schouten 	return (kn->kn_fflags != 0);
48238219d6aSEd Schouten }
48338219d6aSEd Schouten 
48438219d6aSEd Schouten static struct filterops procdesc_kqops = {
48538219d6aSEd Schouten 	.f_isfd = 1,
48638219d6aSEd Schouten 	.f_detach = procdesc_kqops_detach,
48738219d6aSEd Schouten 	.f_event = procdesc_kqops_event,
48838219d6aSEd Schouten };
48938219d6aSEd Schouten 
490cfb5f768SJonathan Anderson static int
procdesc_kqfilter(struct file * fp,struct knote * kn)491cfb5f768SJonathan Anderson procdesc_kqfilter(struct file *fp, struct knote *kn)
492cfb5f768SJonathan Anderson {
49338219d6aSEd Schouten 	struct procdesc *pd;
494cfb5f768SJonathan Anderson 
49538219d6aSEd Schouten 	pd = fp->f_data;
49638219d6aSEd Schouten 	switch (kn->kn_filter) {
49738219d6aSEd Schouten 	case EVFILT_PROCDESC:
49838219d6aSEd Schouten 		kn->kn_fop = &procdesc_kqops;
49938219d6aSEd Schouten 		kn->kn_flags |= EV_CLEAR;
50038219d6aSEd Schouten 		knlist_add(&pd->pd_selinfo.si_note, kn, 0);
50138219d6aSEd Schouten 		return (0);
50238219d6aSEd Schouten 	default:
50338219d6aSEd Schouten 		return (EINVAL);
50438219d6aSEd Schouten 	}
505cfb5f768SJonathan Anderson }
506cfb5f768SJonathan Anderson 
507cfb5f768SJonathan Anderson static int
procdesc_stat(struct file * fp,struct stat * sb,struct ucred * active_cred)5082b68eb8eSMateusz Guzik procdesc_stat(struct file *fp, struct stat *sb, struct ucred *active_cred)
509cfb5f768SJonathan Anderson {
510cfb5f768SJonathan Anderson 	struct procdesc *pd;
511584b675eSKonstantin Belousov 	struct timeval pstart, boottime;
512cfb5f768SJonathan Anderson 
513cfb5f768SJonathan Anderson 	/*
514cfb5f768SJonathan Anderson 	 * XXXRW: Perhaps we should cache some more information from the
515cfb5f768SJonathan Anderson 	 * process so that we can return it reliably here even after it has
516cfb5f768SJonathan Anderson 	 * died.  For example, caching its credential data.
517cfb5f768SJonathan Anderson 	 */
518cfb5f768SJonathan Anderson 	bzero(sb, sizeof(*sb));
519cfb5f768SJonathan Anderson 	pd = fp->f_data;
520cfb5f768SJonathan Anderson 	sx_slock(&proctree_lock);
521cfb5f768SJonathan Anderson 	if (pd->pd_proc != NULL) {
522cfb5f768SJonathan Anderson 		PROC_LOCK(pd->pd_proc);
5235fa69ff0SRobert Watson 		AUDIT_ARG_PROCESS(pd->pd_proc);
524cfb5f768SJonathan Anderson 
525cfb5f768SJonathan Anderson 		/* Set birth and [acm] times to process start time. */
526cfb5f768SJonathan Anderson 		pstart = pd->pd_proc->p_stats->p_start;
527584b675eSKonstantin Belousov 		getboottime(&boottime);
528cfb5f768SJonathan Anderson 		timevaladd(&pstart, &boottime);
529cfb5f768SJonathan Anderson 		TIMEVAL_TO_TIMESPEC(&pstart, &sb->st_birthtim);
530cfb5f768SJonathan Anderson 		sb->st_atim = sb->st_birthtim;
531cfb5f768SJonathan Anderson 		sb->st_ctim = sb->st_birthtim;
532cfb5f768SJonathan Anderson 		sb->st_mtim = sb->st_birthtim;
533cfb5f768SJonathan Anderson 		if (pd->pd_proc->p_state != PRS_ZOMBIE)
534cfb5f768SJonathan Anderson 			sb->st_mode = S_IFREG | S_IRWXU;
535cfb5f768SJonathan Anderson 		else
536cfb5f768SJonathan Anderson 			sb->st_mode = S_IFREG;
537cfb5f768SJonathan Anderson 		sb->st_uid = pd->pd_proc->p_ucred->cr_ruid;
538cfb5f768SJonathan Anderson 		sb->st_gid = pd->pd_proc->p_ucred->cr_rgid;
539cfb5f768SJonathan Anderson 		PROC_UNLOCK(pd->pd_proc);
540cfb5f768SJonathan Anderson 	} else
541cfb5f768SJonathan Anderson 		sb->st_mode = S_IFREG;
542cfb5f768SJonathan Anderson 	sx_sunlock(&proctree_lock);
543cfb5f768SJonathan Anderson 	return (0);
544cfb5f768SJonathan Anderson }
545cfb5f768SJonathan Anderson 
5469696feebSJohn Baldwin static int
procdesc_fill_kinfo(struct file * fp,struct kinfo_file * kif,struct filedesc * fdp)5479696feebSJohn Baldwin procdesc_fill_kinfo(struct file *fp, struct kinfo_file *kif,
5489696feebSJohn Baldwin     struct filedesc *fdp)
5499696feebSJohn Baldwin {
5509696feebSJohn Baldwin 	struct procdesc *pdp;
5519696feebSJohn Baldwin 
5529696feebSJohn Baldwin 	kif->kf_type = KF_TYPE_PROCDESC;
5539696feebSJohn Baldwin 	pdp = fp->f_data;
5549696feebSJohn Baldwin 	kif->kf_un.kf_proc.kf_pid = pdp->pd_pid;
5559696feebSJohn Baldwin 	return (0);
5569696feebSJohn Baldwin }
557f006524dSKonstantin Belousov 
558f006524dSKonstantin Belousov static int
procdesc_cmp(struct file * fp1,struct file * fp2,struct thread * td)559f006524dSKonstantin Belousov procdesc_cmp(struct file *fp1, struct file *fp2, struct thread *td)
560f006524dSKonstantin Belousov {
561f006524dSKonstantin Belousov 	struct procdesc *pdp1, *pdp2;
562f006524dSKonstantin Belousov 
563f006524dSKonstantin Belousov 	if (fp2->f_type != DTYPE_PROCDESC)
564f006524dSKonstantin Belousov 		return (3);
565f006524dSKonstantin Belousov 	pdp1 = fp1->f_data;
566f006524dSKonstantin Belousov 	pdp2 = fp2->f_data;
567f006524dSKonstantin Belousov 	return (kcmp_cmp((uintptr_t)pdp1->pd_pid, (uintptr_t)pdp2->pd_pid));
568f006524dSKonstantin Belousov }
569