| 1 | /*- |
| 2 | * Copyright (c) 1993 The Regents of the University of California. |
| 3 | * 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 | * $FreeBSD: src/sys/ddb/db_ps.c,v 1.20 1999/08/28 00:41:09 peter Exp $ |
| 34 | * $DragonFly: src/sys/ddb/db_ps.c,v 1.4 2003/06/23 17:55:27 dillon Exp $ |
| 35 | */ |
| 36 | #include <sys/param.h> |
| 37 | #include <sys/systm.h> |
| 38 | #include <sys/proc.h> |
| 39 | #include <sys/cons.h> |
| 40 | |
| 41 | #include <ddb/ddb.h> |
| 42 | |
| 43 | void |
| 44 | db_ps(dummy1, dummy2, dummy3, dummy4) |
| 45 | db_expr_t dummy1; |
| 46 | boolean_t dummy2; |
| 47 | db_expr_t dummy3; |
| 48 | char * dummy4; |
| 49 | { |
| 50 | int np; |
| 51 | int nl = 0; |
| 52 | volatile struct proc *p, *pp; |
| 53 | |
| 54 | np = nprocs; |
| 55 | |
| 56 | if (allproc.lh_first != NULL) |
| 57 | p = allproc.lh_first; |
| 58 | else |
| 59 | p = &proc0; |
| 60 | |
| 61 | db_printf(" pid proc addr uid ppid pgrp flag stat wmesg wchan cmd\n"); |
| 62 | while (--np >= 0) { |
| 63 | /* |
| 64 | * XXX just take 20 for now... |
| 65 | */ |
| 66 | if (nl++ == 20) { |
| 67 | int c; |
| 68 | |
| 69 | db_printf("--More--"); |
| 70 | c = cngetc(); |
| 71 | db_printf("\r"); |
| 72 | /* |
| 73 | * A whole screenfull or just one line? |
| 74 | */ |
| 75 | switch (c) { |
| 76 | case '\n': /* just one line */ |
| 77 | nl = 20; |
| 78 | break; |
| 79 | case ' ': |
| 80 | nl = 0; /* another screenfull */ |
| 81 | break; |
| 82 | default: /* exit */ |
| 83 | db_printf("\n"); |
| 84 | return; |
| 85 | } |
| 86 | } |
| 87 | if (p == NULL) { |
| 88 | printf("oops, ran out of processes early!\n"); |
| 89 | break; |
| 90 | } |
| 91 | pp = p->p_pptr; |
| 92 | if (pp == NULL) |
| 93 | pp = p; |
| 94 | |
| 95 | db_printf("%5d %8p %8p %4d %5d %5d %06x %d", |
| 96 | p->p_pid, (volatile void *)p, (void *)p->p_thread->td_pcb, |
| 97 | p->p_ucred ? p->p_ucred->cr_ruid : 0, pp->p_pid, |
| 98 | p->p_pgrp ? p->p_pgrp->pg_id : 0, p->p_flag, p->p_stat); |
| 99 | if (p->p_wchan) { |
| 100 | db_printf(" %6s %8p", p->p_wmesg, (void *)p->p_wchan); |
| 101 | } else { |
| 102 | db_printf(" "); |
| 103 | } |
| 104 | db_printf(" %s\n", p->p_comm ? p->p_comm : ""); |
| 105 | |
| 106 | p = p->p_list.le_next; |
| 107 | if (p == NULL && np > 0) |
| 108 | p = zombproc.lh_first; |
| 109 | } |
| 110 | } |