xref: /freebsd/tests/sys/kern/procdesc.c (revision e35df41f68916cc23893a29e0284f386ec727462)
1*e35df41fSAlan Somers /*-
2*e35df41fSAlan Somers  * SPDX-License-Identifier: BSD-2-Clause
3*e35df41fSAlan Somers  *
4*e35df41fSAlan Somers  * Copyright (c) 2026 ConnectWise
5*e35df41fSAlan Somers  *
6*e35df41fSAlan Somers  * Redistribution and use in source and binary forms, with or without
7*e35df41fSAlan Somers  * modification, are permitted provided that the following conditions
8*e35df41fSAlan Somers  * are met:
9*e35df41fSAlan Somers  * 1. Redistributions of source code must retain the above copyright
10*e35df41fSAlan Somers  *    notice, this list of conditions and the following disclaimer.
11*e35df41fSAlan Somers  * 2. Redistributions in binary form must reproduce the above copyright
12*e35df41fSAlan Somers  *    notice, this list of conditions and the following disclaimer in the
13*e35df41fSAlan Somers  *    documentation and/or other materials provided with the distribution.
14*e35df41fSAlan Somers  *
15*e35df41fSAlan Somers  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16*e35df41fSAlan Somers  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17*e35df41fSAlan Somers  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18*e35df41fSAlan Somers  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19*e35df41fSAlan Somers  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20*e35df41fSAlan Somers  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21*e35df41fSAlan Somers  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22*e35df41fSAlan Somers  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23*e35df41fSAlan Somers  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24*e35df41fSAlan Somers  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25*e35df41fSAlan Somers  * SUCH DAMAGE.
26*e35df41fSAlan Somers  */
27*e35df41fSAlan Somers 
28*e35df41fSAlan Somers #include <sys/types.h>
29*e35df41fSAlan Somers #include <sys/user.h>
30*e35df41fSAlan Somers #include <sys/proc.h>
31*e35df41fSAlan Somers #include <sys/procdesc.h>
32*e35df41fSAlan Somers #include <sys/sysctl.h>
33*e35df41fSAlan Somers #include <sys/wait.h>
34*e35df41fSAlan Somers 
35*e35df41fSAlan Somers #include <atf-c.h>
36*e35df41fSAlan Somers #include <stdio.h>
37*e35df41fSAlan Somers 
38*e35df41fSAlan Somers /* Tests for procdesc(4) that aren't specific to any one syscall */
39*e35df41fSAlan Somers 
40*e35df41fSAlan Somers /*
41*e35df41fSAlan Somers  * Even after waiting on a process descriptor with waitpid(2), the kernel will
42*e35df41fSAlan Somers  * not recycle the pid until after the process descriptor is closed.  That is
43*e35df41fSAlan Somers  * important to prevent users from trying to wait() twice, the second time
44*e35df41fSAlan Somers  * using a dangling pid.
45*e35df41fSAlan Somers  *
46*e35df41fSAlan Somers  * Whether this same anti-recycling behavior is used with pdwait() is
47*e35df41fSAlan Somers  * unimportant, because pdwait _always_ uses a process descriptor.
48*e35df41fSAlan Somers  */
49*e35df41fSAlan Somers ATF_TC_WITHOUT_HEAD(pid_recycle);
ATF_TC_BODY(pid_recycle,tc)50*e35df41fSAlan Somers ATF_TC_BODY(pid_recycle, tc)
51*e35df41fSAlan Somers {
52*e35df41fSAlan Somers 	size_t len;
53*e35df41fSAlan Somers 	int i, pd, pid_max;
54*e35df41fSAlan Somers 	pid_t dangle_pid;
55*e35df41fSAlan Somers 
56*e35df41fSAlan Somers 	len = sizeof(pid_max);
57*e35df41fSAlan Somers 	ATF_REQUIRE_EQ_MSG(0,
58*e35df41fSAlan Somers 	    sysctlbyname("kern.pid_max", &pid_max, &len, NULL, 0),
59*e35df41fSAlan Somers 	    "sysctlbyname: %s", strerror(errno));
60*e35df41fSAlan Somers 
61*e35df41fSAlan Somers 	/* Create a process descriptor */
62*e35df41fSAlan Somers 	dangle_pid = pdfork(&pd, PD_CLOEXEC | PD_DAEMON);
63*e35df41fSAlan Somers 	ATF_REQUIRE_MSG(dangle_pid >= 0, "pdfork: %s", strerror(errno));
64*e35df41fSAlan Somers 	if (dangle_pid == 0) {
65*e35df41fSAlan Somers 		// In child
66*e35df41fSAlan Somers 		_exit(0);
67*e35df41fSAlan Somers 	}
68*e35df41fSAlan Somers 	/*
69*e35df41fSAlan Somers 	 * Reap the child, but don't close the pd, creating a dangling pid.
70*e35df41fSAlan Somers 	 * Notably, it isn't a Zombie, because the process is reaped.
71*e35df41fSAlan Somers 	 */
72*e35df41fSAlan Somers 	ATF_REQUIRE_EQ(dangle_pid, waitpid(dangle_pid, NULL, WEXITED));
73*e35df41fSAlan Somers 
74*e35df41fSAlan Somers 	/*
75*e35df41fSAlan Somers 	 * Now create and kill pid_max additional children.  Test to see if pid
76*e35df41fSAlan Somers 	 * gets reused.  If not, that means the kernel is correctly reserving
77*e35df41fSAlan Somers 	 * the dangling pid from reuse.
78*e35df41fSAlan Somers 	 */
79*e35df41fSAlan Somers 	for (i = 0; i < pid_max; i++) {
80*e35df41fSAlan Somers 		pid_t pid;
81*e35df41fSAlan Somers 
82*e35df41fSAlan Somers 		pid = vfork();
83*e35df41fSAlan Somers 		ATF_REQUIRE_MSG(pid >= 0, "vfork: %s", strerror(errno));
84*e35df41fSAlan Somers 		if (pid == 0)
85*e35df41fSAlan Somers 			_exit(0);
86*e35df41fSAlan Somers 		ATF_REQUIRE_MSG(pid != dangle_pid,
87*e35df41fSAlan Somers 		    "pid got recycled after %d forks", i);
88*e35df41fSAlan Somers 		ATF_REQUIRE_EQ(pid, waitpid(pid, NULL, WEXITED));
89*e35df41fSAlan Somers 	}
90*e35df41fSAlan Somers 	close(pd);
91*e35df41fSAlan Somers }
92*e35df41fSAlan Somers 
ATF_TP_ADD_TCS(tp)93*e35df41fSAlan Somers ATF_TP_ADD_TCS(tp)
94*e35df41fSAlan Somers {
95*e35df41fSAlan Somers 	ATF_TP_ADD_TC(tp, pid_recycle);
96*e35df41fSAlan Somers 
97*e35df41fSAlan Somers 	return (atf_no_error());
98*e35df41fSAlan Somers }
99