1dd3cb568SWarner Losh /*- 237224cd3SMarcel Moolenaar * Copyright (c) 2004 Marcel Moolenaar 337224cd3SMarcel Moolenaar * All rights reserved. 437224cd3SMarcel Moolenaar * 537224cd3SMarcel Moolenaar * Redistribution and use in source and binary forms, with or without 637224cd3SMarcel Moolenaar * modification, are permitted provided that the following conditions 737224cd3SMarcel Moolenaar * are met: 837224cd3SMarcel Moolenaar * 937224cd3SMarcel Moolenaar * 1. Redistributions of source code must retain the above copyright 1037224cd3SMarcel Moolenaar * notice, this list of conditions and the following disclaimer. 1137224cd3SMarcel Moolenaar * 2. Redistributions in binary form must reproduce the above copyright 1237224cd3SMarcel Moolenaar * notice, this list of conditions and the following disclaimer in the 1337224cd3SMarcel Moolenaar * documentation and/or other materials provided with the distribution. 1437224cd3SMarcel Moolenaar * 1537224cd3SMarcel Moolenaar * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 1637224cd3SMarcel Moolenaar * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 1737224cd3SMarcel Moolenaar * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 1837224cd3SMarcel Moolenaar * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 1937224cd3SMarcel Moolenaar * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 2037224cd3SMarcel Moolenaar * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2137224cd3SMarcel Moolenaar * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2237224cd3SMarcel Moolenaar * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 2337224cd3SMarcel Moolenaar * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 2437224cd3SMarcel Moolenaar * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 2537224cd3SMarcel Moolenaar */ 2637224cd3SMarcel Moolenaar 2737224cd3SMarcel Moolenaar #include <sys/cdefs.h> 2837224cd3SMarcel Moolenaar __FBSDID("$FreeBSD$"); 2937224cd3SMarcel Moolenaar 3037224cd3SMarcel Moolenaar #include <sys/param.h> 3137224cd3SMarcel Moolenaar #include <sys/systm.h> 3237224cd3SMarcel Moolenaar #include <sys/kdb.h> 3337224cd3SMarcel Moolenaar #include <sys/proc.h> 3437224cd3SMarcel Moolenaar 3537224cd3SMarcel Moolenaar #include <machine/pcb.h> 3637224cd3SMarcel Moolenaar 3737224cd3SMarcel Moolenaar #include <ddb/ddb.h> 3837224cd3SMarcel Moolenaar #include <ddb/db_command.h> 3937224cd3SMarcel Moolenaar #include <ddb/db_sym.h> 4037224cd3SMarcel Moolenaar 4137224cd3SMarcel Moolenaar void 4237224cd3SMarcel Moolenaar db_print_thread(void) 4337224cd3SMarcel Moolenaar { 442afce774SRobert Watson pid_t pid; 452afce774SRobert Watson 462afce774SRobert Watson pid = -1; 472afce774SRobert Watson if (kdb_thread->td_proc != NULL) 482afce774SRobert Watson pid = kdb_thread->td_proc->p_pid; 492afce774SRobert Watson db_printf("[ thread pid %d tid %ld ]\n", pid, (long)kdb_thread->td_tid); 5037224cd3SMarcel Moolenaar } 5137224cd3SMarcel Moolenaar 5237224cd3SMarcel Moolenaar void 53*cd508278SPedro F. Giffuni db_set_thread(db_expr_t tid, bool hastid, db_expr_t cnt, char *mod) 5437224cd3SMarcel Moolenaar { 5537224cd3SMarcel Moolenaar struct thread *thr; 5637224cd3SMarcel Moolenaar db_expr_t radix; 5737224cd3SMarcel Moolenaar int err; 5837224cd3SMarcel Moolenaar 5937224cd3SMarcel Moolenaar /* 6037224cd3SMarcel Moolenaar * We parse our own arguments. We don't like the default radix. 6137224cd3SMarcel Moolenaar */ 6237224cd3SMarcel Moolenaar radix = db_radix; 6337224cd3SMarcel Moolenaar db_radix = 10; 6437224cd3SMarcel Moolenaar hastid = db_expression(&tid); 6537224cd3SMarcel Moolenaar db_radix = radix; 6637224cd3SMarcel Moolenaar db_skip_to_eol(); 6737224cd3SMarcel Moolenaar 6837224cd3SMarcel Moolenaar if (hastid) { 6937224cd3SMarcel Moolenaar thr = kdb_thr_lookup(tid); 7037224cd3SMarcel Moolenaar if (thr != NULL) { 7137224cd3SMarcel Moolenaar err = kdb_thr_select(thr); 7237224cd3SMarcel Moolenaar if (err != 0) { 7337224cd3SMarcel Moolenaar db_printf("unable to switch to thread %ld\n", 7437224cd3SMarcel Moolenaar (long)thr->td_tid); 7537224cd3SMarcel Moolenaar return; 7637224cd3SMarcel Moolenaar } 7737224cd3SMarcel Moolenaar db_dot = PC_REGS(); 7837224cd3SMarcel Moolenaar } else { 7937224cd3SMarcel Moolenaar db_printf("%d: invalid thread\n", (int)tid); 8037224cd3SMarcel Moolenaar return; 8137224cd3SMarcel Moolenaar } 8237224cd3SMarcel Moolenaar } 8337224cd3SMarcel Moolenaar 8437224cd3SMarcel Moolenaar db_print_thread(); 8537224cd3SMarcel Moolenaar db_print_loc_and_inst(PC_REGS()); 8637224cd3SMarcel Moolenaar } 8737224cd3SMarcel Moolenaar 8837224cd3SMarcel Moolenaar void 89*cd508278SPedro F. Giffuni db_show_threads(db_expr_t addr, bool hasaddr, db_expr_t cnt, char *mod) 9037224cd3SMarcel Moolenaar { 9137224cd3SMarcel Moolenaar jmp_buf jb; 9237224cd3SMarcel Moolenaar void *prev_jb; 9337224cd3SMarcel Moolenaar struct thread *thr; 9437224cd3SMarcel Moolenaar 9537224cd3SMarcel Moolenaar thr = kdb_thr_first(); 9619e9205aSJohn Baldwin while (!db_pager_quit && thr != NULL) { 9738474ef2SKonstantin Belousov db_printf(" %6ld (%p) (stack %p) ", (long)thr->td_tid, thr, 9838474ef2SKonstantin Belousov (void *)thr->td_kstack); 9937224cd3SMarcel Moolenaar prev_jb = kdb_jmpbuf(jb); 10037224cd3SMarcel Moolenaar if (setjmp(jb) == 0) { 10137224cd3SMarcel Moolenaar if (db_trace_thread(thr, 1) != 0) 10237224cd3SMarcel Moolenaar db_printf("***\n"); 10337224cd3SMarcel Moolenaar } 10437224cd3SMarcel Moolenaar kdb_jmpbuf(prev_jb); 10537224cd3SMarcel Moolenaar thr = kdb_thr_next(thr); 10637224cd3SMarcel Moolenaar } 10737224cd3SMarcel Moolenaar } 108d605beaaSJohn Baldwin 109d605beaaSJohn Baldwin /* 110d605beaaSJohn Baldwin * Lookup a thread based on a db expression address. We assume that the 111d605beaaSJohn Baldwin * address was parsed in hexadecimal. We reparse the address in decimal 112d605beaaSJohn Baldwin * first and try to treat it as a thread ID to find an associated thread. 11340bd3befSKonstantin Belousov * If that fails and check_pid is true, we treat the decimal value as a 114d605beaaSJohn Baldwin * PID. If that matches a process, we return the first thread in that 115d605beaaSJohn Baldwin * process. Otherwise, we treat the addr as a pointer to a thread. 116d605beaaSJohn Baldwin */ 117d605beaaSJohn Baldwin struct thread * 118*cd508278SPedro F. Giffuni db_lookup_thread(db_expr_t addr, bool check_pid) 119d605beaaSJohn Baldwin { 120d605beaaSJohn Baldwin struct thread *td; 121d605beaaSJohn Baldwin db_expr_t decaddr; 122d605beaaSJohn Baldwin struct proc *p; 123d605beaaSJohn Baldwin 124d605beaaSJohn Baldwin /* 125d605beaaSJohn Baldwin * If the parsed address was not a valid decimal expression, 126d605beaaSJohn Baldwin * assume it is a thread pointer. 127d605beaaSJohn Baldwin */ 1280f59fbc3SBjoern A. Zeeb decaddr = db_hex2dec(addr); 129d605beaaSJohn Baldwin if (decaddr == -1) 130d605beaaSJohn Baldwin return ((struct thread *)addr); 131d605beaaSJohn Baldwin 132d605beaaSJohn Baldwin td = kdb_thr_lookup(decaddr); 133d605beaaSJohn Baldwin if (td != NULL) 134d605beaaSJohn Baldwin return (td); 135d605beaaSJohn Baldwin if (check_pid) { 136f67af5c9SXin LI FOREACH_PROC_IN_SYSTEM(p) { 137d605beaaSJohn Baldwin if (p->p_pid == decaddr) 138d605beaaSJohn Baldwin return (FIRST_THREAD_IN_PROC(p)); 139d605beaaSJohn Baldwin } 140d605beaaSJohn Baldwin LIST_FOREACH(p, &zombproc, p_list) { 141d605beaaSJohn Baldwin if (p->p_pid == decaddr) 142d605beaaSJohn Baldwin return (FIRST_THREAD_IN_PROC(p)); 143d605beaaSJohn Baldwin } 144d605beaaSJohn Baldwin } 145d605beaaSJohn Baldwin return ((struct thread *)addr); 146d605beaaSJohn Baldwin } 147d605beaaSJohn Baldwin 148d605beaaSJohn Baldwin /* 149d605beaaSJohn Baldwin * Lookup a process based on a db expression address. We assume that the 150d605beaaSJohn Baldwin * address was parsed in hexadecimal. We reparse the address in decimal 151d605beaaSJohn Baldwin * first and try to treat it as a PID to find an associated process. 152d605beaaSJohn Baldwin * If that fails we treat the addr as a pointer to a process. 153d605beaaSJohn Baldwin */ 154d605beaaSJohn Baldwin struct proc * 155d605beaaSJohn Baldwin db_lookup_proc(db_expr_t addr) 156d605beaaSJohn Baldwin { 157d605beaaSJohn Baldwin db_expr_t decaddr; 158d605beaaSJohn Baldwin struct proc *p; 159d605beaaSJohn Baldwin 1600f59fbc3SBjoern A. Zeeb decaddr = db_hex2dec(addr); 161d605beaaSJohn Baldwin if (decaddr != -1) { 162f67af5c9SXin LI FOREACH_PROC_IN_SYSTEM(p) { 163d605beaaSJohn Baldwin if (p->p_pid == decaddr) 164d605beaaSJohn Baldwin return (p); 165d605beaaSJohn Baldwin } 166d605beaaSJohn Baldwin LIST_FOREACH(p, &zombproc, p_list) { 167d605beaaSJohn Baldwin if (p->p_pid == decaddr) 168d605beaaSJohn Baldwin return (p); 169d605beaaSJohn Baldwin } 170d605beaaSJohn Baldwin } 171d605beaaSJohn Baldwin return ((struct proc *)addr); 172d605beaaSJohn Baldwin } 173