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