2 * Copyright (c) 1993 The Regents of the University of California.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #include <sys/cdefs.h>
31 __FBSDID("$FreeBSD$");
33 #include <sys/param.h>
38 #include <sys/sysent.h>
39 #include <sys/systm.h>
40 #include <sys/_kstack_cache.h>
42 #include <vm/vm_param.h>
47 static void dumpthread(volatile struct proc *p, volatile struct thread *td,
50 * At least one non-optional show-command must be implemented using
51 * DB_SHOW_ALL_COMMAND() so that db_show_all_cmd_set gets created.
54 DB_SHOW_ALL_COMMAND(procs, db_procs_cmd)
56 db_ps(addr, have_addr, count, modif);
63 * - single-threaded process
64 * - multi-threaded process
65 * - thread in a MT process
68 * 1234567890123456789012345678901234567890123456789012345678901234567890
69 * pid ppid pgrp uid state wmesg wchan cmd
70 * <pid> <ppi> <pgi> <uid> <stat> < wmesg > < wchan > <name>
71 * <pid> <ppi> <pgi> <uid> <stat> (threaded) <command>
72 * <tid > <stat> < wmesg > < wchan > <name>
74 * For machines with 64-bit pointers, we expand the wchan field 8 more
78 db_ps(db_expr_t addr, boolean_t hasaddr, db_expr_t count, char *modif)
80 volatile struct proc *p, *pp;
81 volatile struct thread *td;
85 int np, rflag, sflag, dflag, lflag, wflag;
89 if (!LIST_EMPTY(&allproc))
90 p = LIST_FIRST(&allproc);
95 db_printf(" pid ppid pgrp uid state wmesg wchan cmd\n");
97 db_printf(" pid ppid pgrp uid state wmesg wchan cmd\n");
99 while (--np >= 0 && !db_pager_quit) {
101 db_printf("oops, ran out of processes early!\n");
110 db_printf("%5d %5d %5d %5d ", p->p_pid, pp->p_pid,
111 pgrp != NULL ? pgrp->pg_id : 0,
112 cred != NULL ? cred->cr_ruid : 0);
114 /* Determine our primary process state. */
115 switch (p->p_state) {
121 * One of D, L, R, S, W. For a
122 * multithreaded process we will use
123 * the state of the thread with the
124 * highest precedence. The
125 * precendence order from high to low
126 * is R, L, D, S, W. If no thread is
127 * in a sane state we use '?' for our
130 rflag = sflag = dflag = lflag = wflag = 0;
131 FOREACH_THREAD_IN_PROC(p, td) {
132 if (td->td_state == TDS_RUNNING ||
133 td->td_state == TDS_RUNQ ||
134 td->td_state == TDS_CAN_RUN)
138 if (TD_IS_SLEEPING(td)) {
139 if (!(td->td_flags & TDF_SINTR))
144 if (TD_AWAITING_INTR(td))
173 /* Additional process state flags. */
174 if (!(p->p_flag & P_INMEM))
175 strlcat(state, "W", sizeof(state));
176 if (p->p_flag & P_TRACED)
177 strlcat(state, "X", sizeof(state));
178 if (p->p_flag & P_WEXIT && p->p_state != PRS_ZOMBIE)
179 strlcat(state, "E", sizeof(state));
180 if (p->p_flag & P_PPWAIT)
181 strlcat(state, "V", sizeof(state));
182 if (p->p_flag & P_SYSTEM || p->p_lock > 0)
183 strlcat(state, "L", sizeof(state));
184 if (p->p_session != NULL && SESS_LEADER(p))
185 strlcat(state, "s", sizeof(state));
186 /* Cheated here and didn't compare pgid's. */
187 if (p->p_flag & P_CONTROLT)
188 strlcat(state, "+", sizeof(state));
189 if (cred != NULL && jailed(cred))
190 strlcat(state, "J", sizeof(state));
191 db_printf(" %-6.6s ", state);
192 if (p->p_flag & P_HADTHREADS) {
194 db_printf(" (threaded) ");
196 db_printf(" (threaded) ");
198 if (p->p_flag & P_SYSTEM)
200 db_printf("%s", p->p_comm);
201 if (p->p_flag & P_SYSTEM)
205 FOREACH_THREAD_IN_PROC(p, td) {
206 dumpthread(p, td, p->p_flag & P_HADTHREADS);
211 p = LIST_NEXT(p, p_list);
212 if (p == NULL && np > 0)
213 p = LIST_FIRST(&zombproc);
218 dumpthread(volatile struct proc *p, volatile struct thread *td, int all)
220 char state[9], wprefix;
225 db_printf("%6d ", td->td_tid);
226 switch (td->td_state) {
228 snprintf(state, sizeof(state), "Run");
231 snprintf(state, sizeof(state), "RunQ");
234 snprintf(state, sizeof(state), "CanRun");
237 snprintf(state, sizeof(state), "Inactv");
242 strlcat(state, "L", sizeof(state));
243 if (TD_IS_SLEEPING(td)) {
244 if (td->td_flags & TDF_SINTR)
245 strlcat(state, "S", sizeof(state));
247 strlcat(state, "D", sizeof(state));
249 if (TD_IS_SWAPPED(td))
250 strlcat(state, "W", sizeof(state));
251 if (TD_AWAITING_INTR(td))
252 strlcat(state, "I", sizeof(state));
253 if (TD_IS_SUSPENDED(td))
254 strlcat(state, "s", sizeof(state));
255 if (state[0] != '\0')
258 snprintf(state, sizeof(state), "???");
260 db_printf(" %-6.6s ", state);
263 if (TD_ON_LOCK(td)) {
265 wmesg = td->td_lockname;
266 wchan = td->td_blocked;
267 } else if (TD_ON_SLEEPQ(td)) {
268 wmesg = td->td_wmesg;
269 wchan = td->td_wchan;
270 } else if (TD_IS_RUNNING(td)) {
271 snprintf(state, sizeof(state), "CPU %d", td->td_oncpu);
278 db_printf("%c%-8.8s ", wprefix, wmesg);
281 db_printf("%18s ", "");
283 db_printf("%10s ", "");
286 db_printf("%p ", wchan);
287 if (p->p_flag & P_SYSTEM)
289 if (td->td_name[0] != '\0')
290 db_printf("%s", td->td_name);
292 db_printf("%s", td->td_proc->p_comm);
293 if (p->p_flag & P_SYSTEM)
298 DB_SHOW_COMMAND(thread, db_show_thread)
301 struct lock_object *lock;
304 /* Determine which thread to examine. */
306 td = db_lookup_thread(addr, FALSE);
309 lock = (struct lock_object *)td->td_lock;
311 db_printf("Thread %d at %p:\n", td->td_tid, td);
312 db_printf(" proc (pid %d): %p\n", td->td_proc->p_pid, td->td_proc);
313 if (td->td_name[0] != '\0')
314 db_printf(" name: %s\n", td->td_name);
315 db_printf(" stack: %p-%p\n", (void *)td->td_kstack,
316 (void *)(td->td_kstack + td->td_kstack_pages * PAGE_SIZE - 1));
317 db_printf(" flags: %#x ", td->td_flags);
318 db_printf(" pflags: %#x\n", td->td_pflags);
319 db_printf(" state: ");
320 switch (td->td_state) {
322 db_printf("INACTIVE\n");
325 db_printf("CAN RUN\n");
331 db_printf("RUNNING (CPU %d)\n", td->td_oncpu);
334 db_printf("INHIBITED: {");
336 if (TD_IS_SLEEPING(td)) {
337 db_printf("SLEEPING");
340 if (TD_IS_SUSPENDED(td)) {
343 db_printf("SUSPENDED");
346 if (TD_IS_SWAPPED(td)) {
349 db_printf("SWAPPED");
352 if (TD_ON_LOCK(td)) {
358 if (TD_AWAITING_INTR(td)) {
366 db_printf("??? (%#x)\n", td->td_state);
370 db_printf(" lock: %s turnstile: %p\n", td->td_lockname,
372 if (TD_ON_SLEEPQ(td))
373 db_printf(" wmesg: %s wchan: %p\n", td->td_wmesg,
375 db_printf(" priority: %d\n", td->td_priority);
376 db_printf(" container lock: %s (%p)\n", lock->lo_name, lock);
379 DB_SHOW_COMMAND(proc, db_show_proc)
385 /* Determine which process to examine. */
387 p = db_lookup_proc(addr);
389 p = kdb_thread->td_proc;
391 db_printf("Process %d (%s) at %p:\n", p->p_pid, p->p_comm, p);
392 db_printf(" state: ");
393 switch (p->p_state) {
398 db_printf("NORMAL\n");
401 db_printf("ZOMBIE\n");
404 db_printf("??? (%#x)\n", p->p_state);
406 if (p->p_ucred != NULL) {
407 db_printf(" uid: %d gids: ", p->p_ucred->cr_uid);
408 for (i = 0; i < p->p_ucred->cr_ngroups; i++) {
409 db_printf("%d", p->p_ucred->cr_groups[i]);
410 if (i < (p->p_ucred->cr_ngroups - 1))
415 if (p->p_pptr != NULL)
416 db_printf(" parent: pid %d at %p\n", p->p_pptr->p_pid,
418 if (p->p_leader != NULL && p->p_leader != p)
419 db_printf(" leader: pid %d at %p\n", p->p_leader->p_pid,
421 if (p->p_sysent != NULL)
422 db_printf(" ABI: %s\n", p->p_sysent->sv_name);
423 if (p->p_args != NULL)
424 db_printf(" arguments: %.*s\n", (int)p->p_args->ar_length,
426 db_printf(" threads: %d\n", p->p_numthreads);
427 FOREACH_THREAD_IN_PROC(p, td) {
428 dumpthread(p, td, 1);
435 db_findstack_cmd(db_expr_t addr, boolean_t have_addr,
436 db_expr_t dummy3 __unused, char *dummy4 __unused)
440 struct kstack_cache_entry *ks_ce;
446 db_printf("Usage: findstack <address>\n");
450 FOREACH_PROC_IN_SYSTEM(p) {
451 FOREACH_THREAD_IN_PROC(p, td) {
452 if (td->td_kstack <= saddr && saddr < td->td_kstack +
453 PAGE_SIZE * td->td_kstack_pages) {
454 db_printf("Thread %p\n", td);
460 for (ks_ce = kstack_cache; ks_ce != NULL;
461 ks_ce = ks_ce->next_ks_entry) {
462 if ((vm_offset_t)ks_ce <= saddr && saddr < (vm_offset_t)ks_ce +
463 PAGE_SIZE * KSTACK_PAGES) {
464 db_printf("Cached stack %p\n", ks_ce);