Home | History | Annotate | Line # | Download | only in ps
keyword.c revision 1.37
      1 /*	$NetBSD: keyword.c,v 1.37 2004/03/27 11:48:31 simonb Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1990, 1993, 1994
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  */
     31 
     32 #include <sys/cdefs.h>
     33 #ifndef lint
     34 #if 0
     35 static char sccsid[] = "@(#)keyword.c	8.5 (Berkeley) 4/2/94";
     36 #else
     37 __RCSID("$NetBSD: keyword.c,v 1.37 2004/03/27 11:48:31 simonb Exp $");
     38 #endif
     39 #endif /* not lint */
     40 
     41 #include <sys/param.h>
     42 #include <sys/time.h>
     43 #include <sys/lwp.h>
     44 #include <sys/proc.h>
     45 #include <sys/resource.h>
     46 #include <sys/sysctl.h>
     47 #include <sys/ucred.h>
     48 
     49 #include <err.h>
     50 #include <errno.h>
     51 #include <kvm.h>
     52 #include <stddef.h>
     53 #include <stdio.h>
     54 #include <stdlib.h>
     55 #include <string.h>
     56 #include <signal.h>
     57 
     58 #include "ps.h"
     59 
     60 static VAR *findvar(const char *);
     61 static int  vcmp(const void *, const void *);
     62 
     63 #if 0 	/* kernel doesn't calculate these */
     64 	PUVAR("idrss", "IDRSS", 0, p_uru_idrss, UINT64, PRIu64),
     65 	PUVAR("isrss", "ISRSS", 0, p_uru_isrss, UINT64, PRId64),
     66 	PUVAR("ixrss", "IXRSS", 0, p_uru_ixrss, UINT64, PRId64),
     67 	PUVAR("maxrss", "MAXRSS", 0, p_uru_maxrss, UINT64, PRIu64),
     68 #endif
     69 
     70 /* Compute offset in common structures. */
     71 #define	POFF(x)	offsetof(struct kinfo_proc2, x)
     72 #define	LOFF(x)	offsetof(struct kinfo_lwp, x)
     73 
     74 #define	UIDFMT	"u"
     75 #define	UID(n1, n2, off) \
     76 	{ n1, n2, 0, pvar, POFF(off), UINT32, UIDFMT }
     77 #define	GID(n1, n2, off)	UID(n1, n2, off)
     78 
     79 #define	PIDFMT	"d"
     80 #define	PID(n1, n2, off) \
     81 	{ n1, n2, 0, pvar, POFF(off), INT32, PIDFMT }
     82 
     83 #define	LVAR(n1, n2, fl, off, type, fmt) \
     84 	{ n1, n2, (fl) | LWP, pvar, LOFF(off), type, fmt }
     85 #define	PVAR(n1, n2, fl, off, type, fmt) \
     86 	{ n1, n2, (fl) | 0, pvar, POFF(off), type, fmt }
     87 #define	PUVAR(n1, n2, fl, off, type, fmt) \
     88 	{ n1, n2, (fl) | UAREA, pvar, POFF(off), type, fmt }
     89 
     90 /* NB: table must be sorted, in vi use:
     91  *	:/^VAR/,/end_sort/! sort -t\" +1
     92  * breaking long lines just makes the sort harder
     93  */
     94 VAR var[] = {
     95 	{"%cpu", "%CPU", 0, pcpu, 0, PCPU},
     96 	{"%mem", "%MEM", 0, pmem, POFF(p_vm_rssize), INT32},
     97 	PVAR("acflag", "ACFLG", 0, p_acflag, USHORT, "x"),
     98 	{"acflg", "acflag", ALIAS},
     99 	{"blocked", "sigmask", ALIAS},
    100 	{"caught", "sigcatch", ALIAS},
    101 	{"command", "COMMAND", COMM|LJUST, command},
    102 	PVAR("cpu", "CPU", 0, p_estcpu, UINT, "u"),
    103 	{"cputime", "time", ALIAS},
    104 	{"ctime", "CTIME", 0, putimeval, POFF(p_uctime_sec), TIMEVAL},
    105 	GID("egid", "EGID", p_gid),
    106 	{"egroup", "EGROUP", LJUST, gname},
    107 	UID("euid", "EUID", p_uid),
    108 	{"euser", "EUSER", LJUST, uname},
    109 	PVAR("f", "F", 0, p_flag, INT, "x"),
    110 	{"flags", "f", ALIAS},
    111 	GID("gid", "GID", p_gid),
    112 	{"group", "GROUP", LJUST, gname},
    113 	{"groupnames", "GROUPNAMES", LJUST, groupnames},
    114 	{"groups", "GROUPS", LJUST, groups},
    115 	LVAR("holdcnt", "HOLDCNT", 0, l_holdcnt, INT, "d"),
    116 	{"ignored", "sigignore", ALIAS},
    117 	PUVAR("inblk", "INBLK", 0, p_uru_inblock, UINT64, PRIu64),
    118 	{"inblock", "inblk", ALIAS},
    119 	PVAR("jobc", "JOBC", 0, p_jobc, SHORT, "d"),
    120 	PVAR("ktrace", "KTRACE", 0, p_traceflag, INT, "x"),
    121 /*XXX*/	PVAR("ktracep", "KTRACEP", 0, p_tracep, KPTR, PRIx64),
    122 	LVAR("lid", "LID", 0, l_lid, ULONG, "d"),
    123 	{"lim", "LIM", 0, maxrss},
    124 	{"login", "LOGIN", LJUST, logname},
    125 	{"logname", "login", ALIAS},
    126 	{"lstart", "STARTED", LJUST, lstarted, POFF(p_ustart_sec), UINT32},
    127 	{"lstate", "STAT", LJUST|LWP, lstate},
    128 	PUVAR("majflt", "MAJFLT", 0, p_uru_majflt, UINT64, PRIu64),
    129 	PUVAR("minflt", "MINFLT", 0, p_uru_minflt, UINT64, PRIu64),
    130 	PUVAR("msgrcv", "MSGRCV", 0, p_uru_msgrcv, UINT64, PRIu64),
    131 	PUVAR("msgsnd", "MSGSND", 0, p_uru_msgsnd, UINT64, PRIu64),
    132 	{"ni", "nice", ALIAS},
    133 	{"nice", "NI", 0, pnice, POFF(p_nice), UCHAR},
    134 	PUVAR("nivcsw", "NIVCSW", 0, p_uru_nivcsw, UINT64, PRIu64),
    135 	PVAR("nlwp", "NLWP", 0, p_nlwps, UINT64, PRId64),
    136 	{"nsignals", "nsigs", ALIAS},
    137 	PUVAR("nsigs", "NSIGS", 0, p_uru_nsignals, UINT64, PRIu64),
    138 	PUVAR("nswap", "NSWAP", 0, p_uru_nswap, UINT64, PRIu64),
    139 	PUVAR("nvcsw", "NVCSW", 0, p_uru_nvcsw, UINT64, PRIu64),
    140 /*XXX*/	LVAR("nwchan", "WCHAN", 0, l_wchan, KPTR, PRIx64),
    141 	PUVAR("oublk", "OUBLK", 0, p_uru_oublock, UINT64, PRIu64),
    142 	{"oublock", "oublk", ALIAS},
    143 /*XXX*/	PVAR("p_ru", "P_RU", 0, p_ru, KPTR, PRIx64),
    144 /*XXX*/	PVAR("paddr", "PADDR", 0, p_paddr, KPTR, PRIx64),
    145 	PUVAR("pagein", "PAGEIN", 0, p_uru_majflt, UINT64, PRIu64),
    146 	{"pcpu", "%cpu", ALIAS},
    147 	{"pending", "sig", ALIAS},
    148 	PID("pgid", "PGID", p__pgid),
    149 	PID("pid", "PID", p_pid),
    150 	{"pmem", "%mem", ALIAS},
    151 	PID("ppid", "PPID", p_ppid),
    152 	{"pri", "PRI", LWP, pri},
    153 	LVAR("re", "RE", INF127, l_swtime, UINT, "u"),
    154 	GID("rgid", "RGID", p_rgid),
    155 	{"rgroup", "RGROUP", LJUST, rgname},
    156 /*XXX*/	LVAR("rlink", "RLINK", 0, l_back, KPTR, PRIx64),
    157 	PVAR("rlwp", "RLWP", 0, p_nrlwps, UINT64, PRId64),
    158 	{"rss", "RSS", 0, p_rssize, POFF(p_vm_rssize), INT32},
    159 	{"rssize", "rsz", ALIAS},
    160 	{"rsz", "RSZ", 0, rssize, POFF(p_vm_rssize), INT32},
    161 	UID("ruid", "RUID", p_ruid),
    162 	{"ruser", "RUSER", LJUST, runame},
    163 	PVAR("sess", "SESS", 0, p_sess, KPTR24, PRIx64),
    164 	PID("sid", "SID", p_sid),
    165 	PVAR("sig", "PENDING", 0, p_siglist, SIGLIST, "s"),
    166 	PVAR("sigcatch", "CAUGHT", 0, p_sigcatch, SIGLIST, "s"),
    167 	PVAR("sigignore", "IGNORED", 0, p_sigignore, SIGLIST, "s"),
    168 	PVAR("sigmask", "BLOCKED", 0, p_sigmask, SIGLIST, "s"),
    169 	LVAR("sl", "SL", INF127, l_slptime, UINT, "u"),
    170 	{"start", "STARTED", 0, started, POFF(p_ustart_sec), UINT32},
    171 	{"stat", "state", ALIAS},
    172 	{"state", "STAT", LJUST, state},
    173 	{"stime", "STIME", 0, putimeval, POFF(p_ustime_sec), TIMEVAL},
    174 	GID("svgid", "SVGID", p_svgid),
    175 	{"svgroup", "SVGROUP", LJUST, svgname},
    176 	UID("svuid", "SVUID", p_svuid),
    177 	{"svuser", "SVUSER", LJUST, svuname},
    178 	/* "tdev" is UINT32, but we do this for sorting purposes */
    179 	{"tdev", "TDEV", 0, tdev, POFF(p_tdev), INT32},
    180 	{"time", "TIME", 0, cputime, 0, CPUTIME},
    181 	PID("tpgid", "TPGID", p_tpgid),
    182 	PVAR("tsess", "TSESS", 0, p_tsess, KPTR, PRIx64),
    183 	{"tsiz", "TSIZ", 0, tsize, POFF(p_vm_tsize), INT32},
    184 	{"tt", "TT", LJUST, tname, POFF(p_tdev), INT32},
    185 	{"tty", "TT", LJUST, longtname, POFF(p_tdev), INT32},
    186 	{"ucomm", "UCOMM", LJUST, ucomm},
    187 	UID("uid", "UID", p_uid),
    188 	LVAR("upr", "UPR", 0, l_usrpri, UCHAR, "u"),
    189 	{"user", "USER", LJUST, uname},
    190 	{"usrpri", "upr", ALIAS},
    191 	{"utime", "UTIME", 0, putimeval, POFF(p_uutime_sec), TIMEVAL},
    192 	{"vsize", "vsz", ALIAS},
    193 	{"vsz", "VSZ", 0, vsize, 0, VSIZE},
    194 	{"wchan", "WCHAN", LJUST|LWP, wchan},
    195 	PVAR("xstat", "XSTAT", 0, p_xstat, USHORT, "x"),
    196 /* "zzzz" end_sort */
    197 	{""},
    198 };
    199 
    200 void
    201 showkey(void)
    202 {
    203 	VAR *v;
    204 	int i;
    205 	char *p, *sep;
    206 
    207 	i = 0;
    208 	sep = "";
    209 	for (v = var; *(p = v->name); ++v) {
    210 		int len = strlen(p);
    211 		if (termwidth && (i += len + 1) > termwidth) {
    212 			i = len;
    213 			sep = "\n";
    214 		}
    215 		(void) printf("%s%s", sep, p);
    216 		sep = " ";
    217 	}
    218 	(void) printf("\n");
    219 }
    220 
    221 static void
    222 parsevarlist(const char *pp, struct varent **head, struct varent **tail)
    223 {
    224 	char *p;
    225 
    226 	/* dup to avoid zapping arguments, can't free because it
    227 	   might contain a header. */
    228 	p = strdup(pp);
    229 
    230 #define	FMTSEP	" \t,\n"
    231 	while (p && *p) {
    232 		char *cp;
    233 		VAR *v;
    234 		struct varent *vent;
    235 
    236 		while ((cp = strsep(&p, FMTSEP)) != NULL && *cp == '\0')
    237 			/* void */;
    238 		if (cp == NULL || !(v = findvar(cp)))
    239 			continue;
    240 		if ((vent = malloc(sizeof(struct varent))) == NULL)
    241 			err(1, NULL);
    242 		vent->var = v;
    243 		vent->next = NULL;
    244 		if (*head == NULL)
    245 			*head = vent;
    246 		else
    247 			(*tail)->next = vent;
    248 		*tail = vent;
    249 	}
    250 	if (!*head)
    251 		errx(1, "no valid keywords");
    252 }
    253 
    254 void
    255 parsefmt(const char *p)
    256 {
    257 	static struct varent *vtail;
    258 
    259 	parsevarlist(p, &vhead, &vtail);
    260 }
    261 
    262 void
    263 parsesort(const char *p)
    264 {
    265 	static struct varent *sorttail;
    266 
    267 	parsevarlist(p, &sorthead, &sorttail);
    268 }
    269 
    270 static VAR *
    271 findvar(const char *p)
    272 {
    273 	VAR *v;
    274 	char *hp;
    275 
    276 	hp = strchr(p, '=');
    277 	if (hp)
    278 		*hp++ = '\0';
    279 
    280 	v = bsearch(p, var, sizeof(var)/sizeof(VAR) - 1, sizeof(VAR), vcmp);
    281 	if (v && v->flag & ALIAS)
    282 		v = findvar(v->header);
    283 	if (!v) {
    284 		warnx("%s: keyword not found", p);
    285 		eval = 1;
    286 		return NULL;
    287 	}
    288 
    289 	if (v && hp)
    290 		v->header = hp;
    291 	return v;
    292 }
    293 
    294 static int
    295 vcmp(const void *a, const void *b)
    296 {
    297         return strcmp(a, ((VAR *)b)->name);
    298 }
    299