| 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. All advertising materials mentioning features or use of this software |
| 14 | * must display the following acknowledgement: |
| 15 | * This product includes software developed by the University of |
| 16 | * California, Berkeley and its contributors. |
| 17 | * 4. Neither the name of the University nor the names of its contributors |
| 18 | * may be used to endorse or promote products derived from this software |
| 19 | * without specific prior written permission. |
| 20 | * |
| 21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| 22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| 25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 31 | * SUCH DAMAGE. |
| 32 | * |
| 33 | * @(#)print.c 8.6 (Berkeley) 4/16/94 |
| 34 | * $FreeBSD: src/bin/ps/print.c,v 1.36.2.4 2002/11/30 13:00:14 tjr Exp $ |
| 35 | * $DragonFly: src/bin/ps/print.c,v 1.34 2008/11/10 14:56:33 swildner Exp $ |
| 36 | */ |
| 37 | |
| 38 | #include <sys/param.h> |
| 39 | #include <sys/time.h> |
| 40 | #include <sys/resource.h> |
| 41 | #include <sys/stat.h> |
| 42 | |
| 43 | #include <sys/ucred.h> |
| 44 | #include <sys/user.h> |
| 45 | #include <sys/sysctl.h> |
| 46 | #include <sys/rtprio.h> |
| 47 | #include <vm/vm.h> |
| 48 | |
| 49 | #include <err.h> |
| 50 | #include <langinfo.h> |
| 51 | #include <locale.h> |
| 52 | #include <math.h> |
| 53 | #include <nlist.h> |
| 54 | #include <pwd.h> |
| 55 | #include <stddef.h> |
| 56 | #include <stdio.h> |
| 57 | #include <stdlib.h> |
| 58 | #include <unistd.h> |
| 59 | #include <string.h> |
| 60 | #include <vis.h> |
| 61 | |
| 62 | #include "ps.h" |
| 63 | |
| 64 | static const char *make_printable(const char *str); |
| 65 | |
| 66 | void |
| 67 | printheader(void) |
| 68 | { |
| 69 | const VAR *v; |
| 70 | struct varent *vent; |
| 71 | int allempty; |
| 72 | |
| 73 | allempty = 1; |
| 74 | STAILQ_FOREACH(vent, &var_head, link) { |
| 75 | if (*vent->header != '\0') { |
| 76 | allempty = 0; |
| 77 | break; |
| 78 | } |
| 79 | } |
| 80 | if (allempty) |
| 81 | return; |
| 82 | STAILQ_FOREACH(vent, &var_head, link) { |
| 83 | v = vent->var; |
| 84 | if (v->flag & LJUST) { |
| 85 | if (STAILQ_NEXT(vent, link) == NULL) /* last one */ |
| 86 | printf("%s", vent->header); |
| 87 | else |
| 88 | printf("%-*s", vent->width, vent->header); |
| 89 | } else |
| 90 | printf("%*s", vent->width, vent->header); |
| 91 | if (STAILQ_NEXT(vent, link) != NULL) |
| 92 | putchar(' '); |
| 93 | } |
| 94 | putchar('\n'); |
| 95 | } |
| 96 | |
| 97 | void |
| 98 | command(const KINFO *k, const struct varent *vent) |
| 99 | { |
| 100 | const VAR *v; |
| 101 | int left; |
| 102 | char *cp, *vis_env, *vis_args; |
| 103 | |
| 104 | v = vent->var; |
| 105 | |
| 106 | if (cflag) { |
| 107 | /* Don't pad the last field. */ |
| 108 | if (STAILQ_NEXT(vent, link) == NULL) |
| 109 | printf("%s", make_printable(KI_PROC(k, comm))); |
| 110 | else |
| 111 | printf("%-*s", vent->width, |
| 112 | make_printable(KI_PROC(k, comm))); |
| 113 | return; |
| 114 | } |
| 115 | |
| 116 | if ((vis_args = malloc(strlen(k->ki_args) * 4 + 1)) == NULL) |
| 117 | err(1, NULL); |
| 118 | strvis(vis_args, k->ki_args, VIS_TAB | VIS_NL | VIS_NOSLASH); |
| 119 | if (k->ki_env) { |
| 120 | if ((vis_env = malloc(strlen(k->ki_env) * 4 + 1)) == NULL) |
| 121 | err(1, NULL); |
| 122 | strvis(vis_env, k->ki_env, VIS_TAB | VIS_NL | VIS_NOSLASH); |
| 123 | } else |
| 124 | vis_env = NULL; |
| 125 | |
| 126 | if (STAILQ_NEXT(vent, link) == NULL) { |
| 127 | /* last field */ |
| 128 | if (termwidth == UNLIMITED) { |
| 129 | if (vis_env) |
| 130 | printf("%s ", vis_env); |
| 131 | printf("%s", vis_args); |
| 132 | } else { |
| 133 | left = termwidth - (totwidth - vent->width); |
| 134 | if (left < 1) /* already wrapped, just use std width */ |
| 135 | left = vent->width; |
| 136 | if ((cp = vis_env) != NULL) { |
| 137 | while (--left >= 0 && *cp) |
| 138 | putchar(*cp++); |
| 139 | if (--left >= 0) |
| 140 | putchar(' '); |
| 141 | } |
| 142 | for (cp = vis_args; --left >= 0 && *cp != '\0';) |
| 143 | putchar(*cp++); |
| 144 | } |
| 145 | } else |
| 146 | /* XXX env? */ |
| 147 | printf("%-*.*s", vent->width, vent->width, vis_args); |
| 148 | free(vis_args); |
| 149 | if (vis_env != NULL) |
| 150 | free(vis_env); |
| 151 | } |
| 152 | |
| 153 | void |
| 154 | ucomm(const KINFO *k, const struct varent *vent) |
| 155 | { |
| 156 | printf("%-*s", vent->width, make_printable(KI_PROC(k, comm))); |
| 157 | } |
| 158 | |
| 159 | void |
| 160 | logname(const KINFO *k, const struct varent *vent) |
| 161 | { |
| 162 | const char *s = KI_PROC(k, login); |
| 163 | |
| 164 | printf("%-*s", vent->width, *s != '\0' ? s : "-"); |
| 165 | } |
| 166 | |
| 167 | void |
| 168 | state(const KINFO *k, const struct varent *vent) |
| 169 | { |
| 170 | int flag; |
| 171 | char *cp; |
| 172 | char buf[16]; |
| 173 | |
| 174 | flag = KI_PROC(k, flags); |
| 175 | cp = buf; |
| 176 | |
| 177 | switch (KI_PROC(k, stat)) { |
| 178 | |
| 179 | case SSTOP: |
| 180 | *cp = 'T'; |
| 181 | break; |
| 182 | |
| 183 | case SACTIVE: |
| 184 | switch (KI_LWP(k, stat)) { |
| 185 | case LSSLEEP: |
| 186 | if (KI_LWP(k, flags) & LWP_SINTR) { |
| 187 | /* interruptable wait short/long */ |
| 188 | *cp = KI_LWP(k, slptime) >= MAXSLP ? 'I' : 'S'; |
| 189 | } |
| 190 | else if (KI_LWP(k, tdflags) & TDF_SINTR) |
| 191 | *cp = 'S'; /* interruptable lwkt wait */ |
| 192 | else if (KI_PROC(k, paddr)) |
| 193 | *cp = 'D'; /* uninterruptable wait */ |
| 194 | else |
| 195 | *cp = 'B'; /* uninterruptable lwkt wait */ |
| 196 | break; |
| 197 | |
| 198 | case LSRUN: |
| 199 | *cp = 'R'; |
| 200 | if (KI_LWP(k, tdflags) & TDF_RUNNING) { |
| 201 | ++cp; |
| 202 | sprintf(cp, "%d", KI_LWP(k, cpuid)); |
| 203 | while (cp[1]) |
| 204 | ++cp; |
| 205 | } |
| 206 | break; |
| 207 | |
| 208 | case LSSTOP: |
| 209 | /* shouldn't happen anyways */ |
| 210 | *cp = 'T'; |
| 211 | break; |
| 212 | } |
| 213 | break; |
| 214 | |
| 215 | case SZOMB: |
| 216 | *cp = 'Z'; |
| 217 | break; |
| 218 | |
| 219 | default: |
| 220 | *cp = '?'; |
| 221 | } |
| 222 | |
| 223 | cp++; |
| 224 | if (flag & P_SWAPPEDOUT) |
| 225 | *cp++ = 'W'; |
| 226 | if (KI_PROC(k, nice) < NZERO) |
| 227 | *cp++ = '<'; |
| 228 | else if (KI_PROC(k, nice) > NZERO) |
| 229 | *cp++ = 'N'; |
| 230 | if (flag & P_TRACED) |
| 231 | *cp++ = 'X'; |
| 232 | if (flag & P_WEXIT && KI_PROC(k, stat) != SZOMB) |
| 233 | *cp++ = 'E'; |
| 234 | if (flag & P_PPWAIT) |
| 235 | *cp++ = 'V'; |
| 236 | if ((flag & P_SYSTEM) || KI_PROC(k, lock) > 0) |
| 237 | *cp++ = 'L'; |
| 238 | if (numcpus > 1 && KI_LWP(k, mpcount) == 0) |
| 239 | *cp++ = 'M'; |
| 240 | if (flag & P_JAILED) |
| 241 | *cp++ = 'J'; |
| 242 | if (KI_PROC(k, auxflags) & KI_SLEADER) |
| 243 | *cp++ = 's'; |
| 244 | if ((flag & P_CONTROLT) && KI_PROC(k, pgid) == KI_PROC(k, tpgid)) |
| 245 | *cp++ = '+'; |
| 246 | *cp = '\0'; |
| 247 | printf("%-*s", vent->width, buf); |
| 248 | } |
| 249 | |
| 250 | /* |
| 251 | * Normalized priority (lower is better). For pure threads |
| 252 | * output a negated LWKT priority (so lower still means better). |
| 253 | * |
| 254 | * XXX bsd4 scheduler specific. |
| 255 | */ |
| 256 | void |
| 257 | pri(const KINFO *k, const struct varent *vent) |
| 258 | { |
| 259 | if (KI_LWP(k, pid) != -1) |
| 260 | printf("%*d", vent->width, KI_LWP(k, prio)); |
| 261 | else |
| 262 | printf("%*d", vent->width, -(KI_LWP(k, tdprio) & TDPRI_MASK)); |
| 263 | } |
| 264 | |
| 265 | void |
| 266 | tdpri(const KINFO *k, const struct varent *vent) |
| 267 | { |
| 268 | char buf[32]; |
| 269 | int val = KI_LWP(k, tdprio); |
| 270 | |
| 271 | snprintf(buf, sizeof(buf), "%02d/%d", val & TDPRI_MASK, val / TDPRI_CRIT); |
| 272 | printf("%*s", vent->width, buf); |
| 273 | } |
| 274 | |
| 275 | void |
| 276 | uname(const KINFO *k, const struct varent *vent) |
| 277 | { |
| 278 | printf("%-*s", vent->width, |
| 279 | user_from_uid(KI_PROC(k, uid), 0)); |
| 280 | } |
| 281 | |
| 282 | int |
| 283 | s_uname(const KINFO *k) |
| 284 | { |
| 285 | return (strlen(user_from_uid(KI_PROC(k, uid), 0))); |
| 286 | } |
| 287 | |
| 288 | void |
| 289 | runame(const KINFO *k, const struct varent *vent) |
| 290 | { |
| 291 | printf("%-*s", vent->width, |
| 292 | user_from_uid(KI_PROC(k, ruid), 0)); |
| 293 | } |
| 294 | |
| 295 | int |
| 296 | s_runame(const KINFO *k) |
| 297 | { |
| 298 | return (strlen(user_from_uid(KI_PROC(k, ruid), 0))); |
| 299 | } |
| 300 | |
| 301 | void |
| 302 | tdev(const KINFO *k, const struct varent *vent) |
| 303 | { |
| 304 | dev_t dev; |
| 305 | char buff[16]; |
| 306 | |
| 307 | dev = KI_PROC(k, tdev); |
| 308 | if (dev == NODEV) |
| 309 | printf("%*s", vent->width, "??"); |
| 310 | else { |
| 311 | snprintf(buff, sizeof(buff), "%d/%d", major(dev), minor(dev)); |
| 312 | printf("%*s", vent->width, buff); |
| 313 | } |
| 314 | } |
| 315 | |
| 316 | void |
| 317 | tname(const KINFO *k, const struct varent *vent) |
| 318 | { |
| 319 | dev_t dev; |
| 320 | const char *ttname; |
| 321 | |
| 322 | dev = KI_PROC(k, tdev); |
| 323 | if (dev == NODEV || (ttname = devname(dev, S_IFCHR)) == NULL) |
| 324 | printf("%*s ", vent->width-1, "??"); |
| 325 | else { |
| 326 | if (strncmp(ttname, "tty", 3) == 0 || |
| 327 | strncmp(ttname, "cua", 3) == 0) |
| 328 | ttname += 3; |
| 329 | printf("%*.*s%c", vent->width-1, vent->width-1, ttname, |
| 330 | KI_PROC(k, auxflags) & KI_CTTY ? ' ' : '-'); |
| 331 | } |
| 332 | } |
| 333 | |
| 334 | void |
| 335 | longtname(const KINFO *k, const struct varent *vent) |
| 336 | { |
| 337 | dev_t dev; |
| 338 | const char *ttname; |
| 339 | |
| 340 | dev = KI_PROC(k, tdev); |
| 341 | if (dev == NODEV || (ttname = devname(dev, S_IFCHR)) == NULL) |
| 342 | printf("%-*s", vent->width, "??"); |
| 343 | else |
| 344 | printf("%-*s", vent->width, ttname); |
| 345 | } |
| 346 | |
| 347 | void |
| 348 | started(const KINFO *k, const struct varent *vent) |
| 349 | { |
| 350 | static time_t now; |
| 351 | time_t then; |
| 352 | struct tm *tp; |
| 353 | char buf[100]; |
| 354 | static int use_ampm = -1; |
| 355 | |
| 356 | if (use_ampm < 0) |
| 357 | use_ampm = (*nl_langinfo(T_FMT_AMPM) != '\0'); |
| 358 | |
| 359 | then = KI_PROC(k, start).tv_sec; |
| 360 | if (then < btime.tv_sec) { |
| 361 | then = btime.tv_sec; |
| 362 | } |
| 363 | |
| 364 | tp = localtime(&then); |
| 365 | if (!now) |
| 366 | time(&now); |
| 367 | if (now - then < 24 * 3600) { |
| 368 | strftime(buf, sizeof(buf) - 1, |
| 369 | use_ampm ? "%l:%M%p" : "%k:%M ", tp); |
| 370 | } else if (now - then < 7 * 86400) { |
| 371 | strftime(buf, sizeof(buf) - 1, |
| 372 | use_ampm ? "%a%I%p" : "%a%H ", tp); |
| 373 | } else |
| 374 | strftime(buf, sizeof(buf) - 1, "%e%b%y", tp); |
| 375 | printf("%-*s", vent->width, buf); |
| 376 | } |
| 377 | |
| 378 | void |
| 379 | lstarted(const KINFO *k, const struct varent *vent) |
| 380 | { |
| 381 | time_t then; |
| 382 | char buf[100]; |
| 383 | |
| 384 | then = KI_PROC(k, start).tv_sec; |
| 385 | strftime(buf, sizeof(buf) -1, "%c", localtime(&then)); |
| 386 | printf("%-*s", vent->width, buf); |
| 387 | } |
| 388 | |
| 389 | void |
| 390 | wchan(const KINFO *k, const struct varent *vent) |
| 391 | { |
| 392 | if (*KI_LWP(k, wmesg)) { |
| 393 | printf("%-*.*s", vent->width, vent->width, |
| 394 | KI_LWP(k, wmesg)); |
| 395 | } else { |
| 396 | printf("%-*s", vent->width, "-"); |
| 397 | } |
| 398 | } |
| 399 | |
| 400 | #ifndef pgtok |
| 401 | #define pgtok(a) (((a)*getpagesize())/1024) |
| 402 | #endif |
| 403 | |
| 404 | void |
| 405 | vsize(const KINFO *k, const struct varent *vent) |
| 406 | { |
| 407 | printf("%*ju", vent->width, (uintmax_t)(KI_PROC(k, vm_map_size)/1024)); |
| 408 | } |
| 409 | |
| 410 | void |
| 411 | rssize(const KINFO *k, const struct varent *vent) |
| 412 | { |
| 413 | /* XXX don't have info about shared */ |
| 414 | printf("%*lu", vent->width, (u_long)pgtok(KI_PROC(k, vm_rssize))); |
| 415 | } |
| 416 | |
| 417 | void |
| 418 | p_rssize(const KINFO *k, const struct varent *vent) /* doesn't account for text */ |
| 419 | { |
| 420 | printf("%*ld", vent->width, (long)pgtok(KI_PROC(k, vm_rssize))); |
| 421 | } |
| 422 | |
| 423 | void |
| 424 | cputime(const KINFO *k, const struct varent *vent) |
| 425 | { |
| 426 | long secs; |
| 427 | long psecs; /* "parts" of a second. first micro, then centi */ |
| 428 | u_int64_t timeus; |
| 429 | char obuff[128]; |
| 430 | static char decimal_point = '\0'; |
| 431 | |
| 432 | if (decimal_point == '\0') |
| 433 | decimal_point = localeconv()->decimal_point[0]; |
| 434 | |
| 435 | /* |
| 436 | * This counts time spent handling interrupts. We could |
| 437 | * fix this, but it is not 100% trivial (and interrupt |
| 438 | * time fractions only work on the sparc anyway). XXX |
| 439 | */ |
| 440 | timeus = KI_LWP(k, uticks) + KI_LWP(k, sticks) + |
| 441 | KI_LWP(k, iticks); |
| 442 | secs = timeus / 1000000; |
| 443 | psecs = timeus % 1000000; |
| 444 | if (sumrusage) { |
| 445 | secs += KI_PROC(k, cru).ru_utime.tv_sec + |
| 446 | KI_PROC(k, cru).ru_stime.tv_sec; |
| 447 | psecs += KI_PROC(k, cru).ru_utime.tv_usec + |
| 448 | KI_PROC(k, cru).ru_stime.tv_usec; |
| 449 | } |
| 450 | /* |
| 451 | * round and scale to 100's |
| 452 | */ |
| 453 | psecs = (psecs + 5000) / 10000; |
| 454 | secs += psecs / 100; |
| 455 | psecs = psecs % 100; |
| 456 | snprintf(obuff, sizeof(obuff), |
| 457 | "%3ld:%02ld%c%02ld", secs/60, secs%60, decimal_point, psecs); |
| 458 | printf("%*s", vent->width, obuff); |
| 459 | } |
| 460 | |
| 461 | double |
| 462 | getpcpu(const KINFO *k) |
| 463 | { |
| 464 | static int failure; |
| 465 | |
| 466 | if (!nlistread) |
| 467 | failure = donlist(); |
| 468 | if (failure) |
| 469 | return (0.0); |
| 470 | |
| 471 | #define fxtofl(fixpt) ((double)(fixpt) / fscale) |
| 472 | |
| 473 | /* XXX - I don't like this */ |
| 474 | if (KI_PROC(k, swtime) == 0 || (KI_PROC(k, flags) & P_SWAPPEDOUT)) |
| 475 | return (0.0); |
| 476 | if (rawcpu) |
| 477 | return (100.0 * fxtofl(KI_LWP(k, pctcpu))); |
| 478 | return (100.0 * fxtofl(KI_LWP(k, pctcpu)) / |
| 479 | (1.0 - exp(KI_PROC(k, swtime) * log(fxtofl(ccpu))))); |
| 480 | } |
| 481 | |
| 482 | void |
| 483 | pcpu(const KINFO *k, const struct varent *vent) |
| 484 | { |
| 485 | printf("%*.1f", vent->width, getpcpu(k)); |
| 486 | } |
| 487 | |
| 488 | void |
| 489 | pnice(const KINFO *k, const struct varent *vent) |
| 490 | { |
| 491 | int niceval; |
| 492 | |
| 493 | switch (KI_LWP(k, rtprio).type) { |
| 494 | case RTP_PRIO_REALTIME: |
| 495 | niceval = PRIO_MIN - 1 - RTP_PRIO_MAX + KI_LWP(k, rtprio).prio; |
| 496 | break; |
| 497 | case RTP_PRIO_IDLE: |
| 498 | niceval = PRIO_MAX + 1 + KI_LWP(k, rtprio).prio; |
| 499 | break; |
| 500 | case RTP_PRIO_THREAD: |
| 501 | niceval = PRIO_MIN - 1 - RTP_PRIO_MAX - KI_LWP(k, rtprio).prio; |
| 502 | break; |
| 503 | default: |
| 504 | niceval = KI_PROC(k, nice) - NZERO; |
| 505 | break; |
| 506 | } |
| 507 | printf("%*d", vent->width, niceval); |
| 508 | } |
| 509 | |
| 510 | |
| 511 | double |
| 512 | getpmem(const KINFO *k) |
| 513 | { |
| 514 | static int failure; |
| 515 | double fracmem; |
| 516 | int szptudot; |
| 517 | |
| 518 | if (!nlistread) |
| 519 | failure = donlist(); |
| 520 | if (failure) |
| 521 | return (0.0); |
| 522 | |
| 523 | if (KI_PROC(k, flags) & P_SWAPPEDOUT) |
| 524 | return (0.0); |
| 525 | /* XXX want pmap ptpages, segtab, etc. (per architecture) */ |
| 526 | szptudot = UPAGES; |
| 527 | /* XXX don't have info about shared */ |
| 528 | fracmem = ((float)KI_PROC(k, vm_rssize) + szptudot)/mempages; |
| 529 | return (100.0 * fracmem); |
| 530 | } |
| 531 | |
| 532 | void |
| 533 | pmem(const KINFO *k, const struct varent *vent) |
| 534 | { |
| 535 | printf("%*.1f", vent->width, getpmem(k)); |
| 536 | } |
| 537 | |
| 538 | void |
| 539 | pagein(const KINFO *k, const struct varent *vent) |
| 540 | { |
| 541 | printf("%*ld", vent->width, KI_LWP(k, ru).ru_majflt); |
| 542 | } |
| 543 | |
| 544 | /* ARGSUSED */ |
| 545 | void |
| 546 | maxrss(const KINFO *k __unused, const struct varent *vent) |
| 547 | { |
| 548 | printf("%*ld", vent->width, KI_PROC(k, ru).ru_maxrss); |
| 549 | } |
| 550 | |
| 551 | void |
| 552 | tsize(const KINFO *k, const struct varent *vent) |
| 553 | { |
| 554 | printf("%*ld", vent->width, (long)pgtok(KI_PROC(k, vm_tsize))); |
| 555 | } |
| 556 | |
| 557 | void |
| 558 | rtprior(const KINFO *k, const struct varent *vent) |
| 559 | { |
| 560 | struct rtprio *prtp; |
| 561 | char str[8]; |
| 562 | unsigned prio, type; |
| 563 | |
| 564 | prtp = &KI_LWP(k, rtprio); |
| 565 | prio = prtp->prio; |
| 566 | type = prtp->type; |
| 567 | switch (type) { |
| 568 | case RTP_PRIO_REALTIME: |
| 569 | snprintf(str, sizeof(str), "real:%u", prio); |
| 570 | break; |
| 571 | case RTP_PRIO_NORMAL: |
| 572 | strncpy(str, "normal", sizeof(str)); |
| 573 | break; |
| 574 | case RTP_PRIO_IDLE: |
| 575 | snprintf(str, sizeof(str), "idle:%u", prio); |
| 576 | break; |
| 577 | default: |
| 578 | snprintf(str, sizeof(str), "%u:%u", type, prio); |
| 579 | break; |
| 580 | } |
| 581 | str[sizeof(str) - 1] = '\0'; |
| 582 | printf("%*s", vent->width, str); |
| 583 | } |
| 584 | |
| 585 | /* |
| 586 | * Generic output routines. Print fields from various prototype |
| 587 | * structures. |
| 588 | */ |
| 589 | static void |
| 590 | printval(const char *bp, const struct varent *vent) |
| 591 | { |
| 592 | static char ofmt[32] = "%"; |
| 593 | const char *fcp; |
| 594 | char *cp; |
| 595 | |
| 596 | cp = ofmt + 1; |
| 597 | fcp = vent->var->fmt; |
| 598 | if (vent->var->flag & LJUST) |
| 599 | *cp++ = '-'; |
| 600 | *cp++ = '*'; |
| 601 | while ((*cp++ = *fcp++)); |
| 602 | |
| 603 | switch (vent->var->type) { |
| 604 | case CHAR: |
| 605 | printf(ofmt, vent->width, *(const char *)bp); |
| 606 | break; |
| 607 | case UCHAR: |
| 608 | printf(ofmt, vent->width, *(const u_char *)bp); |
| 609 | break; |
| 610 | case SHORT: |
| 611 | printf(ofmt, vent->width, *(const short *)bp); |
| 612 | break; |
| 613 | case USHORT: |
| 614 | printf(ofmt, vent->width, *(const u_short *)bp); |
| 615 | break; |
| 616 | case INT: |
| 617 | printf(ofmt, vent->width, *(const int *)bp); |
| 618 | break; |
| 619 | case UINT: |
| 620 | printf(ofmt, vent->width, *(const u_int *)bp); |
| 621 | break; |
| 622 | case LONG: |
| 623 | printf(ofmt, vent->width, *(const long *)bp); |
| 624 | break; |
| 625 | case ULONG: |
| 626 | printf(ofmt, vent->width, *(const u_long *)bp); |
| 627 | break; |
| 628 | case KPTR: |
| 629 | printf(ofmt, vent->width, *(const u_long *)bp); |
| 630 | break; |
| 631 | default: |
| 632 | errx(1, "unknown type %d", vent->var->type); |
| 633 | } |
| 634 | } |
| 635 | |
| 636 | void |
| 637 | pvar(const KINFO *k, const struct varent *vent) |
| 638 | { |
| 639 | printval((char *)((char *)k->ki_proc + vent->var->off), vent); |
| 640 | } |
| 641 | |
| 642 | void |
| 643 | lpest(const KINFO *k, const struct varent *vent) |
| 644 | { |
| 645 | int val; |
| 646 | |
| 647 | val = *(int *)((char *)&k->ki_proc->kp_lwp + vent->var->off); |
| 648 | val = val / 128; |
| 649 | printval((char *)&val, vent); |
| 650 | } |
| 651 | |
| 652 | |
| 653 | void |
| 654 | lpvar(const KINFO *k, const struct varent *vent) |
| 655 | { |
| 656 | printval((char *)((char *)&k->ki_proc->kp_lwp + vent->var->off), vent); |
| 657 | } |
| 658 | |
| 659 | void |
| 660 | rvar(const KINFO *k, const struct varent *vent) |
| 661 | { |
| 662 | printval(((const char *)&KI_LWP(k, ru) + vent->var->off), vent); |
| 663 | } |
| 664 | |
| 665 | static const char * |
| 666 | make_printable(const char *str) |
| 667 | { |
| 668 | static char *cpy; |
| 669 | int len; |
| 670 | |
| 671 | if (cpy) |
| 672 | free(cpy); |
| 673 | len = strlen(str); |
| 674 | if ((cpy = malloc(len * 4 + 1)) == NULL) |
| 675 | err(1, NULL); |
| 676 | strvis(cpy, str, VIS_TAB | VIS_NL | VIS_NOSLASH); |
| 677 | return(cpy); |
| 678 | } |