db_trace.c revision 1.13
1 /* $NetBSD: db_trace.c,v 1.13 2000/05/27 02:13:12 soren 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/types.h> 30 #include <sys/param.h> 31 #include <vm/vm_param.h> /* XXX boolean_t */ 32 33 #include <mips/mips_opcode.h> 34 35 #include <machine/param.h> 36 #include <machine/db_machdep.h> 37 #include <ddb/db_interface.h> 38 #include <ddb/db_output.h> 39 #include <ddb/db_variables.h> 40 #include <ddb/db_sym.h> 41 42 int __start __P((void)); /* lowest kernel code address */ 43 vaddr_t getreg_val __P((db_expr_t regno)); 44 45 #define REG_ARG(i) (4+i) 46 #define SAVES_RA(x) isa_spill((x),31) 47 48 #define KERN_SAVE_REG_IDX(vp) ( \ 49 ((vp)->valuep >= (int *)(&((struct mips_saved_state *)0)->s0) && \ 50 (vp)->valuep <= (int *)(&((struct mips_saved_state *)0)->s7))? \ 51 vp->valuep - (int *)(&((struct mips_saved_state *)0)->s0): \ 52 ((vp)->valuep >= (int *)(&((struct mips_saved_state *)0)->sp) && \ 53 (vp)->valuep <= (int *)(&((struct mips_saved_state *)0)->ra))? \ 54 ((vp)->valuep-(int *)(&((struct mips_saved_state *)0)->sp)) + \ 55 ((int *)(&((struct mips_kernel_state *)0)->sp) - (int *)0): \ 56 -1) 57 58 db_sym_t localsym __P((db_sym_t sym, boolean_t isreg, int *lex_level)); 59 60 /* 61 * Machine register set. 62 */ 63 struct mips_saved_state *db_cur_exc_frame = 0; 64 65 /* 66 * forward declarations 67 */ 68 int print_exception_frame __P((struct mips_saved_state *fp, 69 unsigned epc)); 70 71 /*XXX*/ 72 void stacktrace_subr __P((int a0, int a1, int a2, int a3, 73 u_int pc, u_int sp, u_int fp, u_int ra, 74 void (*)(const char*, ...))); 75 76 /* 77 * Stack trace helper. 78 */ 79 void db_mips_stack_trace __P((int count, vaddr_t stackp, 80 vaddr_t the_pc, vaddr_t the_ra, int flags, 81 vaddr_t kstackp)); 82 int db_mips_variable_func __P((struct db_variable *vp, db_expr_t *valuep, 83 int db_var_fun)); 84 85 #define DB_SETF_REGS db_mips_variable_func 86 #define DBREGS_REG() 87 88 struct db_variable db_regs[] = { 89 { "at", (long *)&ddb_regs.f_regs[AST], DB_SETF_REGS }, 90 { "v0", (long *)&ddb_regs.f_regs[V0], DB_SETF_REGS }, 91 { "v1", (long *)&ddb_regs.f_regs[V1], DB_SETF_REGS }, 92 { "a0", (long *)&ddb_regs.f_regs[A0], DB_SETF_REGS }, 93 { "a1", (long *)&ddb_regs.f_regs[A1], DB_SETF_REGS }, 94 { "a2", (long *)&ddb_regs.f_regs[A2], DB_SETF_REGS }, 95 { "a3", (long *)&ddb_regs.f_regs[A3], DB_SETF_REGS }, 96 { "t0", (long *)&ddb_regs.f_regs[T0], DB_SETF_REGS }, 97 { "t1", (long *)&ddb_regs.f_regs[T1], DB_SETF_REGS }, 98 { "t2", (long *)&ddb_regs.f_regs[T2], DB_SETF_REGS }, 99 { "t3", (long *)&ddb_regs.f_regs[T3], DB_SETF_REGS }, 100 { "t4", (long *)&ddb_regs.f_regs[T4], DB_SETF_REGS }, 101 { "t5", (long *)&ddb_regs.f_regs[T5], DB_SETF_REGS }, 102 { "t6", (long *)&ddb_regs.f_regs[T6], DB_SETF_REGS }, 103 { "t7", (long *)&ddb_regs.f_regs[T7], DB_SETF_REGS }, 104 { "s0", (long *)&ddb_regs.f_regs[S0], DB_SETF_REGS }, 105 { "s1", (long *)&ddb_regs.f_regs[S1], DB_SETF_REGS }, 106 { "s2", (long *)&ddb_regs.f_regs[S2], DB_SETF_REGS }, 107 { "s3", (long *)&ddb_regs.f_regs[S3], DB_SETF_REGS }, 108 { "s4", (long *)&ddb_regs.f_regs[S4], DB_SETF_REGS }, 109 { "s5", (long *)&ddb_regs.f_regs[S5], DB_SETF_REGS }, 110 { "s6", (long *)&ddb_regs.f_regs[S6], DB_SETF_REGS }, 111 { "s7", (long *)&ddb_regs.f_regs[S7], DB_SETF_REGS }, 112 { "t8", (long *)&ddb_regs.f_regs[T8], DB_SETF_REGS }, 113 { "t9", (long *)&ddb_regs.f_regs[T9], DB_SETF_REGS }, 114 { "k0", (long *)&ddb_regs.f_regs[K0], DB_SETF_REGS }, 115 { "k1", (long *)&ddb_regs.f_regs[K1], DB_SETF_REGS }, 116 { "gp", (long *)&ddb_regs.f_regs[GP], DB_SETF_REGS }, 117 { "sp", (long *)&ddb_regs.f_regs[SP], DB_SETF_REGS }, 118 { "fp", (long *)&ddb_regs.f_regs[S8], DB_SETF_REGS }, /* frame ptr */ 119 { "ra", (long *)&ddb_regs.f_regs[RA], DB_SETF_REGS }, 120 { "sr", (long *)&ddb_regs.f_regs[SR], DB_SETF_REGS }, 121 { "mdlo",(long *)&ddb_regs.f_regs[MULLO], DB_SETF_REGS }, 122 { "mdhi",(long *)&ddb_regs.f_regs[MULHI], DB_SETF_REGS }, 123 { "bad", (long *)&ddb_regs.f_regs[BADVADDR], DB_SETF_REGS }, 124 { "cs", (long *)&ddb_regs.f_regs[CAUSE], DB_SETF_REGS }, 125 { "pc", (long *)&ddb_regs.f_regs[PC], DB_SETF_REGS }, 126 }; 127 struct db_variable *db_eregs = db_regs + sizeof(db_regs)/sizeof(db_regs[0]); 128 129 void 130 db_stack_trace_print(addr, have_addr, count, modif, pr) 131 db_expr_t addr; 132 boolean_t have_addr; 133 db_expr_t count; 134 char *modif; 135 void (*pr) __P((const char *, ...)); 136 { 137 #ifndef DDB_TRACE 138 stacktrace_subr(ddb_regs.f_regs[A0], ddb_regs.f_regs[A1], 139 ddb_regs.f_regs[A2], ddb_regs.f_regs[A3], 140 ddb_regs.f_regs[PC], 141 ddb_regs.f_regs[SP], 142 ddb_regs.f_regs[S8], /* non-virtual frame pointer */ 143 ddb_regs.f_regs[RA], 144 pr); 145 #else 146 /* 147 * Incomplete but practically useful stack backtrace. 148 */ 149 #define MIPS_JR_RA 0x03e00008 /* instruction code for jr ra */ 150 #define MIPS_JR_K0 0x03400008 /* instruction code for jr k0 */ 151 #define MIPS_ERET 0x42000018 /* instruction code for eret */ 152 unsigned va, pc, ra, sp, func; 153 int insn; 154 InstFmt i; 155 int stacksize; 156 db_addr_t offset; 157 char *name; 158 extern char verylocore[]; 159 160 pc = ddb_regs.f_regs[PC]; 161 sp = ddb_regs.f_regs[SP]; 162 ra = ddb_regs.f_regs[RA]; 163 do { 164 va = pc; 165 do { 166 va -= sizeof(int); 167 insn = *(int *)va; 168 if (insn == MIPS_ERET) 169 goto mips3_eret; 170 } while (insn != MIPS_JR_RA && insn != MIPS_JR_K0); 171 va += sizeof(int); 172 mips3_eret: 173 va += sizeof(int); 174 while (*(int *)va == 0x00000000) 175 va += sizeof(int); 176 func = va; 177 stacksize = 0; 178 do { 179 i.word = *(int *)va; 180 if (i.IType.op == OP_SW 181 && i.IType.rs == SP 182 && i.IType.rt == RA) 183 ra = *(int *)(sp + (short)i.IType.imm); 184 if (i.IType.op == OP_ADDIU 185 && i.IType.rs == SP 186 && i.IType.rt == SP) 187 stacksize = -(short)i.IType.imm; 188 va += sizeof(int); 189 } while (va < pc); 190 191 db_find_sym_and_offset(func, &name, &offset); 192 if (name == 0) 193 name = "?"; 194 (*pr)("%s()+0x%x, called by %p, stack size %d\n", 195 name, pc - func, (void *)ra, stacksize); 196 197 if (ra == pc) { 198 (*pr)("-- loop? --\n"); 199 return; 200 } 201 sp += stacksize; 202 pc = ra; 203 } while (pc > (unsigned)verylocore); 204 if (pc < 0x80000000) 205 (*pr)("-- user process --\n"); 206 else 207 (*pr)("-- kernel entry --\n"); 208 #endif 209 } 210 211 void 212 db_mips_stack_trace(count, stackp, the_pc, the_ra, flags, kstackp) 213 int count; 214 vaddr_t stackp, the_pc, the_ra; 215 int flags; 216 vaddr_t kstackp; 217 { 218 return; 219 } 220 221 222 int 223 db_mips_variable_func (struct db_variable *vp, 224 db_expr_t *valuep, 225 int db_var_fcn) 226 { 227 switch (db_var_fcn) { 228 case DB_VAR_GET: 229 *valuep = *(mips_reg_t *) vp->valuep; 230 break; 231 case DB_VAR_SET: 232 *(mips_reg_t *) vp->valuep = *valuep; 233 break; 234 } 235 return 0; 236 } 237
Indexes created Tue Sep 23 07:09:52 GMT 2025