1dd3cb568SWarner Losh /*- 2*4d846d26SWarner Losh * SPDX-License-Identifier: BSD-2-Clause 3753c4e83SPedro F. Giffuni * 437224cd3SMarcel Moolenaar * Copyright (c) 2004 Marcel Moolenaar 537224cd3SMarcel Moolenaar * All rights reserved. 637224cd3SMarcel Moolenaar * 737224cd3SMarcel Moolenaar * Redistribution and use in source and binary forms, with or without 837224cd3SMarcel Moolenaar * modification, are permitted provided that the following conditions 937224cd3SMarcel Moolenaar * are met: 1037224cd3SMarcel Moolenaar * 1137224cd3SMarcel Moolenaar * 1. Redistributions of source code must retain the above copyright 1237224cd3SMarcel Moolenaar * notice, this list of conditions and the following disclaimer. 1337224cd3SMarcel Moolenaar * 2. Redistributions in binary form must reproduce the above copyright 1437224cd3SMarcel Moolenaar * notice, this list of conditions and the following disclaimer in the 1537224cd3SMarcel Moolenaar * documentation and/or other materials provided with the distribution. 1637224cd3SMarcel Moolenaar * 1737224cd3SMarcel Moolenaar * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 1837224cd3SMarcel Moolenaar * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 1937224cd3SMarcel Moolenaar * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 2037224cd3SMarcel Moolenaar * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 2137224cd3SMarcel Moolenaar * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 2237224cd3SMarcel Moolenaar * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2337224cd3SMarcel Moolenaar * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2437224cd3SMarcel Moolenaar * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 2537224cd3SMarcel Moolenaar * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 2637224cd3SMarcel Moolenaar * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 2737224cd3SMarcel Moolenaar */ 2837224cd3SMarcel Moolenaar 2937224cd3SMarcel Moolenaar #include <sys/param.h> 3037224cd3SMarcel Moolenaar #include <sys/systm.h> 3137224cd3SMarcel Moolenaar #include <sys/kdb.h> 3237224cd3SMarcel Moolenaar #include <sys/proc.h> 3337224cd3SMarcel Moolenaar 3437224cd3SMarcel Moolenaar #include <machine/pcb.h> 3537224cd3SMarcel Moolenaar 3637224cd3SMarcel Moolenaar #include <ddb/ddb.h> 3737224cd3SMarcel Moolenaar #include <ddb/db_command.h> 3837224cd3SMarcel Moolenaar #include <ddb/db_sym.h> 3937224cd3SMarcel Moolenaar 4037224cd3SMarcel Moolenaar void 4137224cd3SMarcel Moolenaar db_print_thread(void) 4237224cd3SMarcel Moolenaar { 432afce774SRobert Watson pid_t pid; 442afce774SRobert Watson 452afce774SRobert Watson pid = -1; 462afce774SRobert Watson if (kdb_thread->td_proc != NULL) 472afce774SRobert Watson pid = kdb_thread->td_proc->p_pid; 482afce774SRobert Watson db_printf("[ thread pid %d tid %ld ]\n", pid, (long)kdb_thread->td_tid); 4937224cd3SMarcel Moolenaar } 5037224cd3SMarcel Moolenaar 5137224cd3SMarcel Moolenaar void 52cd508278SPedro F. Giffuni db_set_thread(db_expr_t tid, bool hastid, db_expr_t cnt, char *mod) 5337224cd3SMarcel Moolenaar { 5437224cd3SMarcel Moolenaar struct thread *thr; 5537224cd3SMarcel Moolenaar int err; 5637224cd3SMarcel Moolenaar 5737224cd3SMarcel Moolenaar if (hastid) { 58e41793dbSConrad Meyer thr = db_lookup_thread(tid, false); 5937224cd3SMarcel Moolenaar if (thr != NULL) { 6037224cd3SMarcel Moolenaar err = kdb_thr_select(thr); 6137224cd3SMarcel Moolenaar if (err != 0) { 6237224cd3SMarcel Moolenaar db_printf("unable to switch to thread %ld\n", 6337224cd3SMarcel Moolenaar (long)thr->td_tid); 6437224cd3SMarcel Moolenaar return; 6537224cd3SMarcel Moolenaar } 6637224cd3SMarcel Moolenaar db_dot = PC_REGS(); 6737224cd3SMarcel Moolenaar } else { 6837224cd3SMarcel Moolenaar db_printf("%d: invalid thread\n", (int)tid); 6937224cd3SMarcel Moolenaar return; 7037224cd3SMarcel Moolenaar } 7137224cd3SMarcel Moolenaar } 7237224cd3SMarcel Moolenaar 7337224cd3SMarcel Moolenaar db_print_thread(); 7437224cd3SMarcel Moolenaar db_print_loc_and_inst(PC_REGS()); 7537224cd3SMarcel Moolenaar } 7637224cd3SMarcel Moolenaar 7737224cd3SMarcel Moolenaar void 78cd508278SPedro F. Giffuni db_show_threads(db_expr_t addr, bool hasaddr, db_expr_t cnt, char *mod) 7937224cd3SMarcel Moolenaar { 8037224cd3SMarcel Moolenaar jmp_buf jb; 8137224cd3SMarcel Moolenaar void *prev_jb; 8237224cd3SMarcel Moolenaar struct thread *thr; 8337224cd3SMarcel Moolenaar 8437224cd3SMarcel Moolenaar thr = kdb_thr_first(); 8519e9205aSJohn Baldwin while (!db_pager_quit && thr != NULL) { 8638474ef2SKonstantin Belousov db_printf(" %6ld (%p) (stack %p) ", (long)thr->td_tid, thr, 8738474ef2SKonstantin Belousov (void *)thr->td_kstack); 8837224cd3SMarcel Moolenaar prev_jb = kdb_jmpbuf(jb); 8937224cd3SMarcel Moolenaar if (setjmp(jb) == 0) { 9037224cd3SMarcel Moolenaar if (db_trace_thread(thr, 1) != 0) 9137224cd3SMarcel Moolenaar db_printf("***\n"); 9237224cd3SMarcel Moolenaar } 9337224cd3SMarcel Moolenaar kdb_jmpbuf(prev_jb); 9437224cd3SMarcel Moolenaar thr = kdb_thr_next(thr); 9537224cd3SMarcel Moolenaar } 9637224cd3SMarcel Moolenaar } 97d605beaaSJohn Baldwin 98d605beaaSJohn Baldwin /* 99d605beaaSJohn Baldwin * Lookup a thread based on a db expression address. We assume that the 100d605beaaSJohn Baldwin * address was parsed in hexadecimal. We reparse the address in decimal 101d605beaaSJohn Baldwin * first and try to treat it as a thread ID to find an associated thread. 10240bd3befSKonstantin Belousov * If that fails and check_pid is true, we treat the decimal value as a 103d605beaaSJohn Baldwin * PID. If that matches a process, we return the first thread in that 104d605beaaSJohn Baldwin * process. Otherwise, we treat the addr as a pointer to a thread. 105d605beaaSJohn Baldwin */ 106d605beaaSJohn Baldwin struct thread * 107cd508278SPedro F. Giffuni db_lookup_thread(db_expr_t addr, bool check_pid) 108d605beaaSJohn Baldwin { 109d605beaaSJohn Baldwin struct thread *td; 110d605beaaSJohn Baldwin db_expr_t decaddr; 111d605beaaSJohn Baldwin 112d605beaaSJohn Baldwin /* 113d605beaaSJohn Baldwin * If the parsed address was not a valid decimal expression, 114d605beaaSJohn Baldwin * assume it is a thread pointer. 115d605beaaSJohn Baldwin */ 1160f59fbc3SBjoern A. Zeeb decaddr = db_hex2dec(addr); 117d605beaaSJohn Baldwin if (decaddr == -1) 118d605beaaSJohn Baldwin return ((struct thread *)addr); 119d605beaaSJohn Baldwin 120d605beaaSJohn Baldwin td = kdb_thr_lookup(decaddr); 121d605beaaSJohn Baldwin if (td != NULL) 122d605beaaSJohn Baldwin return (td); 123d605beaaSJohn Baldwin if (check_pid) { 124ae450907SJohn Baldwin td = kdb_thr_from_pid(decaddr); 125ae450907SJohn Baldwin if (td != NULL) 126ae450907SJohn Baldwin return (td); 127d605beaaSJohn Baldwin } 128d605beaaSJohn Baldwin return ((struct thread *)addr); 129d605beaaSJohn Baldwin } 130d605beaaSJohn Baldwin 131d605beaaSJohn Baldwin /* 132d605beaaSJohn Baldwin * Lookup a process based on a db expression address. We assume that the 133d605beaaSJohn Baldwin * address was parsed in hexadecimal. We reparse the address in decimal 134d605beaaSJohn Baldwin * first and try to treat it as a PID to find an associated process. 135d605beaaSJohn Baldwin * If that fails we treat the addr as a pointer to a process. 136d605beaaSJohn Baldwin */ 137d605beaaSJohn Baldwin struct proc * 138d605beaaSJohn Baldwin db_lookup_proc(db_expr_t addr) 139d605beaaSJohn Baldwin { 140d605beaaSJohn Baldwin db_expr_t decaddr; 141d605beaaSJohn Baldwin struct proc *p; 142d605beaaSJohn Baldwin 1430f59fbc3SBjoern A. Zeeb decaddr = db_hex2dec(addr); 144d605beaaSJohn Baldwin if (decaddr != -1) { 14588cc62e5SMateusz Guzik LIST_FOREACH(p, PIDHASH(decaddr), p_hash) { 146d605beaaSJohn Baldwin if (p->p_pid == decaddr) 147d605beaaSJohn Baldwin return (p); 148d605beaaSJohn Baldwin } 149d605beaaSJohn Baldwin } 150d605beaaSJohn Baldwin return ((struct proc *)addr); 151d605beaaSJohn Baldwin } 152