1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
/* $OpenBSD: debug.c,v 1.6 1998/04/18 22:24:25 deraadt Exp $ */
/*
* Copyright (c) 1997 Michael Shalayeff
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Michael Shalayeff.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
*/
#include <lib/libsa/stand.h>
#include <debug.h>
#include <dev/cons.h>
#ifdef __STDC__
void dprintf __P((const char *fmt, ...));
#else
void dprintf ();
#endif
#define VBASE (0xb8000)
char *const reg_names[] = { REG_NAMES };
const int nreg = NENTS(reg_names);
struct reg reg;
u_int32_t *const reg_values[] = { REG_VALUES(reg) };
char *const trap_names[] = { TRAP_NAMES };
void d_putc __P((dev_t, int));
#ifdef DEBUG_DEBUG
#define CKPT(c) (*(u_short volatile *)(VBASE+160) = (0x1700 | (c)))
#else
#define CKPT(c) /* c */
#endif
int
debug_init()
{
return 0;
}
void
dump_regs(trapno, arg)
u_int trapno, arg;
{
register int i;
/* make it local, so it won't rely on .data/.bss corruption */
struct consdev d_cons, *save_cons;
/* init cons mod */
save_cons = cn_tab;
bzero(&d_cons, sizeof(d_cons));
d_cons.cn_putc = &d_putc;
cn_tab = &d_cons;
/* Trap info */
printf("\ftrap: %u(%x): %s\ncn_tab=%p\n",
trapno, arg, trap_names[trapno], save_cons);
/* Register dump */
for(i = 1; i <= nreg; i++)
printf("%s\t%x%c", reg_names[i-1], *reg_values[i-1],
((i%4)? ' ': '\n'));
dump_mem("Code dump", (void *)*reg_values[8], 8);
/* %ebx (void*)((*reg_values[3] + 15) & ~0x0F) */
dump_mem("Memory dump", (void *)0x1a000, 48);
dump_mem("Stack trace", (void *)(*reg_values[4]), 48);
/* restore the console */
cn_tab = save_cons;
}
void
dump_mem(l, p, n)
char *l;
void *p;
size_t n;
{
register int i;
printf("%s [%p]:%s", l, p, (n > 6? "\n":" "));
for(i = 1; i <= n; i++)
printf("%x%c", *(u_int32_t *)p++, ((i%8)? ' ': '\n'));
if (n % 8)
printf ("\n");
}
u_int d_pos;
void
d_putc(d, c)
dev_t d;
int c;
{
switch (c) {
case '\n': d_pos += 80; break;
case '\r': d_pos -= d_pos % 80; break;
case '\b': d_pos--; break;
case '\f': bzero((void *)VBASE, 80*25*2); d_pos = 0; break;
/* print it */
default:
((u_int16_t volatile *)VBASE)[d_pos++] = 0x0700 | (u_char)c;
break;
}
}
|
