keyword.c revision 1.50
1 /* $NetBSD: keyword.c,v 1.50 2006/10/29 22:32:53 christos 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.50 2006/10/29 22:32:53 christos 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, of) \ 76 { .name = n1, .header = n2, .flag = 0, .oproc = pvar, \ 77 .off = POFF(of), .type = UINT32, .fmt = UIDFMT } 78 #define GID(n1, n2, off) UID(n1, n2, off) 79 80 #define PIDFMT "d" 81 #define PID(n1, n2, of) \ 82 { .name = n1, .header = n2, .flag = 0, .oproc = pvar, \ 83 .off = POFF(of), .type = INT32, .fmt = PIDFMT } 84 85 #define LVAR(n1, n2, fl, of, ty, fm) \ 86 { .name = n1, .header = n2, .flag = (fl) | LWP, .oproc = pvar, \ 87 .off = LOFF(of), .type = ty, .fmt = fm } 88 #define PVAR(n1, n2, fl, of, ty, fm) \ 89 { .name = n1, .header = n2, .flag = (fl) | 0, .oproc = pvar, \ 90 .off = POFF(of), .type = ty, .fmt = fm } 91 #define PUVAR(n1, n2, fl, of, ty, fm) \ 92 { .name = n1, .header = n2, .flag = (fl) | UAREA, .oproc = pvar, \ 93 .off = POFF(of), .type = ty, .fmt = fm } 94 #define VAR3(n1, n2, fl) \ 95 { .name = n1, .header = n2, .flag = fl } 96 #define VAR4(n1, n2, fl, op) \ 97 { .name = n1, .header = n2, .flag = fl, .oproc = op, } 98 #define VAR6(n1, n2, fl, op, of, ty) \ 99 { .name = n1, .header = n2, .flag = fl, .oproc = op, \ 100 .off = of, .type = ty } 101 102 /* NB: table must be sorted, in vi use: 103 * :/^VAR/,/end_sort/! sort -t\" +1 104 * breaking long lines just makes the sort harder 105 * 106 * We support all the fields required by P1003.1-2004 (SUSv3), with 107 * the correct default headers, except for the "tty" field, where the 108 * standard says the header should be "TT", but we have "TTY". 109 */ 110 VAR var[] = { 111 VAR6("%cpu", "%CPU", 0, pcpu, 0, PCPU), 112 VAR6("%mem", "%MEM", 0, pmem, POFF(p_vm_rssize), INT32), 113 PVAR("acflag", "ACFLG", 0, p_acflag, USHORT, "x"), 114 VAR3("acflg", "acflag", ALIAS), 115 VAR3("args", "command", ALIAS), 116 VAR3("blocked", "sigmask", ALIAS), 117 VAR3("caught", "sigcatch", ALIAS), 118 VAR4("comm", "COMMAND", COMM|ARGV0|LJUST, command), 119 VAR4("command", "COMMAND", COMM|LJUST, command), 120 PVAR("cpu", "CPU", 0, p_estcpu, UINT, "u"), 121 VAR3("cputime", "time", ALIAS), 122 VAR6("ctime", "CTIME", 0, putimeval, POFF(p_uctime_sec), TIMEVAL), 123 GID("egid", "EGID", p_gid), 124 VAR4("egroup", "EGROUP", LJUST, gname), 125 VAR4("emul", "EMUL", LJUST, emul), 126 VAR6("etime", "ELAPSED", 0, elapsed, POFF(p_ustart_sec), TIMEVAL), 127 UID("euid", "EUID", p_uid), 128 VAR4("euser", "EUSER", LJUST, uname), 129 PVAR("f", "F", 0, p_flag, INT, "x"), 130 VAR3("flags", "f", ALIAS), 131 GID("gid", "GID", p_gid), 132 VAR4("group", "GROUP", LJUST, gname), 133 VAR4("groupnames", "GROUPNAMES", LJUST, groupnames), 134 VAR4("groups", "GROUPS", LJUST, groups), 135 LVAR("holdcnt", "HOLDCNT", 0, l_holdcnt, INT, "d"), 136 VAR3("ignored", "sigignore", ALIAS), 137 PUVAR("inblk", "INBLK", 0, p_uru_inblock, UINT64, PRIu64), 138 VAR3("inblock", "inblk", ALIAS), 139 PVAR("jobc", "JOBC", 0, p_jobc, SHORT, "d"), 140 PVAR("ktrace", "KTRACE", 0, p_traceflag, INT, "x"), 141 /*XXX*/ PVAR("ktracep", "KTRACEP", 0, p_tracep, KPTR, PRIx64), 142 LVAR("laddr", "LADDR", 0, l_laddr, KPTR, PRIx64), 143 LVAR("lid", "LID", 0, l_lid, INT32, "d"), 144 VAR4("lim", "LIM", 0, maxrss), 145 VAR4("login", "LOGIN", LJUST, logname), 146 VAR3("logname", "login", ALIAS), 147 VAR6("lstart", "STARTED", LJUST, lstarted, POFF(p_ustart_sec), UINT32), 148 VAR4("lstate", "STAT", LJUST|LWP, lstate), 149 PUVAR("majflt", "MAJFLT", 0, p_uru_majflt, UINT64, PRIu64), 150 PUVAR("minflt", "MINFLT", 0, p_uru_minflt, UINT64, PRIu64), 151 PUVAR("msgrcv", "MSGRCV", 0, p_uru_msgrcv, UINT64, PRIu64), 152 PUVAR("msgsnd", "MSGSND", 0, p_uru_msgsnd, UINT64, PRIu64), 153 VAR3("ni", "nice", ALIAS), 154 VAR6("nice", "NI", 0, pnice, POFF(p_nice), UCHAR), 155 PUVAR("nivcsw", "NIVCSW", 0, p_uru_nivcsw, UINT64, PRIu64), 156 PVAR("nlwp", "NLWP", 0, p_nlwps, UINT64, PRId64), 157 VAR3("nsignals", "nsigs", ALIAS), 158 PUVAR("nsigs", "NSIGS", 0, p_uru_nsignals, UINT64, PRIu64), 159 PUVAR("nswap", "NSWAP", 0, p_uru_nswap, UINT64, PRIu64), 160 PUVAR("nvcsw", "NVCSW", 0, p_uru_nvcsw, UINT64, PRIu64), 161 /*XXX*/ LVAR("nwchan", "WCHAN", 0, l_wchan, KPTR, PRIx64), 162 PUVAR("oublk", "OUBLK", 0, p_uru_oublock, UINT64, PRIu64), 163 VAR3("oublock", "oublk", ALIAS), 164 /*XXX*/ PVAR("p_ru", "P_RU", 0, p_ru, KPTR, PRIx64), 165 /*XXX*/ PVAR("paddr", "PADDR", 0, p_paddr, KPTR, PRIx64), 166 PUVAR("pagein", "PAGEIN", 0, p_uru_majflt, UINT64, PRIu64), 167 VAR3("pcpu", "%cpu", ALIAS), 168 VAR3("pending", "sig", ALIAS), 169 PID("pgid", "PGID", p__pgid), 170 PID("pid", "PID", p_pid), 171 VAR3("pmem", "%mem", ALIAS), 172 PID("ppid", "PPID", p_ppid), 173 VAR4("pri", "PRI", LWP, pri), 174 LVAR("re", "RE", INF127, l_swtime, UINT, "u"), 175 GID("rgid", "RGID", p_rgid), 176 VAR4("rgroup", "RGROUP", LJUST, rgname), 177 /*XXX*/ LVAR("rlink", "RLINK", 0, l_back, KPTR, PRIx64), 178 PVAR("rlwp", "RLWP", 0, p_nrlwps, UINT64, PRId64), 179 VAR6("rss", "RSS", 0, p_rssize, POFF(p_vm_rssize), INT32), 180 VAR3("rssize", "rsz", ALIAS), 181 VAR6("rsz", "RSZ", 0, rssize, POFF(p_vm_rssize), INT32), 182 UID("ruid", "RUID", p_ruid), 183 VAR4("ruser", "RUSER", LJUST, runame), 184 PVAR("sess", "SESS", 0, p_sess, KPTR24, PRIx64), 185 PID("sid", "SID", p_sid), 186 PVAR("sig", "PENDING", 0, p_siglist, SIGLIST, "s"), 187 PVAR("sigcatch", "CAUGHT", 0, p_sigcatch, SIGLIST, "s"), 188 PVAR("sigignore", "IGNORED", 0, p_sigignore, SIGLIST, "s"), 189 PVAR("sigmask", "BLOCKED", 0, p_sigmask, SIGLIST, "s"), 190 LVAR("sl", "SL", INF127, l_slptime, UINT, "u"), 191 VAR6("start", "STARTED", 0, started, POFF(p_ustart_sec), UINT32), 192 VAR3("stat", "state", ALIAS), 193 VAR4("state", "STAT", LJUST, state), 194 VAR6("stime", "STIME", 0, putimeval, POFF(p_ustime_sec), TIMEVAL), 195 GID("svgid", "SVGID", p_svgid), 196 VAR4("svgroup", "SVGROUP", LJUST, svgname), 197 UID("svuid", "SVUID", p_svuid), 198 VAR4("svuser", "SVUSER", LJUST, svuname), 199 /* "tdev" is UINT32, but we do this for sorting purposes */ 200 VAR6("tdev", "TDEV", 0, tdev, POFF(p_tdev), INT32), 201 VAR6("time", "TIME", 0, cputime, 0, CPUTIME), 202 PID("tpgid", "TPGID", p_tpgid), 203 PVAR("tsess", "TSESS", 0, p_tsess, KPTR, PRIx64), 204 VAR6("tsiz", "TSIZ", 0, tsize, POFF(p_vm_tsize), INT32), 205 VAR6("tt", "TTY", LJUST, tname, POFF(p_tdev), INT32), 206 VAR6("tty", "TTY", LJUST, longtname, POFF(p_tdev), INT32), 207 LVAR("uaddr", "UADDR", 0, l_addr, KPTR, PRIx64), 208 VAR4("ucomm", "UCOMM", LJUST, ucomm), 209 UID("uid", "UID", p_uid), 210 LVAR("upr", "UPR", 0, l_usrpri, UCHAR, "u"), 211 VAR4("user", "USER", LJUST, uname), 212 VAR3("usrpri", "upr", ALIAS), 213 VAR6("utime", "UTIME", 0, putimeval, POFF(p_uutime_sec), TIMEVAL), 214 VAR3("vsize", "vsz", ALIAS), 215 VAR6("vsz", "VSZ", 0, vsize, 0, VSIZE), 216 VAR4("wchan", "WCHAN", LJUST|LWP, wchan), 217 PVAR("xstat", "XSTAT", 0, p_xstat, USHORT, "x"), 218 /* "zzzz" end_sort */ 219 { .name = "" }, 220 }; 221 222 void 223 showkey(void) 224 { 225 VAR *v; 226 int i; 227 const char *p; 228 const char *sep; 229 230 i = 0; 231 sep = ""; 232 for (v = var; *(p = v->name); ++v) { 233 int len = strlen(p); 234 if (termwidth && (i += len + 1) > termwidth) { 235 i = len; 236 sep = "\n"; 237 } 238 (void)printf("%s%s", sep, p); 239 sep = " "; 240 } 241 (void)printf("\n"); 242 } 243 244 /* 245 * Parse the string pp, and insert or append entries to the list 246 * referenced by listptr. If pos in non-null and *pos is non-null, then 247 * *pos specifies where to insert (instead of appending). If pos is 248 * non-null, then a new value is returned through *pos referring to the 249 * last item inserted. 250 */ 251 static void 252 parsevarlist(const char *pp, struct varlist *listptr, struct varent **pos) 253 { 254 char *p, *sp, *equalsp; 255 256 /* dup to avoid zapping arguments. We will free sp later. */ 257 p = sp = strdup(pp); 258 259 /* 260 * Everything after the first '=' is part of a custom header. 261 * Temporarily replace it with '\0' to simplify other code. 262 */ 263 equalsp = strchr(p, '='); 264 if (equalsp) 265 *equalsp = '\0'; 266 267 #define FMTSEP " \t,\n" 268 while (p && *p) { 269 char *cp; 270 VAR *v; 271 struct varent *vent; 272 273 /* 274 * skip separators before the first keyword, and 275 * look for the separator after the keyword. 276 */ 277 for (cp = p; *cp != '\0'; cp++) { 278 p = strpbrk(cp, FMTSEP); 279 if (p != cp) 280 break; 281 } 282 if (*cp == '\0') 283 break; 284 /* 285 * Now cp points to the start of a keyword, 286 * and p is NULL or points past the end of the keyword. 287 * 288 * Terminate the keyword with '\0', or reinstate the 289 * '=' that was removed earlier, if appropriate. 290 */ 291 if (p) { 292 *p = '\0'; 293 p++; 294 } else if (equalsp) { 295 *equalsp = '='; 296 } 297 298 /* 299 * If findvar() likes the keyword or keyword=header, 300 * add it to our list. If findvar() doesn't like it, 301 * it will print a warning, so we ignore it. 302 */ 303 if ((v = findvar(cp)) == NULL) 304 continue; 305 if ((vent = malloc(sizeof(struct varent))) == NULL) 306 err(1, NULL); 307 vent->var = v; 308 if (pos && *pos) 309 SIMPLEQ_INSERT_AFTER(listptr, *pos, vent, next); 310 else { 311 SIMPLEQ_INSERT_TAIL(listptr, vent, next); 312 } 313 if (pos) 314 *pos = vent; 315 } 316 free(sp); 317 if (SIMPLEQ_EMPTY(listptr)) 318 errx(1, "no valid keywords"); 319 } 320 321 void 322 parsefmt(const char *p) 323 { 324 325 parsevarlist(p, &displaylist, NULL); 326 } 327 328 void 329 parsefmt_insert(const char *p, struct varent **pos) 330 { 331 332 parsevarlist(p, &displaylist, pos); 333 } 334 335 void 336 parsesort(const char *p) 337 { 338 339 parsevarlist(p, &sortlist, NULL); 340 } 341 342 /* Search through a list for an entry with a specified name. */ 343 struct varent * 344 varlist_find(struct varlist *list, const char *name) 345 { 346 struct varent *vent; 347 348 SIMPLEQ_FOREACH(vent, list, next) { 349 if (strcmp(vent->var->name, name) == 0) 350 break; 351 } 352 return vent; 353 } 354 355 static VAR * 356 findvar(const char *p) 357 { 358 VAR *v; 359 char *hp; 360 361 hp = strchr(p, '='); 362 if (hp) 363 *hp++ = '\0'; 364 365 v = bsearch(p, var, sizeof(var)/sizeof(VAR) - 1, sizeof(VAR), vcmp); 366 if (v && v->flag & ALIAS) 367 v = findvar(v->header); 368 if (!v) { 369 warnx("%s: keyword not found", p); 370 eval = 1; 371 return NULL; 372 } 373 374 if (v && hp) { 375 /* 376 * Override the header. 377 * 378 * We need to copy the entry first, and override the 379 * header in the copy, because the same field might be 380 * used multiple times with different headers. We also 381 * need to strdup the header. 382 */ 383 struct var *newvar; 384 char *newheader; 385 386 if ((newvar = malloc(sizeof(struct var))) == NULL) 387 err(1, NULL); 388 if ((newheader = strdup(hp)) == NULL) 389 err(1, NULL); 390 memcpy(newvar, v, sizeof(struct var)); 391 newvar->header = newheader; 392 393 /* 394 * According to P1003.1-2004, if the header text is null, 395 * such as -o user=, the field width will be at least as 396 * wide as the default header text. 397 */ 398 if (*hp == '\0') 399 newvar->width = strlen(v->header); 400 401 v = newvar; 402 } 403 return v; 404 } 405 406 static int 407 vcmp(const void *a, const void *b) 408 { 409 return strcmp(a, ((const VAR *)b)->name); 410 } 411
Indexes created Mon Sep 29 18:09:42 GMT 2025