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