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
|
/*
* Mach Operating System
* Copyright (c) 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.
*/
/*
* Author: Alessandro Forin, Carnegie Mellon University
* Date: 8/90
*/
#ifndef _DDB_DB_SYM_H_
#define _DDB_DB_SYM_H_
#include <mach/boolean.h>
#include <mach/machine/vm_types.h>
#include <machine/db_machdep.h>
/*
* This module can handle multiple symbol tables,
* of multiple types, at the same time
*/
#define SYMTAB_NAME_LEN 32
typedef struct {
int type;
#define SYMTAB_AOUT 0
#define SYMTAB_COFF 1
#define SYMTAB_MACHDEP 2
char *start; /* symtab location */
char *end;
char *private; /* optional machdep pointer */
char *map_pointer; /* symbols are for this map only,
if not null */
char name[SYMTAB_NAME_LEN];
/* symtab name */
} db_symtab_t;
extern db_symtab_t *db_last_symtab; /* where last symbol was found */
/*
* Symbol representation is specific to the symtab style:
* BSD compilers use dbx' nlist, other compilers might use
* a different one
*/
typedef char * db_sym_t; /* opaque handle on symbols */
#define DB_SYM_NULL ((db_sym_t)0)
/*
* Non-stripped symbol tables will have duplicates, for instance
* the same string could match a parameter name, a local var, a
* global var, etc.
* We are most concerned with the following matches.
*/
typedef int db_strategy_t; /* search strategy */
#define DB_STGY_ANY 0 /* anything goes */
#define DB_STGY_XTRN 1 /* only external symbols */
#define DB_STGY_PROC 2 /* only procedures */
extern boolean_t db_qualify_ambiguous_names;
/* if TRUE, check across symbol tables
* for multiple occurrences of a name.
* Might slow down quite a bit
* ..but the machine has nothing
* else to do, now does it ? */
/*
* Functions exported by the symtable module
*/
/* extend the list of symbol tables */
extern boolean_t db_add_symbol_table( int type,
char * start,
char * end,
char *name,
char *ref,
char *map_pointer );
/* find symbol value given name */
extern int db_value_of_name( char* name, db_expr_t* valuep);
/* find symbol given value */
extern db_sym_t db_search_task_symbol( db_addr_t val,
db_strategy_t strategy,
db_addr_t *offp,
task_t task );
/* return name and value of symbol */
extern void db_symbol_values( db_symtab_t *stab,
db_sym_t sym,
char** namep,
db_expr_t* valuep);
/* find name&value given approx val */
#define db_find_sym_and_offset(val,namep,offp) \
do { \
db_sym_t s; \
db_symbol_values(0, s = db_search_symbol(val,DB_STGY_ANY,offp) \
,namep,0); \
db_free_symbol(s); \
} while(0);
/* ditto, but no locals */
#define db_find_xtrn_sym_and_offset(val,namep,offp) \
do { \
db_sym_t s; \
db_symbol_values(0, s = db_search_symbol(val,DB_STGY_XTRN,offp) \
,namep,0); \
db_free_symbol(s); \
} while(0);
/* find name&value given approx val */
#define db_find_task_sym_and_offset(val,namep,offp,task) \
do { \
db_sym_t s; \
db_symbol_values(0, s = db_search_task_symbol(val,DB_STGY_ANY \
,offp,task), \
namep, 0); \
db_free_symbol(s); \
} while(0);
/* ditto, but no locals */
#define db_find_xtrn_task_sym_and_offset(val,namep,offp,task) \
do { \
db_sym_t s; \
db_symbol_values(0, s = db_search_task_symbol(val,DB_STGY_XTRN \
,offp,task), \
namep,0); \
db_free_symbol(s); \
} while(0);
/* find symbol in current task */
#define db_search_symbol(val,strgy,offp) \
db_search_task_symbol(val,strgy,offp,0)
/* strcmp, modulo leading char */
extern boolean_t db_eqname( char* src, char* dst, char c );
/* print closest symbol to a value */
extern void db_task_printsym( db_expr_t off,
db_strategy_t strategy,
task_t task);
/* print closest symbol to a value */
extern void db_printsym( db_expr_t off, db_strategy_t strategy);
/* free a symbol */
extern void db_free_symbol(db_sym_t s);
/*
* Symbol table switch, defines the interface
* to symbol-table specific routines.
*/
extern struct db_sym_switch {
boolean_t (*init)(
char *start,
char *end,
char *name,
char *task_addr
);
db_sym_t (*lookup)(
db_symtab_t *stab,
char *symstr
);
db_sym_t (*search_symbol)(
db_symtab_t *stab,
db_addr_t off,
db_strategy_t strategy,
db_expr_t *diffp
);
boolean_t (*line_at_pc)(
db_symtab_t *stab,
db_sym_t sym,
char **file,
int *line,
db_expr_t pc
);
void (*symbol_values)(
db_symtab_t *stab,
db_sym_t sym,
char **namep,
db_expr_t *valuep
);
void (*free_symbol)(
db_sym_t sym
);
} x_db[];
#ifndef symtab_type
#define symtab_type(s) SYMTAB_AOUT
#endif
#define X_db_sym_init(s,e,n,t) x_db[symtab_type(s)].init(s,e,n,t)
#define X_db_lookup(s,n) x_db[(s)->type].lookup(s,n)
#define X_db_search_symbol(s,o,t,d) x_db[(s)->type].search_symbol(s,o,t,d)
#define X_db_line_at_pc(s,p,f,l,a) x_db[(s)->type].line_at_pc(s,p,f,l,a)
#define X_db_symbol_values(s,p,n,v) x_db[(s)->type].symbol_values(s,p,n,v)
#define X_db_free_symbol(s,m) x_db[(s)->type].free_symbol(m)
extern boolean_t db_line_at_pc(
db_sym_t sym,
char **filename,
int *linenum,
db_expr_t pc);
extern boolean_t aout_db_sym_init(
char *symtab,
char *esymtab,
char *name,
char *task_addr);
db_sym_t db_lookup(char *);
db_sym_t
db_search_in_task_symbol(
db_addr_t val,
db_strategy_t strategy,
db_addr_t *offp,
task_t task);
extern db_sym_t
db_sym_parse_and_lookup(
db_sym_t (*func)(),
db_symtab_t *symtab,
char *symstr);
#endif /* _DDB_DB_SYM_H_ */
|
