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