Commit | Line | Data |
---|---|---|
35f5886e FF |
1 | /* DWARF debugging format support for GDB. |
2 | Copyright (C) 1991 Free Software Foundation, Inc. | |
3 | Written by Fred Fish at Cygnus Support, portions based on dbxread.c, | |
4 | mipsread.c, coffread.c, and dwarfread.c from a Data General SVR4 gdb port. | |
5 | ||
6 | This file is part of GDB. | |
7 | ||
8 | This program is free software; you can redistribute it and/or modify | |
9 | it under the terms of the GNU General Public License as published by | |
10 | the Free Software Foundation; either version 2 of the License, or | |
11 | (at your option) any later version. | |
12 | ||
13 | This program is distributed in the hope that it will be useful, | |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with this program; if not, write to the Free Software | |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
21 | ||
22 | /* | |
23 | ||
24 | FIXME: Figure out how to get the frame pointer register number in the | |
25 | execution environment of the target. Remove R_FP kludge | |
26 | ||
27 | FIXME: Add generation of dependencies list to partial symtab code. | |
28 | ||
29 | FIXME: Currently we ignore host/target byte ordering and integer size | |
30 | differences. Should remap data from external form to an internal form | |
31 | before trying to use it. | |
32 | ||
33 | FIXME: Resolve minor differences between what information we put in the | |
34 | partial symbol table and what dbxread puts in. For example, we don't yet | |
35 | put enum constants there. And dbxread seems to invent a lot of typedefs | |
36 | we never see. Use the new printpsym command to see the partial symbol table | |
37 | contents. | |
38 | ||
39 | FIXME: Change forward declarations of static functions to allow for compilers | |
40 | without prototypes. | |
41 | ||
42 | FIXME: Figure out a better way to tell gdb (all the debug reading routines) | |
43 | the names of the gccX_compiled flags. | |
44 | ||
45 | FIXME: Figure out a better way to tell gdb about the name of the function | |
46 | contain the user's entry point (I.E. main()) | |
47 | ||
48 | FIXME: The current DWARF specification has a very strong bias towards | |
49 | machines with 32-bit integers, as it assumes that many attributes of the | |
50 | program (such as an address) will fit in such an integer. There are many | |
51 | references in the spec to things that are 2, 4, or 8 bytes long. Given that | |
52 | we will probably run into problems on machines where some of these assumptions | |
53 | are invalid (64-bit ints for example), we don't bother at this time to try to | |
54 | make this code more flexible and just use shorts, ints, and longs (and their | |
55 | sizes) where it seems appropriate. I.E. we use a short int to hold DWARF | |
56 | tags, and assume that the tag size in the file is the same as sizeof(short). | |
57 | ||
58 | FIXME: Figure out how to get the name of the symbol indicating that a module | |
59 | has been compiled with gcc (gcc_compiledXX) in a more portable way than | |
60 | hardcoding it into the object file readers. | |
61 | ||
62 | FIXME: See other FIXME's and "ifdef 0" scattered throughout the code for | |
63 | other things to work on, if you get bored. :-) | |
64 | ||
65 | */ | |
35f5886e | 66 | #include <stdio.h> |
58050209 DHW |
67 | #ifdef __STDC__ |
68 | #include <stdarg.h> | |
69 | #else | |
313fdead | 70 | #include <varargs.h> |
58050209 | 71 | #endif |
35f5886e FF |
72 | #include <fcntl.h> |
73 | ||
74 | #include "defs.h" | |
35f5886e FF |
75 | #include "bfd.h" |
76 | #include "symtab.h" | |
77 | #include "symfile.h" | |
f5f0679a | 78 | #include "elf/dwarf.h" |
35f5886e FF |
79 | #include "ansidecl.h" |
80 | ||
81 | #ifdef MAINTENANCE /* Define to 1 to compile in some maintenance stuff */ | |
82 | #define SQUAWK(stuff) dwarfwarn stuff | |
83 | #else | |
84 | #define SQUAWK(stuff) | |
85 | #endif | |
86 | ||
87 | #ifndef R_FP /* FIXME */ | |
88 | #define R_FP 14 /* Kludge to get frame pointer register number */ | |
89 | #endif | |
90 | ||
91 | typedef unsigned int DIEREF; /* Reference to a DIE */ | |
92 | ||
93 | #define GCC_COMPILED_FLAG_SYMBOL "gcc_compiled%" /* FIXME */ | |
94 | #define GCC2_COMPILED_FLAG_SYMBOL "gcc2_compiled%" /* FIXME */ | |
95 | ||
96 | #define STREQ(a,b) (strcmp(a,b)==0) | |
97 | ||
768be6e1 FF |
98 | /* The Amiga SVR4 header file <dwarf.h> defines AT_element_list as a |
99 | FORM_BLOCK2, and this is the value emitted by the AT&T compiler. | |
100 | However, the Issue 2 DWARF specification from AT&T defines it as | |
101 | a FORM_BLOCK4, as does the latest specification from UI/PLSIG. | |
102 | For backwards compatibility with the AT&T compiler produced executables | |
103 | we define AT_short_element_list for this variant. */ | |
104 | ||
105 | #define AT_short_element_list (0x00f0|FORM_BLOCK2) | |
106 | ||
107 | /* External variables referenced. */ | |
108 | ||
35f5886e FF |
109 | extern CORE_ADDR startup_file_start; /* From blockframe.c */ |
110 | extern CORE_ADDR startup_file_end; /* From blockframe.c */ | |
111 | extern CORE_ADDR entry_scope_lowpc; /* From blockframe.c */ | |
112 | extern CORE_ADDR entry_scope_highpc; /* From blockframc.c */ | |
113 | extern CORE_ADDR main_scope_lowpc; /* From blockframe.c */ | |
114 | extern CORE_ADDR main_scope_highpc; /* From blockframc.c */ | |
115 | extern int info_verbose; /* From main.c; nonzero => verbose */ | |
116 | ||
117 | ||
118 | /* The DWARF debugging information consists of two major pieces, | |
119 | one is a block of DWARF Information Entries (DIE's) and the other | |
120 | is a line number table. The "struct dieinfo" structure contains | |
121 | the information for a single DIE, the one currently being processed. | |
122 | ||
123 | In order to make it easier to randomly access the attribute fields | |
124 | of the current DIE, which are specifically unordered within the DIE | |
125 | each DIE is scanned and an instance of the "struct dieinfo" | |
126 | structure is initialized. | |
127 | ||
128 | Initialization is done in two levels. The first, done by basicdieinfo(), | |
129 | just initializes those fields that are vital to deciding whether or not | |
130 | to use this DIE, how to skip past it, etc. The second, done by the | |
131 | function completedieinfo(), fills in the rest of the information. | |
132 | ||
133 | Attributes which have block forms are not interpreted at the time | |
134 | the DIE is scanned, instead we just save pointers to the start | |
135 | of their value fields. | |
136 | ||
137 | Some fields have a flag <name>_p that is set when the value of the | |
138 | field is valid (I.E. we found a matching attribute in the DIE). Since | |
139 | we may want to test for the presence of some attributes in the DIE, | |
2d6186f4 | 140 | such as AT_low_pc, without restricting the values of the field, |
35f5886e FF |
141 | we need someway to note that we found such an attribute. |
142 | ||
143 | */ | |
144 | ||
145 | typedef char BLOCK; | |
146 | ||
147 | struct dieinfo { | |
148 | char * die; /* Pointer to the raw DIE data */ | |
149 | long dielength; /* Length of the raw DIE data */ | |
150 | DIEREF dieref; /* Offset of this DIE */ | |
151 | short dietag; /* Tag for this DIE */ | |
152 | long at_padding; | |
153 | long at_sibling; | |
154 | BLOCK * at_location; | |
155 | char * at_name; | |
156 | unsigned short at_fund_type; | |
157 | BLOCK * at_mod_fund_type; | |
158 | long at_user_def_type; | |
159 | BLOCK * at_mod_u_d_type; | |
160 | short at_ordering; | |
161 | BLOCK * at_subscr_data; | |
162 | long at_byte_size; | |
163 | short at_bit_offset; | |
164 | long at_bit_size; | |
35f5886e FF |
165 | BLOCK * at_element_list; |
166 | long at_stmt_list; | |
167 | long at_low_pc; | |
168 | long at_high_pc; | |
169 | long at_language; | |
170 | long at_member; | |
171 | long at_discr; | |
172 | BLOCK * at_discr_value; | |
173 | short at_visibility; | |
174 | long at_import; | |
175 | BLOCK * at_string_length; | |
176 | char * at_comp_dir; | |
177 | char * at_producer; | |
35f5886e | 178 | long at_frame_base; |
35f5886e FF |
179 | long at_start_scope; |
180 | long at_stride_size; | |
181 | long at_src_info; | |
182 | short at_prototyped; | |
2d6186f4 FF |
183 | unsigned int has_at_low_pc:1; |
184 | unsigned int has_at_stmt_list:1; | |
768be6e1 | 185 | unsigned int short_element_list:1; |
35f5886e FF |
186 | }; |
187 | ||
188 | static int diecount; /* Approximate count of dies for compilation unit */ | |
189 | static struct dieinfo *curdie; /* For warnings and such */ | |
190 | ||
191 | static char *dbbase; /* Base pointer to dwarf info */ | |
192 | static int dbroff; /* Relative offset from start of .debug section */ | |
193 | static char *lnbase; /* Base pointer to line section */ | |
194 | static int isreg; /* Kludge to identify register variables */ | |
195 | ||
196 | static CORE_ADDR baseaddr; /* Add to each symbol value */ | |
197 | ||
198 | /* Each partial symbol table entry contains a pointer to private data for the | |
199 | read_symtab() function to use when expanding a partial symbol table entry | |
200 | to a full symbol table entry. For DWARF debugging info, this data is | |
201 | contained in the following structure and macros are provided for easy | |
202 | access to the members given a pointer to a partial symbol table entry. | |
203 | ||
204 | dbfoff Always the absolute file offset to the start of the ".debug" | |
205 | section for the file containing the DIE's being accessed. | |
206 | ||
207 | dbroff Relative offset from the start of the ".debug" access to the | |
208 | first DIE to be accessed. When building the partial symbol | |
209 | table, this value will be zero since we are accessing the | |
210 | entire ".debug" section. When expanding a partial symbol | |
211 | table entry, this value will be the offset to the first | |
212 | DIE for the compilation unit containing the symbol that | |
213 | triggers the expansion. | |
214 | ||
215 | dblength The size of the chunk of DIE's being examined, in bytes. | |
216 | ||
217 | lnfoff The absolute file offset to the line table fragment. Ignored | |
218 | when building partial symbol tables, but used when expanding | |
219 | them, and contains the absolute file offset to the fragment | |
220 | of the ".line" section containing the line numbers for the | |
221 | current compilation unit. | |
222 | */ | |
223 | ||
224 | struct dwfinfo { | |
225 | int dbfoff; /* Absolute file offset to start of .debug section */ | |
226 | int dbroff; /* Relative offset from start of .debug section */ | |
227 | int dblength; /* Size of the chunk of DIE's being examined */ | |
228 | int lnfoff; /* Absolute file offset to line table fragment */ | |
229 | }; | |
230 | ||
231 | #define DBFOFF(p) (((struct dwfinfo *)((p)->read_symtab_private))->dbfoff) | |
232 | #define DBROFF(p) (((struct dwfinfo *)((p)->read_symtab_private))->dbroff) | |
233 | #define DBLENGTH(p) (((struct dwfinfo *)((p)->read_symtab_private))->dblength) | |
234 | #define LNFOFF(p) (((struct dwfinfo *)((p)->read_symtab_private))->lnfoff) | |
235 | ||
236 | /* Record the symbols defined for each context in a linked list. We don't | |
237 | create a struct block for the context until we know how long to make it. | |
238 | Global symbols for each file are maintained in the global_symbols list. */ | |
239 | ||
240 | struct pending_symbol { | |
241 | struct pending_symbol *next; /* Next pending symbol */ | |
242 | struct symbol *symbol; /* The actual symbol */ | |
243 | }; | |
244 | ||
245 | static struct pending_symbol *global_symbols; /* global funcs and vars */ | |
246 | static struct block *global_symbol_block; | |
247 | ||
248 | /* Line number entries are read into a dynamically expandable vector before | |
249 | being added to the symbol table section. Once we know how many there are | |
250 | we can add them. */ | |
251 | ||
252 | static struct linetable *line_vector; /* Vector of line numbers. */ | |
253 | static int line_vector_index; /* Index of next entry. */ | |
254 | static int line_vector_length; /* Current allocation limit */ | |
255 | ||
256 | /* Scope information is kept in a scope tree, one node per scope. Each time | |
257 | a new scope is started, a child node is created under the current node | |
258 | and set to the current scope. Each time a scope is closed, the current | |
259 | scope moves back up the tree to the parent of the current scope. | |
260 | ||
261 | Each scope contains a pointer to the list of symbols defined in the scope, | |
262 | a pointer to the block vector for the scope, a pointer to the symbol | |
263 | that names the scope (if any), and the range of PC values that mark | |
264 | the start and end of the scope. */ | |
265 | ||
266 | struct scopenode { | |
267 | struct scopenode *parent; | |
268 | struct scopenode *child; | |
269 | struct scopenode *sibling; | |
270 | struct pending_symbol *symbols; | |
271 | struct block *block; | |
272 | struct symbol *namesym; | |
273 | CORE_ADDR lowpc; | |
274 | CORE_ADDR highpc; | |
275 | }; | |
276 | ||
277 | static struct scopenode *scopetree; | |
278 | static struct scopenode *scope; | |
279 | ||
280 | /* DIES which have user defined types or modified user defined types refer to | |
281 | other DIES for the type information. Thus we need to associate the offset | |
282 | of a DIE for a user defined type with a pointer to the type information. | |
283 | ||
284 | Originally this was done using a simple but expensive algorithm, with an | |
285 | array of unsorted structures, each containing an offset/type-pointer pair. | |
286 | This array was scanned linearly each time a lookup was done. The result | |
287 | was that gdb was spending over half it's startup time munging through this | |
288 | array of pointers looking for a structure that had the right offset member. | |
289 | ||
290 | The second attempt used the same array of structures, but the array was | |
291 | sorted using qsort each time a new offset/type was recorded, and a binary | |
292 | search was used to find the type pointer for a given DIE offset. This was | |
293 | even slower, due to the overhead of sorting the array each time a new | |
294 | offset/type pair was entered. | |
295 | ||
296 | The third attempt uses a fixed size array of type pointers, indexed by a | |
297 | value derived from the DIE offset. Since the minimum DIE size is 4 bytes, | |
298 | we can divide any DIE offset by 4 to obtain a unique index into this fixed | |
299 | size array. Since each element is a 4 byte pointer, it takes exactly as | |
300 | much memory to hold this array as to hold the DWARF info for a given | |
301 | compilation unit. But it gets freed as soon as we are done with it. */ | |
302 | ||
303 | static struct type **utypes; /* Pointer to array of user type pointers */ | |
304 | static int numutypes; /* Max number of user type pointers */ | |
305 | ||
306 | /* Forward declarations of static functions so we don't have to worry | |
307 | about ordering within this file. The EXFUN macro may be slightly | |
308 | misleading. Should probably be called DCLFUN instead, or something | |
309 | more intuitive, since it can be used for both static and external | |
310 | definitions. */ | |
311 | ||
58050209 DHW |
312 | static void |
313 | EXFUN (dwarfwarn, (char *fmt DOTS)); | |
35f5886e FF |
314 | |
315 | static void | |
316 | EXFUN (scan_partial_symbols, (char *thisdie AND char *enddie)); | |
317 | ||
318 | static void | |
319 | EXFUN (scan_compilation_units, | |
320 | (char *filename AND CORE_ADDR addr AND char *thisdie AND char *enddie | |
a048c8f5 JG |
321 | AND unsigned int dbfoff AND unsigned int lnoffset |
322 | AND struct objfile *objfile)); | |
35f5886e FF |
323 | |
324 | static struct partial_symtab * | |
a048c8f5 | 325 | EXFUN(start_psymtab, (struct objfile *objfile AND CORE_ADDR addr |
35f5886e FF |
326 | AND char *filename AND CORE_ADDR textlow |
327 | AND CORE_ADDR texthigh AND int dbfoff | |
328 | AND int curoff AND int culength AND int lnfoff | |
329 | AND struct partial_symbol *global_syms | |
330 | AND struct partial_symbol *static_syms)); | |
331 | static void | |
332 | EXFUN(add_partial_symbol, (struct dieinfo *dip)); | |
333 | ||
334 | static void | |
335 | EXFUN(add_psymbol_to_list, | |
336 | (struct psymbol_allocation_list *listp AND char *name | |
337 | AND enum namespace space AND enum address_class class | |
338 | AND CORE_ADDR value)); | |
339 | ||
340 | static void | |
341 | EXFUN(init_psymbol_list, (int total_symbols)); | |
342 | ||
343 | static void | |
344 | EXFUN(basicdieinfo, (struct dieinfo *dip AND char *diep)); | |
345 | ||
346 | static void | |
347 | EXFUN(completedieinfo, (struct dieinfo *dip)); | |
348 | ||
349 | static void | |
350 | EXFUN(dwarf_psymtab_to_symtab, (struct partial_symtab *pst)); | |
351 | ||
352 | static void | |
a048c8f5 | 353 | EXFUN(psymtab_to_symtab_1, (struct partial_symtab *pst)); |
35f5886e FF |
354 | |
355 | static struct symtab * | |
a048c8f5 | 356 | EXFUN(read_ofile_symtab, (struct partial_symtab *pst)); |
35f5886e FF |
357 | |
358 | static void | |
a048c8f5 JG |
359 | EXFUN(process_dies, |
360 | (char *thisdie AND char *enddie AND struct objfile *objfile)); | |
35f5886e FF |
361 | |
362 | static void | |
363 | EXFUN(read_structure_scope, | |
8b5b6fae FF |
364 | (struct dieinfo *dip AND char *thisdie AND char *enddie AND |
365 | struct objfile *objfile)); | |
35f5886e FF |
366 | |
367 | static struct type * | |
368 | EXFUN(decode_array_element_type, (char *scan AND char *end)); | |
369 | ||
370 | static struct type * | |
371 | EXFUN(decode_subscr_data, (char *scan AND char *end)); | |
372 | ||
373 | static void | |
374 | EXFUN(read_array_type, (struct dieinfo *dip)); | |
375 | ||
376 | static void | |
377 | EXFUN(read_subroutine_type, | |
378 | (struct dieinfo *dip AND char *thisdie AND char *enddie)); | |
379 | ||
380 | static void | |
381 | EXFUN(read_enumeration, | |
382 | (struct dieinfo *dip AND char *thisdie AND char *enddie)); | |
383 | ||
384 | static struct type * | |
385 | EXFUN(struct_type, | |
8b5b6fae FF |
386 | (struct dieinfo *dip AND char *thisdie AND char *enddie AND |
387 | struct objfile *objfile)); | |
35f5886e FF |
388 | |
389 | static struct type * | |
390 | EXFUN(enum_type, (struct dieinfo *dip)); | |
391 | ||
35f5886e FF |
392 | static void |
393 | EXFUN(start_symtab, (void)); | |
394 | ||
395 | static void | |
a048c8f5 JG |
396 | EXFUN(end_symtab, |
397 | (char *filename AND long language AND struct objfile *objfile)); | |
35f5886e FF |
398 | |
399 | static int | |
400 | EXFUN(scopecount, (struct scopenode *node)); | |
401 | ||
402 | static void | |
403 | EXFUN(openscope, | |
404 | (struct symbol *namesym AND CORE_ADDR lowpc AND CORE_ADDR highpc)); | |
405 | ||
406 | static void | |
407 | EXFUN(freescope, (struct scopenode *node)); | |
408 | ||
409 | static struct block * | |
410 | EXFUN(buildblock, (struct pending_symbol *syms)); | |
411 | ||
412 | static void | |
413 | EXFUN(closescope, (void)); | |
414 | ||
415 | static void | |
416 | EXFUN(record_line, (int line AND CORE_ADDR pc)); | |
417 | ||
418 | static void | |
419 | EXFUN(decode_line_numbers, (char *linetable)); | |
420 | ||
421 | static struct type * | |
422 | EXFUN(decode_die_type, (struct dieinfo *dip)); | |
423 | ||
424 | static struct type * | |
425 | EXFUN(decode_mod_fund_type, (char *typedata)); | |
426 | ||
427 | static struct type * | |
428 | EXFUN(decode_mod_u_d_type, (char *typedata)); | |
429 | ||
430 | static struct type * | |
431 | EXFUN(decode_modified_type, | |
432 | (unsigned char *modifiers AND unsigned short modcount AND int mtype)); | |
433 | ||
434 | static struct type * | |
435 | EXFUN(decode_fund_type, (unsigned short fundtype)); | |
436 | ||
437 | static char * | |
438 | EXFUN(create_name, (char *name AND struct obstack *obstackp)); | |
439 | ||
440 | static void | |
441 | EXFUN(add_symbol_to_list, | |
442 | (struct symbol *symbol AND struct pending_symbol **listhead)); | |
443 | ||
444 | static struct block ** | |
445 | EXFUN(gatherblocks, (struct block **dest AND struct scopenode *node)); | |
446 | ||
447 | static struct blockvector * | |
448 | EXFUN(make_blockvector, (void)); | |
449 | ||
450 | static struct type * | |
451 | EXFUN(lookup_utype, (DIEREF dieref)); | |
452 | ||
453 | static struct type * | |
454 | EXFUN(alloc_utype, (DIEREF dieref AND struct type *usetype)); | |
455 | ||
456 | static struct symbol * | |
457 | EXFUN(new_symbol, (struct dieinfo *dip)); | |
458 | ||
459 | static int | |
460 | EXFUN(locval, (char *loc)); | |
461 | ||
462 | static void | |
a7446af6 FF |
463 | EXFUN(record_misc_function, (char *name AND CORE_ADDR address AND |
464 | enum misc_function_type)); | |
35f5886e FF |
465 | |
466 | static int | |
467 | EXFUN(compare_psymbols, | |
468 | (struct partial_symbol *s1 AND struct partial_symbol *s2)); | |
469 | ||
470 | ||
471 | /* | |
472 | ||
473 | GLOBAL FUNCTION | |
474 | ||
475 | dwarf_build_psymtabs -- build partial symtabs from DWARF debug info | |
476 | ||
477 | SYNOPSIS | |
478 | ||
479 | void dwarf_build_psymtabs (int desc, char *filename, CORE_ADDR addr, | |
480 | int mainline, unsigned int dbfoff, unsigned int dbsize, | |
a048c8f5 JG |
481 | unsigned int lnoffset, unsigned int lnsize, |
482 | struct objfile *objfile) | |
35f5886e FF |
483 | |
484 | DESCRIPTION | |
485 | ||
486 | This function is called upon to build partial symtabs from files | |
487 | containing DIE's (Dwarf Information Entries) and DWARF line numbers. | |
488 | ||
489 | It is passed a file descriptor for an open file containing the DIES | |
490 | and line number information, the corresponding filename for that | |
491 | file, a base address for relocating the symbols, a flag indicating | |
492 | whether or not this debugging information is from a "main symbol | |
493 | table" rather than a shared library or dynamically linked file, | |
494 | and file offset/size pairs for the DIE information and line number | |
495 | information. | |
496 | ||
497 | RETURNS | |
498 | ||
499 | No return value. | |
500 | ||
501 | */ | |
502 | ||
503 | void | |
504 | DEFUN(dwarf_build_psymtabs, | |
a048c8f5 JG |
505 | (desc, filename, addr, mainline, dbfoff, dbsize, lnoffset, lnsize, |
506 | objfile), | |
35f5886e FF |
507 | int desc AND |
508 | char *filename AND | |
509 | CORE_ADDR addr AND | |
510 | int mainline AND | |
511 | unsigned int dbfoff AND | |
512 | unsigned int dbsize AND | |
513 | unsigned int lnoffset AND | |
a048c8f5 JG |
514 | unsigned int lnsize AND |
515 | struct objfile *objfile) | |
35f5886e FF |
516 | { |
517 | struct cleanup *back_to; | |
518 | ||
519 | dbbase = xmalloc (dbsize); | |
520 | dbroff = 0; | |
521 | if ((lseek (desc, dbfoff, 0) != dbfoff) || | |
522 | (read (desc, dbbase, dbsize) != dbsize)) | |
523 | { | |
524 | free (dbbase); | |
525 | error ("can't read DWARF data from '%s'", filename); | |
526 | } | |
527 | back_to = make_cleanup (free, dbbase); | |
528 | ||
529 | /* If we are reinitializing, or if we have never loaded syms yet, init. | |
530 | Since we have no idea how many DIES we are looking at, we just guess | |
531 | some arbitrary value. */ | |
532 | ||
533 | if (mainline || global_psymbols.size == 0 || static_psymbols.size == 0) | |
534 | { | |
535 | init_psymbol_list (1024); | |
536 | } | |
537 | ||
35f5886e FF |
538 | /* Follow the compilation unit sibling chain, building a partial symbol |
539 | table entry for each one. Save enough information about each compilation | |
540 | unit to locate the full DWARF information later. */ | |
541 | ||
542 | scan_compilation_units (filename, addr, dbbase, dbbase + dbsize, | |
a048c8f5 | 543 | dbfoff, lnoffset, objfile); |
35f5886e | 544 | |
35f5886e FF |
545 | do_cleanups (back_to); |
546 | } | |
547 | ||
548 | ||
549 | /* | |
550 | ||
551 | LOCAL FUNCTION | |
552 | ||
553 | record_misc_function -- add entry to miscellaneous function vector | |
554 | ||
555 | SYNOPSIS | |
556 | ||
a7446af6 FF |
557 | static void record_misc_function (char *name, CORE_ADDR address, |
558 | enum misc_function_type mf_type) | |
35f5886e FF |
559 | |
560 | DESCRIPTION | |
561 | ||
562 | Given a pointer to the name of a symbol that should be added to the | |
563 | miscellaneous function vector, and the address associated with that | |
564 | symbol, records this information for later use in building the | |
565 | miscellaneous function vector. | |
566 | ||
35f5886e FF |
567 | */ |
568 | ||
569 | static void | |
a7446af6 FF |
570 | DEFUN(record_misc_function, (name, address, mf_type), |
571 | char *name AND CORE_ADDR address AND enum misc_function_type mf_type) | |
35f5886e FF |
572 | { |
573 | prim_record_misc_function (obsavestring (name, strlen (name)), address, | |
a7446af6 | 574 | mf_type); |
35f5886e FF |
575 | } |
576 | ||
577 | /* | |
578 | ||
579 | LOCAL FUNCTION | |
580 | ||
581 | dwarfwarn -- issue a DWARF related warning | |
582 | ||
583 | DESCRIPTION | |
584 | ||
585 | Issue warnings about DWARF related things that aren't serious enough | |
586 | to warrant aborting with an error, but should not be ignored either. | |
587 | This includes things like detectable corruption in DIE's, missing | |
588 | DIE's, unimplemented features, etc. | |
589 | ||
590 | In general, running across tags or attributes that we don't recognize | |
591 | is not considered to be a problem and we should not issue warnings | |
592 | about such. | |
593 | ||
594 | NOTES | |
595 | ||
596 | We mostly follow the example of the error() routine, but without | |
597 | returning to command level. It is arguable about whether warnings | |
598 | should be issued at all, and if so, where they should go (stdout or | |
599 | stderr). | |
600 | ||
601 | We assume that curdie is valid and contains at least the basic | |
602 | information for the DIE where the problem was noticed. | |
603 | */ | |
604 | ||
58050209 DHW |
605 | #ifdef __STDC__ |
606 | static void | |
607 | DEFUN(dwarfwarn, (fmt), char *fmt DOTS) | |
608 | { | |
609 | va_list ap; | |
610 | ||
611 | va_start (ap, fmt); | |
612 | warning_setup (); | |
613 | fprintf (stderr, "DWARF warning (ref 0x%x): ", curdie -> dieref); | |
614 | if (curdie -> at_name) | |
615 | { | |
616 | fprintf (stderr, "'%s': ", curdie -> at_name); | |
617 | } | |
618 | vfprintf (stderr, fmt, ap); | |
619 | fprintf (stderr, "\n"); | |
620 | fflush (stderr); | |
621 | va_end (ap); | |
622 | } | |
623 | #else | |
624 | ||
35f5886e | 625 | static void |
313fdead JG |
626 | dwarfwarn (va_alist) |
627 | va_dcl | |
35f5886e FF |
628 | { |
629 | va_list ap; | |
313fdead | 630 | char *fmt; |
35f5886e | 631 | |
313fdead JG |
632 | va_start (ap); |
633 | fmt = va_arg (ap, char *); | |
35f5886e FF |
634 | warning_setup (); |
635 | fprintf (stderr, "DWARF warning (ref 0x%x): ", curdie -> dieref); | |
636 | if (curdie -> at_name) | |
637 | { | |
638 | fprintf (stderr, "'%s': ", curdie -> at_name); | |
639 | } | |
640 | vfprintf (stderr, fmt, ap); | |
641 | fprintf (stderr, "\n"); | |
642 | fflush (stderr); | |
643 | va_end (ap); | |
644 | } | |
58050209 | 645 | #endif |
35f5886e FF |
646 | /* |
647 | ||
648 | LOCAL FUNCTION | |
649 | ||
650 | compare_psymbols -- compare two partial symbols by name | |
651 | ||
652 | DESCRIPTION | |
653 | ||
654 | Given pointer to two partial symbol table entries, compare | |
655 | them by name and return -N, 0, or +N (ala strcmp). Typically | |
656 | used by sorting routines like qsort(). | |
657 | ||
658 | NOTES | |
659 | ||
660 | This is a copy from dbxread.c. It should be moved to a generic | |
661 | gdb file and made available for all psymtab builders (FIXME). | |
662 | ||
663 | Does direct compare of first two characters before punting | |
664 | and passing to strcmp for longer compares. Note that the | |
665 | original version had a bug whereby two null strings or two | |
666 | identically named one character strings would return the | |
667 | comparison of memory following the null byte. | |
668 | ||
669 | */ | |
670 | ||
671 | static int | |
672 | DEFUN(compare_psymbols, (s1, s2), | |
673 | struct partial_symbol *s1 AND | |
674 | struct partial_symbol *s2) | |
675 | { | |
676 | register char *st1 = SYMBOL_NAME (s1); | |
677 | register char *st2 = SYMBOL_NAME (s2); | |
678 | ||
679 | if ((st1[0] - st2[0]) || !st1[0]) | |
680 | { | |
681 | return (st1[0] - st2[0]); | |
682 | } | |
683 | else if ((st1[1] - st2[1]) || !st1[1]) | |
684 | { | |
685 | return (st1[1] - st2[1]); | |
686 | } | |
687 | else | |
688 | { | |
689 | return (strcmp (st1 + 2, st2 + 2)); | |
690 | } | |
691 | } | |
692 | ||
693 | /* | |
694 | ||
695 | LOCAL FUNCTION | |
696 | ||
697 | read_lexical_block_scope -- process all dies in a lexical block | |
698 | ||
699 | SYNOPSIS | |
700 | ||
701 | static void read_lexical_block_scope (struct dieinfo *dip, | |
702 | char *thisdie, char *enddie) | |
703 | ||
704 | DESCRIPTION | |
705 | ||
706 | Process all the DIES contained within a lexical block scope. | |
707 | Start a new scope, process the dies, and then close the scope. | |
708 | ||
709 | */ | |
710 | ||
711 | static void | |
a048c8f5 | 712 | DEFUN(read_lexical_block_scope, (dip, thisdie, enddie, objfile), |
35f5886e FF |
713 | struct dieinfo *dip AND |
714 | char *thisdie AND | |
a048c8f5 JG |
715 | char *enddie AND |
716 | struct objfile *objfile) | |
35f5886e FF |
717 | { |
718 | openscope (NULL, dip -> at_low_pc, dip -> at_high_pc); | |
a048c8f5 | 719 | process_dies (thisdie + dip -> dielength, enddie, objfile); |
35f5886e FF |
720 | closescope (); |
721 | } | |
722 | ||
723 | /* | |
724 | ||
725 | LOCAL FUNCTION | |
726 | ||
727 | lookup_utype -- look up a user defined type from die reference | |
728 | ||
729 | SYNOPSIS | |
730 | ||
731 | static type *lookup_utype (DIEREF dieref) | |
732 | ||
733 | DESCRIPTION | |
734 | ||
735 | Given a DIE reference, lookup the user defined type associated with | |
736 | that DIE, if it has been registered already. If not registered, then | |
737 | return NULL. Alloc_utype() can be called to register an empty | |
738 | type for this reference, which will be filled in later when the | |
739 | actual referenced DIE is processed. | |
740 | */ | |
741 | ||
742 | static struct type * | |
743 | DEFUN(lookup_utype, (dieref), DIEREF dieref) | |
744 | { | |
745 | struct type *type = NULL; | |
746 | int utypeidx; | |
747 | ||
748 | utypeidx = (dieref - dbroff) / 4; | |
749 | if ((utypeidx < 0) || (utypeidx >= numutypes)) | |
750 | { | |
751 | dwarfwarn ("reference to DIE (0x%x) outside compilation unit", dieref); | |
752 | } | |
753 | else | |
754 | { | |
755 | type = *(utypes + utypeidx); | |
756 | } | |
757 | return (type); | |
758 | } | |
759 | ||
760 | ||
761 | /* | |
762 | ||
763 | LOCAL FUNCTION | |
764 | ||
765 | alloc_utype -- add a user defined type for die reference | |
766 | ||
767 | SYNOPSIS | |
768 | ||
769 | static type *alloc_utype (DIEREF dieref, struct type *utypep) | |
770 | ||
771 | DESCRIPTION | |
772 | ||
773 | Given a die reference DIEREF, and a possible pointer to a user | |
774 | defined type UTYPEP, register that this reference has a user | |
775 | defined type and either use the specified type in UTYPEP or | |
776 | make a new empty type that will be filled in later. | |
777 | ||
778 | We should only be called after calling lookup_utype() to verify that | |
779 | there is not currently a type registered for DIEREF. | |
780 | */ | |
781 | ||
782 | static struct type * | |
783 | DEFUN(alloc_utype, (dieref, utypep), | |
784 | DIEREF dieref AND | |
785 | struct type *utypep) | |
786 | { | |
787 | struct type **typep; | |
788 | int utypeidx; | |
789 | ||
790 | utypeidx = (dieref - dbroff) / 4; | |
791 | typep = utypes + utypeidx; | |
792 | if ((utypeidx < 0) || (utypeidx >= numutypes)) | |
793 | { | |
794 | utypep = builtin_type_int; | |
795 | dwarfwarn ("reference to DIE (0x%x) outside compilation unit", dieref); | |
796 | } | |
797 | else if (*typep != NULL) | |
798 | { | |
799 | utypep = *typep; | |
800 | SQUAWK (("internal error: dup user type allocation")); | |
801 | } | |
802 | else | |
803 | { | |
804 | if (utypep == NULL) | |
805 | { | |
806 | utypep = (struct type *) | |
807 | obstack_alloc (symbol_obstack, sizeof (struct type)); | |
808 | (void) memset (utypep, 0, sizeof (struct type)); | |
809 | } | |
810 | *typep = utypep; | |
811 | } | |
812 | return (utypep); | |
813 | } | |
814 | ||
815 | /* | |
816 | ||
817 | LOCAL FUNCTION | |
818 | ||
819 | decode_die_type -- return a type for a specified die | |
820 | ||
821 | SYNOPSIS | |
822 | ||
823 | static struct type *decode_die_type (struct dieinfo *dip) | |
824 | ||
825 | DESCRIPTION | |
826 | ||
827 | Given a pointer to a die information structure DIP, decode the | |
828 | type of the die and return a pointer to the decoded type. All | |
829 | dies without specific types default to type int. | |
830 | */ | |
831 | ||
832 | static struct type * | |
833 | DEFUN(decode_die_type, (dip), struct dieinfo *dip) | |
834 | { | |
835 | struct type *type = NULL; | |
836 | ||
837 | if (dip -> at_fund_type != 0) | |
838 | { | |
839 | type = decode_fund_type (dip -> at_fund_type); | |
840 | } | |
841 | else if (dip -> at_mod_fund_type != NULL) | |
842 | { | |
843 | type = decode_mod_fund_type (dip -> at_mod_fund_type); | |
844 | } | |
845 | else if (dip -> at_user_def_type) | |
846 | { | |
847 | if ((type = lookup_utype (dip -> at_user_def_type)) == NULL) | |
848 | { | |
849 | type = alloc_utype (dip -> at_user_def_type, NULL); | |
850 | } | |
851 | } | |
852 | else if (dip -> at_mod_u_d_type) | |
853 | { | |
854 | type = decode_mod_u_d_type (dip -> at_mod_u_d_type); | |
855 | } | |
856 | else | |
857 | { | |
858 | type = builtin_type_int; | |
859 | } | |
860 | return (type); | |
861 | } | |
862 | ||
863 | /* | |
864 | ||
865 | LOCAL FUNCTION | |
866 | ||
867 | struct_type -- compute and return the type for a struct or union | |
868 | ||
869 | SYNOPSIS | |
870 | ||
871 | static struct type *struct_type (struct dieinfo *dip, char *thisdie, | |
8b5b6fae | 872 | char *enddie, struct objfile *objfile) |
35f5886e FF |
873 | |
874 | DESCRIPTION | |
875 | ||
876 | Given pointer to a die information structure for a die which | |
715cafcb FF |
877 | defines a union or structure (and MUST define one or the other), |
878 | and pointers to the raw die data that define the range of dies which | |
879 | define the members, compute and return the user defined type for the | |
880 | structure or union. | |
35f5886e FF |
881 | */ |
882 | ||
883 | static struct type * | |
8b5b6fae | 884 | DEFUN(struct_type, (dip, thisdie, enddie, objfile), |
35f5886e FF |
885 | struct dieinfo *dip AND |
886 | char *thisdie AND | |
8b5b6fae FF |
887 | char *enddie AND |
888 | struct objfile *objfile) | |
35f5886e FF |
889 | { |
890 | struct type *type; | |
891 | struct nextfield { | |
892 | struct nextfield *next; | |
893 | struct field field; | |
894 | }; | |
895 | struct nextfield *list = NULL; | |
896 | struct nextfield *new; | |
897 | int nfields = 0; | |
898 | int n; | |
899 | char *tpart1; | |
35f5886e | 900 | struct dieinfo mbr; |
8b5b6fae | 901 | char *nextdie; |
35f5886e FF |
902 | |
903 | if ((type = lookup_utype (dip -> dieref)) == NULL) | |
904 | { | |
5edf98d7 | 905 | /* No forward references created an empty type, so install one now */ |
35f5886e FF |
906 | type = alloc_utype (dip -> dieref, NULL); |
907 | } | |
715cafcb FF |
908 | TYPE_CPLUS_SPECIFIC (type) = (struct cplus_struct_type *) |
909 | obstack_alloc (symbol_obstack, sizeof (struct cplus_struct_type)); | |
910 | (void) memset (TYPE_CPLUS_SPECIFIC (type), 0, | |
911 | sizeof (struct cplus_struct_type)); | |
912 | switch (dip -> dietag) | |
35f5886e | 913 | { |
715cafcb | 914 | case TAG_structure_type: |
5edf98d7 | 915 | TYPE_CODE (type) = TYPE_CODE_STRUCT; |
715cafcb FF |
916 | tpart1 = "struct"; |
917 | break; | |
918 | case TAG_union_type: | |
919 | TYPE_CODE (type) = TYPE_CODE_UNION; | |
920 | tpart1 = "union"; | |
921 | break; | |
922 | default: | |
923 | /* Should never happen */ | |
924 | TYPE_CODE (type) = TYPE_CODE_UNDEF; | |
925 | tpart1 = "???"; | |
926 | SQUAWK (("missing structure or union tag")); | |
927 | break; | |
35f5886e | 928 | } |
5edf98d7 FF |
929 | /* Some compilers try to be helpful by inventing "fake" names for |
930 | anonymous enums, structures, and unions, like "~0fake" or ".0fake". | |
931 | Thanks, but no thanks... */ | |
715cafcb FF |
932 | if (dip -> at_name != NULL |
933 | && *dip -> at_name != '~' | |
934 | && *dip -> at_name != '.') | |
35f5886e | 935 | { |
715cafcb | 936 | TYPE_NAME (type) = obconcat (tpart1, " ", dip -> at_name); |
35f5886e | 937 | } |
715cafcb | 938 | if (dip -> at_byte_size != 0) |
35f5886e | 939 | { |
35f5886e | 940 | TYPE_LENGTH (type) = dip -> at_byte_size; |
35f5886e | 941 | } |
35f5886e FF |
942 | thisdie += dip -> dielength; |
943 | while (thisdie < enddie) | |
944 | { | |
945 | basicdieinfo (&mbr, thisdie); | |
946 | completedieinfo (&mbr); | |
947 | if (mbr.dielength <= sizeof (long)) | |
948 | { | |
949 | break; | |
950 | } | |
8b5b6fae FF |
951 | else if (mbr.at_sibling != 0) |
952 | { | |
953 | nextdie = dbbase + mbr.at_sibling - dbroff; | |
954 | } | |
955 | else | |
956 | { | |
957 | nextdie = thisdie + mbr.dielength; | |
958 | } | |
35f5886e FF |
959 | switch (mbr.dietag) |
960 | { | |
961 | case TAG_member: | |
962 | /* Get space to record the next field's data. */ | |
963 | new = (struct nextfield *) alloca (sizeof (struct nextfield)); | |
964 | new -> next = list; | |
965 | list = new; | |
966 | /* Save the data. */ | |
967 | list -> field.name = savestring (mbr.at_name, strlen (mbr.at_name)); | |
968 | list -> field.type = decode_die_type (&mbr); | |
969 | list -> field.bitpos = 8 * locval (mbr.at_location); | |
970 | list -> field.bitsize = 0; | |
971 | nfields++; | |
972 | break; | |
973 | default: | |
8b5b6fae | 974 | process_dies (thisdie, nextdie, objfile); |
35f5886e FF |
975 | break; |
976 | } | |
8b5b6fae | 977 | thisdie = nextdie; |
35f5886e | 978 | } |
5edf98d7 FF |
979 | /* Now create the vector of fields, and record how big it is. We may |
980 | not even have any fields, if this DIE was generated due to a reference | |
981 | to an anonymous structure or union. In this case, TYPE_FLAG_STUB is | |
982 | set, which clues gdb in to the fact that it needs to search elsewhere | |
983 | for the full structure definition. */ | |
984 | if (nfields == 0) | |
35f5886e | 985 | { |
5edf98d7 FF |
986 | TYPE_FLAGS (type) |= TYPE_FLAG_STUB; |
987 | } | |
988 | else | |
989 | { | |
990 | TYPE_NFIELDS (type) = nfields; | |
991 | TYPE_FIELDS (type) = (struct field *) | |
992 | obstack_alloc (symbol_obstack, sizeof (struct field) * nfields); | |
993 | /* Copy the saved-up fields into the field vector. */ | |
994 | for (n = nfields; list; list = list -> next) | |
995 | { | |
996 | TYPE_FIELD (type, --n) = list -> field; | |
997 | } | |
998 | } | |
35f5886e FF |
999 | return (type); |
1000 | } | |
1001 | ||
1002 | /* | |
1003 | ||
1004 | LOCAL FUNCTION | |
1005 | ||
1006 | read_structure_scope -- process all dies within struct or union | |
1007 | ||
1008 | SYNOPSIS | |
1009 | ||
1010 | static void read_structure_scope (struct dieinfo *dip, | |
8b5b6fae | 1011 | char *thisdie, char *enddie, struct objfile *objfile) |
35f5886e FF |
1012 | |
1013 | DESCRIPTION | |
1014 | ||
1015 | Called when we find the DIE that starts a structure or union | |
1016 | scope (definition) to process all dies that define the members | |
1017 | of the structure or union. DIP is a pointer to the die info | |
1018 | struct for the DIE that names the structure or union. | |
1019 | ||
1020 | NOTES | |
1021 | ||
1022 | Note that we need to call struct_type regardless of whether or not | |
84ce6717 FF |
1023 | the DIE has an at_name attribute, since it might be an anonymous |
1024 | structure or union. This gets the type entered into our set of | |
1025 | user defined types. | |
1026 | ||
1027 | However, if the structure is incomplete (an opaque struct/union) | |
1028 | then suppress creating a symbol table entry for it since gdb only | |
1029 | wants to find the one with the complete definition. Note that if | |
1030 | it is complete, we just call new_symbol, which does it's own | |
1031 | checking about whether the struct/union is anonymous or not (and | |
1032 | suppresses creating a symbol table entry itself). | |
1033 | ||
35f5886e FF |
1034 | */ |
1035 | ||
1036 | static void | |
8b5b6fae | 1037 | DEFUN(read_structure_scope, (dip, thisdie, enddie, objfile), |
35f5886e FF |
1038 | struct dieinfo *dip AND |
1039 | char *thisdie AND | |
8b5b6fae FF |
1040 | char *enddie AND |
1041 | struct objfile *objfile) | |
35f5886e FF |
1042 | { |
1043 | struct type *type; | |
1044 | struct symbol *sym; | |
1045 | ||
8b5b6fae | 1046 | type = struct_type (dip, thisdie, enddie, objfile); |
84ce6717 | 1047 | if (!(TYPE_FLAGS (type) & TYPE_FLAG_STUB)) |
35f5886e | 1048 | { |
84ce6717 FF |
1049 | if ((sym = new_symbol (dip)) != NULL) |
1050 | { | |
1051 | SYMBOL_TYPE (sym) = type; | |
1052 | } | |
35f5886e FF |
1053 | } |
1054 | } | |
1055 | ||
1056 | /* | |
1057 | ||
1058 | LOCAL FUNCTION | |
1059 | ||
1060 | decode_array_element_type -- decode type of the array elements | |
1061 | ||
1062 | SYNOPSIS | |
1063 | ||
1064 | static struct type *decode_array_element_type (char *scan, char *end) | |
1065 | ||
1066 | DESCRIPTION | |
1067 | ||
1068 | As the last step in decoding the array subscript information for an | |
1069 | array DIE, we need to decode the type of the array elements. We are | |
1070 | passed a pointer to this last part of the subscript information and | |
1071 | must return the appropriate type. If the type attribute is not | |
1072 | recognized, just warn about the problem and return type int. | |
1073 | */ | |
1074 | ||
1075 | static struct type * | |
1076 | DEFUN(decode_array_element_type, (scan, end), char *scan AND char *end) | |
1077 | { | |
1078 | struct type *typep; | |
1079 | short attribute; | |
1080 | DIEREF dieref; | |
1081 | unsigned short fundtype; | |
1082 | ||
1083 | (void) memcpy (&attribute, scan, sizeof (short)); | |
1084 | scan += sizeof (short); | |
1085 | switch (attribute) | |
1086 | { | |
1087 | case AT_fund_type: | |
1088 | (void) memcpy (&fundtype, scan, sizeof (short)); | |
1089 | typep = decode_fund_type (fundtype); | |
1090 | break; | |
1091 | case AT_mod_fund_type: | |
1092 | typep = decode_mod_fund_type (scan); | |
1093 | break; | |
1094 | case AT_user_def_type: | |
1095 | (void) memcpy (&dieref, scan, sizeof (DIEREF)); | |
1096 | if ((typep = lookup_utype (dieref)) == NULL) | |
1097 | { | |
1098 | typep = alloc_utype (dieref, NULL); | |
1099 | } | |
1100 | break; | |
1101 | case AT_mod_u_d_type: | |
1102 | typep = decode_mod_u_d_type (scan); | |
1103 | break; | |
1104 | default: | |
1105 | SQUAWK (("bad array element type attribute 0x%x", attribute)); | |
1106 | typep = builtin_type_int; | |
1107 | break; | |
1108 | } | |
1109 | return (typep); | |
1110 | } | |
1111 | ||
1112 | /* | |
1113 | ||
1114 | LOCAL FUNCTION | |
1115 | ||
1116 | decode_subscr_data -- decode array subscript and element type data | |
1117 | ||
1118 | SYNOPSIS | |
1119 | ||
1120 | static struct type *decode_subscr_data (char *scan, char *end) | |
1121 | ||
1122 | DESCRIPTION | |
1123 | ||
1124 | The array subscripts and the data type of the elements of an | |
1125 | array are described by a list of data items, stored as a block | |
1126 | of contiguous bytes. There is a data item describing each array | |
1127 | dimension, and a final data item describing the element type. | |
1128 | The data items are ordered the same as their appearance in the | |
1129 | source (I.E. leftmost dimension first, next to leftmost second, | |
1130 | etc). | |
1131 | ||
1132 | We are passed a pointer to the start of the block of bytes | |
1133 | containing the data items, and a pointer to the first byte past | |
1134 | the data. This function decodes the data and returns a type. | |
1135 | ||
1136 | BUGS | |
1137 | FIXME: This code only implements the forms currently used | |
1138 | by the AT&T and GNU C compilers. | |
1139 | ||
1140 | The end pointer is supplied for error checking, maybe we should | |
1141 | use it for that... | |
1142 | */ | |
1143 | ||
1144 | static struct type * | |
1145 | DEFUN(decode_subscr_data, (scan, end), char *scan AND char *end) | |
1146 | { | |
1147 | struct type *typep = NULL; | |
1148 | struct type *nexttype; | |
1149 | int format; | |
1150 | short fundtype; | |
1151 | long lowbound; | |
1152 | long highbound; | |
1153 | ||
1154 | format = *scan++; | |
1155 | switch (format) | |
1156 | { | |
1157 | case FMT_ET: | |
1158 | typep = decode_array_element_type (scan, end); | |
1159 | break; | |
1160 | case FMT_FT_C_C: | |
1161 | (void) memcpy (&fundtype, scan, sizeof (short)); | |
1162 | scan += sizeof (short); | |
1163 | if (fundtype != FT_integer && fundtype != FT_signed_integer | |
1164 | && fundtype != FT_unsigned_integer) | |
1165 | { | |
1166 | SQUAWK (("array subscripts must be integral types, not type 0x%x", | |
1167 | fundtype)); | |
1168 | } | |
1169 | else | |
1170 | { | |
1171 | (void) memcpy (&lowbound, scan, sizeof (long)); | |
1172 | scan += sizeof (long); | |
1173 | (void) memcpy (&highbound, scan, sizeof (long)); | |
1174 | scan += sizeof (long); | |
1175 | nexttype = decode_subscr_data (scan, end); | |
1176 | if (nexttype != NULL) | |
1177 | { | |
1178 | typep = (struct type *) | |
1179 | obstack_alloc (symbol_obstack, sizeof (struct type)); | |
1180 | (void) memset (typep, 0, sizeof (struct type)); | |
1181 | TYPE_CODE (typep) = TYPE_CODE_ARRAY; | |
1182 | TYPE_LENGTH (typep) = TYPE_LENGTH (nexttype); | |
1183 | TYPE_LENGTH (typep) *= lowbound + highbound + 1; | |
1184 | TYPE_TARGET_TYPE (typep) = nexttype; | |
1185 | } | |
1186 | } | |
1187 | break; | |
1188 | case FMT_FT_C_X: | |
1189 | case FMT_FT_X_C: | |
1190 | case FMT_FT_X_X: | |
1191 | case FMT_UT_C_C: | |
1192 | case FMT_UT_C_X: | |
1193 | case FMT_UT_X_C: | |
1194 | case FMT_UT_X_X: | |
1195 | SQUAWK (("array subscript format 0x%x not handled yet", format)); | |
1196 | break; | |
1197 | default: | |
1198 | SQUAWK (("unknown array subscript format %x", format)); | |
1199 | break; | |
1200 | } | |
1201 | return (typep); | |
1202 | } | |
1203 | ||
1204 | /* | |
1205 | ||
1206 | LOCAL FUNCTION | |
1207 | ||
1208 | read_array_type -- read TAG_array_type DIE | |
1209 | ||
1210 | SYNOPSIS | |
1211 | ||
1212 | static void read_array_type (struct dieinfo *dip) | |
1213 | ||
1214 | DESCRIPTION | |
1215 | ||
1216 | Extract all information from a TAG_array_type DIE and add to | |
1217 | the user defined type vector. | |
1218 | */ | |
1219 | ||
1220 | static void | |
1221 | DEFUN(read_array_type, (dip), struct dieinfo *dip) | |
1222 | { | |
1223 | struct type *type; | |
1224 | char *sub; | |
1225 | char *subend; | |
1226 | short temp; | |
1227 | ||
1228 | if (dip -> at_ordering != ORD_row_major) | |
1229 | { | |
1230 | /* FIXME: Can gdb even handle column major arrays? */ | |
1231 | SQUAWK (("array not row major; not handled correctly")); | |
1232 | } | |
1233 | if ((sub = dip -> at_subscr_data) != NULL) | |
1234 | { | |
1235 | (void) memcpy (&temp, sub, sizeof (short)); | |
1236 | subend = sub + sizeof (short) + temp; | |
1237 | sub += sizeof (short); | |
1238 | type = decode_subscr_data (sub, subend); | |
1239 | if (type == NULL) | |
1240 | { | |
1241 | type = alloc_utype (dip -> dieref, NULL); | |
1242 | TYPE_CODE (type) = TYPE_CODE_ARRAY; | |
1243 | TYPE_TARGET_TYPE (type) = builtin_type_int; | |
1244 | TYPE_LENGTH (type) = 1 * TYPE_LENGTH (TYPE_TARGET_TYPE (type)); | |
1245 | } | |
1246 | else | |
1247 | { | |
1248 | type = alloc_utype (dip -> dieref, type); | |
1249 | } | |
1250 | } | |
1251 | } | |
1252 | ||
1253 | /* | |
1254 | ||
1255 | LOCAL FUNCTION | |
1256 | ||
1257 | read_subroutine_type -- process TAG_subroutine_type dies | |
1258 | ||
1259 | SYNOPSIS | |
1260 | ||
1261 | static void read_subroutine_type (struct dieinfo *dip, char thisdie, | |
1262 | char *enddie) | |
1263 | ||
1264 | DESCRIPTION | |
1265 | ||
1266 | Handle DIES due to C code like: | |
1267 | ||
1268 | struct foo { | |
1269 | int (*funcp)(int a, long l); (Generates TAG_subroutine_type DIE) | |
1270 | int b; | |
1271 | }; | |
1272 | ||
1273 | NOTES | |
1274 | ||
1275 | The parameter DIES are currently ignored. See if gdb has a way to | |
1276 | include this info in it's type system, and decode them if so. Is | |
1277 | this what the type structure's "arg_types" field is for? (FIXME) | |
1278 | */ | |
1279 | ||
1280 | static void | |
1281 | DEFUN(read_subroutine_type, (dip, thisdie, enddie), | |
1282 | struct dieinfo *dip AND | |
1283 | char *thisdie AND | |
1284 | char *enddie) | |
1285 | { | |
1286 | struct type *type; | |
1287 | ||
1288 | type = decode_die_type (dip); | |
1289 | type = lookup_function_type (type); | |
1290 | type = alloc_utype (dip -> dieref, type); | |
1291 | } | |
1292 | ||
1293 | /* | |
1294 | ||
1295 | LOCAL FUNCTION | |
1296 | ||
1297 | read_enumeration -- process dies which define an enumeration | |
1298 | ||
1299 | SYNOPSIS | |
1300 | ||
1301 | static void read_enumeration (struct dieinfo *dip, char *thisdie, | |
1302 | char *enddie) | |
1303 | ||
1304 | DESCRIPTION | |
1305 | ||
1306 | Given a pointer to a die which begins an enumeration, process all | |
1307 | the dies that define the members of the enumeration. | |
1308 | ||
1309 | NOTES | |
1310 | ||
1311 | Note that we need to call enum_type regardless of whether or not we | |
1312 | have a symbol, since we might have an enum without a tag name (thus | |
1313 | no symbol for the tagname). | |
1314 | */ | |
1315 | ||
1316 | static void | |
1317 | DEFUN(read_enumeration, (dip, thisdie, enddie), | |
1318 | struct dieinfo *dip AND | |
1319 | char *thisdie AND | |
1320 | char *enddie) | |
1321 | { | |
1322 | struct type *type; | |
1323 | struct symbol *sym; | |
1324 | ||
1325 | type = enum_type (dip); | |
1326 | if ((sym = new_symbol (dip)) != NULL) | |
1327 | { | |
1328 | SYMBOL_TYPE (sym) = type; | |
1329 | } | |
1330 | } | |
1331 | ||
1332 | /* | |
1333 | ||
1334 | LOCAL FUNCTION | |
1335 | ||
1336 | enum_type -- decode and return a type for an enumeration | |
1337 | ||
1338 | SYNOPSIS | |
1339 | ||
1340 | static type *enum_type (struct dieinfo *dip) | |
1341 | ||
1342 | DESCRIPTION | |
1343 | ||
1344 | Given a pointer to a die information structure for the die which | |
1345 | starts an enumeration, process all the dies that define the members | |
1346 | of the enumeration and return a type pointer for the enumeration. | |
98618bf7 | 1347 | |
715cafcb FF |
1348 | At the same time, for each member of the enumeration, create a |
1349 | symbol for it with namespace VAR_NAMESPACE and class LOC_CONST, | |
1350 | and give it the type of the enumeration itself. | |
1351 | ||
1352 | NOTES | |
1353 | ||
98618bf7 FF |
1354 | Note that the DWARF specification explicitly mandates that enum |
1355 | constants occur in reverse order from the source program order, | |
1356 | for "consistency" and because this ordering is easier for many | |
1357 | compilers to generate. (Draft 5, sec 3.9.5, Enumeration type | |
715cafcb FF |
1358 | Entries). Because gdb wants to see the enum members in program |
1359 | source order, we have to ensure that the order gets reversed while | |
98618bf7 | 1360 | we are processing them. |
35f5886e FF |
1361 | */ |
1362 | ||
1363 | static struct type * | |
1364 | DEFUN(enum_type, (dip), struct dieinfo *dip) | |
1365 | { | |
1366 | struct type *type; | |
1367 | struct nextfield { | |
1368 | struct nextfield *next; | |
1369 | struct field field; | |
1370 | }; | |
1371 | struct nextfield *list = NULL; | |
1372 | struct nextfield *new; | |
1373 | int nfields = 0; | |
1374 | int n; | |
35f5886e FF |
1375 | char *scan; |
1376 | char *listend; | |
768be6e1 FF |
1377 | long ltemp; |
1378 | short stemp; | |
715cafcb | 1379 | struct symbol *sym; |
35f5886e FF |
1380 | |
1381 | if ((type = lookup_utype (dip -> dieref)) == NULL) | |
1382 | { | |
84ce6717 | 1383 | /* No forward references created an empty type, so install one now */ |
35f5886e FF |
1384 | type = alloc_utype (dip -> dieref, NULL); |
1385 | } | |
1386 | TYPE_CODE (type) = TYPE_CODE_ENUM; | |
84ce6717 FF |
1387 | /* Some compilers try to be helpful by inventing "fake" names for |
1388 | anonymous enums, structures, and unions, like "~0fake" or ".0fake". | |
1389 | Thanks, but no thanks... */ | |
715cafcb FF |
1390 | if (dip -> at_name != NULL |
1391 | && *dip -> at_name != '~' | |
1392 | && *dip -> at_name != '.') | |
35f5886e | 1393 | { |
715cafcb | 1394 | TYPE_NAME (type) = obconcat ("enum", " ", dip -> at_name); |
35f5886e | 1395 | } |
715cafcb | 1396 | if (dip -> at_byte_size != 0) |
35f5886e FF |
1397 | { |
1398 | TYPE_LENGTH (type) = dip -> at_byte_size; | |
35f5886e | 1399 | } |
35f5886e FF |
1400 | if ((scan = dip -> at_element_list) != NULL) |
1401 | { | |
768be6e1 FF |
1402 | if (dip -> short_element_list) |
1403 | { | |
1404 | (void) memcpy (&stemp, scan, sizeof (stemp)); | |
1405 | listend = scan + stemp + sizeof (stemp); | |
1406 | scan += sizeof (stemp); | |
1407 | } | |
1408 | else | |
1409 | { | |
1410 | (void) memcpy (<emp, scan, sizeof (ltemp)); | |
1411 | listend = scan + ltemp + sizeof (ltemp); | |
1412 | scan += sizeof (ltemp); | |
1413 | } | |
35f5886e FF |
1414 | while (scan < listend) |
1415 | { | |
1416 | new = (struct nextfield *) alloca (sizeof (struct nextfield)); | |
1417 | new -> next = list; | |
1418 | list = new; | |
1419 | list -> field.type = NULL; | |
1420 | list -> field.bitsize = 0; | |
1421 | (void) memcpy (&list -> field.bitpos, scan, sizeof (long)); | |
1422 | scan += sizeof (long); | |
1423 | list -> field.name = savestring (scan, strlen (scan)); | |
1424 | scan += strlen (scan) + 1; | |
1425 | nfields++; | |
715cafcb FF |
1426 | /* Handcraft a new symbol for this enum member. */ |
1427 | sym = (struct symbol *) obstack_alloc (symbol_obstack, | |
1428 | sizeof (struct symbol)); | |
1429 | (void) memset (sym, 0, sizeof (struct symbol)); | |
1430 | SYMBOL_NAME (sym) = create_name (list -> field.name, symbol_obstack); | |
1431 | SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE; | |
1432 | SYMBOL_CLASS (sym) = LOC_CONST; | |
1433 | SYMBOL_TYPE (sym) = type; | |
1434 | SYMBOL_VALUE (sym) = list -> field.bitpos; | |
1435 | add_symbol_to_list (sym, &scope -> symbols); | |
35f5886e | 1436 | } |
84ce6717 FF |
1437 | /* Now create the vector of fields, and record how big it is. This is |
1438 | where we reverse the order, by pulling the members of the list in | |
1439 | reverse order from how they were inserted. If we have no fields | |
1440 | (this is apparently possible in C++) then skip building a field | |
1441 | vector. */ | |
1442 | if (nfields > 0) | |
1443 | { | |
1444 | TYPE_NFIELDS (type) = nfields; | |
1445 | TYPE_FIELDS (type) = (struct field *) | |
1446 | obstack_alloc (symbol_obstack, sizeof (struct field) * nfields); | |
1447 | /* Copy the saved-up fields into the field vector. */ | |
1448 | for (n = 0; (n < nfields) && (list != NULL); list = list -> next) | |
1449 | { | |
1450 | TYPE_FIELD (type, n++) = list -> field; | |
1451 | } | |
1452 | } | |
35f5886e | 1453 | } |
35f5886e FF |
1454 | return (type); |
1455 | } | |
1456 | ||
1457 | /* | |
1458 | ||
1459 | LOCAL FUNCTION | |
1460 | ||
1461 | read_func_scope -- process all dies within a function scope | |
1462 | ||
35f5886e FF |
1463 | DESCRIPTION |
1464 | ||
1465 | Process all dies within a given function scope. We are passed | |
1466 | a die information structure pointer DIP for the die which | |
1467 | starts the function scope, and pointers into the raw die data | |
1468 | that define the dies within the function scope. | |
1469 | ||
1470 | For now, we ignore lexical block scopes within the function. | |
1471 | The problem is that AT&T cc does not define a DWARF lexical | |
1472 | block scope for the function itself, while gcc defines a | |
1473 | lexical block scope for the function. We need to think about | |
1474 | how to handle this difference, or if it is even a problem. | |
1475 | (FIXME) | |
1476 | */ | |
1477 | ||
1478 | static void | |
a048c8f5 | 1479 | DEFUN(read_func_scope, (dip, thisdie, enddie, objfile), |
35f5886e FF |
1480 | struct dieinfo *dip AND |
1481 | char *thisdie AND | |
a048c8f5 JG |
1482 | char *enddie AND |
1483 | struct objfile *objfile) | |
35f5886e FF |
1484 | { |
1485 | struct symbol *sym; | |
1486 | ||
1487 | if (entry_point >= dip -> at_low_pc && entry_point < dip -> at_high_pc) | |
1488 | { | |
1489 | entry_scope_lowpc = dip -> at_low_pc; | |
1490 | entry_scope_highpc = dip -> at_high_pc; | |
1491 | } | |
1492 | if (strcmp (dip -> at_name, "main") == 0) /* FIXME: hardwired name */ | |
1493 | { | |
1494 | main_scope_lowpc = dip -> at_low_pc; | |
1495 | main_scope_highpc = dip -> at_high_pc; | |
1496 | } | |
1497 | sym = new_symbol (dip); | |
1498 | openscope (sym, dip -> at_low_pc, dip -> at_high_pc); | |
a048c8f5 | 1499 | process_dies (thisdie + dip -> dielength, enddie, objfile); |
35f5886e FF |
1500 | closescope (); |
1501 | } | |
1502 | ||
1503 | /* | |
1504 | ||
1505 | LOCAL FUNCTION | |
1506 | ||
1507 | read_file_scope -- process all dies within a file scope | |
1508 | ||
35f5886e FF |
1509 | DESCRIPTION |
1510 | ||
1511 | Process all dies within a given file scope. We are passed a | |
1512 | pointer to the die information structure for the die which | |
1513 | starts the file scope, and pointers into the raw die data which | |
1514 | mark the range of dies within the file scope. | |
1515 | ||
1516 | When the partial symbol table is built, the file offset for the line | |
1517 | number table for each compilation unit is saved in the partial symbol | |
1518 | table entry for that compilation unit. As the symbols for each | |
1519 | compilation unit are read, the line number table is read into memory | |
1520 | and the variable lnbase is set to point to it. Thus all we have to | |
1521 | do is use lnbase to access the line number table for the current | |
1522 | compilation unit. | |
1523 | */ | |
1524 | ||
1525 | static void | |
a048c8f5 | 1526 | DEFUN(read_file_scope, (dip, thisdie, enddie, objfile), |
35f5886e FF |
1527 | struct dieinfo *dip AND |
1528 | char *thisdie AND | |
a048c8f5 JG |
1529 | char *enddie AND |
1530 | struct objfile *objfile) | |
35f5886e FF |
1531 | { |
1532 | struct cleanup *back_to; | |
1533 | ||
1534 | if (entry_point >= dip -> at_low_pc && entry_point < dip -> at_high_pc) | |
1535 | { | |
1536 | startup_file_start = dip -> at_low_pc; | |
1537 | startup_file_end = dip -> at_high_pc; | |
1538 | } | |
1539 | numutypes = (enddie - thisdie) / 4; | |
1540 | utypes = (struct type **) xmalloc (numutypes * sizeof (struct type *)); | |
1541 | back_to = make_cleanup (free, utypes); | |
1542 | (void) memset (utypes, 0, numutypes * sizeof (struct type *)); | |
1543 | start_symtab (); | |
1544 | openscope (NULL, dip -> at_low_pc, dip -> at_high_pc); | |
1545 | decode_line_numbers (lnbase); | |
a048c8f5 | 1546 | process_dies (thisdie + dip -> dielength, enddie, objfile); |
35f5886e | 1547 | closescope (); |
a048c8f5 | 1548 | end_symtab (dip -> at_name, dip -> at_language, objfile); |
35f5886e FF |
1549 | do_cleanups (back_to); |
1550 | utypes = NULL; | |
1551 | numutypes = 0; | |
1552 | } | |
1553 | ||
1554 | /* | |
1555 | ||
1556 | LOCAL FUNCTION | |
1557 | ||
1558 | start_symtab -- do initialization for starting new symbol table | |
1559 | ||
1560 | SYNOPSIS | |
1561 | ||
1562 | static void start_symtab (void) | |
1563 | ||
1564 | DESCRIPTION | |
1565 | ||
1566 | Called whenever we are starting to process dies for a new | |
1567 | compilation unit, to perform initializations. Right now | |
1568 | the only thing we really have to do is initialize storage | |
1569 | space for the line number vector. | |
1570 | ||
1571 | */ | |
1572 | ||
1573 | static void | |
1574 | DEFUN_VOID (start_symtab) | |
1575 | { | |
1576 | int nbytes; | |
1577 | ||
1578 | line_vector_index = 0; | |
1579 | line_vector_length = 1000; | |
1580 | nbytes = sizeof (struct linetable); | |
1581 | nbytes += line_vector_length * sizeof (struct linetable_entry); | |
1582 | line_vector = (struct linetable *) xmalloc (nbytes); | |
1583 | } | |
1584 | ||
1585 | /* | |
1586 | ||
1587 | LOCAL FUNCTION | |
1588 | ||
1589 | process_dies -- process a range of DWARF Information Entries | |
1590 | ||
1591 | SYNOPSIS | |
1592 | ||
8b5b6fae FF |
1593 | static void process_dies (char *thisdie, char *enddie, |
1594 | struct objfile *objfile) | |
35f5886e FF |
1595 | |
1596 | DESCRIPTION | |
1597 | ||
1598 | Process all DIE's in a specified range. May be (and almost | |
1599 | certainly will be) called recursively. | |
1600 | */ | |
1601 | ||
1602 | static void | |
a048c8f5 JG |
1603 | DEFUN(process_dies, (thisdie, enddie, objfile), |
1604 | char *thisdie AND char *enddie AND struct objfile *objfile) | |
35f5886e FF |
1605 | { |
1606 | char *nextdie; | |
1607 | struct dieinfo di; | |
1608 | ||
1609 | while (thisdie < enddie) | |
1610 | { | |
1611 | basicdieinfo (&di, thisdie); | |
1612 | if (di.dielength < sizeof (long)) | |
1613 | { | |
1614 | break; | |
1615 | } | |
1616 | else if (di.dietag == TAG_padding) | |
1617 | { | |
1618 | nextdie = thisdie + di.dielength; | |
1619 | } | |
1620 | else | |
1621 | { | |
1622 | completedieinfo (&di); | |
1623 | if (di.at_sibling != 0) | |
1624 | { | |
1625 | nextdie = dbbase + di.at_sibling - dbroff; | |
1626 | } | |
1627 | else | |
1628 | { | |
1629 | nextdie = thisdie + di.dielength; | |
1630 | } | |
1631 | switch (di.dietag) | |
1632 | { | |
1633 | case TAG_compile_unit: | |
a048c8f5 | 1634 | read_file_scope (&di, thisdie, nextdie, objfile); |
35f5886e FF |
1635 | break; |
1636 | case TAG_global_subroutine: | |
1637 | case TAG_subroutine: | |
2d6186f4 | 1638 | if (di.has_at_low_pc) |
35f5886e | 1639 | { |
a048c8f5 | 1640 | read_func_scope (&di, thisdie, nextdie, objfile); |
35f5886e FF |
1641 | } |
1642 | break; | |
1643 | case TAG_lexical_block: | |
a048c8f5 | 1644 | read_lexical_block_scope (&di, thisdie, nextdie, objfile); |
35f5886e FF |
1645 | break; |
1646 | case TAG_structure_type: | |
1647 | case TAG_union_type: | |
8b5b6fae | 1648 | read_structure_scope (&di, thisdie, nextdie, objfile); |
35f5886e FF |
1649 | break; |
1650 | case TAG_enumeration_type: | |
1651 | read_enumeration (&di, thisdie, nextdie); | |
1652 | break; | |
1653 | case TAG_subroutine_type: | |
1654 | read_subroutine_type (&di, thisdie, nextdie); | |
1655 | break; | |
1656 | case TAG_array_type: | |
1657 | read_array_type (&di); | |
1658 | break; | |
1659 | default: | |
1660 | (void) new_symbol (&di); | |
1661 | break; | |
1662 | } | |
1663 | } | |
1664 | thisdie = nextdie; | |
1665 | } | |
1666 | } | |
1667 | ||
1668 | /* | |
1669 | ||
1670 | LOCAL FUNCTION | |
1671 | ||
1672 | end_symtab -- finish processing for a compilation unit | |
1673 | ||
1674 | SYNOPSIS | |
1675 | ||
1676 | static void end_symtab (char *filename, long language) | |
1677 | ||
1678 | DESCRIPTION | |
1679 | ||
1680 | Complete the symbol table entry for the current compilation | |
1681 | unit. Make the struct symtab and put it on the list of all | |
1682 | such symtabs. | |
1683 | ||
1684 | */ | |
1685 | ||
1686 | static void | |
a048c8f5 JG |
1687 | DEFUN(end_symtab, (filename, language, objfile), |
1688 | char *filename AND long language AND struct objfile *objfile) | |
35f5886e FF |
1689 | { |
1690 | struct symtab *symtab; | |
1691 | struct blockvector *blockvector; | |
1692 | int nbytes; | |
1693 | ||
1694 | /* Ignore a file that has no functions with real debugging info. */ | |
1695 | if (global_symbols == NULL && scopetree -> block == NULL) | |
1696 | { | |
1697 | free (line_vector); | |
1698 | line_vector = NULL; | |
1699 | line_vector_length = -1; | |
1700 | freescope (scopetree); | |
1701 | scope = scopetree = NULL; | |
1702 | } | |
1703 | ||
1704 | /* Create the blockvector that points to all the file's blocks. */ | |
1705 | ||
1706 | blockvector = make_blockvector (); | |
1707 | ||
1708 | /* Now create the symtab object for this source file. */ | |
1709 | ||
a048c8f5 JG |
1710 | symtab = allocate_symtab (savestring (filename, strlen (filename)), |
1711 | objfile); | |
35f5886e FF |
1712 | |
1713 | symtab -> free_ptr = 0; | |
1714 | ||
1715 | /* Fill in its components. */ | |
1716 | symtab -> blockvector = blockvector; | |
1717 | symtab -> free_code = free_linetable; | |
35f5886e FF |
1718 | |
1719 | /* Save the line number information. */ | |
1720 | ||
1721 | line_vector -> nitems = line_vector_index; | |
1722 | nbytes = sizeof (struct linetable); | |
1723 | if (line_vector_index > 1) | |
1724 | { | |
1725 | nbytes += (line_vector_index - 1) * sizeof (struct linetable_entry); | |
1726 | } | |
1727 | symtab -> linetable = (struct linetable *) xrealloc (line_vector, nbytes); | |
35f5886e FF |
1728 | |
1729 | /* FIXME: The following may need to be expanded for other languages */ | |
545af6ce | 1730 | switch (language) |
35f5886e | 1731 | { |
545af6ce PB |
1732 | case LANG_C89: |
1733 | case LANG_C: | |
1734 | symtab -> language = language_c; | |
1735 | break; | |
1736 | case LANG_C_PLUS_PLUS: | |
1737 | symtab -> language = language_cplus; | |
1738 | break; | |
1739 | default: | |
1740 | ; | |
35f5886e | 1741 | } |
545af6ce | 1742 | |
35f5886e FF |
1743 | /* Link the new symtab into the list of such. */ |
1744 | symtab -> next = symtab_list; | |
1745 | symtab_list = symtab; | |
1746 | ||
1747 | /* Recursively free the scope tree */ | |
1748 | freescope (scopetree); | |
1749 | scope = scopetree = NULL; | |
1750 | ||
1751 | /* Reinitialize for beginning of new file. */ | |
1752 | line_vector = 0; | |
1753 | line_vector_length = -1; | |
1754 | } | |
1755 | ||
1756 | /* | |
1757 | ||
1758 | LOCAL FUNCTION | |
1759 | ||
1760 | scopecount -- count the number of enclosed scopes | |
1761 | ||
1762 | SYNOPSIS | |
1763 | ||
1764 | static int scopecount (struct scopenode *node) | |
1765 | ||
1766 | DESCRIPTION | |
1767 | ||
1768 | Given pointer to a node, compute the size of the subtree which is | |
1769 | rooted in this node, which also happens to be the number of scopes | |
1770 | to the subtree. | |
1771 | */ | |
1772 | ||
1773 | static int | |
1774 | DEFUN(scopecount, (node), struct scopenode *node) | |
1775 | { | |
1776 | int count = 0; | |
1777 | ||
1778 | if (node != NULL) | |
1779 | { | |
1780 | count += scopecount (node -> child); | |
1781 | count += scopecount (node -> sibling); | |
1782 | count++; | |
1783 | } | |
1784 | return (count); | |
1785 | } | |
1786 | ||
1787 | /* | |
1788 | ||
1789 | LOCAL FUNCTION | |
1790 | ||
1791 | openscope -- start a new lexical block scope | |
1792 | ||
1793 | SYNOPSIS | |
1794 | ||
1795 | static void openscope (struct symbol *namesym, CORE_ADDR lowpc, | |
1796 | CORE_ADDR highpc) | |
1797 | ||
1798 | DESCRIPTION | |
1799 | ||
1800 | Start a new scope by allocating a new scopenode, adding it as the | |
1801 | next child of the current scope (if any) or as the root of the | |
1802 | scope tree, and then making the new node the current scope node. | |
1803 | */ | |
1804 | ||
1805 | static void | |
1806 | DEFUN(openscope, (namesym, lowpc, highpc), | |
1807 | struct symbol *namesym AND | |
1808 | CORE_ADDR lowpc AND | |
1809 | CORE_ADDR highpc) | |
1810 | { | |
1811 | struct scopenode *new; | |
1812 | struct scopenode *child; | |
1813 | ||
1814 | new = (struct scopenode *) xmalloc (sizeof (*new)); | |
1815 | (void) memset (new, 0, sizeof (*new)); | |
1816 | new -> namesym = namesym; | |
1817 | new -> lowpc = lowpc; | |
1818 | new -> highpc = highpc; | |
1819 | if (scope == NULL) | |
1820 | { | |
1821 | scopetree = new; | |
1822 | } | |
1823 | else if ((child = scope -> child) == NULL) | |
1824 | { | |
1825 | scope -> child = new; | |
1826 | new -> parent = scope; | |
1827 | } | |
1828 | else | |
1829 | { | |
1830 | while (child -> sibling != NULL) | |
1831 | { | |
1832 | child = child -> sibling; | |
1833 | } | |
1834 | child -> sibling = new; | |
1835 | new -> parent = scope; | |
1836 | } | |
1837 | scope = new; | |
1838 | } | |
1839 | ||
1840 | /* | |
1841 | ||
1842 | LOCAL FUNCTION | |
1843 | ||
1844 | freescope -- free a scope tree rooted at the given node | |
1845 | ||
1846 | SYNOPSIS | |
1847 | ||
1848 | static void freescope (struct scopenode *node) | |
1849 | ||
1850 | DESCRIPTION | |
1851 | ||
1852 | Given a pointer to a node in the scope tree, free the subtree | |
1853 | rooted at that node. First free all the children and sibling | |
1854 | nodes, and then the node itself. Used primarily for cleaning | |
1855 | up after ourselves and returning memory to the system. | |
1856 | */ | |
1857 | ||
1858 | static void | |
1859 | DEFUN(freescope, (node), struct scopenode *node) | |
1860 | { | |
1861 | if (node != NULL) | |
1862 | { | |
1863 | freescope (node -> child); | |
1864 | freescope (node -> sibling); | |
1865 | free (node); | |
1866 | } | |
1867 | } | |
1868 | ||
1869 | /* | |
1870 | ||
1871 | LOCAL FUNCTION | |
1872 | ||
1873 | buildblock -- build a new block from pending symbols list | |
1874 | ||
1875 | SYNOPSIS | |
1876 | ||
1877 | static struct block *buildblock (struct pending_symbol *syms) | |
1878 | ||
1879 | DESCRIPTION | |
1880 | ||
1881 | Given a pointer to a list of symbols, build a new block and free | |
1882 | the symbol list structure. Also check each symbol to see if it | |
1883 | is the special symbol that flags that this block was compiled by | |
1884 | gcc, and if so, mark the block appropriately. | |
1885 | */ | |
1886 | ||
1887 | static struct block * | |
1888 | DEFUN(buildblock, (syms), struct pending_symbol *syms) | |
1889 | { | |
1890 | struct pending_symbol *next, *next1; | |
1891 | int i; | |
1892 | struct block *newblock; | |
1893 | int nbytes; | |
1894 | ||
1895 | for (next = syms, i = 0 ; next ; next = next -> next, i++) {;} | |
1896 | ||
1897 | /* Allocate a new block */ | |
1898 | ||
1899 | nbytes = sizeof (struct block); | |
1900 | if (i > 1) | |
1901 | { | |
1902 | nbytes += (i - 1) * sizeof (struct symbol *); | |
1903 | } | |
1904 | newblock = (struct block *) obstack_alloc (symbol_obstack, nbytes); | |
1905 | (void) memset (newblock, 0, nbytes); | |
1906 | ||
1907 | /* Copy the symbols into the block. */ | |
1908 | ||
1909 | BLOCK_NSYMS (newblock) = i; | |
1910 | for (next = syms ; next ; next = next -> next) | |
1911 | { | |
1912 | BLOCK_SYM (newblock, --i) = next -> symbol; | |
1913 | if (STREQ (GCC_COMPILED_FLAG_SYMBOL, SYMBOL_NAME (next -> symbol)) || | |
1914 | STREQ (GCC2_COMPILED_FLAG_SYMBOL, SYMBOL_NAME (next -> symbol))) | |
1915 | { | |
1916 | BLOCK_GCC_COMPILED (newblock) = 1; | |
1917 | } | |
1918 | } | |
1919 | ||
1920 | /* Now free the links of the list, and empty the list. */ | |
1921 | ||
1922 | for (next = syms ; next ; next = next1) | |
1923 | { | |
1924 | next1 = next -> next; | |
1925 | free (next); | |
1926 | } | |
1927 | ||
1928 | return (newblock); | |
1929 | } | |
1930 | ||
1931 | /* | |
1932 | ||
1933 | LOCAL FUNCTION | |
1934 | ||
1935 | closescope -- close a lexical block scope | |
1936 | ||
1937 | SYNOPSIS | |
1938 | ||
1939 | static void closescope (void) | |
1940 | ||
1941 | DESCRIPTION | |
1942 | ||
1943 | Close the current lexical block scope. Closing the current scope | |
1944 | is as simple as moving the current scope pointer up to the parent | |
1945 | of the current scope pointer. But we also take this opportunity | |
1946 | to build the block for the current scope first, since we now have | |
1947 | all of it's symbols. | |
1948 | */ | |
1949 | ||
1950 | static void | |
1951 | DEFUN_VOID(closescope) | |
1952 | { | |
1953 | struct scopenode *child; | |
1954 | ||
1955 | if (scope == NULL) | |
1956 | { | |
1957 | error ("DWARF parse error, too many close scopes"); | |
1958 | } | |
1959 | else | |
1960 | { | |
1961 | if (scope -> parent == NULL) | |
1962 | { | |
1963 | global_symbol_block = buildblock (global_symbols); | |
1964 | global_symbols = NULL; | |
1965 | BLOCK_START (global_symbol_block) = scope -> lowpc + baseaddr; | |
1966 | BLOCK_END (global_symbol_block) = scope -> highpc + baseaddr; | |
1967 | } | |
1968 | scope -> block = buildblock (scope -> symbols); | |
1969 | scope -> symbols = NULL; | |
1970 | BLOCK_START (scope -> block) = scope -> lowpc + baseaddr; | |
1971 | BLOCK_END (scope -> block) = scope -> highpc + baseaddr; | |
1972 | ||
1973 | /* Put the local block in as the value of the symbol that names it. */ | |
1974 | ||
1975 | if (scope -> namesym) | |
1976 | { | |
1977 | SYMBOL_BLOCK_VALUE (scope -> namesym) = scope -> block; | |
1978 | BLOCK_FUNCTION (scope -> block) = scope -> namesym; | |
1979 | } | |
1980 | ||
1981 | /* Install this scope's local block as the superblock of all child | |
1982 | scope blocks. */ | |
1983 | ||
1984 | for (child = scope -> child ; child ; child = child -> sibling) | |
1985 | { | |
1986 | BLOCK_SUPERBLOCK (child -> block) = scope -> block; | |
1987 | } | |
1988 | ||
1989 | scope = scope -> parent; | |
1990 | } | |
1991 | } | |
1992 | ||
1993 | /* | |
1994 | ||
1995 | LOCAL FUNCTION | |
1996 | ||
1997 | record_line -- record a line number entry in the line vector | |
1998 | ||
1999 | SYNOPSIS | |
2000 | ||
2001 | static void record_line (int line, CORE_ADDR pc) | |
2002 | ||
2003 | DESCRIPTION | |
2004 | ||
2005 | Given a line number and the corresponding pc value, record | |
2006 | this pair in the line number vector, expanding the vector as | |
2007 | necessary. | |
2008 | */ | |
2009 | ||
2010 | static void | |
2011 | DEFUN(record_line, (line, pc), int line AND CORE_ADDR pc) | |
2012 | { | |
2013 | struct linetable_entry *e; | |
2014 | int nbytes; | |
2015 | ||
2016 | /* Make sure line vector is big enough. */ | |
2017 | ||
2018 | if (line_vector_index + 2 >= line_vector_length) | |
2019 | { | |
2020 | line_vector_length *= 2; | |
2021 | nbytes = sizeof (struct linetable); | |
2022 | nbytes += (line_vector_length * sizeof (struct linetable_entry)); | |
2023 | line_vector = (struct linetable *) xrealloc (line_vector, nbytes); | |
2024 | } | |
2025 | e = line_vector -> item + line_vector_index++; | |
2026 | e -> line = line; | |
2027 | e -> pc = pc; | |
2028 | } | |
2029 | ||
2030 | /* | |
2031 | ||
2032 | LOCAL FUNCTION | |
2033 | ||
2034 | decode_line_numbers -- decode a line number table fragment | |
2035 | ||
2036 | SYNOPSIS | |
2037 | ||
2038 | static void decode_line_numbers (char *tblscan, char *tblend, | |
2039 | long length, long base, long line, long pc) | |
2040 | ||
2041 | DESCRIPTION | |
2042 | ||
2043 | Translate the DWARF line number information to gdb form. | |
2044 | ||
2045 | The ".line" section contains one or more line number tables, one for | |
2046 | each ".line" section from the objects that were linked. | |
2047 | ||
2048 | The AT_stmt_list attribute for each TAG_source_file entry in the | |
2049 | ".debug" section contains the offset into the ".line" section for the | |
2050 | start of the table for that file. | |
2051 | ||
2052 | The table itself has the following structure: | |
2053 | ||
2054 | <table length><base address><source statement entry> | |
2055 | 4 bytes 4 bytes 10 bytes | |
2056 | ||
2057 | The table length is the total size of the table, including the 4 bytes | |
2058 | for the length information. | |
2059 | ||
2060 | The base address is the address of the first instruction generated | |
2061 | for the source file. | |
2062 | ||
2063 | Each source statement entry has the following structure: | |
2064 | ||
2065 | <line number><statement position><address delta> | |
2066 | 4 bytes 2 bytes 4 bytes | |
2067 | ||
2068 | The line number is relative to the start of the file, starting with | |
2069 | line 1. | |
2070 | ||
2071 | The statement position either -1 (0xFFFF) or the number of characters | |
2072 | from the beginning of the line to the beginning of the statement. | |
2073 | ||
2074 | The address delta is the difference between the base address and | |
2075 | the address of the first instruction for the statement. | |
2076 | ||
2077 | Note that we must copy the bytes from the packed table to our local | |
2078 | variables before attempting to use them, to avoid alignment problems | |
2079 | on some machines, particularly RISC processors. | |
2080 | ||
2081 | BUGS | |
2082 | ||
2083 | Does gdb expect the line numbers to be sorted? They are now by | |
2084 | chance/luck, but are not required to be. (FIXME) | |
2085 | ||
2086 | The line with number 0 is unused, gdb apparently can discover the | |
2087 | span of the last line some other way. How? (FIXME) | |
2088 | */ | |
2089 | ||
2090 | static void | |
2091 | DEFUN(decode_line_numbers, (linetable), char *linetable) | |
2092 | { | |
2093 | char *tblscan; | |
2094 | char *tblend; | |
2095 | long length; | |
2096 | long base; | |
2097 | long line; | |
2098 | long pc; | |
2099 | ||
2100 | if (linetable != NULL) | |
2101 | { | |
2102 | tblscan = tblend = linetable; | |
2103 | (void) memcpy (&length, tblscan, sizeof (long)); | |
2104 | tblscan += sizeof (long); | |
2105 | tblend += length; | |
2106 | (void) memcpy (&base, tblscan, sizeof (long)); | |
2107 | base += baseaddr; | |
2108 | tblscan += sizeof (long); | |
2109 | while (tblscan < tblend) | |
2110 | { | |
2111 | (void) memcpy (&line, tblscan, sizeof (long)); | |
2112 | tblscan += sizeof (long) + sizeof (short); | |
2113 | (void) memcpy (&pc, tblscan, sizeof (long)); | |
2114 | tblscan += sizeof (long); | |
2115 | pc += base; | |
2116 | if (line > 0) | |
2117 | { | |
2118 | record_line (line, pc); | |
2119 | } | |
2120 | } | |
2121 | } | |
2122 | } | |
2123 | ||
2124 | /* | |
2125 | ||
2126 | LOCAL FUNCTION | |
2127 | ||
2128 | add_symbol_to_list -- add a symbol to head of current symbol list | |
2129 | ||
2130 | SYNOPSIS | |
2131 | ||
2132 | static void add_symbol_to_list (struct symbol *symbol, struct | |
2133 | pending_symbol **listhead) | |
2134 | ||
2135 | DESCRIPTION | |
2136 | ||
2137 | Given a pointer to a symbol and a pointer to a pointer to a | |
2138 | list of symbols, add this symbol as the current head of the | |
2139 | list. Typically used for example to add a symbol to the | |
2140 | symbol list for the current scope. | |
2141 | ||
2142 | */ | |
2143 | ||
2144 | static void | |
2145 | DEFUN(add_symbol_to_list, (symbol, listhead), | |
2146 | struct symbol *symbol AND struct pending_symbol **listhead) | |
2147 | { | |
2148 | struct pending_symbol *link; | |
2149 | ||
2150 | if (symbol != NULL) | |
2151 | { | |
2152 | link = (struct pending_symbol *) xmalloc (sizeof (*link)); | |
2153 | link -> next = *listhead; | |
2154 | link -> symbol = symbol; | |
2155 | *listhead = link; | |
2156 | } | |
2157 | } | |
2158 | ||
2159 | /* | |
2160 | ||
2161 | LOCAL FUNCTION | |
2162 | ||
2163 | gatherblocks -- walk a scope tree and build block vectors | |
2164 | ||
2165 | SYNOPSIS | |
2166 | ||
2167 | static struct block **gatherblocks (struct block **dest, | |
2168 | struct scopenode *node) | |
2169 | ||
2170 | DESCRIPTION | |
2171 | ||
2172 | Recursively walk a scope tree rooted in the given node, adding blocks | |
2173 | to the array pointed to by DEST, in preorder. I.E., first we add the | |
2174 | block for the current scope, then all the blocks for child scopes, | |
2175 | and finally all the blocks for sibling scopes. | |
2176 | */ | |
2177 | ||
2178 | static struct block ** | |
2179 | DEFUN(gatherblocks, (dest, node), | |
2180 | struct block **dest AND struct scopenode *node) | |
2181 | { | |
2182 | if (node != NULL) | |
2183 | { | |
2184 | *dest++ = node -> block; | |
2185 | dest = gatherblocks (dest, node -> child); | |
2186 | dest = gatherblocks (dest, node -> sibling); | |
2187 | } | |
2188 | return (dest); | |
2189 | } | |
2190 | ||
2191 | /* | |
2192 | ||
2193 | LOCAL FUNCTION | |
2194 | ||
2195 | make_blockvector -- make a block vector from current scope tree | |
2196 | ||
2197 | SYNOPSIS | |
2198 | ||
2199 | static struct blockvector *make_blockvector (void) | |
2200 | ||
2201 | DESCRIPTION | |
2202 | ||
2203 | Make a blockvector from all the blocks in the current scope tree. | |
2204 | The first block is always the global symbol block, followed by the | |
2205 | block for the root of the scope tree which is the local symbol block, | |
2206 | followed by all the remaining blocks in the scope tree, which are all | |
2207 | local scope blocks. | |
2208 | ||
2209 | NOTES | |
2210 | ||
2211 | Note that since the root node of the scope tree is created at the time | |
2212 | each file scope is entered, there are always at least two blocks, | |
2213 | neither of which may have any symbols, but always contribute a block | |
2214 | to the block vector. So the test for number of blocks greater than 1 | |
2215 | below is unnecessary given bug free code. | |
2216 | ||
2217 | The resulting block structure varies slightly from that produced | |
2218 | by dbxread.c, in that block 0 and block 1 are sibling blocks while | |
2219 | with dbxread.c, block 1 is a child of block 0. This does not | |
2220 | seem to cause any problems, but probably should be fixed. (FIXME) | |
2221 | */ | |
2222 | ||
2223 | static struct blockvector * | |
2224 | DEFUN_VOID(make_blockvector) | |
2225 | { | |
2226 | struct blockvector *blockvector = NULL; | |
2227 | int i; | |
2228 | int nbytes; | |
2229 | ||
2230 | /* Recursively walk down the tree, counting the number of blocks. | |
2231 | Then add one to account for the global's symbol block */ | |
2232 | ||
2233 | i = scopecount (scopetree) + 1; | |
2234 | nbytes = sizeof (struct blockvector); | |
2235 | if (i > 1) | |
2236 | { | |
2237 | nbytes += (i - 1) * sizeof (struct block *); | |
2238 | } | |
2239 | blockvector = (struct blockvector *) | |
2240 | obstack_alloc (symbol_obstack, nbytes); | |
2241 | ||
2242 | /* Copy the blocks into the blockvector. */ | |
2243 | ||
2244 | BLOCKVECTOR_NBLOCKS (blockvector) = i; | |
2245 | BLOCKVECTOR_BLOCK (blockvector, 0) = global_symbol_block; | |
2246 | gatherblocks (&BLOCKVECTOR_BLOCK (blockvector, 1), scopetree); | |
2247 | ||
2248 | return (blockvector); | |
2249 | } | |
2250 | ||
2251 | /* | |
2252 | ||
2253 | LOCAL FUNCTION | |
2254 | ||
2255 | locval -- compute the value of a location attribute | |
2256 | ||
2257 | SYNOPSIS | |
2258 | ||
2259 | static int locval (char *loc) | |
2260 | ||
2261 | DESCRIPTION | |
2262 | ||
2263 | Given pointer to a string of bytes that define a location, compute | |
2264 | the location and return the value. | |
2265 | ||
2266 | When computing values involving the current value of the frame pointer, | |
2267 | the value zero is used, which results in a value relative to the frame | |
2268 | pointer, rather than the absolute value. This is what GDB wants | |
2269 | anyway. | |
2270 | ||
2271 | When the result is a register number, the global isreg flag is set, | |
2272 | otherwise it is cleared. This is a kludge until we figure out a better | |
2273 | way to handle the problem. Gdb's design does not mesh well with the | |
2274 | DWARF notion of a location computing interpreter, which is a shame | |
2275 | because the flexibility goes unused. | |
2276 | ||
2277 | NOTES | |
2278 | ||
2279 | Note that stack[0] is unused except as a default error return. | |
2280 | Note that stack overflow is not yet handled. | |
2281 | */ | |
2282 | ||
2283 | static int | |
2284 | DEFUN(locval, (loc), char *loc) | |
2285 | { | |
2286 | unsigned short nbytes; | |
2287 | auto int stack[64]; | |
2288 | int stacki; | |
2289 | char *end; | |
2290 | long regno; | |
2291 | ||
2292 | (void) memcpy (&nbytes, loc, sizeof (short)); | |
2293 | end = loc + sizeof (short) + nbytes; | |
2294 | stacki = 0; | |
2295 | stack[stacki] = 0; | |
2296 | isreg = 0; | |
2297 | for (loc += sizeof (short); loc < end; loc += sizeof (long)) | |
2298 | { | |
2299 | switch (*loc++) { | |
2300 | case 0: | |
2301 | /* error */ | |
2302 | loc = end; | |
2303 | break; | |
2304 | case OP_REG: | |
2305 | /* push register (number) */ | |
2306 | (void) memcpy (&stack[++stacki], loc, sizeof (long)); | |
2307 | isreg = 1; | |
2308 | break; | |
2309 | case OP_BASEREG: | |
2310 | /* push value of register (number) */ | |
2311 | /* Actually, we compute the value as if register has 0 */ | |
2312 | (void) memcpy (®no, loc, sizeof (long)); | |
2313 | if (regno == R_FP) | |
2314 | { | |
2315 | stack[++stacki] = 0; | |
2316 | } | |
2317 | else | |
2318 | { | |
2319 | stack[++stacki] = 0; | |
2320 | SQUAWK (("BASEREG %d not handled!", regno)); | |
2321 | } | |
2322 | break; | |
2323 | case OP_ADDR: | |
2324 | /* push address (relocated address) */ | |
2325 | (void) memcpy (&stack[++stacki], loc, sizeof (long)); | |
2326 | break; | |
2327 | case OP_CONST: | |
2328 | /* push constant (number) */ | |
2329 | (void) memcpy (&stack[++stacki], loc, sizeof (long)); | |
2330 | break; | |
2331 | case OP_DEREF2: | |
2332 | /* pop, deref and push 2 bytes (as a long) */ | |
2333 | SQUAWK (("OP_DEREF2 address %#x not handled", stack[stacki])); | |
2334 | break; | |
2335 | case OP_DEREF4: /* pop, deref and push 4 bytes (as a long) */ | |
2336 | SQUAWK (("OP_DEREF4 address %#x not handled", stack[stacki])); | |
2337 | break; | |
2338 | case OP_ADD: /* pop top 2 items, add, push result */ | |
2339 | stack[stacki - 1] += stack[stacki]; | |
2340 | stacki--; | |
2341 | break; | |
2342 | } | |
2343 | } | |
2344 | return (stack[stacki]); | |
2345 | } | |
2346 | ||
2347 | /* | |
2348 | ||
2349 | LOCAL FUNCTION | |
2350 | ||
2351 | read_ofile_symtab -- build a full symtab entry from chunk of DIE's | |
2352 | ||
2353 | SYNOPSIS | |
2354 | ||
a048c8f5 | 2355 | static struct symtab *read_ofile_symtab (struct partial_symtab *pst) |
35f5886e FF |
2356 | |
2357 | DESCRIPTION | |
2358 | ||
a048c8f5 | 2359 | OFFSET is a relocation offset which gets added to each symbol (FIXME). |
35f5886e FF |
2360 | */ |
2361 | ||
2362 | static struct symtab * | |
a048c8f5 JG |
2363 | DEFUN(read_ofile_symtab, (pst), |
2364 | struct partial_symtab *pst) | |
35f5886e FF |
2365 | { |
2366 | struct cleanup *back_to; | |
2367 | long lnsize; | |
2368 | int foffset; | |
a048c8f5 | 2369 | bfd *abfd = pst->objfile->obfd; |
35f5886e FF |
2370 | |
2371 | /* Allocate a buffer for the entire chunk of DIE's for this compilation | |
2372 | unit, seek to the location in the file, and read in all the DIE's. */ | |
2373 | ||
2374 | diecount = 0; | |
2375 | dbbase = xmalloc (DBLENGTH(pst)); | |
2376 | dbroff = DBROFF(pst); | |
2377 | foffset = DBFOFF(pst) + dbroff; | |
a048c8f5 JG |
2378 | if (bfd_seek (abfd, foffset, 0) || |
2379 | (bfd_read (dbbase, DBLENGTH(pst), 1, abfd) != DBLENGTH(pst))) | |
35f5886e FF |
2380 | { |
2381 | free (dbbase); | |
2382 | error ("can't read DWARF data"); | |
2383 | } | |
2384 | back_to = make_cleanup (free, dbbase); | |
2385 | ||
2386 | /* If there is a line number table associated with this compilation unit | |
2387 | then read the first long word from the line number table fragment, which | |
2388 | contains the size of the fragment in bytes (including the long word | |
2389 | itself). Allocate a buffer for the fragment and read it in for future | |
2390 | processing. */ | |
2391 | ||
2392 | lnbase = NULL; | |
2393 | if (LNFOFF (pst)) | |
2394 | { | |
a048c8f5 JG |
2395 | if (bfd_seek (abfd, LNFOFF (pst), 0) || |
2396 | (bfd_read (&lnsize, sizeof(long), 1, abfd) != sizeof(long))) | |
35f5886e FF |
2397 | { |
2398 | error ("can't read DWARF line number table size"); | |
2399 | } | |
2400 | lnbase = xmalloc (lnsize); | |
a048c8f5 JG |
2401 | if (bfd_seek (abfd, LNFOFF (pst), 0) || |
2402 | (bfd_read (lnbase, lnsize, 1, abfd) != lnsize)) | |
35f5886e FF |
2403 | { |
2404 | free (lnbase); | |
2405 | error ("can't read DWARF line numbers"); | |
2406 | } | |
2407 | make_cleanup (free, lnbase); | |
2408 | } | |
2409 | ||
a048c8f5 | 2410 | process_dies (dbbase, dbbase + DBLENGTH(pst), pst->objfile); |
35f5886e FF |
2411 | do_cleanups (back_to); |
2412 | return (symtab_list); | |
2413 | } | |
2414 | ||
2415 | /* | |
2416 | ||
2417 | LOCAL FUNCTION | |
2418 | ||
2419 | psymtab_to_symtab_1 -- do grunt work for building a full symtab entry | |
2420 | ||
2421 | SYNOPSIS | |
2422 | ||
a048c8f5 | 2423 | static void psymtab_to_symtab_1 (struct partial_symtab *pst) |
35f5886e FF |
2424 | |
2425 | DESCRIPTION | |
2426 | ||
2427 | Called once for each partial symbol table entry that needs to be | |
2428 | expanded into a full symbol table entry. | |
2429 | ||
2430 | */ | |
2431 | ||
2432 | static void | |
2433 | DEFUN(psymtab_to_symtab_1, | |
a048c8f5 JG |
2434 | (pst), |
2435 | struct partial_symtab *pst) | |
35f5886e FF |
2436 | { |
2437 | int i; | |
2438 | ||
2439 | if (!pst) | |
2440 | { | |
2441 | return; | |
2442 | } | |
2443 | if (pst->readin) | |
2444 | { | |
2445 | fprintf (stderr, "Psymtab for %s already read in. Shouldn't happen.\n", | |
2446 | pst -> filename); | |
2447 | return; | |
2448 | } | |
2449 | ||
2450 | /* Read in all partial symtabs on which this one is dependent */ | |
2451 | for (i = 0; i < pst -> number_of_dependencies; i++) | |
2452 | if (!pst -> dependencies[i] -> readin) | |
2453 | { | |
2454 | /* Inform about additional files that need to be read in. */ | |
2455 | if (info_verbose) | |
2456 | { | |
2457 | fputs_filtered (" ", stdout); | |
2458 | wrap_here (""); | |
2459 | fputs_filtered ("and ", stdout); | |
2460 | wrap_here (""); | |
2461 | printf_filtered ("%s...", pst -> dependencies[i] -> filename); | |
2462 | wrap_here (""); /* Flush output */ | |
2463 | fflush (stdout); | |
2464 | } | |
a048c8f5 | 2465 | psymtab_to_symtab_1 (pst -> dependencies[i]); |
35f5886e FF |
2466 | } |
2467 | ||
2468 | if (DBLENGTH(pst)) /* Otherwise it's a dummy */ | |
2469 | { | |
2470 | /* Init stuff necessary for reading in symbols */ | |
a048c8f5 | 2471 | pst -> symtab = read_ofile_symtab (pst); |
35f5886e FF |
2472 | if (info_verbose) |
2473 | { | |
2474 | printf_filtered ("%d DIE's, sorting...", diecount); | |
2475 | fflush (stdout); | |
2476 | } | |
2477 | sort_symtab_syms (pst -> symtab); | |
2478 | } | |
2479 | pst -> readin = 1; | |
2480 | } | |
2481 | ||
2482 | /* | |
2483 | ||
2484 | LOCAL FUNCTION | |
2485 | ||
2486 | dwarf_psymtab_to_symtab -- build a full symtab entry from partial one | |
2487 | ||
2488 | SYNOPSIS | |
2489 | ||
2490 | static void dwarf_psymtab_to_symtab (struct partial_symtab *pst) | |
2491 | ||
2492 | DESCRIPTION | |
2493 | ||
2494 | This is the DWARF support entry point for building a full symbol | |
2495 | table entry from a partial symbol table entry. We are passed a | |
2496 | pointer to the partial symbol table entry that needs to be expanded. | |
2497 | ||
2498 | */ | |
2499 | ||
2500 | static void | |
2501 | DEFUN(dwarf_psymtab_to_symtab, (pst), struct partial_symtab *pst) | |
2502 | { | |
7d9884b9 | 2503 | |
35f5886e FF |
2504 | if (!pst) |
2505 | { | |
2506 | return; | |
2507 | } | |
2508 | if (pst -> readin) | |
2509 | { | |
2510 | fprintf (stderr, "Psymtab for %s already read in. Shouldn't happen.\n", | |
2511 | pst -> filename); | |
2512 | return; | |
2513 | } | |
2514 | ||
2515 | if (DBLENGTH(pst) || pst -> number_of_dependencies) | |
2516 | { | |
2517 | /* Print the message now, before starting serious work, to avoid | |
2518 | disconcerting pauses. */ | |
2519 | if (info_verbose) | |
2520 | { | |
2521 | printf_filtered ("Reading in symbols for %s...", pst -> filename); | |
2522 | fflush (stdout); | |
2523 | } | |
2524 | ||
a048c8f5 | 2525 | psymtab_to_symtab_1 (pst); |
35f5886e FF |
2526 | |
2527 | #if 0 /* FIXME: Check to see what dbxread is doing here and see if | |
2528 | we need to do an equivalent or is this something peculiar to | |
2529 | stabs/a.out format. */ | |
2530 | /* Match with global symbols. This only needs to be done once, | |
2531 | after all of the symtabs and dependencies have been read in. */ | |
2532 | scan_file_globals (); | |
2533 | #endif | |
2534 | ||
35f5886e FF |
2535 | /* Finish up the debug error message. */ |
2536 | if (info_verbose) | |
2537 | { | |
2538 | printf_filtered ("done.\n"); | |
2539 | } | |
2540 | } | |
2541 | } | |
2542 | ||
2543 | /* | |
2544 | ||
2545 | LOCAL FUNCTION | |
2546 | ||
2547 | init_psymbol_list -- initialize storage for partial symbols | |
2548 | ||
2549 | SYNOPSIS | |
2550 | ||
2551 | static void init_psymbol_list (int total_symbols) | |
2552 | ||
2553 | DESCRIPTION | |
2554 | ||
2555 | Initializes storage for all of the partial symbols that will be | |
2556 | created by dwarf_build_psymtabs and subsidiaries. | |
2557 | */ | |
2558 | ||
2559 | static void | |
2560 | DEFUN(init_psymbol_list, (total_symbols), int total_symbols) | |
2561 | { | |
2562 | /* Free any previously allocated psymbol lists. */ | |
2563 | ||
2564 | if (global_psymbols.list) | |
2565 | { | |
2566 | free (global_psymbols.list); | |
2567 | } | |
2568 | if (static_psymbols.list) | |
2569 | { | |
2570 | free (static_psymbols.list); | |
2571 | } | |
2572 | ||
2573 | /* Current best guess is that there are approximately a twentieth | |
2574 | of the total symbols (in a debugging file) are global or static | |
2575 | oriented symbols */ | |
2576 | ||
2577 | global_psymbols.size = total_symbols / 10; | |
2578 | static_psymbols.size = total_symbols / 10; | |
2579 | global_psymbols.next = global_psymbols.list = (struct partial_symbol *) | |
2580 | xmalloc (global_psymbols.size * sizeof (struct partial_symbol)); | |
2581 | static_psymbols.next = static_psymbols.list = (struct partial_symbol *) | |
2582 | xmalloc (static_psymbols.size * sizeof (struct partial_symbol)); | |
2583 | } | |
2584 | ||
2585 | /* | |
2586 | ||
2587 | LOCAL FUNCTION | |
2588 | ||
2589 | start_psymtab -- allocate and partially fill a partial symtab entry | |
2590 | ||
2591 | DESCRIPTION | |
2592 | ||
2593 | Allocate and partially fill a partial symtab. It will be completely | |
2594 | filled at the end of the symbol list. | |
2595 | ||
2596 | SYMFILE_NAME is the name of the symbol-file we are reading from, and | |
2597 | ADDR is the address relative to which its symbols are (incremental) | |
2598 | or 0 (normal). FILENAME is the name of the compilation unit that | |
2599 | these symbols were defined in, and they appear starting a address | |
2600 | TEXTLOW. DBROFF is the absolute file offset in SYMFILE_NAME where | |
2601 | the full symbols can be read for compilation unit FILENAME. | |
2602 | GLOBAL_SYMS and STATIC_SYMS are pointers to the current end of the | |
2603 | psymtab vector. | |
2604 | ||
2605 | */ | |
2606 | ||
2607 | static struct partial_symtab * | |
2608 | DEFUN(start_psymtab, | |
a048c8f5 | 2609 | (objfile, addr, filename, textlow, texthigh, dbfoff, curoff, |
35f5886e | 2610 | culength, lnfoff, global_syms, static_syms), |
a048c8f5 | 2611 | struct objfile *objfile AND |
35f5886e FF |
2612 | CORE_ADDR addr AND |
2613 | char *filename AND | |
2614 | CORE_ADDR textlow AND | |
2615 | CORE_ADDR texthigh AND | |
2616 | int dbfoff AND | |
2617 | int curoff AND | |
2618 | int culength AND | |
2619 | int lnfoff AND | |
2620 | struct partial_symbol *global_syms AND | |
2621 | struct partial_symbol *static_syms) | |
2622 | { | |
2623 | struct partial_symtab *result; | |
2624 | ||
2625 | result = (struct partial_symtab *) | |
2626 | obstack_alloc (psymbol_obstack, sizeof (struct partial_symtab)); | |
2627 | (void) memset (result, 0, sizeof (struct partial_symtab)); | |
2628 | result -> addr = addr; | |
a048c8f5 | 2629 | result -> objfile = objfile; |
35f5886e FF |
2630 | result -> filename = create_name (filename, psymbol_obstack); |
2631 | result -> textlow = textlow; | |
2632 | result -> texthigh = texthigh; | |
2633 | result -> read_symtab_private = (char *) obstack_alloc (psymbol_obstack, | |
2634 | sizeof (struct dwfinfo)); | |
2635 | DBFOFF (result) = dbfoff; | |
2636 | DBROFF (result) = curoff; | |
2637 | DBLENGTH (result) = culength; | |
2638 | LNFOFF (result) = lnfoff; | |
2639 | result -> readin = 0; | |
2640 | result -> symtab = NULL; | |
2641 | result -> read_symtab = dwarf_psymtab_to_symtab; | |
2642 | result -> globals_offset = global_syms - global_psymbols.list; | |
2643 | result -> statics_offset = static_syms - static_psymbols.list; | |
2644 | ||
2645 | result->n_global_syms = 0; | |
2646 | result->n_static_syms = 0; | |
2647 | ||
2648 | return result; | |
2649 | } | |
2650 | ||
2651 | /* | |
2652 | ||
2653 | LOCAL FUNCTION | |
2654 | ||
2655 | add_psymbol_to_list -- add a partial symbol to given list | |
2656 | ||
2657 | DESCRIPTION | |
2658 | ||
2659 | Add a partial symbol to one of the partial symbol vectors (pointed to | |
2660 | by listp). The vector is grown as necessary. | |
2661 | ||
2662 | */ | |
2663 | ||
2664 | static void | |
2665 | DEFUN(add_psymbol_to_list, | |
2666 | (listp, name, space, class, value), | |
2667 | struct psymbol_allocation_list *listp AND | |
2668 | char *name AND | |
2669 | enum namespace space AND | |
2670 | enum address_class class AND | |
2671 | CORE_ADDR value) | |
2672 | { | |
2673 | struct partial_symbol *psym; | |
2674 | int newsize; | |
2675 | ||
2676 | if (listp -> next >= listp -> list + listp -> size) | |
2677 | { | |
2678 | newsize = listp -> size * 2; | |
2679 | listp -> list = (struct partial_symbol *) | |
2680 | xrealloc (listp -> list, (newsize * sizeof (struct partial_symbol))); | |
2681 | /* Next assumes we only went one over. Should be good if program works | |
2682 | correctly */ | |
2683 | listp -> next = listp -> list + listp -> size; | |
2684 | listp -> size = newsize; | |
2685 | } | |
2686 | psym = listp -> next++; | |
2687 | SYMBOL_NAME (psym) = create_name (name, psymbol_obstack); | |
2688 | SYMBOL_NAMESPACE (psym) = space; | |
2689 | SYMBOL_CLASS (psym) = class; | |
2690 | SYMBOL_VALUE (psym) = value; | |
2691 | } | |
2692 | ||
2693 | /* | |
2694 | ||
715cafcb FF |
2695 | LOCAL FUNCTION |
2696 | ||
2697 | add_enum_psymbol -- add enumeration members to partial symbol table | |
2698 | ||
2699 | DESCRIPTION | |
2700 | ||
2701 | Given pointer to a DIE that is known to be for an enumeration, | |
2702 | extract the symbolic names of the enumeration members and add | |
2703 | partial symbols for them. | |
2704 | */ | |
2705 | ||
2706 | static void | |
2707 | DEFUN(add_enum_psymbol, (dip), struct dieinfo *dip) | |
2708 | { | |
2709 | char *scan; | |
2710 | char *listend; | |
2711 | long ltemp; | |
2712 | short stemp; | |
2713 | ||
2714 | if ((scan = dip -> at_element_list) != NULL) | |
2715 | { | |
2716 | if (dip -> short_element_list) | |
2717 | { | |
2718 | (void) memcpy (&stemp, scan, sizeof (stemp)); | |
2719 | listend = scan + stemp + sizeof (stemp); | |
2720 | scan += sizeof (stemp); | |
2721 | } | |
2722 | else | |
2723 | { | |
2724 | (void) memcpy (<emp, scan, sizeof (ltemp)); | |
2725 | listend = scan + ltemp + sizeof (ltemp); | |
2726 | scan += sizeof (ltemp); | |
2727 | } | |
2728 | while (scan < listend) | |
2729 | { | |
2730 | scan += sizeof (long); | |
2731 | add_psymbol_to_list (&static_psymbols, scan, VAR_NAMESPACE, | |
2732 | LOC_CONST, 0); | |
2733 | scan += strlen (scan) + 1; | |
2734 | } | |
2735 | } | |
2736 | } | |
2737 | ||
2738 | /* | |
2739 | ||
35f5886e FF |
2740 | LOCAL FUNCTION |
2741 | ||
2742 | add_partial_symbol -- add symbol to partial symbol table | |
2743 | ||
2744 | DESCRIPTION | |
2745 | ||
2746 | Given a DIE, if it is one of the types that we want to | |
2747 | add to a partial symbol table, finish filling in the die info | |
2748 | and then add a partial symbol table entry for it. | |
2749 | ||
2750 | */ | |
2751 | ||
2752 | static void | |
2753 | DEFUN(add_partial_symbol, (dip), struct dieinfo *dip) | |
2754 | { | |
2755 | switch (dip -> dietag) | |
2756 | { | |
2757 | case TAG_global_subroutine: | |
a7446af6 | 2758 | record_misc_function (dip -> at_name, dip -> at_low_pc, mf_text); |
35f5886e FF |
2759 | add_psymbol_to_list (&global_psymbols, dip -> at_name, VAR_NAMESPACE, |
2760 | LOC_BLOCK, dip -> at_low_pc); | |
2761 | break; | |
2762 | case TAG_global_variable: | |
a7446af6 FF |
2763 | record_misc_function (dip -> at_name, locval (dip -> at_location), |
2764 | mf_data); | |
35f5886e FF |
2765 | add_psymbol_to_list (&global_psymbols, dip -> at_name, VAR_NAMESPACE, |
2766 | LOC_STATIC, 0); | |
2767 | break; | |
2768 | case TAG_subroutine: | |
2769 | add_psymbol_to_list (&static_psymbols, dip -> at_name, VAR_NAMESPACE, | |
2770 | LOC_BLOCK, dip -> at_low_pc); | |
2771 | break; | |
2772 | case TAG_local_variable: | |
2773 | add_psymbol_to_list (&static_psymbols, dip -> at_name, VAR_NAMESPACE, | |
2774 | LOC_STATIC, 0); | |
2775 | break; | |
2776 | case TAG_typedef: | |
2777 | add_psymbol_to_list (&static_psymbols, dip -> at_name, VAR_NAMESPACE, | |
2778 | LOC_TYPEDEF, 0); | |
2779 | break; | |
2780 | case TAG_structure_type: | |
2781 | case TAG_union_type: | |
35f5886e FF |
2782 | add_psymbol_to_list (&static_psymbols, dip -> at_name, STRUCT_NAMESPACE, |
2783 | LOC_TYPEDEF, 0); | |
2784 | break; | |
715cafcb FF |
2785 | case TAG_enumeration_type: |
2786 | if (dip -> at_name) | |
2787 | { | |
2788 | add_psymbol_to_list (&static_psymbols, dip -> at_name, | |
2789 | STRUCT_NAMESPACE, LOC_TYPEDEF, 0); | |
2790 | } | |
2791 | add_enum_psymbol (dip); | |
2792 | break; | |
35f5886e FF |
2793 | } |
2794 | } | |
2795 | ||
2796 | /* | |
2797 | ||
2798 | LOCAL FUNCTION | |
2799 | ||
2800 | scan_partial_symbols -- scan DIE's within a single compilation unit | |
2801 | ||
2802 | DESCRIPTION | |
2803 | ||
2804 | Process the DIE's within a single compilation unit, looking for | |
2805 | interesting DIE's that contribute to the partial symbol table entry | |
2806 | for this compilation unit. Since we cannot follow any sibling | |
2807 | chains without reading the complete DIE info for every DIE, | |
2808 | it is probably faster to just sequentially check each one to | |
715cafcb FF |
2809 | see if it is one of the types we are interested in, and if so, |
2810 | then extract all the attributes info and generate a partial | |
2811 | symbol table entry. | |
35f5886e | 2812 | |
2d6186f4 FF |
2813 | NOTES |
2814 | ||
715cafcb FF |
2815 | Don't attempt to add anonymous structures or unions since they have |
2816 | no name. Anonymous enumerations however are processed, because we | |
2817 | want to extract their member names (the check for a tag name is | |
2818 | done later). | |
2d6186f4 | 2819 | |
715cafcb FF |
2820 | Also, for variables and subroutines, check that this is the place |
2821 | where the actual definition occurs, rather than just a reference | |
2822 | to an external. | |
35f5886e FF |
2823 | */ |
2824 | ||
2825 | static void | |
2826 | DEFUN(scan_partial_symbols, (thisdie, enddie), char *thisdie AND char *enddie) | |
2827 | { | |
2828 | char *nextdie; | |
2829 | struct dieinfo di; | |
2830 | ||
2831 | while (thisdie < enddie) | |
2832 | { | |
2833 | basicdieinfo (&di, thisdie); | |
2834 | if (di.dielength < sizeof (long)) | |
2835 | { | |
2836 | break; | |
2837 | } | |
2838 | else | |
2839 | { | |
2840 | nextdie = thisdie + di.dielength; | |
715cafcb FF |
2841 | /* To avoid getting complete die information for every die, we |
2842 | only do it (below) for the cases we are interested in. */ | |
35f5886e FF |
2843 | switch (di.dietag) |
2844 | { | |
2845 | case TAG_global_subroutine: | |
35f5886e | 2846 | case TAG_subroutine: |
2d6186f4 | 2847 | case TAG_global_variable: |
35f5886e | 2848 | case TAG_local_variable: |
2d6186f4 FF |
2849 | completedieinfo (&di); |
2850 | if (di.at_name && (di.has_at_low_pc || di.at_location)) | |
2851 | { | |
2852 | add_partial_symbol (&di); | |
2853 | } | |
2854 | break; | |
35f5886e FF |
2855 | case TAG_typedef: |
2856 | case TAG_structure_type: | |
2857 | case TAG_union_type: | |
35f5886e | 2858 | completedieinfo (&di); |
2d6186f4 | 2859 | if (di.at_name) |
35f5886e FF |
2860 | { |
2861 | add_partial_symbol (&di); | |
2862 | } | |
2863 | break; | |
715cafcb FF |
2864 | case TAG_enumeration_type: |
2865 | completedieinfo (&di); | |
2866 | add_partial_symbol (&di); | |
2867 | break; | |
35f5886e FF |
2868 | } |
2869 | } | |
2870 | thisdie = nextdie; | |
2871 | } | |
2872 | } | |
2873 | ||
2874 | /* | |
2875 | ||
2876 | LOCAL FUNCTION | |
2877 | ||
2878 | scan_compilation_units -- build a psymtab entry for each compilation | |
2879 | ||
2880 | DESCRIPTION | |
2881 | ||
2882 | This is the top level dwarf parsing routine for building partial | |
2883 | symbol tables. | |
2884 | ||
2885 | It scans from the beginning of the DWARF table looking for the first | |
2886 | TAG_compile_unit DIE, and then follows the sibling chain to locate | |
2887 | each additional TAG_compile_unit DIE. | |
2888 | ||
2889 | For each TAG_compile_unit DIE it creates a partial symtab structure, | |
2890 | calls a subordinate routine to collect all the compilation unit's | |
2891 | global DIE's, file scope DIEs, typedef DIEs, etc, and then links the | |
2892 | new partial symtab structure into the partial symbol table. It also | |
2893 | records the appropriate information in the partial symbol table entry | |
2894 | to allow the chunk of DIE's and line number table for this compilation | |
2895 | unit to be located and re-read later, to generate a complete symbol | |
2896 | table entry for the compilation unit. | |
2897 | ||
2898 | Thus it effectively partitions up a chunk of DIE's for multiple | |
2899 | compilation units into smaller DIE chunks and line number tables, | |
2900 | and associates them with a partial symbol table entry. | |
2901 | ||
2902 | NOTES | |
2903 | ||
2904 | If any compilation unit has no line number table associated with | |
2905 | it for some reason (a missing at_stmt_list attribute, rather than | |
2906 | just one with a value of zero, which is valid) then we ensure that | |
2907 | the recorded file offset is zero so that the routine which later | |
2908 | reads line number table fragments knows that there is no fragment | |
2909 | to read. | |
2910 | ||
2911 | RETURNS | |
2912 | ||
2913 | Returns no value. | |
2914 | ||
2915 | */ | |
2916 | ||
2917 | static void | |
2918 | DEFUN(scan_compilation_units, | |
a048c8f5 | 2919 | (filename, addr, thisdie, enddie, dbfoff, lnoffset, objfile), |
35f5886e FF |
2920 | char *filename AND |
2921 | CORE_ADDR addr AND | |
2922 | char *thisdie AND | |
2923 | char *enddie AND | |
2924 | unsigned int dbfoff AND | |
a048c8f5 JG |
2925 | unsigned int lnoffset AND |
2926 | struct objfile *objfile) | |
35f5886e FF |
2927 | { |
2928 | char *nextdie; | |
2929 | struct dieinfo di; | |
2930 | struct partial_symtab *pst; | |
2931 | int culength; | |
2932 | int curoff; | |
2933 | int curlnoffset; | |
2934 | ||
2935 | while (thisdie < enddie) | |
2936 | { | |
2937 | basicdieinfo (&di, thisdie); | |
2938 | if (di.dielength < sizeof (long)) | |
2939 | { | |
2940 | break; | |
2941 | } | |
2942 | else if (di.dietag != TAG_compile_unit) | |
2943 | { | |
2944 | nextdie = thisdie + di.dielength; | |
2945 | } | |
2946 | else | |
2947 | { | |
2948 | completedieinfo (&di); | |
2949 | if (di.at_sibling != 0) | |
2950 | { | |
2951 | nextdie = dbbase + di.at_sibling - dbroff; | |
2952 | } | |
2953 | else | |
2954 | { | |
2955 | nextdie = thisdie + di.dielength; | |
2956 | } | |
2957 | curoff = thisdie - dbbase; | |
2958 | culength = nextdie - thisdie; | |
2d6186f4 | 2959 | curlnoffset = di.has_at_stmt_list ? lnoffset + di.at_stmt_list : 0; |
a048c8f5 | 2960 | pst = start_psymtab (objfile, addr, di.at_name, |
35f5886e FF |
2961 | di.at_low_pc, di.at_high_pc, |
2962 | dbfoff, curoff, culength, curlnoffset, | |
2963 | global_psymbols.next, | |
2964 | static_psymbols.next); | |
2965 | scan_partial_symbols (thisdie + di.dielength, nextdie); | |
2966 | pst -> n_global_syms = global_psymbols.next - | |
2967 | (global_psymbols.list + pst -> globals_offset); | |
2968 | pst -> n_static_syms = static_psymbols.next - | |
2969 | (static_psymbols.list + pst -> statics_offset); | |
2970 | /* Sort the global list; don't sort the static list */ | |
2971 | qsort (global_psymbols.list + pst -> globals_offset, | |
2972 | pst -> n_global_syms, sizeof (struct partial_symbol), | |
2973 | compare_psymbols); | |
2974 | /* If there is already a psymtab or symtab for a file of this name, | |
2975 | remove it. (If there is a symtab, more drastic things also | |
2976 | happen.) This happens in VxWorks. */ | |
2977 | free_named_symtabs (pst -> filename); | |
2978 | /* Place the partial symtab on the partial symtab list */ | |
2979 | pst -> next = partial_symtab_list; | |
2980 | partial_symtab_list = pst; | |
2981 | } | |
2982 | thisdie = nextdie; | |
2983 | } | |
2984 | } | |
2985 | ||
2986 | /* | |
2987 | ||
2988 | LOCAL FUNCTION | |
2989 | ||
2990 | new_symbol -- make a symbol table entry for a new symbol | |
2991 | ||
2992 | SYNOPSIS | |
2993 | ||
2994 | static struct symbol *new_symbol (struct dieinfo *dip) | |
2995 | ||
2996 | DESCRIPTION | |
2997 | ||
2998 | Given a pointer to a DWARF information entry, figure out if we need | |
2999 | to make a symbol table entry for it, and if so, create a new entry | |
3000 | and return a pointer to it. | |
3001 | */ | |
3002 | ||
3003 | static struct symbol * | |
3004 | DEFUN(new_symbol, (dip), struct dieinfo *dip) | |
3005 | { | |
3006 | struct symbol *sym = NULL; | |
3007 | ||
3008 | if (dip -> at_name != NULL) | |
3009 | { | |
3010 | sym = (struct symbol *) obstack_alloc (symbol_obstack, | |
3011 | sizeof (struct symbol)); | |
3012 | (void) memset (sym, 0, sizeof (struct symbol)); | |
3013 | SYMBOL_NAME (sym) = create_name (dip -> at_name, symbol_obstack); | |
3014 | /* default assumptions */ | |
3015 | SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE; | |
3016 | SYMBOL_CLASS (sym) = LOC_STATIC; | |
3017 | SYMBOL_TYPE (sym) = decode_die_type (dip); | |
3018 | switch (dip -> dietag) | |
3019 | { | |
3020 | case TAG_label: | |
3021 | SYMBOL_VALUE (sym) = dip -> at_low_pc + baseaddr; | |
3022 | SYMBOL_CLASS (sym) = LOC_LABEL; | |
3023 | break; | |
3024 | case TAG_global_subroutine: | |
3025 | case TAG_subroutine: | |
3026 | SYMBOL_VALUE (sym) = dip -> at_low_pc + baseaddr; | |
3027 | SYMBOL_TYPE (sym) = lookup_function_type (SYMBOL_TYPE (sym)); | |
3028 | SYMBOL_CLASS (sym) = LOC_BLOCK; | |
3029 | if (dip -> dietag == TAG_global_subroutine) | |
3030 | { | |
3031 | add_symbol_to_list (sym, &global_symbols); | |
3032 | } | |
3033 | else | |
3034 | { | |
3035 | add_symbol_to_list (sym, &scope -> symbols); | |
3036 | } | |
3037 | break; | |
3038 | case TAG_global_variable: | |
3039 | case TAG_local_variable: | |
3040 | if (dip -> at_location != NULL) | |
3041 | { | |
3042 | SYMBOL_VALUE (sym) = locval (dip -> at_location); | |
3043 | } | |
3044 | if (dip -> dietag == TAG_global_variable) | |
3045 | { | |
3046 | add_symbol_to_list (sym, &global_symbols); | |
3047 | SYMBOL_CLASS (sym) = LOC_STATIC; | |
3048 | SYMBOL_VALUE (sym) += baseaddr; | |
3049 | } | |
3050 | else | |
3051 | { | |
3052 | add_symbol_to_list (sym, &scope -> symbols); | |
3053 | if (scope -> parent != NULL) | |
3054 | { | |
3055 | if (isreg) | |
3056 | { | |
3057 | SYMBOL_CLASS (sym) = LOC_REGISTER; | |
3058 | } | |
3059 | else | |
3060 | { | |
3061 | SYMBOL_CLASS (sym) = LOC_LOCAL; | |
3062 | } | |
3063 | } | |
3064 | else | |
3065 | { | |
3066 | SYMBOL_CLASS (sym) = LOC_STATIC; | |
3067 | SYMBOL_VALUE (sym) += baseaddr; | |
3068 | } | |
3069 | } | |
3070 | break; | |
3071 | case TAG_formal_parameter: | |
3072 | if (dip -> at_location != NULL) | |
3073 | { | |
3074 | SYMBOL_VALUE (sym) = locval (dip -> at_location); | |
3075 | } | |
3076 | add_symbol_to_list (sym, &scope -> symbols); | |
3077 | if (isreg) | |
3078 | { | |
3079 | SYMBOL_CLASS (sym) = LOC_REGPARM; | |
3080 | } | |
3081 | else | |
3082 | { | |
3083 | SYMBOL_CLASS (sym) = LOC_ARG; | |
3084 | } | |
3085 | break; | |
3086 | case TAG_unspecified_parameters: | |
3087 | /* From varargs functions; gdb doesn't seem to have any interest in | |
3088 | this information, so just ignore it for now. (FIXME?) */ | |
3089 | break; | |
3090 | case TAG_structure_type: | |
3091 | case TAG_union_type: | |
3092 | case TAG_enumeration_type: | |
3093 | SYMBOL_CLASS (sym) = LOC_TYPEDEF; | |
3094 | SYMBOL_NAMESPACE (sym) = STRUCT_NAMESPACE; | |
3095 | add_symbol_to_list (sym, &scope -> symbols); | |
3096 | break; | |
3097 | case TAG_typedef: | |
3098 | SYMBOL_CLASS (sym) = LOC_TYPEDEF; | |
3099 | SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE; | |
3100 | add_symbol_to_list (sym, &scope -> symbols); | |
3101 | break; | |
3102 | default: | |
3103 | /* Not a tag we recognize. Hopefully we aren't processing trash | |
3104 | data, but since we must specifically ignore things we don't | |
3105 | recognize, there is nothing else we should do at this point. */ | |
3106 | break; | |
3107 | } | |
3108 | } | |
3109 | return (sym); | |
3110 | } | |
3111 | ||
3112 | /* | |
3113 | ||
3114 | LOCAL FUNCTION | |
3115 | ||
3116 | decode_mod_fund_type -- decode a modified fundamental type | |
3117 | ||
3118 | SYNOPSIS | |
3119 | ||
3120 | static struct type *decode_mod_fund_type (char *typedata) | |
3121 | ||
3122 | DESCRIPTION | |
3123 | ||
3124 | Decode a block of data containing a modified fundamental | |
3125 | type specification. TYPEDATA is a pointer to the block, | |
3126 | which consists of a two byte length, containing the size | |
3127 | of the rest of the block. At the end of the block is a | |
3128 | two byte value that gives the fundamental type. Everything | |
3129 | in between are type modifiers. | |
3130 | ||
3131 | We simply compute the number of modifiers and call the general | |
3132 | function decode_modified_type to do the actual work. | |
3133 | */ | |
3134 | ||
3135 | static struct type * | |
3136 | DEFUN(decode_mod_fund_type, (typedata), char *typedata) | |
3137 | { | |
3138 | struct type *typep = NULL; | |
3139 | unsigned short modcount; | |
3140 | unsigned char *modifiers; | |
3141 | ||
3142 | /* Get the total size of the block, exclusive of the size itself */ | |
3143 | (void) memcpy (&modcount, typedata, sizeof (short)); | |
3144 | /* Deduct the size of the fundamental type bytes at the end of the block. */ | |
3145 | modcount -= sizeof (short); | |
3146 | /* Skip over the two size bytes at the beginning of the block. */ | |
c8c0a2bd | 3147 | modifiers = (unsigned char *) typedata + sizeof (short); |
35f5886e FF |
3148 | /* Now do the actual decoding */ |
3149 | typep = decode_modified_type (modifiers, modcount, AT_mod_fund_type); | |
3150 | return (typep); | |
3151 | } | |
3152 | ||
3153 | /* | |
3154 | ||
3155 | LOCAL FUNCTION | |
3156 | ||
3157 | decode_mod_u_d_type -- decode a modified user defined type | |
3158 | ||
3159 | SYNOPSIS | |
3160 | ||
3161 | static struct type *decode_mod_u_d_type (char *typedata) | |
3162 | ||
3163 | DESCRIPTION | |
3164 | ||
3165 | Decode a block of data containing a modified user defined | |
3166 | type specification. TYPEDATA is a pointer to the block, | |
3167 | which consists of a two byte length, containing the size | |
3168 | of the rest of the block. At the end of the block is a | |
3169 | four byte value that gives a reference to a user defined type. | |
3170 | Everything in between are type modifiers. | |
3171 | ||
3172 | We simply compute the number of modifiers and call the general | |
3173 | function decode_modified_type to do the actual work. | |
3174 | */ | |
3175 | ||
3176 | static struct type * | |
3177 | DEFUN(decode_mod_u_d_type, (typedata), char *typedata) | |
3178 | { | |
3179 | struct type *typep = NULL; | |
3180 | unsigned short modcount; | |
3181 | unsigned char *modifiers; | |
3182 | ||
3183 | /* Get the total size of the block, exclusive of the size itself */ | |
3184 | (void) memcpy (&modcount, typedata, sizeof (short)); | |
3185 | /* Deduct the size of the reference type bytes at the end of the block. */ | |
3186 | modcount -= sizeof (long); | |
3187 | /* Skip over the two size bytes at the beginning of the block. */ | |
c8c0a2bd | 3188 | modifiers = (unsigned char *) typedata + sizeof (short); |
35f5886e FF |
3189 | /* Now do the actual decoding */ |
3190 | typep = decode_modified_type (modifiers, modcount, AT_mod_u_d_type); | |
3191 | return (typep); | |
3192 | } | |
3193 | ||
3194 | /* | |
3195 | ||
3196 | LOCAL FUNCTION | |
3197 | ||
3198 | decode_modified_type -- decode modified user or fundamental type | |
3199 | ||
3200 | SYNOPSIS | |
3201 | ||
3202 | static struct type *decode_modified_type (unsigned char *modifiers, | |
3203 | unsigned short modcount, int mtype) | |
3204 | ||
3205 | DESCRIPTION | |
3206 | ||
3207 | Decode a modified type, either a modified fundamental type or | |
3208 | a modified user defined type. MODIFIERS is a pointer to the | |
3209 | block of bytes that define MODCOUNT modifiers. Immediately | |
3210 | following the last modifier is a short containing the fundamental | |
3211 | type or a long containing the reference to the user defined | |
3212 | type. Which one is determined by MTYPE, which is either | |
3213 | AT_mod_fund_type or AT_mod_u_d_type to indicate what modified | |
3214 | type we are generating. | |
3215 | ||
3216 | We call ourself recursively to generate each modified type,` | |
3217 | until MODCOUNT reaches zero, at which point we have consumed | |
3218 | all the modifiers and generate either the fundamental type or | |
3219 | user defined type. When the recursion unwinds, each modifier | |
3220 | is applied in turn to generate the full modified type. | |
3221 | ||
3222 | NOTES | |
3223 | ||
3224 | If we find a modifier that we don't recognize, and it is not one | |
3225 | of those reserved for application specific use, then we issue a | |
3226 | warning and simply ignore the modifier. | |
3227 | ||
3228 | BUGS | |
3229 | ||
3230 | We currently ignore MOD_const and MOD_volatile. (FIXME) | |
3231 | ||
3232 | */ | |
3233 | ||
3234 | static struct type * | |
3235 | DEFUN(decode_modified_type, | |
3236 | (modifiers, modcount, mtype), | |
3237 | unsigned char *modifiers AND unsigned short modcount AND int mtype) | |
3238 | { | |
3239 | struct type *typep = NULL; | |
3240 | unsigned short fundtype; | |
3241 | DIEREF dieref; | |
3242 | unsigned char modifier; | |
3243 | ||
3244 | if (modcount == 0) | |
3245 | { | |
3246 | switch (mtype) | |
3247 | { | |
3248 | case AT_mod_fund_type: | |
3249 | (void) memcpy (&fundtype, modifiers, sizeof (short)); | |
3250 | typep = decode_fund_type (fundtype); | |
3251 | break; | |
3252 | case AT_mod_u_d_type: | |
3253 | (void) memcpy (&dieref, modifiers, sizeof (DIEREF)); | |
3254 | if ((typep = lookup_utype (dieref)) == NULL) | |
3255 | { | |
3256 | typep = alloc_utype (dieref, NULL); | |
3257 | } | |
3258 | break; | |
3259 | default: | |
3260 | SQUAWK (("botched modified type decoding (mtype 0x%x)", mtype)); | |
3261 | typep = builtin_type_int; | |
3262 | break; | |
3263 | } | |
3264 | } | |
3265 | else | |
3266 | { | |
3267 | modifier = *modifiers++; | |
3268 | typep = decode_modified_type (modifiers, --modcount, mtype); | |
3269 | switch (modifier) | |
3270 | { | |
3271 | case MOD_pointer_to: | |
3272 | typep = lookup_pointer_type (typep); | |
3273 | break; | |
3274 | case MOD_reference_to: | |
3275 | typep = lookup_reference_type (typep); | |
3276 | break; | |
3277 | case MOD_const: | |
3278 | SQUAWK (("type modifier 'const' ignored")); /* FIXME */ | |
3279 | break; | |
3280 | case MOD_volatile: | |
3281 | SQUAWK (("type modifier 'volatile' ignored")); /* FIXME */ | |
3282 | break; | |
3283 | default: | |
3284 | if (!(MOD_lo_user <= modifier && modifier <= MOD_hi_user)) | |
3285 | { | |
3286 | SQUAWK (("unknown type modifier %u", modifier)); | |
3287 | } | |
3288 | break; | |
3289 | } | |
3290 | } | |
3291 | return (typep); | |
3292 | } | |
3293 | ||
3294 | /* | |
3295 | ||
3296 | LOCAL FUNCTION | |
3297 | ||
3298 | decode_fund_type -- translate basic DWARF type to gdb base type | |
3299 | ||
3300 | DESCRIPTION | |
3301 | ||
3302 | Given an integer that is one of the fundamental DWARF types, | |
3303 | translate it to one of the basic internal gdb types and return | |
3304 | a pointer to the appropriate gdb type (a "struct type *"). | |
3305 | ||
3306 | NOTES | |
3307 | ||
3308 | If we encounter a fundamental type that we are unprepared to | |
3309 | deal with, and it is not in the range of those types defined | |
3310 | as application specific types, then we issue a warning and | |
3311 | treat the type as builtin_type_int. | |
3312 | */ | |
3313 | ||
3314 | static struct type * | |
3315 | DEFUN(decode_fund_type, (fundtype), unsigned short fundtype) | |
3316 | { | |
3317 | struct type *typep = NULL; | |
3318 | ||
3319 | switch (fundtype) | |
3320 | { | |
3321 | ||
3322 | case FT_void: | |
3323 | typep = builtin_type_void; | |
3324 | break; | |
3325 | ||
3326 | case FT_pointer: /* (void *) */ | |
3327 | typep = lookup_pointer_type (builtin_type_void); | |
3328 | break; | |
3329 | ||
3330 | case FT_char: | |
3331 | case FT_signed_char: | |
3332 | typep = builtin_type_char; | |
3333 | break; | |
3334 | ||
3335 | case FT_short: | |
3336 | case FT_signed_short: | |
3337 | typep = builtin_type_short; | |
3338 | break; | |
3339 | ||
3340 | case FT_integer: | |
3341 | case FT_signed_integer: | |
3342 | case FT_boolean: /* Was FT_set in AT&T version */ | |
3343 | typep = builtin_type_int; | |
3344 | break; | |
3345 | ||
3346 | case FT_long: | |
3347 | case FT_signed_long: | |
3348 | typep = builtin_type_long; | |
3349 | break; | |
3350 | ||
3351 | case FT_float: | |
3352 | typep = builtin_type_float; | |
3353 | break; | |
3354 | ||
3355 | case FT_dbl_prec_float: | |
3356 | typep = builtin_type_double; | |
3357 | break; | |
3358 | ||
3359 | case FT_unsigned_char: | |
3360 | typep = builtin_type_unsigned_char; | |
3361 | break; | |
3362 | ||
3363 | case FT_unsigned_short: | |
3364 | typep = builtin_type_unsigned_short; | |
3365 | break; | |
3366 | ||
3367 | case FT_unsigned_integer: | |
3368 | typep = builtin_type_unsigned_int; | |
3369 | break; | |
3370 | ||
3371 | case FT_unsigned_long: | |
3372 | typep = builtin_type_unsigned_long; | |
3373 | break; | |
3374 | ||
3375 | case FT_ext_prec_float: | |
3376 | typep = builtin_type_long_double; | |
3377 | break; | |
3378 | ||
3379 | case FT_complex: | |
3380 | typep = builtin_type_complex; | |
3381 | break; | |
3382 | ||
3383 | case FT_dbl_prec_complex: | |
3384 | typep = builtin_type_double_complex; | |
3385 | break; | |
3386 | ||
3387 | case FT_long_long: | |
3388 | case FT_signed_long_long: | |
3389 | typep = builtin_type_long_long; | |
3390 | break; | |
3391 | ||
3392 | case FT_unsigned_long_long: | |
3393 | typep = builtin_type_unsigned_long_long; | |
3394 | break; | |
3395 | ||
3396 | } | |
3397 | ||
3398 | if ((typep == NULL) && !(FT_lo_user <= fundtype && fundtype <= FT_hi_user)) | |
3399 | { | |
3400 | SQUAWK (("unexpected fundamental type 0x%x", fundtype)); | |
3401 | typep = builtin_type_void; | |
3402 | } | |
3403 | ||
3404 | return (typep); | |
3405 | } | |
3406 | ||
3407 | /* | |
3408 | ||
3409 | LOCAL FUNCTION | |
3410 | ||
3411 | create_name -- allocate a fresh copy of a string on an obstack | |
3412 | ||
3413 | DESCRIPTION | |
3414 | ||
3415 | Given a pointer to a string and a pointer to an obstack, allocates | |
3416 | a fresh copy of the string on the specified obstack. | |
3417 | ||
3418 | */ | |
3419 | ||
3420 | static char * | |
3421 | DEFUN(create_name, (name, obstackp), char *name AND struct obstack *obstackp) | |
3422 | { | |
3423 | int length; | |
3424 | char *newname; | |
3425 | ||
3426 | length = strlen (name) + 1; | |
3427 | newname = (char *) obstack_alloc (obstackp, length); | |
3428 | (void) strcpy (newname, name); | |
3429 | return (newname); | |
3430 | } | |
3431 | ||
3432 | /* | |
3433 | ||
3434 | LOCAL FUNCTION | |
3435 | ||
3436 | basicdieinfo -- extract the minimal die info from raw die data | |
3437 | ||
3438 | SYNOPSIS | |
3439 | ||
3440 | void basicdieinfo (char *diep, struct dieinfo *dip) | |
3441 | ||
3442 | DESCRIPTION | |
3443 | ||
3444 | Given a pointer to raw DIE data, and a pointer to an instance of a | |
3445 | die info structure, this function extracts the basic information | |
3446 | from the DIE data required to continue processing this DIE, along | |
3447 | with some bookkeeping information about the DIE. | |
3448 | ||
3449 | The information we absolutely must have includes the DIE tag, | |
3450 | and the DIE length. If we need the sibling reference, then we | |
3451 | will have to call completedieinfo() to process all the remaining | |
3452 | DIE information. | |
3453 | ||
3454 | Note that since there is no guarantee that the data is properly | |
3455 | aligned in memory for the type of access required (indirection | |
3456 | through anything other than a char pointer), we use memcpy to | |
3457 | shuffle data items larger than a char. Possibly inefficient, but | |
3458 | quite portable. | |
3459 | ||
3460 | We also take care of some other basic things at this point, such | |
3461 | as ensuring that the instance of the die info structure starts | |
3462 | out completely zero'd and that curdie is initialized for use | |
3463 | in error reporting if we have a problem with the current die. | |
3464 | ||
3465 | NOTES | |
3466 | ||
3467 | All DIE's must have at least a valid length, thus the minimum | |
3468 | DIE size is sizeof (long). In order to have a valid tag, the | |
3469 | DIE size must be at least sizeof (short) larger, otherwise they | |
3470 | are forced to be TAG_padding DIES. | |
3471 | ||
3472 | Padding DIES must be at least sizeof(long) in length, implying that | |
3473 | if a padding DIE is used for alignment and the amount needed is less | |
3474 | than sizeof(long) then the padding DIE has to be big enough to align | |
3475 | to the next alignment boundry. | |
3476 | */ | |
3477 | ||
3478 | static void | |
3479 | DEFUN(basicdieinfo, (dip, diep), struct dieinfo *dip AND char *diep) | |
3480 | { | |
3481 | curdie = dip; | |
3482 | (void) memset (dip, 0, sizeof (struct dieinfo)); | |
3483 | dip -> die = diep; | |
3484 | dip -> dieref = dbroff + (diep - dbbase); | |
3485 | (void) memcpy (&dip -> dielength, diep, sizeof (long)); | |
3486 | if (dip -> dielength < sizeof (long)) | |
3487 | { | |
3488 | dwarfwarn ("malformed DIE, bad length (%d bytes)", dip -> dielength); | |
3489 | } | |
3490 | else if (dip -> dielength < (sizeof (long) + sizeof (short))) | |
3491 | { | |
3492 | dip -> dietag = TAG_padding; | |
3493 | } | |
3494 | else | |
3495 | { | |
3496 | (void) memcpy (&dip -> dietag, diep + sizeof (long), sizeof (short)); | |
3497 | } | |
3498 | } | |
3499 | ||
3500 | /* | |
3501 | ||
3502 | LOCAL FUNCTION | |
3503 | ||
3504 | completedieinfo -- finish reading the information for a given DIE | |
3505 | ||
3506 | SYNOPSIS | |
3507 | ||
3508 | void completedieinfo (struct dieinfo *dip) | |
3509 | ||
3510 | DESCRIPTION | |
3511 | ||
3512 | Given a pointer to an already partially initialized die info structure, | |
3513 | scan the raw DIE data and finish filling in the die info structure | |
3514 | from the various attributes found. | |
3515 | ||
3516 | Note that since there is no guarantee that the data is properly | |
3517 | aligned in memory for the type of access required (indirection | |
3518 | through anything other than a char pointer), we use memcpy to | |
3519 | shuffle data items larger than a char. Possibly inefficient, but | |
3520 | quite portable. | |
3521 | ||
3522 | NOTES | |
3523 | ||
3524 | Each time we are called, we increment the diecount variable, which | |
3525 | keeps an approximate count of the number of dies processed for | |
3526 | each compilation unit. This information is presented to the user | |
3527 | if the info_verbose flag is set. | |
3528 | ||
3529 | */ | |
3530 | ||
3531 | static void | |
3532 | DEFUN(completedieinfo, (dip), struct dieinfo *dip) | |
3533 | { | |
3534 | char *diep; /* Current pointer into raw DIE data */ | |
3535 | char *end; /* Terminate DIE scan here */ | |
3536 | unsigned short attr; /* Current attribute being scanned */ | |
3537 | unsigned short form; /* Form of the attribute */ | |
3538 | short block2sz; /* Size of a block2 attribute field */ | |
3539 | long block4sz; /* Size of a block4 attribute field */ | |
3540 | ||
3541 | diecount++; | |
3542 | diep = dip -> die; | |
3543 | end = diep + dip -> dielength; | |
3544 | diep += sizeof (long) + sizeof (short); | |
3545 | while (diep < end) | |
3546 | { | |
3547 | (void) memcpy (&attr, diep, sizeof (short)); | |
3548 | diep += sizeof (short); | |
3549 | switch (attr) | |
3550 | { | |
3551 | case AT_fund_type: | |
3552 | (void) memcpy (&dip -> at_fund_type, diep, sizeof (short)); | |
3553 | break; | |
3554 | case AT_ordering: | |
3555 | (void) memcpy (&dip -> at_ordering, diep, sizeof (short)); | |
3556 | break; | |
3557 | case AT_bit_offset: | |
3558 | (void) memcpy (&dip -> at_bit_offset, diep, sizeof (short)); | |
3559 | break; | |
3560 | case AT_visibility: | |
3561 | (void) memcpy (&dip -> at_visibility, diep, sizeof (short)); | |
3562 | break; | |
3563 | case AT_sibling: | |
3564 | (void) memcpy (&dip -> at_sibling, diep, sizeof (long)); | |
3565 | break; | |
3566 | case AT_stmt_list: | |
3567 | (void) memcpy (&dip -> at_stmt_list, diep, sizeof (long)); | |
2d6186f4 | 3568 | dip -> has_at_stmt_list = 1; |
35f5886e FF |
3569 | break; |
3570 | case AT_low_pc: | |
3571 | (void) memcpy (&dip -> at_low_pc, diep, sizeof (long)); | |
2d6186f4 | 3572 | dip -> has_at_low_pc = 1; |
35f5886e FF |
3573 | break; |
3574 | case AT_high_pc: | |
3575 | (void) memcpy (&dip -> at_high_pc, diep, sizeof (long)); | |
3576 | break; | |
3577 | case AT_language: | |
3578 | (void) memcpy (&dip -> at_language, diep, sizeof (long)); | |
3579 | break; | |
3580 | case AT_user_def_type: | |
3581 | (void) memcpy (&dip -> at_user_def_type, diep, sizeof (long)); | |
3582 | break; | |
3583 | case AT_byte_size: | |
3584 | (void) memcpy (&dip -> at_byte_size, diep, sizeof (long)); | |
3585 | break; | |
3586 | case AT_bit_size: | |
3587 | (void) memcpy (&dip -> at_bit_size, diep, sizeof (long)); | |
3588 | break; | |
3589 | case AT_member: | |
3590 | (void) memcpy (&dip -> at_member, diep, sizeof (long)); | |
3591 | break; | |
3592 | case AT_discr: | |
3593 | (void) memcpy (&dip -> at_discr, diep, sizeof (long)); | |
3594 | break; | |
3595 | case AT_import: | |
3596 | (void) memcpy (&dip -> at_import, diep, sizeof (long)); | |
3597 | break; | |
3598 | case AT_location: | |
3599 | dip -> at_location = diep; | |
3600 | break; | |
3601 | case AT_mod_fund_type: | |
3602 | dip -> at_mod_fund_type = diep; | |
3603 | break; | |
3604 | case AT_subscr_data: | |
3605 | dip -> at_subscr_data = diep; | |
3606 | break; | |
3607 | case AT_mod_u_d_type: | |
3608 | dip -> at_mod_u_d_type = diep; | |
3609 | break; | |
35f5886e FF |
3610 | case AT_element_list: |
3611 | dip -> at_element_list = diep; | |
768be6e1 FF |
3612 | dip -> short_element_list = 0; |
3613 | break; | |
3614 | case AT_short_element_list: | |
3615 | dip -> at_element_list = diep; | |
3616 | dip -> short_element_list = 1; | |
35f5886e FF |
3617 | break; |
3618 | case AT_discr_value: | |
3619 | dip -> at_discr_value = diep; | |
3620 | break; | |
3621 | case AT_string_length: | |
3622 | dip -> at_string_length = diep; | |
3623 | break; | |
3624 | case AT_name: | |
3625 | dip -> at_name = diep; | |
3626 | break; | |
3627 | case AT_comp_dir: | |
3628 | dip -> at_comp_dir = diep; | |
3629 | break; | |
3630 | case AT_producer: | |
3631 | dip -> at_producer = diep; | |
3632 | break; | |
35f5886e FF |
3633 | case AT_frame_base: |
3634 | (void) memcpy (&dip -> at_frame_base, diep, sizeof (long)); | |
3635 | break; | |
35f5886e FF |
3636 | case AT_start_scope: |
3637 | (void) memcpy (&dip -> at_start_scope, diep, sizeof (long)); | |
3638 | break; | |
3639 | case AT_stride_size: | |
3640 | (void) memcpy (&dip -> at_stride_size, diep, sizeof (long)); | |
3641 | break; | |
3642 | case AT_src_info: | |
3643 | (void) memcpy (&dip -> at_src_info, diep, sizeof (long)); | |
3644 | break; | |
3645 | case AT_prototyped: | |
3646 | (void) memcpy (&dip -> at_prototyped, diep, sizeof (short)); | |
3647 | break; | |
35f5886e FF |
3648 | default: |
3649 | /* Found an attribute that we are unprepared to handle. However | |
3650 | it is specifically one of the design goals of DWARF that | |
3651 | consumers should ignore unknown attributes. As long as the | |
3652 | form is one that we recognize (so we know how to skip it), | |
3653 | we can just ignore the unknown attribute. */ | |
3654 | break; | |
3655 | } | |
3656 | form = attr & 0xF; | |
3657 | switch (form) | |
3658 | { | |
3659 | case FORM_DATA2: | |
3660 | diep += sizeof (short); | |
3661 | break; | |
3662 | case FORM_DATA4: | |
3663 | diep += sizeof (long); | |
3664 | break; | |
3665 | case FORM_DATA8: | |
3666 | diep += 8 * sizeof (char); /* sizeof (long long) ? */ | |
3667 | break; | |
3668 | case FORM_ADDR: | |
3669 | case FORM_REF: | |
3670 | diep += sizeof (long); | |
3671 | break; | |
3672 | case FORM_BLOCK2: | |
3673 | (void) memcpy (&block2sz, diep, sizeof (short)); | |
3674 | block2sz += sizeof (short); | |
3675 | diep += block2sz; | |
3676 | break; | |
3677 | case FORM_BLOCK4: | |
3678 | (void) memcpy (&block4sz, diep, sizeof (long)); | |
3679 | block4sz += sizeof (long); | |
3680 | diep += block4sz; | |
3681 | break; | |
3682 | case FORM_STRING: | |
3683 | diep += strlen (diep) + 1; | |
3684 | break; | |
3685 | default: | |
3686 | SQUAWK (("unknown attribute form (0x%x), skipped rest", form)); | |
3687 | diep = end; | |
3688 | break; | |
3689 | } | |
3690 | } | |
3691 | } |