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.
6 This file is part of GDB.
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.
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.
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. */
24 FIXME: Figure out how to get the frame pointer register number in the
25 execution environment of the target. Remove R_FP kludge
27 FIXME: Add generation of dependencies list to partial symtab code.
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.
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
39 FIXME: Change forward declarations of static functions to allow for compilers
42 FIXME: Figure out a better way to tell gdb (all the debug reading routines)
43 the names of the gccX_compiled flags.
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())
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).
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.
62 FIXME: See other FIXME's and "ifdef 0" scattered throughout the code for
63 other things to work on, if you get bored. :-)
78 #include "elf/dwarf.h"
81 #ifdef MAINTENANCE /* Define to 1 to compile in some maintenance stuff */
82 #define SQUAWK(stuff) dwarfwarn stuff
87 #ifndef R_FP /* FIXME */
88 #define R_FP 14 /* Kludge to get frame pointer register number */
91 typedef unsigned int DIEREF
; /* Reference to a DIE */
93 #define GCC_COMPILED_FLAG_SYMBOL "gcc_compiled%" /* FIXME */
94 #define GCC2_COMPILED_FLAG_SYMBOL "gcc2_compiled%" /* FIXME */
96 #define STREQ(a,b) (strcmp(a,b)==0)
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. */
105 #define AT_short_element_list (0x00f0|FORM_BLOCK2)
107 /* External variables referenced. */
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 */
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.
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.
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.
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.
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,
140 such as AT_low_pc, without restricting the values of the field,
141 we need someway to note that we found such an attribute.
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 */
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
;
161 BLOCK
* at_subscr_data
;
165 BLOCK
* at_element_list
;
172 BLOCK
* at_discr_value
;
175 BLOCK
* at_string_length
;
183 unsigned int has_at_low_pc
:1;
184 unsigned int has_at_stmt_list
:1;
185 unsigned int short_element_list
:1;
188 static int diecount
; /* Approximate count of dies for compilation unit */
189 static struct dieinfo
*curdie
; /* For warnings and such */
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 */
196 static CORE_ADDR baseaddr
; /* Add to each symbol value */
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.
204 dbfoff Always the absolute file offset to the start of the ".debug"
205 section for the file containing the DIE's being accessed.
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.
215 dblength The size of the chunk of DIE's being examined, in bytes.
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.
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 */
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)
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. */
240 struct pending_symbol
{
241 struct pending_symbol
*next
; /* Next pending symbol */
242 struct symbol
*symbol
; /* The actual symbol */
245 static struct pending_symbol
*global_symbols
; /* global funcs and vars */
246 static struct block
*global_symbol_block
;
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
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 */
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.
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. */
267 struct scopenode
*parent
;
268 struct scopenode
*child
;
269 struct scopenode
*sibling
;
270 struct pending_symbol
*symbols
;
272 struct symbol
*namesym
;
277 static struct scopenode
*scopetree
;
278 static struct scopenode
*scope
;
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.
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.
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.
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. */
303 static struct type
**utypes
; /* Pointer to array of user type pointers */
304 static int numutypes
; /* Max number of user type pointers */
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
313 EXFUN (dwarfwarn
, (char *fmt DOTS
));
316 EXFUN (scan_partial_symbols
, (char *thisdie AND
char *enddie
));
319 EXFUN (scan_compilation_units
,
320 (char *filename AND CORE_ADDR addr AND
char *thisdie AND
char *enddie
321 AND
unsigned int dbfoff AND
unsigned int lnoffset
322 AND
struct objfile
*objfile
));
324 static struct partial_symtab
*
325 EXFUN(start_psymtab
, (struct objfile
*objfile AND CORE_ADDR addr
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
));
332 EXFUN(add_partial_symbol
, (struct dieinfo
*dip
));
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
));
341 EXFUN(init_psymbol_list
, (int total_symbols
));
344 EXFUN(basicdieinfo
, (struct dieinfo
*dip AND
char *diep
));
347 EXFUN(completedieinfo
, (struct dieinfo
*dip
));
350 EXFUN(dwarf_psymtab_to_symtab
, (struct partial_symtab
*pst
));
353 EXFUN(psymtab_to_symtab_1
, (struct partial_symtab
*pst
));
355 static struct symtab
*
356 EXFUN(read_ofile_symtab
, (struct partial_symtab
*pst
));
360 (char *thisdie AND
char *enddie AND
struct objfile
*objfile
));
363 EXFUN(read_structure_scope
,
364 (struct dieinfo
*dip AND
char *thisdie AND
char *enddie AND
365 struct objfile
*objfile
));
368 EXFUN(decode_array_element_type
, (char *scan AND
char *end
));
371 EXFUN(decode_subscr_data
, (char *scan AND
char *end
));
374 EXFUN(read_array_type
, (struct dieinfo
*dip
));
377 EXFUN(read_subroutine_type
,
378 (struct dieinfo
*dip AND
char *thisdie AND
char *enddie
));
381 EXFUN(read_enumeration
,
382 (struct dieinfo
*dip AND
char *thisdie AND
char *enddie
));
386 (struct dieinfo
*dip AND
char *thisdie AND
char *enddie AND
387 struct objfile
*objfile
));
390 EXFUN(enum_type
, (struct dieinfo
*dip
));
393 EXFUN(start_symtab
, (void));
397 (char *filename AND
long language AND
struct objfile
*objfile
));
400 EXFUN(scopecount
, (struct scopenode
*node
));
404 (struct symbol
*namesym AND CORE_ADDR lowpc AND CORE_ADDR highpc
));
407 EXFUN(freescope
, (struct scopenode
*node
));
409 static struct block
*
410 EXFUN(buildblock
, (struct pending_symbol
*syms
));
413 EXFUN(closescope
, (void));
416 EXFUN(record_line
, (int line AND CORE_ADDR pc
));
419 EXFUN(decode_line_numbers
, (char *linetable
));
422 EXFUN(decode_die_type
, (struct dieinfo
*dip
));
425 EXFUN(decode_mod_fund_type
, (char *typedata
));
428 EXFUN(decode_mod_u_d_type
, (char *typedata
));
431 EXFUN(decode_modified_type
,
432 (unsigned char *modifiers AND
unsigned short modcount AND
int mtype
));
435 EXFUN(decode_fund_type
, (unsigned short fundtype
));
438 EXFUN(create_name
, (char *name AND
struct obstack
*obstackp
));
441 EXFUN(add_symbol_to_list
,
442 (struct symbol
*symbol AND
struct pending_symbol
**listhead
));
444 static struct block
**
445 EXFUN(gatherblocks
, (struct block
**dest AND
struct scopenode
*node
));
447 static struct blockvector
*
448 EXFUN(make_blockvector
, (void));
451 EXFUN(lookup_utype
, (DIEREF dieref
));
454 EXFUN(alloc_utype
, (DIEREF dieref AND
struct type
*usetype
));
456 static struct symbol
*
457 EXFUN(new_symbol
, (struct dieinfo
*dip
));
460 EXFUN(locval
, (char *loc
));
463 EXFUN(record_misc_function
, (char *name AND CORE_ADDR address AND
464 enum misc_function_type
));
467 EXFUN(compare_psymbols
,
468 (struct partial_symbol
*s1 AND
struct partial_symbol
*s2
));
475 dwarf_build_psymtabs -- build partial symtabs from DWARF debug info
479 void dwarf_build_psymtabs (int desc, char *filename, CORE_ADDR addr,
480 int mainline, unsigned int dbfoff, unsigned int dbsize,
481 unsigned int lnoffset, unsigned int lnsize,
482 struct objfile *objfile)
486 This function is called upon to build partial symtabs from files
487 containing DIE's (Dwarf Information Entries) and DWARF line numbers.
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
504 DEFUN(dwarf_build_psymtabs
,
505 (desc
, filename
, addr
, mainline
, dbfoff
, dbsize
, lnoffset
, lnsize
,
511 unsigned int dbfoff AND
512 unsigned int dbsize AND
513 unsigned int lnoffset AND
514 unsigned int lnsize AND
515 struct objfile
*objfile
)
517 struct cleanup
*back_to
;
519 dbbase
= xmalloc (dbsize
);
521 if ((lseek (desc
, dbfoff
, 0) != dbfoff
) ||
522 (read (desc
, dbbase
, dbsize
) != dbsize
))
525 error ("can't read DWARF data from '%s'", filename
);
527 back_to
= make_cleanup (free
, dbbase
);
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. */
533 if (mainline
|| global_psymbols
.size
== 0 || static_psymbols
.size
== 0)
535 init_psymbol_list (1024);
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. */
542 scan_compilation_units (filename
, addr
, dbbase
, dbbase
+ dbsize
,
543 dbfoff
, lnoffset
, objfile
);
545 do_cleanups (back_to
);
553 record_misc_function -- add entry to miscellaneous function vector
557 static void record_misc_function (char *name, CORE_ADDR address,
558 enum misc_function_type mf_type)
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.
570 DEFUN(record_misc_function
, (name
, address
, mf_type
),
571 char *name AND CORE_ADDR address AND
enum misc_function_type mf_type
)
573 prim_record_misc_function (obsavestring (name
, strlen (name
)), address
,
581 dwarfwarn -- issue a DWARF related warning
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.
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
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
601 We assume that curdie is valid and contains at least the basic
602 information for the DIE where the problem was noticed.
607 DEFUN(dwarfwarn
, (fmt
), char *fmt DOTS
)
613 fprintf (stderr
, "DWARF warning (ref 0x%x): ", curdie
-> dieref
);
614 if (curdie
-> at_name
)
616 fprintf (stderr
, "'%s': ", curdie
-> at_name
);
618 vfprintf (stderr
, fmt
, ap
);
619 fprintf (stderr
, "\n");
633 fmt
= va_arg (ap
, char *);
635 fprintf (stderr
, "DWARF warning (ref 0x%x): ", curdie
-> dieref
);
636 if (curdie
-> at_name
)
638 fprintf (stderr
, "'%s': ", curdie
-> at_name
);
640 vfprintf (stderr
, fmt
, ap
);
641 fprintf (stderr
, "\n");
650 compare_psymbols -- compare two partial symbols by name
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().
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).
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.
672 DEFUN(compare_psymbols
, (s1
, s2
),
673 struct partial_symbol
*s1 AND
674 struct partial_symbol
*s2
)
676 register char *st1
= SYMBOL_NAME (s1
);
677 register char *st2
= SYMBOL_NAME (s2
);
679 if ((st1
[0] - st2
[0]) || !st1
[0])
681 return (st1
[0] - st2
[0]);
683 else if ((st1
[1] - st2
[1]) || !st1
[1])
685 return (st1
[1] - st2
[1]);
689 return (strcmp (st1
+ 2, st2
+ 2));
697 read_lexical_block_scope -- process all dies in a lexical block
701 static void read_lexical_block_scope (struct dieinfo *dip,
702 char *thisdie, char *enddie)
706 Process all the DIES contained within a lexical block scope.
707 Start a new scope, process the dies, and then close the scope.
712 DEFUN(read_lexical_block_scope
, (dip
, thisdie
, enddie
, objfile
),
713 struct dieinfo
*dip AND
716 struct objfile
*objfile
)
718 openscope (NULL
, dip
-> at_low_pc
, dip
-> at_high_pc
);
719 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
727 lookup_utype -- look up a user defined type from die reference
731 static type *lookup_utype (DIEREF dieref)
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.
743 DEFUN(lookup_utype
, (dieref
), DIEREF dieref
)
745 struct type
*type
= NULL
;
748 utypeidx
= (dieref
- dbroff
) / 4;
749 if ((utypeidx
< 0) || (utypeidx
>= numutypes
))
751 dwarfwarn ("reference to DIE (0x%x) outside compilation unit", dieref
);
755 type
= *(utypes
+ utypeidx
);
765 alloc_utype -- add a user defined type for die reference
769 static type *alloc_utype (DIEREF dieref, struct type *utypep)
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.
778 We should only be called after calling lookup_utype() to verify that
779 there is not currently a type registered for DIEREF.
783 DEFUN(alloc_utype
, (dieref
, utypep
),
790 utypeidx
= (dieref
- dbroff
) / 4;
791 typep
= utypes
+ utypeidx
;
792 if ((utypeidx
< 0) || (utypeidx
>= numutypes
))
794 utypep
= builtin_type_int
;
795 dwarfwarn ("reference to DIE (0x%x) outside compilation unit", dieref
);
797 else if (*typep
!= NULL
)
800 SQUAWK (("internal error: dup user type allocation"));
806 utypep
= (struct type
*)
807 obstack_alloc (symbol_obstack
, sizeof (struct type
));
808 (void) memset (utypep
, 0, sizeof (struct type
));
819 decode_die_type -- return a type for a specified die
823 static struct type *decode_die_type (struct dieinfo *dip)
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.
833 DEFUN(decode_die_type
, (dip
), struct dieinfo
*dip
)
835 struct type
*type
= NULL
;
837 if (dip
-> at_fund_type
!= 0)
839 type
= decode_fund_type (dip
-> at_fund_type
);
841 else if (dip
-> at_mod_fund_type
!= NULL
)
843 type
= decode_mod_fund_type (dip
-> at_mod_fund_type
);
845 else if (dip
-> at_user_def_type
)
847 if ((type
= lookup_utype (dip
-> at_user_def_type
)) == NULL
)
849 type
= alloc_utype (dip
-> at_user_def_type
, NULL
);
852 else if (dip
-> at_mod_u_d_type
)
854 type
= decode_mod_u_d_type (dip
-> at_mod_u_d_type
);
858 type
= builtin_type_int
;
867 struct_type -- compute and return the type for a struct or union
871 static struct type *struct_type (struct dieinfo *dip, char *thisdie,
872 char *enddie, struct objfile *objfile)
876 Given pointer to a die information structure for a die which
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
884 DEFUN(struct_type
, (dip
, thisdie
, enddie
, objfile
),
885 struct dieinfo
*dip AND
888 struct objfile
*objfile
)
892 struct nextfield
*next
;
895 struct nextfield
*list
= NULL
;
896 struct nextfield
*new;
903 if ((type
= lookup_utype (dip
-> dieref
)) == NULL
)
905 /* No forward references created an empty type, so install one now */
906 type
= alloc_utype (dip
-> dieref
, NULL
);
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
)
914 case TAG_structure_type
:
915 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
919 TYPE_CODE (type
) = TYPE_CODE_UNION
;
923 /* Should never happen */
924 TYPE_CODE (type
) = TYPE_CODE_UNDEF
;
926 SQUAWK (("missing structure or union tag"));
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... */
932 if (dip
-> at_name
!= NULL
933 && *dip
-> at_name
!= '~'
934 && *dip
-> at_name
!= '.')
936 TYPE_NAME (type
) = obconcat (tpart1
, " ", dip
-> at_name
);
938 if (dip
-> at_byte_size
!= 0)
940 TYPE_LENGTH (type
) = dip
-> at_byte_size
;
942 thisdie
+= dip
-> dielength
;
943 while (thisdie
< enddie
)
945 basicdieinfo (&mbr
, thisdie
);
946 completedieinfo (&mbr
);
947 if (mbr
.dielength
<= sizeof (long))
951 else if (mbr
.at_sibling
!= 0)
953 nextdie
= dbbase
+ mbr
.at_sibling
- dbroff
;
957 nextdie
= thisdie
+ mbr
.dielength
;
962 /* Get space to record the next field's data. */
963 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
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;
974 process_dies (thisdie
, nextdie
, objfile
);
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. */
986 TYPE_FLAGS (type
) |= TYPE_FLAG_STUB
;
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
)
996 TYPE_FIELD (type
, --n
) = list
-> field
;
1006 read_structure_scope -- process all dies within struct or union
1010 static void read_structure_scope (struct dieinfo *dip,
1011 char *thisdie, char *enddie, struct objfile *objfile)
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.
1022 Note that we need to call struct_type regardless of whether or not
1023 we have a symbol, since we might have a structure or union without
1024 a tag name (thus no symbol for the tagname).
1028 DEFUN(read_structure_scope
, (dip
, thisdie
, enddie
, objfile
),
1029 struct dieinfo
*dip AND
1032 struct objfile
*objfile
)
1037 type
= struct_type (dip
, thisdie
, enddie
, objfile
);
1038 if ((sym
= new_symbol (dip
)) != NULL
)
1040 SYMBOL_TYPE (sym
) = type
;
1048 decode_array_element_type -- decode type of the array elements
1052 static struct type *decode_array_element_type (char *scan, char *end)
1056 As the last step in decoding the array subscript information for an
1057 array DIE, we need to decode the type of the array elements. We are
1058 passed a pointer to this last part of the subscript information and
1059 must return the appropriate type. If the type attribute is not
1060 recognized, just warn about the problem and return type int.
1063 static struct type
*
1064 DEFUN(decode_array_element_type
, (scan
, end
), char *scan AND
char *end
)
1069 unsigned short fundtype
;
1071 (void) memcpy (&attribute
, scan
, sizeof (short));
1072 scan
+= sizeof (short);
1076 (void) memcpy (&fundtype
, scan
, sizeof (short));
1077 typep
= decode_fund_type (fundtype
);
1079 case AT_mod_fund_type
:
1080 typep
= decode_mod_fund_type (scan
);
1082 case AT_user_def_type
:
1083 (void) memcpy (&dieref
, scan
, sizeof (DIEREF
));
1084 if ((typep
= lookup_utype (dieref
)) == NULL
)
1086 typep
= alloc_utype (dieref
, NULL
);
1089 case AT_mod_u_d_type
:
1090 typep
= decode_mod_u_d_type (scan
);
1093 SQUAWK (("bad array element type attribute 0x%x", attribute
));
1094 typep
= builtin_type_int
;
1104 decode_subscr_data -- decode array subscript and element type data
1108 static struct type *decode_subscr_data (char *scan, char *end)
1112 The array subscripts and the data type of the elements of an
1113 array are described by a list of data items, stored as a block
1114 of contiguous bytes. There is a data item describing each array
1115 dimension, and a final data item describing the element type.
1116 The data items are ordered the same as their appearance in the
1117 source (I.E. leftmost dimension first, next to leftmost second,
1120 We are passed a pointer to the start of the block of bytes
1121 containing the data items, and a pointer to the first byte past
1122 the data. This function decodes the data and returns a type.
1125 FIXME: This code only implements the forms currently used
1126 by the AT&T and GNU C compilers.
1128 The end pointer is supplied for error checking, maybe we should
1132 static struct type
*
1133 DEFUN(decode_subscr_data
, (scan
, end
), char *scan AND
char *end
)
1135 struct type
*typep
= NULL
;
1136 struct type
*nexttype
;
1146 typep
= decode_array_element_type (scan
, end
);
1149 (void) memcpy (&fundtype
, scan
, sizeof (short));
1150 scan
+= sizeof (short);
1151 if (fundtype
!= FT_integer
&& fundtype
!= FT_signed_integer
1152 && fundtype
!= FT_unsigned_integer
)
1154 SQUAWK (("array subscripts must be integral types, not type 0x%x",
1159 (void) memcpy (&lowbound
, scan
, sizeof (long));
1160 scan
+= sizeof (long);
1161 (void) memcpy (&highbound
, scan
, sizeof (long));
1162 scan
+= sizeof (long);
1163 nexttype
= decode_subscr_data (scan
, end
);
1164 if (nexttype
!= NULL
)
1166 typep
= (struct type
*)
1167 obstack_alloc (symbol_obstack
, sizeof (struct type
));
1168 (void) memset (typep
, 0, sizeof (struct type
));
1169 TYPE_CODE (typep
) = TYPE_CODE_ARRAY
;
1170 TYPE_LENGTH (typep
) = TYPE_LENGTH (nexttype
);
1171 TYPE_LENGTH (typep
) *= lowbound
+ highbound
+ 1;
1172 TYPE_TARGET_TYPE (typep
) = nexttype
;
1183 SQUAWK (("array subscript format 0x%x not handled yet", format
));
1186 SQUAWK (("unknown array subscript format %x", format
));
1196 read_array_type -- read TAG_array_type DIE
1200 static void read_array_type (struct dieinfo *dip)
1204 Extract all information from a TAG_array_type DIE and add to
1205 the user defined type vector.
1209 DEFUN(read_array_type
, (dip
), struct dieinfo
*dip
)
1216 if (dip
-> at_ordering
!= ORD_row_major
)
1218 /* FIXME: Can gdb even handle column major arrays? */
1219 SQUAWK (("array not row major; not handled correctly"));
1221 if ((sub
= dip
-> at_subscr_data
) != NULL
)
1223 (void) memcpy (&temp
, sub
, sizeof (short));
1224 subend
= sub
+ sizeof (short) + temp
;
1225 sub
+= sizeof (short);
1226 type
= decode_subscr_data (sub
, subend
);
1229 type
= alloc_utype (dip
-> dieref
, NULL
);
1230 TYPE_CODE (type
) = TYPE_CODE_ARRAY
;
1231 TYPE_TARGET_TYPE (type
) = builtin_type_int
;
1232 TYPE_LENGTH (type
) = 1 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
));
1236 type
= alloc_utype (dip
-> dieref
, type
);
1245 read_subroutine_type -- process TAG_subroutine_type dies
1249 static void read_subroutine_type (struct dieinfo *dip, char thisdie,
1254 Handle DIES due to C code like:
1257 int (*funcp)(int a, long l); (Generates TAG_subroutine_type DIE)
1263 The parameter DIES are currently ignored. See if gdb has a way to
1264 include this info in it's type system, and decode them if so. Is
1265 this what the type structure's "arg_types" field is for? (FIXME)
1269 DEFUN(read_subroutine_type
, (dip
, thisdie
, enddie
),
1270 struct dieinfo
*dip AND
1276 type
= decode_die_type (dip
);
1277 type
= lookup_function_type (type
);
1278 type
= alloc_utype (dip
-> dieref
, type
);
1285 read_enumeration -- process dies which define an enumeration
1289 static void read_enumeration (struct dieinfo *dip, char *thisdie,
1294 Given a pointer to a die which begins an enumeration, process all
1295 the dies that define the members of the enumeration.
1299 Note that we need to call enum_type regardless of whether or not we
1300 have a symbol, since we might have an enum without a tag name (thus
1301 no symbol for the tagname).
1305 DEFUN(read_enumeration
, (dip
, thisdie
, enddie
),
1306 struct dieinfo
*dip AND
1313 type
= enum_type (dip
);
1314 if ((sym
= new_symbol (dip
)) != NULL
)
1316 SYMBOL_TYPE (sym
) = type
;
1324 enum_type -- decode and return a type for an enumeration
1328 static type *enum_type (struct dieinfo *dip)
1332 Given a pointer to a die information structure for the die which
1333 starts an enumeration, process all the dies that define the members
1334 of the enumeration and return a type pointer for the enumeration.
1336 At the same time, for each member of the enumeration, create a
1337 symbol for it with namespace VAR_NAMESPACE and class LOC_CONST,
1338 and give it the type of the enumeration itself.
1342 Note that the DWARF specification explicitly mandates that enum
1343 constants occur in reverse order from the source program order,
1344 for "consistency" and because this ordering is easier for many
1345 compilers to generate. (Draft 5, sec 3.9.5, Enumeration type
1346 Entries). Because gdb wants to see the enum members in program
1347 source order, we have to ensure that the order gets reversed while
1348 we are processing them.
1351 static struct type
*
1352 DEFUN(enum_type
, (dip
), struct dieinfo
*dip
)
1356 struct nextfield
*next
;
1359 struct nextfield
*list
= NULL
;
1360 struct nextfield
*new;
1369 if ((type
= lookup_utype (dip
-> dieref
)) == NULL
)
1371 type
= alloc_utype (dip
-> dieref
, NULL
);
1373 TYPE_CODE (type
) = TYPE_CODE_ENUM
;
1374 /* Some compilers try to be helpful by inventing "fake" names for anonymous
1375 enums, structures, and unions, like "~0fake" or ".0fake". Thanks, but
1377 if (dip
-> at_name
!= NULL
1378 && *dip
-> at_name
!= '~'
1379 && *dip
-> at_name
!= '.')
1381 TYPE_NAME (type
) = obconcat ("enum", " ", dip
-> at_name
);
1383 if (dip
-> at_byte_size
!= 0)
1385 TYPE_LENGTH (type
) = dip
-> at_byte_size
;
1387 if ((scan
= dip
-> at_element_list
) != NULL
)
1389 if (dip
-> short_element_list
)
1391 (void) memcpy (&stemp
, scan
, sizeof (stemp
));
1392 listend
= scan
+ stemp
+ sizeof (stemp
);
1393 scan
+= sizeof (stemp
);
1397 (void) memcpy (<emp
, scan
, sizeof (ltemp
));
1398 listend
= scan
+ ltemp
+ sizeof (ltemp
);
1399 scan
+= sizeof (ltemp
);
1401 while (scan
< listend
)
1403 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
1406 list
-> field
.type
= NULL
;
1407 list
-> field
.bitsize
= 0;
1408 (void) memcpy (&list
-> field
.bitpos
, scan
, sizeof (long));
1409 scan
+= sizeof (long);
1410 list
-> field
.name
= savestring (scan
, strlen (scan
));
1411 scan
+= strlen (scan
) + 1;
1413 /* Handcraft a new symbol for this enum member. */
1414 sym
= (struct symbol
*) obstack_alloc (symbol_obstack
,
1415 sizeof (struct symbol
));
1416 (void) memset (sym
, 0, sizeof (struct symbol
));
1417 SYMBOL_NAME (sym
) = create_name (list
-> field
.name
, symbol_obstack
);
1418 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1419 SYMBOL_CLASS (sym
) = LOC_CONST
;
1420 SYMBOL_TYPE (sym
) = type
;
1421 SYMBOL_VALUE (sym
) = list
-> field
.bitpos
;
1422 add_symbol_to_list (sym
, &scope
-> symbols
);
1425 /* Now create the vector of fields, and record how big it is. This is where
1426 we reverse the order, by pulling the members of the list in reverse order
1427 from how they were inserted. */
1428 TYPE_NFIELDS (type
) = nfields
;
1429 TYPE_FIELDS (type
) = (struct field
*)
1430 obstack_alloc (symbol_obstack
, sizeof (struct field
) * nfields
);
1431 /* Copy the saved-up fields into the field vector. */
1432 for (n
= 0; (n
< nfields
) && (list
!= NULL
); list
= list
-> next
)
1434 TYPE_FIELD (type
, n
++) = list
-> field
;
1443 read_func_scope -- process all dies within a function scope
1447 Process all dies within a given function scope. We are passed
1448 a die information structure pointer DIP for the die which
1449 starts the function scope, and pointers into the raw die data
1450 that define the dies within the function scope.
1452 For now, we ignore lexical block scopes within the function.
1453 The problem is that AT&T cc does not define a DWARF lexical
1454 block scope for the function itself, while gcc defines a
1455 lexical block scope for the function. We need to think about
1456 how to handle this difference, or if it is even a problem.
1461 DEFUN(read_func_scope
, (dip
, thisdie
, enddie
, objfile
),
1462 struct dieinfo
*dip AND
1465 struct objfile
*objfile
)
1469 if (entry_point
>= dip
-> at_low_pc
&& entry_point
< dip
-> at_high_pc
)
1471 entry_scope_lowpc
= dip
-> at_low_pc
;
1472 entry_scope_highpc
= dip
-> at_high_pc
;
1474 if (strcmp (dip
-> at_name
, "main") == 0) /* FIXME: hardwired name */
1476 main_scope_lowpc
= dip
-> at_low_pc
;
1477 main_scope_highpc
= dip
-> at_high_pc
;
1479 sym
= new_symbol (dip
);
1480 openscope (sym
, dip
-> at_low_pc
, dip
-> at_high_pc
);
1481 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
1489 read_file_scope -- process all dies within a file scope
1493 Process all dies within a given file scope. We are passed a
1494 pointer to the die information structure for the die which
1495 starts the file scope, and pointers into the raw die data which
1496 mark the range of dies within the file scope.
1498 When the partial symbol table is built, the file offset for the line
1499 number table for each compilation unit is saved in the partial symbol
1500 table entry for that compilation unit. As the symbols for each
1501 compilation unit are read, the line number table is read into memory
1502 and the variable lnbase is set to point to it. Thus all we have to
1503 do is use lnbase to access the line number table for the current
1508 DEFUN(read_file_scope
, (dip
, thisdie
, enddie
, objfile
),
1509 struct dieinfo
*dip AND
1512 struct objfile
*objfile
)
1514 struct cleanup
*back_to
;
1516 if (entry_point
>= dip
-> at_low_pc
&& entry_point
< dip
-> at_high_pc
)
1518 startup_file_start
= dip
-> at_low_pc
;
1519 startup_file_end
= dip
-> at_high_pc
;
1521 numutypes
= (enddie
- thisdie
) / 4;
1522 utypes
= (struct type
**) xmalloc (numutypes
* sizeof (struct type
*));
1523 back_to
= make_cleanup (free
, utypes
);
1524 (void) memset (utypes
, 0, numutypes
* sizeof (struct type
*));
1526 openscope (NULL
, dip
-> at_low_pc
, dip
-> at_high_pc
);
1527 decode_line_numbers (lnbase
);
1528 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
1530 end_symtab (dip
-> at_name
, dip
-> at_language
, objfile
);
1531 do_cleanups (back_to
);
1540 start_symtab -- do initialization for starting new symbol table
1544 static void start_symtab (void)
1548 Called whenever we are starting to process dies for a new
1549 compilation unit, to perform initializations. Right now
1550 the only thing we really have to do is initialize storage
1551 space for the line number vector.
1556 DEFUN_VOID (start_symtab
)
1560 line_vector_index
= 0;
1561 line_vector_length
= 1000;
1562 nbytes
= sizeof (struct linetable
);
1563 nbytes
+= line_vector_length
* sizeof (struct linetable_entry
);
1564 line_vector
= (struct linetable
*) xmalloc (nbytes
);
1571 process_dies -- process a range of DWARF Information Entries
1575 static void process_dies (char *thisdie, char *enddie,
1576 struct objfile *objfile)
1580 Process all DIE's in a specified range. May be (and almost
1581 certainly will be) called recursively.
1585 DEFUN(process_dies
, (thisdie
, enddie
, objfile
),
1586 char *thisdie AND
char *enddie AND
struct objfile
*objfile
)
1591 while (thisdie
< enddie
)
1593 basicdieinfo (&di
, thisdie
);
1594 if (di
.dielength
< sizeof (long))
1598 else if (di
.dietag
== TAG_padding
)
1600 nextdie
= thisdie
+ di
.dielength
;
1604 completedieinfo (&di
);
1605 if (di
.at_sibling
!= 0)
1607 nextdie
= dbbase
+ di
.at_sibling
- dbroff
;
1611 nextdie
= thisdie
+ di
.dielength
;
1615 case TAG_compile_unit
:
1616 read_file_scope (&di
, thisdie
, nextdie
, objfile
);
1618 case TAG_global_subroutine
:
1619 case TAG_subroutine
:
1620 if (di
.has_at_low_pc
)
1622 read_func_scope (&di
, thisdie
, nextdie
, objfile
);
1625 case TAG_lexical_block
:
1626 read_lexical_block_scope (&di
, thisdie
, nextdie
, objfile
);
1628 case TAG_structure_type
:
1629 case TAG_union_type
:
1630 read_structure_scope (&di
, thisdie
, nextdie
, objfile
);
1632 case TAG_enumeration_type
:
1633 read_enumeration (&di
, thisdie
, nextdie
);
1635 case TAG_subroutine_type
:
1636 read_subroutine_type (&di
, thisdie
, nextdie
);
1638 case TAG_array_type
:
1639 read_array_type (&di
);
1642 (void) new_symbol (&di
);
1654 end_symtab -- finish processing for a compilation unit
1658 static void end_symtab (char *filename, long language)
1662 Complete the symbol table entry for the current compilation
1663 unit. Make the struct symtab and put it on the list of all
1669 DEFUN(end_symtab
, (filename
, language
, objfile
),
1670 char *filename AND
long language AND
struct objfile
*objfile
)
1672 struct symtab
*symtab
;
1673 struct blockvector
*blockvector
;
1676 /* Ignore a file that has no functions with real debugging info. */
1677 if (global_symbols
== NULL
&& scopetree
-> block
== NULL
)
1681 line_vector_length
= -1;
1682 freescope (scopetree
);
1683 scope
= scopetree
= NULL
;
1686 /* Create the blockvector that points to all the file's blocks. */
1688 blockvector
= make_blockvector ();
1690 /* Now create the symtab object for this source file. */
1692 symtab
= allocate_symtab (savestring (filename
, strlen (filename
)),
1695 symtab
-> free_ptr
= 0;
1697 /* Fill in its components. */
1698 symtab
-> blockvector
= blockvector
;
1699 symtab
-> free_code
= free_linetable
;
1701 /* Save the line number information. */
1703 line_vector
-> nitems
= line_vector_index
;
1704 nbytes
= sizeof (struct linetable
);
1705 if (line_vector_index
> 1)
1707 nbytes
+= (line_vector_index
- 1) * sizeof (struct linetable_entry
);
1709 symtab
-> linetable
= (struct linetable
*) xrealloc (line_vector
, nbytes
);
1711 /* FIXME: The following may need to be expanded for other languages */
1716 symtab
-> language
= language_c
;
1718 case LANG_C_PLUS_PLUS
:
1719 symtab
-> language
= language_cplus
;
1725 /* Link the new symtab into the list of such. */
1726 symtab
-> next
= symtab_list
;
1727 symtab_list
= symtab
;
1729 /* Recursively free the scope tree */
1730 freescope (scopetree
);
1731 scope
= scopetree
= NULL
;
1733 /* Reinitialize for beginning of new file. */
1735 line_vector_length
= -1;
1742 scopecount -- count the number of enclosed scopes
1746 static int scopecount (struct scopenode *node)
1750 Given pointer to a node, compute the size of the subtree which is
1751 rooted in this node, which also happens to be the number of scopes
1756 DEFUN(scopecount
, (node
), struct scopenode
*node
)
1762 count
+= scopecount (node
-> child
);
1763 count
+= scopecount (node
-> sibling
);
1773 openscope -- start a new lexical block scope
1777 static void openscope (struct symbol *namesym, CORE_ADDR lowpc,
1782 Start a new scope by allocating a new scopenode, adding it as the
1783 next child of the current scope (if any) or as the root of the
1784 scope tree, and then making the new node the current scope node.
1788 DEFUN(openscope
, (namesym
, lowpc
, highpc
),
1789 struct symbol
*namesym AND
1793 struct scopenode
*new;
1794 struct scopenode
*child
;
1796 new = (struct scopenode
*) xmalloc (sizeof (*new));
1797 (void) memset (new, 0, sizeof (*new));
1798 new -> namesym
= namesym
;
1799 new -> lowpc
= lowpc
;
1800 new -> highpc
= highpc
;
1805 else if ((child
= scope
-> child
) == NULL
)
1807 scope
-> child
= new;
1808 new -> parent
= scope
;
1812 while (child
-> sibling
!= NULL
)
1814 child
= child
-> sibling
;
1816 child
-> sibling
= new;
1817 new -> parent
= scope
;
1826 freescope -- free a scope tree rooted at the given node
1830 static void freescope (struct scopenode *node)
1834 Given a pointer to a node in the scope tree, free the subtree
1835 rooted at that node. First free all the children and sibling
1836 nodes, and then the node itself. Used primarily for cleaning
1837 up after ourselves and returning memory to the system.
1841 DEFUN(freescope
, (node
), struct scopenode
*node
)
1845 freescope (node
-> child
);
1846 freescope (node
-> sibling
);
1855 buildblock -- build a new block from pending symbols list
1859 static struct block *buildblock (struct pending_symbol *syms)
1863 Given a pointer to a list of symbols, build a new block and free
1864 the symbol list structure. Also check each symbol to see if it
1865 is the special symbol that flags that this block was compiled by
1866 gcc, and if so, mark the block appropriately.
1869 static struct block
*
1870 DEFUN(buildblock
, (syms
), struct pending_symbol
*syms
)
1872 struct pending_symbol
*next
, *next1
;
1874 struct block
*newblock
;
1877 for (next
= syms
, i
= 0 ; next
; next
= next
-> next
, i
++) {;}
1879 /* Allocate a new block */
1881 nbytes
= sizeof (struct block
);
1884 nbytes
+= (i
- 1) * sizeof (struct symbol
*);
1886 newblock
= (struct block
*) obstack_alloc (symbol_obstack
, nbytes
);
1887 (void) memset (newblock
, 0, nbytes
);
1889 /* Copy the symbols into the block. */
1891 BLOCK_NSYMS (newblock
) = i
;
1892 for (next
= syms
; next
; next
= next
-> next
)
1894 BLOCK_SYM (newblock
, --i
) = next
-> symbol
;
1895 if (STREQ (GCC_COMPILED_FLAG_SYMBOL
, SYMBOL_NAME (next
-> symbol
)) ||
1896 STREQ (GCC2_COMPILED_FLAG_SYMBOL
, SYMBOL_NAME (next
-> symbol
)))
1898 BLOCK_GCC_COMPILED (newblock
) = 1;
1902 /* Now free the links of the list, and empty the list. */
1904 for (next
= syms
; next
; next
= next1
)
1906 next1
= next
-> next
;
1917 closescope -- close a lexical block scope
1921 static void closescope (void)
1925 Close the current lexical block scope. Closing the current scope
1926 is as simple as moving the current scope pointer up to the parent
1927 of the current scope pointer. But we also take this opportunity
1928 to build the block for the current scope first, since we now have
1929 all of it's symbols.
1933 DEFUN_VOID(closescope
)
1935 struct scopenode
*child
;
1939 error ("DWARF parse error, too many close scopes");
1943 if (scope
-> parent
== NULL
)
1945 global_symbol_block
= buildblock (global_symbols
);
1946 global_symbols
= NULL
;
1947 BLOCK_START (global_symbol_block
) = scope
-> lowpc
+ baseaddr
;
1948 BLOCK_END (global_symbol_block
) = scope
-> highpc
+ baseaddr
;
1950 scope
-> block
= buildblock (scope
-> symbols
);
1951 scope
-> symbols
= NULL
;
1952 BLOCK_START (scope
-> block
) = scope
-> lowpc
+ baseaddr
;
1953 BLOCK_END (scope
-> block
) = scope
-> highpc
+ baseaddr
;
1955 /* Put the local block in as the value of the symbol that names it. */
1957 if (scope
-> namesym
)
1959 SYMBOL_BLOCK_VALUE (scope
-> namesym
) = scope
-> block
;
1960 BLOCK_FUNCTION (scope
-> block
) = scope
-> namesym
;
1963 /* Install this scope's local block as the superblock of all child
1966 for (child
= scope
-> child
; child
; child
= child
-> sibling
)
1968 BLOCK_SUPERBLOCK (child
-> block
) = scope
-> block
;
1971 scope
= scope
-> parent
;
1979 record_line -- record a line number entry in the line vector
1983 static void record_line (int line, CORE_ADDR pc)
1987 Given a line number and the corresponding pc value, record
1988 this pair in the line number vector, expanding the vector as
1993 DEFUN(record_line
, (line
, pc
), int line AND CORE_ADDR pc
)
1995 struct linetable_entry
*e
;
1998 /* Make sure line vector is big enough. */
2000 if (line_vector_index
+ 2 >= line_vector_length
)
2002 line_vector_length
*= 2;
2003 nbytes
= sizeof (struct linetable
);
2004 nbytes
+= (line_vector_length
* sizeof (struct linetable_entry
));
2005 line_vector
= (struct linetable
*) xrealloc (line_vector
, nbytes
);
2007 e
= line_vector
-> item
+ line_vector_index
++;
2016 decode_line_numbers -- decode a line number table fragment
2020 static void decode_line_numbers (char *tblscan, char *tblend,
2021 long length, long base, long line, long pc)
2025 Translate the DWARF line number information to gdb form.
2027 The ".line" section contains one or more line number tables, one for
2028 each ".line" section from the objects that were linked.
2030 The AT_stmt_list attribute for each TAG_source_file entry in the
2031 ".debug" section contains the offset into the ".line" section for the
2032 start of the table for that file.
2034 The table itself has the following structure:
2036 <table length><base address><source statement entry>
2037 4 bytes 4 bytes 10 bytes
2039 The table length is the total size of the table, including the 4 bytes
2040 for the length information.
2042 The base address is the address of the first instruction generated
2043 for the source file.
2045 Each source statement entry has the following structure:
2047 <line number><statement position><address delta>
2048 4 bytes 2 bytes 4 bytes
2050 The line number is relative to the start of the file, starting with
2053 The statement position either -1 (0xFFFF) or the number of characters
2054 from the beginning of the line to the beginning of the statement.
2056 The address delta is the difference between the base address and
2057 the address of the first instruction for the statement.
2059 Note that we must copy the bytes from the packed table to our local
2060 variables before attempting to use them, to avoid alignment problems
2061 on some machines, particularly RISC processors.
2065 Does gdb expect the line numbers to be sorted? They are now by
2066 chance/luck, but are not required to be. (FIXME)
2068 The line with number 0 is unused, gdb apparently can discover the
2069 span of the last line some other way. How? (FIXME)
2073 DEFUN(decode_line_numbers
, (linetable
), char *linetable
)
2082 if (linetable
!= NULL
)
2084 tblscan
= tblend
= linetable
;
2085 (void) memcpy (&length
, tblscan
, sizeof (long));
2086 tblscan
+= sizeof (long);
2088 (void) memcpy (&base
, tblscan
, sizeof (long));
2090 tblscan
+= sizeof (long);
2091 while (tblscan
< tblend
)
2093 (void) memcpy (&line
, tblscan
, sizeof (long));
2094 tblscan
+= sizeof (long) + sizeof (short);
2095 (void) memcpy (&pc
, tblscan
, sizeof (long));
2096 tblscan
+= sizeof (long);
2100 record_line (line
, pc
);
2110 add_symbol_to_list -- add a symbol to head of current symbol list
2114 static void add_symbol_to_list (struct symbol *symbol, struct
2115 pending_symbol **listhead)
2119 Given a pointer to a symbol and a pointer to a pointer to a
2120 list of symbols, add this symbol as the current head of the
2121 list. Typically used for example to add a symbol to the
2122 symbol list for the current scope.
2127 DEFUN(add_symbol_to_list
, (symbol
, listhead
),
2128 struct symbol
*symbol AND
struct pending_symbol
**listhead
)
2130 struct pending_symbol
*link
;
2134 link
= (struct pending_symbol
*) xmalloc (sizeof (*link
));
2135 link
-> next
= *listhead
;
2136 link
-> symbol
= symbol
;
2145 gatherblocks -- walk a scope tree and build block vectors
2149 static struct block **gatherblocks (struct block **dest,
2150 struct scopenode *node)
2154 Recursively walk a scope tree rooted in the given node, adding blocks
2155 to the array pointed to by DEST, in preorder. I.E., first we add the
2156 block for the current scope, then all the blocks for child scopes,
2157 and finally all the blocks for sibling scopes.
2160 static struct block
**
2161 DEFUN(gatherblocks
, (dest
, node
),
2162 struct block
**dest AND
struct scopenode
*node
)
2166 *dest
++ = node
-> block
;
2167 dest
= gatherblocks (dest
, node
-> child
);
2168 dest
= gatherblocks (dest
, node
-> sibling
);
2177 make_blockvector -- make a block vector from current scope tree
2181 static struct blockvector *make_blockvector (void)
2185 Make a blockvector from all the blocks in the current scope tree.
2186 The first block is always the global symbol block, followed by the
2187 block for the root of the scope tree which is the local symbol block,
2188 followed by all the remaining blocks in the scope tree, which are all
2193 Note that since the root node of the scope tree is created at the time
2194 each file scope is entered, there are always at least two blocks,
2195 neither of which may have any symbols, but always contribute a block
2196 to the block vector. So the test for number of blocks greater than 1
2197 below is unnecessary given bug free code.
2199 The resulting block structure varies slightly from that produced
2200 by dbxread.c, in that block 0 and block 1 are sibling blocks while
2201 with dbxread.c, block 1 is a child of block 0. This does not
2202 seem to cause any problems, but probably should be fixed. (FIXME)
2205 static struct blockvector
*
2206 DEFUN_VOID(make_blockvector
)
2208 struct blockvector
*blockvector
= NULL
;
2212 /* Recursively walk down the tree, counting the number of blocks.
2213 Then add one to account for the global's symbol block */
2215 i
= scopecount (scopetree
) + 1;
2216 nbytes
= sizeof (struct blockvector
);
2219 nbytes
+= (i
- 1) * sizeof (struct block
*);
2221 blockvector
= (struct blockvector
*)
2222 obstack_alloc (symbol_obstack
, nbytes
);
2224 /* Copy the blocks into the blockvector. */
2226 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
2227 BLOCKVECTOR_BLOCK (blockvector
, 0) = global_symbol_block
;
2228 gatherblocks (&BLOCKVECTOR_BLOCK (blockvector
, 1), scopetree
);
2230 return (blockvector
);
2237 locval -- compute the value of a location attribute
2241 static int locval (char *loc)
2245 Given pointer to a string of bytes that define a location, compute
2246 the location and return the value.
2248 When computing values involving the current value of the frame pointer,
2249 the value zero is used, which results in a value relative to the frame
2250 pointer, rather than the absolute value. This is what GDB wants
2253 When the result is a register number, the global isreg flag is set,
2254 otherwise it is cleared. This is a kludge until we figure out a better
2255 way to handle the problem. Gdb's design does not mesh well with the
2256 DWARF notion of a location computing interpreter, which is a shame
2257 because the flexibility goes unused.
2261 Note that stack[0] is unused except as a default error return.
2262 Note that stack overflow is not yet handled.
2266 DEFUN(locval
, (loc
), char *loc
)
2268 unsigned short nbytes
;
2274 (void) memcpy (&nbytes
, loc
, sizeof (short));
2275 end
= loc
+ sizeof (short) + nbytes
;
2279 for (loc
+= sizeof (short); loc
< end
; loc
+= sizeof (long))
2287 /* push register (number) */
2288 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2292 /* push value of register (number) */
2293 /* Actually, we compute the value as if register has 0 */
2294 (void) memcpy (®no
, loc
, sizeof (long));
2297 stack
[++stacki
] = 0;
2301 stack
[++stacki
] = 0;
2302 SQUAWK (("BASEREG %d not handled!", regno
));
2306 /* push address (relocated address) */
2307 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2310 /* push constant (number) */
2311 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2314 /* pop, deref and push 2 bytes (as a long) */
2315 SQUAWK (("OP_DEREF2 address %#x not handled", stack
[stacki
]));
2317 case OP_DEREF4
: /* pop, deref and push 4 bytes (as a long) */
2318 SQUAWK (("OP_DEREF4 address %#x not handled", stack
[stacki
]));
2320 case OP_ADD
: /* pop top 2 items, add, push result */
2321 stack
[stacki
- 1] += stack
[stacki
];
2326 return (stack
[stacki
]);
2333 read_ofile_symtab -- build a full symtab entry from chunk of DIE's
2337 static struct symtab *read_ofile_symtab (struct partial_symtab *pst)
2341 OFFSET is a relocation offset which gets added to each symbol (FIXME).
2344 static struct symtab
*
2345 DEFUN(read_ofile_symtab
, (pst
),
2346 struct partial_symtab
*pst
)
2348 struct cleanup
*back_to
;
2351 bfd
*abfd
= pst
->objfile
->obfd
;
2353 /* Allocate a buffer for the entire chunk of DIE's for this compilation
2354 unit, seek to the location in the file, and read in all the DIE's. */
2357 dbbase
= xmalloc (DBLENGTH(pst
));
2358 dbroff
= DBROFF(pst
);
2359 foffset
= DBFOFF(pst
) + dbroff
;
2360 if (bfd_seek (abfd
, foffset
, 0) ||
2361 (bfd_read (dbbase
, DBLENGTH(pst
), 1, abfd
) != DBLENGTH(pst
)))
2364 error ("can't read DWARF data");
2366 back_to
= make_cleanup (free
, dbbase
);
2368 /* If there is a line number table associated with this compilation unit
2369 then read the first long word from the line number table fragment, which
2370 contains the size of the fragment in bytes (including the long word
2371 itself). Allocate a buffer for the fragment and read it in for future
2377 if (bfd_seek (abfd
, LNFOFF (pst
), 0) ||
2378 (bfd_read (&lnsize
, sizeof(long), 1, abfd
) != sizeof(long)))
2380 error ("can't read DWARF line number table size");
2382 lnbase
= xmalloc (lnsize
);
2383 if (bfd_seek (abfd
, LNFOFF (pst
), 0) ||
2384 (bfd_read (lnbase
, lnsize
, 1, abfd
) != lnsize
))
2387 error ("can't read DWARF line numbers");
2389 make_cleanup (free
, lnbase
);
2392 process_dies (dbbase
, dbbase
+ DBLENGTH(pst
), pst
->objfile
);
2393 do_cleanups (back_to
);
2394 return (symtab_list
);
2401 psymtab_to_symtab_1 -- do grunt work for building a full symtab entry
2405 static void psymtab_to_symtab_1 (struct partial_symtab *pst)
2409 Called once for each partial symbol table entry that needs to be
2410 expanded into a full symbol table entry.
2415 DEFUN(psymtab_to_symtab_1
,
2417 struct partial_symtab
*pst
)
2427 fprintf (stderr
, "Psymtab for %s already read in. Shouldn't happen.\n",
2432 /* Read in all partial symtabs on which this one is dependent */
2433 for (i
= 0; i
< pst
-> number_of_dependencies
; i
++)
2434 if (!pst
-> dependencies
[i
] -> readin
)
2436 /* Inform about additional files that need to be read in. */
2439 fputs_filtered (" ", stdout
);
2441 fputs_filtered ("and ", stdout
);
2443 printf_filtered ("%s...", pst
-> dependencies
[i
] -> filename
);
2444 wrap_here (""); /* Flush output */
2447 psymtab_to_symtab_1 (pst
-> dependencies
[i
]);
2450 if (DBLENGTH(pst
)) /* Otherwise it's a dummy */
2452 /* Init stuff necessary for reading in symbols */
2453 pst
-> symtab
= read_ofile_symtab (pst
);
2456 printf_filtered ("%d DIE's, sorting...", diecount
);
2459 sort_symtab_syms (pst
-> symtab
);
2468 dwarf_psymtab_to_symtab -- build a full symtab entry from partial one
2472 static void dwarf_psymtab_to_symtab (struct partial_symtab *pst)
2476 This is the DWARF support entry point for building a full symbol
2477 table entry from a partial symbol table entry. We are passed a
2478 pointer to the partial symbol table entry that needs to be expanded.
2483 DEFUN(dwarf_psymtab_to_symtab
, (pst
), struct partial_symtab
*pst
)
2492 fprintf (stderr
, "Psymtab for %s already read in. Shouldn't happen.\n",
2497 if (DBLENGTH(pst
) || pst
-> number_of_dependencies
)
2499 /* Print the message now, before starting serious work, to avoid
2500 disconcerting pauses. */
2503 printf_filtered ("Reading in symbols for %s...", pst
-> filename
);
2507 psymtab_to_symtab_1 (pst
);
2509 #if 0 /* FIXME: Check to see what dbxread is doing here and see if
2510 we need to do an equivalent or is this something peculiar to
2511 stabs/a.out format. */
2512 /* Match with global symbols. This only needs to be done once,
2513 after all of the symtabs and dependencies have been read in. */
2514 scan_file_globals ();
2517 /* Finish up the debug error message. */
2520 printf_filtered ("done.\n");
2529 init_psymbol_list -- initialize storage for partial symbols
2533 static void init_psymbol_list (int total_symbols)
2537 Initializes storage for all of the partial symbols that will be
2538 created by dwarf_build_psymtabs and subsidiaries.
2542 DEFUN(init_psymbol_list
, (total_symbols
), int total_symbols
)
2544 /* Free any previously allocated psymbol lists. */
2546 if (global_psymbols
.list
)
2548 free (global_psymbols
.list
);
2550 if (static_psymbols
.list
)
2552 free (static_psymbols
.list
);
2555 /* Current best guess is that there are approximately a twentieth
2556 of the total symbols (in a debugging file) are global or static
2559 global_psymbols
.size
= total_symbols
/ 10;
2560 static_psymbols
.size
= total_symbols
/ 10;
2561 global_psymbols
.next
= global_psymbols
.list
= (struct partial_symbol
*)
2562 xmalloc (global_psymbols
.size
* sizeof (struct partial_symbol
));
2563 static_psymbols
.next
= static_psymbols
.list
= (struct partial_symbol
*)
2564 xmalloc (static_psymbols
.size
* sizeof (struct partial_symbol
));
2571 start_psymtab -- allocate and partially fill a partial symtab entry
2575 Allocate and partially fill a partial symtab. It will be completely
2576 filled at the end of the symbol list.
2578 SYMFILE_NAME is the name of the symbol-file we are reading from, and
2579 ADDR is the address relative to which its symbols are (incremental)
2580 or 0 (normal). FILENAME is the name of the compilation unit that
2581 these symbols were defined in, and they appear starting a address
2582 TEXTLOW. DBROFF is the absolute file offset in SYMFILE_NAME where
2583 the full symbols can be read for compilation unit FILENAME.
2584 GLOBAL_SYMS and STATIC_SYMS are pointers to the current end of the
2589 static struct partial_symtab
*
2590 DEFUN(start_psymtab
,
2591 (objfile
, addr
, filename
, textlow
, texthigh
, dbfoff
, curoff
,
2592 culength
, lnfoff
, global_syms
, static_syms
),
2593 struct objfile
*objfile AND
2596 CORE_ADDR textlow AND
2597 CORE_ADDR texthigh AND
2602 struct partial_symbol
*global_syms AND
2603 struct partial_symbol
*static_syms
)
2605 struct partial_symtab
*result
;
2607 result
= (struct partial_symtab
*)
2608 obstack_alloc (psymbol_obstack
, sizeof (struct partial_symtab
));
2609 (void) memset (result
, 0, sizeof (struct partial_symtab
));
2610 result
-> addr
= addr
;
2611 result
-> objfile
= objfile
;
2612 result
-> filename
= create_name (filename
, psymbol_obstack
);
2613 result
-> textlow
= textlow
;
2614 result
-> texthigh
= texthigh
;
2615 result
-> read_symtab_private
= (char *) obstack_alloc (psymbol_obstack
,
2616 sizeof (struct dwfinfo
));
2617 DBFOFF (result
) = dbfoff
;
2618 DBROFF (result
) = curoff
;
2619 DBLENGTH (result
) = culength
;
2620 LNFOFF (result
) = lnfoff
;
2621 result
-> readin
= 0;
2622 result
-> symtab
= NULL
;
2623 result
-> read_symtab
= dwarf_psymtab_to_symtab
;
2624 result
-> globals_offset
= global_syms
- global_psymbols
.list
;
2625 result
-> statics_offset
= static_syms
- static_psymbols
.list
;
2627 result
->n_global_syms
= 0;
2628 result
->n_static_syms
= 0;
2637 add_psymbol_to_list -- add a partial symbol to given list
2641 Add a partial symbol to one of the partial symbol vectors (pointed to
2642 by listp). The vector is grown as necessary.
2647 DEFUN(add_psymbol_to_list
,
2648 (listp
, name
, space
, class, value
),
2649 struct psymbol_allocation_list
*listp AND
2651 enum namespace space AND
2652 enum address_class
class AND
2655 struct partial_symbol
*psym
;
2658 if (listp
-> next
>= listp
-> list
+ listp
-> size
)
2660 newsize
= listp
-> size
* 2;
2661 listp
-> list
= (struct partial_symbol
*)
2662 xrealloc (listp
-> list
, (newsize
* sizeof (struct partial_symbol
)));
2663 /* Next assumes we only went one over. Should be good if program works
2665 listp
-> next
= listp
-> list
+ listp
-> size
;
2666 listp
-> size
= newsize
;
2668 psym
= listp
-> next
++;
2669 SYMBOL_NAME (psym
) = create_name (name
, psymbol_obstack
);
2670 SYMBOL_NAMESPACE (psym
) = space
;
2671 SYMBOL_CLASS (psym
) = class;
2672 SYMBOL_VALUE (psym
) = value
;
2679 add_enum_psymbol -- add enumeration members to partial symbol table
2683 Given pointer to a DIE that is known to be for an enumeration,
2684 extract the symbolic names of the enumeration members and add
2685 partial symbols for them.
2689 DEFUN(add_enum_psymbol
, (dip
), struct dieinfo
*dip
)
2696 if ((scan
= dip
-> at_element_list
) != NULL
)
2698 if (dip
-> short_element_list
)
2700 (void) memcpy (&stemp
, scan
, sizeof (stemp
));
2701 listend
= scan
+ stemp
+ sizeof (stemp
);
2702 scan
+= sizeof (stemp
);
2706 (void) memcpy (<emp
, scan
, sizeof (ltemp
));
2707 listend
= scan
+ ltemp
+ sizeof (ltemp
);
2708 scan
+= sizeof (ltemp
);
2710 while (scan
< listend
)
2712 scan
+= sizeof (long);
2713 add_psymbol_to_list (&static_psymbols
, scan
, VAR_NAMESPACE
,
2715 scan
+= strlen (scan
) + 1;
2724 add_partial_symbol -- add symbol to partial symbol table
2728 Given a DIE, if it is one of the types that we want to
2729 add to a partial symbol table, finish filling in the die info
2730 and then add a partial symbol table entry for it.
2735 DEFUN(add_partial_symbol
, (dip
), struct dieinfo
*dip
)
2737 switch (dip
-> dietag
)
2739 case TAG_global_subroutine
:
2740 record_misc_function (dip
-> at_name
, dip
-> at_low_pc
, mf_text
);
2741 add_psymbol_to_list (&global_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2742 LOC_BLOCK
, dip
-> at_low_pc
);
2744 case TAG_global_variable
:
2745 record_misc_function (dip
-> at_name
, locval (dip
-> at_location
),
2747 add_psymbol_to_list (&global_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2750 case TAG_subroutine
:
2751 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2752 LOC_BLOCK
, dip
-> at_low_pc
);
2754 case TAG_local_variable
:
2755 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2759 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2762 case TAG_structure_type
:
2763 case TAG_union_type
:
2764 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, STRUCT_NAMESPACE
,
2767 case TAG_enumeration_type
:
2770 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
,
2771 STRUCT_NAMESPACE
, LOC_TYPEDEF
, 0);
2773 add_enum_psymbol (dip
);
2782 scan_partial_symbols -- scan DIE's within a single compilation unit
2786 Process the DIE's within a single compilation unit, looking for
2787 interesting DIE's that contribute to the partial symbol table entry
2788 for this compilation unit. Since we cannot follow any sibling
2789 chains without reading the complete DIE info for every DIE,
2790 it is probably faster to just sequentially check each one to
2791 see if it is one of the types we are interested in, and if so,
2792 then extract all the attributes info and generate a partial
2797 Don't attempt to add anonymous structures or unions since they have
2798 no name. Anonymous enumerations however are processed, because we
2799 want to extract their member names (the check for a tag name is
2802 Also, for variables and subroutines, check that this is the place
2803 where the actual definition occurs, rather than just a reference
2808 DEFUN(scan_partial_symbols
, (thisdie
, enddie
), char *thisdie AND
char *enddie
)
2813 while (thisdie
< enddie
)
2815 basicdieinfo (&di
, thisdie
);
2816 if (di
.dielength
< sizeof (long))
2822 nextdie
= thisdie
+ di
.dielength
;
2823 /* To avoid getting complete die information for every die, we
2824 only do it (below) for the cases we are interested in. */
2827 case TAG_global_subroutine
:
2828 case TAG_subroutine
:
2829 case TAG_global_variable
:
2830 case TAG_local_variable
:
2831 completedieinfo (&di
);
2832 if (di
.at_name
&& (di
.has_at_low_pc
|| di
.at_location
))
2834 add_partial_symbol (&di
);
2838 case TAG_structure_type
:
2839 case TAG_union_type
:
2840 completedieinfo (&di
);
2843 add_partial_symbol (&di
);
2846 case TAG_enumeration_type
:
2847 completedieinfo (&di
);
2848 add_partial_symbol (&di
);
2860 scan_compilation_units -- build a psymtab entry for each compilation
2864 This is the top level dwarf parsing routine for building partial
2867 It scans from the beginning of the DWARF table looking for the first
2868 TAG_compile_unit DIE, and then follows the sibling chain to locate
2869 each additional TAG_compile_unit DIE.
2871 For each TAG_compile_unit DIE it creates a partial symtab structure,
2872 calls a subordinate routine to collect all the compilation unit's
2873 global DIE's, file scope DIEs, typedef DIEs, etc, and then links the
2874 new partial symtab structure into the partial symbol table. It also
2875 records the appropriate information in the partial symbol table entry
2876 to allow the chunk of DIE's and line number table for this compilation
2877 unit to be located and re-read later, to generate a complete symbol
2878 table entry for the compilation unit.
2880 Thus it effectively partitions up a chunk of DIE's for multiple
2881 compilation units into smaller DIE chunks and line number tables,
2882 and associates them with a partial symbol table entry.
2886 If any compilation unit has no line number table associated with
2887 it for some reason (a missing at_stmt_list attribute, rather than
2888 just one with a value of zero, which is valid) then we ensure that
2889 the recorded file offset is zero so that the routine which later
2890 reads line number table fragments knows that there is no fragment
2900 DEFUN(scan_compilation_units
,
2901 (filename
, addr
, thisdie
, enddie
, dbfoff
, lnoffset
, objfile
),
2906 unsigned int dbfoff AND
2907 unsigned int lnoffset AND
2908 struct objfile
*objfile
)
2912 struct partial_symtab
*pst
;
2917 while (thisdie
< enddie
)
2919 basicdieinfo (&di
, thisdie
);
2920 if (di
.dielength
< sizeof (long))
2924 else if (di
.dietag
!= TAG_compile_unit
)
2926 nextdie
= thisdie
+ di
.dielength
;
2930 completedieinfo (&di
);
2931 if (di
.at_sibling
!= 0)
2933 nextdie
= dbbase
+ di
.at_sibling
- dbroff
;
2937 nextdie
= thisdie
+ di
.dielength
;
2939 curoff
= thisdie
- dbbase
;
2940 culength
= nextdie
- thisdie
;
2941 curlnoffset
= di
.has_at_stmt_list
? lnoffset
+ di
.at_stmt_list
: 0;
2942 pst
= start_psymtab (objfile
, addr
, di
.at_name
,
2943 di
.at_low_pc
, di
.at_high_pc
,
2944 dbfoff
, curoff
, culength
, curlnoffset
,
2945 global_psymbols
.next
,
2946 static_psymbols
.next
);
2947 scan_partial_symbols (thisdie
+ di
.dielength
, nextdie
);
2948 pst
-> n_global_syms
= global_psymbols
.next
-
2949 (global_psymbols
.list
+ pst
-> globals_offset
);
2950 pst
-> n_static_syms
= static_psymbols
.next
-
2951 (static_psymbols
.list
+ pst
-> statics_offset
);
2952 /* Sort the global list; don't sort the static list */
2953 qsort (global_psymbols
.list
+ pst
-> globals_offset
,
2954 pst
-> n_global_syms
, sizeof (struct partial_symbol
),
2956 /* If there is already a psymtab or symtab for a file of this name,
2957 remove it. (If there is a symtab, more drastic things also
2958 happen.) This happens in VxWorks. */
2959 free_named_symtabs (pst
-> filename
);
2960 /* Place the partial symtab on the partial symtab list */
2961 pst
-> next
= partial_symtab_list
;
2962 partial_symtab_list
= pst
;
2972 new_symbol -- make a symbol table entry for a new symbol
2976 static struct symbol *new_symbol (struct dieinfo *dip)
2980 Given a pointer to a DWARF information entry, figure out if we need
2981 to make a symbol table entry for it, and if so, create a new entry
2982 and return a pointer to it.
2985 static struct symbol
*
2986 DEFUN(new_symbol
, (dip
), struct dieinfo
*dip
)
2988 struct symbol
*sym
= NULL
;
2990 if (dip
-> at_name
!= NULL
)
2992 sym
= (struct symbol
*) obstack_alloc (symbol_obstack
,
2993 sizeof (struct symbol
));
2994 (void) memset (sym
, 0, sizeof (struct symbol
));
2995 SYMBOL_NAME (sym
) = create_name (dip
-> at_name
, symbol_obstack
);
2996 /* default assumptions */
2997 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
2998 SYMBOL_CLASS (sym
) = LOC_STATIC
;
2999 SYMBOL_TYPE (sym
) = decode_die_type (dip
);
3000 switch (dip
-> dietag
)
3003 SYMBOL_VALUE (sym
) = dip
-> at_low_pc
+ baseaddr
;
3004 SYMBOL_CLASS (sym
) = LOC_LABEL
;
3006 case TAG_global_subroutine
:
3007 case TAG_subroutine
:
3008 SYMBOL_VALUE (sym
) = dip
-> at_low_pc
+ baseaddr
;
3009 SYMBOL_TYPE (sym
) = lookup_function_type (SYMBOL_TYPE (sym
));
3010 SYMBOL_CLASS (sym
) = LOC_BLOCK
;
3011 if (dip
-> dietag
== TAG_global_subroutine
)
3013 add_symbol_to_list (sym
, &global_symbols
);
3017 add_symbol_to_list (sym
, &scope
-> symbols
);
3020 case TAG_global_variable
:
3021 case TAG_local_variable
:
3022 if (dip
-> at_location
!= NULL
)
3024 SYMBOL_VALUE (sym
) = locval (dip
-> at_location
);
3026 if (dip
-> dietag
== TAG_global_variable
)
3028 add_symbol_to_list (sym
, &global_symbols
);
3029 SYMBOL_CLASS (sym
) = LOC_STATIC
;
3030 SYMBOL_VALUE (sym
) += baseaddr
;
3034 add_symbol_to_list (sym
, &scope
-> symbols
);
3035 if (scope
-> parent
!= NULL
)
3039 SYMBOL_CLASS (sym
) = LOC_REGISTER
;
3043 SYMBOL_CLASS (sym
) = LOC_LOCAL
;
3048 SYMBOL_CLASS (sym
) = LOC_STATIC
;
3049 SYMBOL_VALUE (sym
) += baseaddr
;
3053 case TAG_formal_parameter
:
3054 if (dip
-> at_location
!= NULL
)
3056 SYMBOL_VALUE (sym
) = locval (dip
-> at_location
);
3058 add_symbol_to_list (sym
, &scope
-> symbols
);
3061 SYMBOL_CLASS (sym
) = LOC_REGPARM
;
3065 SYMBOL_CLASS (sym
) = LOC_ARG
;
3068 case TAG_unspecified_parameters
:
3069 /* From varargs functions; gdb doesn't seem to have any interest in
3070 this information, so just ignore it for now. (FIXME?) */
3072 case TAG_structure_type
:
3073 case TAG_union_type
:
3074 case TAG_enumeration_type
:
3075 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
3076 SYMBOL_NAMESPACE (sym
) = STRUCT_NAMESPACE
;
3077 add_symbol_to_list (sym
, &scope
-> symbols
);
3080 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
3081 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
3082 add_symbol_to_list (sym
, &scope
-> symbols
);
3085 /* Not a tag we recognize. Hopefully we aren't processing trash
3086 data, but since we must specifically ignore things we don't
3087 recognize, there is nothing else we should do at this point. */
3098 decode_mod_fund_type -- decode a modified fundamental type
3102 static struct type *decode_mod_fund_type (char *typedata)
3106 Decode a block of data containing a modified fundamental
3107 type specification. TYPEDATA is a pointer to the block,
3108 which consists of a two byte length, containing the size
3109 of the rest of the block. At the end of the block is a
3110 two byte value that gives the fundamental type. Everything
3111 in between are type modifiers.
3113 We simply compute the number of modifiers and call the general
3114 function decode_modified_type to do the actual work.
3117 static struct type
*
3118 DEFUN(decode_mod_fund_type
, (typedata
), char *typedata
)
3120 struct type
*typep
= NULL
;
3121 unsigned short modcount
;
3122 unsigned char *modifiers
;
3124 /* Get the total size of the block, exclusive of the size itself */
3125 (void) memcpy (&modcount
, typedata
, sizeof (short));
3126 /* Deduct the size of the fundamental type bytes at the end of the block. */
3127 modcount
-= sizeof (short);
3128 /* Skip over the two size bytes at the beginning of the block. */
3129 modifiers
= (unsigned char *) typedata
+ sizeof (short);
3130 /* Now do the actual decoding */
3131 typep
= decode_modified_type (modifiers
, modcount
, AT_mod_fund_type
);
3139 decode_mod_u_d_type -- decode a modified user defined type
3143 static struct type *decode_mod_u_d_type (char *typedata)
3147 Decode a block of data containing a modified user defined
3148 type specification. TYPEDATA is a pointer to the block,
3149 which consists of a two byte length, containing the size
3150 of the rest of the block. At the end of the block is a
3151 four byte value that gives a reference to a user defined type.
3152 Everything in between are type modifiers.
3154 We simply compute the number of modifiers and call the general
3155 function decode_modified_type to do the actual work.
3158 static struct type
*
3159 DEFUN(decode_mod_u_d_type
, (typedata
), char *typedata
)
3161 struct type
*typep
= NULL
;
3162 unsigned short modcount
;
3163 unsigned char *modifiers
;
3165 /* Get the total size of the block, exclusive of the size itself */
3166 (void) memcpy (&modcount
, typedata
, sizeof (short));
3167 /* Deduct the size of the reference type bytes at the end of the block. */
3168 modcount
-= sizeof (long);
3169 /* Skip over the two size bytes at the beginning of the block. */
3170 modifiers
= (unsigned char *) typedata
+ sizeof (short);
3171 /* Now do the actual decoding */
3172 typep
= decode_modified_type (modifiers
, modcount
, AT_mod_u_d_type
);
3180 decode_modified_type -- decode modified user or fundamental type
3184 static struct type *decode_modified_type (unsigned char *modifiers,
3185 unsigned short modcount, int mtype)
3189 Decode a modified type, either a modified fundamental type or
3190 a modified user defined type. MODIFIERS is a pointer to the
3191 block of bytes that define MODCOUNT modifiers. Immediately
3192 following the last modifier is a short containing the fundamental
3193 type or a long containing the reference to the user defined
3194 type. Which one is determined by MTYPE, which is either
3195 AT_mod_fund_type or AT_mod_u_d_type to indicate what modified
3196 type we are generating.
3198 We call ourself recursively to generate each modified type,`
3199 until MODCOUNT reaches zero, at which point we have consumed
3200 all the modifiers and generate either the fundamental type or
3201 user defined type. When the recursion unwinds, each modifier
3202 is applied in turn to generate the full modified type.
3206 If we find a modifier that we don't recognize, and it is not one
3207 of those reserved for application specific use, then we issue a
3208 warning and simply ignore the modifier.
3212 We currently ignore MOD_const and MOD_volatile. (FIXME)
3216 static struct type
*
3217 DEFUN(decode_modified_type
,
3218 (modifiers
, modcount
, mtype
),
3219 unsigned char *modifiers AND
unsigned short modcount AND
int mtype
)
3221 struct type
*typep
= NULL
;
3222 unsigned short fundtype
;
3224 unsigned char modifier
;
3230 case AT_mod_fund_type
:
3231 (void) memcpy (&fundtype
, modifiers
, sizeof (short));
3232 typep
= decode_fund_type (fundtype
);
3234 case AT_mod_u_d_type
:
3235 (void) memcpy (&dieref
, modifiers
, sizeof (DIEREF
));
3236 if ((typep
= lookup_utype (dieref
)) == NULL
)
3238 typep
= alloc_utype (dieref
, NULL
);
3242 SQUAWK (("botched modified type decoding (mtype 0x%x)", mtype
));
3243 typep
= builtin_type_int
;
3249 modifier
= *modifiers
++;
3250 typep
= decode_modified_type (modifiers
, --modcount
, mtype
);
3253 case MOD_pointer_to
:
3254 typep
= lookup_pointer_type (typep
);
3256 case MOD_reference_to
:
3257 typep
= lookup_reference_type (typep
);
3260 SQUAWK (("type modifier 'const' ignored")); /* FIXME */
3263 SQUAWK (("type modifier 'volatile' ignored")); /* FIXME */
3266 if (!(MOD_lo_user
<= modifier
&& modifier
<= MOD_hi_user
))
3268 SQUAWK (("unknown type modifier %u", modifier
));
3280 decode_fund_type -- translate basic DWARF type to gdb base type
3284 Given an integer that is one of the fundamental DWARF types,
3285 translate it to one of the basic internal gdb types and return
3286 a pointer to the appropriate gdb type (a "struct type *").
3290 If we encounter a fundamental type that we are unprepared to
3291 deal with, and it is not in the range of those types defined
3292 as application specific types, then we issue a warning and
3293 treat the type as builtin_type_int.
3296 static struct type
*
3297 DEFUN(decode_fund_type
, (fundtype
), unsigned short fundtype
)
3299 struct type
*typep
= NULL
;
3305 typep
= builtin_type_void
;
3308 case FT_pointer
: /* (void *) */
3309 typep
= lookup_pointer_type (builtin_type_void
);
3313 case FT_signed_char
:
3314 typep
= builtin_type_char
;
3318 case FT_signed_short
:
3319 typep
= builtin_type_short
;
3323 case FT_signed_integer
:
3324 case FT_boolean
: /* Was FT_set in AT&T version */
3325 typep
= builtin_type_int
;
3329 case FT_signed_long
:
3330 typep
= builtin_type_long
;
3334 typep
= builtin_type_float
;
3337 case FT_dbl_prec_float
:
3338 typep
= builtin_type_double
;
3341 case FT_unsigned_char
:
3342 typep
= builtin_type_unsigned_char
;
3345 case FT_unsigned_short
:
3346 typep
= builtin_type_unsigned_short
;
3349 case FT_unsigned_integer
:
3350 typep
= builtin_type_unsigned_int
;
3353 case FT_unsigned_long
:
3354 typep
= builtin_type_unsigned_long
;
3357 case FT_ext_prec_float
:
3358 typep
= builtin_type_long_double
;
3362 typep
= builtin_type_complex
;
3365 case FT_dbl_prec_complex
:
3366 typep
= builtin_type_double_complex
;
3370 case FT_signed_long_long
:
3371 typep
= builtin_type_long_long
;
3374 case FT_unsigned_long_long
:
3375 typep
= builtin_type_unsigned_long_long
;
3380 if ((typep
== NULL
) && !(FT_lo_user
<= fundtype
&& fundtype
<= FT_hi_user
))
3382 SQUAWK (("unexpected fundamental type 0x%x", fundtype
));
3383 typep
= builtin_type_void
;
3393 create_name -- allocate a fresh copy of a string on an obstack
3397 Given a pointer to a string and a pointer to an obstack, allocates
3398 a fresh copy of the string on the specified obstack.
3403 DEFUN(create_name
, (name
, obstackp
), char *name AND
struct obstack
*obstackp
)
3408 length
= strlen (name
) + 1;
3409 newname
= (char *) obstack_alloc (obstackp
, length
);
3410 (void) strcpy (newname
, name
);
3418 basicdieinfo -- extract the minimal die info from raw die data
3422 void basicdieinfo (char *diep, struct dieinfo *dip)
3426 Given a pointer to raw DIE data, and a pointer to an instance of a
3427 die info structure, this function extracts the basic information
3428 from the DIE data required to continue processing this DIE, along
3429 with some bookkeeping information about the DIE.
3431 The information we absolutely must have includes the DIE tag,
3432 and the DIE length. If we need the sibling reference, then we
3433 will have to call completedieinfo() to process all the remaining
3436 Note that since there is no guarantee that the data is properly
3437 aligned in memory for the type of access required (indirection
3438 through anything other than a char pointer), we use memcpy to
3439 shuffle data items larger than a char. Possibly inefficient, but
3442 We also take care of some other basic things at this point, such
3443 as ensuring that the instance of the die info structure starts
3444 out completely zero'd and that curdie is initialized for use
3445 in error reporting if we have a problem with the current die.
3449 All DIE's must have at least a valid length, thus the minimum
3450 DIE size is sizeof (long). In order to have a valid tag, the
3451 DIE size must be at least sizeof (short) larger, otherwise they
3452 are forced to be TAG_padding DIES.
3454 Padding DIES must be at least sizeof(long) in length, implying that
3455 if a padding DIE is used for alignment and the amount needed is less
3456 than sizeof(long) then the padding DIE has to be big enough to align
3457 to the next alignment boundry.
3461 DEFUN(basicdieinfo
, (dip
, diep
), struct dieinfo
*dip AND
char *diep
)
3464 (void) memset (dip
, 0, sizeof (struct dieinfo
));
3466 dip
-> dieref
= dbroff
+ (diep
- dbbase
);
3467 (void) memcpy (&dip
-> dielength
, diep
, sizeof (long));
3468 if (dip
-> dielength
< sizeof (long))
3470 dwarfwarn ("malformed DIE, bad length (%d bytes)", dip
-> dielength
);
3472 else if (dip
-> dielength
< (sizeof (long) + sizeof (short)))
3474 dip
-> dietag
= TAG_padding
;
3478 (void) memcpy (&dip
-> dietag
, diep
+ sizeof (long), sizeof (short));
3486 completedieinfo -- finish reading the information for a given DIE
3490 void completedieinfo (struct dieinfo *dip)
3494 Given a pointer to an already partially initialized die info structure,
3495 scan the raw DIE data and finish filling in the die info structure
3496 from the various attributes found.
3498 Note that since there is no guarantee that the data is properly
3499 aligned in memory for the type of access required (indirection
3500 through anything other than a char pointer), we use memcpy to
3501 shuffle data items larger than a char. Possibly inefficient, but
3506 Each time we are called, we increment the diecount variable, which
3507 keeps an approximate count of the number of dies processed for
3508 each compilation unit. This information is presented to the user
3509 if the info_verbose flag is set.
3514 DEFUN(completedieinfo
, (dip
), struct dieinfo
*dip
)
3516 char *diep
; /* Current pointer into raw DIE data */
3517 char *end
; /* Terminate DIE scan here */
3518 unsigned short attr
; /* Current attribute being scanned */
3519 unsigned short form
; /* Form of the attribute */
3520 short block2sz
; /* Size of a block2 attribute field */
3521 long block4sz
; /* Size of a block4 attribute field */
3525 end
= diep
+ dip
-> dielength
;
3526 diep
+= sizeof (long) + sizeof (short);
3529 (void) memcpy (&attr
, diep
, sizeof (short));
3530 diep
+= sizeof (short);
3534 (void) memcpy (&dip
-> at_fund_type
, diep
, sizeof (short));
3537 (void) memcpy (&dip
-> at_ordering
, diep
, sizeof (short));
3540 (void) memcpy (&dip
-> at_bit_offset
, diep
, sizeof (short));
3543 (void) memcpy (&dip
-> at_visibility
, diep
, sizeof (short));
3546 (void) memcpy (&dip
-> at_sibling
, diep
, sizeof (long));
3549 (void) memcpy (&dip
-> at_stmt_list
, diep
, sizeof (long));
3550 dip
-> has_at_stmt_list
= 1;
3553 (void) memcpy (&dip
-> at_low_pc
, diep
, sizeof (long));
3554 dip
-> has_at_low_pc
= 1;
3557 (void) memcpy (&dip
-> at_high_pc
, diep
, sizeof (long));
3560 (void) memcpy (&dip
-> at_language
, diep
, sizeof (long));
3562 case AT_user_def_type
:
3563 (void) memcpy (&dip
-> at_user_def_type
, diep
, sizeof (long));
3566 (void) memcpy (&dip
-> at_byte_size
, diep
, sizeof (long));
3569 (void) memcpy (&dip
-> at_bit_size
, diep
, sizeof (long));
3572 (void) memcpy (&dip
-> at_member
, diep
, sizeof (long));
3575 (void) memcpy (&dip
-> at_discr
, diep
, sizeof (long));
3578 (void) memcpy (&dip
-> at_import
, diep
, sizeof (long));
3581 dip
-> at_location
= diep
;
3583 case AT_mod_fund_type
:
3584 dip
-> at_mod_fund_type
= diep
;
3586 case AT_subscr_data
:
3587 dip
-> at_subscr_data
= diep
;
3589 case AT_mod_u_d_type
:
3590 dip
-> at_mod_u_d_type
= diep
;
3592 case AT_element_list
:
3593 dip
-> at_element_list
= diep
;
3594 dip
-> short_element_list
= 0;
3596 case AT_short_element_list
:
3597 dip
-> at_element_list
= diep
;
3598 dip
-> short_element_list
= 1;
3600 case AT_discr_value
:
3601 dip
-> at_discr_value
= diep
;
3603 case AT_string_length
:
3604 dip
-> at_string_length
= diep
;
3607 dip
-> at_name
= diep
;
3610 dip
-> at_comp_dir
= diep
;
3613 dip
-> at_producer
= diep
;
3616 (void) memcpy (&dip
-> at_frame_base
, diep
, sizeof (long));
3618 case AT_start_scope
:
3619 (void) memcpy (&dip
-> at_start_scope
, diep
, sizeof (long));
3621 case AT_stride_size
:
3622 (void) memcpy (&dip
-> at_stride_size
, diep
, sizeof (long));
3625 (void) memcpy (&dip
-> at_src_info
, diep
, sizeof (long));
3628 (void) memcpy (&dip
-> at_prototyped
, diep
, sizeof (short));
3631 /* Found an attribute that we are unprepared to handle. However
3632 it is specifically one of the design goals of DWARF that
3633 consumers should ignore unknown attributes. As long as the
3634 form is one that we recognize (so we know how to skip it),
3635 we can just ignore the unknown attribute. */
3642 diep
+= sizeof (short);
3645 diep
+= sizeof (long);
3648 diep
+= 8 * sizeof (char); /* sizeof (long long) ? */
3652 diep
+= sizeof (long);
3655 (void) memcpy (&block2sz
, diep
, sizeof (short));
3656 block2sz
+= sizeof (short);
3660 (void) memcpy (&block4sz
, diep
, sizeof (long));
3661 block4sz
+= sizeof (long);
3665 diep
+= strlen (diep
) + 1;
3668 SQUAWK (("unknown attribute form (0x%x), skipped rest", form
));