db_trace.c revision 1.34 1 /* $NetBSD: db_trace.c,v 1.34 2007/05/17 14:51:23 yamt 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.34 2007/05/17 14:51:23 yamt 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 #include <sys/cpu.h>
38
39 #include <mips/mips_opcode.h>
40
41 #include <machine/db_machdep.h>
42
43 #include <ddb/db_interface.h>
44 #include <ddb/db_output.h>
45 #include <ddb/db_variables.h>
46 #include <ddb/db_sym.h>
47
48 int __start(void); /* lowest kernel code address */
49 vaddr_t getreg_val(db_expr_t regno);
50
51 #define REG_ARG(i) (4+i)
52 #define SAVES_RA(x) isa_spill((x),31)
53
54 #define KERN_SAVE_REG_IDX(vp) ( \
55 ((vp)->valuep >= (int *)(&((struct mips_saved_state *)0)->s0) && \
56 (vp)->valuep <= (int *)(&((struct mips_saved_state *)0)->s7))? \
57 vp->valuep - (int *)(&((struct mips_saved_state *)0)->s0): \
58 ((vp)->valuep >= (int *)(&((struct mips_saved_state *)0)->sp) && \
59 (vp)->valuep <= (int *)(&((struct mips_saved_state *)0)->ra))? \
60 ((vp)->valuep-(int *)(&((struct mips_saved_state *)0)->sp)) + \
61 ((int *)(&((struct mips_kernel_state *)0)->sp) - (int *)0): \
62 -1)
63
64 db_sym_t localsym(db_sym_t sym, bool isreg, int *lex_level);
65
66 /*
67 * Machine register set.
68 */
69 struct mips_saved_state *db_cur_exc_frame = 0;
70
71 /*XXX*/
72 void stacktrace_subr(int, int, int, int, u_int, u_int, u_int, u_int,
73 void (*)(const char*, ...));
74
75 /*
76 * Stack trace helper.
77 */
78 void db_mips_stack_trace(int, vaddr_t, vaddr_t, vaddr_t, int, vaddr_t);
79 int db_mips_variable_func(const struct db_variable *, db_expr_t *, int);
80
81 #define DB_SETF_REGS db_mips_variable_func
82 #define DBREGS_REG()
83
84 const struct db_variable db_regs[] = {
85 { "at", (long *)&ddb_regs.f_regs[_R_AST], DB_SETF_REGS },
86 { "v0", (long *)&ddb_regs.f_regs[_R_V0], DB_SETF_REGS },
87 { "v1", (long *)&ddb_regs.f_regs[_R_V1], DB_SETF_REGS },
88 { "a0", (long *)&ddb_regs.f_regs[_R_A0], DB_SETF_REGS },
89 { "a1", (long *)&ddb_regs.f_regs[_R_A1], DB_SETF_REGS },
90 { "a2", (long *)&ddb_regs.f_regs[_R_A2], DB_SETF_REGS },
91 { "a3", (long *)&ddb_regs.f_regs[_R_A3], DB_SETF_REGS },
92 #if defined(__mips_n32) || defined(__mips_n64)
93 { "a4", (long *)&ddb_regs.f_regs[_R_A4], DB_SETF_REGS },
94 { "a5", (long *)&ddb_regs.f_regs[_R_A5], DB_SETF_REGS },
95 { "a6", (long *)&ddb_regs.f_regs[_R_A6], DB_SETF_REGS },
96 { "a7", (long *)&ddb_regs.f_regs[_R_A7], DB_SETF_REGS },
97 { "t0", (long *)&ddb_regs.f_regs[_R_T0], DB_SETF_REGS },
98 { "t1", (long *)&ddb_regs.f_regs[_R_T1], DB_SETF_REGS },
99 { "t2", (long *)&ddb_regs.f_regs[_R_T2], DB_SETF_REGS },
100 { "t3", (long *)&ddb_regs.f_regs[_R_T3], DB_SETF_REGS },
101 #else
102 { "t0", (long *)&ddb_regs.f_regs[_R_T0], DB_SETF_REGS },
103 { "t1", (long *)&ddb_regs.f_regs[_R_T1], DB_SETF_REGS },
104 { "t2", (long *)&ddb_regs.f_regs[_R_T2], DB_SETF_REGS },
105 { "t3", (long *)&ddb_regs.f_regs[_R_T3], DB_SETF_REGS },
106 { "t4", (long *)&ddb_regs.f_regs[_R_T4], DB_SETF_REGS },
107 { "t5", (long *)&ddb_regs.f_regs[_R_T5], DB_SETF_REGS },
108 { "t6", (long *)&ddb_regs.f_regs[_R_T6], DB_SETF_REGS },
109 { "t7", (long *)&ddb_regs.f_regs[_R_T7], DB_SETF_REGS },
110 #endif /* __mips_n32 || __mips_n64 */
111 { "s0", (long *)&ddb_regs.f_regs[_R_S0], DB_SETF_REGS },
112 { "s1", (long *)&ddb_regs.f_regs[_R_S1], DB_SETF_REGS },
113 { "s2", (long *)&ddb_regs.f_regs[_R_S2], DB_SETF_REGS },
114 { "s3", (long *)&ddb_regs.f_regs[_R_S3], DB_SETF_REGS },
115 { "s4", (long *)&ddb_regs.f_regs[_R_S4], DB_SETF_REGS },
116 { "s5", (long *)&ddb_regs.f_regs[_R_S5], DB_SETF_REGS },
117 { "s6", (long *)&ddb_regs.f_regs[_R_S6], DB_SETF_REGS },
118 { "s7", (long *)&ddb_regs.f_regs[_R_S7], DB_SETF_REGS },
119 { "t8", (long *)&ddb_regs.f_regs[_R_T8], DB_SETF_REGS },
120 { "t9", (long *)&ddb_regs.f_regs[_R_T9], DB_SETF_REGS },
121 { "k0", (long *)&ddb_regs.f_regs[_R_K0], DB_SETF_REGS },
122 { "k1", (long *)&ddb_regs.f_regs[_R_K1], DB_SETF_REGS },
123 { "gp", (long *)&ddb_regs.f_regs[_R_GP], DB_SETF_REGS },
124 { "sp", (long *)&ddb_regs.f_regs[_R_SP], DB_SETF_REGS },
125 { "fp", (long *)&ddb_regs.f_regs[_R_S8], DB_SETF_REGS },/* frame ptr */
126 { "ra", (long *)&ddb_regs.f_regs[_R_RA], DB_SETF_REGS },
127 { "sr", (long *)&ddb_regs.f_regs[_R_SR], DB_SETF_REGS },
128 { "mdlo",(long *)&ddb_regs.f_regs[_R_MULLO], DB_SETF_REGS },
129 { "mdhi",(long *)&ddb_regs.f_regs[_R_MULHI], DB_SETF_REGS },
130 { "bad", (long *)&ddb_regs.f_regs[_R_BADVADDR], DB_SETF_REGS },
131 { "cs", (long *)&ddb_regs.f_regs[_R_CAUSE], DB_SETF_REGS },
132 { "pc", (long *)&ddb_regs.f_regs[_R_PC], DB_SETF_REGS },
133 };
134 const struct db_variable * const db_eregs = db_regs + sizeof(db_regs)/sizeof(db_regs[0]);
135
136 void
137 db_stack_trace_print(db_expr_t addr, bool have_addr, db_expr_t count,
138 const char *modif, void (*pr)(const char *, ...))
139 {
140 #ifndef DDB_TRACE
141 struct pcb *pcb;
142 struct proc *p;
143 struct lwp *l;
144
145 if (!have_addr) {
146 stacktrace_subr(ddb_regs.f_regs[_R_A0],
147 ddb_regs.f_regs[_R_A1],
148 ddb_regs.f_regs[_R_A2],
149 ddb_regs.f_regs[_R_A3],
150 ddb_regs.f_regs[_R_PC],
151 ddb_regs.f_regs[_R_SP],
152 /* non-virtual frame pointer */
153 ddb_regs.f_regs[_R_S8],
154 ddb_regs.f_regs[_R_RA],
155 pr);
156 return;
157 }
158
159 /* "trace/t" */
160 (*pr)("pid %d ", (int)addr);
161 p = p_find(addr, PFIND_LOCKED);
162 if (p == NULL) {
163 (*pr)("not found\n");
164 return;
165 }
166 l = LIST_FIRST(&p->p_lwps); /* XXX NJWLWP */
167 if (!(l->l_flag & LW_INMEM)) {
168 (*pr)("swapped out\n");
169 return;
170 }
171
172 pcb = &(l->l_addr->u_pcb);
173 (*pr)("at %p\n", pcb);
174
175 stacktrace_subr(0,0,0,0, /* no args known */
176 (int)cpu_switchto,
177 pcb->pcb_context[8],
178 pcb->pcb_context[9],
179 pcb->pcb_context[10],
180 pr);
181 #else
182 /*
183 * Incomplete but practically useful stack backtrace.
184 */
185 #define MIPS_JR_RA 0x03e00008 /* instruction code for jr ra */
186 #define MIPS_JR_K0 0x03400008 /* instruction code for jr k0 */
187 #define MIPS_ERET 0x42000018 /* instruction code for eret */
188 unsigned va, pc, ra, sp, func;
189 int insn;
190 InstFmt i;
191 int stacksize;
192 db_addr_t offset;
193 const char *name;
194 extern char verylocore[];
195
196 pc = ddb_regs.f_regs[_R_PC];
197 sp = ddb_regs.f_regs[_R_SP];
198 ra = ddb_regs.f_regs[_R_RA];
199 do {
200 va = pc;
201 do {
202 va -= sizeof(int);
203 insn = *(int *)va;
204 if (insn == MIPS_ERET)
205 goto mips3_eret;
206 } while (insn != MIPS_JR_RA && insn != MIPS_JR_K0);
207 va += sizeof(int);
208 mips3_eret:
209 va += sizeof(int);
210 while (*(int *)va == 0x00000000)
211 va += sizeof(int);
212 func = va;
213 stacksize = 0;
214 do {
215 i.word = *(int *)va;
216 if (i.IType.op == OP_SW
217 && i.IType.rs == _R_SP
218 && i.IType.rt == _R_RA)
219 ra = *(int *)(sp + (short)i.IType.imm);
220 if (i.IType.op == OP_ADDIU
221 && i.IType.rs == _R_SP
222 && i.IType.rt == _R_SP)
223 stacksize = -(short)i.IType.imm;
224 va += sizeof(int);
225 } while (va < pc);
226
227 db_find_sym_and_offset(func, &name, &offset);
228 if (name == 0)
229 name = "?";
230 (*pr)("%s()+0x%x, called by %p, stack size %d\n",
231 name, pc - func, (void *)ra, stacksize);
232
233 if (ra == pc) {
234 (*pr)("-- loop? --\n");
235 return;
236 }
237 sp += stacksize;
238 pc = ra;
239 } while (pc > (unsigned)verylocore);
240 if (pc < 0x80000000)
241 (*pr)("-- user process --\n");
242 else
243 (*pr)("-- kernel entry --\n");
244 #endif
245 }
246
247 void
248 db_mips_stack_trace(int count, vaddr_t stackp, vaddr_t the_pc, vaddr_t the_ra,
249 int flags, vaddr_t kstackp)
250 {
251
252 /* nothing... */
253 }
254
255
256 int
257 db_mips_variable_func (const struct db_variable *vp, db_expr_t *valuep,
258 int db_var_fcn)
259 {
260
261 switch (db_var_fcn) {
262 case DB_VAR_GET:
263 *valuep = *(mips_reg_t *) vp->valuep;
264 break;
265 case DB_VAR_SET:
266 *(mips_reg_t *) vp->valuep = *valuep;
267 break;
268 }
269 return 0;
270 }
271