pkill.c revision 1.13
1 /* $NetBSD: pkill.c,v 1.13 2005/07/20 12:40:27 dsainty Exp $ */ 2 3 /*- 4 * Copyright (c) 2002 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Andrew Doran. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 #ifndef lint 41 __RCSID("$NetBSD: pkill.c,v 1.13 2005/07/20 12:40:27 dsainty Exp $"); 42 #endif /* !lint */ 43 44 #include <sys/types.h> 45 #include <sys/param.h> 46 #include <sys/sysctl.h> 47 #include <sys/proc.h> 48 #include <sys/queue.h> 49 #include <sys/stat.h> 50 51 #include <stdio.h> 52 #include <stdlib.h> 53 #include <limits.h> 54 #include <string.h> 55 #include <unistd.h> 56 #include <signal.h> 57 #include <regex.h> 58 #include <ctype.h> 59 #include <kvm.h> 60 #include <err.h> 61 #include <pwd.h> 62 #include <grp.h> 63 #include <errno.h> 64 #include <paths.h> 65 66 #define STATUS_MATCH 0 67 #define STATUS_NOMATCH 1 68 #define STATUS_BADUSAGE 2 69 #define STATUS_ERROR 3 70 71 enum listtype { 72 LT_GENERIC, 73 LT_USER, 74 LT_GROUP, 75 LT_TTY, 76 LT_PGRP, 77 LT_SID 78 }; 79 80 struct list { 81 SLIST_ENTRY(list) li_chain; 82 long li_number; 83 }; 84 85 SLIST_HEAD(listhead, list); 86 87 static struct kinfo_proc2 *plist; 88 static char *selected; 89 static const char *delim = "\n"; 90 static int nproc; 91 static int pgrep; 92 static int signum = SIGTERM; 93 static int newest; 94 static int inverse; 95 static int longfmt; 96 static int matchargs; 97 static int fullmatch; 98 static int cflags = REG_EXTENDED; 99 static kvm_t *kd; 100 static pid_t mypid; 101 102 static struct listhead euidlist = SLIST_HEAD_INITIALIZER(list); 103 static struct listhead ruidlist = SLIST_HEAD_INITIALIZER(list); 104 static struct listhead rgidlist = SLIST_HEAD_INITIALIZER(list); 105 static struct listhead pgrplist = SLIST_HEAD_INITIALIZER(list); 106 static struct listhead ppidlist = SLIST_HEAD_INITIALIZER(list); 107 static struct listhead tdevlist = SLIST_HEAD_INITIALIZER(list); 108 static struct listhead sidlist = SLIST_HEAD_INITIALIZER(list); 109 110 int main(int, char **); 111 static void usage(void) __attribute__((__noreturn__)); 112 static int killact(struct kinfo_proc2 *); 113 static int grepact(struct kinfo_proc2 *); 114 static void makelist(struct listhead *, enum listtype, char *); 115 116 int 117 main(int argc, char **argv) 118 { 119 char buf[_POSIX2_LINE_MAX], *mstr, **pargv, *p, *q; 120 int i, j, ch, bestidx, rv, criteria; 121 int (*action)(struct kinfo_proc2 *); 122 struct kinfo_proc2 *kp; 123 struct list *li; 124 u_int32_t bestsec, bestusec; 125 regex_t reg; 126 regmatch_t regmatch; 127 128 setprogname(argv[0]); 129 130 if (strcmp(getprogname(), "pgrep") == 0) { 131 action = grepact; 132 pgrep = 1; 133 } else { 134 action = killact; 135 p = argv[1]; 136 137 if (argc > 1 && p[0] == '-') { 138 p++; 139 i = (int)strtol(p, &q, 10); 140 if (*q == '\0') { 141 signum = i; 142 argv++; 143 argc--; 144 } else { 145 if (strncasecmp(p, "sig", 3) == 0) 146 p += 3; 147 for (i = 1; i < NSIG; i++) 148 if (strcasecmp(sys_signame[i], p) == 0) 149 break; 150 if (i != NSIG) { 151 signum = i; 152 argv++; 153 argc--; 154 } 155 } 156 } 157 } 158 159 criteria = 0; 160 161 while ((ch = getopt(argc, argv, "G:P:U:d:fg:ilns:t:u:vx")) != -1) 162 switch (ch) { 163 case 'G': 164 makelist(&rgidlist, LT_GROUP, optarg); 165 criteria = 1; 166 break; 167 case 'P': 168 makelist(&ppidlist, LT_GENERIC, optarg); 169 criteria = 1; 170 break; 171 case 'U': 172 makelist(&ruidlist, LT_USER, optarg); 173 criteria = 1; 174 break; 175 case 'd': 176 if (!pgrep) 177 usage(); 178 delim = optarg; 179 break; 180 case 'f': 181 matchargs = 1; 182 break; 183 case 'g': 184 makelist(&pgrplist, LT_PGRP, optarg); 185 criteria = 1; 186 break; 187 case 'i': 188 cflags |= REG_ICASE; 189 break; 190 case 'l': 191 if (!pgrep) 192 usage(); 193 longfmt = 1; 194 break; 195 case 'n': 196 newest = 1; 197 criteria = 1; 198 break; 199 case 's': 200 makelist(&sidlist, LT_SID, optarg); 201 criteria = 1; 202 break; 203 case 't': 204 makelist(&tdevlist, LT_TTY, optarg); 205 criteria = 1; 206 break; 207 case 'u': 208 makelist(&euidlist, LT_USER, optarg); 209 criteria = 1; 210 break; 211 case 'v': 212 inverse = 1; 213 break; 214 case 'x': 215 fullmatch = 1; 216 break; 217 default: 218 usage(); 219 /* NOTREACHED */ 220 } 221 222 argc -= optind; 223 argv += optind; 224 if (argc != 0) 225 criteria = 1; 226 if (!criteria) 227 usage(); 228 229 mypid = getpid(); 230 231 /* 232 * Retrieve the list of running processes from the kernel. 233 */ 234 kd = kvm_openfiles(NULL, NULL, NULL, KVM_NO_FILES, buf); 235 if (kd == NULL) 236 errx(STATUS_ERROR, "Cannot open kernel files (%s)", buf); 237 238 plist = kvm_getproc2(kd, KERN_PROC_ALL, 0, sizeof(*plist), &nproc); 239 if (plist == NULL) 240 errx(STATUS_ERROR, "Cannot get process list (%s)", 241 kvm_geterr(kd)); 242 243 /* 244 * Allocate memory which will be used to keep track of the 245 * selection. 246 */ 247 if ((selected = calloc((size_t)1, (size_t)nproc)) == NULL) 248 err(STATUS_ERROR, "Cannot allocate memory for %d processes", 249 nproc); 250 251 /* 252 * Refine the selection. 253 */ 254 for (; *argv != NULL; argv++) { 255 if ((rv = regcomp(®, *argv, cflags)) != 0) { 256 (void)regerror(rv, ®, buf, sizeof(buf)); 257 errx(STATUS_BADUSAGE, 258 "Cannot compile regular expression `%s' (%s)", 259 *argv, buf); 260 } 261 262 for (i = 0, kp = plist; i < nproc; i++, kp++) { 263 if ((kp->p_flag & P_SYSTEM) != 0 || kp->p_pid == mypid) 264 continue; 265 266 if (matchargs) { 267 if ((pargv = kvm_getargv2(kd, kp, 0)) == NULL) 268 continue; 269 270 j = 0; 271 while (j < sizeof(buf) && *pargv != NULL) { 272 j += snprintf(buf + j, sizeof(buf) - j, 273 pargv[1] != NULL ? "%s " : "%s", 274 pargv[0]); 275 pargv++; 276 } 277 278 mstr = buf; 279 } else 280 mstr = kp->p_comm; 281 282 rv = regexec(®, mstr, 1, ®match, 0); 283 if (rv == 0) { 284 if (fullmatch) { 285 if (regmatch.rm_so == 0 && 286 regmatch.rm_eo == strlen(mstr)) 287 selected[i] = 1; 288 } else 289 selected[i] = 1; 290 } else if (rv != REG_NOMATCH) { 291 (void)regerror(rv, ®, buf, sizeof(buf)); 292 errx(STATUS_ERROR, 293 "Regular expression evaluation error (%s)", 294 buf); 295 } 296 } 297 298 regfree(®); 299 } 300 301 for (i = 0, kp = plist; i < nproc; i++, kp++) { 302 if ((kp->p_flag & P_SYSTEM) != 0) 303 continue; 304 305 SLIST_FOREACH(li, &ruidlist, li_chain) 306 if (kp->p_ruid == (uid_t)li->li_number) 307 break; 308 if (SLIST_FIRST(&ruidlist) != NULL && li == NULL) { 309 selected[i] = 0; 310 continue; 311 } 312 313 SLIST_FOREACH(li, &rgidlist, li_chain) 314 if (kp->p_rgid == (gid_t)li->li_number) 315 break; 316 if (SLIST_FIRST(&rgidlist) != NULL && li == NULL) { 317 selected[i] = 0; 318 continue; 319 } 320 321 SLIST_FOREACH(li, &euidlist, li_chain) 322 if (kp->p_uid == (uid_t)li->li_number) 323 break; 324 if (SLIST_FIRST(&euidlist) != NULL && li == NULL) { 325 selected[i] = 0; 326 continue; 327 } 328 329 SLIST_FOREACH(li, &ppidlist, li_chain) 330 if (kp->p_ppid == (uid_t)li->li_number) 331 break; 332 if (SLIST_FIRST(&ppidlist) != NULL && li == NULL) { 333 selected[i] = 0; 334 continue; 335 } 336 337 SLIST_FOREACH(li, &pgrplist, li_chain) 338 if (kp->p__pgid == (uid_t)li->li_number) 339 break; 340 if (SLIST_FIRST(&pgrplist) != NULL && li == NULL) { 341 selected[i] = 0; 342 continue; 343 } 344 345 SLIST_FOREACH(li, &tdevlist, li_chain) { 346 if (li->li_number == -1 && 347 (kp->p_flag & P_CONTROLT) == 0) 348 break; 349 if (kp->p_tdev == (uid_t)li->li_number) 350 break; 351 } 352 if (SLIST_FIRST(&tdevlist) != NULL && li == NULL) { 353 selected[i] = 0; 354 continue; 355 } 356 357 SLIST_FOREACH(li, &sidlist, li_chain) 358 if (kp->p_sid == (uid_t)li->li_number) 359 break; 360 if (SLIST_FIRST(&sidlist) != NULL && li == NULL) { 361 selected[i] = 0; 362 continue; 363 } 364 365 if (argc == 0) 366 selected[i] = 1; 367 } 368 369 if (newest) { 370 bestsec = 0; 371 bestusec = 0; 372 bestidx = -1; 373 374 for (i = 0, kp = plist; i < nproc; i++, kp++) { 375 if (!selected[i]) 376 continue; 377 378 if (kp->p_ustart_sec > bestsec || 379 (kp->p_ustart_sec == bestsec 380 && kp->p_ustart_usec > bestusec)) { 381 bestsec = kp->p_ustart_sec; 382 bestusec = kp->p_ustart_usec; 383 bestidx = i; 384 } 385 } 386 387 (void)memset(selected, 0, (size_t)nproc); 388 if (bestidx != -1) 389 selected[bestidx] = 1; 390 } 391 392 /* 393 * Take the appropriate action for each matched process, if any. 394 */ 395 for (i = 0, rv = 0, kp = plist; i < nproc; i++, kp++) { 396 if (kp->p_pid == mypid) 397 continue; 398 if (selected[i]) { 399 if (inverse) 400 continue; 401 } else if (!inverse) 402 continue; 403 404 if ((kp->p_flag & P_SYSTEM) != 0) 405 continue; 406 407 rv |= (*action)(kp); 408 } 409 410 return rv ? STATUS_MATCH : STATUS_NOMATCH; 411 } 412 413 static void 414 usage(void) 415 { 416 const char *ustr; 417 418 if (pgrep) 419 ustr = "[-filnvx] [-d delim]"; 420 else 421 ustr = "[-signal] [-finvx]"; 422 423 (void)fprintf(stderr, 424 "Usage: %s %s [-G gid] [-P ppid] [-U uid] [-g pgrp] [-s sid]\n" 425 " [-t tty] [-u euid] pattern ...\n", getprogname(), 426 ustr); 427 428 exit(STATUS_ERROR); 429 } 430 431 static int 432 killact(struct kinfo_proc2 *kp) 433 { 434 if (kill(kp->p_pid, signum) == -1) { 435 436 /* 437 * Check for ESRCH, which indicates that the process 438 * disappeared between us matching it and us 439 * signalling it. Return 0 to indicate that the 440 * process should not be considered a match, since we 441 * didn't actually get to signal it. 442 */ 443 if (errno == ESRCH) 444 return 0; 445 446 err(STATUS_ERROR, "signalling pid %d", (int)kp->p_pid); 447 } 448 449 return 1; 450 } 451 452 static int 453 grepact(struct kinfo_proc2 *kp) 454 { 455 char **argv; 456 457 if (longfmt && matchargs) { 458 459 /* 460 * If kvm_getargv2() failed the process has probably 461 * disappeared. Return 0 to indicate that the process 462 * should not be considered a match, since we are no 463 * longer in a position to output it as a match. 464 */ 465 if ((argv = kvm_getargv2(kd, kp, 0)) == NULL) 466 return 0; 467 468 (void)printf("%d ", (int)kp->p_pid); 469 for (; *argv != NULL; argv++) { 470 (void)printf("%s", *argv); 471 if (argv[1] != NULL) 472 (void)putchar(' '); 473 } 474 } else if (longfmt) 475 (void)printf("%d %s", (int)kp->p_pid, kp->p_comm); 476 else 477 (void)printf("%d", (int)kp->p_pid); 478 479 (void)printf("%s", delim); 480 481 return 1; 482 } 483 484 static void 485 makelist(struct listhead *head, enum listtype type, char *src) 486 { 487 struct list *li; 488 struct passwd *pw; 489 struct group *gr; 490 struct stat st; 491 char *sp, *ep, buf[MAXPATHLEN]; 492 const char *p; 493 int empty; 494 const char *prefix = _PATH_DEV; 495 496 empty = 1; 497 498 while ((sp = strsep(&src, ",")) != NULL) { 499 if (*sp == '\0') 500 usage(); 501 502 if ((li = malloc(sizeof(*li))) == NULL) 503 err(STATUS_ERROR, "Cannot allocate %zd bytes", 504 sizeof(*li)); 505 SLIST_INSERT_HEAD(head, li, li_chain); 506 empty = 0; 507 508 li->li_number = (uid_t)strtol(sp, &ep, 0); 509 if (*ep == '\0') { 510 switch (type) { 511 case LT_PGRP: 512 if (li->li_number == 0) 513 li->li_number = getpgrp(); 514 break; 515 case LT_SID: 516 if (li->li_number == 0) 517 li->li_number = getsid(mypid); 518 break; 519 case LT_TTY: 520 usage(); 521 /*NOTREACHED*/ 522 default: 523 break; 524 } 525 continue; 526 } 527 528 switch (type) { 529 case LT_USER: 530 if ((pw = getpwnam(sp)) == NULL) 531 errx(STATUS_BADUSAGE, "Unknown user `%s'", 532 sp); 533 li->li_number = pw->pw_uid; 534 break; 535 case LT_GROUP: 536 if ((gr = getgrnam(sp)) == NULL) 537 errx(STATUS_BADUSAGE, "Unknown group `%s'", 538 sp); 539 li->li_number = gr->gr_gid; 540 break; 541 case LT_TTY: 542 if (strcmp(sp, "-") == 0) { 543 li->li_number = -1; 544 break; 545 } else if (strcmp(sp, "co") == 0) 546 p = "console"; 547 else if (strncmp(sp, "tty", 3) == 0) 548 p = sp; 549 else { 550 p = sp; 551 prefix = _PATH_TTY; 552 } 553 554 (void)snprintf(buf, sizeof(buf), "%s%s", prefix, p); 555 556 if (stat(buf, &st) == -1) { 557 if (errno == ENOENT) 558 errx(STATUS_BADUSAGE, 559 "No such tty: `%s'", sp); 560 err(STATUS_ERROR, "Cannot access `%s'", sp); 561 } 562 563 if ((st.st_mode & S_IFCHR) == 0) 564 errx(STATUS_BADUSAGE, "Not a tty: `%s'", sp); 565 566 li->li_number = st.st_rdev; 567 break; 568 default: 569 usage(); 570 } 571 } 572 573 if (empty) 574 usage(); 575 } 576
Indexes created Tue Sep 30 11:09:46 GMT 2025