diff --git a/bin/ps/keyword.c b/bin/ps/keyword.c index 3c19912144ac..f05e5245f695 100644 --- a/bin/ps/keyword.c +++ b/bin/ps/keyword.c @@ -1,478 +1,483 @@ /*- * SPDX-License-Identifier: BSD-3-Clause * * Copyright (c) 1990, 1993, 1994 * The Regents of the University of California. All rights reserved. + * Copyright (c) 2025 The FreeBSD Foundation + * + * Portions of this software were developed by Olivier Certner + * at Kumacom SARL under sponsorship from the FreeBSD + * Foundation. * * 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. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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 #include #include #include #include #include #include #include #include #include #include #include #include #include "ps.h" static int vcmp(const void *, const void *); /* Compute offset in common structures. */ #define KOFF(x) offsetof(struct kinfo_proc, x) #define ROFF(x) offsetof(struct rusage, x) #define LWPFMT "d" #define NLWPFMT "d" #define UIDFMT "u" #define PIDFMT "d" /* PLEASE KEEP THE TABLE BELOW SORTED ALPHABETICALLY!!! */ static VAR keywords[] = { {"%cpu", {NULL}, "%CPU", "percent-cpu", 0, pcpu, 0, UNSPEC, NULL}, {"%mem", {NULL}, "%MEM", "percent-memory", 0, pmem, 0, UNSPEC, NULL}, {"acflag", {NULL}, "ACFLG", "accounting-flag", 0, kvar, KOFF(ki_acflag), USHORT, "x"}, {"acflg", {"acflag"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"args", {NULL}, "COMMAND", "arguments", COMM|LJUST|USER, arguments, 0, UNSPEC, NULL}, {"blocked", {"sigmask"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"caught", {"sigcatch"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"class", {NULL}, "CLASS", "login-class", LJUST, loginclass, 0, UNSPEC, NULL}, {"comm", {NULL}, "COMMAND", "command", LJUST, ucomm, 0, UNSPEC, NULL}, {"command", {NULL}, "COMMAND", "command", COMM|LJUST|USER, command, 0, UNSPEC, NULL}, {"cow", {NULL}, "COW", "copy-on-write-faults", 0, kvar, KOFF(ki_cow), UINT, "u"}, {"cpu", {NULL}, "C", "on-cpu", 0, cpunum, 0, UNSPEC, NULL}, {"cputime", {"time"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"dsiz", {NULL}, "DSIZ", "data-size", 0, kvar, KOFF(ki_dsize), PGTOK, "ld"}, {"egid", {"gid"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"egroup", {"group"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"emul", {NULL}, "EMUL", "emulation-envirnment", LJUST, emulname, 0, UNSPEC, NULL}, {"etime", {NULL}, "ELAPSED", "elapsed-time", USER, elapsed, 0, UNSPEC, NULL}, {"etimes", {NULL}, "ELAPSED", "elapsed-times", USER, elapseds, 0, UNSPEC, NULL}, {"euid", {"uid"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"f", {NULL}, "F", "flags", 0, kvar, KOFF(ki_flag), LONG, "lx"}, {"f2", {NULL}, "F2", "flags2", 0, kvar, KOFF(ki_flag2), INT, "08x"}, {"fib", {NULL}, "FIB", "fib", 0, kvar, KOFF(ki_fibnum), INT, "d"}, {"flags", {"f"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"flags2", {"f2"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"gid", {NULL}, "GID", "gid", 0, kvar, KOFF(ki_groups), UINT, UIDFMT}, {"group", {NULL}, "GROUP", "group", LJUST, egroupname, 0, UNSPEC, NULL}, {"ignored", {"sigignore"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"inblk", {NULL}, "INBLK", "read-blocks", USER, rvar, ROFF(ru_inblock), LONG, "ld"}, {"inblock", {"inblk"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"jail", {NULL}, "JAIL", "jail-name", LJUST, jailname, 0, UNSPEC, NULL}, {"jid", {NULL}, "JID", "jail-id", 0, kvar, KOFF(ki_jid), INT, "d"}, {"jobc", {NULL}, "JOBC", "job-control-count", 0, kvar, KOFF(ki_jobc), SHORT, "d"}, {"ktrace", {NULL}, "KTRACE", "ktrace", 0, kvar, KOFF(ki_traceflag), INT, "x"}, {"label", {NULL}, "LABEL", "label", LJUST, label, 0, UNSPEC, NULL}, {"lim", {NULL}, "LIM", "memory-limit", 0, maxrss, 0, UNSPEC, NULL}, {"lockname", {NULL}, "LOCK", "lock-name", LJUST, lockname, 0, UNSPEC, NULL}, {"login", {NULL}, "LOGIN", "login-name", LJUST, logname, 0, UNSPEC, NULL}, {"logname", {"login"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"lstart", {NULL}, "STARTED", "start-time", LJUST|USER, lstarted, 0, UNSPEC, NULL}, {"lwp", {NULL}, "LWP", "thread-id", 0, kvar, KOFF(ki_tid), UINT, LWPFMT}, {"majflt", {NULL}, "MAJFLT", "major-faults", USER, rvar, ROFF(ru_majflt), LONG, "ld"}, {"minflt", {NULL}, "MINFLT", "minor-faults", USER, rvar, ROFF(ru_minflt), LONG, "ld"}, {"msgrcv", {NULL}, "MSGRCV", "received-messages", USER, rvar, ROFF(ru_msgrcv), LONG, "ld"}, {"msgsnd", {NULL}, "MSGSND", "sent-messages", USER, rvar, ROFF(ru_msgsnd), LONG, "ld"}, {"mwchan", {NULL}, "MWCHAN", "wait-channel", LJUST, mwchan, 0, UNSPEC, NULL}, {"ni", {"nice"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"nice", {NULL}, "NI", "nice", 0, kvar, KOFF(ki_nice), CHAR, "d"}, {"nivcsw", {NULL}, "NIVCSW", "involuntary-context-switches", USER, rvar, ROFF(ru_nivcsw), LONG, "ld"}, {"nlwp", {NULL}, "NLWP", "threads", 0, kvar, KOFF(ki_numthreads), UINT, NLWPFMT}, {"nsignals", {"nsigs"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"nsigs", {NULL}, "NSIGS", "signals-taken", USER, rvar, ROFF(ru_nsignals), LONG, "ld"}, {"nswap", {NULL}, "NSWAP", "swaps", USER, rvar, ROFF(ru_nswap), LONG, "ld"}, {"nvcsw", {NULL}, "NVCSW", "voluntary-context-switches", USER, rvar, ROFF(ru_nvcsw), LONG, "ld"}, {"nwchan", {NULL}, "NWCHAN", "wait-channel-address", LJUST, nwchan, 0, UNSPEC, NULL}, {"oublk", {NULL}, "OUBLK", "written-blocks", USER, rvar, ROFF(ru_oublock), LONG, "ld"}, {"oublock", {"oublk"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"paddr", {NULL}, "PADDR", "process-address", 0, kvar, KOFF(ki_paddr), KPTR, "lx"}, {"pagein", {NULL}, "PAGEIN", "pageins", USER, pagein, 0, UNSPEC, NULL}, {"pcpu", {"%cpu"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"pending", {"sig"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"pgid", {NULL}, "PGID", "process-group", 0, kvar, KOFF(ki_pgid), UINT, PIDFMT}, {"pid", {NULL}, "PID", "pid", 0, kvar, KOFF(ki_pid), UINT, PIDFMT}, {"pmem", {"%mem"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"ppid", {NULL}, "PPID", "ppid", 0, kvar, KOFF(ki_ppid), UINT, PIDFMT}, {"pri", {NULL}, "PRI", "priority", 0, pri, 0, UNSPEC, NULL}, {"re", {NULL}, "RE", "residency-time", INF127, kvar, KOFF(ki_swtime), UINT, "d"}, {"rgid", {NULL}, "RGID", "real-gid", 0, kvar, KOFF(ki_rgid), UINT, UIDFMT}, {"rgroup", {NULL}, "RGROUP", "real-group", LJUST, rgroupname, 0, UNSPEC, NULL}, {"rss", {NULL}, "RSS", "rss", 0, kvar, KOFF(ki_rssize), PGTOK, "ld"}, {"rtprio", {NULL}, "RTPRIO", "realtime-priority", 0, priorityr, KOFF(ki_pri), UNSPEC, NULL}, {"ruid", {NULL}, "RUID", "real-uid", 0, kvar, KOFF(ki_ruid), UINT, UIDFMT}, {"ruser", {NULL}, "RUSER", "real-user", LJUST, runame, 0, UNSPEC, NULL}, {"sid", {NULL}, "SID", "sid", 0, kvar, KOFF(ki_sid), UINT, PIDFMT}, {"sig", {NULL}, "PENDING", "signals-pending", 0, kvar, KOFF(ki_siglist), INT, "x"}, {"sigcatch", {NULL}, "CAUGHT", "signals-caught", 0, kvar, KOFF(ki_sigcatch), UINT, "x"}, {"sigignore", {NULL}, "IGNORED", "signals-ignored", 0, kvar, KOFF(ki_sigignore), UINT, "x"}, {"sigmask", {NULL}, "BLOCKED", "signal-mask", 0, kvar, KOFF(ki_sigmask), UINT, "x"}, {"sl", {NULL}, "SL", "sleep-time", INF127, kvar, KOFF(ki_slptime), UINT, "d"}, {"ssiz", {NULL}, "SSIZ", "stack-size", 0, kvar, KOFF(ki_ssize), PGTOK, "ld"}, {"start", {NULL}, "STARTED", "start-time", LJUST|USER, started, 0, UNSPEC, NULL}, {"stat", {"state"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"state", {NULL}, "STAT", "state", LJUST, state, 0, UNSPEC, NULL}, {"svgid", {NULL}, "SVGID", "saved-gid", 0, kvar, KOFF(ki_svgid), UINT, UIDFMT}, {"svuid", {NULL}, "SVUID", "saved-uid", 0, kvar, KOFF(ki_svuid), UINT, UIDFMT}, {"systime", {NULL}, "SYSTIME", "system-time", USER, systime, 0, UNSPEC, NULL}, {"tdaddr", {NULL}, "TDADDR", "thread-address", 0, kvar, KOFF(ki_tdaddr), KPTR, "lx"}, {"tdev", {NULL}, "TDEV", "terminal-device", 0, tdev, 0, UNSPEC, NULL}, {"tdnam", {"tdname"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"tdname", {NULL}, "TDNAME", "thread-name", LJUST, tdnam, 0, UNSPEC, NULL}, {"tid", {"lwp"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"time", {NULL}, "TIME", "cpu-time", USER, cputime, 0, UNSPEC, NULL}, {"tpgid", {NULL}, "TPGID", "terminal-process-gid", 0, kvar, KOFF(ki_tpgid), UINT, PIDFMT}, {"tracer", {NULL}, "TRACER", "tracer", 0, kvar, KOFF(ki_tracer), UINT, PIDFMT}, {"tsid", {NULL}, "TSID", "terminal-sid", 0, kvar, KOFF(ki_tsid), UINT, PIDFMT}, {"tsiz", {NULL}, "TSIZ", "text-size", 0, kvar, KOFF(ki_tsize), PGTOK, "ld"}, {"tt", {NULL}, "TT ", "terminal-name", 0, tname, 0, UNSPEC, NULL}, {"tty", {NULL}, "TTY", "tty", LJUST, longtname, 0, UNSPEC, NULL}, {"ucomm", {NULL}, "UCOMM", "accounting-name", LJUST, ucomm, 0, UNSPEC, NULL}, {"uid", {NULL}, "UID", "uid", 0, kvar, KOFF(ki_uid), UINT, UIDFMT}, {"upr", {NULL}, "UPR", "user-priority", 0, upr, 0, UNSPEC, NULL}, {"uprocp", {NULL}, "UPROCP", "process-address", 0, kvar, KOFF(ki_paddr), KPTR, "lx"}, {"user", {NULL}, "USER", "user", LJUST, username, 0, UNSPEC, NULL}, {"usertime", {NULL}, "USERTIME", "user-time", USER, usertime, 0, UNSPEC, NULL}, {"usrpri", {"upr"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"vmaddr", {NULL}, "VMADDR", "vmspace-address", 0, kvar, KOFF(ki_vmspace), KPTR, "lx"}, {"vsize", {"vsz"}, NULL, NULL, 0, NULL, 0, UNSPEC, NULL}, {"vsz", {NULL}, "VSZ", "virtual-size", 0, vsize, 0, UNSPEC, NULL}, {"wchan", {NULL}, "WCHAN", "wait-channel", LJUST, wchan, 0, UNSPEC, NULL}, {"xstat", {NULL}, "XSTAT", "exit-status", 0, kvar, KOFF(ki_xstat), USHORT, "x"}, }; const size_t known_keywords_nb = nitems(keywords); size_t aliased_keyword_index(const VAR *const v) { const VAR *const fv = (v->flag & RESOLVED_ALIAS) == 0 ? v : v->final_kw; const size_t idx = fv - keywords; assert(idx < known_keywords_nb); return (idx); } /* * Sanity checks on declared keywords. * * Checks specific to aliases are done in resolve_alias() instead. * * Currently, only checks that keywords are alphabetically ordered by their * names. More checks could be added, such as the absence of type (UNSPEC), * 'fmt' (NULL) when the output routine is not kval()/rval(). * * Called from main() on PS_CHECK_KEYWORDS, else available when debugging. */ void check_keywords(void) { const VAR *k, *next_k; bool order_violated = false; k = &keywords[0]; for (size_t i = 1; i < known_keywords_nb; ++i) { next_k = &keywords[i]; if (vcmp(k, next_k) >= 0) { xo_warnx("keywords bad order: '%s' followed by '%s'", k->name, next_k->name); order_violated = true; } k = next_k; } if (order_violated) /* Must be the case as we rely on bsearch() + vcmp(). */ xo_errx(2, "keywords are not in ascending order " "(internal error)"); } static void alias_errx(const char *const name, const char *const what) { xo_errx(2, "alias keyword '%s' specifies %s (internal error)", name, what); } static void merge_alias(VAR *const k, VAR *const tgt) { if ((tgt->flag & RESOLVED_ALIAS) != 0) k->final_kw = tgt->final_kw; else { k->final_kw = tgt; assert(tgt->aliased == NULL); } #define MERGE_IF_SENTINEL(field, sentinel) do { \ if (k->field == sentinel) \ k->field = tgt->field; \ } while (0) MERGE_IF_SENTINEL(header, NULL); MERGE_IF_SENTINEL(field, NULL); /* If NOINHERIT is present, no merge occurs. */ MERGE_IF_SENTINEL(flag, 0); #undef MERGE_IF_SENTINEL /* We also check that aliases don't specify things they should not. */ #define MERGE_CHECK_SENTINEL(field, sentinel, field_descr) do { \ if (k->field != sentinel) \ alias_errx(k->name, field_descr); \ k->field = tgt->field; \ } while (0); MERGE_CHECK_SENTINEL(oproc, NULL, "an output routine"); MERGE_CHECK_SENTINEL(off, 0, "a structure offset"); MERGE_CHECK_SENTINEL(type, UNSPEC, "a different type than UNSPEC"); MERGE_CHECK_SENTINEL(fmt, NULL, "a printf format"); #undef MERGE_CHECK_SENTINEL } static void resolve_alias(VAR *const k) { VAR *t, key; if ((k->flag & RESOLVED_ALIAS) != 0 || k->aliased == NULL) return; if ((k->flag & RESOLVING_ALIAS) != 0) xo_errx(2, "cycle when resolving alias keyword '%s'", k->name); k->flag |= RESOLVING_ALIAS; key.name = k->aliased; t = bsearch(&key, keywords, known_keywords_nb, sizeof(VAR), vcmp); if (t == NULL) xo_errx(2, "unknown target '%s' for keyword alias '%s'", k->aliased, k->name); resolve_alias(t); merge_alias(k, t); k->flag &= ~RESOLVING_ALIAS; k->flag |= RESOLVED_ALIAS; } /* * Resolve all aliases immediately. * * Called from main() on PS_CHECK_KEYWORDS, else available when debugging. */ void resolve_aliases(void) { for (size_t i = 0; i < known_keywords_nb; ++i) resolve_alias(&keywords[i]); } void showkey(void) { const VAR *v; const VAR *const end = keywords + known_keywords_nb; const char *sep; int i; i = 0; sep = ""; xo_open_list("key"); for (v = keywords; v < end; ++v) { const char *const p = v->name; const int len = strlen(p); if (termwidth && (i += len + 1) > termwidth) { i = len; sep = "\n"; } xo_emit("{P:/%hs}{l:key/%hs}", sep, p); sep = " "; } xo_emit("\n"); xo_close_list("key"); if (xo_finish() < 0) xo_err(1, "stdout"); } void parsefmt(const char *p, struct velisthead *const var_list, const int user) { char *copy, *cp; char *hdr_p, sep; size_t sep_idx; VAR *v, key; struct varent *vent; cp = copy = strdup(p); if (copy == NULL) xo_err(1, "strdup"); sep = cp[0]; /* We only care if it's 0 or not here. */ sep_idx = -1; while (sep != '\0') { cp += sep_idx + 1; /* * If an item contains an equals sign, it specifies a column * header, may contain embedded separator characters and * is always the last item. */ sep_idx = strcspn(cp, "= \t,\n"); sep = cp[sep_idx]; cp[sep_idx] = 0; if (sep == '=') { hdr_p = cp + sep_idx + 1; sep = '\0'; /* No more keywords. */ } else hdr_p = NULL; /* At this point, '*cp' is '\0' iff 'sep_idx' is 0. */ if (*cp == '\0') { /* * Empty keyword. Skip it, and silently unless some * header has been specified. */ if (hdr_p != NULL) xo_warnx("empty keyword with header '%s'", hdr_p); continue; } /* Find the keyword. */ key.name = cp; v = bsearch(&key, keywords, known_keywords_nb, sizeof(VAR), vcmp); if (v == NULL) { xo_warnx("%s: keyword not found", cp); eval = 1; continue; } #ifndef PS_CHECK_KEYWORDS /* * On PS_CHECK_KEYWORDS, this is not necessary as all aliases * are resolved at startup in main() by calling * resolve_aliases(). */ resolve_alias(v); #endif if ((vent = malloc(sizeof(struct varent))) == NULL) xo_errx(1, "malloc failed"); vent->header = v->header; if (hdr_p) { hdr_p = strdup(hdr_p); if (hdr_p) vent->header = hdr_p; } vent->width = strlen(vent->header); vent->var = v; vent->flags = user ? VE_KEEP : 0; STAILQ_INSERT_TAIL(var_list, vent, next_ve); } free(copy); if (STAILQ_EMPTY(var_list)) { xo_warnx("no valid keywords; valid keywords:"); showkey(); exit(1); } } static int vcmp(const void *a, const void *b) { return (strcmp(((const VAR *)a)->name, ((const VAR *)b)->name)); } diff --git a/bin/ps/ps.c b/bin/ps/ps.c index a75ea512ad54..bb5102729957 100644 --- a/bin/ps/ps.c +++ b/bin/ps/ps.c @@ -1,1543 +1,1548 @@ /*- * SPDX-License-Identifier: BSD-3-Clause * * Copyright (c) 1990, 1993, 1994 * The Regents of the University of California. All rights reserved. + * Copyright (c) 2025 The FreeBSD Foundation + * + * Portions of this software were developed by Olivier Certner + * at Kumacom SARL under sponsorship from the FreeBSD + * Foundation. * * 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. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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. * ------+---------+---------+-------- + --------+---------+---------+---------* * Copyright (c) 2004 - Garance Alistair Drosehn . * All rights reserved. * * Significant modifications made to bring `ps' options somewhat closer * to the standard for `ps' as described in SingleUnixSpec-v3. * ------+---------+---------+-------- + --------+---------+---------+---------* */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "ps.h" #define _PATH_PTS "/dev/pts/" #define W_SEP " \t" /* "Whitespace" list separators */ #define T_SEP "," /* "Terminate-element" list separators */ /* * isdigit takes an `int', but expects values in the range of unsigned char. * This wrapper ensures that values from a 'char' end up in the correct range. */ #define isdigitch(Anychar) isdigit((u_char)(Anychar)) int cflag; /* -c */ int eval; /* Exit value */ time_t now; /* Current time(3) value */ int rawcpu; /* -C */ int sumrusage; /* -S */ int termwidth; /* Width of the screen (0 == infinity). */ int showthreads; /* will threads be shown? */ struct keyword_info { /* * Whether there is (at least) one column referencing this keyword that * must be kept. */ #define KWI_HAS_MUST_KEEP_COLUMN (1 << 0) /* * Whether a column with such a keyword has been seen. */ #define KWI_SEEN (1 << 1) u_int flags; }; struct velisthead varlist = STAILQ_HEAD_INITIALIZER(varlist); static struct velisthead Ovarlist = STAILQ_HEAD_INITIALIZER(Ovarlist); static kvm_t *kd; static int needcomm; /* -o "command" */ static int needenv; /* -e */ static int needuser; /* -o "user" */ static int optfatal; /* Fatal error parsing some list-option. */ static int pid_max; /* kern.pid_max */ static enum sort { DEFAULT, SORTMEM, SORTCPU } sortby = DEFAULT; struct listinfo; typedef int addelem_rtn(struct listinfo *_inf, const char *_elem); struct listinfo { int count; int maxcount; int elemsize; addelem_rtn *addelem; const char *lname; union { gid_t *gids; int *jids; pid_t *pids; dev_t *ttys; uid_t *uids; void *ptr; } l; }; static int addelem_gid(struct listinfo *, const char *); static int addelem_jid(struct listinfo *, const char *); static int addelem_pid(struct listinfo *, const char *); static int addelem_tty(struct listinfo *, const char *); static int addelem_uid(struct listinfo *, const char *); static void add_list(struct listinfo *, const char *); static void descendant_sort(KINFO *, int); static void format_output(KINFO *); static void *expand_list(struct listinfo *); static const char * fmt(char **(*)(kvm_t *, const struct kinfo_proc *, int), KINFO *, char *, char *, int); static void free_list(struct listinfo *); static void init_list(struct listinfo *, addelem_rtn, int, const char *); static char *kludge_oldps_options(const char *, char *, const char *); static int pscomp(const void *, const void *); static void saveuser(KINFO *); static void scan_vars(struct keyword_info *); static void remove_redundant_columns(struct keyword_info *); static void pidmax_init(void); static void usage(void); static const char dfmt[] = "pid,tt,state,time,command"; static const char jfmt[] = "user,pid,ppid,pgid,sid,jobc,state,tt,time,command"; static const char lfmt[] = "uid,pid,ppid,cpu,pri,nice,vsz,rss,mwchan,state," "tt,time,command"; static const char ufmt[] = "user,pid,%cpu,%mem,vsz,rss,tt,state,start,time,command"; static const char vfmt[] = "pid,state,time,sl,re,pagein,vsz,rss,lim,tsiz," "%cpu,%mem,command"; static const char Zfmt[] = "label"; #define PS_ARGS "AaCcD:defG:gHhjJ:LlM:mN:O:o:p:rSTt:U:uvwXxZ" int main(int argc, char *argv[]) { struct listinfo gidlist, jidlist, pgrplist, pidlist; struct listinfo ruidlist, sesslist, ttylist, uidlist; struct kinfo_proc *kp; KINFO *kinfo = NULL, *next_KINFO; KINFO_STR *ks; struct varent *vent; struct winsize ws = { .ws_row = 0 }; const char *nlistf, *memf, *str; char *cols; int all, ch, elem, flag, _fmt, i, lineno, linelen, left; int descendancy, nentries, nkept, nselectors; int prtheader, wflag, what, xkeep, xkeep_implied; int fwidthmin, fwidthmax; char errbuf[_POSIX2_LINE_MAX]; char fmtbuf[_POSIX2_LINE_MAX]; enum { NONE = 0, UP = 1, DOWN = 2, BOTH = 1 | 2 } directions = NONE; struct { int traversed; int initial; } pid_count; struct keyword_info *keywords_info; (void) setlocale(LC_ALL, ""); time(&now); /* Used by routines in print.c. */ /* * Compute default output line length before processing options. * If COLUMNS is set, use it. Otherwise, if this is part of an * interactive job (i.e. one associated with a terminal), use * the terminal width. "Interactive" is determined by whether * any of stdout, stderr, or stdin is a terminal. The intent * is that "ps", "ps | more", and "ps | grep" all use the same * default line length unless -w is specified. * * If not interactive, the default length was traditionally 79. * It has been changed to unlimited. This is mostly for the * benefit of non-interactive scripts, which arguably should * use -ww, but is compatible with Linux. */ if ((cols = getenv("COLUMNS")) != NULL && *cols != '\0') termwidth = atoi(cols); else if ((ioctl(STDOUT_FILENO, TIOCGWINSZ, (char *)&ws) == -1 && ioctl(STDERR_FILENO, TIOCGWINSZ, (char *)&ws) == -1 && ioctl(STDIN_FILENO, TIOCGWINSZ, (char *)&ws) == -1) || ws.ws_col == 0) termwidth = UNLIMITED; else termwidth = ws.ws_col - 1; /* * Hide a number of option-processing kludges in a separate routine, * to support some historical BSD behaviors, such as `ps axu'. */ if (argc > 1) argv[1] = kludge_oldps_options(PS_ARGS, argv[1], argv[2]); pidmax_init(); #ifdef PS_CHECK_KEYWORDS /* Check for obvious problems in the keywords array. */ check_keywords(); /* Resolve all aliases at start to spot errors. */ resolve_aliases(); #endif all = descendancy = _fmt = nselectors = optfatal = 0; prtheader = showthreads = wflag = xkeep_implied = 0; xkeep = -1; /* Neither -x nor -X. */ init_list(&gidlist, addelem_gid, sizeof(gid_t), "group"); init_list(&jidlist, addelem_jid, sizeof(int), "jail id"); init_list(&pgrplist, addelem_pid, sizeof(pid_t), "process group"); init_list(&pidlist, addelem_pid, sizeof(pid_t), "process id"); init_list(&ruidlist, addelem_uid, sizeof(uid_t), "ruser"); init_list(&sesslist, addelem_pid, sizeof(pid_t), "session id"); init_list(&ttylist, addelem_tty, sizeof(dev_t), "tty"); init_list(&uidlist, addelem_uid, sizeof(uid_t), "user"); memf = _PATH_DEVNULL; nlistf = NULL; argc = xo_parse_args(argc, argv); if (argc < 0) exit(1); while ((ch = getopt(argc, argv, PS_ARGS)) != -1) switch (ch) { case 'A': all = xkeep = 1; break; case 'a': all = 1; break; case 'C': rawcpu = 1; break; case 'c': cflag = 1; break; case 'D': { size_t len = strlen(optarg); if (len <= 2 && strncasecmp(optarg, "up", len) == 0) directions |= UP; else if (len <= 4 && strncasecmp(optarg, "down", len) == 0) directions |= DOWN; else if (len <= 4 && strncasecmp(optarg, "both", len) == 0) directions |= BOTH; else usage(); break; } case 'd': descendancy = 1; break; case 'e': /* XXX set ufmt */ needenv = 1; break; case 'f': /* compat */ break; case 'G': add_list(&gidlist, optarg); xkeep_implied = 1; nselectors++; break; case 'g': #if 0 /* * XXX - This behavior is still under debate since it * conflicts with the (undocumented) `-g' option * and is non-standard. However, it is the * behavior of most UNIX systems except * SunOS/Solaris/illumos (see next comment; see * also comment for '-s' below). */ add_list(&pgrplist, optarg); xkeep_implied = 1; nselectors++; break; #else /* * The historical BSD-ish (from SunOS) behavior: Also * display process group leaders (but we do not filter * them out). */ break; /* no-op */ #endif case 'H': showthreads = KERN_PROC_INC_THREAD; break; case 'h': prtheader = ws.ws_row > 5 ? ws.ws_row : 22; break; case 'J': add_list(&jidlist, optarg); xkeep_implied = 1; nselectors++; break; case 'j': parsefmt(jfmt, &varlist, 0); _fmt = 1; break; case 'L': showkey(); exit(0); case 'l': parsefmt(lfmt, &varlist, 0); _fmt = 1; break; case 'M': memf = optarg; break; case 'm': sortby = SORTMEM; break; case 'N': nlistf = optarg; break; case 'O': parsefmt(optarg, &Ovarlist, 1); break; case 'o': parsefmt(optarg, &varlist, 1); _fmt = 1; break; case 'p': add_list(&pidlist, optarg); /* * Note: `-p' does not *set* xkeep, but any values * from pidlist are checked before xkeep is. That * way they are always matched, even if the user * specifies `-X'. */ nselectors++; break; case 'r': sortby = SORTCPU; break; case 'S': sumrusage = 1; break; #if 0 case 's': /* * XXX - This non-standard option is still under debate. * It is supported on Solaris, Linux, IRIX, and * OpenBSD but conflicts with '-s' on NetBSD. This * is the same functionality as POSIX option '-g', * but the cited systems do not provide it under * '-g', only under '-s'. */ add_list(&sesslist, optarg); xkeep_implied = 1; nselectors++; break; #endif case 'T': if ((optarg = ttyname(STDIN_FILENO)) == NULL) xo_errx(1, "stdin: not a terminal"); /* FALLTHROUGH */ case 't': add_list(&ttylist, optarg); xkeep_implied = 1; nselectors++; break; case 'U': add_list(&ruidlist, optarg); xkeep_implied = 1; nselectors++; break; case 'u': #if 0 /* * POSIX's '-u' behavior. * * This has not been activated because: * 1. Option '-U' is a substitute for most users, and * those that care seem more likely to want to match * on the real user ID to display all processes * launched by some users. * 2. '-u' has been a canned display on the BSDs for * a very long time (POLA). */ add_list(&uidlist, optarg); xkeep_implied = 1; nselectors++; break; #else /* Historical BSD's '-u'. */ parsefmt(ufmt, &varlist, 0); sortby = SORTCPU; _fmt = 1; break; #endif case 'v': parsefmt(vfmt, &varlist, 0); sortby = SORTMEM; _fmt = 1; break; case 'w': if (wflag) termwidth = UNLIMITED; else if (termwidth < 131 && termwidth != UNLIMITED) termwidth = 131; wflag++; break; case 'X': /* * Note that `-X' and `-x' are not standard "selector" * options. For most selector-options, we check *all* * processes to see if any are matched by the given * value(s). After we have a set of all the matched * processes, then `-X' and `-x' govern whether we * modify that *matched* set for processes which do * not have a controlling terminal. `-X' causes * those processes to be deleted from the matched * set, while `-x' causes them to be kept. */ xkeep = 0; break; case 'x': xkeep = 1; break; case 'Z': parsefmt(Zfmt, &varlist, 0); break; case '?': default: usage(); } argc -= optind; argv += optind; /* * If there arguments after processing all the options, attempt * to treat them as a list of process ids. */ while (*argv) { if (!isdigitch(**argv)) break; add_list(&pidlist, *argv); argv++; } if (*argv) { xo_warnx("illegal argument: %s\n", *argv); usage(); } if (optfatal) exit(1); /* Error messages already printed. */ if (xkeep < 0) /* Neither -X nor -x was specified. */ xkeep = xkeep_implied; kd = kvm_openfiles(nlistf, memf, NULL, O_RDONLY, errbuf); if (kd == NULL) xo_errx(1, "%s", errbuf); if (!_fmt) parsefmt(dfmt, &varlist, 0); if (!STAILQ_EMPTY(&Ovarlist)) { VARENT *const pid_entry = find_varentry("pid"); /* * We insert the keywords passed by '-O' after the process ID if * specified, else at start. */ if (pid_entry != NULL) { struct velisthead rest; STAILQ_SPLIT_AFTER(&varlist, pid_entry, &rest, next_ve); STAILQ_CONCAT(&varlist, &Ovarlist); STAILQ_CONCAT(&varlist, &rest); } else { STAILQ_SWAP(&varlist, &Ovarlist, varent); STAILQ_CONCAT(&varlist, &Ovarlist); } } keywords_info = calloc(known_keywords_nb, sizeof(struct keyword_info)); if (keywords_info == NULL) xo_errx(1, "malloc failed"); /* * Scan requested variables, noting which structures are needed and * which keywords are specified. */ scan_vars(keywords_info); /* * Remove redundant columns from "canned" displays (see the callee's * herald comment for more details). */ remove_redundant_columns(keywords_info); free(keywords_info); keywords_info = NULL; if (all) /* * We have to display all processes, regardless of other * options. */ nselectors = 0; else if (nselectors == 0) { /* * Default is to request our processes only. As per POSIX, we * match processes by their effective user IDs and we use our * effective user ID as our own identity. */ expand_list(&uidlist); uidlist.l.uids[uidlist.count++] = geteuid(); nselectors = 1; } /* * Get process list. If the user requested just one selector- * option, then kvm_getprocs can be asked to return just those * processes. Otherwise, have it return all processes, and * then this routine will search that full list and select the * processes which match any of the user's selector-options. */ what = showthreads != 0 ? KERN_PROC_ALL : KERN_PROC_PROC; flag = 0; if (nselectors == 1) { if (gidlist.count == 1) { what = KERN_PROC_RGID | showthreads; flag = *gidlist.l.gids; nselectors = 0; } else if (pgrplist.count == 1) { what = KERN_PROC_PGRP | showthreads; flag = *pgrplist.l.pids; nselectors = 0; } else if (pidlist.count == 1 && directions == NONE) { what = KERN_PROC_PID | showthreads; flag = *pidlist.l.pids; nselectors = 0; } else if (ruidlist.count == 1) { what = KERN_PROC_RUID | showthreads; flag = *ruidlist.l.uids; nselectors = 0; } else if (sesslist.count == 1) { what = KERN_PROC_SESSION | showthreads; flag = *sesslist.l.pids; nselectors = 0; } else if (ttylist.count == 1) { what = KERN_PROC_TTY | showthreads; flag = *ttylist.l.ttys; nselectors = 0; } else if (uidlist.count == 1) { what = KERN_PROC_UID | showthreads; flag = *uidlist.l.uids; nselectors = 0; } } /* * select procs */ nentries = -1; kp = kvm_getprocs(kd, what, flag, &nentries); /* * Ignore ESRCH to preserve behaviour of "ps -p nonexistent-pid" * not reporting an error. */ if ((kp == NULL && errno != ESRCH) || (kp != NULL && nentries < 0)) xo_errx(1, "%s", kvm_geterr(kd)); nkept = 0; pid_count.initial = pidlist.count; if (directions & DOWN) for (elem = 0; elem < pidlist.count; elem++) for (i = 0; i < nentries; i++) { if (kp[i].ki_ppid == kp[i].ki_pid) continue; if (kp[i].ki_ppid == pidlist.l.pids[elem]) { if (pidlist.count >= pidlist.maxcount) expand_list(&pidlist); pidlist.l.pids[pidlist.count++] = kp[i].ki_pid; } } pid_count.traversed = pidlist.count; if (directions & UP) for (elem = 0; elem < pidlist.count; elem++) { if (elem >= pid_count.initial && elem < pid_count.traversed) continue; for (i = 0; i < nentries; i++) { if (kp[i].ki_ppid == kp[i].ki_pid) continue; if (kp[i].ki_pid == pidlist.l.pids[elem]) { if (pidlist.count >= pidlist.maxcount) expand_list(&pidlist); pidlist.l.pids[pidlist.count++] = kp[i].ki_ppid; } } } if (nentries > 0) { if ((kinfo = malloc(nentries * sizeof(*kinfo))) == NULL) xo_errx(1, "malloc failed"); for (i = nentries; --i >= 0; ++kp) { /* * If the user specified multiple selection-criteria, * then keep any process matched by the inclusive OR * of all the selection-criteria given. */ if (pidlist.count > 0) { for (elem = 0; elem < pidlist.count; elem++) if (kp->ki_pid == pidlist.l.pids[elem]) goto keepit; } /* * Note that we had to process pidlist before * filtering out processes which do not have * a controlling terminal. */ if (xkeep == 0) { if ((kp->ki_tdev == NODEV || (kp->ki_flag & P_CONTROLT) == 0)) continue; } if (nselectors == 0) goto keepit; if (gidlist.count > 0) { for (elem = 0; elem < gidlist.count; elem++) if (kp->ki_rgid == gidlist.l.gids[elem]) goto keepit; } if (jidlist.count > 0) { for (elem = 0; elem < jidlist.count; elem++) if (kp->ki_jid == jidlist.l.jids[elem]) goto keepit; } if (pgrplist.count > 0) { for (elem = 0; elem < pgrplist.count; elem++) if (kp->ki_pgid == pgrplist.l.pids[elem]) goto keepit; } if (ruidlist.count > 0) { for (elem = 0; elem < ruidlist.count; elem++) if (kp->ki_ruid == ruidlist.l.uids[elem]) goto keepit; } if (sesslist.count > 0) { for (elem = 0; elem < sesslist.count; elem++) if (kp->ki_sid == sesslist.l.pids[elem]) goto keepit; } if (ttylist.count > 0) { for (elem = 0; elem < ttylist.count; elem++) if (kp->ki_tdev == ttylist.l.ttys[elem]) goto keepit; } if (uidlist.count > 0) { for (elem = 0; elem < uidlist.count; elem++) if (kp->ki_uid == uidlist.l.uids[elem]) goto keepit; } /* * This process did not match any of the user's * selector-options, so skip the process. */ continue; keepit: next_KINFO = &kinfo[nkept]; next_KINFO->ki_p = kp; next_KINFO->ki_d.level = 0; next_KINFO->ki_d.prefix = NULL; next_KINFO->ki_pcpu = getpcpu(next_KINFO); if (sortby == SORTMEM) next_KINFO->ki_memsize = kp->ki_tsize + kp->ki_dsize + kp->ki_ssize; if (needuser) saveuser(next_KINFO); nkept++; } } if (nkept == 0) { printheader(); if (xo_finish() < 0) xo_err(1, "stdout"); exit(1); } /* * sort proc list */ qsort(kinfo, nkept, sizeof(KINFO), pscomp); /* * We want things in descendant order */ if (descendancy) descendant_sort(kinfo, nkept); /* * Prepare formatted output. */ for (i = 0; i < nkept; i++) format_output(&kinfo[i]); /* * Print header. */ xo_open_container("process-information"); printheader(); if (xo_get_style(NULL) != XO_STYLE_TEXT) termwidth = UNLIMITED; /* * Output formatted lines. */ xo_open_list("process"); for (i = lineno = 0; i < nkept; i++) { linelen = 0; xo_open_instance("process"); STAILQ_FOREACH(vent, &varlist, next_ve) { ks = STAILQ_FIRST(&kinfo[i].ki_ks); STAILQ_REMOVE_HEAD(&kinfo[i].ki_ks, ks_next); /* Truncate rightmost column if necessary. */ fwidthmax = _POSIX2_LINE_MAX; if (STAILQ_NEXT(vent, next_ve) == NULL && termwidth != UNLIMITED && ks->ks_str != NULL) { left = termwidth - linelen; if (left > 0 && left < (int)strlen(ks->ks_str)) fwidthmax = left; } str = ks->ks_str; if (str == NULL) str = "-"; /* No padding for the last column, if it's LJUST. */ fwidthmin = (xo_get_style(NULL) != XO_STYLE_TEXT || (STAILQ_NEXT(vent, next_ve) == NULL && (vent->var->flag & LJUST))) ? 0 : vent->width; snprintf(fmtbuf, sizeof(fmtbuf), "{:%s/%%%s%d..%dhs}", vent->var->field ? vent->var->field : vent->var->name, (vent->var->flag & LJUST) ? "-" : "", fwidthmin, fwidthmax); xo_emit(fmtbuf, str); linelen += fwidthmin; if (ks->ks_str != NULL) { free(ks->ks_str); ks->ks_str = NULL; } free(ks); ks = NULL; if (STAILQ_NEXT(vent, next_ve) != NULL) { xo_emit("{P: }"); linelen++; } } xo_emit("\n"); xo_close_instance("process"); if (prtheader && lineno++ == prtheader - 4) { xo_emit("\n"); printheader(); lineno = 0; } } xo_close_list("process"); xo_close_container("process-information"); if (xo_finish() < 0) xo_err(1, "stdout"); free_list(&gidlist); free_list(&jidlist); free_list(&pidlist); free_list(&pgrplist); free_list(&ruidlist); free_list(&sesslist); free_list(&ttylist); free_list(&uidlist); for (i = 0; i < nkept; i++) free(kinfo[i].ki_d.prefix); free(kinfo); exit(eval); } static int addelem_gid(struct listinfo *inf, const char *elem) { struct group *grp; const char *nameorID; char *endp; u_long bigtemp; if (*elem == '\0' || strlen(elem) >= MAXLOGNAME) { if (*elem == '\0') xo_warnx("Invalid (zero-length) %s name", inf->lname); else xo_warnx("%s name too long: %s", inf->lname, elem); optfatal = 1; return (0); /* Do not add this value. */ } /* * SUSv3 states that `ps -G grouplist' should match "real-group * ID numbers", and does not mention group-names. I do want to * also support group-names, so this tries for a group-id first, * and only tries for a name if that doesn't work. This is the * opposite order of what is done in addelem_uid(), but in * practice the order would only matter for group-names which * are all-numeric. */ grp = NULL; nameorID = "named"; errno = 0; bigtemp = strtoul(elem, &endp, 10); if (errno == 0 && *endp == '\0' && bigtemp <= GID_MAX) { nameorID = "name or ID matches"; grp = getgrgid((gid_t)bigtemp); } if (grp == NULL) grp = getgrnam(elem); if (grp == NULL) { xo_warnx("No %s %s '%s'", inf->lname, nameorID, elem); optfatal = 1; return (0); } if (inf->count >= inf->maxcount) expand_list(inf); inf->l.gids[(inf->count)++] = grp->gr_gid; return (1); } static int addelem_jid(struct listinfo *inf, const char *elem) { int tempid; if (*elem == '\0') { xo_warnx("Invalid (zero-length) jail id"); optfatal = 1; return (0); /* Do not add this value. */ } tempid = jail_getid(elem); if (tempid < 0) { xo_warnx("Invalid %s: %s", inf->lname, elem); optfatal = 1; return (0); } if (inf->count >= inf->maxcount) expand_list(inf); inf->l.jids[(inf->count)++] = tempid; return (1); } static int addelem_pid(struct listinfo *inf, const char *elem) { char *endp; long tempid; if (*elem == '\0') { xo_warnx("Invalid (zero-length) process id"); optfatal = 1; return (0); /* Do not add this value. */ } errno = 0; tempid = strtol(elem, &endp, 10); if (*endp != '\0' || tempid < 0 || elem == endp) { xo_warnx("Invalid %s: %s", inf->lname, elem); errno = ERANGE; } else if (errno != 0 || tempid > pid_max) { xo_warnx("%s too large: %s", inf->lname, elem); errno = ERANGE; } if (errno == ERANGE) { optfatal = 1; return (0); } if (inf->count >= inf->maxcount) expand_list(inf); inf->l.pids[(inf->count)++] = tempid; return (1); } /* * The user can specify a device via one of three formats: * 1) fully qualified, e.g.: /dev/ttyp0 /dev/console /dev/pts/0 * 2) missing "/dev", e.g.: ttyp0 console pts/0 * 3) two-letters, e.g.: p0 co 0 * (matching letters that would be seen in the "TT" column) */ static int addelem_tty(struct listinfo *inf, const char *elem) { const char *ttypath; struct stat sb; char pathbuf[PATH_MAX], pathbuf2[PATH_MAX], pathbuf3[PATH_MAX]; ttypath = NULL; pathbuf2[0] = '\0'; pathbuf3[0] = '\0'; switch (*elem) { case '/': ttypath = elem; break; case 'c': if (strcmp(elem, "co") == 0) { ttypath = _PATH_CONSOLE; break; } /* FALLTHROUGH */ default: strlcpy(pathbuf, _PATH_DEV, sizeof(pathbuf)); strlcat(pathbuf, elem, sizeof(pathbuf)); ttypath = pathbuf; if (strncmp(pathbuf, _PATH_TTY, strlen(_PATH_TTY)) == 0) break; if (strncmp(pathbuf, _PATH_PTS, strlen(_PATH_PTS)) == 0) break; if (strcmp(pathbuf, _PATH_CONSOLE) == 0) break; /* Check to see if /dev/tty${elem} exists */ strlcpy(pathbuf2, _PATH_TTY, sizeof(pathbuf2)); strlcat(pathbuf2, elem, sizeof(pathbuf2)); if (stat(pathbuf2, &sb) == 0 && S_ISCHR(sb.st_mode)) { /* No need to repeat stat() && S_ISCHR() checks */ ttypath = NULL; break; } /* Check to see if /dev/pts/${elem} exists */ strlcpy(pathbuf3, _PATH_PTS, sizeof(pathbuf3)); strlcat(pathbuf3, elem, sizeof(pathbuf3)); if (stat(pathbuf3, &sb) == 0 && S_ISCHR(sb.st_mode)) { /* No need to repeat stat() && S_ISCHR() checks */ ttypath = NULL; break; } break; } if (ttypath) { if (stat(ttypath, &sb) == -1) { if (pathbuf3[0] != '\0') xo_warn("%s, %s, and %s", pathbuf3, pathbuf2, ttypath); else xo_warn("%s", ttypath); optfatal = 1; return (0); } if (!S_ISCHR(sb.st_mode)) { if (pathbuf3[0] != '\0') xo_warnx("%s, %s, and %s: Not a terminal", pathbuf3, pathbuf2, ttypath); else xo_warnx("%s: Not a terminal", ttypath); optfatal = 1; return (0); } } if (inf->count >= inf->maxcount) expand_list(inf); inf->l.ttys[(inf->count)++] = sb.st_rdev; return (1); } static int addelem_uid(struct listinfo *inf, const char *elem) { struct passwd *pwd; char *endp; u_long bigtemp; if (*elem == '\0' || strlen(elem) >= MAXLOGNAME) { if (*elem == '\0') xo_warnx("Invalid (zero-length) %s name", inf->lname); else xo_warnx("%s name too long: %s", inf->lname, elem); optfatal = 1; return (0); /* Do not add this value. */ } pwd = getpwnam(elem); if (pwd == NULL) { errno = 0; bigtemp = strtoul(elem, &endp, 10); if (errno != 0 || *endp != '\0' || bigtemp > UID_MAX) xo_warnx("No %s named '%s'", inf->lname, elem); else { /* The string is all digits, so it might be a userID. */ pwd = getpwuid((uid_t)bigtemp); if (pwd == NULL) xo_warnx("No %s name or ID matches '%s'", inf->lname, elem); } } if (pwd == NULL) { /* * These used to be treated as minor warnings (and the * option was simply ignored), but now they are fatal * errors (and the command will be aborted). */ optfatal = 1; return (0); } if (inf->count >= inf->maxcount) expand_list(inf); inf->l.uids[(inf->count)++] = pwd->pw_uid; return (1); } static void add_list(struct listinfo *inf, const char *argp) { const char *savep; char *cp, *endp; int toolong; char elemcopy[PATH_MAX]; if (*argp == '\0') inf->addelem(inf, argp); while (*argp != '\0') { while (*argp != '\0' && strchr(W_SEP, *argp) != NULL) argp++; savep = argp; toolong = 0; cp = elemcopy; if (strchr(T_SEP, *argp) == NULL) { endp = elemcopy + sizeof(elemcopy) - 1; while (*argp != '\0' && cp <= endp && strchr(W_SEP T_SEP, *argp) == NULL) *cp++ = *argp++; if (cp > endp) toolong = 1; } if (!toolong) { *cp = '\0'; /* * Add this single element to the given list. */ inf->addelem(inf, elemcopy); } else { /* * The string is too long to copy. Find the end * of the string to print out the warning message. */ while (*argp != '\0' && strchr(W_SEP T_SEP, *argp) == NULL) argp++; xo_warnx("Value too long: %.*s", (int)(argp - savep), savep); optfatal = 1; } /* * Skip over any number of trailing whitespace characters, * but only one (at most) trailing element-terminating * character. */ while (*argp != '\0' && strchr(W_SEP, *argp) != NULL) argp++; if (*argp != '\0' && strchr(T_SEP, *argp) != NULL) { argp++; /* Catch case where string ended with a comma. */ if (*argp == '\0') inf->addelem(inf, argp); } } } static void descendant_sort(KINFO *ki, int items) { int dst, lvl, maxlvl, n, ndst, nsrc, siblings, src; unsigned char *path; KINFO kn; /* * First, sort the entries by descendancy, tracking the descendancy * depth in the ki_d.level field. */ src = 0; maxlvl = 0; while (src < items) { if (ki[src].ki_d.level) { src++; continue; } for (nsrc = 1; src + nsrc < items; nsrc++) if (!ki[src + nsrc].ki_d.level) break; for (dst = 0; dst < items; dst++) { if (ki[dst].ki_p->ki_pid == ki[src].ki_p->ki_pid) continue; if (ki[dst].ki_p->ki_pid == ki[src].ki_p->ki_ppid) break; } if (dst == items) { src += nsrc; continue; } for (ndst = 1; dst + ndst < items; ndst++) if (ki[dst + ndst].ki_d.level <= ki[dst].ki_d.level) break; for (n = src; n < src + nsrc; n++) { ki[n].ki_d.level += ki[dst].ki_d.level + 1; if (maxlvl < ki[n].ki_d.level) maxlvl = ki[n].ki_d.level; } while (nsrc) { if (src < dst) { kn = ki[src]; memmove(ki + src, ki + src + 1, (dst - src + ndst - 1) * sizeof *ki); ki[dst + ndst - 1] = kn; nsrc--; dst--; ndst++; } else if (src != dst + ndst) { kn = ki[src]; memmove(ki + dst + ndst + 1, ki + dst + ndst, (src - dst - ndst) * sizeof *ki); ki[dst + ndst] = kn; ndst++; nsrc--; src++; } else { ndst += nsrc; src += nsrc; nsrc = 0; } } } /* * Now populate ki_d.prefix (instead of ki_d.level) with the command * prefix used to show descendancies. */ path = calloc((maxlvl + 7) / 8, sizeof(unsigned char)); for (src = 0; src < items; src++) { if ((lvl = ki[src].ki_d.level) == 0) { ki[src].ki_d.prefix = NULL; continue; } if ((ki[src].ki_d.prefix = malloc(lvl * 2 + 1)) == NULL) xo_errx(1, "malloc failed"); for (n = 0; n < lvl - 2; n++) { ki[src].ki_d.prefix[n * 2] = path[n / 8] & 1 << (n % 8) ? '|' : ' '; ki[src].ki_d.prefix[n * 2 + 1] = ' '; } if (n == lvl - 2) { /* Have I any more siblings? */ for (siblings = 0, dst = src + 1; dst < items; dst++) { if (ki[dst].ki_d.level > lvl) continue; if (ki[dst].ki_d.level == lvl) siblings = 1; break; } if (siblings) path[n / 8] |= 1 << (n % 8); else path[n / 8] &= ~(1 << (n % 8)); ki[src].ki_d.prefix[n * 2] = siblings ? '|' : '`'; ki[src].ki_d.prefix[n * 2 + 1] = '-'; n++; } strcpy(ki[src].ki_d.prefix + n * 2, "- "); } free(path); } static void * expand_list(struct listinfo *inf) { void *newlist; int newmax; newmax = (inf->maxcount + 1) << 1; newlist = realloc(inf->l.ptr, newmax * inf->elemsize); if (newlist == NULL) { free(inf->l.ptr); xo_errx(1, "realloc to %d %ss failed", newmax, inf->lname); } inf->maxcount = newmax; inf->l.ptr = newlist; return (newlist); } static void free_list(struct listinfo *inf) { inf->count = inf->elemsize = inf->maxcount = 0; if (inf->l.ptr != NULL) free(inf->l.ptr); inf->addelem = NULL; inf->lname = NULL; inf->l.ptr = NULL; } static void init_list(struct listinfo *inf, addelem_rtn artn, int elemsize, const char *lname) { inf->count = inf->maxcount = 0; inf->elemsize = elemsize; inf->addelem = artn; inf->lname = lname; inf->l.ptr = NULL; } VARENT * find_varentry(const char *name) { struct varent *vent; STAILQ_FOREACH(vent, &varlist, next_ve) { if (strcmp(vent->var->name, name) == 0) return vent; } return NULL; } static void scan_vars(struct keyword_info *const keywords_info) { struct varent *vent; const VAR *v; STAILQ_FOREACH(vent, &varlist, next_ve) { v = vent->var; if (v->flag & USER) needuser = 1; if (v->flag & COMM) needcomm = 1; if ((vent->flags & VE_KEEP) != 0) keywords_info[aliased_keyword_index(v)].flags |= KWI_HAS_MUST_KEEP_COLUMN; } } /* * For each explicitly requested keyword, remove all the same keywords * from "canned" displays. If the same keyword appears multiple times * only in "canned displays", then keep the first (leftmost) occurence * only (with the reasoning that columns requested first are the most * important as their positions catch the eye more). */ static void remove_redundant_columns(struct keyword_info *const keywords_info) { struct varent *prev_vent, *vent, *next_vent; prev_vent = NULL; STAILQ_FOREACH_SAFE(vent, &varlist, next_ve, next_vent) { const VAR *const v = vent->var; struct keyword_info *const kwi = &keywords_info[aliased_keyword_index(v)]; /* * If the current column is not marked as to absolutely keep, * and we have either already output one with the same keyword * or know we will output one later, remove it. */ if ((vent->flags & VE_KEEP) == 0 && (kwi->flags & (KWI_HAS_MUST_KEEP_COLUMN | KWI_SEEN)) != 0) { if (prev_vent == NULL) STAILQ_REMOVE_HEAD(&varlist, next_ve); else STAILQ_REMOVE_AFTER(&varlist, prev_vent, next_ve); } else prev_vent = vent; kwi->flags |= KWI_SEEN; } } static void format_output(KINFO *ki) { struct varent *vent; const VAR *v; KINFO_STR *ks; char *str; u_int len; STAILQ_INIT(&ki->ki_ks); STAILQ_FOREACH(vent, &varlist, next_ve) { v = vent->var; str = (v->oproc)(ki, vent); ks = malloc(sizeof(*ks)); if (ks == NULL) xo_errx(1, "malloc failed"); ks->ks_str = str; STAILQ_INSERT_TAIL(&ki->ki_ks, ks, ks_next); if (str != NULL) { len = strlen(str); } else len = 1; /* "-" */ if (vent->width < len) vent->width = len; } } static const char * fmt(char **(*fn)(kvm_t *, const struct kinfo_proc *, int), KINFO *ki, char *comm, char *thread, int maxlen) { const char *s; s = fmt_argv((*fn)(kd, ki->ki_p, termwidth), comm, showthreads && ki->ki_p->ki_numthreads > 1 ? thread : NULL, maxlen); return (s); } static void saveuser(KINFO *ki) { char tdname[COMMLEN + 1]; ki->ki_valid = 1; /* * save arguments if needed */ if (needcomm) { if (ki->ki_p->ki_stat == SZOMB) { ki->ki_args = strdup(""); } else { (void)snprintf(tdname, sizeof(tdname), "%s%s", ki->ki_p->ki_tdname, ki->ki_p->ki_moretdname); ki->ki_args = fmt(kvm_getargv, ki, ki->ki_p->ki_comm, tdname, COMMLEN * 2 + 1); } if (ki->ki_args == NULL) xo_errx(1, "malloc failed"); } else { ki->ki_args = NULL; } if (needenv) { ki->ki_env = fmt(kvm_getenvv, ki, (char *)NULL, (char *)NULL, 0); if (ki->ki_env == NULL) xo_errx(1, "malloc failed"); } else { ki->ki_env = NULL; } } /* A macro used to improve the readability of pscomp(). */ #define DIFF_RETURN(a, b, field) do { \ if ((a)->field != (b)->field) \ return (((a)->field < (b)->field) ? -1 : 1); \ } while (0) static int pscomp(const void *a, const void *b) { const KINFO *ka, *kb; ka = a; kb = b; /* SORTCPU and SORTMEM are sorted in descending order. */ if (sortby == SORTCPU) DIFF_RETURN(kb, ka, ki_pcpu); if (sortby == SORTMEM) DIFF_RETURN(kb, ka, ki_memsize); /* * TTY's are sorted in ascending order, except that all NODEV * processes come before all processes with a device. */ if (ka->ki_p->ki_tdev != kb->ki_p->ki_tdev) { if (ka->ki_p->ki_tdev == NODEV) return (-1); if (kb->ki_p->ki_tdev == NODEV) return (1); DIFF_RETURN(ka, kb, ki_p->ki_tdev); } /* PID's and TID's (threads) are sorted in ascending order. */ DIFF_RETURN(ka, kb, ki_p->ki_pid); DIFF_RETURN(ka, kb, ki_p->ki_tid); return (0); } #undef DIFF_RETURN /* * ICK (all for getopt), would rather hide the ugliness * here than taint the main code. * * ps foo -> ps -foo * ps 34 -> ps -p34 * * The old convention that 't' with no trailing tty arg means the users * tty, is only supported if argv[1] doesn't begin with a '-'. This same * feature is available with the option 'T', which takes no argument. */ static char * kludge_oldps_options(const char *optlist, char *origval, const char *nextarg) { size_t len; char *argp, *cp, *newopts, *ns, *optp, *pidp; /* * See if the original value includes any option which takes an * argument (and will thus use up the remainder of the string). */ argp = NULL; if (optlist != NULL) { for (cp = origval; *cp != '\0'; cp++) { optp = strchr(optlist, *cp); if ((optp != NULL) && *(optp + 1) == ':') { argp = cp; break; } } } if (argp != NULL && *origval == '-') return (origval); /* * if last letter is a 't' flag with no argument (in the context * of the oldps options -- option string NOT starting with a '-' -- * then convert to 'T' (meaning *this* terminal, i.e. ttyname(0)). * * However, if a flag accepting a string argument is found earlier * in the option string (including a possible `t' flag), then the * remainder of the string must be the argument to that flag; so * do not modify that argument. Note that a trailing `t' would * cause argp to be set, if argp was not already set by some * earlier option. */ len = strlen(origval); cp = origval + len - 1; pidp = NULL; if (*cp == 't' && *origval != '-' && cp == argp) { if (nextarg == NULL || *nextarg == '-' || isdigitch(*nextarg)) *cp = 'T'; } else if (argp == NULL) { /* * The original value did not include any option which takes * an argument (and that would include `p' and `t'), so check * the value for trailing number, or comma-separated list of * numbers, which we will treat as a pid request. */ if (isdigitch(*cp)) { while (cp >= origval && (*cp == ',' || isdigitch(*cp))) --cp; pidp = cp + 1; } } /* * If nothing needs to be added to the string, then return * the "original" (although possibly modified) value. */ if (*origval == '-' && pidp == NULL) return (origval); /* * Create a copy of the string to add '-' and/or 'p' to the * original value. */ if ((newopts = ns = malloc(len + 3)) == NULL) xo_errx(1, "malloc failed"); if (*origval != '-') *ns++ = '-'; /* add option flag */ if (pidp == NULL) strcpy(ns, origval); else { /* * Copy everything before the pid string, add the `p', * and then copy the pid string. */ len = pidp - origval; memcpy(ns, origval, len); ns += len; *ns++ = 'p'; strcpy(ns, pidp); } return (newopts); } static void pidmax_init(void) { size_t intsize; intsize = sizeof(pid_max); if (sysctlbyname("kern.pid_max", &pid_max, &intsize, NULL, 0) < 0) { xo_warn("unable to read kern.pid_max"); pid_max = 99999; } } static void __dead2 usage(void) { #define SINGLE_OPTS "[-aCcdeHhjlmrSTuvwXxZ]" xo_error("%s\n%s\n%s\n%s\n%s\n", "usage: ps [--libxo] " SINGLE_OPTS " [-O fmt | -o fmt]", " [-G gid[,gid...]] [-J jid[,jid...]] [-M core] [-N system]", " [-p pid[,pid...]] [-t tty[,tty...]] [-U user[,user...]]", " [-D up | down | both]", " ps [--libxo] -L"); exit(1); }