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. :-)
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
));
367 EXFUN(decode_array_element_type
, (char *scan AND
char *end
));
370 EXFUN(decode_subscr_data
, (char *scan AND
char *end
));
373 EXFUN(read_array_type
, (struct dieinfo
*dip
));
376 EXFUN(read_subroutine_type
,
377 (struct dieinfo
*dip AND
char *thisdie AND
char *enddie
));
380 EXFUN(read_enumeration
,
381 (struct dieinfo
*dip AND
char *thisdie AND
char *enddie
));
385 (struct dieinfo
*dip AND
char *thisdie AND
char *enddie
));
388 EXFUN(enum_type
, (struct dieinfo
*dip
));
391 EXFUN(start_symtab
, (void));
395 (char *filename AND
long language AND
struct objfile
*objfile
));
398 EXFUN(scopecount
, (struct scopenode
*node
));
402 (struct symbol
*namesym AND CORE_ADDR lowpc AND CORE_ADDR highpc
));
405 EXFUN(freescope
, (struct scopenode
*node
));
407 static struct block
*
408 EXFUN(buildblock
, (struct pending_symbol
*syms
));
411 EXFUN(closescope
, (void));
414 EXFUN(record_line
, (int line AND CORE_ADDR pc
));
417 EXFUN(decode_line_numbers
, (char *linetable
));
420 EXFUN(decode_die_type
, (struct dieinfo
*dip
));
423 EXFUN(decode_mod_fund_type
, (char *typedata
));
426 EXFUN(decode_mod_u_d_type
, (char *typedata
));
429 EXFUN(decode_modified_type
,
430 (unsigned char *modifiers AND
unsigned short modcount AND
int mtype
));
433 EXFUN(decode_fund_type
, (unsigned short fundtype
));
436 EXFUN(create_name
, (char *name AND
struct obstack
*obstackp
));
439 EXFUN(add_symbol_to_list
,
440 (struct symbol
*symbol AND
struct pending_symbol
**listhead
));
442 static struct block
**
443 EXFUN(gatherblocks
, (struct block
**dest AND
struct scopenode
*node
));
445 static struct blockvector
*
446 EXFUN(make_blockvector
, (void));
449 EXFUN(lookup_utype
, (DIEREF dieref
));
452 EXFUN(alloc_utype
, (DIEREF dieref AND
struct type
*usetype
));
454 static struct symbol
*
455 EXFUN(new_symbol
, (struct dieinfo
*dip
));
458 EXFUN(locval
, (char *loc
));
461 EXFUN(record_misc_function
, (char *name AND CORE_ADDR address AND
462 enum misc_function_type
));
465 EXFUN(compare_psymbols
,
466 (struct partial_symbol
*s1 AND
struct partial_symbol
*s2
));
473 dwarf_build_psymtabs -- build partial symtabs from DWARF debug info
477 void dwarf_build_psymtabs (int desc, char *filename, CORE_ADDR addr,
478 int mainline, unsigned int dbfoff, unsigned int dbsize,
479 unsigned int lnoffset, unsigned int lnsize,
480 struct objfile *objfile)
484 This function is called upon to build partial symtabs from files
485 containing DIE's (Dwarf Information Entries) and DWARF line numbers.
487 It is passed a file descriptor for an open file containing the DIES
488 and line number information, the corresponding filename for that
489 file, a base address for relocating the symbols, a flag indicating
490 whether or not this debugging information is from a "main symbol
491 table" rather than a shared library or dynamically linked file,
492 and file offset/size pairs for the DIE information and line number
502 DEFUN(dwarf_build_psymtabs
,
503 (desc
, filename
, addr
, mainline
, dbfoff
, dbsize
, lnoffset
, lnsize
,
509 unsigned int dbfoff AND
510 unsigned int dbsize AND
511 unsigned int lnoffset AND
512 unsigned int lnsize AND
513 struct objfile
*objfile
)
515 struct cleanup
*back_to
;
517 dbbase
= xmalloc (dbsize
);
519 if ((lseek (desc
, dbfoff
, 0) != dbfoff
) ||
520 (read (desc
, dbbase
, dbsize
) != dbsize
))
523 error ("can't read DWARF data from '%s'", filename
);
525 back_to
= make_cleanup (free
, dbbase
);
527 /* If we are reinitializing, or if we have never loaded syms yet, init.
528 Since we have no idea how many DIES we are looking at, we just guess
529 some arbitrary value. */
531 if (mainline
|| global_psymbols
.size
== 0 || static_psymbols
.size
== 0)
533 init_psymbol_list (1024);
536 /* Follow the compilation unit sibling chain, building a partial symbol
537 table entry for each one. Save enough information about each compilation
538 unit to locate the full DWARF information later. */
540 scan_compilation_units (filename
, addr
, dbbase
, dbbase
+ dbsize
,
541 dbfoff
, lnoffset
, objfile
);
543 do_cleanups (back_to
);
551 record_misc_function -- add entry to miscellaneous function vector
555 static void record_misc_function (char *name, CORE_ADDR address,
556 enum misc_function_type mf_type)
560 Given a pointer to the name of a symbol that should be added to the
561 miscellaneous function vector, and the address associated with that
562 symbol, records this information for later use in building the
563 miscellaneous function vector.
568 DEFUN(record_misc_function
, (name
, address
, mf_type
),
569 char *name AND CORE_ADDR address AND
enum misc_function_type mf_type
)
571 prim_record_misc_function (obsavestring (name
, strlen (name
)), address
,
579 dwarfwarn -- issue a DWARF related warning
583 Issue warnings about DWARF related things that aren't serious enough
584 to warrant aborting with an error, but should not be ignored either.
585 This includes things like detectable corruption in DIE's, missing
586 DIE's, unimplemented features, etc.
588 In general, running across tags or attributes that we don't recognize
589 is not considered to be a problem and we should not issue warnings
594 We mostly follow the example of the error() routine, but without
595 returning to command level. It is arguable about whether warnings
596 should be issued at all, and if so, where they should go (stdout or
599 We assume that curdie is valid and contains at least the basic
600 information for the DIE where the problem was noticed.
605 DEFUN(dwarfwarn
, (fmt
), char *fmt DOTS
)
611 fprintf (stderr
, "DWARF warning (ref 0x%x): ", curdie
-> dieref
);
612 if (curdie
-> at_name
)
614 fprintf (stderr
, "'%s': ", curdie
-> at_name
);
616 vfprintf (stderr
, fmt
, ap
);
617 fprintf (stderr
, "\n");
631 fmt
= va_arg (ap
, char *);
633 fprintf (stderr
, "DWARF warning (ref 0x%x): ", curdie
-> dieref
);
634 if (curdie
-> at_name
)
636 fprintf (stderr
, "'%s': ", curdie
-> at_name
);
638 vfprintf (stderr
, fmt
, ap
);
639 fprintf (stderr
, "\n");
648 compare_psymbols -- compare two partial symbols by name
652 Given pointer to two partial symbol table entries, compare
653 them by name and return -N, 0, or +N (ala strcmp). Typically
654 used by sorting routines like qsort().
658 This is a copy from dbxread.c. It should be moved to a generic
659 gdb file and made available for all psymtab builders (FIXME).
661 Does direct compare of first two characters before punting
662 and passing to strcmp for longer compares. Note that the
663 original version had a bug whereby two null strings or two
664 identically named one character strings would return the
665 comparison of memory following the null byte.
670 DEFUN(compare_psymbols
, (s1
, s2
),
671 struct partial_symbol
*s1 AND
672 struct partial_symbol
*s2
)
674 register char *st1
= SYMBOL_NAME (s1
);
675 register char *st2
= SYMBOL_NAME (s2
);
677 if ((st1
[0] - st2
[0]) || !st1
[0])
679 return (st1
[0] - st2
[0]);
681 else if ((st1
[1] - st2
[1]) || !st1
[1])
683 return (st1
[1] - st2
[1]);
687 return (strcmp (st1
+ 2, st2
+ 2));
695 read_lexical_block_scope -- process all dies in a lexical block
699 static void read_lexical_block_scope (struct dieinfo *dip,
700 char *thisdie, char *enddie)
704 Process all the DIES contained within a lexical block scope.
705 Start a new scope, process the dies, and then close the scope.
710 DEFUN(read_lexical_block_scope
, (dip
, thisdie
, enddie
, objfile
),
711 struct dieinfo
*dip AND
714 struct objfile
*objfile
)
716 openscope (NULL
, dip
-> at_low_pc
, dip
-> at_high_pc
);
717 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
725 lookup_utype -- look up a user defined type from die reference
729 static type *lookup_utype (DIEREF dieref)
733 Given a DIE reference, lookup the user defined type associated with
734 that DIE, if it has been registered already. If not registered, then
735 return NULL. Alloc_utype() can be called to register an empty
736 type for this reference, which will be filled in later when the
737 actual referenced DIE is processed.
741 DEFUN(lookup_utype
, (dieref
), DIEREF dieref
)
743 struct type
*type
= NULL
;
746 utypeidx
= (dieref
- dbroff
) / 4;
747 if ((utypeidx
< 0) || (utypeidx
>= numutypes
))
749 dwarfwarn ("reference to DIE (0x%x) outside compilation unit", dieref
);
753 type
= *(utypes
+ utypeidx
);
763 alloc_utype -- add a user defined type for die reference
767 static type *alloc_utype (DIEREF dieref, struct type *utypep)
771 Given a die reference DIEREF, and a possible pointer to a user
772 defined type UTYPEP, register that this reference has a user
773 defined type and either use the specified type in UTYPEP or
774 make a new empty type that will be filled in later.
776 We should only be called after calling lookup_utype() to verify that
777 there is not currently a type registered for DIEREF.
781 DEFUN(alloc_utype
, (dieref
, utypep
),
788 utypeidx
= (dieref
- dbroff
) / 4;
789 typep
= utypes
+ utypeidx
;
790 if ((utypeidx
< 0) || (utypeidx
>= numutypes
))
792 utypep
= builtin_type_int
;
793 dwarfwarn ("reference to DIE (0x%x) outside compilation unit", dieref
);
795 else if (*typep
!= NULL
)
798 SQUAWK (("internal error: dup user type allocation"));
804 utypep
= (struct type
*)
805 obstack_alloc (symbol_obstack
, sizeof (struct type
));
806 (void) memset (utypep
, 0, sizeof (struct type
));
817 decode_die_type -- return a type for a specified die
821 static struct type *decode_die_type (struct dieinfo *dip)
825 Given a pointer to a die information structure DIP, decode the
826 type of the die and return a pointer to the decoded type. All
827 dies without specific types default to type int.
831 DEFUN(decode_die_type
, (dip
), struct dieinfo
*dip
)
833 struct type
*type
= NULL
;
835 if (dip
-> at_fund_type
!= 0)
837 type
= decode_fund_type (dip
-> at_fund_type
);
839 else if (dip
-> at_mod_fund_type
!= NULL
)
841 type
= decode_mod_fund_type (dip
-> at_mod_fund_type
);
843 else if (dip
-> at_user_def_type
)
845 if ((type
= lookup_utype (dip
-> at_user_def_type
)) == NULL
)
847 type
= alloc_utype (dip
-> at_user_def_type
, NULL
);
850 else if (dip
-> at_mod_u_d_type
)
852 type
= decode_mod_u_d_type (dip
-> at_mod_u_d_type
);
856 type
= builtin_type_int
;
865 struct_type -- compute and return the type for a struct or union
869 static struct type *struct_type (struct dieinfo *dip, char *thisdie,
874 Given pointer to a die information structure for a die which
875 defines a union or structure, and pointers to the raw die data
876 that define the range of dies which define the members, compute
877 and return the user defined type for the structure or union.
881 DEFUN(struct_type
, (dip
, thisdie
, enddie
),
882 struct dieinfo
*dip AND
888 struct nextfield
*next
;
891 struct nextfield
*list
= NULL
;
892 struct nextfield
*new;
900 if ((type
= lookup_utype (dip
-> dieref
)) == NULL
)
902 type
= alloc_utype (dip
-> dieref
, NULL
);
904 if (dip
-> dietag
== TAG_structure_type
|| dip
-> dietag
== TAG_union_type
)
906 TYPE_CPLUS_SPECIFIC (type
) = (struct cplus_struct_type
*)
907 obstack_alloc (symbol_obstack
, sizeof (struct cplus_struct_type
));
908 (void) memset (TYPE_CPLUS_SPECIFIC (type
), 0,
909 sizeof (struct cplus_struct_type
));
910 if (dip
-> dietag
== TAG_structure_type
)
912 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
917 TYPE_CODE (type
) = TYPE_CODE_UNION
;
924 SQUAWK (("missing structure or union tag"));
925 TYPE_CODE (type
) = TYPE_CODE_UNDEF
;
927 /* Some compilers try to be helpful by inventing "fake" names for anonymous
928 enums, structures, and unions, like "~0fake". Thanks, but no thanks. */
929 if (dip
-> at_name
== NULL
|| *dip
-> at_name
== '~')
935 tpart2
= dip
-> at_name
;
937 if (dip
-> at_byte_size
== 0)
939 tpart3
= " <opaque>";
941 TYPE_LENGTH (type
) = dip
-> at_byte_size
;
944 TYPE_NAME (type
) = concat (tpart1
, tpart2
, tpart3
, NULL
);
945 thisdie
+= dip
-> dielength
;
946 while (thisdie
< enddie
)
948 basicdieinfo (&mbr
, thisdie
);
949 completedieinfo (&mbr
);
950 if (mbr
.dielength
<= sizeof (long))
957 /* Get space to record the next field's data. */
958 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
962 list
-> field
.name
= savestring (mbr
.at_name
, strlen (mbr
.at_name
));
963 list
-> field
.type
= decode_die_type (&mbr
);
964 list
-> field
.bitpos
= 8 * locval (mbr
.at_location
);
965 list
-> field
.bitsize
= 0;
969 SQUAWK (("bad member of '%s'", TYPE_NAME (type
)));
972 thisdie
+= mbr
.dielength
;
974 /* Now create the vector of fields, and record how big it is. */
975 TYPE_NFIELDS (type
) = nfields
;
976 TYPE_FIELDS (type
) = (struct field
*)
977 obstack_alloc (symbol_obstack
, sizeof (struct field
) * nfields
);
978 /* Copy the saved-up fields into the field vector. */
979 for (n
= nfields
; list
; list
= list
-> next
)
981 TYPE_FIELD (type
, --n
) = list
-> field
;
990 read_structure_scope -- process all dies within struct or union
994 static void read_structure_scope (struct dieinfo *dip,
995 char *thisdie, char *enddie)
999 Called when we find the DIE that starts a structure or union
1000 scope (definition) to process all dies that define the members
1001 of the structure or union. DIP is a pointer to the die info
1002 struct for the DIE that names the structure or union.
1006 Note that we need to call struct_type regardless of whether or not
1007 we have a symbol, since we might have a structure or union without
1008 a tag name (thus no symbol for the tagname).
1012 DEFUN(read_structure_scope
, (dip
, thisdie
, enddie
),
1013 struct dieinfo
*dip AND
1020 type
= struct_type (dip
, thisdie
, enddie
);
1021 if ((sym
= new_symbol (dip
)) != NULL
)
1023 SYMBOL_TYPE (sym
) = type
;
1031 decode_array_element_type -- decode type of the array elements
1035 static struct type *decode_array_element_type (char *scan, char *end)
1039 As the last step in decoding the array subscript information for an
1040 array DIE, we need to decode the type of the array elements. We are
1041 passed a pointer to this last part of the subscript information and
1042 must return the appropriate type. If the type attribute is not
1043 recognized, just warn about the problem and return type int.
1046 static struct type
*
1047 DEFUN(decode_array_element_type
, (scan
, end
), char *scan AND
char *end
)
1052 unsigned short fundtype
;
1054 (void) memcpy (&attribute
, scan
, sizeof (short));
1055 scan
+= sizeof (short);
1059 (void) memcpy (&fundtype
, scan
, sizeof (short));
1060 typep
= decode_fund_type (fundtype
);
1062 case AT_mod_fund_type
:
1063 typep
= decode_mod_fund_type (scan
);
1065 case AT_user_def_type
:
1066 (void) memcpy (&dieref
, scan
, sizeof (DIEREF
));
1067 if ((typep
= lookup_utype (dieref
)) == NULL
)
1069 typep
= alloc_utype (dieref
, NULL
);
1072 case AT_mod_u_d_type
:
1073 typep
= decode_mod_u_d_type (scan
);
1076 SQUAWK (("bad array element type attribute 0x%x", attribute
));
1077 typep
= builtin_type_int
;
1087 decode_subscr_data -- decode array subscript and element type data
1091 static struct type *decode_subscr_data (char *scan, char *end)
1095 The array subscripts and the data type of the elements of an
1096 array are described by a list of data items, stored as a block
1097 of contiguous bytes. There is a data item describing each array
1098 dimension, and a final data item describing the element type.
1099 The data items are ordered the same as their appearance in the
1100 source (I.E. leftmost dimension first, next to leftmost second,
1103 We are passed a pointer to the start of the block of bytes
1104 containing the data items, and a pointer to the first byte past
1105 the data. This function decodes the data and returns a type.
1108 FIXME: This code only implements the forms currently used
1109 by the AT&T and GNU C compilers.
1111 The end pointer is supplied for error checking, maybe we should
1115 static struct type
*
1116 DEFUN(decode_subscr_data
, (scan
, end
), char *scan AND
char *end
)
1118 struct type
*typep
= NULL
;
1119 struct type
*nexttype
;
1129 typep
= decode_array_element_type (scan
, end
);
1132 (void) memcpy (&fundtype
, scan
, sizeof (short));
1133 scan
+= sizeof (short);
1134 if (fundtype
!= FT_integer
&& fundtype
!= FT_signed_integer
1135 && fundtype
!= FT_unsigned_integer
)
1137 SQUAWK (("array subscripts must be integral types, not type 0x%x",
1142 (void) memcpy (&lowbound
, scan
, sizeof (long));
1143 scan
+= sizeof (long);
1144 (void) memcpy (&highbound
, scan
, sizeof (long));
1145 scan
+= sizeof (long);
1146 nexttype
= decode_subscr_data (scan
, end
);
1147 if (nexttype
!= NULL
)
1149 typep
= (struct type
*)
1150 obstack_alloc (symbol_obstack
, sizeof (struct type
));
1151 (void) memset (typep
, 0, sizeof (struct type
));
1152 TYPE_CODE (typep
) = TYPE_CODE_ARRAY
;
1153 TYPE_LENGTH (typep
) = TYPE_LENGTH (nexttype
);
1154 TYPE_LENGTH (typep
) *= lowbound
+ highbound
+ 1;
1155 TYPE_TARGET_TYPE (typep
) = nexttype
;
1166 SQUAWK (("array subscript format 0x%x not handled yet", format
));
1169 SQUAWK (("unknown array subscript format %x", format
));
1179 read_array_type -- read TAG_array_type DIE
1183 static void read_array_type (struct dieinfo *dip)
1187 Extract all information from a TAG_array_type DIE and add to
1188 the user defined type vector.
1192 DEFUN(read_array_type
, (dip
), struct dieinfo
*dip
)
1199 if (dip
-> at_ordering
!= ORD_row_major
)
1201 /* FIXME: Can gdb even handle column major arrays? */
1202 SQUAWK (("array not row major; not handled correctly"));
1204 if ((sub
= dip
-> at_subscr_data
) != NULL
)
1206 (void) memcpy (&temp
, sub
, sizeof (short));
1207 subend
= sub
+ sizeof (short) + temp
;
1208 sub
+= sizeof (short);
1209 type
= decode_subscr_data (sub
, subend
);
1212 type
= alloc_utype (dip
-> dieref
, NULL
);
1213 TYPE_CODE (type
) = TYPE_CODE_ARRAY
;
1214 TYPE_TARGET_TYPE (type
) = builtin_type_int
;
1215 TYPE_LENGTH (type
) = 1 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
));
1219 type
= alloc_utype (dip
-> dieref
, type
);
1228 read_subroutine_type -- process TAG_subroutine_type dies
1232 static void read_subroutine_type (struct dieinfo *dip, char thisdie,
1237 Handle DIES due to C code like:
1240 int (*funcp)(int a, long l); (Generates TAG_subroutine_type DIE)
1246 The parameter DIES are currently ignored. See if gdb has a way to
1247 include this info in it's type system, and decode them if so. Is
1248 this what the type structure's "arg_types" field is for? (FIXME)
1252 DEFUN(read_subroutine_type
, (dip
, thisdie
, enddie
),
1253 struct dieinfo
*dip AND
1259 type
= decode_die_type (dip
);
1260 type
= lookup_function_type (type
);
1261 type
= alloc_utype (dip
-> dieref
, type
);
1268 read_enumeration -- process dies which define an enumeration
1272 static void read_enumeration (struct dieinfo *dip, char *thisdie,
1277 Given a pointer to a die which begins an enumeration, process all
1278 the dies that define the members of the enumeration.
1282 Note that we need to call enum_type regardless of whether or not we
1283 have a symbol, since we might have an enum without a tag name (thus
1284 no symbol for the tagname).
1288 DEFUN(read_enumeration
, (dip
, thisdie
, enddie
),
1289 struct dieinfo
*dip AND
1296 type
= enum_type (dip
);
1297 if ((sym
= new_symbol (dip
)) != NULL
)
1299 SYMBOL_TYPE (sym
) = type
;
1307 enum_type -- decode and return a type for an enumeration
1311 static type *enum_type (struct dieinfo *dip)
1315 Given a pointer to a die information structure for the die which
1316 starts an enumeration, process all the dies that define the members
1317 of the enumeration and return a type pointer for the enumeration.
1320 static struct type
*
1321 DEFUN(enum_type
, (dip
), struct dieinfo
*dip
)
1325 struct nextfield
*next
;
1328 struct nextfield
*list
= NULL
;
1329 struct nextfield
*new;
1340 if ((type
= lookup_utype (dip
-> dieref
)) == NULL
)
1342 type
= alloc_utype (dip
-> dieref
, NULL
);
1344 TYPE_CODE (type
) = TYPE_CODE_ENUM
;
1346 /* Some compilers try to be helpful by inventing "fake" names for anonymous
1347 enums, structures, and unions, like "~0fake". Thanks, but no thanks. */
1348 if (dip
-> at_name
== NULL
|| *dip
-> at_name
== '~')
1352 tpart2
= dip
-> at_name
;
1354 if (dip
-> at_byte_size
== 0)
1356 tpart3
= " <opaque>";
1360 TYPE_LENGTH (type
) = dip
-> at_byte_size
;
1363 TYPE_NAME (type
) = concat (tpart1
, tpart2
, tpart3
, NULL
);
1364 if ((scan
= dip
-> at_element_list
) != NULL
)
1366 if (dip
-> short_element_list
)
1368 (void) memcpy (&stemp
, scan
, sizeof (stemp
));
1369 listend
= scan
+ stemp
+ sizeof (stemp
);
1370 scan
+= sizeof (stemp
);
1374 (void) memcpy (<emp
, scan
, sizeof (ltemp
));
1375 listend
= scan
+ ltemp
+ sizeof (ltemp
);
1376 scan
+= sizeof (ltemp
);
1378 while (scan
< listend
)
1380 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
1383 list
-> field
.type
= NULL
;
1384 list
-> field
.bitsize
= 0;
1385 (void) memcpy (&list
-> field
.bitpos
, scan
, sizeof (long));
1386 scan
+= sizeof (long);
1387 list
-> field
.name
= savestring (scan
, strlen (scan
));
1388 scan
+= strlen (scan
) + 1;
1392 /* Now create the vector of fields, and record how big it is. */
1393 TYPE_NFIELDS (type
) = nfields
;
1394 TYPE_FIELDS (type
) = (struct field
*)
1395 obstack_alloc (symbol_obstack
, sizeof (struct field
) * nfields
);
1396 /* Copy the saved-up fields into the field vector. */
1397 for (n
= nfields
; list
; list
= list
-> next
)
1399 TYPE_FIELD (type
, --n
) = list
-> field
;
1408 read_func_scope -- process all dies within a function scope
1412 Process all dies within a given function scope. We are passed
1413 a die information structure pointer DIP for the die which
1414 starts the function scope, and pointers into the raw die data
1415 that define the dies within the function scope.
1417 For now, we ignore lexical block scopes within the function.
1418 The problem is that AT&T cc does not define a DWARF lexical
1419 block scope for the function itself, while gcc defines a
1420 lexical block scope for the function. We need to think about
1421 how to handle this difference, or if it is even a problem.
1426 DEFUN(read_func_scope
, (dip
, thisdie
, enddie
, objfile
),
1427 struct dieinfo
*dip AND
1430 struct objfile
*objfile
)
1434 if (entry_point
>= dip
-> at_low_pc
&& entry_point
< dip
-> at_high_pc
)
1436 entry_scope_lowpc
= dip
-> at_low_pc
;
1437 entry_scope_highpc
= dip
-> at_high_pc
;
1439 if (strcmp (dip
-> at_name
, "main") == 0) /* FIXME: hardwired name */
1441 main_scope_lowpc
= dip
-> at_low_pc
;
1442 main_scope_highpc
= dip
-> at_high_pc
;
1444 sym
= new_symbol (dip
);
1445 openscope (sym
, dip
-> at_low_pc
, dip
-> at_high_pc
);
1446 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
1454 read_file_scope -- process all dies within a file scope
1458 Process all dies within a given file scope. We are passed a
1459 pointer to the die information structure for the die which
1460 starts the file scope, and pointers into the raw die data which
1461 mark the range of dies within the file scope.
1463 When the partial symbol table is built, the file offset for the line
1464 number table for each compilation unit is saved in the partial symbol
1465 table entry for that compilation unit. As the symbols for each
1466 compilation unit are read, the line number table is read into memory
1467 and the variable lnbase is set to point to it. Thus all we have to
1468 do is use lnbase to access the line number table for the current
1473 DEFUN(read_file_scope
, (dip
, thisdie
, enddie
, objfile
),
1474 struct dieinfo
*dip AND
1477 struct objfile
*objfile
)
1479 struct cleanup
*back_to
;
1481 if (entry_point
>= dip
-> at_low_pc
&& entry_point
< dip
-> at_high_pc
)
1483 startup_file_start
= dip
-> at_low_pc
;
1484 startup_file_end
= dip
-> at_high_pc
;
1486 numutypes
= (enddie
- thisdie
) / 4;
1487 utypes
= (struct type
**) xmalloc (numutypes
* sizeof (struct type
*));
1488 back_to
= make_cleanup (free
, utypes
);
1489 (void) memset (utypes
, 0, numutypes
* sizeof (struct type
*));
1491 openscope (NULL
, dip
-> at_low_pc
, dip
-> at_high_pc
);
1492 decode_line_numbers (lnbase
);
1493 process_dies (thisdie
+ dip
-> dielength
, enddie
, objfile
);
1495 end_symtab (dip
-> at_name
, dip
-> at_language
, objfile
);
1496 do_cleanups (back_to
);
1505 start_symtab -- do initialization for starting new symbol table
1509 static void start_symtab (void)
1513 Called whenever we are starting to process dies for a new
1514 compilation unit, to perform initializations. Right now
1515 the only thing we really have to do is initialize storage
1516 space for the line number vector.
1521 DEFUN_VOID (start_symtab
)
1525 line_vector_index
= 0;
1526 line_vector_length
= 1000;
1527 nbytes
= sizeof (struct linetable
);
1528 nbytes
+= line_vector_length
* sizeof (struct linetable_entry
);
1529 line_vector
= (struct linetable
*) xmalloc (nbytes
);
1536 process_dies -- process a range of DWARF Information Entries
1540 static void process_dies (char *thisdie, char *enddie)
1544 Process all DIE's in a specified range. May be (and almost
1545 certainly will be) called recursively.
1549 DEFUN(process_dies
, (thisdie
, enddie
, objfile
),
1550 char *thisdie AND
char *enddie AND
struct objfile
*objfile
)
1555 while (thisdie
< enddie
)
1557 basicdieinfo (&di
, thisdie
);
1558 if (di
.dielength
< sizeof (long))
1562 else if (di
.dietag
== TAG_padding
)
1564 nextdie
= thisdie
+ di
.dielength
;
1568 completedieinfo (&di
);
1569 if (di
.at_sibling
!= 0)
1571 nextdie
= dbbase
+ di
.at_sibling
- dbroff
;
1575 nextdie
= thisdie
+ di
.dielength
;
1579 case TAG_compile_unit
:
1580 read_file_scope (&di
, thisdie
, nextdie
, objfile
);
1582 case TAG_global_subroutine
:
1583 case TAG_subroutine
:
1584 if (di
.has_at_low_pc
)
1586 read_func_scope (&di
, thisdie
, nextdie
, objfile
);
1589 case TAG_lexical_block
:
1590 read_lexical_block_scope (&di
, thisdie
, nextdie
, objfile
);
1592 case TAG_structure_type
:
1593 case TAG_union_type
:
1594 read_structure_scope (&di
, thisdie
, nextdie
);
1596 case TAG_enumeration_type
:
1597 read_enumeration (&di
, thisdie
, nextdie
);
1599 case TAG_subroutine_type
:
1600 read_subroutine_type (&di
, thisdie
, nextdie
);
1602 case TAG_array_type
:
1603 read_array_type (&di
);
1606 (void) new_symbol (&di
);
1618 end_symtab -- finish processing for a compilation unit
1622 static void end_symtab (char *filename, long language)
1626 Complete the symbol table entry for the current compilation
1627 unit. Make the struct symtab and put it on the list of all
1633 DEFUN(end_symtab
, (filename
, language
, objfile
),
1634 char *filename AND
long language AND
struct objfile
*objfile
)
1636 struct symtab
*symtab
;
1637 struct blockvector
*blockvector
;
1640 /* Ignore a file that has no functions with real debugging info. */
1641 if (global_symbols
== NULL
&& scopetree
-> block
== NULL
)
1645 line_vector_length
= -1;
1646 freescope (scopetree
);
1647 scope
= scopetree
= NULL
;
1650 /* Create the blockvector that points to all the file's blocks. */
1652 blockvector
= make_blockvector ();
1654 /* Now create the symtab object for this source file. */
1656 symtab
= allocate_symtab (savestring (filename
, strlen (filename
)),
1659 symtab
-> free_ptr
= 0;
1661 /* Fill in its components. */
1662 symtab
-> blockvector
= blockvector
;
1663 symtab
-> free_code
= free_linetable
;
1665 /* Save the line number information. */
1667 line_vector
-> nitems
= line_vector_index
;
1668 nbytes
= sizeof (struct linetable
);
1669 if (line_vector_index
> 1)
1671 nbytes
+= (line_vector_index
- 1) * sizeof (struct linetable_entry
);
1673 symtab
-> linetable
= (struct linetable
*) xrealloc (line_vector
, nbytes
);
1675 /* FIXME: The following may need to be expanded for other languages */
1680 symtab
-> language
= language_c
;
1682 case LANG_C_PLUS_PLUS
:
1683 symtab
-> language
= language_cplus
;
1689 /* Link the new symtab into the list of such. */
1690 symtab
-> next
= symtab_list
;
1691 symtab_list
= symtab
;
1693 /* Recursively free the scope tree */
1694 freescope (scopetree
);
1695 scope
= scopetree
= NULL
;
1697 /* Reinitialize for beginning of new file. */
1699 line_vector_length
= -1;
1706 scopecount -- count the number of enclosed scopes
1710 static int scopecount (struct scopenode *node)
1714 Given pointer to a node, compute the size of the subtree which is
1715 rooted in this node, which also happens to be the number of scopes
1720 DEFUN(scopecount
, (node
), struct scopenode
*node
)
1726 count
+= scopecount (node
-> child
);
1727 count
+= scopecount (node
-> sibling
);
1737 openscope -- start a new lexical block scope
1741 static void openscope (struct symbol *namesym, CORE_ADDR lowpc,
1746 Start a new scope by allocating a new scopenode, adding it as the
1747 next child of the current scope (if any) or as the root of the
1748 scope tree, and then making the new node the current scope node.
1752 DEFUN(openscope
, (namesym
, lowpc
, highpc
),
1753 struct symbol
*namesym AND
1757 struct scopenode
*new;
1758 struct scopenode
*child
;
1760 new = (struct scopenode
*) xmalloc (sizeof (*new));
1761 (void) memset (new, 0, sizeof (*new));
1762 new -> namesym
= namesym
;
1763 new -> lowpc
= lowpc
;
1764 new -> highpc
= highpc
;
1769 else if ((child
= scope
-> child
) == NULL
)
1771 scope
-> child
= new;
1772 new -> parent
= scope
;
1776 while (child
-> sibling
!= NULL
)
1778 child
= child
-> sibling
;
1780 child
-> sibling
= new;
1781 new -> parent
= scope
;
1790 freescope -- free a scope tree rooted at the given node
1794 static void freescope (struct scopenode *node)
1798 Given a pointer to a node in the scope tree, free the subtree
1799 rooted at that node. First free all the children and sibling
1800 nodes, and then the node itself. Used primarily for cleaning
1801 up after ourselves and returning memory to the system.
1805 DEFUN(freescope
, (node
), struct scopenode
*node
)
1809 freescope (node
-> child
);
1810 freescope (node
-> sibling
);
1819 buildblock -- build a new block from pending symbols list
1823 static struct block *buildblock (struct pending_symbol *syms)
1827 Given a pointer to a list of symbols, build a new block and free
1828 the symbol list structure. Also check each symbol to see if it
1829 is the special symbol that flags that this block was compiled by
1830 gcc, and if so, mark the block appropriately.
1833 static struct block
*
1834 DEFUN(buildblock
, (syms
), struct pending_symbol
*syms
)
1836 struct pending_symbol
*next
, *next1
;
1838 struct block
*newblock
;
1841 for (next
= syms
, i
= 0 ; next
; next
= next
-> next
, i
++) {;}
1843 /* Allocate a new block */
1845 nbytes
= sizeof (struct block
);
1848 nbytes
+= (i
- 1) * sizeof (struct symbol
*);
1850 newblock
= (struct block
*) obstack_alloc (symbol_obstack
, nbytes
);
1851 (void) memset (newblock
, 0, nbytes
);
1853 /* Copy the symbols into the block. */
1855 BLOCK_NSYMS (newblock
) = i
;
1856 for (next
= syms
; next
; next
= next
-> next
)
1858 BLOCK_SYM (newblock
, --i
) = next
-> symbol
;
1859 if (STREQ (GCC_COMPILED_FLAG_SYMBOL
, SYMBOL_NAME (next
-> symbol
)) ||
1860 STREQ (GCC2_COMPILED_FLAG_SYMBOL
, SYMBOL_NAME (next
-> symbol
)))
1862 BLOCK_GCC_COMPILED (newblock
) = 1;
1866 /* Now free the links of the list, and empty the list. */
1868 for (next
= syms
; next
; next
= next1
)
1870 next1
= next
-> next
;
1881 closescope -- close a lexical block scope
1885 static void closescope (void)
1889 Close the current lexical block scope. Closing the current scope
1890 is as simple as moving the current scope pointer up to the parent
1891 of the current scope pointer. But we also take this opportunity
1892 to build the block for the current scope first, since we now have
1893 all of it's symbols.
1897 DEFUN_VOID(closescope
)
1899 struct scopenode
*child
;
1903 error ("DWARF parse error, too many close scopes");
1907 if (scope
-> parent
== NULL
)
1909 global_symbol_block
= buildblock (global_symbols
);
1910 global_symbols
= NULL
;
1911 BLOCK_START (global_symbol_block
) = scope
-> lowpc
+ baseaddr
;
1912 BLOCK_END (global_symbol_block
) = scope
-> highpc
+ baseaddr
;
1914 scope
-> block
= buildblock (scope
-> symbols
);
1915 scope
-> symbols
= NULL
;
1916 BLOCK_START (scope
-> block
) = scope
-> lowpc
+ baseaddr
;
1917 BLOCK_END (scope
-> block
) = scope
-> highpc
+ baseaddr
;
1919 /* Put the local block in as the value of the symbol that names it. */
1921 if (scope
-> namesym
)
1923 SYMBOL_BLOCK_VALUE (scope
-> namesym
) = scope
-> block
;
1924 BLOCK_FUNCTION (scope
-> block
) = scope
-> namesym
;
1927 /* Install this scope's local block as the superblock of all child
1930 for (child
= scope
-> child
; child
; child
= child
-> sibling
)
1932 BLOCK_SUPERBLOCK (child
-> block
) = scope
-> block
;
1935 scope
= scope
-> parent
;
1943 record_line -- record a line number entry in the line vector
1947 static void record_line (int line, CORE_ADDR pc)
1951 Given a line number and the corresponding pc value, record
1952 this pair in the line number vector, expanding the vector as
1957 DEFUN(record_line
, (line
, pc
), int line AND CORE_ADDR pc
)
1959 struct linetable_entry
*e
;
1962 /* Make sure line vector is big enough. */
1964 if (line_vector_index
+ 2 >= line_vector_length
)
1966 line_vector_length
*= 2;
1967 nbytes
= sizeof (struct linetable
);
1968 nbytes
+= (line_vector_length
* sizeof (struct linetable_entry
));
1969 line_vector
= (struct linetable
*) xrealloc (line_vector
, nbytes
);
1971 e
= line_vector
-> item
+ line_vector_index
++;
1980 decode_line_numbers -- decode a line number table fragment
1984 static void decode_line_numbers (char *tblscan, char *tblend,
1985 long length, long base, long line, long pc)
1989 Translate the DWARF line number information to gdb form.
1991 The ".line" section contains one or more line number tables, one for
1992 each ".line" section from the objects that were linked.
1994 The AT_stmt_list attribute for each TAG_source_file entry in the
1995 ".debug" section contains the offset into the ".line" section for the
1996 start of the table for that file.
1998 The table itself has the following structure:
2000 <table length><base address><source statement entry>
2001 4 bytes 4 bytes 10 bytes
2003 The table length is the total size of the table, including the 4 bytes
2004 for the length information.
2006 The base address is the address of the first instruction generated
2007 for the source file.
2009 Each source statement entry has the following structure:
2011 <line number><statement position><address delta>
2012 4 bytes 2 bytes 4 bytes
2014 The line number is relative to the start of the file, starting with
2017 The statement position either -1 (0xFFFF) or the number of characters
2018 from the beginning of the line to the beginning of the statement.
2020 The address delta is the difference between the base address and
2021 the address of the first instruction for the statement.
2023 Note that we must copy the bytes from the packed table to our local
2024 variables before attempting to use them, to avoid alignment problems
2025 on some machines, particularly RISC processors.
2029 Does gdb expect the line numbers to be sorted? They are now by
2030 chance/luck, but are not required to be. (FIXME)
2032 The line with number 0 is unused, gdb apparently can discover the
2033 span of the last line some other way. How? (FIXME)
2037 DEFUN(decode_line_numbers
, (linetable
), char *linetable
)
2046 if (linetable
!= NULL
)
2048 tblscan
= tblend
= linetable
;
2049 (void) memcpy (&length
, tblscan
, sizeof (long));
2050 tblscan
+= sizeof (long);
2052 (void) memcpy (&base
, tblscan
, sizeof (long));
2054 tblscan
+= sizeof (long);
2055 while (tblscan
< tblend
)
2057 (void) memcpy (&line
, tblscan
, sizeof (long));
2058 tblscan
+= sizeof (long) + sizeof (short);
2059 (void) memcpy (&pc
, tblscan
, sizeof (long));
2060 tblscan
+= sizeof (long);
2064 record_line (line
, pc
);
2074 add_symbol_to_list -- add a symbol to head of current symbol list
2078 static void add_symbol_to_list (struct symbol *symbol, struct
2079 pending_symbol **listhead)
2083 Given a pointer to a symbol and a pointer to a pointer to a
2084 list of symbols, add this symbol as the current head of the
2085 list. Typically used for example to add a symbol to the
2086 symbol list for the current scope.
2091 DEFUN(add_symbol_to_list
, (symbol
, listhead
),
2092 struct symbol
*symbol AND
struct pending_symbol
**listhead
)
2094 struct pending_symbol
*link
;
2098 link
= (struct pending_symbol
*) xmalloc (sizeof (*link
));
2099 link
-> next
= *listhead
;
2100 link
-> symbol
= symbol
;
2109 gatherblocks -- walk a scope tree and build block vectors
2113 static struct block **gatherblocks (struct block **dest,
2114 struct scopenode *node)
2118 Recursively walk a scope tree rooted in the given node, adding blocks
2119 to the array pointed to by DEST, in preorder. I.E., first we add the
2120 block for the current scope, then all the blocks for child scopes,
2121 and finally all the blocks for sibling scopes.
2124 static struct block
**
2125 DEFUN(gatherblocks
, (dest
, node
),
2126 struct block
**dest AND
struct scopenode
*node
)
2130 *dest
++ = node
-> block
;
2131 dest
= gatherblocks (dest
, node
-> child
);
2132 dest
= gatherblocks (dest
, node
-> sibling
);
2141 make_blockvector -- make a block vector from current scope tree
2145 static struct blockvector *make_blockvector (void)
2149 Make a blockvector from all the blocks in the current scope tree.
2150 The first block is always the global symbol block, followed by the
2151 block for the root of the scope tree which is the local symbol block,
2152 followed by all the remaining blocks in the scope tree, which are all
2157 Note that since the root node of the scope tree is created at the time
2158 each file scope is entered, there are always at least two blocks,
2159 neither of which may have any symbols, but always contribute a block
2160 to the block vector. So the test for number of blocks greater than 1
2161 below is unnecessary given bug free code.
2163 The resulting block structure varies slightly from that produced
2164 by dbxread.c, in that block 0 and block 1 are sibling blocks while
2165 with dbxread.c, block 1 is a child of block 0. This does not
2166 seem to cause any problems, but probably should be fixed. (FIXME)
2169 static struct blockvector
*
2170 DEFUN_VOID(make_blockvector
)
2172 struct blockvector
*blockvector
= NULL
;
2176 /* Recursively walk down the tree, counting the number of blocks.
2177 Then add one to account for the global's symbol block */
2179 i
= scopecount (scopetree
) + 1;
2180 nbytes
= sizeof (struct blockvector
);
2183 nbytes
+= (i
- 1) * sizeof (struct block
*);
2185 blockvector
= (struct blockvector
*)
2186 obstack_alloc (symbol_obstack
, nbytes
);
2188 /* Copy the blocks into the blockvector. */
2190 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
2191 BLOCKVECTOR_BLOCK (blockvector
, 0) = global_symbol_block
;
2192 gatherblocks (&BLOCKVECTOR_BLOCK (blockvector
, 1), scopetree
);
2194 return (blockvector
);
2201 locval -- compute the value of a location attribute
2205 static int locval (char *loc)
2209 Given pointer to a string of bytes that define a location, compute
2210 the location and return the value.
2212 When computing values involving the current value of the frame pointer,
2213 the value zero is used, which results in a value relative to the frame
2214 pointer, rather than the absolute value. This is what GDB wants
2217 When the result is a register number, the global isreg flag is set,
2218 otherwise it is cleared. This is a kludge until we figure out a better
2219 way to handle the problem. Gdb's design does not mesh well with the
2220 DWARF notion of a location computing interpreter, which is a shame
2221 because the flexibility goes unused.
2225 Note that stack[0] is unused except as a default error return.
2226 Note that stack overflow is not yet handled.
2230 DEFUN(locval
, (loc
), char *loc
)
2232 unsigned short nbytes
;
2238 (void) memcpy (&nbytes
, loc
, sizeof (short));
2239 end
= loc
+ sizeof (short) + nbytes
;
2243 for (loc
+= sizeof (short); loc
< end
; loc
+= sizeof (long))
2251 /* push register (number) */
2252 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2256 /* push value of register (number) */
2257 /* Actually, we compute the value as if register has 0 */
2258 (void) memcpy (®no
, loc
, sizeof (long));
2261 stack
[++stacki
] = 0;
2265 stack
[++stacki
] = 0;
2266 SQUAWK (("BASEREG %d not handled!", regno
));
2270 /* push address (relocated address) */
2271 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2274 /* push constant (number) */
2275 (void) memcpy (&stack
[++stacki
], loc
, sizeof (long));
2278 /* pop, deref and push 2 bytes (as a long) */
2279 SQUAWK (("OP_DEREF2 address %#x not handled", stack
[stacki
]));
2281 case OP_DEREF4
: /* pop, deref and push 4 bytes (as a long) */
2282 SQUAWK (("OP_DEREF4 address %#x not handled", stack
[stacki
]));
2284 case OP_ADD
: /* pop top 2 items, add, push result */
2285 stack
[stacki
- 1] += stack
[stacki
];
2290 return (stack
[stacki
]);
2297 read_ofile_symtab -- build a full symtab entry from chunk of DIE's
2301 static struct symtab *read_ofile_symtab (struct partial_symtab *pst)
2305 OFFSET is a relocation offset which gets added to each symbol (FIXME).
2308 static struct symtab
*
2309 DEFUN(read_ofile_symtab
, (pst
),
2310 struct partial_symtab
*pst
)
2312 struct cleanup
*back_to
;
2315 bfd
*abfd
= pst
->objfile
->obfd
;
2317 /* Allocate a buffer for the entire chunk of DIE's for this compilation
2318 unit, seek to the location in the file, and read in all the DIE's. */
2321 dbbase
= xmalloc (DBLENGTH(pst
));
2322 dbroff
= DBROFF(pst
);
2323 foffset
= DBFOFF(pst
) + dbroff
;
2324 if (bfd_seek (abfd
, foffset
, 0) ||
2325 (bfd_read (dbbase
, DBLENGTH(pst
), 1, abfd
) != DBLENGTH(pst
)))
2328 error ("can't read DWARF data");
2330 back_to
= make_cleanup (free
, dbbase
);
2332 /* If there is a line number table associated with this compilation unit
2333 then read the first long word from the line number table fragment, which
2334 contains the size of the fragment in bytes (including the long word
2335 itself). Allocate a buffer for the fragment and read it in for future
2341 if (bfd_seek (abfd
, LNFOFF (pst
), 0) ||
2342 (bfd_read (&lnsize
, sizeof(long), 1, abfd
) != sizeof(long)))
2344 error ("can't read DWARF line number table size");
2346 lnbase
= xmalloc (lnsize
);
2347 if (bfd_seek (abfd
, LNFOFF (pst
), 0) ||
2348 (bfd_read (lnbase
, lnsize
, 1, abfd
) != lnsize
))
2351 error ("can't read DWARF line numbers");
2353 make_cleanup (free
, lnbase
);
2356 process_dies (dbbase
, dbbase
+ DBLENGTH(pst
), pst
->objfile
);
2357 do_cleanups (back_to
);
2358 return (symtab_list
);
2365 psymtab_to_symtab_1 -- do grunt work for building a full symtab entry
2369 static void psymtab_to_symtab_1 (struct partial_symtab *pst)
2373 Called once for each partial symbol table entry that needs to be
2374 expanded into a full symbol table entry.
2379 DEFUN(psymtab_to_symtab_1
,
2381 struct partial_symtab
*pst
)
2391 fprintf (stderr
, "Psymtab for %s already read in. Shouldn't happen.\n",
2396 /* Read in all partial symtabs on which this one is dependent */
2397 for (i
= 0; i
< pst
-> number_of_dependencies
; i
++)
2398 if (!pst
-> dependencies
[i
] -> readin
)
2400 /* Inform about additional files that need to be read in. */
2403 fputs_filtered (" ", stdout
);
2405 fputs_filtered ("and ", stdout
);
2407 printf_filtered ("%s...", pst
-> dependencies
[i
] -> filename
);
2408 wrap_here (""); /* Flush output */
2411 psymtab_to_symtab_1 (pst
-> dependencies
[i
]);
2414 if (DBLENGTH(pst
)) /* Otherwise it's a dummy */
2416 /* Init stuff necessary for reading in symbols */
2417 pst
-> symtab
= read_ofile_symtab (pst
);
2420 printf_filtered ("%d DIE's, sorting...", diecount
);
2423 sort_symtab_syms (pst
-> symtab
);
2432 dwarf_psymtab_to_symtab -- build a full symtab entry from partial one
2436 static void dwarf_psymtab_to_symtab (struct partial_symtab *pst)
2440 This is the DWARF support entry point for building a full symbol
2441 table entry from a partial symbol table entry. We are passed a
2442 pointer to the partial symbol table entry that needs to be expanded.
2447 DEFUN(dwarf_psymtab_to_symtab
, (pst
), struct partial_symtab
*pst
)
2456 fprintf (stderr
, "Psymtab for %s already read in. Shouldn't happen.\n",
2461 if (DBLENGTH(pst
) || pst
-> number_of_dependencies
)
2463 /* Print the message now, before starting serious work, to avoid
2464 disconcerting pauses. */
2467 printf_filtered ("Reading in symbols for %s...", pst
-> filename
);
2471 psymtab_to_symtab_1 (pst
);
2473 #if 0 /* FIXME: Check to see what dbxread is doing here and see if
2474 we need to do an equivalent or is this something peculiar to
2475 stabs/a.out format. */
2476 /* Match with global symbols. This only needs to be done once,
2477 after all of the symtabs and dependencies have been read in. */
2478 scan_file_globals ();
2481 /* Finish up the debug error message. */
2484 printf_filtered ("done.\n");
2493 init_psymbol_list -- initialize storage for partial symbols
2497 static void init_psymbol_list (int total_symbols)
2501 Initializes storage for all of the partial symbols that will be
2502 created by dwarf_build_psymtabs and subsidiaries.
2506 DEFUN(init_psymbol_list
, (total_symbols
), int total_symbols
)
2508 /* Free any previously allocated psymbol lists. */
2510 if (global_psymbols
.list
)
2512 free (global_psymbols
.list
);
2514 if (static_psymbols
.list
)
2516 free (static_psymbols
.list
);
2519 /* Current best guess is that there are approximately a twentieth
2520 of the total symbols (in a debugging file) are global or static
2523 global_psymbols
.size
= total_symbols
/ 10;
2524 static_psymbols
.size
= total_symbols
/ 10;
2525 global_psymbols
.next
= global_psymbols
.list
= (struct partial_symbol
*)
2526 xmalloc (global_psymbols
.size
* sizeof (struct partial_symbol
));
2527 static_psymbols
.next
= static_psymbols
.list
= (struct partial_symbol
*)
2528 xmalloc (static_psymbols
.size
* sizeof (struct partial_symbol
));
2535 start_psymtab -- allocate and partially fill a partial symtab entry
2539 Allocate and partially fill a partial symtab. It will be completely
2540 filled at the end of the symbol list.
2542 SYMFILE_NAME is the name of the symbol-file we are reading from, and
2543 ADDR is the address relative to which its symbols are (incremental)
2544 or 0 (normal). FILENAME is the name of the compilation unit that
2545 these symbols were defined in, and they appear starting a address
2546 TEXTLOW. DBROFF is the absolute file offset in SYMFILE_NAME where
2547 the full symbols can be read for compilation unit FILENAME.
2548 GLOBAL_SYMS and STATIC_SYMS are pointers to the current end of the
2553 static struct partial_symtab
*
2554 DEFUN(start_psymtab
,
2555 (objfile
, addr
, filename
, textlow
, texthigh
, dbfoff
, curoff
,
2556 culength
, lnfoff
, global_syms
, static_syms
),
2557 struct objfile
*objfile AND
2560 CORE_ADDR textlow AND
2561 CORE_ADDR texthigh AND
2566 struct partial_symbol
*global_syms AND
2567 struct partial_symbol
*static_syms
)
2569 struct partial_symtab
*result
;
2571 result
= (struct partial_symtab
*)
2572 obstack_alloc (psymbol_obstack
, sizeof (struct partial_symtab
));
2573 (void) memset (result
, 0, sizeof (struct partial_symtab
));
2574 result
-> addr
= addr
;
2575 result
-> objfile
= objfile
;
2576 result
-> filename
= create_name (filename
, psymbol_obstack
);
2577 result
-> textlow
= textlow
;
2578 result
-> texthigh
= texthigh
;
2579 result
-> read_symtab_private
= (char *) obstack_alloc (psymbol_obstack
,
2580 sizeof (struct dwfinfo
));
2581 DBFOFF (result
) = dbfoff
;
2582 DBROFF (result
) = curoff
;
2583 DBLENGTH (result
) = culength
;
2584 LNFOFF (result
) = lnfoff
;
2585 result
-> readin
= 0;
2586 result
-> symtab
= NULL
;
2587 result
-> read_symtab
= dwarf_psymtab_to_symtab
;
2588 result
-> globals_offset
= global_syms
- global_psymbols
.list
;
2589 result
-> statics_offset
= static_syms
- static_psymbols
.list
;
2591 result
->n_global_syms
= 0;
2592 result
->n_static_syms
= 0;
2601 add_psymbol_to_list -- add a partial symbol to given list
2605 Add a partial symbol to one of the partial symbol vectors (pointed to
2606 by listp). The vector is grown as necessary.
2611 DEFUN(add_psymbol_to_list
,
2612 (listp
, name
, space
, class, value
),
2613 struct psymbol_allocation_list
*listp AND
2615 enum namespace space AND
2616 enum address_class
class AND
2619 struct partial_symbol
*psym
;
2622 if (listp
-> next
>= listp
-> list
+ listp
-> size
)
2624 newsize
= listp
-> size
* 2;
2625 listp
-> list
= (struct partial_symbol
*)
2626 xrealloc (listp
-> list
, (newsize
* sizeof (struct partial_symbol
)));
2627 /* Next assumes we only went one over. Should be good if program works
2629 listp
-> next
= listp
-> list
+ listp
-> size
;
2630 listp
-> size
= newsize
;
2632 psym
= listp
-> next
++;
2633 SYMBOL_NAME (psym
) = create_name (name
, psymbol_obstack
);
2634 SYMBOL_NAMESPACE (psym
) = space
;
2635 SYMBOL_CLASS (psym
) = class;
2636 SYMBOL_VALUE (psym
) = value
;
2643 add_partial_symbol -- add symbol to partial symbol table
2647 Given a DIE, if it is one of the types that we want to
2648 add to a partial symbol table, finish filling in the die info
2649 and then add a partial symbol table entry for it.
2654 DEFUN(add_partial_symbol
, (dip
), struct dieinfo
*dip
)
2656 switch (dip
-> dietag
)
2658 case TAG_global_subroutine
:
2659 record_misc_function (dip
-> at_name
, dip
-> at_low_pc
, mf_text
);
2660 add_psymbol_to_list (&global_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2661 LOC_BLOCK
, dip
-> at_low_pc
);
2663 case TAG_global_variable
:
2664 record_misc_function (dip
-> at_name
, locval (dip
-> at_location
),
2666 add_psymbol_to_list (&global_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2669 case TAG_subroutine
:
2670 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2671 LOC_BLOCK
, dip
-> at_low_pc
);
2673 case TAG_local_variable
:
2674 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2678 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, VAR_NAMESPACE
,
2681 case TAG_structure_type
:
2682 case TAG_union_type
:
2683 case TAG_enumeration_type
:
2684 add_psymbol_to_list (&static_psymbols
, dip
-> at_name
, STRUCT_NAMESPACE
,
2694 scan_partial_symbols -- scan DIE's within a single compilation unit
2698 Process the DIE's within a single compilation unit, looking for
2699 interesting DIE's that contribute to the partial symbol table entry
2700 for this compilation unit. Since we cannot follow any sibling
2701 chains without reading the complete DIE info for every DIE,
2702 it is probably faster to just sequentially check each one to
2703 see if it is one of the types we are interested in, and if
2704 so, then extracting all the attributes info and generating a
2705 partial symbol table entry.
2709 Don't attempt to add anonymous structures, unions, or enumerations
2710 since they have no name. Also, for variables and subroutines,
2711 check that this is the place where the actual definition occurs,
2712 rather than just a reference to an external.
2717 DEFUN(scan_partial_symbols
, (thisdie
, enddie
), char *thisdie AND
char *enddie
)
2722 while (thisdie
< enddie
)
2724 basicdieinfo (&di
, thisdie
);
2725 if (di
.dielength
< sizeof (long))
2731 nextdie
= thisdie
+ di
.dielength
;
2734 case TAG_global_subroutine
:
2735 case TAG_subroutine
:
2736 case TAG_global_variable
:
2737 case TAG_local_variable
:
2738 completedieinfo (&di
);
2739 if (di
.at_name
&& (di
.has_at_low_pc
|| di
.at_location
))
2741 add_partial_symbol (&di
);
2745 case TAG_structure_type
:
2746 case TAG_union_type
:
2747 case TAG_enumeration_type
:
2748 completedieinfo (&di
);
2751 add_partial_symbol (&di
);
2764 scan_compilation_units -- build a psymtab entry for each compilation
2768 This is the top level dwarf parsing routine for building partial
2771 It scans from the beginning of the DWARF table looking for the first
2772 TAG_compile_unit DIE, and then follows the sibling chain to locate
2773 each additional TAG_compile_unit DIE.
2775 For each TAG_compile_unit DIE it creates a partial symtab structure,
2776 calls a subordinate routine to collect all the compilation unit's
2777 global DIE's, file scope DIEs, typedef DIEs, etc, and then links the
2778 new partial symtab structure into the partial symbol table. It also
2779 records the appropriate information in the partial symbol table entry
2780 to allow the chunk of DIE's and line number table for this compilation
2781 unit to be located and re-read later, to generate a complete symbol
2782 table entry for the compilation unit.
2784 Thus it effectively partitions up a chunk of DIE's for multiple
2785 compilation units into smaller DIE chunks and line number tables,
2786 and associates them with a partial symbol table entry.
2790 If any compilation unit has no line number table associated with
2791 it for some reason (a missing at_stmt_list attribute, rather than
2792 just one with a value of zero, which is valid) then we ensure that
2793 the recorded file offset is zero so that the routine which later
2794 reads line number table fragments knows that there is no fragment
2804 DEFUN(scan_compilation_units
,
2805 (filename
, addr
, thisdie
, enddie
, dbfoff
, lnoffset
, objfile
),
2810 unsigned int dbfoff AND
2811 unsigned int lnoffset AND
2812 struct objfile
*objfile
)
2816 struct partial_symtab
*pst
;
2821 while (thisdie
< enddie
)
2823 basicdieinfo (&di
, thisdie
);
2824 if (di
.dielength
< sizeof (long))
2828 else if (di
.dietag
!= TAG_compile_unit
)
2830 nextdie
= thisdie
+ di
.dielength
;
2834 completedieinfo (&di
);
2835 if (di
.at_sibling
!= 0)
2837 nextdie
= dbbase
+ di
.at_sibling
- dbroff
;
2841 nextdie
= thisdie
+ di
.dielength
;
2843 curoff
= thisdie
- dbbase
;
2844 culength
= nextdie
- thisdie
;
2845 curlnoffset
= di
.has_at_stmt_list
? lnoffset
+ di
.at_stmt_list
: 0;
2846 pst
= start_psymtab (objfile
, addr
, di
.at_name
,
2847 di
.at_low_pc
, di
.at_high_pc
,
2848 dbfoff
, curoff
, culength
, curlnoffset
,
2849 global_psymbols
.next
,
2850 static_psymbols
.next
);
2851 scan_partial_symbols (thisdie
+ di
.dielength
, nextdie
);
2852 pst
-> n_global_syms
= global_psymbols
.next
-
2853 (global_psymbols
.list
+ pst
-> globals_offset
);
2854 pst
-> n_static_syms
= static_psymbols
.next
-
2855 (static_psymbols
.list
+ pst
-> statics_offset
);
2856 /* Sort the global list; don't sort the static list */
2857 qsort (global_psymbols
.list
+ pst
-> globals_offset
,
2858 pst
-> n_global_syms
, sizeof (struct partial_symbol
),
2860 /* If there is already a psymtab or symtab for a file of this name,
2861 remove it. (If there is a symtab, more drastic things also
2862 happen.) This happens in VxWorks. */
2863 free_named_symtabs (pst
-> filename
);
2864 /* Place the partial symtab on the partial symtab list */
2865 pst
-> next
= partial_symtab_list
;
2866 partial_symtab_list
= pst
;
2876 new_symbol -- make a symbol table entry for a new symbol
2880 static struct symbol *new_symbol (struct dieinfo *dip)
2884 Given a pointer to a DWARF information entry, figure out if we need
2885 to make a symbol table entry for it, and if so, create a new entry
2886 and return a pointer to it.
2889 static struct symbol
*
2890 DEFUN(new_symbol
, (dip
), struct dieinfo
*dip
)
2892 struct symbol
*sym
= NULL
;
2894 if (dip
-> at_name
!= NULL
)
2896 sym
= (struct symbol
*) obstack_alloc (symbol_obstack
,
2897 sizeof (struct symbol
));
2898 (void) memset (sym
, 0, sizeof (struct symbol
));
2899 SYMBOL_NAME (sym
) = create_name (dip
-> at_name
, symbol_obstack
);
2900 /* default assumptions */
2901 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
2902 SYMBOL_CLASS (sym
) = LOC_STATIC
;
2903 SYMBOL_TYPE (sym
) = decode_die_type (dip
);
2904 switch (dip
-> dietag
)
2907 SYMBOL_VALUE (sym
) = dip
-> at_low_pc
+ baseaddr
;
2908 SYMBOL_CLASS (sym
) = LOC_LABEL
;
2910 case TAG_global_subroutine
:
2911 case TAG_subroutine
:
2912 SYMBOL_VALUE (sym
) = dip
-> at_low_pc
+ baseaddr
;
2913 SYMBOL_TYPE (sym
) = lookup_function_type (SYMBOL_TYPE (sym
));
2914 SYMBOL_CLASS (sym
) = LOC_BLOCK
;
2915 if (dip
-> dietag
== TAG_global_subroutine
)
2917 add_symbol_to_list (sym
, &global_symbols
);
2921 add_symbol_to_list (sym
, &scope
-> symbols
);
2924 case TAG_global_variable
:
2925 case TAG_local_variable
:
2926 if (dip
-> at_location
!= NULL
)
2928 SYMBOL_VALUE (sym
) = locval (dip
-> at_location
);
2930 if (dip
-> dietag
== TAG_global_variable
)
2932 add_symbol_to_list (sym
, &global_symbols
);
2933 SYMBOL_CLASS (sym
) = LOC_STATIC
;
2934 SYMBOL_VALUE (sym
) += baseaddr
;
2938 add_symbol_to_list (sym
, &scope
-> symbols
);
2939 if (scope
-> parent
!= NULL
)
2943 SYMBOL_CLASS (sym
) = LOC_REGISTER
;
2947 SYMBOL_CLASS (sym
) = LOC_LOCAL
;
2952 SYMBOL_CLASS (sym
) = LOC_STATIC
;
2953 SYMBOL_VALUE (sym
) += baseaddr
;
2957 case TAG_formal_parameter
:
2958 if (dip
-> at_location
!= NULL
)
2960 SYMBOL_VALUE (sym
) = locval (dip
-> at_location
);
2962 add_symbol_to_list (sym
, &scope
-> symbols
);
2965 SYMBOL_CLASS (sym
) = LOC_REGPARM
;
2969 SYMBOL_CLASS (sym
) = LOC_ARG
;
2972 case TAG_unspecified_parameters
:
2973 /* From varargs functions; gdb doesn't seem to have any interest in
2974 this information, so just ignore it for now. (FIXME?) */
2976 case TAG_structure_type
:
2977 case TAG_union_type
:
2978 case TAG_enumeration_type
:
2979 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
2980 SYMBOL_NAMESPACE (sym
) = STRUCT_NAMESPACE
;
2981 add_symbol_to_list (sym
, &scope
-> symbols
);
2984 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
2985 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
2986 add_symbol_to_list (sym
, &scope
-> symbols
);
2989 /* Not a tag we recognize. Hopefully we aren't processing trash
2990 data, but since we must specifically ignore things we don't
2991 recognize, there is nothing else we should do at this point. */
3002 decode_mod_fund_type -- decode a modified fundamental type
3006 static struct type *decode_mod_fund_type (char *typedata)
3010 Decode a block of data containing a modified fundamental
3011 type specification. TYPEDATA is a pointer to the block,
3012 which consists of a two byte length, containing the size
3013 of the rest of the block. At the end of the block is a
3014 two byte value that gives the fundamental type. Everything
3015 in between are type modifiers.
3017 We simply compute the number of modifiers and call the general
3018 function decode_modified_type to do the actual work.
3021 static struct type
*
3022 DEFUN(decode_mod_fund_type
, (typedata
), char *typedata
)
3024 struct type
*typep
= NULL
;
3025 unsigned short modcount
;
3026 unsigned char *modifiers
;
3028 /* Get the total size of the block, exclusive of the size itself */
3029 (void) memcpy (&modcount
, typedata
, sizeof (short));
3030 /* Deduct the size of the fundamental type bytes at the end of the block. */
3031 modcount
-= sizeof (short);
3032 /* Skip over the two size bytes at the beginning of the block. */
3033 modifiers
= (unsigned char *) typedata
+ sizeof (short);
3034 /* Now do the actual decoding */
3035 typep
= decode_modified_type (modifiers
, modcount
, AT_mod_fund_type
);
3043 decode_mod_u_d_type -- decode a modified user defined type
3047 static struct type *decode_mod_u_d_type (char *typedata)
3051 Decode a block of data containing a modified user defined
3052 type specification. TYPEDATA is a pointer to the block,
3053 which consists of a two byte length, containing the size
3054 of the rest of the block. At the end of the block is a
3055 four byte value that gives a reference to a user defined type.
3056 Everything in between are type modifiers.
3058 We simply compute the number of modifiers and call the general
3059 function decode_modified_type to do the actual work.
3062 static struct type
*
3063 DEFUN(decode_mod_u_d_type
, (typedata
), char *typedata
)
3065 struct type
*typep
= NULL
;
3066 unsigned short modcount
;
3067 unsigned char *modifiers
;
3069 /* Get the total size of the block, exclusive of the size itself */
3070 (void) memcpy (&modcount
, typedata
, sizeof (short));
3071 /* Deduct the size of the reference type bytes at the end of the block. */
3072 modcount
-= sizeof (long);
3073 /* Skip over the two size bytes at the beginning of the block. */
3074 modifiers
= (unsigned char *) typedata
+ sizeof (short);
3075 /* Now do the actual decoding */
3076 typep
= decode_modified_type (modifiers
, modcount
, AT_mod_u_d_type
);
3084 decode_modified_type -- decode modified user or fundamental type
3088 static struct type *decode_modified_type (unsigned char *modifiers,
3089 unsigned short modcount, int mtype)
3093 Decode a modified type, either a modified fundamental type or
3094 a modified user defined type. MODIFIERS is a pointer to the
3095 block of bytes that define MODCOUNT modifiers. Immediately
3096 following the last modifier is a short containing the fundamental
3097 type or a long containing the reference to the user defined
3098 type. Which one is determined by MTYPE, which is either
3099 AT_mod_fund_type or AT_mod_u_d_type to indicate what modified
3100 type we are generating.
3102 We call ourself recursively to generate each modified type,`
3103 until MODCOUNT reaches zero, at which point we have consumed
3104 all the modifiers and generate either the fundamental type or
3105 user defined type. When the recursion unwinds, each modifier
3106 is applied in turn to generate the full modified type.
3110 If we find a modifier that we don't recognize, and it is not one
3111 of those reserved for application specific use, then we issue a
3112 warning and simply ignore the modifier.
3116 We currently ignore MOD_const and MOD_volatile. (FIXME)
3120 static struct type
*
3121 DEFUN(decode_modified_type
,
3122 (modifiers
, modcount
, mtype
),
3123 unsigned char *modifiers AND
unsigned short modcount AND
int mtype
)
3125 struct type
*typep
= NULL
;
3126 unsigned short fundtype
;
3128 unsigned char modifier
;
3134 case AT_mod_fund_type
:
3135 (void) memcpy (&fundtype
, modifiers
, sizeof (short));
3136 typep
= decode_fund_type (fundtype
);
3138 case AT_mod_u_d_type
:
3139 (void) memcpy (&dieref
, modifiers
, sizeof (DIEREF
));
3140 if ((typep
= lookup_utype (dieref
)) == NULL
)
3142 typep
= alloc_utype (dieref
, NULL
);
3146 SQUAWK (("botched modified type decoding (mtype 0x%x)", mtype
));
3147 typep
= builtin_type_int
;
3153 modifier
= *modifiers
++;
3154 typep
= decode_modified_type (modifiers
, --modcount
, mtype
);
3157 case MOD_pointer_to
:
3158 typep
= lookup_pointer_type (typep
);
3160 case MOD_reference_to
:
3161 typep
= lookup_reference_type (typep
);
3164 SQUAWK (("type modifier 'const' ignored")); /* FIXME */
3167 SQUAWK (("type modifier 'volatile' ignored")); /* FIXME */
3170 if (!(MOD_lo_user
<= modifier
&& modifier
<= MOD_hi_user
))
3172 SQUAWK (("unknown type modifier %u", modifier
));
3184 decode_fund_type -- translate basic DWARF type to gdb base type
3188 Given an integer that is one of the fundamental DWARF types,
3189 translate it to one of the basic internal gdb types and return
3190 a pointer to the appropriate gdb type (a "struct type *").
3194 If we encounter a fundamental type that we are unprepared to
3195 deal with, and it is not in the range of those types defined
3196 as application specific types, then we issue a warning and
3197 treat the type as builtin_type_int.
3200 static struct type
*
3201 DEFUN(decode_fund_type
, (fundtype
), unsigned short fundtype
)
3203 struct type
*typep
= NULL
;
3209 typep
= builtin_type_void
;
3212 case FT_pointer
: /* (void *) */
3213 typep
= lookup_pointer_type (builtin_type_void
);
3217 case FT_signed_char
:
3218 typep
= builtin_type_char
;
3222 case FT_signed_short
:
3223 typep
= builtin_type_short
;
3227 case FT_signed_integer
:
3228 case FT_boolean
: /* Was FT_set in AT&T version */
3229 typep
= builtin_type_int
;
3233 case FT_signed_long
:
3234 typep
= builtin_type_long
;
3238 typep
= builtin_type_float
;
3241 case FT_dbl_prec_float
:
3242 typep
= builtin_type_double
;
3245 case FT_unsigned_char
:
3246 typep
= builtin_type_unsigned_char
;
3249 case FT_unsigned_short
:
3250 typep
= builtin_type_unsigned_short
;
3253 case FT_unsigned_integer
:
3254 typep
= builtin_type_unsigned_int
;
3257 case FT_unsigned_long
:
3258 typep
= builtin_type_unsigned_long
;
3261 case FT_ext_prec_float
:
3262 typep
= builtin_type_long_double
;
3266 typep
= builtin_type_complex
;
3269 case FT_dbl_prec_complex
:
3270 typep
= builtin_type_double_complex
;
3274 case FT_signed_long_long
:
3275 typep
= builtin_type_long_long
;
3278 case FT_unsigned_long_long
:
3279 typep
= builtin_type_unsigned_long_long
;
3284 if ((typep
== NULL
) && !(FT_lo_user
<= fundtype
&& fundtype
<= FT_hi_user
))
3286 SQUAWK (("unexpected fundamental type 0x%x", fundtype
));
3287 typep
= builtin_type_void
;
3297 create_name -- allocate a fresh copy of a string on an obstack
3301 Given a pointer to a string and a pointer to an obstack, allocates
3302 a fresh copy of the string on the specified obstack.
3307 DEFUN(create_name
, (name
, obstackp
), char *name AND
struct obstack
*obstackp
)
3312 length
= strlen (name
) + 1;
3313 newname
= (char *) obstack_alloc (obstackp
, length
);
3314 (void) strcpy (newname
, name
);
3322 basicdieinfo -- extract the minimal die info from raw die data
3326 void basicdieinfo (char *diep, struct dieinfo *dip)
3330 Given a pointer to raw DIE data, and a pointer to an instance of a
3331 die info structure, this function extracts the basic information
3332 from the DIE data required to continue processing this DIE, along
3333 with some bookkeeping information about the DIE.
3335 The information we absolutely must have includes the DIE tag,
3336 and the DIE length. If we need the sibling reference, then we
3337 will have to call completedieinfo() to process all the remaining
3340 Note that since there is no guarantee that the data is properly
3341 aligned in memory for the type of access required (indirection
3342 through anything other than a char pointer), we use memcpy to
3343 shuffle data items larger than a char. Possibly inefficient, but
3346 We also take care of some other basic things at this point, such
3347 as ensuring that the instance of the die info structure starts
3348 out completely zero'd and that curdie is initialized for use
3349 in error reporting if we have a problem with the current die.
3353 All DIE's must have at least a valid length, thus the minimum
3354 DIE size is sizeof (long). In order to have a valid tag, the
3355 DIE size must be at least sizeof (short) larger, otherwise they
3356 are forced to be TAG_padding DIES.
3358 Padding DIES must be at least sizeof(long) in length, implying that
3359 if a padding DIE is used for alignment and the amount needed is less
3360 than sizeof(long) then the padding DIE has to be big enough to align
3361 to the next alignment boundry.
3365 DEFUN(basicdieinfo
, (dip
, diep
), struct dieinfo
*dip AND
char *diep
)
3368 (void) memset (dip
, 0, sizeof (struct dieinfo
));
3370 dip
-> dieref
= dbroff
+ (diep
- dbbase
);
3371 (void) memcpy (&dip
-> dielength
, diep
, sizeof (long));
3372 if (dip
-> dielength
< sizeof (long))
3374 dwarfwarn ("malformed DIE, bad length (%d bytes)", dip
-> dielength
);
3376 else if (dip
-> dielength
< (sizeof (long) + sizeof (short)))
3378 dip
-> dietag
= TAG_padding
;
3382 (void) memcpy (&dip
-> dietag
, diep
+ sizeof (long), sizeof (short));
3390 completedieinfo -- finish reading the information for a given DIE
3394 void completedieinfo (struct dieinfo *dip)
3398 Given a pointer to an already partially initialized die info structure,
3399 scan the raw DIE data and finish filling in the die info structure
3400 from the various attributes found.
3402 Note that since there is no guarantee that the data is properly
3403 aligned in memory for the type of access required (indirection
3404 through anything other than a char pointer), we use memcpy to
3405 shuffle data items larger than a char. Possibly inefficient, but
3410 Each time we are called, we increment the diecount variable, which
3411 keeps an approximate count of the number of dies processed for
3412 each compilation unit. This information is presented to the user
3413 if the info_verbose flag is set.
3418 DEFUN(completedieinfo
, (dip
), struct dieinfo
*dip
)
3420 char *diep
; /* Current pointer into raw DIE data */
3421 char *end
; /* Terminate DIE scan here */
3422 unsigned short attr
; /* Current attribute being scanned */
3423 unsigned short form
; /* Form of the attribute */
3424 short block2sz
; /* Size of a block2 attribute field */
3425 long block4sz
; /* Size of a block4 attribute field */
3429 end
= diep
+ dip
-> dielength
;
3430 diep
+= sizeof (long) + sizeof (short);
3433 (void) memcpy (&attr
, diep
, sizeof (short));
3434 diep
+= sizeof (short);
3438 (void) memcpy (&dip
-> at_fund_type
, diep
, sizeof (short));
3441 (void) memcpy (&dip
-> at_ordering
, diep
, sizeof (short));
3444 (void) memcpy (&dip
-> at_bit_offset
, diep
, sizeof (short));
3447 (void) memcpy (&dip
-> at_visibility
, diep
, sizeof (short));
3450 (void) memcpy (&dip
-> at_sibling
, diep
, sizeof (long));
3453 (void) memcpy (&dip
-> at_stmt_list
, diep
, sizeof (long));
3454 dip
-> has_at_stmt_list
= 1;
3457 (void) memcpy (&dip
-> at_low_pc
, diep
, sizeof (long));
3458 dip
-> has_at_low_pc
= 1;
3461 (void) memcpy (&dip
-> at_high_pc
, diep
, sizeof (long));
3464 (void) memcpy (&dip
-> at_language
, diep
, sizeof (long));
3466 case AT_user_def_type
:
3467 (void) memcpy (&dip
-> at_user_def_type
, diep
, sizeof (long));
3470 (void) memcpy (&dip
-> at_byte_size
, diep
, sizeof (long));
3473 (void) memcpy (&dip
-> at_bit_size
, diep
, sizeof (long));
3476 (void) memcpy (&dip
-> at_member
, diep
, sizeof (long));
3479 (void) memcpy (&dip
-> at_discr
, diep
, sizeof (long));
3482 (void) memcpy (&dip
-> at_import
, diep
, sizeof (long));
3485 dip
-> at_location
= diep
;
3487 case AT_mod_fund_type
:
3488 dip
-> at_mod_fund_type
= diep
;
3490 case AT_subscr_data
:
3491 dip
-> at_subscr_data
= diep
;
3493 case AT_mod_u_d_type
:
3494 dip
-> at_mod_u_d_type
= diep
;
3496 case AT_element_list
:
3497 dip
-> at_element_list
= diep
;
3498 dip
-> short_element_list
= 0;
3500 case AT_short_element_list
:
3501 dip
-> at_element_list
= diep
;
3502 dip
-> short_element_list
= 1;
3504 case AT_discr_value
:
3505 dip
-> at_discr_value
= diep
;
3507 case AT_string_length
:
3508 dip
-> at_string_length
= diep
;
3511 dip
-> at_name
= diep
;
3514 dip
-> at_comp_dir
= diep
;
3517 dip
-> at_producer
= diep
;
3520 (void) memcpy (&dip
-> at_frame_base
, diep
, sizeof (long));
3522 case AT_start_scope
:
3523 (void) memcpy (&dip
-> at_start_scope
, diep
, sizeof (long));
3525 case AT_stride_size
:
3526 (void) memcpy (&dip
-> at_stride_size
, diep
, sizeof (long));
3529 (void) memcpy (&dip
-> at_src_info
, diep
, sizeof (long));
3532 (void) memcpy (&dip
-> at_prototyped
, diep
, sizeof (short));
3535 /* Found an attribute that we are unprepared to handle. However
3536 it is specifically one of the design goals of DWARF that
3537 consumers should ignore unknown attributes. As long as the
3538 form is one that we recognize (so we know how to skip it),
3539 we can just ignore the unknown attribute. */
3546 diep
+= sizeof (short);
3549 diep
+= sizeof (long);
3552 diep
+= 8 * sizeof (char); /* sizeof (long long) ? */
3556 diep
+= sizeof (long);
3559 (void) memcpy (&block2sz
, diep
, sizeof (short));
3560 block2sz
+= sizeof (short);
3564 (void) memcpy (&block4sz
, diep
, sizeof (long));
3565 block4sz
+= sizeof (long);
3569 diep
+= strlen (diep
) + 1;
3572 SQUAWK (("unknown attribute form (0x%x), skipped rest", form
));