db_trace.c revision 1.29
1 /* $NetBSD: db_trace.c,v 1.29 2006/09/06 23:58:20 ad Exp $ */ 2 3 /* 4 * Mach Operating System 5 * Copyright (c) 1993-1987 Carnegie Mellon University 6 * All Rights Reserved. 7 * 8 * Permission to use, copy, modify and distribute this software and its 9 * documentation is hereby granted, provided that both the copyright 10 * notice and this permission notice appear in all copies of the 11 * software, derivative works or modified versions, and any portions 12 * thereof, and that both notices appear in supporting documentation. 13 * 14 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 15 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR 16 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 17 * 18 * Carnegie Mellon requests users of this software to return to 19 * 20 * Software Distribution Coordinator or Software.Distribution (at) CS.CMU.EDU 21 * School of Computer Science 22 * Carnegie Mellon University 23 * Pittsburgh PA 15213-3890 24 * 25 * any improvements or extensions that they make and grant Carnegie Mellon 26 * the rights to redistribute these changes. 27 */ 28 29 #include <sys/cdefs.h> 30 __KERNEL_RCSID(0, "$NetBSD: db_trace.c,v 1.29 2006/09/06 23:58:20 ad Exp $"); 31 32 #include <sys/types.h> 33 #include <sys/param.h> 34 #include <sys/systm.h> 35 #include <sys/proc.h> 36 #include <sys/user.h> 37 38 #include <mips/mips_opcode.h> 39 40 #include <machine/db_machdep.h> 41 #include <ddb/db_interface.h> 42 #include <ddb/db_output.h> 43 #include <ddb/db_variables.h> 44 #include <ddb/db_sym.h> 45 46 int __start(void); /* lowest kernel code address */ 47 vaddr_t getreg_val(db_expr_t regno); 48 49 #define REG_ARG(i) (4+i) 50 #define SAVES_RA(x) isa_spill((x),31) 51 52 #define KERN_SAVE_REG_IDX(vp) ( \ 53 ((vp)->valuep >= (int *)(&((struct mips_saved_state *)0)->s0) && \ 54 (vp)->valuep <= (int *)(&((struct mips_saved_state *)0)->s7))? \ 55 vp->valuep - (int *)(&((struct mips_saved_state *)0)->s0): \ 56 ((vp)->valuep >= (int *)(&((struct mips_saved_state *)0)->sp) && \ 57 (vp)->valuep <= (int *)(&((struct mips_saved_state *)0)->ra))? \ 58 ((vp)->valuep-(int *)(&((struct mips_saved_state *)0)->sp)) + \ 59 ((int *)(&((struct mips_kernel_state *)0)->sp) - (int *)0): \ 60 -1) 61 62 db_sym_t localsym(db_sym_t sym, boolean_t isreg, int *lex_level); 63 64 /* 65 * Machine register set. 66 */ 67 struct mips_saved_state *db_cur_exc_frame = 0; 68 69 /*XXX*/ 70 void stacktrace_subr(int, int, int, int, u_int, u_int, u_int, u_int, 71 void (*)(const char*, ...)); 72 73 /* 74 * Stack trace helper. 75 */ 76 void db_mips_stack_trace(int, vaddr_t, vaddr_t, vaddr_t, int, vaddr_t); 77 int db_mips_variable_func(const struct db_variable *, db_expr_t *, int); 78 79 #define DB_SETF_REGS db_mips_variable_func 80 #define DBREGS_REG() 81 82 const struct db_variable db_regs[] = { 83 { "at", (long *)&ddb_regs.f_regs[_R_AST], DB_SETF_REGS }, 84 { "v0", (long *)&ddb_regs.f_regs[_R_V0], DB_SETF_REGS }, 85 { "v1", (long *)&ddb_regs.f_regs[_R_V1], DB_SETF_REGS }, 86 { "a0", (long *)&ddb_regs.f_regs[_R_A0], DB_SETF_REGS }, 87 { "a1", (long *)&ddb_regs.f_regs[_R_A1], DB_SETF_REGS }, 88 { "a2", (long *)&ddb_regs.f_regs[_R_A2], DB_SETF_REGS }, 89 { "a3", (long *)&ddb_regs.f_regs[_R_A3], DB_SETF_REGS }, 90 #if defined(__mips_n32) || defined(__mips_n64) 91 { "a4", (long *)&ddb_regs.f_regs[_R_A4], DB_SETF_REGS }, 92 { "a5", (long *)&ddb_regs.f_regs[_R_A5], DB_SETF_REGS }, 93 { "a6", (long *)&ddb_regs.f_regs[_R_A6], DB_SETF_REGS }, 94 { "a7", (long *)&ddb_regs.f_regs[_R_A7], DB_SETF_REGS }, 95 { "t0", (long *)&ddb_regs.f_regs[_R_T0], DB_SETF_REGS }, 96 { "t1", (long *)&ddb_regs.f_regs[_R_T1], DB_SETF_REGS }, 97 { "t2", (long *)&ddb_regs.f_regs[_R_T2], DB_SETF_REGS }, 98 { "t3", (long *)&ddb_regs.f_regs[_R_T3], DB_SETF_REGS }, 99 #else 100 { "t0", (long *)&ddb_regs.f_regs[_R_T0], DB_SETF_REGS }, 101 { "t1", (long *)&ddb_regs.f_regs[_R_T1], DB_SETF_REGS }, 102 { "t2", (long *)&ddb_regs.f_regs[_R_T2], DB_SETF_REGS }, 103 { "t3", (long *)&ddb_regs.f_regs[_R_T3], DB_SETF_REGS }, 104 { "t4", (long *)&ddb_regs.f_regs[_R_T4], DB_SETF_REGS }, 105 { "t5", (long *)&ddb_regs.f_regs[_R_T5], DB_SETF_REGS }, 106 { "t6", (long *)&ddb_regs.f_regs[_R_T6], DB_SETF_REGS }, 107 { "t7", (long *)&ddb_regs.f_regs[_R_T7], DB_SETF_REGS }, 108 #endif /* __mips_n32 || __mips_n64 */ 109 { "s0", (long *)&ddb_regs.f_regs[_R_S0], DB_SETF_REGS }, 110 { "s1", (long *)&ddb_regs.f_regs[_R_S1], DB_SETF_REGS }, 111 { "s2", (long *)&ddb_regs.f_regs[_R_S2], DB_SETF_REGS }, 112 { "s3", (long *)&ddb_regs.f_regs[_R_S3], DB_SETF_REGS }, 113 { "s4", (long *)&ddb_regs.f_regs[_R_S4], DB_SETF_REGS }, 114 { "s5", (long *)&ddb_regs.f_regs[_R_S5], DB_SETF_REGS }, 115 { "s6", (long *)&ddb_regs.f_regs[_R_S6], DB_SETF_REGS }, 116 { "s7", (long *)&ddb_regs.f_regs[_R_S7], DB_SETF_REGS }, 117 { "t8", (long *)&ddb_regs.f_regs[_R_T8], DB_SETF_REGS }, 118 { "t9", (long *)&ddb_regs.f_regs[_R_T9], DB_SETF_REGS }, 119 { "k0", (long *)&ddb_regs.f_regs[_R_K0], DB_SETF_REGS }, 120 { "k1", (long *)&ddb_regs.f_regs[_R_K1], DB_SETF_REGS }, 121 { "gp", (long *)&ddb_regs.f_regs[_R_GP], DB_SETF_REGS }, 122 { "sp", (long *)&ddb_regs.f_regs[_R_SP], DB_SETF_REGS }, 123 { "fp", (long *)&ddb_regs.f_regs[_R_S8], DB_SETF_REGS },/* frame ptr */ 124 { "ra", (long *)&ddb_regs.f_regs[_R_RA], DB_SETF_REGS }, 125 { "sr", (long *)&ddb_regs.f_regs[_R_SR], DB_SETF_REGS }, 126 { "mdlo",(long *)&ddb_regs.f_regs[_R_MULLO], DB_SETF_REGS }, 127 { "mdhi",(long *)&ddb_regs.f_regs[_R_MULHI], DB_SETF_REGS }, 128 { "bad", (long *)&ddb_regs.f_regs[_R_BADVADDR], DB_SETF_REGS }, 129 { "cs", (long *)&ddb_regs.f_regs[_R_CAUSE], DB_SETF_REGS }, 130 { "pc", (long *)&ddb_regs.f_regs[_R_PC], DB_SETF_REGS }, 131 }; 132 const struct db_variable * const db_eregs = db_regs + sizeof(db_regs)/sizeof(db_regs[0]); 133 134 void 135 db_stack_trace_print(db_expr_t addr, int have_addr, db_expr_t count, 136 const char *modif, void (*pr)(const char *, ...)) 137 { 138 #ifndef DDB_TRACE 139 struct pcb *pcb; 140 struct proc *p; 141 struct lwp *l; 142 143 if (!have_addr) { 144 stacktrace_subr(ddb_regs.f_regs[_R_A0], 145 ddb_regs.f_regs[_R_A1], 146 ddb_regs.f_regs[_R_A2], 147 ddb_regs.f_regs[_R_A3], 148 ddb_regs.f_regs[_R_PC], 149 ddb_regs.f_regs[_R_SP], 150 /* non-virtual frame pointer */ 151 ddb_regs.f_regs[_R_S8], 152 ddb_regs.f_regs[_R_RA], 153 pr); 154 return; 155 } 156 157 /* "trace/t" */ 158 (*pr)("pid %d ", (int)addr); 159 p = p_find(addr, PFIND_LOCKED); 160 if (p == NULL) { 161 (*pr)("not found\n"); 162 return; 163 } 164 l = LIST_FIRST(&p->p_lwps); /* XXX NJWLWP */ 165 if (!(l->l_flag & L_INMEM)) { 166 (*pr)("swapped out\n"); 167 return; 168 } 169 170 pcb = &(l->l_addr->u_pcb); 171 (*pr)("at %p\n", pcb); 172 173 stacktrace_subr(0,0,0,0, /* no args known */ 174 (int)cpu_switch, 175 pcb->pcb_context[8], 176 pcb->pcb_context[9], 177 pcb->pcb_context[10], 178 pr); 179 #else 180 /* 181 * Incomplete but practically useful stack backtrace. 182 */ 183 #define MIPS_JR_RA 0x03e00008 /* instruction code for jr ra */ 184 #define MIPS_JR_K0 0x03400008 /* instruction code for jr k0 */ 185 #define MIPS_ERET 0x42000018 /* instruction code for eret */ 186 unsigned va, pc, ra, sp, func; 187 int insn; 188 InstFmt i; 189 int stacksize; 190 db_addr_t offset; 191 char *name; 192 extern char verylocore[]; 193 194 pc = ddb_regs.f_regs[_R_PC]; 195 sp = ddb_regs.f_regs[_R_SP]; 196 ra = ddb_regs.f_regs[_R_RA]; 197 do { 198 va = pc; 199 do { 200 va -= sizeof(int); 201 insn = *(int *)va; 202 if (insn == MIPS_ERET) 203 goto mips3_eret; 204 } while (insn != MIPS_JR_RA && insn != MIPS_JR_K0); 205 va += sizeof(int); 206 mips3_eret: 207 va += sizeof(int); 208 while (*(int *)va == 0x00000000) 209 va += sizeof(int); 210 func = va; 211 stacksize = 0; 212 do { 213 i.word = *(int *)va; 214 if (i.IType.op == OP_SW 215 && i.IType.rs == _R_SP 216 && i.IType.rt == _R_RA) 217 ra = *(int *)(sp + (short)i.IType.imm); 218 if (i.IType.op == OP_ADDIU 219 && i.IType.rs == _R_SP 220 && i.IType.rt == _R_SP) 221 stacksize = -(short)i.IType.imm; 222 va += sizeof(int); 223 } while (va < pc); 224 225 db_find_sym_and_offset(func, &name, &offset); 226 if (name == 0) 227 name = "?"; 228 (*pr)("%s()+0x%x, called by %p, stack size %d\n", 229 name, pc - func, (void *)ra, stacksize); 230 231 if (ra == pc) { 232 (*pr)("-- loop? --\n"); 233 return; 234 } 235 sp += stacksize; 236 pc = ra; 237 } while (pc > (unsigned)verylocore); 238 if (pc < 0x80000000) 239 (*pr)("-- user process --\n"); 240 else 241 (*pr)("-- kernel entry --\n"); 242 #endif 243 } 244 245 void 246 db_mips_stack_trace(int count, vaddr_t stackp, vaddr_t the_pc, vaddr_t the_ra, 247 int flags, vaddr_t kstackp) 248 { 249 250 /* nothing... */ 251 } 252 253 254 int 255 db_mips_variable_func (const struct db_variable *vp, db_expr_t *valuep, 256 int db_var_fcn) 257 { 258 259 switch (db_var_fcn) { 260 case DB_VAR_GET: 261 *valuep = *(mips_reg_t *) vp->valuep; 262 break; 263 case DB_VAR_SET: 264 *(mips_reg_t *) vp->valuep = *valuep; 265 break; 266 } 267 return 0; 268 } 269
Indexes created Tue Sep 23 14:10:03 GMT 2025