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 type
= alloc_utype (dip
-> dieref
, NULL
);
907 TYPE_CPLUS_SPECIFIC (type
) = (struct cplus_struct_type
*)
908 obstack_alloc (symbol_obstack
, sizeof (struct cplus_struct_type
));
909 (void) memset (TYPE_CPLUS_SPECIFIC (type
), 0,
910 sizeof (struct cplus_struct_type
));
911 switch (dip
-> dietag
)
913 case TAG_structure_type
:
914 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
918 TYPE_CODE (type
) = TYPE_CODE_UNION
;
922 /* Should never happen */
923 TYPE_CODE (type
) = TYPE_CODE_UNDEF
;
925 SQUAWK (("missing structure or union tag"));
928 /* Some compilers try to be helpful by inventing "fake" names for anonymous
929 enums, structures, and unions, like "~0fake" or ".0fake". Thanks, but
931 if (dip
-> at_name
!= NULL
932 && *dip
-> at_name
!= '~'
933 && *dip
-> at_name
!= '.')
935 TYPE_NAME (type
) = obconcat (tpart1
, " ", dip
-> at_name
);
937 if (dip
-> at_byte_size
!= 0)
939 TYPE_LENGTH (type
) = dip
-> at_byte_size
;
941 thisdie
+= dip
-> dielength
;
942 while (thisdie
< enddie
)
944 basicdieinfo (&mbr
, thisdie
);
945 completedieinfo (&mbr
);
946 if (mbr
.dielength
<= sizeof (long))
950 else if (mbr
.at_sibling
!= 0)
952 nextdie
= dbbase
+ mbr
.at_sibling
- dbroff
;
956 nextdie
= thisdie
+ mbr
.dielength
;
961 /* Get space to record the next field's data. */
962 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
966 list
-> field
.name
= savestring (mbr
.at_name
, strlen (mbr
.at_name
));
967 list
-> field
.type
= decode_die_type (&mbr
);
968 list
-> field
.bitpos
= 8 * locval (mbr
.at_location
);
969 list
-> field
.bitsize
= 0;
973 process_dies (thisdie
, nextdie
, objfile
);
978 /* Now create the vector of fields, and record how big it is. */
979 TYPE_NFIELDS (type
) = nfields
;
980 TYPE_FIELDS (type
) = (struct field
*)
981 obstack_alloc (symbol_obstack
, sizeof (struct field
) * nfields
);
982 /* Copy the saved-up fields into the field vector. */
983 for (n
= nfields
; list
; list
= list
-> next
)
985 TYPE_FIELD (type
, --n
) = list
-> field
;
994 read_structure_scope -- process all dies within struct or union
998 static void read_structure_scope (struct dieinfo *dip,
999 char *thisdie, char *enddie, struct objfile *objfile)
1003 Called when we find the DIE that starts a structure or union
1004 scope (definition) to process all dies that define the members
1005 of the structure or union. DIP is a pointer to the die info
1006 struct for the DIE that names the structure or union.
1010 Note that we need to call struct_type regardless of whether or not
1011 we have a symbol, since we might have a structure or union without
1012 a tag name (thus no symbol for the tagname).
1016 DEFUN(read_structure_scope
, (dip
, thisdie
, enddie
, objfile
),
1017 struct dieinfo
*dip AND
1020 struct objfile
*objfile
)
1025 type
= struct_type (dip
, thisdie
, enddie
, objfile
);
1026 if ((sym
= new_symbol (dip
)) != NULL
)
1028 SYMBOL_TYPE (sym
) = type
;
1036 decode_array_element_type -- decode type of the array elements
1040 static struct type *decode_array_element_type (char *scan, char *end)
1044 As the last step in decoding the array subscript information for an
1045 array DIE, we need to decode the type of the array elements. We are
1046 passed a pointer to this last part of the subscript information and
1047 must return the appropriate type. If the type attribute is not
1048 recognized, just warn about the problem and return type int.
1051 static struct type
*
1052 DEFUN(decode_array_element_type
, (scan
, end
), char *scan AND
char *end
)
1057 unsigned short fundtype
;
1059 (void) memcpy (&attribute
, scan
, sizeof (short));
1060 scan
+= sizeof (short);
1064 (void) memcpy (&fundtype
, scan
, sizeof (short));
1065 typep
= decode_fund_type (fundtype
);
1067 case AT_mod_fund_type
:
1068 typep
= decode_mod_fund_type (scan
);
1070 case AT_user_def_type
:
1071 (void) memcpy (&dieref
, scan
, sizeof (DIEREF
));
1072 if ((typep
= lookup_utype (dieref
)) == NULL
)
1074 typep
= alloc_utype (dieref
, NULL
);
1077 case AT_mod_u_d_type
:
1078 typep
= decode_mod_u_d_type (scan
);
1081 SQUAWK (("bad array element type attribute 0x%x", attribute
));
1082 typep
= builtin_type_int
;
1092 decode_subscr_data -- decode array subscript and element type data
1096 static struct type *decode_subscr_data (char *scan, char *end)
1100 The array subscripts and the data type of the elements of an
1101 array are described by a list of data items, stored as a block
1102 of contiguous bytes. There is a data item describing each array
1103 dimension, and a final data item describing the element type.
1104 The data items are ordered the same as their appearance in the
1105 source (I.E. leftmost dimension first, next to leftmost second,
1108 We are passed a pointer to the start of the block of bytes
1109 containing the data items, and a pointer to the first byte past
1110 the data. This function decodes the data and returns a type.
1113 FIXME: This code only implements the forms currently used
1114 by the AT&T and GNU C compilers.
1116 The end pointer is supplied for error checking, maybe we should
1120 static struct type
*
1121 DEFUN(decode_subscr_data
, (scan
, end
), char *scan AND
char *end
)
1123 struct type
*typep
= NULL
;
1124 struct type
*nexttype
;
1134 typep
= decode_array_element_type (scan
, end
);
1137 (void) memcpy (&fundtype
, scan
, sizeof (short));
1138 scan
+= sizeof (short);
1139 if (fundtype
!= FT_integer
&& fundtype
!= FT_signed_integer
1140 && fundtype
!= FT_unsigned_integer
)
1142 SQUAWK (("array subscripts must be integral types, not type 0x%x",
1147 (void) memcpy (&lowbound
, scan
, sizeof (long));
1148 scan
+= sizeof (long);
1149 (void) memcpy (&highbound
, scan
, sizeof (long));
1150 scan
+= sizeof (long);
1151 nexttype
= decode_subscr_data (scan
, end
);
1152 if (nexttype
!= NULL
)
1154 typep
= (struct type
*)
1155 obstack_alloc (symbol_obstack
, sizeof (struct type
));
1156 (void) memset (typep
, 0, sizeof (struct type
));
1157 TYPE_CODE (typep
) = TYPE_CODE_ARRAY
;
1158 TYPE_LENGTH (typep
) = TYPE_LENGTH (nexttype
);
1159 TYPE_LENGTH (typep
) *= lowbound
+ highbound
+ 1;
1160 TYPE_TARGET_TYPE (typep
) = nexttype
;
1171 SQUAWK (("array subscript format 0x%x not handled yet", format
));
1174 SQUAWK (("unknown array subscript format %x", format
));
1184 read_array_type -- read TAG_array_type DIE
1188 static void read_array_type (struct dieinfo *dip)
1192 Extract all information from a TAG_array_type DIE and add to
1193 the user defined type vector.
1197 DEFUN(read_array_type
, (dip
), struct dieinfo
*dip
)
1204 if (dip
-> at_ordering
!= ORD_row_major
)
1206 /* FIXME: Can gdb even handle column major arrays? */
1207 SQUAWK (("array not row major; not handled correctly"));
1209 if ((sub
= dip
-> at_subscr_data
) != NULL
)
1211 (void) memcpy (&temp
, sub
, sizeof (short));
1212 subend
= sub
+ sizeof (short) + temp
;
1213 sub
+= sizeof (short);
1214 type
= decode_subscr_data (sub
, subend
);
1217 type
= alloc_utype (dip
-> dieref
, NULL
);
1218 TYPE_CODE (type
) = TYPE_CODE_ARRAY
;
1219 TYPE_TARGET_TYPE (type
) = builtin_type_int
;
1220 TYPE_LENGTH (type
) = 1 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
));
1224 type
= alloc_utype (dip
-> dieref
, type
);
1233 read_subroutine_type -- process TAG_subroutine_type dies
1237 static void read_subroutine_type (struct dieinfo *dip, char thisdie,
1242 Handle DIES due to C code like:
1245 int (*funcp)(int a, long l); (Generates TAG_subroutine_type DIE)
1251 The parameter DIES are currently ignored. See if gdb has a way to
1252 include this info in it's type system, and decode them if so. Is
1253 this what the type structure's "arg_types" field is for? (FIXME)
1257 DEFUN(read_subroutine_type
, (dip
, thisdie
, enddie
),
1258 struct dieinfo
*dip AND
1264 type
= decode_die_type (dip
);
1265 type
= lookup_function_type (type
);
1266 type
= alloc_utype (dip
-> dieref
, type
);
1273 read_enumeration -- process dies which define an enumeration
1277 static void read_enumeration (struct dieinfo *dip, char *thisdie,
1282 Given a pointer to a die which begins an enumeration, process all
1283 the dies that define the members of the enumeration.
1287 Note that we need to call enum_type regardless of whether or not we
1288 have a symbol, since we might have an enum without a tag name (thus
1289 no symbol for the tagname).
1293 DEFUN(read_enumeration
, (dip
, thisdie
, enddie
),
1294 struct dieinfo
*dip AND
1301 type
= enum_type (dip
);
1302 if ((sym
= new_symbol (dip
)) != NULL
)
1304 SYMBOL_TYPE (sym
) = type
;
1312 enum_type -- decode and return a type for an enumeration
1316 static type *enum_type (struct dieinfo *dip)
1320 Given a pointer to a die information structure for the die which
1321 starts an enumeration, process all the dies that define the members
1322 of the enumeration and return a type pointer for the enumeration.
1324 At the same time, for each member of the enumeration, create a
1325 symbol for it with namespace VAR_NAMESPACE and class LOC_CONST,
1326 and give it the type of the enumeration itself.
1330 Note that the DWARF specification explicitly mandates that enum
1331 constants occur in reverse order from the source program order,
1332 for "consistency" and because this ordering is easier for many
1333 compilers to generate. (Draft 5, sec 3.9.5, Enumeration type
1334 Entries). Because gdb wants to see the enum members in program
1335 source order, we have to ensure that the order gets reversed while
1336 we are processing them.
1339 static struct type
*
1340 DEFUN(enum_type
, (dip
), struct dieinfo
*dip
)
1344 struct nextfield
*next
;
1347 struct nextfield
*list
= NULL
;
1348 struct nextfield
*new;
1357 if ((type
= lookup_utype (dip
-> dieref
)) == NULL
)
1359 type
= alloc_utype (dip
-> dieref
, NULL
);
1361 TYPE_CODE (type
) = TYPE_CODE_ENUM
;
1362 /* Some compilers try to be helpful by inventing "fake" names for anonymous
1363 enums, structures, and unions, like "~0fake" or ".0fake". Thanks, but
1365 if (dip
-> at_name
!= NULL
1366 && *dip
-> at_name
!= '~'
1367 && *dip
-> at_name
!= '.')
1369 TYPE_NAME (type
) = obconcat ("enum", " ", dip
-> at_name
);
1371 if (dip
-> at_byte_size
!= 0)
1373 TYPE_LENGTH (type
) = dip
-> at_byte_size
;
1375 if ((scan
= dip
-> at_element_list
) != NULL
)
1377 if (dip
-> short_element_list
)
1379 (void) memcpy (&stemp
, scan
, sizeof (stemp
));
1380 listend
= scan
+ stemp
+ sizeof (stemp
);
1381 scan
+= sizeof (stemp
);
1385 (void) memcpy (<emp
, scan
, sizeof (ltemp
));
1386 listend
= scan
+ ltemp
+ sizeof (ltemp
);
1387 scan
+= sizeof (ltemp
);
1389 while (scan
< listend
)
1391 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
1394 list
-> field
.type
= NULL
;
1395 list
-> field
.bitsize
= 0;
1396 (void) memcpy (&list
-> field
.bitpos
, scan
, sizeof (long));
1397 scan
+= sizeof (long);
1398 list
-> field
.name
= savestring (scan
, strlen (scan
));
1399 scan
+= strlen (scan
) + 1;
1401 /* Handcraft a new symbol for this enum member. */
1402 sym
= (struct symbol
*) obstack_alloc (symbol_obstack
,
1403 sizeof (struct symbol
));
1404 (void) memset (sym
, 0, sizeof (struct symbol
));
1405 SYMBOL_NAME (sym
) = create_name (list
-> field
.name
, symbol_obstack
);
1406 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1407 SYMBOL_CLASS (sym
) = LOC_CONST
;
1408 SYMBOL_TYPE (sym
) = type
;
1409 SYMBOL_VALUE (sym
) = list
-> field
.bitpos
;
1410 add_symbol_to_list (sym
, &scope
-> symbols
);
1413 /* Now create the vector of fields, and record how big it is. This is where
1414 we reverse the order, by pulling the members of the list in reverse order
1415 from how they were inserted. */
1416 TYPE_NFIELDS (type
) = nfields
;
1417 TYPE_FIELDS (type
) = (struct field
*)
1418 obstack_alloc (symbol_obstack
, sizeof (struct field
) * nfields
);
1419 /* Copy the saved-up fields into the field vector. */
1420 for (n
= 0; (n
< nfields
) && (list
!= NULL
); list
= list
-> next
)
1422 TYPE_FIELD (type
, n
++) = list
-> field
;
1431 read_func_scope -- process all dies within a function scope
1435 Process all dies within a given function scope. We are passed
1436 a die information structure pointer DIP for the die which
1437 starts the function scope, and pointers into the raw die data
1438 that define the dies within the function scope.
1440 For now, we ignore lexical block scopes within the function.
1441 The problem is that AT&T cc does not define a DWARF lexical
1442 block scope for the function itself, while gcc defines a
1443 lexical block scope for the function. We need to think about
1444 how to handle this difference, or if it is even a problem.
1449 DEFUN(read_func_scope
, (dip
, thisdie
, enddie
, objfile
),
1450 struct dieinfo
*dip AND
1453 struct objfile
*objfile
)
1457 if (entry_point
>= dip
-> at_low_pc
&& entry_point
< dip
-> at_high_pc
)
1459 entry_scope_lowpc
= dip
-> at_low_pc
;
1460 entry_scope_highpc
= dip
-> at_high_pc
;
1462 if (strcmp (dip
-> at_name
, "main") == 0) /* FIXME: hardwired name */
1464 main_scope_lowpc
= dip
-> at_low_pc
;
1465 main_scope_highpc
= dip
-> at_high_pc
;
1467 sym
= new_symbol (dip
);
1468 openscope (sym
, dip
-> at_low_pc
, dip
-> at_high_pc
);
1469 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
1477 read_file_scope -- process all dies within a file scope
1481 Process all dies within a given file scope. We are passed a
1482 pointer to the die information structure for the die which
1483 starts the file scope, and pointers into the raw die data which
1484 mark the range of dies within the file scope.
1486 When the partial symbol table is built, the file offset for the line
1487 number table for each compilation unit is saved in the partial symbol
1488 table entry for that compilation unit. As the symbols for each
1489 compilation unit are read, the line number table is read into memory
1490 and the variable lnbase is set to point to it. Thus all we have to
1491 do is use lnbase to access the line number table for the current
1496 DEFUN(read_file_scope
, (dip
, thisdie
, enddie
, objfile
),
1497 struct dieinfo
*dip AND
1500 struct objfile
*objfile
)
1502 struct cleanup
*back_to
;
1504 if (entry_point
>= dip
-> at_low_pc
&& entry_point
< dip
-> at_high_pc
)
1506 startup_file_start
= dip
-> at_low_pc
;
1507 startup_file_end
= dip
-> at_high_pc
;
1509 numutypes
= (enddie
- thisdie
) / 4;
1510 utypes
= (struct type
**) xmalloc (numutypes
* sizeof (struct type
*));
1511 back_to
= make_cleanup (free
, utypes
);
1512 (void) memset (utypes
, 0, numutypes
* sizeof (struct type
*));
1514 openscope (NULL
, dip
-> at_low_pc
, dip
-> at_high_pc
);
1515 decode_line_numbers (lnbase
);
1516 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
1518 end_symtab (dip
-> at_name
, dip
-> at_language
, objfile
);
1519 do_cleanups (back_to
);
1528 start_symtab -- do initialization for starting new symbol table
1532 static void start_symtab (void)
1536 Called whenever we are starting to process dies for a new
1537 compilation unit, to perform initializations. Right now
1538 the only thing we really have to do is initialize storage
1539 space for the line number vector.
1544 DEFUN_VOID (start_symtab
)
1548 line_vector_index
= 0;
1549 line_vector_length
= 1000;
1550 nbytes
= sizeof (struct linetable
);
1551 nbytes
+= line_vector_length
* sizeof (struct linetable_entry
);
1552 line_vector
= (struct linetable
*) xmalloc (nbytes
);
1559 process_dies -- process a range of DWARF Information Entries
1563 static void process_dies (char *thisdie, char *enddie,
1564 struct objfile *objfile)
1568 Process all DIE's in a specified range. May be (and almost
1569 certainly will be) called recursively.
1573 DEFUN(process_dies
, (thisdie
, enddie
, objfile
),
1574 char *thisdie AND
char *enddie AND
struct objfile
*objfile
)
1579 while (thisdie
< enddie
)
1581 basicdieinfo (&di
, thisdie
);
1582 if (di
.dielength
< sizeof (long))
1586 else if (di
.dietag
== TAG_padding
)
1588 nextdie
= thisdie
+ di
.dielength
;
1592 completedieinfo (&di
);
1593 if (di
.at_sibling
!= 0)
1595 nextdie
= dbbase
+ di
.at_sibling
- dbroff
;
1599 nextdie
= thisdie
+ di
.dielength
;
1603 case TAG_compile_unit
:
1604 read_file_scope (&di
, thisdie
, nextdie
, objfile
);
1606 case TAG_global_subroutine
:
1607 case TAG_subroutine
:
1608 if (di
.has_at_low_pc
)
1610 read_func_scope (&di
, thisdie
, nextdie
, objfile
);
1613 case TAG_lexical_block
:
1614 read_lexical_block_scope (&di
, thisdie
, nextdie
, objfile
);
1616 case TAG_structure_type
:
1617 case TAG_union_type
:
1618 read_structure_scope (&di
, thisdie
, nextdie
, objfile
);
1620 case TAG_enumeration_type
:
1621 read_enumeration (&di
, thisdie
, nextdie
);
1623 case TAG_subroutine_type
:
1624 read_subroutine_type (&di
, thisdie
, nextdie
);
1626 case TAG_array_type
:
1627 read_array_type (&di
);
1630 (void) new_symbol (&di
);
1642 end_symtab -- finish processing for a compilation unit
1646 static void end_symtab (char *filename, long language)
1650 Complete the symbol table entry for the current compilation
1651 unit. Make the struct symtab and put it on the list of all
1657 DEFUN(end_symtab
, (filename
, language
, objfile
),
1658 char *filename AND
long language AND
struct objfile
*objfile
)
1660 struct symtab
*symtab
;
1661 struct blockvector
*blockvector
;
1664 /* Ignore a file that has no functions with real debugging info. */
1665 if (global_symbols
== NULL
&& scopetree
-> block
== NULL
)
1669 line_vector_length
= -1;
1670 freescope (scopetree
);
1671 scope
= scopetree
= NULL
;
1674 /* Create the blockvector that points to all the file's blocks. */
1676 blockvector
= make_blockvector ();
1678 /* Now create the symtab object for this source file. */
1680 symtab
= allocate_symtab (savestring (filename
, strlen (filename
)),
1683 symtab
-> free_ptr
= 0;
1685 /* Fill in its components. */
1686 symtab
-> blockvector
= blockvector
;
1687 symtab
-> free_code
= free_linetable
;
1689 /* Save the line number information. */
1691 line_vector
-> nitems
= line_vector_index
;
1692 nbytes
= sizeof (struct linetable
);
1693 if (line_vector_index
> 1)
1695 nbytes
+= (line_vector_index
- 1) * sizeof (struct linetable_entry
);
1697 symtab
-> linetable
= (struct linetable
*) xrealloc (line_vector
, nbytes
);
1699 /* FIXME: The following may need to be expanded for other languages */
1704 symtab
-> language
= language_c
;
1706 case LANG_C_PLUS_PLUS
:
1707 symtab
-> language
= language_cplus
;
1713 /* Link the new symtab into the list of such. */
1714 symtab
-> next
= symtab_list
;
1715 symtab_list
= symtab
;
1717 /* Recursively free the scope tree */
1718 freescope (scopetree
);
1719 scope
= scopetree
= NULL
;
1721 /* Reinitialize for beginning of new file. */
1723 line_vector_length
= -1;
1730 scopecount -- count the number of enclosed scopes
1734 static int scopecount (struct scopenode *node)
1738 Given pointer to a node, compute the size of the subtree which is
1739 rooted in this node, which also happens to be the number of scopes
1744 DEFUN(scopecount
, (node
), struct scopenode
*node
)
1750 count
+= scopecount (node
-> child
);
1751 count
+= scopecount (node
-> sibling
);
1761 openscope -- start a new lexical block scope
1765 static void openscope (struct symbol *namesym, CORE_ADDR lowpc,
1770 Start a new scope by allocating a new scopenode, adding it as the
1771 next child of the current scope (if any) or as the root of the
1772 scope tree, and then making the new node the current scope node.
1776 DEFUN(openscope
, (namesym
, lowpc
, highpc
),
1777 struct symbol
*namesym AND
1781 struct scopenode
*new;
1782 struct scopenode
*child
;
1784 new = (struct scopenode
*) xmalloc (sizeof (*new));
1785 (void) memset (new, 0, sizeof (*new));
1786 new -> namesym
= namesym
;
1787 new -> lowpc
= lowpc
;
1788 new -> highpc
= highpc
;
1793 else if ((child
= scope
-> child
) == NULL
)
1795 scope
-> child
= new;
1796 new -> parent
= scope
;
1800 while (child
-> sibling
!= NULL
)
1802 child
= child
-> sibling
;
1804 child
-> sibling
= new;
1805 new -> parent
= scope
;
1814 freescope -- free a scope tree rooted at the given node
1818 static void freescope (struct scopenode *node)
1822 Given a pointer to a node in the scope tree, free the subtree
1823 rooted at that node. First free all the children and sibling
1824 nodes, and then the node itself. Used primarily for cleaning
1825 up after ourselves and returning memory to the system.
1829 DEFUN(freescope
, (node
), struct scopenode
*node
)
1833 freescope (node
-> child
);
1834 freescope (node
-> sibling
);
1843 buildblock -- build a new block from pending symbols list
1847 static struct block *buildblock (struct pending_symbol *syms)
1851 Given a pointer to a list of symbols, build a new block and free
1852 the symbol list structure. Also check each symbol to see if it
1853 is the special symbol that flags that this block was compiled by
1854 gcc, and if so, mark the block appropriately.
1857 static struct block
*
1858 DEFUN(buildblock
, (syms
), struct pending_symbol
*syms
)
1860 struct pending_symbol
*next
, *next1
;
1862 struct block
*newblock
;
1865 for (next
= syms
, i
= 0 ; next
; next
= next
-> next
, i
++) {;}
1867 /* Allocate a new block */
1869 nbytes
= sizeof (struct block
);
1872 nbytes
+= (i
- 1) * sizeof (struct symbol
*);
1874 newblock
= (struct block
*) obstack_alloc (symbol_obstack
, nbytes
);
1875 (void) memset (newblock
, 0, nbytes
);
1877 /* Copy the symbols into the block. */
1879 BLOCK_NSYMS (newblock
) = i
;
1880 for (next
= syms
; next
; next
= next
-> next
)
1882 BLOCK_SYM (newblock
, --i
) = next
-> symbol
;
1883 if (STREQ (GCC_COMPILED_FLAG_SYMBOL
, SYMBOL_NAME (next
-> symbol
)) ||
1884 STREQ (GCC2_COMPILED_FLAG_SYMBOL
, SYMBOL_NAME (next
-> symbol
)))
1886 BLOCK_GCC_COMPILED (newblock
) = 1;
1890 /* Now free the links of the list, and empty the list. */
1892 for (next
= syms
; next
; next
= next1
)
1894 next1
= next
-> next
;
1905 closescope -- close a lexical block scope
1909 static void closescope (void)
1913 Close the current lexical block scope. Closing the current scope
1914 is as simple as moving the current scope pointer up to the parent
1915 of the current scope pointer. But we also take this opportunity
1916 to build the block for the current scope first, since we now have
1917 all of it's symbols.
1921 DEFUN_VOID(closescope
)
1923 struct scopenode
*child
;
1927 error ("DWARF parse error, too many close scopes");
1931 if (scope
-> parent
== NULL
)
1933 global_symbol_block
= buildblock (global_symbols
);
1934 global_symbols
= NULL
;
1935 BLOCK_START (global_symbol_block
) = scope
-> lowpc
+ baseaddr
;
1936 BLOCK_END (global_symbol_block
) = scope
-> highpc
+ baseaddr
;
1938 scope
-> block
= buildblock (scope
-> symbols
);
1939 scope
-> symbols
= NULL
;
1940 BLOCK_START (scope
-> block
) = scope
-> lowpc
+ baseaddr
;
1941 BLOCK_END (scope
-> block
) = scope
-> highpc
+ baseaddr
;
1943 /* Put the local block in as the value of the symbol that names it. */
1945 if (scope
-> namesym
)
1947 SYMBOL_BLOCK_VALUE (scope
-> namesym
) = scope
-> block
;
1948 BLOCK_FUNCTION (scope
-> block
) = scope
-> namesym
;
1951 /* Install this scope's local block as the superblock of all child
1954 for (child
= scope
-> child
; child
; child
= child
-> sibling
)
1956 BLOCK_SUPERBLOCK (child
-> block
) = scope
-> block
;
1959 scope
= scope
-> parent
;
1967 record_line -- record a line number entry in the line vector
1971 static void record_line (int line, CORE_ADDR pc)
1975 Given a line number and the corresponding pc value, record
1976 this pair in the line number vector, expanding the vector as
1981 DEFUN(record_line
, (line
, pc
), int line AND CORE_ADDR pc
)
1983 struct linetable_entry
*e
;
1986 /* Make sure line vector is big enough. */
1988 if (line_vector_index
+ 2 >= line_vector_length
)
1990 line_vector_length
*= 2;
1991 nbytes
= sizeof (struct linetable
);
1992 nbytes
+= (line_vector_length
* sizeof (struct linetable_entry
));
1993 line_vector
= (struct linetable
*) xrealloc (line_vector
, nbytes
);
1995 e
= line_vector
-> item
+ line_vector_index
++;
2004 decode_line_numbers -- decode a line number table fragment
2008 static void decode_line_numbers (char *tblscan, char *tblend,
2009 long length, long base, long line, long pc)
2013 Translate the DWARF line number information to gdb form.
2015 The ".line" section contains one or more line number tables, one for
2016 each ".line" section from the objects that were linked.
2018 The AT_stmt_list attribute for each TAG_source_file entry in the
2019 ".debug" section contains the offset into the ".line" section for the
2020 start of the table for that file.
2022 The table itself has the following structure:
2024 <table length><base address><source statement entry>
2025 4 bytes 4 bytes 10 bytes
2027 The table length is the total size of the table, including the 4 bytes
2028 for the length information.
2030 The base address is the address of the first instruction generated
2031 for the source file.
2033 Each source statement entry has the following structure:
2035 <line number><statement position><address delta>
2036 4 bytes 2 bytes 4 bytes
2038 The line number is relative to the start of the file, starting with
2041 The statement position either -1 (0xFFFF) or the number of characters
2042 from the beginning of the line to the beginning of the statement.
2044 The address delta is the difference between the base address and
2045 the address of the first instruction for the statement.
2047 Note that we must copy the bytes from the packed table to our local
2048 variables before attempting to use them, to avoid alignment problems
2049 on some machines, particularly RISC processors.
2053 Does gdb expect the line numbers to be sorted? They are now by
2054 chance/luck, but are not required to be. (FIXME)
2056 The line with number 0 is unused, gdb apparently can discover the
2057 span of the last line some other way. How? (FIXME)
2061 DEFUN(decode_line_numbers
, (linetable
), char *linetable
)
2070 if (linetable
!= NULL
)
2072 tblscan
= tblend
= linetable
;
2073 (void) memcpy (&length
, tblscan
, sizeof (long));
2074 tblscan
+= sizeof (long);
2076 (void) memcpy (&base
, tblscan
, sizeof (long));
2078 tblscan
+= sizeof (long);
2079 while (tblscan
< tblend
)
2081 (void) memcpy (&line
, tblscan
, sizeof (long));
2082 tblscan
+= sizeof (long) + sizeof (short);
2083 (void) memcpy (&pc
, tblscan
, sizeof (long));
2084 tblscan
+= sizeof (long);
2088 record_line (line
, pc
);
2098 add_symbol_to_list -- add a symbol to head of current symbol list
2102 static void add_symbol_to_list (struct symbol *symbol, struct
2103 pending_symbol **listhead)
2107 Given a pointer to a symbol and a pointer to a pointer to a
2108 list of symbols, add this symbol as the current head of the
2109 list. Typically used for example to add a symbol to the
2110 symbol list for the current scope.
2115 DEFUN(add_symbol_to_list
, (symbol
, listhead
),
2116 struct symbol
*symbol AND
struct pending_symbol
**listhead
)
2118 struct pending_symbol
*link
;
2122 link
= (struct pending_symbol
*) xmalloc (sizeof (*link
));
2123 link
-> next
= *listhead
;
2124 link
-> symbol
= symbol
;
2133 gatherblocks -- walk a scope tree and build block vectors
2137 static struct block **gatherblocks (struct block **dest,
2138 struct scopenode *node)
2142 Recursively walk a scope tree rooted in the given node, adding blocks
2143 to the array pointed to by DEST, in preorder. I.E., first we add the
2144 block for the current scope, then all the blocks for child scopes,
2145 and finally all the blocks for sibling scopes.
2148 static struct block
**
2149 DEFUN(gatherblocks
, (dest
, node
),
2150 struct block
**dest AND
struct scopenode
*node
)
2154 *dest
++ = node
-> block
;
2155 dest
= gatherblocks (dest
, node
-> child
);
2156 dest
= gatherblocks (dest
, node
-> sibling
);
2165 make_blockvector -- make a block vector from current scope tree
2169 static struct blockvector *make_blockvector (void)
2173 Make a blockvector from all the blocks in the current scope tree.
2174 The first block is always the global symbol block, followed by the
2175 block for the root of the scope tree which is the local symbol block,
2176 followed by all the remaining blocks in the scope tree, which are all
2181 Note that since the root node of the scope tree is created at the time
2182 each file scope is entered, there are always at least two blocks,
2183 neither of which may have any symbols, but always contribute a block
2184 to the block vector. So the test for number of blocks greater than 1
2185 below is unnecessary given bug free code.
2187 The resulting block structure varies slightly from that produced
2188 by dbxread.c, in that block 0 and block 1 are sibling blocks while
2189 with dbxread.c, block 1 is a child of block 0. This does not
2190 seem to cause any problems, but probably should be fixed. (FIXME)
2193 static struct blockvector
*
2194 DEFUN_VOID(make_blockvector
)
2196 struct blockvector
*blockvector
= NULL
;
2200 /* Recursively walk down the tree, counting the number of blocks.
2201 Then add one to account for the global's symbol block */
2203 i
= scopecount (scopetree
) + 1;
2204 nbytes
= sizeof (struct blockvector
);
2207 nbytes
+= (i
- 1) * sizeof (struct block
*);
2209 blockvector
= (struct blockvector
*)
2210 obstack_alloc (symbol_obstack
, nbytes
);
2212 /* Copy the blocks into the blockvector. */
2214 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
2215 BLOCKVECTOR_BLOCK (blockvector
, 0) = global_symbol_block
;
2216 gatherblocks (&BLOCKVECTOR_BLOCK (blockvector
, 1), scopetree
);
2218 return (blockvector
);
2225 locval -- compute the value of a location attribute
2229 static int locval (char *loc)
2233 Given pointer to a string of bytes that define a location, compute
2234 the location and return the value.
2236 When computing values involving the current value of the frame pointer,
2237 the value zero is used, which results in a value relative to the frame
2238 pointer, rather than the absolute value. This is what GDB wants
2241 When the result is a register number, the global isreg flag is set,
2242 otherwise it is cleared. This is a kludge until we figure out a better
2243 way to handle the problem. Gdb's design does not mesh well with the
2244 DWARF notion of a location computing interpreter, which is a shame
2245 because the flexibility goes unused.
2249 Note that stack[0] is unused except as a default error return.
2250 Note that stack overflow is not yet handled.
2254 DEFUN(locval
, (loc
), char *loc
)
2256 unsigned short nbytes
;
2262 (void) memcpy (&nbytes
, loc
, sizeof (short));
2263 end
= loc
+ sizeof (short) + nbytes
;
2267 for (loc
+= sizeof (short); loc
< end
; loc
+= sizeof (long))
2275 /* push register (number) */
2276 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2280 /* push value of register (number) */
2281 /* Actually, we compute the value as if register has 0 */
2282 (void) memcpy (®no
, loc
, sizeof (long));
2285 stack
[++stacki
] = 0;
2289 stack
[++stacki
] = 0;
2290 SQUAWK (("BASEREG %d not handled!", regno
));
2294 /* push address (relocated address) */
2295 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2298 /* push constant (number) */
2299 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2302 /* pop, deref and push 2 bytes (as a long) */
2303 SQUAWK (("OP_DEREF2 address %#x not handled", stack
[stacki
]));
2305 case OP_DEREF4
: /* pop, deref and push 4 bytes (as a long) */
2306 SQUAWK (("OP_DEREF4 address %#x not handled", stack
[stacki
]));
2308 case OP_ADD
: /* pop top 2 items, add, push result */
2309 stack
[stacki
- 1] += stack
[stacki
];
2314 return (stack
[stacki
]);
2321 read_ofile_symtab -- build a full symtab entry from chunk of DIE's
2325 static struct symtab *read_ofile_symtab (struct partial_symtab *pst)
2329 OFFSET is a relocation offset which gets added to each symbol (FIXME).
2332 static struct symtab
*
2333 DEFUN(read_ofile_symtab
, (pst
),
2334 struct partial_symtab
*pst
)
2336 struct cleanup
*back_to
;
2339 bfd
*abfd
= pst
->objfile
->obfd
;
2341 /* Allocate a buffer for the entire chunk of DIE's for this compilation
2342 unit, seek to the location in the file, and read in all the DIE's. */
2345 dbbase
= xmalloc (DBLENGTH(pst
));
2346 dbroff
= DBROFF(pst
);
2347 foffset
= DBFOFF(pst
) + dbroff
;
2348 if (bfd_seek (abfd
, foffset
, 0) ||
2349 (bfd_read (dbbase
, DBLENGTH(pst
), 1, abfd
) != DBLENGTH(pst
)))
2352 error ("can't read DWARF data");
2354 back_to
= make_cleanup (free
, dbbase
);
2356 /* If there is a line number table associated with this compilation unit
2357 then read the first long word from the line number table fragment, which
2358 contains the size of the fragment in bytes (including the long word
2359 itself). Allocate a buffer for the fragment and read it in for future
2365 if (bfd_seek (abfd
, LNFOFF (pst
), 0) ||
2366 (bfd_read (&lnsize
, sizeof(long), 1, abfd
) != sizeof(long)))
2368 error ("can't read DWARF line number table size");
2370 lnbase
= xmalloc (lnsize
);
2371 if (bfd_seek (abfd
, LNFOFF (pst
), 0) ||
2372 (bfd_read (lnbase
, lnsize
, 1, abfd
) != lnsize
))
2375 error ("can't read DWARF line numbers");
2377 make_cleanup (free
, lnbase
);
2380 process_dies (dbbase
, dbbase
+ DBLENGTH(pst
), pst
->objfile
);
2381 do_cleanups (back_to
);
2382 return (symtab_list
);
2389 psymtab_to_symtab_1 -- do grunt work for building a full symtab entry
2393 static void psymtab_to_symtab_1 (struct partial_symtab *pst)
2397 Called once for each partial symbol table entry that needs to be
2398 expanded into a full symbol table entry.
2403 DEFUN(psymtab_to_symtab_1
,
2405 struct partial_symtab
*pst
)
2415 fprintf (stderr
, "Psymtab for %s already read in. Shouldn't happen.\n",
2420 /* Read in all partial symtabs on which this one is dependent */
2421 for (i
= 0; i
< pst
-> number_of_dependencies
; i
++)
2422 if (!pst
-> dependencies
[i
] -> readin
)
2424 /* Inform about additional files that need to be read in. */
2427 fputs_filtered (" ", stdout
);
2429 fputs_filtered ("and ", stdout
);
2431 printf_filtered ("%s...", pst
-> dependencies
[i
] -> filename
);
2432 wrap_here (""); /* Flush output */
2435 psymtab_to_symtab_1 (pst
-> dependencies
[i
]);
2438 if (DBLENGTH(pst
)) /* Otherwise it's a dummy */
2440 /* Init stuff necessary for reading in symbols */
2441 pst
-> symtab
= read_ofile_symtab (pst
);
2444 printf_filtered ("%d DIE's, sorting...", diecount
);
2447 sort_symtab_syms (pst
-> symtab
);
2456 dwarf_psymtab_to_symtab -- build a full symtab entry from partial one
2460 static void dwarf_psymtab_to_symtab (struct partial_symtab *pst)
2464 This is the DWARF support entry point for building a full symbol
2465 table entry from a partial symbol table entry. We are passed a
2466 pointer to the partial symbol table entry that needs to be expanded.
2471 DEFUN(dwarf_psymtab_to_symtab
, (pst
), struct partial_symtab
*pst
)
2480 fprintf (stderr
, "Psymtab for %s already read in. Shouldn't happen.\n",
2485 if (DBLENGTH(pst
) || pst
-> number_of_dependencies
)
2487 /* Print the message now, before starting serious work, to avoid
2488 disconcerting pauses. */
2491 printf_filtered ("Reading in symbols for %s...", pst
-> filename
);
2495 psymtab_to_symtab_1 (pst
);
2497 #if 0 /* FIXME: Check to see what dbxread is doing here and see if
2498 we need to do an equivalent or is this something peculiar to
2499 stabs/a.out format. */
2500 /* Match with global symbols. This only needs to be done once,
2501 after all of the symtabs and dependencies have been read in. */
2502 scan_file_globals ();
2505 /* Finish up the debug error message. */
2508 printf_filtered ("done.\n");
2517 init_psymbol_list -- initialize storage for partial symbols
2521 static void init_psymbol_list (int total_symbols)
2525 Initializes storage for all of the partial symbols that will be
2526 created by dwarf_build_psymtabs and subsidiaries.
2530 DEFUN(init_psymbol_list
, (total_symbols
), int total_symbols
)
2532 /* Free any previously allocated psymbol lists. */
2534 if (global_psymbols
.list
)
2536 free (global_psymbols
.list
);
2538 if (static_psymbols
.list
)
2540 free (static_psymbols
.list
);
2543 /* Current best guess is that there are approximately a twentieth
2544 of the total symbols (in a debugging file) are global or static
2547 global_psymbols
.size
= total_symbols
/ 10;
2548 static_psymbols
.size
= total_symbols
/ 10;
2549 global_psymbols
.next
= global_psymbols
.list
= (struct partial_symbol
*)
2550 xmalloc (global_psymbols
.size
* sizeof (struct partial_symbol
));
2551 static_psymbols
.next
= static_psymbols
.list
= (struct partial_symbol
*)
2552 xmalloc (static_psymbols
.size
* sizeof (struct partial_symbol
));
2559 start_psymtab -- allocate and partially fill a partial symtab entry
2563 Allocate and partially fill a partial symtab. It will be completely
2564 filled at the end of the symbol list.
2566 SYMFILE_NAME is the name of the symbol-file we are reading from, and
2567 ADDR is the address relative to which its symbols are (incremental)
2568 or 0 (normal). FILENAME is the name of the compilation unit that
2569 these symbols were defined in, and they appear starting a address
2570 TEXTLOW. DBROFF is the absolute file offset in SYMFILE_NAME where
2571 the full symbols can be read for compilation unit FILENAME.
2572 GLOBAL_SYMS and STATIC_SYMS are pointers to the current end of the
2577 static struct partial_symtab
*
2578 DEFUN(start_psymtab
,
2579 (objfile
, addr
, filename
, textlow
, texthigh
, dbfoff
, curoff
,
2580 culength
, lnfoff
, global_syms
, static_syms
),
2581 struct objfile
*objfile AND
2584 CORE_ADDR textlow AND
2585 CORE_ADDR texthigh AND
2590 struct partial_symbol
*global_syms AND
2591 struct partial_symbol
*static_syms
)
2593 struct partial_symtab
*result
;
2595 result
= (struct partial_symtab
*)
2596 obstack_alloc (psymbol_obstack
, sizeof (struct partial_symtab
));
2597 (void) memset (result
, 0, sizeof (struct partial_symtab
));
2598 result
-> addr
= addr
;
2599 result
-> objfile
= objfile
;
2600 result
-> filename
= create_name (filename
, psymbol_obstack
);
2601 result
-> textlow
= textlow
;
2602 result
-> texthigh
= texthigh
;
2603 result
-> read_symtab_private
= (char *) obstack_alloc (psymbol_obstack
,
2604 sizeof (struct dwfinfo
));
2605 DBFOFF (result
) = dbfoff
;
2606 DBROFF (result
) = curoff
;
2607 DBLENGTH (result
) = culength
;
2608 LNFOFF (result
) = lnfoff
;
2609 result
-> readin
= 0;
2610 result
-> symtab
= NULL
;
2611 result
-> read_symtab
= dwarf_psymtab_to_symtab
;
2612 result
-> globals_offset
= global_syms
- global_psymbols
.list
;
2613 result
-> statics_offset
= static_syms
- static_psymbols
.list
;
2615 result
->n_global_syms
= 0;
2616 result
->n_static_syms
= 0;
2625 add_psymbol_to_list -- add a partial symbol to given list
2629 Add a partial symbol to one of the partial symbol vectors (pointed to
2630 by listp). The vector is grown as necessary.
2635 DEFUN(add_psymbol_to_list
,
2636 (listp
, name
, space
, class, value
),
2637 struct psymbol_allocation_list
*listp AND
2639 enum namespace space AND
2640 enum address_class
class AND
2643 struct partial_symbol
*psym
;
2646 if (listp
-> next
>= listp
-> list
+ listp
-> size
)
2648 newsize
= listp
-> size
* 2;
2649 listp
-> list
= (struct partial_symbol
*)
2650 xrealloc (listp
-> list
, (newsize
* sizeof (struct partial_symbol
)));
2651 /* Next assumes we only went one over. Should be good if program works
2653 listp
-> next
= listp
-> list
+ listp
-> size
;
2654 listp
-> size
= newsize
;
2656 psym
= listp
-> next
++;
2657 SYMBOL_NAME (psym
) = create_name (name
, psymbol_obstack
);
2658 SYMBOL_NAMESPACE (psym
) = space
;
2659 SYMBOL_CLASS (psym
) = class;
2660 SYMBOL_VALUE (psym
) = value
;
2667 add_enum_psymbol -- add enumeration members to partial symbol table
2671 Given pointer to a DIE that is known to be for an enumeration,
2672 extract the symbolic names of the enumeration members and add
2673 partial symbols for them.
2677 DEFUN(add_enum_psymbol
, (dip
), struct dieinfo
*dip
)
2684 if ((scan
= dip
-> at_element_list
) != NULL
)
2686 if (dip
-> short_element_list
)
2688 (void) memcpy (&stemp
, scan
, sizeof (stemp
));
2689 listend
= scan
+ stemp
+ sizeof (stemp
);
2690 scan
+= sizeof (stemp
);
2694 (void) memcpy (<emp
, scan
, sizeof (ltemp
));
2695 listend
= scan
+ ltemp
+ sizeof (ltemp
);
2696 scan
+= sizeof (ltemp
);
2698 while (scan
< listend
)
2700 scan
+= sizeof (long);
2701 add_psymbol_to_list (&static_psymbols
, scan
, VAR_NAMESPACE
,
2703 scan
+= strlen (scan
) + 1;
2712 add_partial_symbol -- add symbol to partial symbol table
2716 Given a DIE, if it is one of the types that we want to
2717 add to a partial symbol table, finish filling in the die info
2718 and then add a partial symbol table entry for it.
2723 DEFUN(add_partial_symbol
, (dip
), struct dieinfo
*dip
)
2725 switch (dip
-> dietag
)
2727 case TAG_global_subroutine
:
2728 record_misc_function (dip
-> at_name
, dip
-> at_low_pc
, mf_text
);
2729 add_psymbol_to_list (&global_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2730 LOC_BLOCK
, dip
-> at_low_pc
);
2732 case TAG_global_variable
:
2733 record_misc_function (dip
-> at_name
, locval (dip
-> at_location
),
2735 add_psymbol_to_list (&global_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2738 case TAG_subroutine
:
2739 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2740 LOC_BLOCK
, dip
-> at_low_pc
);
2742 case TAG_local_variable
:
2743 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2747 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2750 case TAG_structure_type
:
2751 case TAG_union_type
:
2752 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, STRUCT_NAMESPACE
,
2755 case TAG_enumeration_type
:
2758 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
,
2759 STRUCT_NAMESPACE
, LOC_TYPEDEF
, 0);
2761 add_enum_psymbol (dip
);
2770 scan_partial_symbols -- scan DIE's within a single compilation unit
2774 Process the DIE's within a single compilation unit, looking for
2775 interesting DIE's that contribute to the partial symbol table entry
2776 for this compilation unit. Since we cannot follow any sibling
2777 chains without reading the complete DIE info for every DIE,
2778 it is probably faster to just sequentially check each one to
2779 see if it is one of the types we are interested in, and if so,
2780 then extract all the attributes info and generate a partial
2785 Don't attempt to add anonymous structures or unions since they have
2786 no name. Anonymous enumerations however are processed, because we
2787 want to extract their member names (the check for a tag name is
2790 Also, for variables and subroutines, check that this is the place
2791 where the actual definition occurs, rather than just a reference
2796 DEFUN(scan_partial_symbols
, (thisdie
, enddie
), char *thisdie AND
char *enddie
)
2801 while (thisdie
< enddie
)
2803 basicdieinfo (&di
, thisdie
);
2804 if (di
.dielength
< sizeof (long))
2810 nextdie
= thisdie
+ di
.dielength
;
2811 /* To avoid getting complete die information for every die, we
2812 only do it (below) for the cases we are interested in. */
2815 case TAG_global_subroutine
:
2816 case TAG_subroutine
:
2817 case TAG_global_variable
:
2818 case TAG_local_variable
:
2819 completedieinfo (&di
);
2820 if (di
.at_name
&& (di
.has_at_low_pc
|| di
.at_location
))
2822 add_partial_symbol (&di
);
2826 case TAG_structure_type
:
2827 case TAG_union_type
:
2828 completedieinfo (&di
);
2831 add_partial_symbol (&di
);
2834 case TAG_enumeration_type
:
2835 completedieinfo (&di
);
2836 add_partial_symbol (&di
);
2848 scan_compilation_units -- build a psymtab entry for each compilation
2852 This is the top level dwarf parsing routine for building partial
2855 It scans from the beginning of the DWARF table looking for the first
2856 TAG_compile_unit DIE, and then follows the sibling chain to locate
2857 each additional TAG_compile_unit DIE.
2859 For each TAG_compile_unit DIE it creates a partial symtab structure,
2860 calls a subordinate routine to collect all the compilation unit's
2861 global DIE's, file scope DIEs, typedef DIEs, etc, and then links the
2862 new partial symtab structure into the partial symbol table. It also
2863 records the appropriate information in the partial symbol table entry
2864 to allow the chunk of DIE's and line number table for this compilation
2865 unit to be located and re-read later, to generate a complete symbol
2866 table entry for the compilation unit.
2868 Thus it effectively partitions up a chunk of DIE's for multiple
2869 compilation units into smaller DIE chunks and line number tables,
2870 and associates them with a partial symbol table entry.
2874 If any compilation unit has no line number table associated with
2875 it for some reason (a missing at_stmt_list attribute, rather than
2876 just one with a value of zero, which is valid) then we ensure that
2877 the recorded file offset is zero so that the routine which later
2878 reads line number table fragments knows that there is no fragment
2888 DEFUN(scan_compilation_units
,
2889 (filename
, addr
, thisdie
, enddie
, dbfoff
, lnoffset
, objfile
),
2894 unsigned int dbfoff AND
2895 unsigned int lnoffset AND
2896 struct objfile
*objfile
)
2900 struct partial_symtab
*pst
;
2905 while (thisdie
< enddie
)
2907 basicdieinfo (&di
, thisdie
);
2908 if (di
.dielength
< sizeof (long))
2912 else if (di
.dietag
!= TAG_compile_unit
)
2914 nextdie
= thisdie
+ di
.dielength
;
2918 completedieinfo (&di
);
2919 if (di
.at_sibling
!= 0)
2921 nextdie
= dbbase
+ di
.at_sibling
- dbroff
;
2925 nextdie
= thisdie
+ di
.dielength
;
2927 curoff
= thisdie
- dbbase
;
2928 culength
= nextdie
- thisdie
;
2929 curlnoffset
= di
.has_at_stmt_list
? lnoffset
+ di
.at_stmt_list
: 0;
2930 pst
= start_psymtab (objfile
, addr
, di
.at_name
,
2931 di
.at_low_pc
, di
.at_high_pc
,
2932 dbfoff
, curoff
, culength
, curlnoffset
,
2933 global_psymbols
.next
,
2934 static_psymbols
.next
);
2935 scan_partial_symbols (thisdie
+ di
.dielength
, nextdie
);
2936 pst
-> n_global_syms
= global_psymbols
.next
-
2937 (global_psymbols
.list
+ pst
-> globals_offset
);
2938 pst
-> n_static_syms
= static_psymbols
.next
-
2939 (static_psymbols
.list
+ pst
-> statics_offset
);
2940 /* Sort the global list; don't sort the static list */
2941 qsort (global_psymbols
.list
+ pst
-> globals_offset
,
2942 pst
-> n_global_syms
, sizeof (struct partial_symbol
),
2944 /* If there is already a psymtab or symtab for a file of this name,
2945 remove it. (If there is a symtab, more drastic things also
2946 happen.) This happens in VxWorks. */
2947 free_named_symtabs (pst
-> filename
);
2948 /* Place the partial symtab on the partial symtab list */
2949 pst
-> next
= partial_symtab_list
;
2950 partial_symtab_list
= pst
;
2960 new_symbol -- make a symbol table entry for a new symbol
2964 static struct symbol *new_symbol (struct dieinfo *dip)
2968 Given a pointer to a DWARF information entry, figure out if we need
2969 to make a symbol table entry for it, and if so, create a new entry
2970 and return a pointer to it.
2973 static struct symbol
*
2974 DEFUN(new_symbol
, (dip
), struct dieinfo
*dip
)
2976 struct symbol
*sym
= NULL
;
2978 if (dip
-> at_name
!= NULL
)
2980 sym
= (struct symbol
*) obstack_alloc (symbol_obstack
,
2981 sizeof (struct symbol
));
2982 (void) memset (sym
, 0, sizeof (struct symbol
));
2983 SYMBOL_NAME (sym
) = create_name (dip
-> at_name
, symbol_obstack
);
2984 /* default assumptions */
2985 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
2986 SYMBOL_CLASS (sym
) = LOC_STATIC
;
2987 SYMBOL_TYPE (sym
) = decode_die_type (dip
);
2988 switch (dip
-> dietag
)
2991 SYMBOL_VALUE (sym
) = dip
-> at_low_pc
+ baseaddr
;
2992 SYMBOL_CLASS (sym
) = LOC_LABEL
;
2994 case TAG_global_subroutine
:
2995 case TAG_subroutine
:
2996 SYMBOL_VALUE (sym
) = dip
-> at_low_pc
+ baseaddr
;
2997 SYMBOL_TYPE (sym
) = lookup_function_type (SYMBOL_TYPE (sym
));
2998 SYMBOL_CLASS (sym
) = LOC_BLOCK
;
2999 if (dip
-> dietag
== TAG_global_subroutine
)
3001 add_symbol_to_list (sym
, &global_symbols
);
3005 add_symbol_to_list (sym
, &scope
-> symbols
);
3008 case TAG_global_variable
:
3009 case TAG_local_variable
:
3010 if (dip
-> at_location
!= NULL
)
3012 SYMBOL_VALUE (sym
) = locval (dip
-> at_location
);
3014 if (dip
-> dietag
== TAG_global_variable
)
3016 add_symbol_to_list (sym
, &global_symbols
);
3017 SYMBOL_CLASS (sym
) = LOC_STATIC
;
3018 SYMBOL_VALUE (sym
) += baseaddr
;
3022 add_symbol_to_list (sym
, &scope
-> symbols
);
3023 if (scope
-> parent
!= NULL
)
3027 SYMBOL_CLASS (sym
) = LOC_REGISTER
;
3031 SYMBOL_CLASS (sym
) = LOC_LOCAL
;
3036 SYMBOL_CLASS (sym
) = LOC_STATIC
;
3037 SYMBOL_VALUE (sym
) += baseaddr
;
3041 case TAG_formal_parameter
:
3042 if (dip
-> at_location
!= NULL
)
3044 SYMBOL_VALUE (sym
) = locval (dip
-> at_location
);
3046 add_symbol_to_list (sym
, &scope
-> symbols
);
3049 SYMBOL_CLASS (sym
) = LOC_REGPARM
;
3053 SYMBOL_CLASS (sym
) = LOC_ARG
;
3056 case TAG_unspecified_parameters
:
3057 /* From varargs functions; gdb doesn't seem to have any interest in
3058 this information, so just ignore it for now. (FIXME?) */
3060 case TAG_structure_type
:
3061 case TAG_union_type
:
3062 case TAG_enumeration_type
:
3063 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
3064 SYMBOL_NAMESPACE (sym
) = STRUCT_NAMESPACE
;
3065 add_symbol_to_list (sym
, &scope
-> symbols
);
3068 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
3069 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
3070 add_symbol_to_list (sym
, &scope
-> symbols
);
3073 /* Not a tag we recognize. Hopefully we aren't processing trash
3074 data, but since we must specifically ignore things we don't
3075 recognize, there is nothing else we should do at this point. */
3086 decode_mod_fund_type -- decode a modified fundamental type
3090 static struct type *decode_mod_fund_type (char *typedata)
3094 Decode a block of data containing a modified fundamental
3095 type specification. TYPEDATA is a pointer to the block,
3096 which consists of a two byte length, containing the size
3097 of the rest of the block. At the end of the block is a
3098 two byte value that gives the fundamental type. Everything
3099 in between are type modifiers.
3101 We simply compute the number of modifiers and call the general
3102 function decode_modified_type to do the actual work.
3105 static struct type
*
3106 DEFUN(decode_mod_fund_type
, (typedata
), char *typedata
)
3108 struct type
*typep
= NULL
;
3109 unsigned short modcount
;
3110 unsigned char *modifiers
;
3112 /* Get the total size of the block, exclusive of the size itself */
3113 (void) memcpy (&modcount
, typedata
, sizeof (short));
3114 /* Deduct the size of the fundamental type bytes at the end of the block. */
3115 modcount
-= sizeof (short);
3116 /* Skip over the two size bytes at the beginning of the block. */
3117 modifiers
= (unsigned char *) typedata
+ sizeof (short);
3118 /* Now do the actual decoding */
3119 typep
= decode_modified_type (modifiers
, modcount
, AT_mod_fund_type
);
3127 decode_mod_u_d_type -- decode a modified user defined type
3131 static struct type *decode_mod_u_d_type (char *typedata)
3135 Decode a block of data containing a modified user defined
3136 type specification. TYPEDATA is a pointer to the block,
3137 which consists of a two byte length, containing the size
3138 of the rest of the block. At the end of the block is a
3139 four byte value that gives a reference to a user defined type.
3140 Everything in between are type modifiers.
3142 We simply compute the number of modifiers and call the general
3143 function decode_modified_type to do the actual work.
3146 static struct type
*
3147 DEFUN(decode_mod_u_d_type
, (typedata
), char *typedata
)
3149 struct type
*typep
= NULL
;
3150 unsigned short modcount
;
3151 unsigned char *modifiers
;
3153 /* Get the total size of the block, exclusive of the size itself */
3154 (void) memcpy (&modcount
, typedata
, sizeof (short));
3155 /* Deduct the size of the reference type bytes at the end of the block. */
3156 modcount
-= sizeof (long);
3157 /* Skip over the two size bytes at the beginning of the block. */
3158 modifiers
= (unsigned char *) typedata
+ sizeof (short);
3159 /* Now do the actual decoding */
3160 typep
= decode_modified_type (modifiers
, modcount
, AT_mod_u_d_type
);
3168 decode_modified_type -- decode modified user or fundamental type
3172 static struct type *decode_modified_type (unsigned char *modifiers,
3173 unsigned short modcount, int mtype)
3177 Decode a modified type, either a modified fundamental type or
3178 a modified user defined type. MODIFIERS is a pointer to the
3179 block of bytes that define MODCOUNT modifiers. Immediately
3180 following the last modifier is a short containing the fundamental
3181 type or a long containing the reference to the user defined
3182 type. Which one is determined by MTYPE, which is either
3183 AT_mod_fund_type or AT_mod_u_d_type to indicate what modified
3184 type we are generating.
3186 We call ourself recursively to generate each modified type,`
3187 until MODCOUNT reaches zero, at which point we have consumed
3188 all the modifiers and generate either the fundamental type or
3189 user defined type. When the recursion unwinds, each modifier
3190 is applied in turn to generate the full modified type.
3194 If we find a modifier that we don't recognize, and it is not one
3195 of those reserved for application specific use, then we issue a
3196 warning and simply ignore the modifier.
3200 We currently ignore MOD_const and MOD_volatile. (FIXME)
3204 static struct type
*
3205 DEFUN(decode_modified_type
,
3206 (modifiers
, modcount
, mtype
),
3207 unsigned char *modifiers AND
unsigned short modcount AND
int mtype
)
3209 struct type
*typep
= NULL
;
3210 unsigned short fundtype
;
3212 unsigned char modifier
;
3218 case AT_mod_fund_type
:
3219 (void) memcpy (&fundtype
, modifiers
, sizeof (short));
3220 typep
= decode_fund_type (fundtype
);
3222 case AT_mod_u_d_type
:
3223 (void) memcpy (&dieref
, modifiers
, sizeof (DIEREF
));
3224 if ((typep
= lookup_utype (dieref
)) == NULL
)
3226 typep
= alloc_utype (dieref
, NULL
);
3230 SQUAWK (("botched modified type decoding (mtype 0x%x)", mtype
));
3231 typep
= builtin_type_int
;
3237 modifier
= *modifiers
++;
3238 typep
= decode_modified_type (modifiers
, --modcount
, mtype
);
3241 case MOD_pointer_to
:
3242 typep
= lookup_pointer_type (typep
);
3244 case MOD_reference_to
:
3245 typep
= lookup_reference_type (typep
);
3248 SQUAWK (("type modifier 'const' ignored")); /* FIXME */
3251 SQUAWK (("type modifier 'volatile' ignored")); /* FIXME */
3254 if (!(MOD_lo_user
<= modifier
&& modifier
<= MOD_hi_user
))
3256 SQUAWK (("unknown type modifier %u", modifier
));
3268 decode_fund_type -- translate basic DWARF type to gdb base type
3272 Given an integer that is one of the fundamental DWARF types,
3273 translate it to one of the basic internal gdb types and return
3274 a pointer to the appropriate gdb type (a "struct type *").
3278 If we encounter a fundamental type that we are unprepared to
3279 deal with, and it is not in the range of those types defined
3280 as application specific types, then we issue a warning and
3281 treat the type as builtin_type_int.
3284 static struct type
*
3285 DEFUN(decode_fund_type
, (fundtype
), unsigned short fundtype
)
3287 struct type
*typep
= NULL
;
3293 typep
= builtin_type_void
;
3296 case FT_pointer
: /* (void *) */
3297 typep
= lookup_pointer_type (builtin_type_void
);
3301 case FT_signed_char
:
3302 typep
= builtin_type_char
;
3306 case FT_signed_short
:
3307 typep
= builtin_type_short
;
3311 case FT_signed_integer
:
3312 case FT_boolean
: /* Was FT_set in AT&T version */
3313 typep
= builtin_type_int
;
3317 case FT_signed_long
:
3318 typep
= builtin_type_long
;
3322 typep
= builtin_type_float
;
3325 case FT_dbl_prec_float
:
3326 typep
= builtin_type_double
;
3329 case FT_unsigned_char
:
3330 typep
= builtin_type_unsigned_char
;
3333 case FT_unsigned_short
:
3334 typep
= builtin_type_unsigned_short
;
3337 case FT_unsigned_integer
:
3338 typep
= builtin_type_unsigned_int
;
3341 case FT_unsigned_long
:
3342 typep
= builtin_type_unsigned_long
;
3345 case FT_ext_prec_float
:
3346 typep
= builtin_type_long_double
;
3350 typep
= builtin_type_complex
;
3353 case FT_dbl_prec_complex
:
3354 typep
= builtin_type_double_complex
;
3358 case FT_signed_long_long
:
3359 typep
= builtin_type_long_long
;
3362 case FT_unsigned_long_long
:
3363 typep
= builtin_type_unsigned_long_long
;
3368 if ((typep
== NULL
) && !(FT_lo_user
<= fundtype
&& fundtype
<= FT_hi_user
))
3370 SQUAWK (("unexpected fundamental type 0x%x", fundtype
));
3371 typep
= builtin_type_void
;
3381 create_name -- allocate a fresh copy of a string on an obstack
3385 Given a pointer to a string and a pointer to an obstack, allocates
3386 a fresh copy of the string on the specified obstack.
3391 DEFUN(create_name
, (name
, obstackp
), char *name AND
struct obstack
*obstackp
)
3396 length
= strlen (name
) + 1;
3397 newname
= (char *) obstack_alloc (obstackp
, length
);
3398 (void) strcpy (newname
, name
);
3406 basicdieinfo -- extract the minimal die info from raw die data
3410 void basicdieinfo (char *diep, struct dieinfo *dip)
3414 Given a pointer to raw DIE data, and a pointer to an instance of a
3415 die info structure, this function extracts the basic information
3416 from the DIE data required to continue processing this DIE, along
3417 with some bookkeeping information about the DIE.
3419 The information we absolutely must have includes the DIE tag,
3420 and the DIE length. If we need the sibling reference, then we
3421 will have to call completedieinfo() to process all the remaining
3424 Note that since there is no guarantee that the data is properly
3425 aligned in memory for the type of access required (indirection
3426 through anything other than a char pointer), we use memcpy to
3427 shuffle data items larger than a char. Possibly inefficient, but
3430 We also take care of some other basic things at this point, such
3431 as ensuring that the instance of the die info structure starts
3432 out completely zero'd and that curdie is initialized for use
3433 in error reporting if we have a problem with the current die.
3437 All DIE's must have at least a valid length, thus the minimum
3438 DIE size is sizeof (long). In order to have a valid tag, the
3439 DIE size must be at least sizeof (short) larger, otherwise they
3440 are forced to be TAG_padding DIES.
3442 Padding DIES must be at least sizeof(long) in length, implying that
3443 if a padding DIE is used for alignment and the amount needed is less
3444 than sizeof(long) then the padding DIE has to be big enough to align
3445 to the next alignment boundry.
3449 DEFUN(basicdieinfo
, (dip
, diep
), struct dieinfo
*dip AND
char *diep
)
3452 (void) memset (dip
, 0, sizeof (struct dieinfo
));
3454 dip
-> dieref
= dbroff
+ (diep
- dbbase
);
3455 (void) memcpy (&dip
-> dielength
, diep
, sizeof (long));
3456 if (dip
-> dielength
< sizeof (long))
3458 dwarfwarn ("malformed DIE, bad length (%d bytes)", dip
-> dielength
);
3460 else if (dip
-> dielength
< (sizeof (long) + sizeof (short)))
3462 dip
-> dietag
= TAG_padding
;
3466 (void) memcpy (&dip
-> dietag
, diep
+ sizeof (long), sizeof (short));
3474 completedieinfo -- finish reading the information for a given DIE
3478 void completedieinfo (struct dieinfo *dip)
3482 Given a pointer to an already partially initialized die info structure,
3483 scan the raw DIE data and finish filling in the die info structure
3484 from the various attributes found.
3486 Note that since there is no guarantee that the data is properly
3487 aligned in memory for the type of access required (indirection
3488 through anything other than a char pointer), we use memcpy to
3489 shuffle data items larger than a char. Possibly inefficient, but
3494 Each time we are called, we increment the diecount variable, which
3495 keeps an approximate count of the number of dies processed for
3496 each compilation unit. This information is presented to the user
3497 if the info_verbose flag is set.
3502 DEFUN(completedieinfo
, (dip
), struct dieinfo
*dip
)
3504 char *diep
; /* Current pointer into raw DIE data */
3505 char *end
; /* Terminate DIE scan here */
3506 unsigned short attr
; /* Current attribute being scanned */
3507 unsigned short form
; /* Form of the attribute */
3508 short block2sz
; /* Size of a block2 attribute field */
3509 long block4sz
; /* Size of a block4 attribute field */
3513 end
= diep
+ dip
-> dielength
;
3514 diep
+= sizeof (long) + sizeof (short);
3517 (void) memcpy (&attr
, diep
, sizeof (short));
3518 diep
+= sizeof (short);
3522 (void) memcpy (&dip
-> at_fund_type
, diep
, sizeof (short));
3525 (void) memcpy (&dip
-> at_ordering
, diep
, sizeof (short));
3528 (void) memcpy (&dip
-> at_bit_offset
, diep
, sizeof (short));
3531 (void) memcpy (&dip
-> at_visibility
, diep
, sizeof (short));
3534 (void) memcpy (&dip
-> at_sibling
, diep
, sizeof (long));
3537 (void) memcpy (&dip
-> at_stmt_list
, diep
, sizeof (long));
3538 dip
-> has_at_stmt_list
= 1;
3541 (void) memcpy (&dip
-> at_low_pc
, diep
, sizeof (long));
3542 dip
-> has_at_low_pc
= 1;
3545 (void) memcpy (&dip
-> at_high_pc
, diep
, sizeof (long));
3548 (void) memcpy (&dip
-> at_language
, diep
, sizeof (long));
3550 case AT_user_def_type
:
3551 (void) memcpy (&dip
-> at_user_def_type
, diep
, sizeof (long));
3554 (void) memcpy (&dip
-> at_byte_size
, diep
, sizeof (long));
3557 (void) memcpy (&dip
-> at_bit_size
, diep
, sizeof (long));
3560 (void) memcpy (&dip
-> at_member
, diep
, sizeof (long));
3563 (void) memcpy (&dip
-> at_discr
, diep
, sizeof (long));
3566 (void) memcpy (&dip
-> at_import
, diep
, sizeof (long));
3569 dip
-> at_location
= diep
;
3571 case AT_mod_fund_type
:
3572 dip
-> at_mod_fund_type
= diep
;
3574 case AT_subscr_data
:
3575 dip
-> at_subscr_data
= diep
;
3577 case AT_mod_u_d_type
:
3578 dip
-> at_mod_u_d_type
= diep
;
3580 case AT_element_list
:
3581 dip
-> at_element_list
= diep
;
3582 dip
-> short_element_list
= 0;
3584 case AT_short_element_list
:
3585 dip
-> at_element_list
= diep
;
3586 dip
-> short_element_list
= 1;
3588 case AT_discr_value
:
3589 dip
-> at_discr_value
= diep
;
3591 case AT_string_length
:
3592 dip
-> at_string_length
= diep
;
3595 dip
-> at_name
= diep
;
3598 dip
-> at_comp_dir
= diep
;
3601 dip
-> at_producer
= diep
;
3604 (void) memcpy (&dip
-> at_frame_base
, diep
, sizeof (long));
3606 case AT_start_scope
:
3607 (void) memcpy (&dip
-> at_start_scope
, diep
, sizeof (long));
3609 case AT_stride_size
:
3610 (void) memcpy (&dip
-> at_stride_size
, diep
, sizeof (long));
3613 (void) memcpy (&dip
-> at_src_info
, diep
, sizeof (long));
3616 (void) memcpy (&dip
-> at_prototyped
, diep
, sizeof (short));
3619 /* Found an attribute that we are unprepared to handle. However
3620 it is specifically one of the design goals of DWARF that
3621 consumers should ignore unknown attributes. As long as the
3622 form is one that we recognize (so we know how to skip it),
3623 we can just ignore the unknown attribute. */
3630 diep
+= sizeof (short);
3633 diep
+= sizeof (long);
3636 diep
+= 8 * sizeof (char); /* sizeof (long long) ? */
3640 diep
+= sizeof (long);
3643 (void) memcpy (&block2sz
, diep
, sizeof (short));
3644 block2sz
+= sizeof (short);
3648 (void) memcpy (&block4sz
, diep
, sizeof (long));
3649 block4sz
+= sizeof (long);
3653 diep
+= strlen (diep
) + 1;
3656 SQUAWK (("unknown attribute form (0x%x), skipped rest", form
));