2 * Mach Operating System
3 * Copyright (c) 1991,1990 Carnegie Mellon University
6 * Permission to use, copy, modify and distribute this software and its
7 * documentation is hereby granted, provided that both the copyright
8 * notice and this permission notice appear in all copies of the
9 * software, derivative works or modified versions, and any portions
10 * thereof, and that both notices appear in supporting documentation.
12 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
13 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
14 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
16 * Carnegie Mellon requests users of this software to return to
18 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
19 * School of Computer Science
20 * Carnegie Mellon University
21 * Pittsburgh PA 15213-3890
23 * any improvements or extensions that they make and grant Carnegie the
24 * rights to redistribute these changes.
30 * Author: David B. Golub, Carnegie Mellon University
33 #include <sys/param.h>
34 #include <sys/systm.h>
37 #include <ddb/db_sym.h>
40 * Multiple symbol tables
43 #define MAXNOSYMTABS 3 /* mach, ux, emulator */
46 static db_symtab_t db_symtabs[MAXNOSYMTABS] = {{0,},};
47 static int db_nsymtab = 0;
49 static db_symtab_t *db_last_symtab; /* where last symbol was found */
51 static c_db_sym_t db_lookup __P(( const char *symstr));
52 static char *db_qualify __P((c_db_sym_t sym, char *symtabname));
53 static boolean_t db_symbol_is_ambiguous __P((c_db_sym_t sym));
54 static boolean_t db_line_at_pc __P((c_db_sym_t, char **, int *,
58 * Add symbol table, with given name, to list of symbol tables.
61 db_add_symbol_table(start, end, name, ref)
67 if (db_nsymtab >= MAXNOSYMTABS) {
68 printf ("No slots left for %s symbol table", name);
69 panic ("db_sym.c: db_add_symbol_table");
72 db_symtabs[db_nsymtab].start = start;
73 db_symtabs[db_nsymtab].end = end;
74 db_symtabs[db_nsymtab].name = name;
75 db_symtabs[db_nsymtab].private = ref;
80 * db_qualify("vm_map", "ux") returns "unix:vm_map".
82 * Note: return value points to static data whose content is
83 * overwritten by each call... but in practice this seems okay.
86 db_qualify(sym, symtabname)
88 register char *symtabname;
93 db_symbol_values(sym, &symname, 0);
94 snprintf(tmp, sizeof(tmp), "%s:%s", symtabname, symname);
100 db_eqname(src, dst, c)
105 if (!strcmp(src, dst))
108 return (!strcmp(src+1,dst));
113 db_value_of_name(name, valuep)
119 sym = db_lookup(name);
120 if (sym == C_DB_SYM_NULL)
122 db_symbol_values(sym, &name, valuep);
129 * If the symbol has a qualifier (e.g., ux:vm_map),
130 * then only the specified symbol table will be searched;
131 * otherwise, all symbol tables will be searched.
139 int symtab_start = 0;
140 int symtab_end = db_nsymtab;
141 register const char *cp;
144 * Look for, remove, and remember any symbol table specifier.
146 for (cp = symstr; *cp; cp++) {
148 for (i = 0; i < db_nsymtab; i++) {
149 int n = strlen(db_symtabs[i].name);
152 n == (cp - symstr) &&
153 strncmp(symstr, db_symtabs[i].name, n) == 0
160 if (i == db_nsymtab) {
161 db_error("invalid symbol table name");
168 * Look in the specified set of symbol tables.
169 * Return on first match.
171 for (i = symtab_start; i < symtab_end; i++) {
172 sp = X_db_lookup(&db_symtabs[i], symstr);
174 db_last_symtab = &db_symtabs[i];
182 * If TRUE, check across symbol tables for multiple occurrences
183 * of a name. Might slow things down quite a bit.
185 static volatile boolean_t db_qualify_ambiguous_names = FALSE;
188 * Does this symbol name appear in more than one symbol table?
189 * Used by db_symbol_values to decide whether to qualify a symbol.
192 db_symbol_is_ambiguous(sym)
195 const char *sym_name;
198 boolean_t found_once = FALSE;
200 if (!db_qualify_ambiguous_names)
203 db_symbol_values(sym, &sym_name, 0);
204 for (i = 0; i < db_nsymtab; i++) {
205 if (X_db_lookup(&db_symtabs[i], sym_name)) {
215 * Find the closest symbol to val, and return its name
216 * and the difference between val and the symbol found.
219 db_search_symbol( val, strategy, offp)
220 register db_addr_t val;
221 db_strategy_t strategy;
228 c_db_sym_t ret = C_DB_SYM_NULL, sym;
232 for (i = 0; i < db_nsymtab; i++) {
233 sym = X_db_search_symbol(&db_symtabs[i], val, strategy, &newdiff);
234 if (newdiff < diff) {
235 db_last_symtab = &db_symtabs[i];
245 * Return name and value of a symbol
248 db_symbol_values(sym, namep, valuep)
255 if (sym == DB_SYM_NULL) {
260 X_db_symbol_values(db_last_symtab, sym, namep, &value);
262 if (db_symbol_is_ambiguous(sym))
263 *namep = db_qualify(sym, db_last_symtab->name);
270 * Print a the closest symbol to value
272 * After matching the symbol according to the given strategy
273 * we print it in the name+offset format, provided the symbol's
274 * value is close enough (eg smaller than db_maxoff).
275 * We also attempt to print [filename:linenum] when applicable
276 * (eg for procedure names).
278 * If we could not find a reasonable name+offset representation,
279 * then we just print the value in hex. Small values might get
280 * bogus symbol associations, e.g. 3 might get some absolute
281 * value like _INCLUDE_VERSION or something, therefore we do
282 * not accept symbols whose value is "small" (and use plain hex).
285 db_expr_t db_maxoff = 0x10000;
288 db_printsym(off, strategy)
290 db_strategy_t strategy;
299 cursym = db_search_symbol(off, strategy, &d);
300 db_symbol_values(cursym, &name, &value);
303 if (value >= DB_SMALL_VALUE_MIN && value <= DB_SMALL_VALUE_MAX) {
304 db_printf("%+#lr", (long)off);
307 if (name == 0 || d >= (unsigned long)db_maxoff) {
308 db_printf("%#lr", (unsigned long)off);
311 db_printf("%s", name);
313 db_printf("+%+#lr", (long)d);
314 if (strategy == DB_STGY_PROC) {
315 if (db_line_at_pc(cursym, &filename, &linenum, off))
316 db_printf(" [%s:%d]", filename, linenum);
321 db_line_at_pc( sym, filename, linenum, pc)
327 return X_db_line_at_pc( db_last_symtab, sym, filename, linenum, pc);
331 db_sym_numargs(sym, nargp, argnames)
336 return X_db_sym_numargs(db_last_symtab, sym, nargp, argnames);