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.20 2006/12/23 00:27:02 swildner 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 db_dump_td_tokens(thread_t td); 44 45 void 46 db_ps(db_expr_t dummy1, boolean_t dummy2, db_expr_t dummy3, char *dummy4) 47 { 48 int np; 49 int cpuidx; 50 int nl = 0; 51 volatile struct proc *p, *pp; 52 53 np = nprocs; 54 55 if (allproc.lh_first != NULL) 56 p = allproc.lh_first; 57 else 58 p = &proc0; 59 60 if (db_more(&nl) < 0) 61 return; 62 db_printf(" pid proc uid ppid pgrp flag stat wmesg wchan cmd\n"); 63 while (--np >= 0) { 64 /* 65 * XXX just take 20 for now... 66 */ 67 if (db_more(&nl) < 0) 68 return; 69 if (p == NULL) { 70 kprintf("oops, ran out of processes early!\n"); 71 break; 72 } 73 pp = p->p_pptr; 74 if (pp == NULL) 75 pp = p; 76 77 db_printf("%5d %8p %4d %5d %5d %06x %d", 78 p->p_pid, (volatile void *)p, 79 p->p_ucred ? p->p_ucred->cr_ruid : 0, pp->p_pid, 80 p->p_pgrp ? p->p_pgrp->pg_id : 0, p->p_flag, p->p_stat); 81 if (p->p_wchan) { 82 db_printf(" %6s %8p", p->p_wmesg, (void *)p->p_wchan); 83 } else { 84 db_printf(" "); 85 } 86 db_printf(" %s\n", p->p_comm ? p->p_comm : ""); 87 88 p = p->p_list.le_next; 89 if (p == NULL && np > 0) 90 p = zombproc.lh_first; 91 } 92 93 /* 94 * Dump running threads 95 */ 96 for (cpuidx = 0; cpuidx < ncpus; ++cpuidx) { 97 struct globaldata *gd = &CPU_prvspace[cpuidx].mdglobaldata.mi; 98 thread_t td; 99 int j; 100 101 if (db_more(&nl) < 0) 102 return; 103 db_printf("cpu %d tdrunqmask %08x curthread %p reqflags %04x\n", 104 gd->gd_cpuid, gd->gd_runqmask, 105 gd->gd_curthread, gd->gd_reqflags); 106 if (gd->gd_curthread && gd->gd_curthread->td_preempted) { 107 db_printf(" PREEMPTING THREAD %p\n", 108 gd->gd_curthread->td_preempted); 109 } 110 111 if (db_more(&nl) < 0) 112 return; 113 db_printf(" INCOMMING IPIQS:"); 114 for (j = 0; j < ncpus; ++j) { 115 lwkt_ipiq_t ip = globaldata_find(j)->gd_ipiq; 116 if (ip != NULL) { 117 ip = &ip[cpuidx]; 118 if (ip->ip_windex != ip->ip_rindex) 119 db_printf(" cpu%d:%d", j, ip->ip_windex - ip->ip_rindex); 120 } 121 } 122 db_printf("\n"); 123 124 if (db_more(&nl) < 0) 125 return; 126 db_printf(" tdq thread pid flags pri/cs/mp sp wmesg comm\n"); 127 for (np = 0; np < 32; ++np) { 128 TAILQ_FOREACH(td, &gd->gd_tdrunq[np], td_threadq) { 129 if (db_more(&nl) < 0) 130 return; 131 db_printf(" %3d %p %3d %08x %2d/%02d/%02d %p %8.8s %s\n", 132 np, td, 133 (td->td_proc ? td->td_proc->p_pid : -1), 134 td->td_flags, 135 td->td_pri & TDPRI_MASK, 136 td->td_pri / TDPRI_CRIT, 137 #ifdef SMP 138 td->td_mpcount, 139 #else 140 0, 141 #endif 142 td->td_sp, 143 td->td_wmesg ? td->td_wmesg : "-", 144 td->td_proc ? td->td_proc->p_comm : td->td_comm); 145 if (td->td_preempted) 146 db_printf(" PREEMPTING THREAD %p\n", td->td_preempted); 147 db_dump_td_tokens(td); 148 } 149 } 150 if (db_more(&nl) < 0) 151 return; 152 db_printf("\n"); 153 if (db_more(&nl) < 0) 154 return; 155 db_printf(" tdq thread pid flags pri/cs/mp sp wmesg comm\n"); 156 TAILQ_FOREACH(td, &gd->gd_tdallq, td_allq) { 157 if (db_more(&nl) < 0) 158 return; 159 db_printf(" %3d %p %3d %08x %2d/%02d/%02d %p %8.8s %s\n", 160 np, td, 161 (td->td_proc ? td->td_proc->p_pid : -1), 162 td->td_flags, 163 td->td_pri & TDPRI_MASK, 164 td->td_pri / TDPRI_CRIT, 165 #ifdef SMP 166 td->td_mpcount, 167 #else 168 0, 169 #endif 170 td->td_sp, 171 td->td_wmesg ? td->td_wmesg : "-", 172 td->td_proc ? td->td_proc->p_comm : td->td_comm); 173 db_dump_td_tokens(td); 174 } 175 } 176 if (db_more(&nl) < 0) 177 return; 178 db_printf("CURCPU %d CURTHREAD %p (%d)\n", 179 mycpu->gd_cpuid, 180 curthread, 181 (curthread->td_proc ? curthread->td_proc->p_pid : -1)); 182 db_dump_td_tokens(curthread); 183 } 184 185 static void 186 db_dump_td_tokens(thread_t td) 187 { 188 lwkt_tokref_t ref; 189 lwkt_token_t tok; 190 191 if (td->td_toks == NULL) 192 return; 193 db_printf(" TOKENS:"); 194 for (ref = td->td_toks; ref; ref = ref->tr_next) { 195 tok = ref->tr_tok; 196 197 db_printf(" %p[tok=%p", ref, ref->tr_tok); 198 #ifdef SMP 199 if (td == tok->t_owner) 200 db_printf(",held"); 201 #endif 202 db_printf("]"); 203 } 204 db_printf("\n"); 205 } 206 207