1 /*- 2 * Copyright (c) 1990, 1993, 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * ------+---------+---------+-------- + --------+---------+---------+---------* 29 * Copyright (c) 2004 - Garance Alistair Drosehn <gad@FreeBSD.org>. 30 * All rights reserved. 31 * 32 * Significant modifications made to bring `ps' options somewhat closer 33 * to the standard for `ps' as described in SingleUnixSpec-v3. 34 * ------+---------+---------+-------- + --------+---------+---------+---------* 35 */ 36 37 #ifndef lint 38 static const char copyright[] = 39 "@(#) Copyright (c) 1990, 1993, 1994\n\ 40 The Regents of the University of California. All rights reserved.\n"; 41 #endif /* not lint */ 42 43 #if 0 44 #ifndef lint 45 static char sccsid[] = "@(#)ps.c 8.4 (Berkeley) 4/2/94"; 46 #endif /* not lint */ 47 #endif 48 49 #include <sys/cdefs.h> 50 __FBSDID("$FreeBSD$"); 51 52 #include <sys/param.h> 53 #include <sys/jail.h> 54 #include <sys/proc.h> 55 #include <sys/user.h> 56 #include <sys/stat.h> 57 #include <sys/ioctl.h> 58 #include <sys/sysctl.h> 59 #include <sys/mount.h> 60 61 #include <ctype.h> 62 #include <err.h> 63 #include <errno.h> 64 #include <fcntl.h> 65 #include <grp.h> 66 #include <jail.h> 67 #include <kvm.h> 68 #include <limits.h> 69 #include <locale.h> 70 #include <paths.h> 71 #include <pwd.h> 72 #include <stdio.h> 73 #include <stdlib.h> 74 #include <string.h> 75 #include <unistd.h> 76 #include <libxo/xo.h> 77 78 #include "ps.h" 79 80 #define _PATH_PTS "/dev/pts/" 81 82 #define W_SEP " \t" /* "Whitespace" list separators */ 83 #define T_SEP "," /* "Terminate-element" list separators */ 84 85 #ifdef LAZY_PS 86 #define DEF_UREAD 0 87 #define OPT_LAZY_f "f" 88 #else 89 #define DEF_UREAD 1 /* Always do the more-expensive read. */ 90 #define OPT_LAZY_f /* I.e., the `-f' option is not added. */ 91 #endif 92 93 /* 94 * isdigit takes an `int', but expects values in the range of unsigned char. 95 * This wrapper ensures that values from a 'char' end up in the correct range. 96 */ 97 #define isdigitch(Anychar) isdigit((u_char)(Anychar)) 98 99 int cflag; /* -c */ 100 int eval; /* Exit value */ 101 time_t now; /* Current time(3) value */ 102 int rawcpu; /* -C */ 103 int sumrusage; /* -S */ 104 int termwidth; /* Width of the screen (0 == infinity). */ 105 int showthreads; /* will threads be shown? */ 106 107 struct velisthead varlist = STAILQ_HEAD_INITIALIZER(varlist); 108 109 static int forceuread = DEF_UREAD; /* Do extra work to get u-area. */ 110 static kvm_t *kd; 111 static int needcomm; /* -o "command" */ 112 static int needenv; /* -e */ 113 static int needuser; /* -o "user" */ 114 static int optfatal; /* Fatal error parsing some list-option. */ 115 static int pid_max; /* kern.max_pid */ 116 117 static enum sort { DEFAULT, SORTMEM, SORTCPU } sortby = DEFAULT; 118 119 struct listinfo; 120 typedef int addelem_rtn(struct listinfo *_inf, const char *_elem); 121 122 struct listinfo { 123 int count; 124 int maxcount; 125 int elemsize; 126 addelem_rtn *addelem; 127 const char *lname; 128 union { 129 gid_t *gids; 130 int *jids; 131 pid_t *pids; 132 dev_t *ttys; 133 uid_t *uids; 134 void *ptr; 135 } l; 136 }; 137 138 static int addelem_gid(struct listinfo *, const char *); 139 static int addelem_jid(struct listinfo *, const char *); 140 static int addelem_pid(struct listinfo *, const char *); 141 static int addelem_tty(struct listinfo *, const char *); 142 static int addelem_uid(struct listinfo *, const char *); 143 static void add_list(struct listinfo *, const char *); 144 static void descendant_sort(KINFO *, int); 145 static void format_output(KINFO *); 146 static void *expand_list(struct listinfo *); 147 static const char * 148 fmt(char **(*)(kvm_t *, const struct kinfo_proc *, int), 149 KINFO *, char *, char *, int); 150 static void free_list(struct listinfo *); 151 static void init_list(struct listinfo *, addelem_rtn, int, const char *); 152 static char *kludge_oldps_options(const char *, char *, const char *); 153 static int pscomp(const void *, const void *); 154 static void saveuser(KINFO *); 155 static void scanvars(void); 156 static void sizevars(void); 157 static void pidmax_init(void); 158 static void usage(void); 159 160 static char dfmt[] = "pid,tt,state,time,command"; 161 static char jfmt[] = "user,pid,ppid,pgid,sid,jobc,state,tt,time,command"; 162 static char lfmt[] = "uid,pid,ppid,cpu,pri,nice,vsz,rss,mwchan,state," 163 "tt,time,command"; 164 static char o1[] = "pid"; 165 static char o2[] = "tt,state,time,command"; 166 static char ufmt[] = "user,pid,%cpu,%mem,vsz,rss,tt,state,start,time,command"; 167 static char vfmt[] = "pid,state,time,sl,re,pagein,vsz,rss,lim,tsiz," 168 "%cpu,%mem,command"; 169 static char Zfmt[] = "label"; 170 171 #define PS_ARGS "AaCcde" OPT_LAZY_f "G:gHhjJ:LlM:mN:O:o:p:rSTt:U:uvwXxZ" 172 173 int 174 main(int argc, char *argv[]) 175 { 176 struct listinfo gidlist, jidlist, pgrplist, pidlist; 177 struct listinfo ruidlist, sesslist, ttylist, uidlist; 178 struct kinfo_proc *kp; 179 KINFO *kinfo = NULL, *next_KINFO; 180 KINFO_STR *ks; 181 struct varent *vent; 182 struct winsize ws = { .ws_row = 0 }; 183 const char *nlistf, *memf, *str; 184 char *cols; 185 int all, ch, elem, flag, _fmt, i, lineno, linelen, left; 186 int descendancy, nentries, nkept, nselectors; 187 int prtheader, wflag, what, xkeep, xkeep_implied; 188 int fwidthmin, fwidthmax; 189 char errbuf[_POSIX2_LINE_MAX]; 190 char fmtbuf[_POSIX2_LINE_MAX]; 191 192 (void) setlocale(LC_ALL, ""); 193 time(&now); /* Used by routines in print.c. */ 194 195 if ((cols = getenv("COLUMNS")) != NULL && *cols != '\0') 196 termwidth = atoi(cols); 197 else if (!isatty(STDOUT_FILENO)) 198 termwidth = UNLIMITED; 199 else if ((ioctl(STDOUT_FILENO, TIOCGWINSZ, (char *)&ws) == -1 && 200 ioctl(STDERR_FILENO, TIOCGWINSZ, (char *)&ws) == -1 && 201 ioctl(STDIN_FILENO, TIOCGWINSZ, (char *)&ws) == -1) || 202 ws.ws_col == 0) 203 termwidth = 79; 204 else 205 termwidth = ws.ws_col - 1; 206 207 /* 208 * Hide a number of option-processing kludges in a separate routine, 209 * to support some historical BSD behaviors, such as `ps axu'. 210 */ 211 if (argc > 1) 212 argv[1] = kludge_oldps_options(PS_ARGS, argv[1], argv[2]); 213 214 pidmax_init(); 215 216 all = descendancy = _fmt = nselectors = optfatal = 0; 217 prtheader = showthreads = wflag = xkeep_implied = 0; 218 xkeep = -1; /* Neither -x nor -X. */ 219 init_list(&gidlist, addelem_gid, sizeof(gid_t), "group"); 220 init_list(&jidlist, addelem_jid, sizeof(int), "jail id"); 221 init_list(&pgrplist, addelem_pid, sizeof(pid_t), "process group"); 222 init_list(&pidlist, addelem_pid, sizeof(pid_t), "process id"); 223 init_list(&ruidlist, addelem_uid, sizeof(uid_t), "ruser"); 224 init_list(&sesslist, addelem_pid, sizeof(pid_t), "session id"); 225 init_list(&ttylist, addelem_tty, sizeof(dev_t), "tty"); 226 init_list(&uidlist, addelem_uid, sizeof(uid_t), "user"); 227 memf = _PATH_DEVNULL; 228 nlistf = NULL; 229 230 argc = xo_parse_args(argc, argv); 231 if (argc < 0) 232 exit(1); 233 234 while ((ch = getopt(argc, argv, PS_ARGS)) != -1) 235 switch (ch) { 236 case 'A': 237 /* 238 * Exactly the same as `-ax'. This has been 239 * added for compatibility with SUSv3, but for 240 * now it will not be described in the man page. 241 */ 242 nselectors++; 243 all = xkeep = 1; 244 break; 245 case 'a': 246 nselectors++; 247 all = 1; 248 break; 249 case 'C': 250 rawcpu = 1; 251 break; 252 case 'c': 253 cflag = 1; 254 break; 255 case 'd': 256 descendancy = 1; 257 break; 258 case 'e': /* XXX set ufmt */ 259 needenv = 1; 260 break; 261 #ifdef LAZY_PS 262 case 'f': 263 if (getuid() == 0 || getgid() == 0) 264 forceuread = 1; 265 break; 266 #endif 267 case 'G': 268 add_list(&gidlist, optarg); 269 xkeep_implied = 1; 270 nselectors++; 271 break; 272 case 'g': 273 #if 0 274 /*- 275 * XXX - This SUSv3 behavior is still under debate 276 * since it conflicts with the (undocumented) 277 * `-g' option. So we skip it for now. 278 */ 279 add_list(&pgrplist, optarg); 280 xkeep_implied = 1; 281 nselectors++; 282 break; 283 #else 284 /* The historical BSD-ish (from SunOS) behavior. */ 285 break; /* no-op */ 286 #endif 287 case 'H': 288 showthreads = KERN_PROC_INC_THREAD; 289 break; 290 case 'h': 291 prtheader = ws.ws_row > 5 ? ws.ws_row : 22; 292 break; 293 case 'J': 294 add_list(&jidlist, optarg); 295 xkeep_implied = 1; 296 nselectors++; 297 break; 298 case 'j': 299 parsefmt(jfmt, 0); 300 _fmt = 1; 301 jfmt[0] = '\0'; 302 break; 303 case 'L': 304 showkey(); 305 exit(0); 306 case 'l': 307 parsefmt(lfmt, 0); 308 _fmt = 1; 309 lfmt[0] = '\0'; 310 break; 311 case 'M': 312 memf = optarg; 313 break; 314 case 'm': 315 sortby = SORTMEM; 316 break; 317 case 'N': 318 nlistf = optarg; 319 break; 320 case 'O': 321 parsefmt(o1, 1); 322 parsefmt(optarg, 1); 323 parsefmt(o2, 1); 324 o1[0] = o2[0] = '\0'; 325 _fmt = 1; 326 break; 327 case 'o': 328 parsefmt(optarg, 1); 329 _fmt = 1; 330 break; 331 case 'p': 332 add_list(&pidlist, optarg); 333 /* 334 * Note: `-p' does not *set* xkeep, but any values 335 * from pidlist are checked before xkeep is. That 336 * way they are always matched, even if the user 337 * specifies `-X'. 338 */ 339 nselectors++; 340 break; 341 #if 0 342 case 'R': 343 /*- 344 * XXX - This un-standard option is still under 345 * debate. This is what SUSv3 defines as 346 * the `-U' option, and while it would be 347 * nice to have, it could cause even more 348 * confusion to implement it as `-R'. 349 */ 350 add_list(&ruidlist, optarg); 351 xkeep_implied = 1; 352 nselectors++; 353 break; 354 #endif 355 case 'r': 356 sortby = SORTCPU; 357 break; 358 case 'S': 359 sumrusage = 1; 360 break; 361 #if 0 362 case 's': 363 /*- 364 * XXX - This non-standard option is still under 365 * debate. This *is* supported on Solaris, 366 * Linux, and IRIX, but conflicts with `-s' 367 * on NetBSD and maybe some older BSD's. 368 */ 369 add_list(&sesslist, optarg); 370 xkeep_implied = 1; 371 nselectors++; 372 break; 373 #endif 374 case 'T': 375 if ((optarg = ttyname(STDIN_FILENO)) == NULL) 376 xo_errx(1, "stdin: not a terminal"); 377 /* FALLTHROUGH */ 378 case 't': 379 add_list(&ttylist, optarg); 380 xkeep_implied = 1; 381 nselectors++; 382 break; 383 case 'U': 384 /* This is what SUSv3 defines as the `-u' option. */ 385 add_list(&uidlist, optarg); 386 xkeep_implied = 1; 387 nselectors++; 388 break; 389 case 'u': 390 parsefmt(ufmt, 0); 391 sortby = SORTCPU; 392 _fmt = 1; 393 ufmt[0] = '\0'; 394 break; 395 case 'v': 396 parsefmt(vfmt, 0); 397 sortby = SORTMEM; 398 _fmt = 1; 399 vfmt[0] = '\0'; 400 break; 401 case 'w': 402 if (wflag) 403 termwidth = UNLIMITED; 404 else if (termwidth < 131 && termwidth != UNLIMITED) 405 termwidth = 131; 406 wflag++; 407 break; 408 case 'X': 409 /* 410 * Note that `-X' and `-x' are not standard "selector" 411 * options. For most selector-options, we check *all* 412 * processes to see if any are matched by the given 413 * value(s). After we have a set of all the matched 414 * processes, then `-X' and `-x' govern whether we 415 * modify that *matched* set for processes which do 416 * not have a controlling terminal. `-X' causes 417 * those processes to be deleted from the matched 418 * set, while `-x' causes them to be kept. 419 */ 420 xkeep = 0; 421 break; 422 case 'x': 423 xkeep = 1; 424 break; 425 case 'Z': 426 parsefmt(Zfmt, 0); 427 Zfmt[0] = '\0'; 428 break; 429 case '?': 430 default: 431 usage(); 432 } 433 argc -= optind; 434 argv += optind; 435 436 /* 437 * If there arguments after processing all the options, attempt 438 * to treat them as a list of process ids. 439 */ 440 while (*argv) { 441 if (!isdigitch(**argv)) 442 break; 443 add_list(&pidlist, *argv); 444 argv++; 445 } 446 if (*argv) { 447 xo_warnx("illegal argument: %s\n", *argv); 448 usage(); 449 } 450 if (optfatal) 451 exit(1); /* Error messages already printed. */ 452 if (xkeep < 0) /* Neither -X nor -x was specified. */ 453 xkeep = xkeep_implied; 454 455 kd = kvm_openfiles(nlistf, memf, NULL, O_RDONLY, errbuf); 456 if (kd == NULL) 457 xo_errx(1, "%s", errbuf); 458 459 if (!_fmt) 460 parsefmt(dfmt, 0); 461 462 if (nselectors == 0) { 463 uidlist.l.ptr = malloc(sizeof(uid_t)); 464 if (uidlist.l.ptr == NULL) 465 xo_errx(1, "malloc failed"); 466 nselectors = 1; 467 uidlist.count = uidlist.maxcount = 1; 468 *uidlist.l.uids = getuid(); 469 } 470 471 /* 472 * scan requested variables, noting what structures are needed, 473 * and adjusting header widths as appropriate. 474 */ 475 scanvars(); 476 477 /* 478 * Get process list. If the user requested just one selector- 479 * option, then kvm_getprocs can be asked to return just those 480 * processes. Otherwise, have it return all processes, and 481 * then this routine will search that full list and select the 482 * processes which match any of the user's selector-options. 483 */ 484 what = showthreads != 0 ? KERN_PROC_ALL : KERN_PROC_PROC; 485 flag = 0; 486 if (nselectors == 1) { 487 if (gidlist.count == 1) { 488 what = KERN_PROC_RGID | showthreads; 489 flag = *gidlist.l.gids; 490 nselectors = 0; 491 } else if (pgrplist.count == 1) { 492 what = KERN_PROC_PGRP | showthreads; 493 flag = *pgrplist.l.pids; 494 nselectors = 0; 495 } else if (pidlist.count == 1) { 496 what = KERN_PROC_PID | showthreads; 497 flag = *pidlist.l.pids; 498 nselectors = 0; 499 } else if (ruidlist.count == 1) { 500 what = KERN_PROC_RUID | showthreads; 501 flag = *ruidlist.l.uids; 502 nselectors = 0; 503 } else if (sesslist.count == 1) { 504 what = KERN_PROC_SESSION | showthreads; 505 flag = *sesslist.l.pids; 506 nselectors = 0; 507 } else if (ttylist.count == 1) { 508 what = KERN_PROC_TTY | showthreads; 509 flag = *ttylist.l.ttys; 510 nselectors = 0; 511 } else if (uidlist.count == 1) { 512 what = KERN_PROC_UID | showthreads; 513 flag = *uidlist.l.uids; 514 nselectors = 0; 515 } else if (all) { 516 /* No need for this routine to select processes. */ 517 nselectors = 0; 518 } 519 } 520 521 /* 522 * select procs 523 */ 524 nentries = -1; 525 kp = kvm_getprocs(kd, what, flag, &nentries); 526 /* 527 * Ignore ESRCH to preserve behaviour of "ps -p nonexistent-pid" 528 * not reporting an error. 529 */ 530 if ((kp == NULL && errno != ESRCH) || (kp != NULL && nentries < 0)) 531 xo_errx(1, "%s", kvm_geterr(kd)); 532 nkept = 0; 533 if (nentries > 0) { 534 if ((kinfo = malloc(nentries * sizeof(*kinfo))) == NULL) 535 xo_errx(1, "malloc failed"); 536 for (i = nentries; --i >= 0; ++kp) { 537 /* 538 * If the user specified multiple selection-criteria, 539 * then keep any process matched by the inclusive OR 540 * of all the selection-criteria given. 541 */ 542 if (pidlist.count > 0) { 543 for (elem = 0; elem < pidlist.count; elem++) 544 if (kp->ki_pid == pidlist.l.pids[elem]) 545 goto keepit; 546 } 547 /* 548 * Note that we had to process pidlist before 549 * filtering out processes which do not have 550 * a controlling terminal. 551 */ 552 if (xkeep == 0) { 553 if ((kp->ki_tdev == NODEV || 554 (kp->ki_flag & P_CONTROLT) == 0)) 555 continue; 556 } 557 if (nselectors == 0) 558 goto keepit; 559 if (gidlist.count > 0) { 560 for (elem = 0; elem < gidlist.count; elem++) 561 if (kp->ki_rgid == gidlist.l.gids[elem]) 562 goto keepit; 563 } 564 if (jidlist.count > 0) { 565 for (elem = 0; elem < jidlist.count; elem++) 566 if (kp->ki_jid == jidlist.l.jids[elem]) 567 goto keepit; 568 } 569 if (pgrplist.count > 0) { 570 for (elem = 0; elem < pgrplist.count; elem++) 571 if (kp->ki_pgid == 572 pgrplist.l.pids[elem]) 573 goto keepit; 574 } 575 if (ruidlist.count > 0) { 576 for (elem = 0; elem < ruidlist.count; elem++) 577 if (kp->ki_ruid == 578 ruidlist.l.uids[elem]) 579 goto keepit; 580 } 581 if (sesslist.count > 0) { 582 for (elem = 0; elem < sesslist.count; elem++) 583 if (kp->ki_sid == sesslist.l.pids[elem]) 584 goto keepit; 585 } 586 if (ttylist.count > 0) { 587 for (elem = 0; elem < ttylist.count; elem++) 588 if (kp->ki_tdev == ttylist.l.ttys[elem]) 589 goto keepit; 590 } 591 if (uidlist.count > 0) { 592 for (elem = 0; elem < uidlist.count; elem++) 593 if (kp->ki_uid == uidlist.l.uids[elem]) 594 goto keepit; 595 } 596 /* 597 * This process did not match any of the user's 598 * selector-options, so skip the process. 599 */ 600 continue; 601 602 keepit: 603 next_KINFO = &kinfo[nkept]; 604 next_KINFO->ki_p = kp; 605 next_KINFO->ki_d.level = 0; 606 next_KINFO->ki_d.prefix = NULL; 607 next_KINFO->ki_pcpu = getpcpu(next_KINFO); 608 if (sortby == SORTMEM) 609 next_KINFO->ki_memsize = kp->ki_tsize + 610 kp->ki_dsize + kp->ki_ssize; 611 if (needuser) 612 saveuser(next_KINFO); 613 nkept++; 614 } 615 } 616 617 sizevars(); 618 619 if (nkept == 0) { 620 printheader(); 621 xo_finish(); 622 exit(1); 623 } 624 625 /* 626 * sort proc list 627 */ 628 qsort(kinfo, nkept, sizeof(KINFO), pscomp); 629 630 /* 631 * We want things in descendant order 632 */ 633 if (descendancy) 634 descendant_sort(kinfo, nkept); 635 636 637 /* 638 * Prepare formatted output. 639 */ 640 for (i = 0; i < nkept; i++) 641 format_output(&kinfo[i]); 642 643 /* 644 * Print header. 645 */ 646 xo_open_container("process-information"); 647 printheader(); 648 if (xo_get_style(NULL) != XO_STYLE_TEXT) 649 termwidth = UNLIMITED; 650 651 /* 652 * Output formatted lines. 653 */ 654 xo_open_list("process"); 655 for (i = lineno = 0; i < nkept; i++) { 656 linelen = 0; 657 xo_open_instance("process"); 658 STAILQ_FOREACH(vent, &varlist, next_ve) { 659 ks = STAILQ_FIRST(&kinfo[i].ki_ks); 660 STAILQ_REMOVE_HEAD(&kinfo[i].ki_ks, ks_next); 661 /* Truncate rightmost column if necessary. */ 662 fwidthmax = _POSIX2_LINE_MAX; 663 if (STAILQ_NEXT(vent, next_ve) == NULL && 664 termwidth != UNLIMITED && ks->ks_str != NULL) { 665 left = termwidth - linelen; 666 if (left > 0 && left < (int)strlen(ks->ks_str)) 667 fwidthmax = left; 668 } 669 670 str = ks->ks_str; 671 if (str == NULL) 672 str = "-"; 673 /* No padding for the last column, if it's LJUST. */ 674 fwidthmin = (xo_get_style(NULL) != XO_STYLE_TEXT || 675 (STAILQ_NEXT(vent, next_ve) == NULL && 676 (vent->var->flag & LJUST))) ? 0 : vent->var->width; 677 snprintf(fmtbuf, sizeof(fmtbuf), "{:%s/%%%s%d..%ds}", 678 vent->var->field ?: vent->var->name, 679 (vent->var->flag & LJUST) ? "-" : "", 680 fwidthmin, fwidthmax); 681 xo_emit(fmtbuf, str); 682 linelen += fwidthmin; 683 684 if (ks->ks_str != NULL) { 685 free(ks->ks_str); 686 ks->ks_str = NULL; 687 } 688 free(ks); 689 ks = NULL; 690 691 if (STAILQ_NEXT(vent, next_ve) != NULL) { 692 xo_emit("{P: }"); 693 linelen++; 694 } 695 } 696 xo_emit("\n"); 697 xo_close_instance("process"); 698 if (prtheader && lineno++ == prtheader - 4) { 699 xo_emit("\n"); 700 printheader(); 701 lineno = 0; 702 } 703 } 704 xo_close_list("process"); 705 xo_close_container("process-information"); 706 xo_finish(); 707 708 free_list(&gidlist); 709 free_list(&jidlist); 710 free_list(&pidlist); 711 free_list(&pgrplist); 712 free_list(&ruidlist); 713 free_list(&sesslist); 714 free_list(&ttylist); 715 free_list(&uidlist); 716 for (i = 0; i < nkept; i++) 717 free(kinfo[i].ki_d.prefix); 718 free(kinfo); 719 720 exit(eval); 721 } 722 723 static int 724 addelem_gid(struct listinfo *inf, const char *elem) 725 { 726 struct group *grp; 727 const char *nameorID; 728 char *endp; 729 u_long bigtemp; 730 731 if (*elem == '\0' || strlen(elem) >= MAXLOGNAME) { 732 if (*elem == '\0') 733 xo_warnx("Invalid (zero-length) %s name", inf->lname); 734 else 735 xo_warnx("%s name too long: %s", inf->lname, elem); 736 optfatal = 1; 737 return (0); /* Do not add this value. */ 738 } 739 740 /* 741 * SUSv3 states that `ps -G grouplist' should match "real-group 742 * ID numbers", and does not mention group-names. I do want to 743 * also support group-names, so this tries for a group-id first, 744 * and only tries for a name if that doesn't work. This is the 745 * opposite order of what is done in addelem_uid(), but in 746 * practice the order would only matter for group-names which 747 * are all-numeric. 748 */ 749 grp = NULL; 750 nameorID = "named"; 751 errno = 0; 752 bigtemp = strtoul(elem, &endp, 10); 753 if (errno == 0 && *endp == '\0' && bigtemp <= GID_MAX) { 754 nameorID = "name or ID matches"; 755 grp = getgrgid((gid_t)bigtemp); 756 } 757 if (grp == NULL) 758 grp = getgrnam(elem); 759 if (grp == NULL) { 760 xo_warnx("No %s %s '%s'", inf->lname, nameorID, elem); 761 optfatal = 1; 762 return (0); 763 } 764 if (inf->count >= inf->maxcount) 765 expand_list(inf); 766 inf->l.gids[(inf->count)++] = grp->gr_gid; 767 return (1); 768 } 769 770 static int 771 addelem_jid(struct listinfo *inf, const char *elem) 772 { 773 int tempid; 774 775 if (*elem == '\0') { 776 warnx("Invalid (zero-length) jail id"); 777 optfatal = 1; 778 return (0); /* Do not add this value. */ 779 } 780 781 tempid = jail_getid(elem); 782 if (tempid < 0) { 783 warnx("Invalid %s: %s", inf->lname, elem); 784 optfatal = 1; 785 return (0); 786 } 787 788 if (inf->count >= inf->maxcount) 789 expand_list(inf); 790 inf->l.jids[(inf->count)++] = tempid; 791 return (1); 792 } 793 794 static int 795 addelem_pid(struct listinfo *inf, const char *elem) 796 { 797 char *endp; 798 long tempid; 799 800 if (*elem == '\0') { 801 xo_warnx("Invalid (zero-length) process id"); 802 optfatal = 1; 803 return (0); /* Do not add this value. */ 804 } 805 806 errno = 0; 807 tempid = strtol(elem, &endp, 10); 808 if (*endp != '\0' || tempid < 0 || elem == endp) { 809 xo_warnx("Invalid %s: %s", inf->lname, elem); 810 errno = ERANGE; 811 } else if (errno != 0 || tempid > pid_max) { 812 xo_warnx("%s too large: %s", inf->lname, elem); 813 errno = ERANGE; 814 } 815 if (errno == ERANGE) { 816 optfatal = 1; 817 return (0); 818 } 819 if (inf->count >= inf->maxcount) 820 expand_list(inf); 821 inf->l.pids[(inf->count)++] = tempid; 822 return (1); 823 } 824 825 /*- 826 * The user can specify a device via one of three formats: 827 * 1) fully qualified, e.g.: /dev/ttyp0 /dev/console /dev/pts/0 828 * 2) missing "/dev", e.g.: ttyp0 console pts/0 829 * 3) two-letters, e.g.: p0 co 0 830 * (matching letters that would be seen in the "TT" column) 831 */ 832 static int 833 addelem_tty(struct listinfo *inf, const char *elem) 834 { 835 const char *ttypath; 836 struct stat sb; 837 char pathbuf[PATH_MAX], pathbuf2[PATH_MAX], pathbuf3[PATH_MAX]; 838 839 ttypath = NULL; 840 pathbuf2[0] = '\0'; 841 pathbuf3[0] = '\0'; 842 switch (*elem) { 843 case '/': 844 ttypath = elem; 845 break; 846 case 'c': 847 if (strcmp(elem, "co") == 0) { 848 ttypath = _PATH_CONSOLE; 849 break; 850 } 851 /* FALLTHROUGH */ 852 default: 853 strlcpy(pathbuf, _PATH_DEV, sizeof(pathbuf)); 854 strlcat(pathbuf, elem, sizeof(pathbuf)); 855 ttypath = pathbuf; 856 if (strncmp(pathbuf, _PATH_TTY, strlen(_PATH_TTY)) == 0) 857 break; 858 if (strncmp(pathbuf, _PATH_PTS, strlen(_PATH_PTS)) == 0) 859 break; 860 if (strcmp(pathbuf, _PATH_CONSOLE) == 0) 861 break; 862 /* Check to see if /dev/tty${elem} exists */ 863 strlcpy(pathbuf2, _PATH_TTY, sizeof(pathbuf2)); 864 strlcat(pathbuf2, elem, sizeof(pathbuf2)); 865 if (stat(pathbuf2, &sb) == 0 && S_ISCHR(sb.st_mode)) { 866 /* No need to repeat stat() && S_ISCHR() checks */ 867 ttypath = NULL; 868 break; 869 } 870 /* Check to see if /dev/pts/${elem} exists */ 871 strlcpy(pathbuf3, _PATH_PTS, sizeof(pathbuf3)); 872 strlcat(pathbuf3, elem, sizeof(pathbuf3)); 873 if (stat(pathbuf3, &sb) == 0 && S_ISCHR(sb.st_mode)) { 874 /* No need to repeat stat() && S_ISCHR() checks */ 875 ttypath = NULL; 876 break; 877 } 878 break; 879 } 880 if (ttypath) { 881 if (stat(ttypath, &sb) == -1) { 882 if (pathbuf3[0] != '\0') 883 xo_warn("%s, %s, and %s", pathbuf3, pathbuf2, 884 ttypath); 885 else 886 xo_warn("%s", ttypath); 887 optfatal = 1; 888 return (0); 889 } 890 if (!S_ISCHR(sb.st_mode)) { 891 if (pathbuf3[0] != '\0') 892 xo_warnx("%s, %s, and %s: Not a terminal", 893 pathbuf3, pathbuf2, ttypath); 894 else 895 xo_warnx("%s: Not a terminal", ttypath); 896 optfatal = 1; 897 return (0); 898 } 899 } 900 if (inf->count >= inf->maxcount) 901 expand_list(inf); 902 inf->l.ttys[(inf->count)++] = sb.st_rdev; 903 return (1); 904 } 905 906 static int 907 addelem_uid(struct listinfo *inf, const char *elem) 908 { 909 struct passwd *pwd; 910 char *endp; 911 u_long bigtemp; 912 913 if (*elem == '\0' || strlen(elem) >= MAXLOGNAME) { 914 if (*elem == '\0') 915 xo_warnx("Invalid (zero-length) %s name", inf->lname); 916 else 917 xo_warnx("%s name too long: %s", inf->lname, elem); 918 optfatal = 1; 919 return (0); /* Do not add this value. */ 920 } 921 922 pwd = getpwnam(elem); 923 if (pwd == NULL) { 924 errno = 0; 925 bigtemp = strtoul(elem, &endp, 10); 926 if (errno != 0 || *endp != '\0' || bigtemp > UID_MAX) 927 xo_warnx("No %s named '%s'", inf->lname, elem); 928 else { 929 /* The string is all digits, so it might be a userID. */ 930 pwd = getpwuid((uid_t)bigtemp); 931 if (pwd == NULL) 932 xo_warnx("No %s name or ID matches '%s'", 933 inf->lname, elem); 934 } 935 } 936 if (pwd == NULL) { 937 /* 938 * These used to be treated as minor warnings (and the 939 * option was simply ignored), but now they are fatal 940 * errors (and the command will be aborted). 941 */ 942 optfatal = 1; 943 return (0); 944 } 945 if (inf->count >= inf->maxcount) 946 expand_list(inf); 947 inf->l.uids[(inf->count)++] = pwd->pw_uid; 948 return (1); 949 } 950 951 static void 952 add_list(struct listinfo *inf, const char *argp) 953 { 954 const char *savep; 955 char *cp, *endp; 956 int toolong; 957 char elemcopy[PATH_MAX]; 958 959 if (*argp == '\0') 960 inf->addelem(inf, argp); 961 while (*argp != '\0') { 962 while (*argp != '\0' && strchr(W_SEP, *argp) != NULL) 963 argp++; 964 savep = argp; 965 toolong = 0; 966 cp = elemcopy; 967 if (strchr(T_SEP, *argp) == NULL) { 968 endp = elemcopy + sizeof(elemcopy) - 1; 969 while (*argp != '\0' && cp <= endp && 970 strchr(W_SEP T_SEP, *argp) == NULL) 971 *cp++ = *argp++; 972 if (cp > endp) 973 toolong = 1; 974 } 975 if (!toolong) { 976 *cp = '\0'; 977 /* 978 * Add this single element to the given list. 979 */ 980 inf->addelem(inf, elemcopy); 981 } else { 982 /* 983 * The string is too long to copy. Find the end 984 * of the string to print out the warning message. 985 */ 986 while (*argp != '\0' && strchr(W_SEP T_SEP, 987 *argp) == NULL) 988 argp++; 989 xo_warnx("Value too long: %.*s", (int)(argp - savep), 990 savep); 991 optfatal = 1; 992 } 993 /* 994 * Skip over any number of trailing whitespace characters, 995 * but only one (at most) trailing element-terminating 996 * character. 997 */ 998 while (*argp != '\0' && strchr(W_SEP, *argp) != NULL) 999 argp++; 1000 if (*argp != '\0' && strchr(T_SEP, *argp) != NULL) { 1001 argp++; 1002 /* Catch case where string ended with a comma. */ 1003 if (*argp == '\0') 1004 inf->addelem(inf, argp); 1005 } 1006 } 1007 } 1008 1009 static void 1010 descendant_sort(KINFO *ki, int items) 1011 { 1012 int dst, lvl, maxlvl, n, ndst, nsrc, siblings, src; 1013 unsigned char *path; 1014 KINFO kn; 1015 1016 /* 1017 * First, sort the entries by descendancy, tracking the descendancy 1018 * depth in the ki_d.level field. 1019 */ 1020 src = 0; 1021 maxlvl = 0; 1022 while (src < items) { 1023 if (ki[src].ki_d.level) { 1024 src++; 1025 continue; 1026 } 1027 for (nsrc = 1; src + nsrc < items; nsrc++) 1028 if (!ki[src + nsrc].ki_d.level) 1029 break; 1030 1031 for (dst = 0; dst < items; dst++) { 1032 if (ki[dst].ki_p->ki_pid == ki[src].ki_p->ki_pid) 1033 continue; 1034 if (ki[dst].ki_p->ki_pid == ki[src].ki_p->ki_ppid) 1035 break; 1036 } 1037 1038 if (dst == items) { 1039 src += nsrc; 1040 continue; 1041 } 1042 1043 for (ndst = 1; dst + ndst < items; ndst++) 1044 if (ki[dst + ndst].ki_d.level <= ki[dst].ki_d.level) 1045 break; 1046 1047 for (n = src; n < src + nsrc; n++) { 1048 ki[n].ki_d.level += ki[dst].ki_d.level + 1; 1049 if (maxlvl < ki[n].ki_d.level) 1050 maxlvl = ki[n].ki_d.level; 1051 } 1052 1053 while (nsrc) { 1054 if (src < dst) { 1055 kn = ki[src]; 1056 memmove(ki + src, ki + src + 1, 1057 (dst - src + ndst - 1) * sizeof *ki); 1058 ki[dst + ndst - 1] = kn; 1059 nsrc--; 1060 dst--; 1061 ndst++; 1062 } else if (src != dst + ndst) { 1063 kn = ki[src]; 1064 memmove(ki + dst + ndst + 1, ki + dst + ndst, 1065 (src - dst - ndst) * sizeof *ki); 1066 ki[dst + ndst] = kn; 1067 ndst++; 1068 nsrc--; 1069 src++; 1070 } else { 1071 ndst += nsrc; 1072 src += nsrc; 1073 nsrc = 0; 1074 } 1075 } 1076 } 1077 1078 /* 1079 * Now populate ki_d.prefix (instead of ki_d.level) with the command 1080 * prefix used to show descendancies. 1081 */ 1082 path = malloc((maxlvl + 7) / 8); 1083 memset(path, '\0', (maxlvl + 7) / 8); 1084 for (src = 0; src < items; src++) { 1085 if ((lvl = ki[src].ki_d.level) == 0) { 1086 ki[src].ki_d.prefix = NULL; 1087 continue; 1088 } 1089 if ((ki[src].ki_d.prefix = malloc(lvl * 2 + 1)) == NULL) 1090 xo_errx(1, "malloc failed"); 1091 for (n = 0; n < lvl - 2; n++) { 1092 ki[src].ki_d.prefix[n * 2] = 1093 path[n / 8] & 1 << (n % 8) ? '|' : ' '; 1094 ki[src].ki_d.prefix[n * 2 + 1] = ' '; 1095 } 1096 if (n == lvl - 2) { 1097 /* Have I any more siblings? */ 1098 for (siblings = 0, dst = src + 1; dst < items; dst++) { 1099 if (ki[dst].ki_d.level > lvl) 1100 continue; 1101 if (ki[dst].ki_d.level == lvl) 1102 siblings = 1; 1103 break; 1104 } 1105 if (siblings) 1106 path[n / 8] |= 1 << (n % 8); 1107 else 1108 path[n / 8] &= ~(1 << (n % 8)); 1109 ki[src].ki_d.prefix[n * 2] = siblings ? '|' : '`'; 1110 ki[src].ki_d.prefix[n * 2 + 1] = '-'; 1111 n++; 1112 } 1113 strcpy(ki[src].ki_d.prefix + n * 2, "- "); 1114 } 1115 free(path); 1116 } 1117 1118 static void * 1119 expand_list(struct listinfo *inf) 1120 { 1121 void *newlist; 1122 int newmax; 1123 1124 newmax = (inf->maxcount + 1) << 1; 1125 newlist = realloc(inf->l.ptr, newmax * inf->elemsize); 1126 if (newlist == NULL) { 1127 free(inf->l.ptr); 1128 xo_errx(1, "realloc to %d %ss failed", newmax, inf->lname); 1129 } 1130 inf->maxcount = newmax; 1131 inf->l.ptr = newlist; 1132 1133 return (newlist); 1134 } 1135 1136 static void 1137 free_list(struct listinfo *inf) 1138 { 1139 1140 inf->count = inf->elemsize = inf->maxcount = 0; 1141 if (inf->l.ptr != NULL) 1142 free(inf->l.ptr); 1143 inf->addelem = NULL; 1144 inf->lname = NULL; 1145 inf->l.ptr = NULL; 1146 } 1147 1148 static void 1149 init_list(struct listinfo *inf, addelem_rtn artn, int elemsize, 1150 const char *lname) 1151 { 1152 1153 inf->count = inf->maxcount = 0; 1154 inf->elemsize = elemsize; 1155 inf->addelem = artn; 1156 inf->lname = lname; 1157 inf->l.ptr = NULL; 1158 } 1159 1160 VARENT * 1161 find_varentry(VAR *v) 1162 { 1163 struct varent *vent; 1164 1165 STAILQ_FOREACH(vent, &varlist, next_ve) { 1166 if (strcmp(vent->var->name, v->name) == 0) 1167 return vent; 1168 } 1169 return NULL; 1170 } 1171 1172 static void 1173 scanvars(void) 1174 { 1175 struct varent *vent; 1176 VAR *v; 1177 1178 STAILQ_FOREACH(vent, &varlist, next_ve) { 1179 v = vent->var; 1180 if (v->flag & USER) 1181 needuser = 1; 1182 if (v->flag & COMM) 1183 needcomm = 1; 1184 } 1185 } 1186 1187 static void 1188 format_output(KINFO *ki) 1189 { 1190 struct varent *vent; 1191 VAR *v; 1192 KINFO_STR *ks; 1193 char *str; 1194 int len; 1195 1196 STAILQ_INIT(&ki->ki_ks); 1197 STAILQ_FOREACH(vent, &varlist, next_ve) { 1198 v = vent->var; 1199 str = (v->oproc)(ki, vent); 1200 ks = malloc(sizeof(*ks)); 1201 if (ks == NULL) 1202 xo_errx(1, "malloc failed"); 1203 ks->ks_str = str; 1204 STAILQ_INSERT_TAIL(&ki->ki_ks, ks, ks_next); 1205 if (str != NULL) { 1206 len = strlen(str); 1207 } else 1208 len = 1; /* "-" */ 1209 if (v->width < len) 1210 v->width = len; 1211 } 1212 } 1213 1214 static void 1215 sizevars(void) 1216 { 1217 struct varent *vent; 1218 VAR *v; 1219 int i; 1220 1221 STAILQ_FOREACH(vent, &varlist, next_ve) { 1222 v = vent->var; 1223 i = strlen(vent->header); 1224 if (v->width < i) 1225 v->width = i; 1226 } 1227 } 1228 1229 static const char * 1230 fmt(char **(*fn)(kvm_t *, const struct kinfo_proc *, int), KINFO *ki, 1231 char *comm, char *thread, int maxlen) 1232 { 1233 const char *s; 1234 1235 s = fmt_argv((*fn)(kd, ki->ki_p, termwidth), comm, 1236 showthreads && ki->ki_p->ki_numthreads > 1 ? thread : NULL, maxlen); 1237 return (s); 1238 } 1239 1240 #define UREADOK(ki) (forceuread || (ki->ki_p->ki_flag & P_INMEM)) 1241 1242 static void 1243 saveuser(KINFO *ki) 1244 { 1245 char *argsp; 1246 1247 if (ki->ki_p->ki_flag & P_INMEM) { 1248 /* 1249 * The u-area might be swapped out, and we can't get 1250 * at it because we have a crashdump and no swap. 1251 * If it's here fill in these fields, otherwise, just 1252 * leave them 0. 1253 */ 1254 ki->ki_valid = 1; 1255 } else 1256 ki->ki_valid = 0; 1257 /* 1258 * save arguments if needed 1259 */ 1260 if (needcomm) { 1261 if (ki->ki_p->ki_stat == SZOMB) 1262 ki->ki_args = strdup("<defunct>"); 1263 else if (UREADOK(ki) || (ki->ki_p->ki_args != NULL)) 1264 ki->ki_args = fmt(kvm_getargv, ki, 1265 ki->ki_p->ki_comm, ki->ki_p->ki_tdname, MAXCOMLEN); 1266 else { 1267 asprintf(&argsp, "(%s)", ki->ki_p->ki_comm); 1268 ki->ki_args = argsp; 1269 } 1270 if (ki->ki_args == NULL) 1271 xo_errx(1, "malloc failed"); 1272 } else { 1273 ki->ki_args = NULL; 1274 } 1275 if (needenv) { 1276 if (UREADOK(ki)) 1277 ki->ki_env = fmt(kvm_getenvv, ki, 1278 (char *)NULL, (char *)NULL, 0); 1279 else 1280 ki->ki_env = strdup("()"); 1281 if (ki->ki_env == NULL) 1282 xo_errx(1, "malloc failed"); 1283 } else { 1284 ki->ki_env = NULL; 1285 } 1286 } 1287 1288 /* A macro used to improve the readability of pscomp(). */ 1289 #define DIFF_RETURN(a, b, field) do { \ 1290 if ((a)->field != (b)->field) \ 1291 return (((a)->field < (b)->field) ? -1 : 1); \ 1292 } while (0) 1293 1294 static int 1295 pscomp(const void *a, const void *b) 1296 { 1297 const KINFO *ka, *kb; 1298 1299 ka = a; 1300 kb = b; 1301 /* SORTCPU and SORTMEM are sorted in descending order. */ 1302 if (sortby == SORTCPU) 1303 DIFF_RETURN(kb, ka, ki_pcpu); 1304 if (sortby == SORTMEM) 1305 DIFF_RETURN(kb, ka, ki_memsize); 1306 /* 1307 * TTY's are sorted in ascending order, except that all NODEV 1308 * processes come before all processes with a device. 1309 */ 1310 if (ka->ki_p->ki_tdev != kb->ki_p->ki_tdev) { 1311 if (ka->ki_p->ki_tdev == NODEV) 1312 return (-1); 1313 if (kb->ki_p->ki_tdev == NODEV) 1314 return (1); 1315 DIFF_RETURN(ka, kb, ki_p->ki_tdev); 1316 } 1317 1318 /* PID's and TID's (threads) are sorted in ascending order. */ 1319 DIFF_RETURN(ka, kb, ki_p->ki_pid); 1320 DIFF_RETURN(ka, kb, ki_p->ki_tid); 1321 return (0); 1322 } 1323 #undef DIFF_RETURN 1324 1325 /* 1326 * ICK (all for getopt), would rather hide the ugliness 1327 * here than taint the main code. 1328 * 1329 * ps foo -> ps -foo 1330 * ps 34 -> ps -p34 1331 * 1332 * The old convention that 't' with no trailing tty arg means the users 1333 * tty, is only supported if argv[1] doesn't begin with a '-'. This same 1334 * feature is available with the option 'T', which takes no argument. 1335 */ 1336 static char * 1337 kludge_oldps_options(const char *optlist, char *origval, const char *nextarg) 1338 { 1339 size_t len; 1340 char *argp, *cp, *newopts, *ns, *optp, *pidp; 1341 1342 /* 1343 * See if the original value includes any option which takes an 1344 * argument (and will thus use up the remainder of the string). 1345 */ 1346 argp = NULL; 1347 if (optlist != NULL) { 1348 for (cp = origval; *cp != '\0'; cp++) { 1349 optp = strchr(optlist, *cp); 1350 if ((optp != NULL) && *(optp + 1) == ':') { 1351 argp = cp; 1352 break; 1353 } 1354 } 1355 } 1356 if (argp != NULL && *origval == '-') 1357 return (origval); 1358 1359 /* 1360 * if last letter is a 't' flag with no argument (in the context 1361 * of the oldps options -- option string NOT starting with a '-' -- 1362 * then convert to 'T' (meaning *this* terminal, i.e. ttyname(0)). 1363 * 1364 * However, if a flag accepting a string argument is found earlier 1365 * in the option string (including a possible `t' flag), then the 1366 * remainder of the string must be the argument to that flag; so 1367 * do not modify that argument. Note that a trailing `t' would 1368 * cause argp to be set, if argp was not already set by some 1369 * earlier option. 1370 */ 1371 len = strlen(origval); 1372 cp = origval + len - 1; 1373 pidp = NULL; 1374 if (*cp == 't' && *origval != '-' && cp == argp) { 1375 if (nextarg == NULL || *nextarg == '-' || isdigitch(*nextarg)) 1376 *cp = 'T'; 1377 } else if (argp == NULL) { 1378 /* 1379 * The original value did not include any option which takes 1380 * an argument (and that would include `p' and `t'), so check 1381 * the value for trailing number, or comma-separated list of 1382 * numbers, which we will treat as a pid request. 1383 */ 1384 if (isdigitch(*cp)) { 1385 while (cp >= origval && (*cp == ',' || isdigitch(*cp))) 1386 --cp; 1387 pidp = cp + 1; 1388 } 1389 } 1390 1391 /* 1392 * If nothing needs to be added to the string, then return 1393 * the "original" (although possibly modified) value. 1394 */ 1395 if (*origval == '-' && pidp == NULL) 1396 return (origval); 1397 1398 /* 1399 * Create a copy of the string to add '-' and/or 'p' to the 1400 * original value. 1401 */ 1402 if ((newopts = ns = malloc(len + 3)) == NULL) 1403 xo_errx(1, "malloc failed"); 1404 1405 if (*origval != '-') 1406 *ns++ = '-'; /* add option flag */ 1407 1408 if (pidp == NULL) 1409 strcpy(ns, origval); 1410 else { 1411 /* 1412 * Copy everything before the pid string, add the `p', 1413 * and then copy the pid string. 1414 */ 1415 len = pidp - origval; 1416 memcpy(ns, origval, len); 1417 ns += len; 1418 *ns++ = 'p'; 1419 strcpy(ns, pidp); 1420 } 1421 1422 return (newopts); 1423 } 1424 1425 static void 1426 pidmax_init(void) 1427 { 1428 size_t intsize; 1429 1430 intsize = sizeof(pid_max); 1431 if (sysctlbyname("kern.pid_max", &pid_max, &intsize, NULL, 0) < 0) { 1432 xo_warn("unable to read kern.pid_max"); 1433 pid_max = 99999; 1434 } 1435 } 1436 1437 static void 1438 usage(void) 1439 { 1440 #define SINGLE_OPTS "[-aCcde" OPT_LAZY_f "HhjlmrSTuvwXxZ]" 1441 1442 (void)xo_error("%s\n%s\n%s\n%s\n", 1443 "usage: ps " SINGLE_OPTS " [-O fmt | -o fmt] [-G gid[,gid...]]", 1444 " [-J jid[,jid...]] [-M core] [-N system]", 1445 " [-p pid[,pid...]] [-t tty[,tty...]] [-U user[,user...]]", 1446 " ps [-L]"); 1447 exit(1); 1448 } 1449