db_sym.c revision 1.6 1 1.1 cgd /*
2 1.1 cgd * Mach Operating System
3 1.1 cgd * Copyright (c) 1991,1990 Carnegie Mellon University
4 1.1 cgd * All Rights Reserved.
5 1.1 cgd *
6 1.1 cgd * Permission to use, copy, modify and distribute this software and its
7 1.1 cgd * documentation is hereby granted, provided that both the copyright
8 1.1 cgd * notice and this permission notice appear in all copies of the
9 1.1 cgd * software, derivative works or modified versions, and any portions
10 1.1 cgd * thereof, and that both notices appear in supporting documentation.
11 1.1 cgd *
12 1.1 cgd * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
13 1.1 cgd * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
14 1.1 cgd * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
15 1.1 cgd *
16 1.1 cgd * Carnegie Mellon requests users of this software to return to
17 1.1 cgd *
18 1.1 cgd * Software Distribution Coordinator or Software.Distribution (at) CS.CMU.EDU
19 1.1 cgd * School of Computer Science
20 1.1 cgd * Carnegie Mellon University
21 1.1 cgd * Pittsburgh PA 15213-3890
22 1.1 cgd *
23 1.1 cgd * any improvements or extensions that they make and grant Carnegie the
24 1.1 cgd * rights to redistribute these changes.
25 1.2 cgd *
26 1.6 mycroft * $Id: db_sym.c,v 1.6 1993/12/18 04:46:39 mycroft Exp $
27 1.1 cgd */
28 1.5 mycroft
29 1.6 mycroft #include <sys/param.h>
30 1.6 mycroft #include <sys/proc.h>
31 1.6 mycroft
32 1.1 cgd #include <machine/db_machdep.h>
33 1.6 mycroft
34 1.1 cgd #include <ddb/db_sym.h>
35 1.1 cgd
36 1.1 cgd /*
37 1.1 cgd * We import from the symbol-table dependent routines:
38 1.1 cgd */
39 1.1 cgd extern db_sym_t X_db_lookup();
40 1.1 cgd extern db_sym_t X_db_search_symbol();
41 1.1 cgd extern boolean_t X_db_line_at_pc();
42 1.1 cgd extern void X_db_symbol_values();
43 1.1 cgd
44 1.1 cgd /*
45 1.1 cgd * Multiple symbol tables
46 1.1 cgd */
47 1.4 brezak #ifndef MAXLKMS
48 1.4 brezak #define MAXLKMS 20
49 1.4 brezak #endif
50 1.4 brezak
51 1.3 brezak #ifndef MAXNOSYMTABS
52 1.4 brezak #define MAXNOSYMTABS MAXLKMS+1 /* Room for kernel + LKM's */
53 1.3 brezak #endif
54 1.1 cgd
55 1.1 cgd db_symtab_t db_symtabs[MAXNOSYMTABS] = {{0,},};
56 1.1 cgd
57 1.1 cgd db_symtab_t *db_last_symtab;
58 1.1 cgd
59 1.1 cgd db_sym_t db_lookup(); /* forward */
60 1.1 cgd
61 1.1 cgd /*
62 1.1 cgd * Add symbol table, with given name, to list of symbol tables.
63 1.1 cgd */
64 1.4 brezak int
65 1.1 cgd db_add_symbol_table(start, end, name, ref)
66 1.1 cgd char *start;
67 1.1 cgd char *end;
68 1.1 cgd char *name;
69 1.1 cgd char *ref;
70 1.1 cgd {
71 1.4 brezak int slot;
72 1.4 brezak
73 1.4 brezak for (slot = 0; slot < MAXNOSYMTABS; slot++) {
74 1.4 brezak if (db_symtabs[slot].name == NULL)
75 1.4 brezak break;
76 1.4 brezak }
77 1.4 brezak if (slot >= MAXNOSYMTABS) {
78 1.1 cgd printf ("No slots left for %s symbol table", name);
79 1.4 brezak return(-1);
80 1.1 cgd }
81 1.1 cgd
82 1.4 brezak db_symtabs[slot].start = start;
83 1.4 brezak db_symtabs[slot].end = end;
84 1.4 brezak db_symtabs[slot].name = name;
85 1.4 brezak db_symtabs[slot].private = ref;
86 1.4 brezak
87 1.4 brezak return(slot);
88 1.4 brezak }
89 1.4 brezak
90 1.4 brezak /*
91 1.4 brezak * Delete a symbol table. Caller is responsible for freeing storage.
92 1.4 brezak */
93 1.4 brezak void
94 1.4 brezak db_del_symbol_table(name)
95 1.4 brezak char *name;
96 1.4 brezak {
97 1.4 brezak int slot;
98 1.4 brezak
99 1.4 brezak for (slot = 0; slot < MAXNOSYMTABS; slot++) {
100 1.4 brezak if (db_symtabs[slot].name &&
101 1.4 brezak ! strcmp(db_symtabs[slot].name, name))
102 1.4 brezak break;
103 1.4 brezak }
104 1.4 brezak if (slot >= MAXNOSYMTABS) {
105 1.4 brezak printf ("Unable to find symbol table slot for %s.", name);
106 1.4 brezak return;
107 1.4 brezak }
108 1.4 brezak
109 1.4 brezak db_symtabs[slot].start = 0;
110 1.4 brezak db_symtabs[slot].end = 0;
111 1.4 brezak db_symtabs[slot].name = 0;
112 1.4 brezak db_symtabs[slot].private = 0;
113 1.1 cgd }
114 1.1 cgd
115 1.1 cgd /*
116 1.4 brezak * db_qualify("vm_map", "netbsd") returns "netbsd:vm_map".
117 1.1 cgd *
118 1.1 cgd * Note: return value points to static data whose content is
119 1.1 cgd * overwritten by each call... but in practice this seems okay.
120 1.1 cgd */
121 1.1 cgd static char *
122 1.1 cgd db_qualify(sym, symtabname)
123 1.1 cgd db_sym_t sym;
124 1.1 cgd register char *symtabname;
125 1.1 cgd {
126 1.1 cgd char *symname;
127 1.1 cgd static char tmp[256];
128 1.1 cgd register char *s;
129 1.1 cgd
130 1.1 cgd db_symbol_values(sym, &symname, 0);
131 1.1 cgd s = tmp;
132 1.1 cgd while (*s++ = *symtabname++) {
133 1.1 cgd }
134 1.1 cgd s[-1] = ':';
135 1.1 cgd while (*s++ = *symname++) {
136 1.1 cgd }
137 1.1 cgd return tmp;
138 1.1 cgd }
139 1.1 cgd
140 1.1 cgd
141 1.1 cgd boolean_t
142 1.1 cgd db_eqname(src, dst, c)
143 1.1 cgd char *src;
144 1.1 cgd char *dst;
145 1.1 cgd char c;
146 1.1 cgd {
147 1.1 cgd if (!strcmp(src, dst))
148 1.1 cgd return (TRUE);
149 1.1 cgd if (src[0] == c)
150 1.1 cgd return (!strcmp(src+1,dst));
151 1.1 cgd return (FALSE);
152 1.1 cgd }
153 1.1 cgd
154 1.1 cgd boolean_t
155 1.1 cgd db_value_of_name(name, valuep)
156 1.1 cgd char *name;
157 1.1 cgd db_expr_t *valuep;
158 1.1 cgd {
159 1.1 cgd db_sym_t sym;
160 1.1 cgd
161 1.1 cgd sym = db_lookup(name);
162 1.1 cgd if (sym == DB_SYM_NULL)
163 1.1 cgd return (FALSE);
164 1.1 cgd db_symbol_values(sym, &name, valuep);
165 1.1 cgd return (TRUE);
166 1.1 cgd }
167 1.1 cgd
168 1.1 cgd
169 1.1 cgd /*
170 1.1 cgd * Lookup a symbol.
171 1.1 cgd * If the symbol has a qualifier (e.g., ux:vm_map),
172 1.1 cgd * then only the specified symbol table will be searched;
173 1.1 cgd * otherwise, all symbol tables will be searched.
174 1.1 cgd */
175 1.1 cgd db_sym_t
176 1.1 cgd db_lookup(symstr)
177 1.1 cgd char *symstr;
178 1.1 cgd {
179 1.1 cgd db_sym_t sp;
180 1.1 cgd register int i;
181 1.1 cgd int symtab_start = 0;
182 1.4 brezak int symtab_end = MAXNOSYMTABS;
183 1.1 cgd register char *cp;
184 1.1 cgd
185 1.1 cgd /*
186 1.1 cgd * Look for, remove, and remember any symbol table specifier.
187 1.1 cgd */
188 1.1 cgd for (cp = symstr; *cp; cp++) {
189 1.1 cgd if (*cp == ':') {
190 1.1 cgd *cp = '\0';
191 1.4 brezak for (i = 0; i < MAXNOSYMTABS; i++) {
192 1.4 brezak if (db_symtabs[i].name &&
193 1.4 brezak ! strcmp(symstr, db_symtabs[i].name)) {
194 1.1 cgd symtab_start = i;
195 1.1 cgd symtab_end = i + 1;
196 1.1 cgd break;
197 1.1 cgd }
198 1.1 cgd }
199 1.1 cgd *cp = ':';
200 1.4 brezak if (i == MAXNOSYMTABS) {
201 1.1 cgd db_error("invalid symbol table name");
202 1.1 cgd }
203 1.1 cgd symstr = cp+1;
204 1.1 cgd }
205 1.1 cgd }
206 1.1 cgd
207 1.1 cgd /*
208 1.1 cgd * Look in the specified set of symbol tables.
209 1.1 cgd * Return on first match.
210 1.1 cgd */
211 1.1 cgd for (i = symtab_start; i < symtab_end; i++) {
212 1.4 brezak if (db_symtabs[i].name &&
213 1.4 brezak (sp = X_db_lookup(&db_symtabs[i], symstr))) {
214 1.1 cgd db_last_symtab = &db_symtabs[i];
215 1.1 cgd return sp;
216 1.1 cgd }
217 1.1 cgd }
218 1.1 cgd return 0;
219 1.1 cgd }
220 1.1 cgd
221 1.1 cgd /*
222 1.1 cgd * Does this symbol name appear in more than one symbol table?
223 1.1 cgd * Used by db_symbol_values to decide whether to qualify a symbol.
224 1.1 cgd */
225 1.1 cgd boolean_t db_qualify_ambiguous_names = FALSE;
226 1.1 cgd
227 1.1 cgd boolean_t
228 1.1 cgd db_symbol_is_ambiguous(sym)
229 1.1 cgd db_sym_t sym;
230 1.1 cgd {
231 1.1 cgd char *sym_name;
232 1.1 cgd register int i;
233 1.1 cgd register
234 1.1 cgd boolean_t found_once = FALSE;
235 1.1 cgd
236 1.1 cgd if (!db_qualify_ambiguous_names)
237 1.1 cgd return FALSE;
238 1.1 cgd
239 1.1 cgd db_symbol_values(sym, &sym_name, 0);
240 1.4 brezak for (i = 0; i < MAXNOSYMTABS; i++) {
241 1.4 brezak if (db_symtabs[i].name &&
242 1.4 brezak X_db_lookup(&db_symtabs[i], sym_name)) {
243 1.1 cgd if (found_once)
244 1.1 cgd return TRUE;
245 1.1 cgd found_once = TRUE;
246 1.1 cgd }
247 1.1 cgd }
248 1.1 cgd return FALSE;
249 1.1 cgd }
250 1.1 cgd
251 1.1 cgd /*
252 1.1 cgd * Find the closest symbol to val, and return its name
253 1.1 cgd * and the difference between val and the symbol found.
254 1.1 cgd */
255 1.1 cgd db_sym_t
256 1.1 cgd db_search_symbol( val, strategy, offp)
257 1.1 cgd register db_addr_t val;
258 1.1 cgd db_strategy_t strategy;
259 1.1 cgd db_expr_t *offp;
260 1.1 cgd {
261 1.1 cgd register
262 1.1 cgd unsigned int diff;
263 1.1 cgd unsigned int newdiff;
264 1.1 cgd register int i;
265 1.1 cgd db_sym_t ret = DB_SYM_NULL, sym;
266 1.1 cgd
267 1.1 cgd newdiff = diff = ~0;
268 1.1 cgd db_last_symtab = 0;
269 1.4 brezak for (i = 0; i < MAXNOSYMTABS; i++) {
270 1.4 brezak if (!db_symtabs[i].name)
271 1.4 brezak continue;
272 1.1 cgd sym = X_db_search_symbol(&db_symtabs[i], val, strategy, &newdiff);
273 1.1 cgd if (newdiff < diff) {
274 1.1 cgd db_last_symtab = &db_symtabs[i];
275 1.1 cgd diff = newdiff;
276 1.1 cgd ret = sym;
277 1.1 cgd }
278 1.1 cgd }
279 1.1 cgd *offp = diff;
280 1.1 cgd return ret;
281 1.1 cgd }
282 1.1 cgd
283 1.1 cgd /*
284 1.1 cgd * Return name and value of a symbol
285 1.1 cgd */
286 1.1 cgd void
287 1.1 cgd db_symbol_values(sym, namep, valuep)
288 1.1 cgd db_sym_t sym;
289 1.1 cgd char **namep;
290 1.1 cgd db_expr_t *valuep;
291 1.1 cgd {
292 1.1 cgd db_expr_t value;
293 1.1 cgd
294 1.1 cgd if (sym == DB_SYM_NULL) {
295 1.1 cgd *namep = 0;
296 1.1 cgd return;
297 1.1 cgd }
298 1.1 cgd
299 1.1 cgd X_db_symbol_values(sym, namep, &value);
300 1.1 cgd
301 1.1 cgd if (db_symbol_is_ambiguous(sym))
302 1.1 cgd *namep = db_qualify(sym, db_last_symtab->name);
303 1.1 cgd if (valuep)
304 1.1 cgd *valuep = value;
305 1.1 cgd }
306 1.1 cgd
307 1.1 cgd
308 1.1 cgd /*
309 1.1 cgd * Print a the closest symbol to value
310 1.1 cgd *
311 1.1 cgd * After matching the symbol according to the given strategy
312 1.1 cgd * we print it in the name+offset format, provided the symbol's
313 1.1 cgd * value is close enough (eg smaller than db_maxoff).
314 1.1 cgd * We also attempt to print [filename:linenum] when applicable
315 1.1 cgd * (eg for procedure names).
316 1.1 cgd *
317 1.1 cgd * If we could not find a reasonable name+offset representation,
318 1.1 cgd * then we just print the value in hex. Small values might get
319 1.1 cgd * bogus symbol associations, e.g. 3 might get some absolute
320 1.1 cgd * value like _INCLUDE_VERSION or something, therefore we do
321 1.1 cgd * not accept symbols whose value is zero (and use plain hex).
322 1.1 cgd */
323 1.1 cgd
324 1.1 cgd unsigned int db_maxoff = 0x10000000;
325 1.1 cgd
326 1.1 cgd void
327 1.1 cgd db_printsym(off, strategy)
328 1.1 cgd db_expr_t off;
329 1.1 cgd db_strategy_t strategy;
330 1.1 cgd {
331 1.1 cgd db_expr_t d;
332 1.1 cgd char *filename;
333 1.1 cgd char *name;
334 1.1 cgd db_expr_t value;
335 1.1 cgd int linenum;
336 1.1 cgd db_sym_t cursym;
337 1.1 cgd
338 1.1 cgd cursym = db_search_symbol(off, strategy, &d);
339 1.1 cgd db_symbol_values(cursym, &name, &value);
340 1.1 cgd if (name == 0 || d >= db_maxoff || value == 0) {
341 1.1 cgd db_printf("%#n", off);
342 1.1 cgd return;
343 1.1 cgd }
344 1.1 cgd db_printf("%s", name);
345 1.1 cgd if (d)
346 1.1 cgd db_printf("+%#r", d);
347 1.1 cgd if (strategy == DB_STGY_PROC) {
348 1.1 cgd if (db_line_at_pc(cursym, &filename, &linenum, off))
349 1.1 cgd db_printf(" [%s:%d]", filename, linenum);
350 1.1 cgd }
351 1.1 cgd }
352 1.1 cgd
353 1.1 cgd
354 1.1 cgd boolean_t
355 1.1 cgd db_line_at_pc( sym, filename, linenum, pc)
356 1.3 brezak db_sym_t sym;
357 1.3 brezak char **filename;
358 1.3 brezak int *linenum;
359 1.3 brezak db_expr_t pc;
360 1.1 cgd {
361 1.1 cgd return X_db_line_at_pc( db_last_symtab, sym, filename, linenum, pc);
362 1.3 brezak }
363 1.3 brezak
364 1.3 brezak int
365 1.3 brezak db_sym_numargs(sym, nargp, argnames)
366 1.3 brezak db_sym_t sym;
367 1.3 brezak int *nargp;
368 1.3 brezak char **argnames;
369 1.3 brezak {
370 1.3 brezak return X_db_sym_numargs(db_last_symtab, sym, nargp, argnames);
371 1.1 cgd }
372