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 pointers to the raw die data
878 that define the range of dies which define the members, compute
879 and return the user defined type for the structure or union.
883 DEFUN(struct_type
, (dip
, thisdie
, enddie
, objfile
),
884 struct dieinfo
*dip AND
887 struct objfile
*objfile
)
891 struct nextfield
*next
;
894 struct nextfield
*list
= NULL
;
895 struct nextfield
*new;
904 if ((type
= lookup_utype (dip
-> dieref
)) == NULL
)
906 type
= alloc_utype (dip
-> dieref
, NULL
);
908 if (dip
-> dietag
== TAG_structure_type
|| dip
-> dietag
== TAG_union_type
)
910 TYPE_CPLUS_SPECIFIC (type
) = (struct cplus_struct_type
*)
911 obstack_alloc (symbol_obstack
, sizeof (struct cplus_struct_type
));
912 (void) memset (TYPE_CPLUS_SPECIFIC (type
), 0,
913 sizeof (struct cplus_struct_type
));
914 if (dip
-> dietag
== TAG_structure_type
)
916 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
921 TYPE_CODE (type
) = TYPE_CODE_UNION
;
928 SQUAWK (("missing structure or union tag"));
929 TYPE_CODE (type
) = TYPE_CODE_UNDEF
;
931 /* Some compilers try to be helpful by inventing "fake" names for anonymous
932 enums, structures, and unions, like "~0fake". Thanks, but no thanks. */
933 if (dip
-> at_name
== NULL
934 || *dip
-> at_name
== '~'
935 || *dip
-> at_name
== '.')
941 tpart2
= dip
-> at_name
;
943 if (dip
-> at_byte_size
== 0)
945 tpart3
= " <opaque>";
947 TYPE_LENGTH (type
) = dip
-> at_byte_size
;
950 TYPE_NAME (type
) = concat (tpart1
, tpart2
, tpart3
, NULL
);
951 thisdie
+= dip
-> dielength
;
952 while (thisdie
< enddie
)
954 basicdieinfo (&mbr
, thisdie
);
955 completedieinfo (&mbr
);
956 if (mbr
.dielength
<= sizeof (long))
960 else if (mbr
.at_sibling
!= 0)
962 nextdie
= dbbase
+ mbr
.at_sibling
- dbroff
;
966 nextdie
= thisdie
+ mbr
.dielength
;
971 /* Get space to record the next field's data. */
972 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
976 list
-> field
.name
= savestring (mbr
.at_name
, strlen (mbr
.at_name
));
977 list
-> field
.type
= decode_die_type (&mbr
);
978 list
-> field
.bitpos
= 8 * locval (mbr
.at_location
);
979 list
-> field
.bitsize
= 0;
983 process_dies (thisdie
, nextdie
, objfile
);
988 /* Now create the vector of fields, and record how big it is. */
989 TYPE_NFIELDS (type
) = nfields
;
990 TYPE_FIELDS (type
) = (struct field
*)
991 obstack_alloc (symbol_obstack
, sizeof (struct field
) * nfields
);
992 /* Copy the saved-up fields into the field vector. */
993 for (n
= nfields
; list
; list
= list
-> next
)
995 TYPE_FIELD (type
, --n
) = list
-> field
;
1004 read_structure_scope -- process all dies within struct or union
1008 static void read_structure_scope (struct dieinfo *dip,
1009 char *thisdie, char *enddie, struct objfile *objfile)
1013 Called when we find the DIE that starts a structure or union
1014 scope (definition) to process all dies that define the members
1015 of the structure or union. DIP is a pointer to the die info
1016 struct for the DIE that names the structure or union.
1020 Note that we need to call struct_type regardless of whether or not
1021 we have a symbol, since we might have a structure or union without
1022 a tag name (thus no symbol for the tagname).
1026 DEFUN(read_structure_scope
, (dip
, thisdie
, enddie
, objfile
),
1027 struct dieinfo
*dip AND
1030 struct objfile
*objfile
)
1035 type
= struct_type (dip
, thisdie
, enddie
, objfile
);
1036 if ((sym
= new_symbol (dip
)) != NULL
)
1038 SYMBOL_TYPE (sym
) = type
;
1046 decode_array_element_type -- decode type of the array elements
1050 static struct type *decode_array_element_type (char *scan, char *end)
1054 As the last step in decoding the array subscript information for an
1055 array DIE, we need to decode the type of the array elements. We are
1056 passed a pointer to this last part of the subscript information and
1057 must return the appropriate type. If the type attribute is not
1058 recognized, just warn about the problem and return type int.
1061 static struct type
*
1062 DEFUN(decode_array_element_type
, (scan
, end
), char *scan AND
char *end
)
1067 unsigned short fundtype
;
1069 (void) memcpy (&attribute
, scan
, sizeof (short));
1070 scan
+= sizeof (short);
1074 (void) memcpy (&fundtype
, scan
, sizeof (short));
1075 typep
= decode_fund_type (fundtype
);
1077 case AT_mod_fund_type
:
1078 typep
= decode_mod_fund_type (scan
);
1080 case AT_user_def_type
:
1081 (void) memcpy (&dieref
, scan
, sizeof (DIEREF
));
1082 if ((typep
= lookup_utype (dieref
)) == NULL
)
1084 typep
= alloc_utype (dieref
, NULL
);
1087 case AT_mod_u_d_type
:
1088 typep
= decode_mod_u_d_type (scan
);
1091 SQUAWK (("bad array element type attribute 0x%x", attribute
));
1092 typep
= builtin_type_int
;
1102 decode_subscr_data -- decode array subscript and element type data
1106 static struct type *decode_subscr_data (char *scan, char *end)
1110 The array subscripts and the data type of the elements of an
1111 array are described by a list of data items, stored as a block
1112 of contiguous bytes. There is a data item describing each array
1113 dimension, and a final data item describing the element type.
1114 The data items are ordered the same as their appearance in the
1115 source (I.E. leftmost dimension first, next to leftmost second,
1118 We are passed a pointer to the start of the block of bytes
1119 containing the data items, and a pointer to the first byte past
1120 the data. This function decodes the data and returns a type.
1123 FIXME: This code only implements the forms currently used
1124 by the AT&T and GNU C compilers.
1126 The end pointer is supplied for error checking, maybe we should
1130 static struct type
*
1131 DEFUN(decode_subscr_data
, (scan
, end
), char *scan AND
char *end
)
1133 struct type
*typep
= NULL
;
1134 struct type
*nexttype
;
1144 typep
= decode_array_element_type (scan
, end
);
1147 (void) memcpy (&fundtype
, scan
, sizeof (short));
1148 scan
+= sizeof (short);
1149 if (fundtype
!= FT_integer
&& fundtype
!= FT_signed_integer
1150 && fundtype
!= FT_unsigned_integer
)
1152 SQUAWK (("array subscripts must be integral types, not type 0x%x",
1157 (void) memcpy (&lowbound
, scan
, sizeof (long));
1158 scan
+= sizeof (long);
1159 (void) memcpy (&highbound
, scan
, sizeof (long));
1160 scan
+= sizeof (long);
1161 nexttype
= decode_subscr_data (scan
, end
);
1162 if (nexttype
!= NULL
)
1164 typep
= (struct type
*)
1165 obstack_alloc (symbol_obstack
, sizeof (struct type
));
1166 (void) memset (typep
, 0, sizeof (struct type
));
1167 TYPE_CODE (typep
) = TYPE_CODE_ARRAY
;
1168 TYPE_LENGTH (typep
) = TYPE_LENGTH (nexttype
);
1169 TYPE_LENGTH (typep
) *= lowbound
+ highbound
+ 1;
1170 TYPE_TARGET_TYPE (typep
) = nexttype
;
1181 SQUAWK (("array subscript format 0x%x not handled yet", format
));
1184 SQUAWK (("unknown array subscript format %x", format
));
1194 read_array_type -- read TAG_array_type DIE
1198 static void read_array_type (struct dieinfo *dip)
1202 Extract all information from a TAG_array_type DIE and add to
1203 the user defined type vector.
1207 DEFUN(read_array_type
, (dip
), struct dieinfo
*dip
)
1214 if (dip
-> at_ordering
!= ORD_row_major
)
1216 /* FIXME: Can gdb even handle column major arrays? */
1217 SQUAWK (("array not row major; not handled correctly"));
1219 if ((sub
= dip
-> at_subscr_data
) != NULL
)
1221 (void) memcpy (&temp
, sub
, sizeof (short));
1222 subend
= sub
+ sizeof (short) + temp
;
1223 sub
+= sizeof (short);
1224 type
= decode_subscr_data (sub
, subend
);
1227 type
= alloc_utype (dip
-> dieref
, NULL
);
1228 TYPE_CODE (type
) = TYPE_CODE_ARRAY
;
1229 TYPE_TARGET_TYPE (type
) = builtin_type_int
;
1230 TYPE_LENGTH (type
) = 1 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
));
1234 type
= alloc_utype (dip
-> dieref
, type
);
1243 read_subroutine_type -- process TAG_subroutine_type dies
1247 static void read_subroutine_type (struct dieinfo *dip, char thisdie,
1252 Handle DIES due to C code like:
1255 int (*funcp)(int a, long l); (Generates TAG_subroutine_type DIE)
1261 The parameter DIES are currently ignored. See if gdb has a way to
1262 include this info in it's type system, and decode them if so. Is
1263 this what the type structure's "arg_types" field is for? (FIXME)
1267 DEFUN(read_subroutine_type
, (dip
, thisdie
, enddie
),
1268 struct dieinfo
*dip AND
1274 type
= decode_die_type (dip
);
1275 type
= lookup_function_type (type
);
1276 type
= alloc_utype (dip
-> dieref
, type
);
1283 read_enumeration -- process dies which define an enumeration
1287 static void read_enumeration (struct dieinfo *dip, char *thisdie,
1292 Given a pointer to a die which begins an enumeration, process all
1293 the dies that define the members of the enumeration.
1297 Note that we need to call enum_type regardless of whether or not we
1298 have a symbol, since we might have an enum without a tag name (thus
1299 no symbol for the tagname).
1303 DEFUN(read_enumeration
, (dip
, thisdie
, enddie
),
1304 struct dieinfo
*dip AND
1311 type
= enum_type (dip
);
1312 if ((sym
= new_symbol (dip
)) != NULL
)
1314 SYMBOL_TYPE (sym
) = type
;
1322 enum_type -- decode and return a type for an enumeration
1326 static type *enum_type (struct dieinfo *dip)
1330 Given a pointer to a die information structure for the die which
1331 starts an enumeration, process all the dies that define the members
1332 of the enumeration and return a type pointer for the enumeration.
1335 static struct type
*
1336 DEFUN(enum_type
, (dip
), struct dieinfo
*dip
)
1340 struct nextfield
*next
;
1343 struct nextfield
*list
= NULL
;
1344 struct nextfield
*new;
1355 if ((type
= lookup_utype (dip
-> dieref
)) == NULL
)
1357 type
= alloc_utype (dip
-> dieref
, NULL
);
1359 TYPE_CODE (type
) = TYPE_CODE_ENUM
;
1361 /* Some compilers try to be helpful by inventing "fake" names for anonymous
1362 enums, structures, and unions, like "~0fake". Thanks, but no thanks. */
1363 if (dip
-> at_name
== NULL
1364 || *dip
-> at_name
== '~'
1365 || *dip
-> at_name
== '.')
1369 tpart2
= dip
-> at_name
;
1371 if (dip
-> at_byte_size
== 0)
1373 tpart3
= " <opaque>";
1377 TYPE_LENGTH (type
) = dip
-> at_byte_size
;
1380 TYPE_NAME (type
) = concat (tpart1
, tpart2
, tpart3
, NULL
);
1381 if ((scan
= dip
-> at_element_list
) != NULL
)
1383 if (dip
-> short_element_list
)
1385 (void) memcpy (&stemp
, scan
, sizeof (stemp
));
1386 listend
= scan
+ stemp
+ sizeof (stemp
);
1387 scan
+= sizeof (stemp
);
1391 (void) memcpy (<emp
, scan
, sizeof (ltemp
));
1392 listend
= scan
+ ltemp
+ sizeof (ltemp
);
1393 scan
+= sizeof (ltemp
);
1395 while (scan
< listend
)
1397 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
1400 list
-> field
.type
= NULL
;
1401 list
-> field
.bitsize
= 0;
1402 (void) memcpy (&list
-> field
.bitpos
, scan
, sizeof (long));
1403 scan
+= sizeof (long);
1404 list
-> field
.name
= savestring (scan
, strlen (scan
));
1405 scan
+= strlen (scan
) + 1;
1409 /* Now create the vector of fields, and record how big it is. */
1410 TYPE_NFIELDS (type
) = nfields
;
1411 TYPE_FIELDS (type
) = (struct field
*)
1412 obstack_alloc (symbol_obstack
, sizeof (struct field
) * nfields
);
1413 /* Copy the saved-up fields into the field vector. */
1414 for (n
= nfields
; list
; list
= list
-> next
)
1416 TYPE_FIELD (type
, --n
) = list
-> field
;
1425 read_func_scope -- process all dies within a function scope
1429 Process all dies within a given function scope. We are passed
1430 a die information structure pointer DIP for the die which
1431 starts the function scope, and pointers into the raw die data
1432 that define the dies within the function scope.
1434 For now, we ignore lexical block scopes within the function.
1435 The problem is that AT&T cc does not define a DWARF lexical
1436 block scope for the function itself, while gcc defines a
1437 lexical block scope for the function. We need to think about
1438 how to handle this difference, or if it is even a problem.
1443 DEFUN(read_func_scope
, (dip
, thisdie
, enddie
, objfile
),
1444 struct dieinfo
*dip AND
1447 struct objfile
*objfile
)
1451 if (entry_point
>= dip
-> at_low_pc
&& entry_point
< dip
-> at_high_pc
)
1453 entry_scope_lowpc
= dip
-> at_low_pc
;
1454 entry_scope_highpc
= dip
-> at_high_pc
;
1456 if (strcmp (dip
-> at_name
, "main") == 0) /* FIXME: hardwired name */
1458 main_scope_lowpc
= dip
-> at_low_pc
;
1459 main_scope_highpc
= dip
-> at_high_pc
;
1461 sym
= new_symbol (dip
);
1462 openscope (sym
, dip
-> at_low_pc
, dip
-> at_high_pc
);
1463 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
1471 read_file_scope -- process all dies within a file scope
1475 Process all dies within a given file scope. We are passed a
1476 pointer to the die information structure for the die which
1477 starts the file scope, and pointers into the raw die data which
1478 mark the range of dies within the file scope.
1480 When the partial symbol table is built, the file offset for the line
1481 number table for each compilation unit is saved in the partial symbol
1482 table entry for that compilation unit. As the symbols for each
1483 compilation unit are read, the line number table is read into memory
1484 and the variable lnbase is set to point to it. Thus all we have to
1485 do is use lnbase to access the line number table for the current
1490 DEFUN(read_file_scope
, (dip
, thisdie
, enddie
, objfile
),
1491 struct dieinfo
*dip AND
1494 struct objfile
*objfile
)
1496 struct cleanup
*back_to
;
1498 if (entry_point
>= dip
-> at_low_pc
&& entry_point
< dip
-> at_high_pc
)
1500 startup_file_start
= dip
-> at_low_pc
;
1501 startup_file_end
= dip
-> at_high_pc
;
1503 numutypes
= (enddie
- thisdie
) / 4;
1504 utypes
= (struct type
**) xmalloc (numutypes
* sizeof (struct type
*));
1505 back_to
= make_cleanup (free
, utypes
);
1506 (void) memset (utypes
, 0, numutypes
* sizeof (struct type
*));
1508 openscope (NULL
, dip
-> at_low_pc
, dip
-> at_high_pc
);
1509 decode_line_numbers (lnbase
);
1510 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
1512 end_symtab (dip
-> at_name
, dip
-> at_language
, objfile
);
1513 do_cleanups (back_to
);
1522 start_symtab -- do initialization for starting new symbol table
1526 static void start_symtab (void)
1530 Called whenever we are starting to process dies for a new
1531 compilation unit, to perform initializations. Right now
1532 the only thing we really have to do is initialize storage
1533 space for the line number vector.
1538 DEFUN_VOID (start_symtab
)
1542 line_vector_index
= 0;
1543 line_vector_length
= 1000;
1544 nbytes
= sizeof (struct linetable
);
1545 nbytes
+= line_vector_length
* sizeof (struct linetable_entry
);
1546 line_vector
= (struct linetable
*) xmalloc (nbytes
);
1553 process_dies -- process a range of DWARF Information Entries
1557 static void process_dies (char *thisdie, char *enddie,
1558 struct objfile *objfile)
1562 Process all DIE's in a specified range. May be (and almost
1563 certainly will be) called recursively.
1567 DEFUN(process_dies
, (thisdie
, enddie
, objfile
),
1568 char *thisdie AND
char *enddie AND
struct objfile
*objfile
)
1573 while (thisdie
< enddie
)
1575 basicdieinfo (&di
, thisdie
);
1576 if (di
.dielength
< sizeof (long))
1580 else if (di
.dietag
== TAG_padding
)
1582 nextdie
= thisdie
+ di
.dielength
;
1586 completedieinfo (&di
);
1587 if (di
.at_sibling
!= 0)
1589 nextdie
= dbbase
+ di
.at_sibling
- dbroff
;
1593 nextdie
= thisdie
+ di
.dielength
;
1597 case TAG_compile_unit
:
1598 read_file_scope (&di
, thisdie
, nextdie
, objfile
);
1600 case TAG_global_subroutine
:
1601 case TAG_subroutine
:
1602 if (di
.has_at_low_pc
)
1604 read_func_scope (&di
, thisdie
, nextdie
, objfile
);
1607 case TAG_lexical_block
:
1608 read_lexical_block_scope (&di
, thisdie
, nextdie
, objfile
);
1610 case TAG_structure_type
:
1611 case TAG_union_type
:
1612 read_structure_scope (&di
, thisdie
, nextdie
, objfile
);
1614 case TAG_enumeration_type
:
1615 read_enumeration (&di
, thisdie
, nextdie
);
1617 case TAG_subroutine_type
:
1618 read_subroutine_type (&di
, thisdie
, nextdie
);
1620 case TAG_array_type
:
1621 read_array_type (&di
);
1624 (void) new_symbol (&di
);
1636 end_symtab -- finish processing for a compilation unit
1640 static void end_symtab (char *filename, long language)
1644 Complete the symbol table entry for the current compilation
1645 unit. Make the struct symtab and put it on the list of all
1651 DEFUN(end_symtab
, (filename
, language
, objfile
),
1652 char *filename AND
long language AND
struct objfile
*objfile
)
1654 struct symtab
*symtab
;
1655 struct blockvector
*blockvector
;
1658 /* Ignore a file that has no functions with real debugging info. */
1659 if (global_symbols
== NULL
&& scopetree
-> block
== NULL
)
1663 line_vector_length
= -1;
1664 freescope (scopetree
);
1665 scope
= scopetree
= NULL
;
1668 /* Create the blockvector that points to all the file's blocks. */
1670 blockvector
= make_blockvector ();
1672 /* Now create the symtab object for this source file. */
1674 symtab
= allocate_symtab (savestring (filename
, strlen (filename
)),
1677 symtab
-> free_ptr
= 0;
1679 /* Fill in its components. */
1680 symtab
-> blockvector
= blockvector
;
1681 symtab
-> free_code
= free_linetable
;
1683 /* Save the line number information. */
1685 line_vector
-> nitems
= line_vector_index
;
1686 nbytes
= sizeof (struct linetable
);
1687 if (line_vector_index
> 1)
1689 nbytes
+= (line_vector_index
- 1) * sizeof (struct linetable_entry
);
1691 symtab
-> linetable
= (struct linetable
*) xrealloc (line_vector
, nbytes
);
1693 /* FIXME: The following may need to be expanded for other languages */
1698 symtab
-> language
= language_c
;
1700 case LANG_C_PLUS_PLUS
:
1701 symtab
-> language
= language_cplus
;
1707 /* Link the new symtab into the list of such. */
1708 symtab
-> next
= symtab_list
;
1709 symtab_list
= symtab
;
1711 /* Recursively free the scope tree */
1712 freescope (scopetree
);
1713 scope
= scopetree
= NULL
;
1715 /* Reinitialize for beginning of new file. */
1717 line_vector_length
= -1;
1724 scopecount -- count the number of enclosed scopes
1728 static int scopecount (struct scopenode *node)
1732 Given pointer to a node, compute the size of the subtree which is
1733 rooted in this node, which also happens to be the number of scopes
1738 DEFUN(scopecount
, (node
), struct scopenode
*node
)
1744 count
+= scopecount (node
-> child
);
1745 count
+= scopecount (node
-> sibling
);
1755 openscope -- start a new lexical block scope
1759 static void openscope (struct symbol *namesym, CORE_ADDR lowpc,
1764 Start a new scope by allocating a new scopenode, adding it as the
1765 next child of the current scope (if any) or as the root of the
1766 scope tree, and then making the new node the current scope node.
1770 DEFUN(openscope
, (namesym
, lowpc
, highpc
),
1771 struct symbol
*namesym AND
1775 struct scopenode
*new;
1776 struct scopenode
*child
;
1778 new = (struct scopenode
*) xmalloc (sizeof (*new));
1779 (void) memset (new, 0, sizeof (*new));
1780 new -> namesym
= namesym
;
1781 new -> lowpc
= lowpc
;
1782 new -> highpc
= highpc
;
1787 else if ((child
= scope
-> child
) == NULL
)
1789 scope
-> child
= new;
1790 new -> parent
= scope
;
1794 while (child
-> sibling
!= NULL
)
1796 child
= child
-> sibling
;
1798 child
-> sibling
= new;
1799 new -> parent
= scope
;
1808 freescope -- free a scope tree rooted at the given node
1812 static void freescope (struct scopenode *node)
1816 Given a pointer to a node in the scope tree, free the subtree
1817 rooted at that node. First free all the children and sibling
1818 nodes, and then the node itself. Used primarily for cleaning
1819 up after ourselves and returning memory to the system.
1823 DEFUN(freescope
, (node
), struct scopenode
*node
)
1827 freescope (node
-> child
);
1828 freescope (node
-> sibling
);
1837 buildblock -- build a new block from pending symbols list
1841 static struct block *buildblock (struct pending_symbol *syms)
1845 Given a pointer to a list of symbols, build a new block and free
1846 the symbol list structure. Also check each symbol to see if it
1847 is the special symbol that flags that this block was compiled by
1848 gcc, and if so, mark the block appropriately.
1851 static struct block
*
1852 DEFUN(buildblock
, (syms
), struct pending_symbol
*syms
)
1854 struct pending_symbol
*next
, *next1
;
1856 struct block
*newblock
;
1859 for (next
= syms
, i
= 0 ; next
; next
= next
-> next
, i
++) {;}
1861 /* Allocate a new block */
1863 nbytes
= sizeof (struct block
);
1866 nbytes
+= (i
- 1) * sizeof (struct symbol
*);
1868 newblock
= (struct block
*) obstack_alloc (symbol_obstack
, nbytes
);
1869 (void) memset (newblock
, 0, nbytes
);
1871 /* Copy the symbols into the block. */
1873 BLOCK_NSYMS (newblock
) = i
;
1874 for (next
= syms
; next
; next
= next
-> next
)
1876 BLOCK_SYM (newblock
, --i
) = next
-> symbol
;
1877 if (STREQ (GCC_COMPILED_FLAG_SYMBOL
, SYMBOL_NAME (next
-> symbol
)) ||
1878 STREQ (GCC2_COMPILED_FLAG_SYMBOL
, SYMBOL_NAME (next
-> symbol
)))
1880 BLOCK_GCC_COMPILED (newblock
) = 1;
1884 /* Now free the links of the list, and empty the list. */
1886 for (next
= syms
; next
; next
= next1
)
1888 next1
= next
-> next
;
1899 closescope -- close a lexical block scope
1903 static void closescope (void)
1907 Close the current lexical block scope. Closing the current scope
1908 is as simple as moving the current scope pointer up to the parent
1909 of the current scope pointer. But we also take this opportunity
1910 to build the block for the current scope first, since we now have
1911 all of it's symbols.
1915 DEFUN_VOID(closescope
)
1917 struct scopenode
*child
;
1921 error ("DWARF parse error, too many close scopes");
1925 if (scope
-> parent
== NULL
)
1927 global_symbol_block
= buildblock (global_symbols
);
1928 global_symbols
= NULL
;
1929 BLOCK_START (global_symbol_block
) = scope
-> lowpc
+ baseaddr
;
1930 BLOCK_END (global_symbol_block
) = scope
-> highpc
+ baseaddr
;
1932 scope
-> block
= buildblock (scope
-> symbols
);
1933 scope
-> symbols
= NULL
;
1934 BLOCK_START (scope
-> block
) = scope
-> lowpc
+ baseaddr
;
1935 BLOCK_END (scope
-> block
) = scope
-> highpc
+ baseaddr
;
1937 /* Put the local block in as the value of the symbol that names it. */
1939 if (scope
-> namesym
)
1941 SYMBOL_BLOCK_VALUE (scope
-> namesym
) = scope
-> block
;
1942 BLOCK_FUNCTION (scope
-> block
) = scope
-> namesym
;
1945 /* Install this scope's local block as the superblock of all child
1948 for (child
= scope
-> child
; child
; child
= child
-> sibling
)
1950 BLOCK_SUPERBLOCK (child
-> block
) = scope
-> block
;
1953 scope
= scope
-> parent
;
1961 record_line -- record a line number entry in the line vector
1965 static void record_line (int line, CORE_ADDR pc)
1969 Given a line number and the corresponding pc value, record
1970 this pair in the line number vector, expanding the vector as
1975 DEFUN(record_line
, (line
, pc
), int line AND CORE_ADDR pc
)
1977 struct linetable_entry
*e
;
1980 /* Make sure line vector is big enough. */
1982 if (line_vector_index
+ 2 >= line_vector_length
)
1984 line_vector_length
*= 2;
1985 nbytes
= sizeof (struct linetable
);
1986 nbytes
+= (line_vector_length
* sizeof (struct linetable_entry
));
1987 line_vector
= (struct linetable
*) xrealloc (line_vector
, nbytes
);
1989 e
= line_vector
-> item
+ line_vector_index
++;
1998 decode_line_numbers -- decode a line number table fragment
2002 static void decode_line_numbers (char *tblscan, char *tblend,
2003 long length, long base, long line, long pc)
2007 Translate the DWARF line number information to gdb form.
2009 The ".line" section contains one or more line number tables, one for
2010 each ".line" section from the objects that were linked.
2012 The AT_stmt_list attribute for each TAG_source_file entry in the
2013 ".debug" section contains the offset into the ".line" section for the
2014 start of the table for that file.
2016 The table itself has the following structure:
2018 <table length><base address><source statement entry>
2019 4 bytes 4 bytes 10 bytes
2021 The table length is the total size of the table, including the 4 bytes
2022 for the length information.
2024 The base address is the address of the first instruction generated
2025 for the source file.
2027 Each source statement entry has the following structure:
2029 <line number><statement position><address delta>
2030 4 bytes 2 bytes 4 bytes
2032 The line number is relative to the start of the file, starting with
2035 The statement position either -1 (0xFFFF) or the number of characters
2036 from the beginning of the line to the beginning of the statement.
2038 The address delta is the difference between the base address and
2039 the address of the first instruction for the statement.
2041 Note that we must copy the bytes from the packed table to our local
2042 variables before attempting to use them, to avoid alignment problems
2043 on some machines, particularly RISC processors.
2047 Does gdb expect the line numbers to be sorted? They are now by
2048 chance/luck, but are not required to be. (FIXME)
2050 The line with number 0 is unused, gdb apparently can discover the
2051 span of the last line some other way. How? (FIXME)
2055 DEFUN(decode_line_numbers
, (linetable
), char *linetable
)
2064 if (linetable
!= NULL
)
2066 tblscan
= tblend
= linetable
;
2067 (void) memcpy (&length
, tblscan
, sizeof (long));
2068 tblscan
+= sizeof (long);
2070 (void) memcpy (&base
, tblscan
, sizeof (long));
2072 tblscan
+= sizeof (long);
2073 while (tblscan
< tblend
)
2075 (void) memcpy (&line
, tblscan
, sizeof (long));
2076 tblscan
+= sizeof (long) + sizeof (short);
2077 (void) memcpy (&pc
, tblscan
, sizeof (long));
2078 tblscan
+= sizeof (long);
2082 record_line (line
, pc
);
2092 add_symbol_to_list -- add a symbol to head of current symbol list
2096 static void add_symbol_to_list (struct symbol *symbol, struct
2097 pending_symbol **listhead)
2101 Given a pointer to a symbol and a pointer to a pointer to a
2102 list of symbols, add this symbol as the current head of the
2103 list. Typically used for example to add a symbol to the
2104 symbol list for the current scope.
2109 DEFUN(add_symbol_to_list
, (symbol
, listhead
),
2110 struct symbol
*symbol AND
struct pending_symbol
**listhead
)
2112 struct pending_symbol
*link
;
2116 link
= (struct pending_symbol
*) xmalloc (sizeof (*link
));
2117 link
-> next
= *listhead
;
2118 link
-> symbol
= symbol
;
2127 gatherblocks -- walk a scope tree and build block vectors
2131 static struct block **gatherblocks (struct block **dest,
2132 struct scopenode *node)
2136 Recursively walk a scope tree rooted in the given node, adding blocks
2137 to the array pointed to by DEST, in preorder. I.E., first we add the
2138 block for the current scope, then all the blocks for child scopes,
2139 and finally all the blocks for sibling scopes.
2142 static struct block
**
2143 DEFUN(gatherblocks
, (dest
, node
),
2144 struct block
**dest AND
struct scopenode
*node
)
2148 *dest
++ = node
-> block
;
2149 dest
= gatherblocks (dest
, node
-> child
);
2150 dest
= gatherblocks (dest
, node
-> sibling
);
2159 make_blockvector -- make a block vector from current scope tree
2163 static struct blockvector *make_blockvector (void)
2167 Make a blockvector from all the blocks in the current scope tree.
2168 The first block is always the global symbol block, followed by the
2169 block for the root of the scope tree which is the local symbol block,
2170 followed by all the remaining blocks in the scope tree, which are all
2175 Note that since the root node of the scope tree is created at the time
2176 each file scope is entered, there are always at least two blocks,
2177 neither of which may have any symbols, but always contribute a block
2178 to the block vector. So the test for number of blocks greater than 1
2179 below is unnecessary given bug free code.
2181 The resulting block structure varies slightly from that produced
2182 by dbxread.c, in that block 0 and block 1 are sibling blocks while
2183 with dbxread.c, block 1 is a child of block 0. This does not
2184 seem to cause any problems, but probably should be fixed. (FIXME)
2187 static struct blockvector
*
2188 DEFUN_VOID(make_blockvector
)
2190 struct blockvector
*blockvector
= NULL
;
2194 /* Recursively walk down the tree, counting the number of blocks.
2195 Then add one to account for the global's symbol block */
2197 i
= scopecount (scopetree
) + 1;
2198 nbytes
= sizeof (struct blockvector
);
2201 nbytes
+= (i
- 1) * sizeof (struct block
*);
2203 blockvector
= (struct blockvector
*)
2204 obstack_alloc (symbol_obstack
, nbytes
);
2206 /* Copy the blocks into the blockvector. */
2208 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
2209 BLOCKVECTOR_BLOCK (blockvector
, 0) = global_symbol_block
;
2210 gatherblocks (&BLOCKVECTOR_BLOCK (blockvector
, 1), scopetree
);
2212 return (blockvector
);
2219 locval -- compute the value of a location attribute
2223 static int locval (char *loc)
2227 Given pointer to a string of bytes that define a location, compute
2228 the location and return the value.
2230 When computing values involving the current value of the frame pointer,
2231 the value zero is used, which results in a value relative to the frame
2232 pointer, rather than the absolute value. This is what GDB wants
2235 When the result is a register number, the global isreg flag is set,
2236 otherwise it is cleared. This is a kludge until we figure out a better
2237 way to handle the problem. Gdb's design does not mesh well with the
2238 DWARF notion of a location computing interpreter, which is a shame
2239 because the flexibility goes unused.
2243 Note that stack[0] is unused except as a default error return.
2244 Note that stack overflow is not yet handled.
2248 DEFUN(locval
, (loc
), char *loc
)
2250 unsigned short nbytes
;
2256 (void) memcpy (&nbytes
, loc
, sizeof (short));
2257 end
= loc
+ sizeof (short) + nbytes
;
2261 for (loc
+= sizeof (short); loc
< end
; loc
+= sizeof (long))
2269 /* push register (number) */
2270 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2274 /* push value of register (number) */
2275 /* Actually, we compute the value as if register has 0 */
2276 (void) memcpy (®no
, loc
, sizeof (long));
2279 stack
[++stacki
] = 0;
2283 stack
[++stacki
] = 0;
2284 SQUAWK (("BASEREG %d not handled!", regno
));
2288 /* push address (relocated address) */
2289 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2292 /* push constant (number) */
2293 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2296 /* pop, deref and push 2 bytes (as a long) */
2297 SQUAWK (("OP_DEREF2 address %#x not handled", stack
[stacki
]));
2299 case OP_DEREF4
: /* pop, deref and push 4 bytes (as a long) */
2300 SQUAWK (("OP_DEREF4 address %#x not handled", stack
[stacki
]));
2302 case OP_ADD
: /* pop top 2 items, add, push result */
2303 stack
[stacki
- 1] += stack
[stacki
];
2308 return (stack
[stacki
]);
2315 read_ofile_symtab -- build a full symtab entry from chunk of DIE's
2319 static struct symtab *read_ofile_symtab (struct partial_symtab *pst)
2323 OFFSET is a relocation offset which gets added to each symbol (FIXME).
2326 static struct symtab
*
2327 DEFUN(read_ofile_symtab
, (pst
),
2328 struct partial_symtab
*pst
)
2330 struct cleanup
*back_to
;
2333 bfd
*abfd
= pst
->objfile
->obfd
;
2335 /* Allocate a buffer for the entire chunk of DIE's for this compilation
2336 unit, seek to the location in the file, and read in all the DIE's. */
2339 dbbase
= xmalloc (DBLENGTH(pst
));
2340 dbroff
= DBROFF(pst
);
2341 foffset
= DBFOFF(pst
) + dbroff
;
2342 if (bfd_seek (abfd
, foffset
, 0) ||
2343 (bfd_read (dbbase
, DBLENGTH(pst
), 1, abfd
) != DBLENGTH(pst
)))
2346 error ("can't read DWARF data");
2348 back_to
= make_cleanup (free
, dbbase
);
2350 /* If there is a line number table associated with this compilation unit
2351 then read the first long word from the line number table fragment, which
2352 contains the size of the fragment in bytes (including the long word
2353 itself). Allocate a buffer for the fragment and read it in for future
2359 if (bfd_seek (abfd
, LNFOFF (pst
), 0) ||
2360 (bfd_read (&lnsize
, sizeof(long), 1, abfd
) != sizeof(long)))
2362 error ("can't read DWARF line number table size");
2364 lnbase
= xmalloc (lnsize
);
2365 if (bfd_seek (abfd
, LNFOFF (pst
), 0) ||
2366 (bfd_read (lnbase
, lnsize
, 1, abfd
) != lnsize
))
2369 error ("can't read DWARF line numbers");
2371 make_cleanup (free
, lnbase
);
2374 process_dies (dbbase
, dbbase
+ DBLENGTH(pst
), pst
->objfile
);
2375 do_cleanups (back_to
);
2376 return (symtab_list
);
2383 psymtab_to_symtab_1 -- do grunt work for building a full symtab entry
2387 static void psymtab_to_symtab_1 (struct partial_symtab *pst)
2391 Called once for each partial symbol table entry that needs to be
2392 expanded into a full symbol table entry.
2397 DEFUN(psymtab_to_symtab_1
,
2399 struct partial_symtab
*pst
)
2409 fprintf (stderr
, "Psymtab for %s already read in. Shouldn't happen.\n",
2414 /* Read in all partial symtabs on which this one is dependent */
2415 for (i
= 0; i
< pst
-> number_of_dependencies
; i
++)
2416 if (!pst
-> dependencies
[i
] -> readin
)
2418 /* Inform about additional files that need to be read in. */
2421 fputs_filtered (" ", stdout
);
2423 fputs_filtered ("and ", stdout
);
2425 printf_filtered ("%s...", pst
-> dependencies
[i
] -> filename
);
2426 wrap_here (""); /* Flush output */
2429 psymtab_to_symtab_1 (pst
-> dependencies
[i
]);
2432 if (DBLENGTH(pst
)) /* Otherwise it's a dummy */
2434 /* Init stuff necessary for reading in symbols */
2435 pst
-> symtab
= read_ofile_symtab (pst
);
2438 printf_filtered ("%d DIE's, sorting...", diecount
);
2441 sort_symtab_syms (pst
-> symtab
);
2450 dwarf_psymtab_to_symtab -- build a full symtab entry from partial one
2454 static void dwarf_psymtab_to_symtab (struct partial_symtab *pst)
2458 This is the DWARF support entry point for building a full symbol
2459 table entry from a partial symbol table entry. We are passed a
2460 pointer to the partial symbol table entry that needs to be expanded.
2465 DEFUN(dwarf_psymtab_to_symtab
, (pst
), struct partial_symtab
*pst
)
2474 fprintf (stderr
, "Psymtab for %s already read in. Shouldn't happen.\n",
2479 if (DBLENGTH(pst
) || pst
-> number_of_dependencies
)
2481 /* Print the message now, before starting serious work, to avoid
2482 disconcerting pauses. */
2485 printf_filtered ("Reading in symbols for %s...", pst
-> filename
);
2489 psymtab_to_symtab_1 (pst
);
2491 #if 0 /* FIXME: Check to see what dbxread is doing here and see if
2492 we need to do an equivalent or is this something peculiar to
2493 stabs/a.out format. */
2494 /* Match with global symbols. This only needs to be done once,
2495 after all of the symtabs and dependencies have been read in. */
2496 scan_file_globals ();
2499 /* Finish up the debug error message. */
2502 printf_filtered ("done.\n");
2511 init_psymbol_list -- initialize storage for partial symbols
2515 static void init_psymbol_list (int total_symbols)
2519 Initializes storage for all of the partial symbols that will be
2520 created by dwarf_build_psymtabs and subsidiaries.
2524 DEFUN(init_psymbol_list
, (total_symbols
), int total_symbols
)
2526 /* Free any previously allocated psymbol lists. */
2528 if (global_psymbols
.list
)
2530 free (global_psymbols
.list
);
2532 if (static_psymbols
.list
)
2534 free (static_psymbols
.list
);
2537 /* Current best guess is that there are approximately a twentieth
2538 of the total symbols (in a debugging file) are global or static
2541 global_psymbols
.size
= total_symbols
/ 10;
2542 static_psymbols
.size
= total_symbols
/ 10;
2543 global_psymbols
.next
= global_psymbols
.list
= (struct partial_symbol
*)
2544 xmalloc (global_psymbols
.size
* sizeof (struct partial_symbol
));
2545 static_psymbols
.next
= static_psymbols
.list
= (struct partial_symbol
*)
2546 xmalloc (static_psymbols
.size
* sizeof (struct partial_symbol
));
2553 start_psymtab -- allocate and partially fill a partial symtab entry
2557 Allocate and partially fill a partial symtab. It will be completely
2558 filled at the end of the symbol list.
2560 SYMFILE_NAME is the name of the symbol-file we are reading from, and
2561 ADDR is the address relative to which its symbols are (incremental)
2562 or 0 (normal). FILENAME is the name of the compilation unit that
2563 these symbols were defined in, and they appear starting a address
2564 TEXTLOW. DBROFF is the absolute file offset in SYMFILE_NAME where
2565 the full symbols can be read for compilation unit FILENAME.
2566 GLOBAL_SYMS and STATIC_SYMS are pointers to the current end of the
2571 static struct partial_symtab
*
2572 DEFUN(start_psymtab
,
2573 (objfile
, addr
, filename
, textlow
, texthigh
, dbfoff
, curoff
,
2574 culength
, lnfoff
, global_syms
, static_syms
),
2575 struct objfile
*objfile AND
2578 CORE_ADDR textlow AND
2579 CORE_ADDR texthigh AND
2584 struct partial_symbol
*global_syms AND
2585 struct partial_symbol
*static_syms
)
2587 struct partial_symtab
*result
;
2589 result
= (struct partial_symtab
*)
2590 obstack_alloc (psymbol_obstack
, sizeof (struct partial_symtab
));
2591 (void) memset (result
, 0, sizeof (struct partial_symtab
));
2592 result
-> addr
= addr
;
2593 result
-> objfile
= objfile
;
2594 result
-> filename
= create_name (filename
, psymbol_obstack
);
2595 result
-> textlow
= textlow
;
2596 result
-> texthigh
= texthigh
;
2597 result
-> read_symtab_private
= (char *) obstack_alloc (psymbol_obstack
,
2598 sizeof (struct dwfinfo
));
2599 DBFOFF (result
) = dbfoff
;
2600 DBROFF (result
) = curoff
;
2601 DBLENGTH (result
) = culength
;
2602 LNFOFF (result
) = lnfoff
;
2603 result
-> readin
= 0;
2604 result
-> symtab
= NULL
;
2605 result
-> read_symtab
= dwarf_psymtab_to_symtab
;
2606 result
-> globals_offset
= global_syms
- global_psymbols
.list
;
2607 result
-> statics_offset
= static_syms
- static_psymbols
.list
;
2609 result
->n_global_syms
= 0;
2610 result
->n_static_syms
= 0;
2619 add_psymbol_to_list -- add a partial symbol to given list
2623 Add a partial symbol to one of the partial symbol vectors (pointed to
2624 by listp). The vector is grown as necessary.
2629 DEFUN(add_psymbol_to_list
,
2630 (listp
, name
, space
, class, value
),
2631 struct psymbol_allocation_list
*listp AND
2633 enum namespace space AND
2634 enum address_class
class AND
2637 struct partial_symbol
*psym
;
2640 if (listp
-> next
>= listp
-> list
+ listp
-> size
)
2642 newsize
= listp
-> size
* 2;
2643 listp
-> list
= (struct partial_symbol
*)
2644 xrealloc (listp
-> list
, (newsize
* sizeof (struct partial_symbol
)));
2645 /* Next assumes we only went one over. Should be good if program works
2647 listp
-> next
= listp
-> list
+ listp
-> size
;
2648 listp
-> size
= newsize
;
2650 psym
= listp
-> next
++;
2651 SYMBOL_NAME (psym
) = create_name (name
, psymbol_obstack
);
2652 SYMBOL_NAMESPACE (psym
) = space
;
2653 SYMBOL_CLASS (psym
) = class;
2654 SYMBOL_VALUE (psym
) = value
;
2661 add_partial_symbol -- add symbol to partial symbol table
2665 Given a DIE, if it is one of the types that we want to
2666 add to a partial symbol table, finish filling in the die info
2667 and then add a partial symbol table entry for it.
2672 DEFUN(add_partial_symbol
, (dip
), struct dieinfo
*dip
)
2674 switch (dip
-> dietag
)
2676 case TAG_global_subroutine
:
2677 record_misc_function (dip
-> at_name
, dip
-> at_low_pc
, mf_text
);
2678 add_psymbol_to_list (&global_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2679 LOC_BLOCK
, dip
-> at_low_pc
);
2681 case TAG_global_variable
:
2682 record_misc_function (dip
-> at_name
, locval (dip
-> at_location
),
2684 add_psymbol_to_list (&global_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2687 case TAG_subroutine
:
2688 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2689 LOC_BLOCK
, dip
-> at_low_pc
);
2691 case TAG_local_variable
:
2692 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2696 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2699 case TAG_structure_type
:
2700 case TAG_union_type
:
2701 case TAG_enumeration_type
:
2702 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, STRUCT_NAMESPACE
,
2712 scan_partial_symbols -- scan DIE's within a single compilation unit
2716 Process the DIE's within a single compilation unit, looking for
2717 interesting DIE's that contribute to the partial symbol table entry
2718 for this compilation unit. Since we cannot follow any sibling
2719 chains without reading the complete DIE info for every DIE,
2720 it is probably faster to just sequentially check each one to
2721 see if it is one of the types we are interested in, and if
2722 so, then extracting all the attributes info and generating a
2723 partial symbol table entry.
2727 Don't attempt to add anonymous structures, unions, or enumerations
2728 since they have no name. Also, for variables and subroutines,
2729 check that this is the place where the actual definition occurs,
2730 rather than just a reference to an external.
2735 DEFUN(scan_partial_symbols
, (thisdie
, enddie
), char *thisdie AND
char *enddie
)
2740 while (thisdie
< enddie
)
2742 basicdieinfo (&di
, thisdie
);
2743 if (di
.dielength
< sizeof (long))
2749 nextdie
= thisdie
+ di
.dielength
;
2752 case TAG_global_subroutine
:
2753 case TAG_subroutine
:
2754 case TAG_global_variable
:
2755 case TAG_local_variable
:
2756 completedieinfo (&di
);
2757 if (di
.at_name
&& (di
.has_at_low_pc
|| di
.at_location
))
2759 add_partial_symbol (&di
);
2763 case TAG_structure_type
:
2764 case TAG_union_type
:
2765 case TAG_enumeration_type
:
2766 completedieinfo (&di
);
2769 add_partial_symbol (&di
);
2782 scan_compilation_units -- build a psymtab entry for each compilation
2786 This is the top level dwarf parsing routine for building partial
2789 It scans from the beginning of the DWARF table looking for the first
2790 TAG_compile_unit DIE, and then follows the sibling chain to locate
2791 each additional TAG_compile_unit DIE.
2793 For each TAG_compile_unit DIE it creates a partial symtab structure,
2794 calls a subordinate routine to collect all the compilation unit's
2795 global DIE's, file scope DIEs, typedef DIEs, etc, and then links the
2796 new partial symtab structure into the partial symbol table. It also
2797 records the appropriate information in the partial symbol table entry
2798 to allow the chunk of DIE's and line number table for this compilation
2799 unit to be located and re-read later, to generate a complete symbol
2800 table entry for the compilation unit.
2802 Thus it effectively partitions up a chunk of DIE's for multiple
2803 compilation units into smaller DIE chunks and line number tables,
2804 and associates them with a partial symbol table entry.
2808 If any compilation unit has no line number table associated with
2809 it for some reason (a missing at_stmt_list attribute, rather than
2810 just one with a value of zero, which is valid) then we ensure that
2811 the recorded file offset is zero so that the routine which later
2812 reads line number table fragments knows that there is no fragment
2822 DEFUN(scan_compilation_units
,
2823 (filename
, addr
, thisdie
, enddie
, dbfoff
, lnoffset
, objfile
),
2828 unsigned int dbfoff AND
2829 unsigned int lnoffset AND
2830 struct objfile
*objfile
)
2834 struct partial_symtab
*pst
;
2839 while (thisdie
< enddie
)
2841 basicdieinfo (&di
, thisdie
);
2842 if (di
.dielength
< sizeof (long))
2846 else if (di
.dietag
!= TAG_compile_unit
)
2848 nextdie
= thisdie
+ di
.dielength
;
2852 completedieinfo (&di
);
2853 if (di
.at_sibling
!= 0)
2855 nextdie
= dbbase
+ di
.at_sibling
- dbroff
;
2859 nextdie
= thisdie
+ di
.dielength
;
2861 curoff
= thisdie
- dbbase
;
2862 culength
= nextdie
- thisdie
;
2863 curlnoffset
= di
.has_at_stmt_list
? lnoffset
+ di
.at_stmt_list
: 0;
2864 pst
= start_psymtab (objfile
, addr
, di
.at_name
,
2865 di
.at_low_pc
, di
.at_high_pc
,
2866 dbfoff
, curoff
, culength
, curlnoffset
,
2867 global_psymbols
.next
,
2868 static_psymbols
.next
);
2869 scan_partial_symbols (thisdie
+ di
.dielength
, nextdie
);
2870 pst
-> n_global_syms
= global_psymbols
.next
-
2871 (global_psymbols
.list
+ pst
-> globals_offset
);
2872 pst
-> n_static_syms
= static_psymbols
.next
-
2873 (static_psymbols
.list
+ pst
-> statics_offset
);
2874 /* Sort the global list; don't sort the static list */
2875 qsort (global_psymbols
.list
+ pst
-> globals_offset
,
2876 pst
-> n_global_syms
, sizeof (struct partial_symbol
),
2878 /* If there is already a psymtab or symtab for a file of this name,
2879 remove it. (If there is a symtab, more drastic things also
2880 happen.) This happens in VxWorks. */
2881 free_named_symtabs (pst
-> filename
);
2882 /* Place the partial symtab on the partial symtab list */
2883 pst
-> next
= partial_symtab_list
;
2884 partial_symtab_list
= pst
;
2894 new_symbol -- make a symbol table entry for a new symbol
2898 static struct symbol *new_symbol (struct dieinfo *dip)
2902 Given a pointer to a DWARF information entry, figure out if we need
2903 to make a symbol table entry for it, and if so, create a new entry
2904 and return a pointer to it.
2907 static struct symbol
*
2908 DEFUN(new_symbol
, (dip
), struct dieinfo
*dip
)
2910 struct symbol
*sym
= NULL
;
2912 if (dip
-> at_name
!= NULL
)
2914 sym
= (struct symbol
*) obstack_alloc (symbol_obstack
,
2915 sizeof (struct symbol
));
2916 (void) memset (sym
, 0, sizeof (struct symbol
));
2917 SYMBOL_NAME (sym
) = create_name (dip
-> at_name
, symbol_obstack
);
2918 /* default assumptions */
2919 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
2920 SYMBOL_CLASS (sym
) = LOC_STATIC
;
2921 SYMBOL_TYPE (sym
) = decode_die_type (dip
);
2922 switch (dip
-> dietag
)
2925 SYMBOL_VALUE (sym
) = dip
-> at_low_pc
+ baseaddr
;
2926 SYMBOL_CLASS (sym
) = LOC_LABEL
;
2928 case TAG_global_subroutine
:
2929 case TAG_subroutine
:
2930 SYMBOL_VALUE (sym
) = dip
-> at_low_pc
+ baseaddr
;
2931 SYMBOL_TYPE (sym
) = lookup_function_type (SYMBOL_TYPE (sym
));
2932 SYMBOL_CLASS (sym
) = LOC_BLOCK
;
2933 if (dip
-> dietag
== TAG_global_subroutine
)
2935 add_symbol_to_list (sym
, &global_symbols
);
2939 add_symbol_to_list (sym
, &scope
-> symbols
);
2942 case TAG_global_variable
:
2943 case TAG_local_variable
:
2944 if (dip
-> at_location
!= NULL
)
2946 SYMBOL_VALUE (sym
) = locval (dip
-> at_location
);
2948 if (dip
-> dietag
== TAG_global_variable
)
2950 add_symbol_to_list (sym
, &global_symbols
);
2951 SYMBOL_CLASS (sym
) = LOC_STATIC
;
2952 SYMBOL_VALUE (sym
) += baseaddr
;
2956 add_symbol_to_list (sym
, &scope
-> symbols
);
2957 if (scope
-> parent
!= NULL
)
2961 SYMBOL_CLASS (sym
) = LOC_REGISTER
;
2965 SYMBOL_CLASS (sym
) = LOC_LOCAL
;
2970 SYMBOL_CLASS (sym
) = LOC_STATIC
;
2971 SYMBOL_VALUE (sym
) += baseaddr
;
2975 case TAG_formal_parameter
:
2976 if (dip
-> at_location
!= NULL
)
2978 SYMBOL_VALUE (sym
) = locval (dip
-> at_location
);
2980 add_symbol_to_list (sym
, &scope
-> symbols
);
2983 SYMBOL_CLASS (sym
) = LOC_REGPARM
;
2987 SYMBOL_CLASS (sym
) = LOC_ARG
;
2990 case TAG_unspecified_parameters
:
2991 /* From varargs functions; gdb doesn't seem to have any interest in
2992 this information, so just ignore it for now. (FIXME?) */
2994 case TAG_structure_type
:
2995 case TAG_union_type
:
2996 case TAG_enumeration_type
:
2997 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
2998 SYMBOL_NAMESPACE (sym
) = STRUCT_NAMESPACE
;
2999 add_symbol_to_list (sym
, &scope
-> symbols
);
3002 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
3003 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
3004 add_symbol_to_list (sym
, &scope
-> symbols
);
3007 /* Not a tag we recognize. Hopefully we aren't processing trash
3008 data, but since we must specifically ignore things we don't
3009 recognize, there is nothing else we should do at this point. */
3020 decode_mod_fund_type -- decode a modified fundamental type
3024 static struct type *decode_mod_fund_type (char *typedata)
3028 Decode a block of data containing a modified fundamental
3029 type specification. TYPEDATA is a pointer to the block,
3030 which consists of a two byte length, containing the size
3031 of the rest of the block. At the end of the block is a
3032 two byte value that gives the fundamental type. Everything
3033 in between are type modifiers.
3035 We simply compute the number of modifiers and call the general
3036 function decode_modified_type to do the actual work.
3039 static struct type
*
3040 DEFUN(decode_mod_fund_type
, (typedata
), char *typedata
)
3042 struct type
*typep
= NULL
;
3043 unsigned short modcount
;
3044 unsigned char *modifiers
;
3046 /* Get the total size of the block, exclusive of the size itself */
3047 (void) memcpy (&modcount
, typedata
, sizeof (short));
3048 /* Deduct the size of the fundamental type bytes at the end of the block. */
3049 modcount
-= sizeof (short);
3050 /* Skip over the two size bytes at the beginning of the block. */
3051 modifiers
= (unsigned char *) typedata
+ sizeof (short);
3052 /* Now do the actual decoding */
3053 typep
= decode_modified_type (modifiers
, modcount
, AT_mod_fund_type
);
3061 decode_mod_u_d_type -- decode a modified user defined type
3065 static struct type *decode_mod_u_d_type (char *typedata)
3069 Decode a block of data containing a modified user defined
3070 type specification. TYPEDATA is a pointer to the block,
3071 which consists of a two byte length, containing the size
3072 of the rest of the block. At the end of the block is a
3073 four byte value that gives a reference to a user defined type.
3074 Everything in between are type modifiers.
3076 We simply compute the number of modifiers and call the general
3077 function decode_modified_type to do the actual work.
3080 static struct type
*
3081 DEFUN(decode_mod_u_d_type
, (typedata
), char *typedata
)
3083 struct type
*typep
= NULL
;
3084 unsigned short modcount
;
3085 unsigned char *modifiers
;
3087 /* Get the total size of the block, exclusive of the size itself */
3088 (void) memcpy (&modcount
, typedata
, sizeof (short));
3089 /* Deduct the size of the reference type bytes at the end of the block. */
3090 modcount
-= sizeof (long);
3091 /* Skip over the two size bytes at the beginning of the block. */
3092 modifiers
= (unsigned char *) typedata
+ sizeof (short);
3093 /* Now do the actual decoding */
3094 typep
= decode_modified_type (modifiers
, modcount
, AT_mod_u_d_type
);
3102 decode_modified_type -- decode modified user or fundamental type
3106 static struct type *decode_modified_type (unsigned char *modifiers,
3107 unsigned short modcount, int mtype)
3111 Decode a modified type, either a modified fundamental type or
3112 a modified user defined type. MODIFIERS is a pointer to the
3113 block of bytes that define MODCOUNT modifiers. Immediately
3114 following the last modifier is a short containing the fundamental
3115 type or a long containing the reference to the user defined
3116 type. Which one is determined by MTYPE, which is either
3117 AT_mod_fund_type or AT_mod_u_d_type to indicate what modified
3118 type we are generating.
3120 We call ourself recursively to generate each modified type,`
3121 until MODCOUNT reaches zero, at which point we have consumed
3122 all the modifiers and generate either the fundamental type or
3123 user defined type. When the recursion unwinds, each modifier
3124 is applied in turn to generate the full modified type.
3128 If we find a modifier that we don't recognize, and it is not one
3129 of those reserved for application specific use, then we issue a
3130 warning and simply ignore the modifier.
3134 We currently ignore MOD_const and MOD_volatile. (FIXME)
3138 static struct type
*
3139 DEFUN(decode_modified_type
,
3140 (modifiers
, modcount
, mtype
),
3141 unsigned char *modifiers AND
unsigned short modcount AND
int mtype
)
3143 struct type
*typep
= NULL
;
3144 unsigned short fundtype
;
3146 unsigned char modifier
;
3152 case AT_mod_fund_type
:
3153 (void) memcpy (&fundtype
, modifiers
, sizeof (short));
3154 typep
= decode_fund_type (fundtype
);
3156 case AT_mod_u_d_type
:
3157 (void) memcpy (&dieref
, modifiers
, sizeof (DIEREF
));
3158 if ((typep
= lookup_utype (dieref
)) == NULL
)
3160 typep
= alloc_utype (dieref
, NULL
);
3164 SQUAWK (("botched modified type decoding (mtype 0x%x)", mtype
));
3165 typep
= builtin_type_int
;
3171 modifier
= *modifiers
++;
3172 typep
= decode_modified_type (modifiers
, --modcount
, mtype
);
3175 case MOD_pointer_to
:
3176 typep
= lookup_pointer_type (typep
);
3178 case MOD_reference_to
:
3179 typep
= lookup_reference_type (typep
);
3182 SQUAWK (("type modifier 'const' ignored")); /* FIXME */
3185 SQUAWK (("type modifier 'volatile' ignored")); /* FIXME */
3188 if (!(MOD_lo_user
<= modifier
&& modifier
<= MOD_hi_user
))
3190 SQUAWK (("unknown type modifier %u", modifier
));
3202 decode_fund_type -- translate basic DWARF type to gdb base type
3206 Given an integer that is one of the fundamental DWARF types,
3207 translate it to one of the basic internal gdb types and return
3208 a pointer to the appropriate gdb type (a "struct type *").
3212 If we encounter a fundamental type that we are unprepared to
3213 deal with, and it is not in the range of those types defined
3214 as application specific types, then we issue a warning and
3215 treat the type as builtin_type_int.
3218 static struct type
*
3219 DEFUN(decode_fund_type
, (fundtype
), unsigned short fundtype
)
3221 struct type
*typep
= NULL
;
3227 typep
= builtin_type_void
;
3230 case FT_pointer
: /* (void *) */
3231 typep
= lookup_pointer_type (builtin_type_void
);
3235 case FT_signed_char
:
3236 typep
= builtin_type_char
;
3240 case FT_signed_short
:
3241 typep
= builtin_type_short
;
3245 case FT_signed_integer
:
3246 case FT_boolean
: /* Was FT_set in AT&T version */
3247 typep
= builtin_type_int
;
3251 case FT_signed_long
:
3252 typep
= builtin_type_long
;
3256 typep
= builtin_type_float
;
3259 case FT_dbl_prec_float
:
3260 typep
= builtin_type_double
;
3263 case FT_unsigned_char
:
3264 typep
= builtin_type_unsigned_char
;
3267 case FT_unsigned_short
:
3268 typep
= builtin_type_unsigned_short
;
3271 case FT_unsigned_integer
:
3272 typep
= builtin_type_unsigned_int
;
3275 case FT_unsigned_long
:
3276 typep
= builtin_type_unsigned_long
;
3279 case FT_ext_prec_float
:
3280 typep
= builtin_type_long_double
;
3284 typep
= builtin_type_complex
;
3287 case FT_dbl_prec_complex
:
3288 typep
= builtin_type_double_complex
;
3292 case FT_signed_long_long
:
3293 typep
= builtin_type_long_long
;
3296 case FT_unsigned_long_long
:
3297 typep
= builtin_type_unsigned_long_long
;
3302 if ((typep
== NULL
) && !(FT_lo_user
<= fundtype
&& fundtype
<= FT_hi_user
))
3304 SQUAWK (("unexpected fundamental type 0x%x", fundtype
));
3305 typep
= builtin_type_void
;
3315 create_name -- allocate a fresh copy of a string on an obstack
3319 Given a pointer to a string and a pointer to an obstack, allocates
3320 a fresh copy of the string on the specified obstack.
3325 DEFUN(create_name
, (name
, obstackp
), char *name AND
struct obstack
*obstackp
)
3330 length
= strlen (name
) + 1;
3331 newname
= (char *) obstack_alloc (obstackp
, length
);
3332 (void) strcpy (newname
, name
);
3340 basicdieinfo -- extract the minimal die info from raw die data
3344 void basicdieinfo (char *diep, struct dieinfo *dip)
3348 Given a pointer to raw DIE data, and a pointer to an instance of a
3349 die info structure, this function extracts the basic information
3350 from the DIE data required to continue processing this DIE, along
3351 with some bookkeeping information about the DIE.
3353 The information we absolutely must have includes the DIE tag,
3354 and the DIE length. If we need the sibling reference, then we
3355 will have to call completedieinfo() to process all the remaining
3358 Note that since there is no guarantee that the data is properly
3359 aligned in memory for the type of access required (indirection
3360 through anything other than a char pointer), we use memcpy to
3361 shuffle data items larger than a char. Possibly inefficient, but
3364 We also take care of some other basic things at this point, such
3365 as ensuring that the instance of the die info structure starts
3366 out completely zero'd and that curdie is initialized for use
3367 in error reporting if we have a problem with the current die.
3371 All DIE's must have at least a valid length, thus the minimum
3372 DIE size is sizeof (long). In order to have a valid tag, the
3373 DIE size must be at least sizeof (short) larger, otherwise they
3374 are forced to be TAG_padding DIES.
3376 Padding DIES must be at least sizeof(long) in length, implying that
3377 if a padding DIE is used for alignment and the amount needed is less
3378 than sizeof(long) then the padding DIE has to be big enough to align
3379 to the next alignment boundry.
3383 DEFUN(basicdieinfo
, (dip
, diep
), struct dieinfo
*dip AND
char *diep
)
3386 (void) memset (dip
, 0, sizeof (struct dieinfo
));
3388 dip
-> dieref
= dbroff
+ (diep
- dbbase
);
3389 (void) memcpy (&dip
-> dielength
, diep
, sizeof (long));
3390 if (dip
-> dielength
< sizeof (long))
3392 dwarfwarn ("malformed DIE, bad length (%d bytes)", dip
-> dielength
);
3394 else if (dip
-> dielength
< (sizeof (long) + sizeof (short)))
3396 dip
-> dietag
= TAG_padding
;
3400 (void) memcpy (&dip
-> dietag
, diep
+ sizeof (long), sizeof (short));
3408 completedieinfo -- finish reading the information for a given DIE
3412 void completedieinfo (struct dieinfo *dip)
3416 Given a pointer to an already partially initialized die info structure,
3417 scan the raw DIE data and finish filling in the die info structure
3418 from the various attributes found.
3420 Note that since there is no guarantee that the data is properly
3421 aligned in memory for the type of access required (indirection
3422 through anything other than a char pointer), we use memcpy to
3423 shuffle data items larger than a char. Possibly inefficient, but
3428 Each time we are called, we increment the diecount variable, which
3429 keeps an approximate count of the number of dies processed for
3430 each compilation unit. This information is presented to the user
3431 if the info_verbose flag is set.
3436 DEFUN(completedieinfo
, (dip
), struct dieinfo
*dip
)
3438 char *diep
; /* Current pointer into raw DIE data */
3439 char *end
; /* Terminate DIE scan here */
3440 unsigned short attr
; /* Current attribute being scanned */
3441 unsigned short form
; /* Form of the attribute */
3442 short block2sz
; /* Size of a block2 attribute field */
3443 long block4sz
; /* Size of a block4 attribute field */
3447 end
= diep
+ dip
-> dielength
;
3448 diep
+= sizeof (long) + sizeof (short);
3451 (void) memcpy (&attr
, diep
, sizeof (short));
3452 diep
+= sizeof (short);
3456 (void) memcpy (&dip
-> at_fund_type
, diep
, sizeof (short));
3459 (void) memcpy (&dip
-> at_ordering
, diep
, sizeof (short));
3462 (void) memcpy (&dip
-> at_bit_offset
, diep
, sizeof (short));
3465 (void) memcpy (&dip
-> at_visibility
, diep
, sizeof (short));
3468 (void) memcpy (&dip
-> at_sibling
, diep
, sizeof (long));
3471 (void) memcpy (&dip
-> at_stmt_list
, diep
, sizeof (long));
3472 dip
-> has_at_stmt_list
= 1;
3475 (void) memcpy (&dip
-> at_low_pc
, diep
, sizeof (long));
3476 dip
-> has_at_low_pc
= 1;
3479 (void) memcpy (&dip
-> at_high_pc
, diep
, sizeof (long));
3482 (void) memcpy (&dip
-> at_language
, diep
, sizeof (long));
3484 case AT_user_def_type
:
3485 (void) memcpy (&dip
-> at_user_def_type
, diep
, sizeof (long));
3488 (void) memcpy (&dip
-> at_byte_size
, diep
, sizeof (long));
3491 (void) memcpy (&dip
-> at_bit_size
, diep
, sizeof (long));
3494 (void) memcpy (&dip
-> at_member
, diep
, sizeof (long));
3497 (void) memcpy (&dip
-> at_discr
, diep
, sizeof (long));
3500 (void) memcpy (&dip
-> at_import
, diep
, sizeof (long));
3503 dip
-> at_location
= diep
;
3505 case AT_mod_fund_type
:
3506 dip
-> at_mod_fund_type
= diep
;
3508 case AT_subscr_data
:
3509 dip
-> at_subscr_data
= diep
;
3511 case AT_mod_u_d_type
:
3512 dip
-> at_mod_u_d_type
= diep
;
3514 case AT_element_list
:
3515 dip
-> at_element_list
= diep
;
3516 dip
-> short_element_list
= 0;
3518 case AT_short_element_list
:
3519 dip
-> at_element_list
= diep
;
3520 dip
-> short_element_list
= 1;
3522 case AT_discr_value
:
3523 dip
-> at_discr_value
= diep
;
3525 case AT_string_length
:
3526 dip
-> at_string_length
= diep
;
3529 dip
-> at_name
= diep
;
3532 dip
-> at_comp_dir
= diep
;
3535 dip
-> at_producer
= diep
;
3538 (void) memcpy (&dip
-> at_frame_base
, diep
, sizeof (long));
3540 case AT_start_scope
:
3541 (void) memcpy (&dip
-> at_start_scope
, diep
, sizeof (long));
3543 case AT_stride_size
:
3544 (void) memcpy (&dip
-> at_stride_size
, diep
, sizeof (long));
3547 (void) memcpy (&dip
-> at_src_info
, diep
, sizeof (long));
3550 (void) memcpy (&dip
-> at_prototyped
, diep
, sizeof (short));
3553 /* Found an attribute that we are unprepared to handle. However
3554 it is specifically one of the design goals of DWARF that
3555 consumers should ignore unknown attributes. As long as the
3556 form is one that we recognize (so we know how to skip it),
3557 we can just ignore the unknown attribute. */
3564 diep
+= sizeof (short);
3567 diep
+= sizeof (long);
3570 diep
+= 8 * sizeof (char); /* sizeof (long long) ? */
3574 diep
+= sizeof (long);
3577 (void) memcpy (&block2sz
, diep
, sizeof (short));
3578 block2sz
+= sizeof (short);
3582 (void) memcpy (&block4sz
, diep
, sizeof (long));
3583 block4sz
+= sizeof (long);
3587 diep
+= strlen (diep
) + 1;
3590 SQUAWK (("unknown attribute form (0x%x), skipped rest", form
));