| 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.8 2003/07/12 17:54:30 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 | static void |
| 44 | db_more(int *nl) |
| 45 | { |
| 46 | ++*nl; |
| 47 | if (*nl == 20) { |
| 48 | int c; |
| 49 | |
| 50 | db_printf("--More--"); |
| 51 | c = cngetc(); |
| 52 | db_printf("\r"); |
| 53 | /* |
| 54 | * A whole screenfull or just one line? |
| 55 | */ |
| 56 | switch (c) { |
| 57 | case '\n': /* just one line */ |
| 58 | *nl = 19; |
| 59 | break; |
| 60 | case ' ': |
| 61 | *nl = 0; /* another screenfull */ |
| 62 | break; |
| 63 | default: /* exit */ |
| 64 | db_printf("\n"); |
| 65 | return; |
| 66 | } |
| 67 | } |
| 68 | } |
| 69 | |
| 70 | void |
| 71 | db_ps(dummy1, dummy2, dummy3, dummy4) |
| 72 | db_expr_t dummy1; |
| 73 | boolean_t dummy2; |
| 74 | db_expr_t dummy3; |
| 75 | char * dummy4; |
| 76 | { |
| 77 | int np; |
| 78 | int cpuidx; |
| 79 | int nl = 0; |
| 80 | volatile struct proc *p, *pp; |
| 81 | |
| 82 | np = nprocs; |
| 83 | |
| 84 | if (allproc.lh_first != NULL) |
| 85 | p = allproc.lh_first; |
| 86 | else |
| 87 | p = &proc0; |
| 88 | |
| 89 | db_printf(" pid proc addr uid ppid pgrp flag stat wmesg wchan cmd\n"); |
| 90 | while (--np >= 0) { |
| 91 | /* |
| 92 | * XXX just take 20 for now... |
| 93 | */ |
| 94 | db_more(&nl); |
| 95 | if (p == NULL) { |
| 96 | printf("oops, ran out of processes early!\n"); |
| 97 | break; |
| 98 | } |
| 99 | pp = p->p_pptr; |
| 100 | if (pp == NULL) |
| 101 | pp = p; |
| 102 | |
| 103 | db_printf("%5d %8p %8p %4d %5d %5d %06x %d", |
| 104 | p->p_pid, (volatile void *)p, (void *)p->p_thread->td_pcb, |
| 105 | p->p_ucred ? p->p_ucred->cr_ruid : 0, pp->p_pid, |
| 106 | p->p_pgrp ? p->p_pgrp->pg_id : 0, p->p_flag, p->p_stat); |
| 107 | if (p->p_wchan) { |
| 108 | db_printf(" %6s %8p", p->p_wmesg, (void *)p->p_wchan); |
| 109 | } else { |
| 110 | db_printf(" "); |
| 111 | } |
| 112 | db_printf(" %s\n", p->p_comm ? p->p_comm : ""); |
| 113 | |
| 114 | p = p->p_list.le_next; |
| 115 | if (p == NULL && np > 0) |
| 116 | p = zombproc.lh_first; |
| 117 | } |
| 118 | |
| 119 | /* |
| 120 | * Dump running threads |
| 121 | */ |
| 122 | for (cpuidx = 0; cpuidx < ncpus; ++cpuidx) { |
| 123 | thread_t td; |
| 124 | struct globaldata *gd = &CPU_prvspace[cpuidx].mdglobaldata.mi; |
| 125 | |
| 126 | db_printf("cpu %d tdrunqmask %08x curthread %p reqflags %04x\n", |
| 127 | gd->gd_cpuid, gd->gd_runqmask, |
| 128 | gd->gd_curthread, gd->gd_reqflags); |
| 129 | db_printf(" tdq thread pid flags pri(act) sp wmesg comm\n"); |
| 130 | for (np = 0; np < 32; ++np) { |
| 131 | TAILQ_FOREACH(td, &gd->gd_tdrunq[np], td_threadq) { |
| 132 | db_more(&nl); |
| 133 | db_printf(" %3d %p %3d %08x %3d(%3d) %p %8.8s %s\n", |
| 134 | np, td, |
| 135 | (td->td_proc ? td->td_proc->p_pid : -1), |
| 136 | td->td_flags, td->td_pri, |
| 137 | td->td_pri & TDPRI_MASK, |
| 138 | td->td_sp, |
| 139 | td->td_wmesg ? td->td_wmesg : "-", |
| 140 | td->td_proc ? td->td_proc->p_comm : td->td_comm); |
| 141 | } |
| 142 | } |
| 143 | db_printf("\n"); |
| 144 | db_printf(" tdq thread pid flags pri(act) sp wmesg comm\n"); |
| 145 | TAILQ_FOREACH(td, &gd->gd_tdallq, td_allq) { |
| 146 | db_more(&nl); |
| 147 | db_printf(" %3d %p %3d %08x %3d(%3d) %p %8.8s %s\n", |
| 148 | np, td, |
| 149 | (td->td_proc ? td->td_proc->p_pid : -1), |
| 150 | td->td_flags, td->td_pri, |
| 151 | td->td_pri & TDPRI_MASK, |
| 152 | td->td_sp, |
| 153 | td->td_wmesg ? td->td_wmesg : "-", |
| 154 | td->td_proc ? td->td_proc->p_comm : td->td_comm); |
| 155 | } |
| 156 | } |
| 157 | printf("CURCPU %d CURTHREAD %p (%d)\n", |
| 158 | mycpu->gd_cpuid, |
| 159 | curthread, |
| 160 | (curthread->td_proc ? curthread->td_proc->p_pid : -1) |
| 161 | ); |
| 162 | } |