2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1993 The Regents of the University of California.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
35 #include "opt_kstack_pages.h"
37 #include <sys/param.h>
41 #include <sys/kernel.h>
43 #include <sys/sysent.h>
44 #include <sys/systm.h>
45 #include <sys/_kstack_cache.h>
47 #include <vm/vm_param.h>
49 #include <vm/vm_map.h>
53 static void dumpthread(volatile struct proc *p, volatile struct thread *td,
56 * At least one non-optional show-command must be implemented using
57 * DB_SHOW_ALL_COMMAND() so that db_show_all_cmd_set gets created.
60 DB_SHOW_ALL_COMMAND(procs, db_procs_cmd)
62 db_ps(addr, have_addr, count, modif);
69 * - single-threaded process
70 * - multi-threaded process
71 * - thread in a MT process
74 * 1234567890123456789012345678901234567890123456789012345678901234567890
75 * pid ppid pgrp uid state wmesg wchan cmd
76 * <pid> <ppi> <pgi> <uid> <stat> <wmesg> <wchan > <name>
77 * <pid> <ppi> <pgi> <uid> <stat> (threaded) <command>
78 * <tid > <stat> <wmesg> <wchan > <name>
80 * For machines with 64-bit pointers, we expand the wchan field 8 more
84 db_ps(db_expr_t addr, bool hasaddr, db_expr_t count, char *modif)
86 volatile struct proc *p, *pp;
87 volatile struct thread *td;
91 int np, rflag, sflag, dflag, lflag, wflag;
95 if (!LIST_EMPTY(&allproc))
96 p = LIST_FIRST(&allproc);
101 db_printf(" pid ppid pgrp uid state wmesg wchan cmd\n");
103 db_printf(" pid ppid pgrp uid state wmesg wchan cmd\n");
105 while (--np >= 0 && !db_pager_quit) {
107 db_printf("oops, ran out of processes early!\n");
116 db_printf("%5d %5d %5d %5d ", p->p_pid, pp->p_pid,
117 pgrp != NULL ? pgrp->pg_id : 0,
118 cred != NULL ? cred->cr_ruid : 0);
120 /* Determine our primary process state. */
121 switch (p->p_state) {
127 * One of D, L, R, S, W. For a
128 * multithreaded process we will use
129 * the state of the thread with the
130 * highest precedence. The
131 * precendence order from high to low
132 * is R, L, D, S, W. If no thread is
133 * in a sane state we use '?' for our
136 rflag = sflag = dflag = lflag = wflag = 0;
137 FOREACH_THREAD_IN_PROC(p, td) {
138 if (td->td_state == TDS_RUNNING ||
139 td->td_state == TDS_RUNQ ||
140 td->td_state == TDS_CAN_RUN)
144 if (TD_IS_SLEEPING(td)) {
145 if (!(td->td_flags & TDF_SINTR))
150 if (TD_AWAITING_INTR(td))
179 /* Additional process state flags. */
180 if (!(p->p_flag & P_INMEM))
181 strlcat(state, "W", sizeof(state));
182 if (p->p_flag & P_TRACED)
183 strlcat(state, "X", sizeof(state));
184 if (p->p_flag & P_WEXIT && p->p_state != PRS_ZOMBIE)
185 strlcat(state, "E", sizeof(state));
186 if (p->p_flag & P_PPWAIT)
187 strlcat(state, "V", sizeof(state));
188 if (p->p_flag & P_SYSTEM || p->p_lock > 0)
189 strlcat(state, "L", sizeof(state));
190 if (p->p_pgrp != NULL && p->p_session != NULL &&
192 strlcat(state, "s", sizeof(state));
193 /* Cheated here and didn't compare pgid's. */
194 if (p->p_flag & P_CONTROLT)
195 strlcat(state, "+", sizeof(state));
196 if (cred != NULL && jailed(cred))
197 strlcat(state, "J", sizeof(state));
198 db_printf(" %-6.6s ", state);
199 if (p->p_flag & P_HADTHREADS) {
201 db_printf(" (threaded) ");
203 db_printf(" (threaded) ");
205 if (p->p_flag & P_SYSTEM)
207 db_printf("%s", p->p_comm);
208 if (p->p_flag & P_SYSTEM)
212 FOREACH_THREAD_IN_PROC(p, td) {
213 dumpthread(p, td, p->p_flag & P_HADTHREADS);
218 p = LIST_NEXT(p, p_list);
219 if (p == NULL && np > 0)
220 p = LIST_FIRST(&zombproc);
225 dumpthread(volatile struct proc *p, volatile struct thread *td, int all)
227 char state[9], wprefix;
232 db_printf("%6d ", td->td_tid);
233 switch (td->td_state) {
235 snprintf(state, sizeof(state), "Run");
238 snprintf(state, sizeof(state), "RunQ");
241 snprintf(state, sizeof(state), "CanRun");
244 snprintf(state, sizeof(state), "Inactv");
249 strlcat(state, "L", sizeof(state));
250 if (TD_IS_SLEEPING(td)) {
251 if (td->td_flags & TDF_SINTR)
252 strlcat(state, "S", sizeof(state));
254 strlcat(state, "D", sizeof(state));
256 if (TD_IS_SWAPPED(td))
257 strlcat(state, "W", sizeof(state));
258 if (TD_AWAITING_INTR(td))
259 strlcat(state, "I", sizeof(state));
260 if (TD_IS_SUSPENDED(td))
261 strlcat(state, "s", sizeof(state));
262 if (state[0] != '\0')
265 snprintf(state, sizeof(state), "???");
267 db_printf(" %-6.6s ", state);
270 if (TD_ON_LOCK(td)) {
272 wmesg = td->td_lockname;
273 wchan = td->td_blocked;
274 } else if (TD_ON_SLEEPQ(td)) {
275 wmesg = td->td_wmesg;
276 wchan = td->td_wchan;
277 } else if (TD_IS_RUNNING(td)) {
278 snprintf(state, sizeof(state), "CPU %d", td->td_oncpu);
285 db_printf("%c%-7.7s ", wprefix, wmesg);
288 db_printf("%18s ", "");
290 db_printf("%10s ", "");
293 db_printf("%p ", wchan);
294 if (p->p_flag & P_SYSTEM)
296 if (td->td_name[0] != '\0')
297 db_printf("%s", td->td_name);
299 db_printf("%s", td->td_proc->p_comm);
300 if (p->p_flag & P_SYSTEM)
305 DB_SHOW_COMMAND(thread, db_show_thread)
308 struct lock_object *lock;
312 /* Determine which thread to examine. */
314 td = db_lookup_thread(addr, false);
317 lock = (struct lock_object *)td->td_lock;
319 db_printf("Thread %d at %p:\n", td->td_tid, td);
320 db_printf(" proc (pid %d): %p\n", td->td_proc->p_pid, td->td_proc);
321 if (td->td_name[0] != '\0')
322 db_printf(" name: %s\n", td->td_name);
323 db_printf(" stack: %p-%p\n", (void *)td->td_kstack,
324 (void *)(td->td_kstack + td->td_kstack_pages * PAGE_SIZE - 1));
325 db_printf(" flags: %#x ", td->td_flags);
326 db_printf(" pflags: %#x\n", td->td_pflags);
327 db_printf(" state: ");
328 switch (td->td_state) {
330 db_printf("INACTIVE\n");
333 db_printf("CAN RUN\n");
339 db_printf("RUNNING (CPU %d)\n", td->td_oncpu);
342 db_printf("INHIBITED: {");
344 if (TD_IS_SLEEPING(td)) {
345 db_printf("SLEEPING");
348 if (TD_IS_SUSPENDED(td)) {
351 db_printf("SUSPENDED");
354 if (TD_IS_SWAPPED(td)) {
357 db_printf("SWAPPED");
360 if (TD_ON_LOCK(td)) {
366 if (TD_AWAITING_INTR(td)) {
374 db_printf("??? (%#x)\n", td->td_state);
378 db_printf(" lock: %s turnstile: %p\n", td->td_lockname,
380 if (TD_ON_SLEEPQ(td))
382 " wmesg: %s wchan: %p sleeptimo %lx. %jx (curr %lx. %jx)\n",
383 td->td_wmesg, td->td_wchan,
384 (long)sbttobt(td->td_sleeptimo).sec,
385 (uintmax_t)sbttobt(td->td_sleeptimo).frac,
386 (long)sbttobt(sbinuptime()).sec,
387 (uintmax_t)sbttobt(sbinuptime()).frac);
388 db_printf(" priority: %d\n", td->td_priority);
389 db_printf(" container lock: %s (%p)\n", lock->lo_name, lock);
390 if (td->td_swvoltick != 0) {
391 delta = (u_int)ticks - (u_int)td->td_swvoltick;
392 db_printf(" last voluntary switch: %d ms ago\n",
395 if (td->td_swinvoltick != 0) {
396 delta = (u_int)ticks - (u_int)td->td_swinvoltick;
397 db_printf(" last involuntary switch: %d ms ago\n",
402 DB_SHOW_COMMAND(proc, db_show_proc)
408 /* Determine which process to examine. */
410 p = db_lookup_proc(addr);
412 p = kdb_thread->td_proc;
414 db_printf("Process %d (%s) at %p:\n", p->p_pid, p->p_comm, p);
415 db_printf(" state: ");
416 switch (p->p_state) {
421 db_printf("NORMAL\n");
424 db_printf("ZOMBIE\n");
427 db_printf("??? (%#x)\n", p->p_state);
429 if (p->p_ucred != NULL) {
430 db_printf(" uid: %d gids: ", p->p_ucred->cr_uid);
431 for (i = 0; i < p->p_ucred->cr_ngroups; i++) {
432 db_printf("%d", p->p_ucred->cr_groups[i]);
433 if (i < (p->p_ucred->cr_ngroups - 1))
438 if (p->p_pptr != NULL)
439 db_printf(" parent: pid %d at %p\n", p->p_pptr->p_pid,
441 if (p->p_leader != NULL && p->p_leader != p)
442 db_printf(" leader: pid %d at %p\n", p->p_leader->p_pid,
444 if (p->p_sysent != NULL)
445 db_printf(" ABI: %s\n", p->p_sysent->sv_name);
446 if (p->p_args != NULL) {
447 db_printf(" arguments: ");
448 for (i = 0; i < (int)p->p_args->ar_length; i++) {
449 if (p->p_args->ar_args[i] == '\0')
452 db_printf("%c", p->p_args->ar_args[i]);
456 db_printf(" repear: %p reapsubtree: %d\n",
457 p->p_reaper, p->p_reapsubtree);
458 db_printf(" sigparent: %d\n", p->p_sigparent);
459 db_printf(" vmspace: %p\n", p->p_vmspace);
460 db_printf(" (map %p)\n",
461 (p->p_vmspace != NULL) ? &p->p_vmspace->vm_map : 0);
462 db_printf(" (map.pmap %p)\n",
463 (p->p_vmspace != NULL) ? &p->p_vmspace->vm_map.pmap : 0);
464 db_printf(" (pmap %p)\n",
465 (p->p_vmspace != NULL) ? &p->p_vmspace->vm_pmap : 0);
466 db_printf(" threads: %d\n", p->p_numthreads);
467 FOREACH_THREAD_IN_PROC(p, td) {
468 dumpthread(p, td, 1);
475 db_findstack_cmd(db_expr_t addr, bool have_addr, db_expr_t dummy3 __unused,
476 char *dummy4 __unused)
480 struct kstack_cache_entry *ks_ce;
486 db_printf("Usage: findstack <address>\n");
490 FOREACH_PROC_IN_SYSTEM(p) {
491 FOREACH_THREAD_IN_PROC(p, td) {
492 if (td->td_kstack <= saddr && saddr < td->td_kstack +
493 PAGE_SIZE * td->td_kstack_pages) {
494 db_printf("Thread %p\n", td);
500 for (ks_ce = kstack_cache; ks_ce != NULL;
501 ks_ce = ks_ce->next_ks_entry) {
502 if ((vm_offset_t)ks_ce <= saddr && saddr < (vm_offset_t)ks_ce +
503 PAGE_SIZE * kstack_pages) {
504 db_printf("Cached stack %p\n", ks_ce);