Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	usr.bin/pkill/pkill.c	Lines:	142	287	49.5 %
Date:	2017-11-13	Branches:	123	281	43.8 %


/*	$OpenBSD: pkill.c,v 1.39 2016/10/10 02:22:59 gsoares Exp $	*/
/*	$NetBSD: pkill.c,v 1.5 2002/10/27 11:49:34 kleink Exp $	*/

/*-
 * Copyright (c) 2002 The NetBSD Foundation, Inc.
 * All rights reserved.
 *
 * This code is derived from software contributed to The NetBSD Foundation
 * by Andrew Doran.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include <sys/param.h>	/* MAXCOMLEN */
#include <sys/types.h>
#include <sys/sysctl.h>
#include <sys/proc.h>
#include <sys/queue.h>
#include <sys/stat.h>
#include <sys/socket.h>

#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <limits.h>
#include <string.h>
#include <unistd.h>
#include <signal.h>
#include <regex.h>
#include <ctype.h>
#include <kvm.h>
#include <err.h>
#include <pwd.h>
#include <grp.h>
#include <errno.h>

#define	STATUS_MATCH	0
#define	STATUS_NOMATCH	1
#define	STATUS_BADUSAGE	2
#define	STATUS_ERROR	3

enum listtype {
	LT_GENERIC,
	LT_USER,
	LT_GROUP,
	LT_TTY,
	LT_PGRP,
	LT_SID,
	LT_RTABLE
};

struct list {
	SLIST_ENTRY(list) li_chain;
	long	li_number;
};

SLIST_HEAD(listhead, list);

struct kinfo_proc	*plist;
char	*selected;
const char	*delim = "\n";
int	nproc;
int	pgrep;
int	signum = SIGTERM;
int	newest;
int	oldest;
int 	quiet;
int	inverse;
int	longfmt;
int	matchargs;
int	fullmatch;
int	confirmkill;
kvm_t	*kd;
pid_t	mypid;

struct listhead euidlist = SLIST_HEAD_INITIALIZER(list);
struct listhead ruidlist = SLIST_HEAD_INITIALIZER(list);
struct listhead rgidlist = SLIST_HEAD_INITIALIZER(list);
struct listhead pgrplist = SLIST_HEAD_INITIALIZER(list);
struct listhead ppidlist = SLIST_HEAD_INITIALIZER(list);
struct listhead tdevlist = SLIST_HEAD_INITIALIZER(list);
struct listhead sidlist = SLIST_HEAD_INITIALIZER(list);
struct listhead rtablist = SLIST_HEAD_INITIALIZER(list);

static void __dead	usage(void);
static int	killact(struct kinfo_proc *, int);
static int	grepact(struct kinfo_proc *, int);
static void	makelist(struct listhead *, enum listtype, char *);
static char	*getargv(struct kinfo_proc *);
static int	askyn(struct kinfo_proc *);

extern char *__progname;

static char *
getargv(struct kinfo_proc *kp)
{
	static char buf[_POSIX2_LINE_MAX];
	char **pargv;
	size_t j;

	if ((pargv = kvm_getargv(kd, kp, 0)) == NULL) {
		strlcpy(buf, kp->p_comm, sizeof(buf));
		return buf;
	}

	j = 0;
	while (j < sizeof(buf) && *pargv != NULL) {
		int ret;

		ret = snprintf(buf + j, sizeof(buf) - j,
		    pargv[1] != NULL ? "%s " : "%s", pargv[0]);
		if (ret >= sizeof(buf) - j)
			j += sizeof(buf) - j - 1;
		else if (ret > 0)
			j += ret;
		pargv++;
	}
	return buf;
}

int
main(int argc, char **argv)
{
	char buf[_POSIX2_LINE_MAX], *mstr, *p, *q;
	int i, j, ch, bestidx, rv, criteria;
	int (*action)(struct kinfo_proc *, int);
	struct kinfo_proc *kp;
	struct list *li;
	u_int32_t bestsec, bestusec;
	regex_t reg;
	regmatch_t regmatch;

	if (strcmp(__progname, "pgrep") == 0) {
		action = grepact;
		pgrep = 1;
	} else {
		action = killact;
		p = argv[1];

		if (argc > 1 && p[0] == '-') {
			p++;
			i = (int)strtol(p, &q, 10);
			if (*q == '\0') {
				signum = i;
				argv++;
				argc--;
			} else {
				if (strncasecmp(p, "sig", 3) == 0)
					p += 3;
				for (i = 1; i < NSIG; i++)
					if (strcasecmp(sys_signame[i], p) == 0)
						break;
				if (i != NSIG) {
					signum = i;
					argv++;
					argc--;
				}
			}
		}
	}

	criteria = 0;

	while ((ch = getopt(argc, argv, "G:P:T:U:d:fg:Ilnoqs:t:u:vx")) != -1)
		switch (ch) {
		case 'G':
			makelist(&rgidlist, LT_GROUP, optarg);
			criteria = 1;
			break;
		case 'P':
			makelist(&ppidlist, LT_GENERIC, optarg);
			criteria = 1;
			break;
		case 'T':
			makelist(&rtablist, LT_RTABLE, optarg);
			criteria = 1;
			break;
		case 'U':
			makelist(&ruidlist, LT_USER, optarg);
			criteria = 1;
			break;
		case 'd':
			if (!pgrep)
				usage();
			delim = optarg;
			break;
		case 'f':
			matchargs = 1;
			break;
		case 'g':
			makelist(&pgrplist, LT_PGRP, optarg);
			criteria = 1;
			break;
		case 'I':
			confirmkill = 1;
			break;
		case 'l':
			longfmt = 1;
			break;
		case 'n':
			newest = 1;
			criteria = 1;
			break;
		case 'o':
			oldest = 1;
			criteria = 1;
			break;
		case 'q':
			quiet = 1;
			break;
		case 's':
			makelist(&sidlist, LT_SID, optarg);
			criteria = 1;
			break;
		case 't':
			makelist(&tdevlist, LT_TTY, optarg);
			criteria = 1;
			break;
		case 'u':
			makelist(&euidlist, LT_USER, optarg);
			criteria = 1;
			break;
		case 'v':
			inverse = 1;
			break;
		case 'x':
			fullmatch = 1;
			break;
		default:
			usage();
			/* NOTREACHED */
		}

	argc -= optind;
	argv += optind;
	if (argc != 0)
		criteria = 1;
	if (!criteria || (newest && oldest))
		usage();

	mypid = getpid();

	/*
	 * Retrieve the list of running processes from the kernel.
	 */
	kd = kvm_openfiles(NULL, NULL, NULL, KVM_NO_FILES, buf);
	if (kd == NULL)
		errx(STATUS_ERROR, "kvm_openfiles(): %s", buf);

	plist = kvm_getprocs(kd, KERN_PROC_ALL, 0, sizeof(*plist), &nproc);
	if (plist == NULL)
		errx(STATUS_ERROR, "kvm_getprocs() failed");

	if (matchargs == 0 && confirmkill == 0) {
		if (action == killact) {
			if (pledge("stdio proc flock rpath cpath wpath", NULL) == -1)
				err(STATUS_ERROR, "pledge");
		} else if (action == grepact) {
			if (pledge("stdio flock rpath cpath wpath", NULL) == -1)
				err(STATUS_ERROR, "pledge");
		}
	}

	/*
	 * Allocate memory which will be used to keep track of the
	 * selection.
	 */
	if ((selected = calloc(nproc, 1)) == NULL)
		errx(STATUS_ERROR, "memory allocation failure");

	/*
	 * Refine the selection.
	 */
	for (; *argv != NULL; argv++) {
		if ((rv = regcomp(&reg, *argv, REG_EXTENDED)) != 0) {
			regerror(rv, &reg, buf, sizeof(buf));
			errx(STATUS_BADUSAGE, "bad expression: %s", buf);
		}

		for (i = 0, kp = plist; i < nproc; i++, kp++) {
			if ((kp->p_flag & (P_SYSTEM | P_THREAD)) != 0 ||
			     kp->p_pid == mypid)
				continue;

			if (matchargs)
				mstr = getargv(kp);
			else
				mstr = kp->p_comm;

			rv = regexec(&reg, mstr, 1, &regmatch, 0);
			if (rv == 0) {
				if (fullmatch) {
					if (regmatch.rm_so == 0 &&
					    regmatch.rm_eo == strlen(mstr))
						selected[i] = 1;
				} else
					selected[i] = 1;
			} else if (rv != REG_NOMATCH) {
				regerror(rv, &reg, buf, sizeof(buf));
				errx(STATUS_ERROR, "regexec(): %s", buf);
			}
		}

		regfree(&reg);
	}

	for (i = 0, kp = plist; i < nproc; i++, kp++) {
		if ((kp->p_flag & (P_SYSTEM | P_THREAD)) != 0 ||
		     kp->p_pid == mypid)
			continue;

		SLIST_FOREACH(li, &ruidlist, li_chain)
			if (kp->p_ruid == (uid_t)li->li_number)
				break;
		if (SLIST_FIRST(&ruidlist) != NULL && li == NULL) {
			selected[i] = 0;
			continue;
		}

		SLIST_FOREACH(li, &rgidlist, li_chain)
			if (kp->p_rgid == (gid_t)li->li_number)
				break;
		if (SLIST_FIRST(&rgidlist) != NULL && li == NULL) {
			selected[i] = 0;
			continue;
		}

		SLIST_FOREACH(li, &euidlist, li_chain)
			if (kp->p_uid == (uid_t)li->li_number)
				break;
		if (SLIST_FIRST(&euidlist) != NULL && li == NULL) {
			selected[i] = 0;
			continue;
		}

		SLIST_FOREACH(li, &ppidlist, li_chain)
			if (kp->p_ppid == (uid_t)li->li_number)
				break;
		if (SLIST_FIRST(&ppidlist) != NULL && li == NULL) {
			selected[i] = 0;
			continue;
		}

		SLIST_FOREACH(li, &pgrplist, li_chain)
			if (kp->p__pgid == (uid_t)li->li_number)
				break;
		if (SLIST_FIRST(&pgrplist) != NULL && li == NULL) {
			selected[i] = 0;
			continue;
		}

		SLIST_FOREACH(li, &tdevlist, li_chain) {
			if (li->li_number == -1 &&
			    (kp->p_psflags & PS_CONTROLT) == 0)
				break;
			if (kp->p_tdev == (uid_t)li->li_number)
				break;
		}
		if (SLIST_FIRST(&tdevlist) != NULL && li == NULL) {
			selected[i] = 0;
			continue;
		}

		SLIST_FOREACH(li, &sidlist, li_chain)
			if (kp->p_sid == (uid_t)li->li_number)
				break;
		if (SLIST_FIRST(&sidlist) != NULL && li == NULL) {
			selected[i] = 0;
			continue;
		}

		SLIST_FOREACH(li, &rtablist, li_chain)
			if (kp->p_rtableid == (u_int32_t)li->li_number)
				break;
		if (SLIST_FIRST(&rtablist) != NULL && li == NULL) {
			selected[i] = 0;
			continue;
		}

		if (argc == 0)
			selected[i] = 1;
	}

	if (newest || oldest) {
		bestidx = -1;

		if (newest)
			bestsec = bestusec = 0;
		else
			bestsec = bestusec = UINT32_MAX;

		for (i = 0, kp = plist; i < nproc; i++, kp++) {
			if (!selected[i])
				continue;

			if ((newest && (kp->p_ustart_sec > bestsec ||
			    (kp->p_ustart_sec == bestsec
			    && kp->p_ustart_usec > bestusec)))
			|| (oldest && (kp->p_ustart_sec < bestsec ||
                            (kp->p_ustart_sec == bestsec
                            && kp->p_ustart_usec < bestusec)))) {

				bestsec = kp->p_ustart_sec;
				bestusec = kp->p_ustart_usec;
				bestidx = i;
			}
		}

		memset(selected, 0, nproc);
		if (bestidx != -1)
			selected[bestidx] = 1;
	}

	/*
	 * Take the appropriate action for each matched process, if any.
	 */
	rv = STATUS_NOMATCH;
	for (i = 0, j = 0, kp = plist; i < nproc; i++, kp++) {
		if ((kp->p_flag & (P_SYSTEM | P_THREAD)) != 0 ||
		     kp->p_pid == mypid)
			continue;
		if (selected[i] == inverse)
			continue;

		switch ((*action)(kp, j++)) {
		case STATUS_MATCH:
			if (rv != STATUS_ERROR)
				rv = STATUS_MATCH;
			break;
		case STATUS_NOMATCH:
			j--;
			break;
		case STATUS_ERROR:
			rv = STATUS_ERROR;
			break;
		}
	}
	if (pgrep && j && !quiet)
		putchar('\n');

	return(rv);
}

static void __dead
usage(void)
{
	const char *ustr;

	if (pgrep)
		ustr = "[-flnoqvx] [-d delim]";
	else
		ustr = "[-signal] [-fIlnoqvx]";

	fprintf(stderr, "usage: %s %s [-G gid] [-g pgrp] [-P ppid] [-s sid]"
	    "\n\t[-T rtable] [-t tty] [-U uid] [-u euid] [pattern ...]\n",
	    __progname, ustr);

	exit(STATUS_BADUSAGE);
}

static int
askyn(struct kinfo_proc *kp)
{
	int first, ch;

	printf("kill %d %.60s? ", (int)kp->p_pid, getargv(kp));
	fflush(stdout);

	first = ch = getchar();
	while (ch != '\n' && ch != EOF)
		ch = getchar();
	return (first == 'y' || first == 'Y');
}

static int
killact(struct kinfo_proc *kp, int dummy)
{
	int doit;

	if (confirmkill) {
		doit = askyn(kp);
	} else {
		if (longfmt && !quiet)
			printf("%d %s\n", (int)kp->p_pid, kp->p_comm);
		doit = 1;
	}

	if (doit && kill(kp->p_pid, signum) == -1) {
		if (errno == ESRCH)
			return (STATUS_NOMATCH);
		warn("signalling pid %d", (int)kp->p_pid);
		return (STATUS_ERROR);
	}
	return (STATUS_MATCH);
}

static int
grepact(struct kinfo_proc *kp, int printdelim)
{
	char **argv;

	if (quiet)
		return (STATUS_MATCH);
	if (longfmt && matchargs)
		if ((argv = kvm_getargv(kd, kp, 0)) == NULL)
			return (errno == ESRCH ? STATUS_NOMATCH : STATUS_ERROR);
	if (printdelim)
		fputs(delim, stdout);
	if (longfmt && matchargs) {
		printf("%d ", (int)kp->p_pid);
		for (; *argv != NULL; argv++) {
			printf("%s", *argv);
			if (argv[1] != NULL)
				putchar(' ');
		}
	} else if (longfmt)
		printf("%d %s", (int)kp->p_pid, kp->p_comm);
	else
		printf("%d", (int)kp->p_pid);

	return (STATUS_MATCH);
}

static void
makelist(struct listhead *head, enum listtype type, char *src)
{
	struct list *li;
	struct passwd *pw;
	struct group *gr;
	struct stat st;
	char *sp, *p, buf[PATH_MAX];
	int empty;

	empty = 1;

	while ((sp = strsep(&src, ",")) != NULL) {
		if (*sp == '\0')
			usage();

		if ((li = malloc(sizeof(*li))) == NULL)
			errx(STATUS_ERROR, "memory allocation failure");
		SLIST_INSERT_HEAD(head, li, li_chain);
		empty = 0;

		li->li_number = strtol(sp, &p, 0);
		if (*p == '\0') {
			switch (type) {
			case LT_PGRP:
				if (li->li_number == 0)
					li->li_number = getpgrp();
				break;
			case LT_SID:
				if (li->li_number == 0)
					li->li_number = getsid(mypid);
				break;
			case LT_RTABLE:
				if (li->li_number < 0 ||
				    li->li_number > RT_TABLEID_MAX)
					errx(STATUS_BADUSAGE,
					    "rtable out of range");
				break;
			case LT_TTY:
				usage();
			default:
				break;
			}
			continue;
		}

		switch (type) {
		case LT_USER:
			if ((pw = getpwnam(sp)) == NULL)
				errx(STATUS_BADUSAGE, "unknown user `%s'", sp);
			li->li_number = pw->pw_uid;
			break;
		case LT_GROUP:
			if ((gr = getgrnam(sp)) == NULL)
				errx(STATUS_BADUSAGE, "unknown group `%s'", sp);
			li->li_number = gr->gr_gid;
			break;
		case LT_TTY:
			if (strcmp(sp, "-") == 0) {
				li->li_number = -1;
				break;
			} else if (strcmp(sp, "co") == 0)
				p = "console";
			else if (strncmp(sp, "tty", 3) == 0)
				p = sp;
			else
				p = NULL;

			if (p == NULL)
				snprintf(buf, sizeof(buf), "/dev/tty%s", sp);
			else
				snprintf(buf, sizeof(buf), "/dev/%s", p);

			if (stat(buf, &st) < 0) {
				if (errno == ENOENT)
					errx(STATUS_BADUSAGE,
					    "no such tty: `%s'", sp);
				err(STATUS_ERROR, "stat(%s)", sp);
			}

			if (!S_ISCHR(st.st_mode))
				errx(STATUS_BADUSAGE, "not a tty: `%s'", sp);

			li->li_number = st.st_rdev;
			break;
		default:
			usage();
		}
	}

	if (empty)
		usage();
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: pkill.c,v 1.39 2016/10/10 02:22:59 gsoares Exp $ */
2			/* $NetBSD: pkill.c,v 1.5 2002/10/27 11:49:34 kleink Exp $ */
3
4			/*-
5			* Copyright (c) 2002 The NetBSD Foundation, Inc.
6			* All rights reserved.
7			*
8			* This code is derived from software contributed to The NetBSD Foundation
9			* by Andrew Doran.
10			*
11			* Redistribution and use in source and binary forms, with or without
12			* modification, are permitted provided that the following conditions
13			* are met:
14			* 1. Redistributions of source code must retain the above copyright
15			* notice, this list of conditions and the following disclaimer.
16			* 2. Redistributions in binary form must reproduce the above copyright
17			* notice, this list of conditions and the following disclaimer in the
18			* documentation and/or other materials provided with the distribution.
19			*
20			* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
21			* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22			* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23			* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
24			* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25			* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26			* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27			* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28			* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29			* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30			* POSSIBILITY OF SUCH DAMAGE.
31			*/
32
33			#include <sys/param.h> /* MAXCOMLEN */
34			#include <sys/types.h>
35			#include <sys/sysctl.h>
36			#include <sys/proc.h>
37			#include <sys/queue.h>
38			#include <sys/stat.h>
39			#include <sys/socket.h>
40
41			#include <stdio.h>
42			#include <stdlib.h>
43			#include <stdint.h>
44			#include <limits.h>
45			#include <string.h>
46			#include <unistd.h>
47			#include <signal.h>
48			#include <regex.h>
49			#include <ctype.h>
50			#include <kvm.h>
51			#include <err.h>
52			#include <pwd.h>
53			#include <grp.h>
54			#include <errno.h>
55
56			#define STATUS_MATCH 0
57			#define STATUS_NOMATCH 1
58			#define STATUS_BADUSAGE 2
59			#define STATUS_ERROR 3
60
61			enum listtype {
62			LT_GENERIC,
63			LT_USER,
64			LT_GROUP,
65			LT_TTY,
66			LT_PGRP,
67			LT_SID,
68			LT_RTABLE
69			};
70
71			struct list {
72			SLIST_ENTRY(list) li_chain;
73			long li_number;
74			};
75
76			SLIST_HEAD(listhead, list);
77
78			struct kinfo_proc *plist;
79			char *selected;
80			const char *delim = "\n";
81			int nproc;
82			int pgrep;
83			int signum = SIGTERM;
84			int newest;
85			int oldest;
86			int quiet;
87			int inverse;
88			int longfmt;
89			int matchargs;
90			int fullmatch;
91			int confirmkill;
92			kvm_t *kd;
93			pid_t mypid;
94
95			struct listhead euidlist = SLIST_HEAD_INITIALIZER(list);
96			struct listhead ruidlist = SLIST_HEAD_INITIALIZER(list);
97			struct listhead rgidlist = SLIST_HEAD_INITIALIZER(list);
98			struct listhead pgrplist = SLIST_HEAD_INITIALIZER(list);
99			struct listhead ppidlist = SLIST_HEAD_INITIALIZER(list);
100			struct listhead tdevlist = SLIST_HEAD_INITIALIZER(list);
101			struct listhead sidlist = SLIST_HEAD_INITIALIZER(list);
102			struct listhead rtablist = SLIST_HEAD_INITIALIZER(list);
103
104			static void __dead usage(void);
105			static int killact(struct kinfo_proc *, int);
106			static int grepact(struct kinfo_proc *, int);
107			static void makelist(struct listhead , enum listtype, char );
108			static char getargv(struct kinfo_proc );
109			static int askyn(struct kinfo_proc *);
110
111			extern char *__progname;
112
113			static char *
114			getargv(struct kinfo_proc *kp)
115			{
116			static char buf[_POSIX2_LINE_MAX];
117			char **pargv;
118			size_t j;
119
120	✗✓	3696	if ((pargv = kvm_getargv(kd, kp, 0)) == NULL) {
121			strlcpy(buf, kp->p_comm, sizeof(buf));
122			return buf;
123			}
124
125			j = 0;
126	✓✗✓✓	14901	while (j < sizeof(buf) && *pargv != NULL) {
127			int ret;
128
129		6238	ret = snprintf(buf + j, sizeof(buf) - j,
130		3119	pargv[1] != NULL ? "%s " : "%s", pargv[0]);
131	✗✓	3119	if (ret >= sizeof(buf) - j)
132			j += sizeof(buf) - j - 1;
133	✓✗	3119	else if (ret > 0)
134		3119	j += ret;
135		3119	pargv++;
136			}
137		1848	return buf;
138		1848	}
139
140			int
141			main(int argc, char **argv)
142			{
143		1644	char buf[_POSIX2_LINE_MAX], mstr, p, *q;
144			int i, j, ch, bestidx, rv, criteria;
145			int (action)(struct kinfo_proc , int);
146			struct kinfo_proc *kp;
147			struct list *li;
148			u_int32_t bestsec, bestusec;
149		822	regex_t reg;
150		822	regmatch_t regmatch;
151
152	✓✓	822	if (strcmp(__progname, "pgrep") == 0) {
153			action = grepact;
154		80	pgrep = 1;
155		80	} else {
156			action = killact;
157		742	p = argv[1];
158
159	✓✗✓✗	1484	if (argc > 1 && p[0] == '-') {
160		742	p++;
161		742	i = (int)strtol(p, &q, 10);
162	✗✓	742	if (*q == '\0') {
163			signum = i;
164			argv++;
165			argc--;
166			} else {
167	✗✓	742	if (strncasecmp(p, "sig", 3) == 0)
168			p += 3;
169	✓✓	14500	for (i = 1; i < NSIG; i++)
170	✓✓	7228	if (strcasecmp(sys_signame[i], p) == 0)
171			break;
172	✓✓	742	if (i != NSIG) {
173		720	signum = i;
174		720	argv++;
175		720	argc--;
176		720	}
177			}
178			}
179			}
180
181			criteria = 0;
182
183	✓✓	3384	while ((ch = getopt(argc, argv, "G:P:T:U:d:fg:Ilnoqs:t:u:vx")) != -1)
184	✗✓✓✗ ✗✓✗✗ ✗✗✗✓ ✗✗✗✗ ✓✗	870	switch (ch) {
185			case 'G':
186			makelist(&rgidlist, LT_GROUP, optarg);
187			criteria = 1;
188			break;
189			case 'P':
190		4	makelist(&ppidlist, LT_GENERIC, optarg);
191			criteria = 1;
192		4	break;
193			case 'T':
194		42	makelist(&rtablist, LT_RTABLE, optarg);
195			criteria = 1;
196		42	break;
197			case 'U':
198			makelist(&ruidlist, LT_USER, optarg);
199			criteria = 1;
200			break;
201			case 'd':
202			if (!pgrep)
203			usage();
204			delim = optarg;
205			break;
206			case 'f':
207		42	matchargs = 1;
208		42	break;
209			case 'g':
210			makelist(&pgrplist, LT_PGRP, optarg);
211			criteria = 1;
212			break;
213			case 'I':
214			confirmkill = 1;
215			break;
216			case 'l':
217			longfmt = 1;
218			break;
219			case 'n':
220			newest = 1;
221			criteria = 1;
222			break;
223			case 'o':
224			oldest = 1;
225			criteria = 1;
226			break;
227			case 'q':
228		20	quiet = 1;
229		20	break;
230			case 's':
231			makelist(&sidlist, LT_SID, optarg);
232			criteria = 1;
233			break;
234			case 't':
235			makelist(&tdevlist, LT_TTY, optarg);
236			criteria = 1;
237			break;
238			case 'u':
239			makelist(&euidlist, LT_USER, optarg);
240			criteria = 1;
241			break;
242			case 'v':
243			inverse = 1;
244			break;
245			case 'x':
246		762	fullmatch = 1;
247		762	break;
248			default:
249			usage();
250			/* NOTREACHED */
251			}
252
253		822	argc -= optind;
254		822	argv += optind;
255	✓✓	822	if (argc != 0)
256		818	criteria = 1;
257	✓✗✗✓	1644	if (!criteria \|\| (newest && oldest))
258			usage();
259
260		822	mypid = getpid();
261
262			/*
263			* Retrieve the list of running processes from the kernel.
264			*/
265		822	kd = kvm_openfiles(NULL, NULL, NULL, KVM_NO_FILES, buf);
266	✗✓	822	if (kd == NULL)
267			errx(STATUS_ERROR, "kvm_openfiles(): %s", buf);
268
269		822	plist = kvm_getprocs(kd, KERN_PROC_ALL, 0, sizeof(*plist), &nproc);
270	✗✓	822	if (plist == NULL)
271			errx(STATUS_ERROR, "kvm_getprocs() failed");
272
273	✓✓	822	if (matchargs == 0 && confirmkill == 0) {
274	✓✓	780	if (action == killact) {
275	✗✓	720	if (pledge("stdio proc flock rpath cpath wpath", NULL) == -1)
276			err(STATUS_ERROR, "pledge");
277	✓✗	60	} else if (action == grepact) {
278	✗✓	60	if (pledge("stdio flock rpath cpath wpath", NULL) == -1)
279			err(STATUS_ERROR, "pledge");
280			}
281			}
282
283			/*
284			* Allocate memory which will be used to keep track of the
285			* selection.
286			*/
287	✗✓	822	if ((selected = calloc(nproc, 1)) == NULL)
288			errx(STATUS_ERROR, "memory allocation failure");
289
290			/*
291			* Refine the selection.
292			*/
293	✓✓	3280	for (; *argv != NULL; argv++) {
294	✗✓	818	if ((rv = regcomp(&reg, *argv, REG_EXTENDED)) != 0) {
295			regerror(rv, &reg, buf, sizeof(buf));
296			errx(STATUS_BADUSAGE, "bad expression: %s", buf);
297			}
298
299	✓✓	80650	for (i = 0, kp = plist; i < nproc; i++, kp++) {
300	✓✗✓✓	79014	if ((kp->p_flag & (P_SYSTEM \| P_THREAD)) != 0 \|\|
301		39507	kp->p_pid == mypid)
302			continue;
303
304	✓✓	38689	if (matchargs)
305		1848	mstr = getargv(kp);
306			else
307		36841	mstr = kp->p_comm;
308
309		38689	rv = regexec(&reg, mstr, 1, &regmatch, 0);
310	✓✓	38689	if (rv == 0) {
311	✓✓	155	if (fullmatch) {
312	✓✓✓✗	76	if (regmatch.rm_so == 0 &&
313		29	regmatch.rm_eo == strlen(mstr))
314		29	selected[i] = 1;
315			} else
316		108	selected[i] = 1;
317	✗✓	38534	} else if (rv != REG_NOMATCH) {
318			regerror(rv, &reg, buf, sizeof(buf));
319			errx(STATUS_ERROR, "regexec(): %s", buf);
320			}
321			}
322
323		818	regfree(&reg);
324			}
325
326	✓✓	81038	for (i = 0, kp = plist; i < nproc; i++, kp++) {
327	✓✗✓✓	79394	if ((kp->p_flag & (P_SYSTEM \| P_THREAD)) != 0 \|\|
328		39697	kp->p_pid == mypid)
329			continue;
330
331	✗✓	77750	SLIST_FOREACH(li, &ruidlist, li_chain)
332			if (kp->p_ruid == (uid_t)li->li_number)
333			break;
334	✗✓	38875	if (SLIST_FIRST(&ruidlist) != NULL && li == NULL) {
335			selected[i] = 0;
336			continue;
337			}
338
339	✗✓	77750	SLIST_FOREACH(li, &rgidlist, li_chain)
340			if (kp->p_rgid == (gid_t)li->li_number)
341			break;
342	✗✓	38875	if (SLIST_FIRST(&rgidlist) != NULL && li == NULL) {
343			selected[i] = 0;
344			continue;
345			}
346
347	✗✓	77750	SLIST_FOREACH(li, &euidlist, li_chain)
348			if (kp->p_uid == (uid_t)li->li_number)
349			break;
350	✗✓	38875	if (SLIST_FIRST(&euidlist) != NULL && li == NULL) {
351			selected[i] = 0;
352			continue;
353			}
354
355	✓✓	78114	SLIST_FOREACH(li, &ppidlist, li_chain)
356	✓✓	186	if (kp->p_ppid == (uid_t)li->li_number)
357			break;
358	✓✓	38875	if (SLIST_FIRST(&ppidlist) != NULL && li == NULL) {
359		182	selected[i] = 0;
360		182	continue;
361			}
362
363	✗✓	77386	SLIST_FOREACH(li, &pgrplist, li_chain)
364			if (kp->p__pgid == (uid_t)li->li_number)
365			break;
366	✗✓	38693	if (SLIST_FIRST(&pgrplist) != NULL && li == NULL) {
367			selected[i] = 0;
368			continue;
369			}
370
371	✗✓	77386	SLIST_FOREACH(li, &tdevlist, li_chain) {
372			if (li->li_number == -1 &&
373			(kp->p_psflags & PS_CONTROLT) == 0)
374			break;
375			if (kp->p_tdev == (uid_t)li->li_number)
376			break;
377			}
378	✗✓	38693	if (SLIST_FIRST(&tdevlist) != NULL && li == NULL) {
379			selected[i] = 0;
380			continue;
381			}
382
383	✗✓	77386	SLIST_FOREACH(li, &sidlist, li_chain)
384			if (kp->p_sid == (uid_t)li->li_number)
385			break;
386	✗✓	38693	if (SLIST_FIRST(&sidlist) != NULL && li == NULL) {
387			selected[i] = 0;
388			continue;
389			}
390
391	✓✓	78970	SLIST_FOREACH(li, &rtablist, li_chain)
392	✓✓	1848	if (kp->p_rtableid == (u_int32_t)li->li_number)
393			break;
394	✓✓	38693	if (SLIST_FIRST(&rtablist) != NULL && li == NULL) {
395		792	selected[i] = 0;
396		792	continue;
397			}
398
399	✓✓	37901	if (argc == 0)
400		4	selected[i] = 1;
401			}
402
403	✗✓	822	if (newest \|\| oldest) {
404			bestidx = -1;
405
406			if (newest)
407			bestsec = bestusec = 0;
408			else
409			bestsec = bestusec = UINT32_MAX;
410
411			for (i = 0, kp = plist; i < nproc; i++, kp++) {
412			if (!selected[i])
413			continue;
414
415			if ((newest && (kp->p_ustart_sec > bestsec \|\|
416			(kp->p_ustart_sec == bestsec
417			&& kp->p_ustart_usec > bestusec)))
418			\|\| (oldest && (kp->p_ustart_sec < bestsec \|\|
419			(kp->p_ustart_sec == bestsec
420			&& kp->p_ustart_usec < bestusec)))) {
421
422			bestsec = kp->p_ustart_sec;
423			bestusec = kp->p_ustart_usec;
424			bestidx = i;
425			}
426			}
427
428			memset(selected, 0, nproc);
429			if (bestidx != -1)
430			selected[bestidx] = 1;
431			}
432
433			/*
434			* Take the appropriate action for each matched process, if any.
435			*/
436			rv = STATUS_NOMATCH;
437	✓✓	81038	for (i = 0, j = 0, kp = plist; i < nproc; i++, kp++) {
438	✓✗✓✓	79394	if ((kp->p_flag & (P_SYSTEM \| P_THREAD)) != 0 \|\|
439		39697	kp->p_pid == mypid)
440			continue;
441	✓✓	38875	if (selected[i] == inverse)
442			continue;
443
444	✓✗✗✓	3416	switch ((*action)(kp, j++)) {
445			case STATUS_MATCH:
446	✓✗	141	if (rv != STATUS_ERROR)
447		141	rv = STATUS_MATCH;
448			break;
449			case STATUS_NOMATCH:
450			j--;
451			break;
452			case STATUS_ERROR:
453			rv = STATUS_ERROR;
454			break;
455			}
456			}
457	✓✓	822	if (pgrep && j && !quiet)
458	✓✗	88	putchar('\n');
459
460		822	return(rv);
461		822	}
462
463			static void __dead
464			usage(void)
465			{
466			const char *ustr;
467
468			if (pgrep)
469			ustr = "[-flnoqvx] [-d delim]";
470			else
471			ustr = "[-signal] [-fIlnoqvx]";
472
473			fprintf(stderr, "usage: %s %s [-G gid] [-g pgrp] [-P ppid] [-s sid]"
474			"\n\t[-T rtable] [-t tty] [-U uid] [-u euid] [pattern ...]\n",
475			__progname, ustr);
476
477			exit(STATUS_BADUSAGE);
478			}
479
480			static int
481			askyn(struct kinfo_proc *kp)
482			{
483			int first, ch;
484
485			printf("kill %d %.60s? ", (int)kp->p_pid, getargv(kp));
486			fflush(stdout);
487
488			first = ch = getchar();
489			while (ch != '\n' && ch != EOF)
490			ch = getchar();
491			return (first == 'y' \|\| first == 'Y');
492			}
493
494			static int
495			killact(struct kinfo_proc *kp, int dummy)
496			{
497			int doit;
498
499	✗✓	56	if (confirmkill) {
500			doit = askyn(kp);
501			} else {
502	✗✓	28	if (longfmt && !quiet)
503			printf("%d %s\n", (int)kp->p_pid, kp->p_comm);
504			doit = 1;
505			}
506
507	✓✗✗✓	56	if (doit && kill(kp->p_pid, signum) == -1) {
508			if (errno == ESRCH)
509			return (STATUS_NOMATCH);
510			warn("signalling pid %d", (int)kp->p_pid);
511			return (STATUS_ERROR);
512			}
513		28	return (STATUS_MATCH);
514		28	}
515
516			static int
517			grepact(struct kinfo_proc *kp, int printdelim)
518			{
519			char **argv;
520
521	✓✓	226	if (quiet)
522		5	return (STATUS_MATCH);
523	✗✓	108	if (longfmt && matchargs)
524			if ((argv = kvm_getargv(kd, kp, 0)) == NULL)
525			return (errno == ESRCH ? STATUS_NOMATCH : STATUS_ERROR);
526	✓✓	108	if (printdelim)
527		64	fputs(delim, stdout);
528	✗✓	108	if (longfmt && matchargs) {
529			printf("%d ", (int)kp->p_pid);
530			for (; *argv != NULL; argv++) {
531			printf("%s", *argv);
532			if (argv[1] != NULL)
533			putchar(' ');
534			}
535	✗✓	108	} else if (longfmt)
536			printf("%d %s", (int)kp->p_pid, kp->p_comm);
537			else
538		108	printf("%d", (int)kp->p_pid);
539
540		108	return (STATUS_MATCH);
541		113	}
542
543			static void
544			makelist(struct listhead head, enum listtype type, char src)
545			{
546			struct list *li;
547			struct passwd *pw;
548			struct group *gr;
549		46	struct stat st;
550		46	char sp, p, buf[PATH_MAX];
551			int empty;
552
553			empty = 1;
554
555	✓✓	138	while ((sp = strsep(&src, ",")) != NULL) {
556	✗✓	46	if (*sp == '\0')
557			usage();
558
559	✗✓	46	if ((li = malloc(sizeof(*li))) == NULL)
560			errx(STATUS_ERROR, "memory allocation failure");
561		46	SLIST_INSERT_HEAD(head, li, li_chain);
562			empty = 0;
563
564		46	li->li_number = strtol(sp, &p, 0);
565	✓✗	46	if (*p == '\0') {
566	✗✗✓✗ ✓	88	switch (type) {
567			case LT_PGRP:
568			if (li->li_number == 0)
569			li->li_number = getpgrp();
570			break;
571			case LT_SID:
572			if (li->li_number == 0)
573			li->li_number = getsid(mypid);
574			break;
575			case LT_RTABLE:
576	✓✗✗✓	84	if (li->li_number < 0 \|\|
577		42	li->li_number > RT_TABLEID_MAX)
578			errx(STATUS_BADUSAGE,
579			"rtable out of range");
580			break;
581			case LT_TTY:
582			usage();
583			default:
584			break;
585			}
586		46	continue;
587			}
588
589			switch (type) {
590			case LT_USER:
591			if ((pw = getpwnam(sp)) == NULL)
592			errx(STATUS_BADUSAGE, "unknown user `%s'", sp);
593			li->li_number = pw->pw_uid;
594			break;
595			case LT_GROUP:
596			if ((gr = getgrnam(sp)) == NULL)
597			errx(STATUS_BADUSAGE, "unknown group `%s'", sp);
598			li->li_number = gr->gr_gid;
599			break;
600			case LT_TTY:
601			if (strcmp(sp, "-") == 0) {
602			li->li_number = -1;
603			break;
604			} else if (strcmp(sp, "co") == 0)
605			p = "console";
606			else if (strncmp(sp, "tty", 3) == 0)
607			p = sp;
608			else
609			p = NULL;
610
611			if (p == NULL)
612			snprintf(buf, sizeof(buf), "/dev/tty%s", sp);
613			else
614			snprintf(buf, sizeof(buf), "/dev/%s", p);
615
616			if (stat(buf, &st) < 0) {
617			if (errno == ENOENT)
618			errx(STATUS_BADUSAGE,
619			"no such tty: `%s'", sp);
620			err(STATUS_ERROR, "stat(%s)", sp);
621			}
622
623			if (!S_ISCHR(st.st_mode))
624			errx(STATUS_BADUSAGE, "not a tty: `%s'", sp);
625
626			li->li_number = st.st_rdev;
627			break;
628			default:
629			usage();
630			}
631			}
632
633	✗✓	46	if (empty)
634			usage();
635		46	}