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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
|
/* $OpenBSD: db_sym.c,v 1.21 1997/07/19 22:31:20 niklas Exp $ */
/* $NetBSD: db_sym.c,v 1.12 1996/02/05 01:57:15 christos Exp $ */
/*
* Mach Operating System
* Copyright (c) 1993,1992,1991,1990 Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie Mellon
* the rights to redistribute these changes.
*/
#include <sys/param.h>
#include <sys/proc.h>
#include <sys/malloc.h>
#include <sys/systm.h>
#include <vm/vm.h>
#include <machine/db_machdep.h>
#include <ddb/db_sym.h>
#include <ddb/db_output.h>
#include <ddb/db_extern.h>
#include <ddb/db_command.h>
/*
* Multiple symbol tables
*/
static TAILQ_HEAD(, db_symtab) db_symtabs;
static struct db_symtab db_sym_kernel;
size_t db_nsymtabs = 0;
db_symtab_t db_last_symtab;
/*
* Init sym module
*/
void
db_sym_init(void)
{
TAILQ_INIT(&db_symtabs);
}
/*
* Add symbol table, with given name, to list of symbol tables.
*/
int
db_add_symbol_table(start, end, name, ref, rend)
char *start;
char *end;
char *name;
char *ref;
char *rend;
{
db_symtab_t new = db_nsymtabs? NULL : &db_sym_kernel;
if (new == NULL &&
(new = malloc(sizeof(*new), M_DEVBUF, M_WAITOK)) == NULL)
return -1;
new->start = start;
new->end = end;
new->name = name;
new->private = ref;
new->rend = rend;
new->id = db_nsymtabs;
TAILQ_INSERT_TAIL(&db_symtabs, new, list);
return db_nsymtabs++;
}
/*
* Delete a symbol table. Caller is responsible for freeing storage.
*/
void
db_del_symbol_table(name)
char *name;
{
register db_symtab_t p;
for (p = db_symiter(NULL); p != NULL; p = db_symiter(p))
if (!strcmp(name, p->name))
break;
if (p == NULL)
db_printf("ddb: %s symbol table was not allocated", name);
if (--db_nsymtabs == 0)
panic("ddb: kernel symtab delete");
TAILQ_REMOVE(&db_symtabs, p, list);
free(p, M_DEVBUF);
}
db_symtab_t
db_istab(i)
size_t i;
{
register db_symtab_t p;
for (p = db_symiter(NULL); i && p != NULL ; p = db_symiter(p))
i--;
return i? NULL : p;
}
db_symtab_t
db_symiter(st)
db_symtab_t st;
{
if (st == NULL)
st = db_symtabs.tqh_first;
else
st = st->list.tqe_next;
return st;
}
/*
* db_qualify("vm_map", "bsd") returns "bsd:vm_map".
*
* Note: return value points to static data whose content is
* overwritten by each call... but in practice this seems okay.
*/
char *
db_qualify(sym, symtabname)
db_sym_t sym;
register char *symtabname;
{
char *symname;
static char tmp[256];
register char *s;
db_symbol_values(sym, &symname, 0);
s = tmp;
while ((*s++ = *symtabname++) != '\0')
;
s[-1] = ':';
while ((*s++ = *symname++) != '\0')
;
return tmp;
}
boolean_t
db_eqname(src, dst, c)
char *src;
char *dst;
int c;
{
if (!strcmp(src, dst))
return (TRUE);
if (src[0] == c)
return (!strcmp(src+1,dst));
return (FALSE);
}
#ifdef DDB
boolean_t
db_value_of_name(name, valuep)
char *name;
db_expr_t *valuep;
{
db_sym_t sym;
sym = db_lookup(name);
if (sym == DB_SYM_NULL)
return (FALSE);
db_symbol_values(sym, &name, valuep);
return (TRUE);
}
/*
* Lookup a symbol.
* If the symbol has a qualifier (e.g., ux:vm_map),
* then only the specified symbol table will be searched;
* otherwise, all symbol tables will be searched.
*/
db_sym_t
db_lookup(symstr)
char *symstr;
{
db_symtab_t st = NULL;
db_sym_t sp = NULL;
register char *cp;
/*
* Look for, remove, and remember any symbol table specifier.
*/
for (cp = symstr; *cp; cp++)
if (*cp == ':') {
*cp = '\0';
for (st = db_symiter(NULL);
st != NULL;
st = db_symiter(st))
if (!strcmp(symstr, st->name))
break;
*cp = ':';
if (st == NULL) {
db_error("invalid symbol table name");
/* NOTREACHED */
}
symstr = cp+1;
}
/*
* Look in the specified set of symbol tables.
* Return on first match.
*/
if (st != NULL)
sp = X_db_lookup(st, symstr);
else
for (st = db_symiter(NULL); st != NULL; st = db_symiter(st))
if ((sp = X_db_lookup(st, symstr)) != NULL)
break;
if (sp != NULL && st != NULL)
db_last_symtab = st;
return sp;
}
#endif
/*
* Does this symbol name appear in more than one symbol table?
* Used by db_symbol_values to decide whether to qualify a symbol.
*/
boolean_t db_qualify_ambiguous_names = FALSE;
boolean_t
db_symbol_is_ambiguous(sym)
db_sym_t sym;
{
char *sym_name;
register db_symtab_t st;
register
boolean_t found_once = FALSE;
if (!db_qualify_ambiguous_names)
return FALSE;
db_symbol_values(sym, &sym_name, 0);
for (st = db_symiter(NULL); st != NULL; st = db_symiter(st)) {
if (X_db_lookup(st, sym_name) != NULL) {
if (found_once)
return TRUE;
found_once = TRUE;
}
}
return FALSE;
}
/*
* Find the closest symbol to val, and return its name
* and the difference between val and the symbol found.
*/
db_sym_t
db_search_symbol( val, strategy, offp)
register db_addr_t val;
db_strategy_t strategy;
db_expr_t *offp;
{
register
db_expr_t diff;
db_expr_t newdiff;
db_symtab_t st;
db_sym_t ret = DB_SYM_NULL, sym;
newdiff = diff = -1;
db_last_symtab = 0;
for (st = db_symiter(NULL); st != NULL; st = db_symiter(st)) {
sym = X_db_search_symbol(st, val, strategy, &newdiff);
if (newdiff < diff || diff < 0) {
db_last_symtab = st;
diff = newdiff;
ret = sym;
}
}
*offp = diff;
return ret;
}
/*
* Return name and value of a symbol
*/
void
db_symbol_values(sym, namep, valuep)
db_sym_t sym;
char **namep;
db_expr_t *valuep;
{
db_expr_t value;
if (sym == DB_SYM_NULL) {
*namep = 0;
return;
}
X_db_symbol_values(sym, namep, &value);
if (db_symbol_is_ambiguous(sym))
*namep = db_qualify(sym, db_last_symtab->name);
if (valuep)
*valuep = value;
}
/*
* Print a the closest symbol to value
*
* After matching the symbol according to the given strategy
* we print it in the name+offset format, provided the symbol's
* value is close enough (eg smaller than db_maxoff).
* We also attempt to print [filename:linenum] when applicable
* (eg for procedure names).
*
* If we could not find a reasonable name+offset representation,
* then we just print the value in hex. Small values might get
* bogus symbol associations, e.g. 3 might get some absolute
* value like _INCLUDE_VERSION or something, therefore we do
* not accept symbols whose value is zero (and use plain hex).
* Also, avoid printing as "end+0x????" which is useless.
* The variable db_lastsym is used instead of "end" in case we
* add support for symbols in loadable driver modules.
*/
extern char end[];
u_long db_lastsym = (u_long)end;
db_expr_t db_maxoff = 0x10000000;
void
db_printsym(off, strategy)
db_expr_t off;
db_strategy_t strategy;
{
db_expr_t d;
char *filename;
char *name;
db_expr_t value;
int linenum;
db_sym_t cursym;
if ((u_long)off <= db_lastsym) {
cursym = db_search_symbol(off, strategy, &d);
db_symbol_values(cursym, &name, &value);
if (name && (d < db_maxoff) && value) {
db_printf("%s", name);
if (d)
db_printf("+%#r", d);
if (strategy == DB_STGY_PROC) {
if (db_line_at_pc(cursym, &filename, &linenum,
off))
db_printf(" [%s:%d]", filename,
linenum);
}
return;
}
}
db_printf("%#ln", off);
return;
}
boolean_t
db_line_at_pc( sym, filename, linenum, pc)
db_sym_t sym;
char **filename;
int *linenum;
db_expr_t pc;
{
return X_db_line_at_pc( db_last_symtab, sym, filename, linenum, pc);
}
int
db_sym_numargs(sym, nargp, argnames)
db_sym_t sym;
int *nargp;
char **argnames;
{
return X_db_sym_numargs(db_last_symtab, sym, nargp, argnames);
}
void
db_stub_xh(sym, xh)
db_symtab_t sym;
struct exec *xh;
{
X_db_stub_xh(sym, xh);
}
int
db_symtablen(sym)
db_symtab_t sym;
{
return X_db_symtablen(sym);
}
int
db_symatoff(sym, off, buf, len)
db_symtab_t sym;
int off;
void *buf;
int *len;
{
return X_db_symatoff(sym, off, buf, len);
}
|