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 switch (dip -> dietag)
906 case TAG_structure_type:
907 TYPE_CODE (type) = TYPE_CODE_STRUCT;
908 TYPE_CPLUS_SPECIFIC (type)
909 = (struct cplus_struct_type *) obstack_alloc (symbol_obstack, sizeof (struct cplus_struct_type));
910 bzero (TYPE_CPLUS_SPECIFIC (type), sizeof (struct cplus_struct_type));
914 TYPE_CODE (type) = TYPE_CODE_UNION;
919 SQUAWK (("missing structure or union tag"));
920 TYPE_CODE (type) = TYPE_CODE_UNDEF;
923 /* Some compilers try to be helpful by inventing "fake" names for anonymous
924 enums, structures, and unions, like "~0fake". Thanks, but no thanks. */
925 if (dip -> at_name == NULL || *dip -> at_name == '~')
931 tpart2 = dip -> at_name;
933 if (dip -> at_byte_size == 0)
935 tpart3 = " <opaque>";
937 TYPE_LENGTH (type) = dip -> at_byte_size;
940 TYPE_NAME (type) = concat (tpart1, tpart2, tpart3, NULL);
941 thisdie += dip -> dielength;
942 while (thisdie < enddie)
944 basicdieinfo (&mbr, thisdie);
945 completedieinfo (&mbr);
946 if (mbr.dielength <= sizeof (long))
953 /* Get space to record the next field's data. */
954 new = (struct nextfield *) alloca (sizeof (struct nextfield));
958 list -> field.name = savestring (mbr.at_name, strlen (mbr.at_name));
959 list -> field.type = decode_die_type (&mbr);
960 list -> field.bitpos = 8 * locval (mbr.at_location);
961 list -> field.bitsize = 0;
965 SQUAWK (("bad member of '%s'", TYPE_NAME (type)));
968 thisdie += mbr.dielength;
970 /* Now create the vector of fields, and record how big it is. */
971 TYPE_NFIELDS (type) = nfields;
972 TYPE_FIELDS (type) = (struct field *)
973 obstack_alloc (symbol_obstack, sizeof (struct field) * nfields);
974 /* Copy the saved-up fields into the field vector. */
975 for (n = nfields; list; list = list -> next)
977 TYPE_FIELD (type, --n) = list -> field;
986 read_structure_scope -- process all dies within struct or union
990 static void read_structure_scope (struct dieinfo *dip,
991 char *thisdie, char *enddie)
995 Called when we find the DIE that starts a structure or union
996 scope (definition) to process all dies that define the members
997 of the structure or union. DIP is a pointer to the die info
998 struct for the DIE that names the structure or union.
1002 Note that we need to call struct_type regardless of whether or not
1003 we have a symbol, since we might have a structure or union without
1004 a tag name (thus no symbol for the tagname).
1008 DEFUN(read_structure_scope, (dip, thisdie, enddie),
1009 struct dieinfo *dip AND
1016 type = struct_type (dip, thisdie, enddie);
1017 if ((sym = new_symbol (dip)) != NULL)
1019 SYMBOL_TYPE (sym) = type;
1027 decode_array_element_type -- decode type of the array elements
1031 static struct type *decode_array_element_type (char *scan, char *end)
1035 As the last step in decoding the array subscript information for an
1036 array DIE, we need to decode the type of the array elements. We are
1037 passed a pointer to this last part of the subscript information and
1038 must return the appropriate type. If the type attribute is not
1039 recognized, just warn about the problem and return type int.
1042 static struct type *
1043 DEFUN(decode_array_element_type, (scan, end), char *scan AND char *end)
1048 unsigned short fundtype;
1050 (void) memcpy (&attribute, scan, sizeof (short));
1051 scan += sizeof (short);
1055 (void) memcpy (&fundtype, scan, sizeof (short));
1056 typep = decode_fund_type (fundtype);
1058 case AT_mod_fund_type:
1059 typep = decode_mod_fund_type (scan);
1061 case AT_user_def_type:
1062 (void) memcpy (&dieref, scan, sizeof (DIEREF));
1063 if ((typep = lookup_utype (dieref)) == NULL)
1065 typep = alloc_utype (dieref, NULL);
1068 case AT_mod_u_d_type:
1069 typep = decode_mod_u_d_type (scan);
1072 SQUAWK (("bad array element type attribute 0x%x", attribute));
1073 typep = builtin_type_int;
1083 decode_subscr_data -- decode array subscript and element type data
1087 static struct type *decode_subscr_data (char *scan, char *end)
1091 The array subscripts and the data type of the elements of an
1092 array are described by a list of data items, stored as a block
1093 of contiguous bytes. There is a data item describing each array
1094 dimension, and a final data item describing the element type.
1095 The data items are ordered the same as their appearance in the
1096 source (I.E. leftmost dimension first, next to leftmost second,
1099 We are passed a pointer to the start of the block of bytes
1100 containing the data items, and a pointer to the first byte past
1101 the data. This function decodes the data and returns a type.
1104 FIXME: This code only implements the forms currently used
1105 by the AT&T and GNU C compilers.
1107 The end pointer is supplied for error checking, maybe we should
1111 static struct type *
1112 DEFUN(decode_subscr_data, (scan, end), char *scan AND char *end)
1114 struct type *typep = NULL;
1115 struct type *nexttype;
1125 typep = decode_array_element_type (scan, end);
1128 (void) memcpy (&fundtype, scan, sizeof (short));
1129 scan += sizeof (short);
1130 if (fundtype != FT_integer && fundtype != FT_signed_integer
1131 && fundtype != FT_unsigned_integer)
1133 SQUAWK (("array subscripts must be integral types, not type 0x%x",
1138 (void) memcpy (&lowbound, scan, sizeof (long));
1139 scan += sizeof (long);
1140 (void) memcpy (&highbound, scan, sizeof (long));
1141 scan += sizeof (long);
1142 nexttype = decode_subscr_data (scan, end);
1143 if (nexttype != NULL)
1145 typep = (struct type *)
1146 obstack_alloc (symbol_obstack, sizeof (struct type));
1147 (void) memset (typep, 0, sizeof (struct type));
1148 TYPE_CODE (typep) = TYPE_CODE_ARRAY;
1149 TYPE_LENGTH (typep) = TYPE_LENGTH (nexttype);
1150 TYPE_LENGTH (typep) *= lowbound + highbound + 1;
1151 TYPE_TARGET_TYPE (typep) = nexttype;
1162 SQUAWK (("array subscript format 0x%x not handled yet", format));
1165 SQUAWK (("unknown array subscript format %x", format));
1175 read_array_type -- read TAG_array_type DIE
1179 static void read_array_type (struct dieinfo *dip)
1183 Extract all information from a TAG_array_type DIE and add to
1184 the user defined type vector.
1188 DEFUN(read_array_type, (dip), struct dieinfo *dip)
1195 if (dip -> at_ordering != ORD_row_major)
1197 /* FIXME: Can gdb even handle column major arrays? */
1198 SQUAWK (("array not row major; not handled correctly"));
1200 if ((sub = dip -> at_subscr_data) != NULL)
1202 (void) memcpy (&temp, sub, sizeof (short));
1203 subend = sub + sizeof (short) + temp;
1204 sub += sizeof (short);
1205 type = decode_subscr_data (sub, subend);
1208 type = alloc_utype (dip -> dieref, NULL);
1209 TYPE_CODE (type) = TYPE_CODE_ARRAY;
1210 TYPE_TARGET_TYPE (type) = builtin_type_int;
1211 TYPE_LENGTH (type) = 1 * TYPE_LENGTH (TYPE_TARGET_TYPE (type));
1215 type = alloc_utype (dip -> dieref, type);
1224 read_subroutine_type -- process TAG_subroutine_type dies
1228 static void read_subroutine_type (struct dieinfo *dip, char thisdie,
1233 Handle DIES due to C code like:
1236 int (*funcp)(int a, long l); (Generates TAG_subroutine_type DIE)
1242 The parameter DIES are currently ignored. See if gdb has a way to
1243 include this info in it's type system, and decode them if so. Is
1244 this what the type structure's "arg_types" field is for? (FIXME)
1248 DEFUN(read_subroutine_type, (dip, thisdie, enddie),
1249 struct dieinfo *dip AND
1255 type = decode_die_type (dip);
1256 type = lookup_function_type (type);
1257 type = alloc_utype (dip -> dieref, type);
1264 read_enumeration -- process dies which define an enumeration
1268 static void read_enumeration (struct dieinfo *dip, char *thisdie,
1273 Given a pointer to a die which begins an enumeration, process all
1274 the dies that define the members of the enumeration.
1278 Note that we need to call enum_type regardless of whether or not we
1279 have a symbol, since we might have an enum without a tag name (thus
1280 no symbol for the tagname).
1284 DEFUN(read_enumeration, (dip, thisdie, enddie),
1285 struct dieinfo *dip AND
1292 type = enum_type (dip);
1293 if ((sym = new_symbol (dip)) != NULL)
1295 SYMBOL_TYPE (sym) = type;
1303 enum_type -- decode and return a type for an enumeration
1307 static type *enum_type (struct dieinfo *dip)
1311 Given a pointer to a die information structure for the die which
1312 starts an enumeration, process all the dies that define the members
1313 of the enumeration and return a type pointer for the enumeration.
1316 static struct type *
1317 DEFUN(enum_type, (dip), struct dieinfo *dip)
1321 struct nextfield *next;
1324 struct nextfield *list = NULL;
1325 struct nextfield *new;
1336 if ((type = lookup_utype (dip -> dieref)) == NULL)
1338 type = alloc_utype (dip -> dieref, NULL);
1340 TYPE_CODE (type) = TYPE_CODE_ENUM;
1342 /* Some compilers try to be helpful by inventing "fake" names for anonymous
1343 enums, structures, and unions, like "~0fake". Thanks, but no thanks. */
1344 if (dip -> at_name == NULL || *dip -> at_name == '~')
1348 tpart2 = dip -> at_name;
1350 if (dip -> at_byte_size == 0)
1352 tpart3 = " <opaque>";
1356 TYPE_LENGTH (type) = dip -> at_byte_size;
1359 TYPE_NAME (type) = concat (tpart1, tpart2, tpart3, NULL);
1360 if ((scan = dip -> at_element_list) != NULL)
1362 if (dip -> short_element_list)
1364 (void) memcpy (&stemp, scan, sizeof (stemp));
1365 listend = scan + stemp + sizeof (stemp);
1366 scan += sizeof (stemp);
1370 (void) memcpy (<emp, scan, sizeof (ltemp));
1371 listend = scan + ltemp + sizeof (ltemp);
1372 scan += sizeof (ltemp);
1374 while (scan < listend)
1376 new = (struct nextfield *) alloca (sizeof (struct nextfield));
1379 list -> field.type = NULL;
1380 list -> field.bitsize = 0;
1381 (void) memcpy (&list -> field.bitpos, scan, sizeof (long));
1382 scan += sizeof (long);
1383 list -> field.name = savestring (scan, strlen (scan));
1384 scan += strlen (scan) + 1;
1388 /* Now create the vector of fields, and record how big it is. */
1389 TYPE_NFIELDS (type) = nfields;
1390 TYPE_FIELDS (type) = (struct field *)
1391 obstack_alloc (symbol_obstack, sizeof (struct field) * nfields);
1392 /* Copy the saved-up fields into the field vector. */
1393 for (n = nfields; list; list = list -> next)
1395 TYPE_FIELD (type, --n) = list -> field;
1404 read_func_scope -- process all dies within a function scope
1408 Process all dies within a given function scope. We are passed
1409 a die information structure pointer DIP for the die which
1410 starts the function scope, and pointers into the raw die data
1411 that define the dies within the function scope.
1413 For now, we ignore lexical block scopes within the function.
1414 The problem is that AT&T cc does not define a DWARF lexical
1415 block scope for the function itself, while gcc defines a
1416 lexical block scope for the function. We need to think about
1417 how to handle this difference, or if it is even a problem.
1422 DEFUN(read_func_scope, (dip, thisdie, enddie, objfile),
1423 struct dieinfo *dip AND
1426 struct objfile *objfile)
1430 if (entry_point >= dip -> at_low_pc && entry_point < dip -> at_high_pc)
1432 entry_scope_lowpc = dip -> at_low_pc;
1433 entry_scope_highpc = dip -> at_high_pc;
1435 if (strcmp (dip -> at_name, "main") == 0) /* FIXME: hardwired name */
1437 main_scope_lowpc = dip -> at_low_pc;
1438 main_scope_highpc = dip -> at_high_pc;
1440 sym = new_symbol (dip);
1441 openscope (sym, dip -> at_low_pc, dip -> at_high_pc);
1442 process_dies (thisdie + dip -> dielength, enddie, objfile);
1450 read_file_scope -- process all dies within a file scope
1454 Process all dies within a given file scope. We are passed a
1455 pointer to the die information structure for the die which
1456 starts the file scope, and pointers into the raw die data which
1457 mark the range of dies within the file scope.
1459 When the partial symbol table is built, the file offset for the line
1460 number table for each compilation unit is saved in the partial symbol
1461 table entry for that compilation unit. As the symbols for each
1462 compilation unit are read, the line number table is read into memory
1463 and the variable lnbase is set to point to it. Thus all we have to
1464 do is use lnbase to access the line number table for the current
1469 DEFUN(read_file_scope, (dip, thisdie, enddie, objfile),
1470 struct dieinfo *dip AND
1473 struct objfile *objfile)
1475 struct cleanup *back_to;
1477 if (entry_point >= dip -> at_low_pc && entry_point < dip -> at_high_pc)
1479 startup_file_start = dip -> at_low_pc;
1480 startup_file_end = dip -> at_high_pc;
1482 numutypes = (enddie - thisdie) / 4;
1483 utypes = (struct type **) xmalloc (numutypes * sizeof (struct type *));
1484 back_to = make_cleanup (free, utypes);
1485 (void) memset (utypes, 0, numutypes * sizeof (struct type *));
1487 openscope (NULL, dip -> at_low_pc, dip -> at_high_pc);
1488 decode_line_numbers (lnbase);
1489 process_dies (thisdie + dip -> dielength, enddie, objfile);
1491 end_symtab (dip -> at_name, dip -> at_language, objfile);
1492 do_cleanups (back_to);
1501 start_symtab -- do initialization for starting new symbol table
1505 static void start_symtab (void)
1509 Called whenever we are starting to process dies for a new
1510 compilation unit, to perform initializations. Right now
1511 the only thing we really have to do is initialize storage
1512 space for the line number vector.
1517 DEFUN_VOID (start_symtab)
1521 line_vector_index = 0;
1522 line_vector_length = 1000;
1523 nbytes = sizeof (struct linetable);
1524 nbytes += line_vector_length * sizeof (struct linetable_entry);
1525 line_vector = (struct linetable *) xmalloc (nbytes);
1532 process_dies -- process a range of DWARF Information Entries
1536 static void process_dies (char *thisdie, char *enddie)
1540 Process all DIE's in a specified range. May be (and almost
1541 certainly will be) called recursively.
1545 DEFUN(process_dies, (thisdie, enddie, objfile),
1546 char *thisdie AND char *enddie AND struct objfile *objfile)
1551 while (thisdie < enddie)
1553 basicdieinfo (&di, thisdie);
1554 if (di.dielength < sizeof (long))
1558 else if (di.dietag == TAG_padding)
1560 nextdie = thisdie + di.dielength;
1564 completedieinfo (&di);
1565 if (di.at_sibling != 0)
1567 nextdie = dbbase + di.at_sibling - dbroff;
1571 nextdie = thisdie + di.dielength;
1575 case TAG_compile_unit:
1576 read_file_scope (&di, thisdie, nextdie, objfile);
1578 case TAG_global_subroutine:
1579 case TAG_subroutine:
1580 if (di.has_at_low_pc)
1582 read_func_scope (&di, thisdie, nextdie, objfile);
1585 case TAG_lexical_block:
1586 read_lexical_block_scope (&di, thisdie, nextdie, objfile);
1588 case TAG_structure_type:
1589 case TAG_union_type:
1590 read_structure_scope (&di, thisdie, nextdie);
1592 case TAG_enumeration_type:
1593 read_enumeration (&di, thisdie, nextdie);
1595 case TAG_subroutine_type:
1596 read_subroutine_type (&di, thisdie, nextdie);
1598 case TAG_array_type:
1599 read_array_type (&di);
1602 (void) new_symbol (&di);
1614 end_symtab -- finish processing for a compilation unit
1618 static void end_symtab (char *filename, long language)
1622 Complete the symbol table entry for the current compilation
1623 unit. Make the struct symtab and put it on the list of all
1629 DEFUN(end_symtab, (filename, language, objfile),
1630 char *filename AND long language AND struct objfile *objfile)
1632 struct symtab *symtab;
1633 struct blockvector *blockvector;
1636 /* Ignore a file that has no functions with real debugging info. */
1637 if (global_symbols == NULL && scopetree -> block == NULL)
1641 line_vector_length = -1;
1642 freescope (scopetree);
1643 scope = scopetree = NULL;
1646 /* Create the blockvector that points to all the file's blocks. */
1648 blockvector = make_blockvector ();
1650 /* Now create the symtab object for this source file. */
1652 symtab = allocate_symtab (savestring (filename, strlen (filename)),
1655 symtab -> free_ptr = 0;
1657 /* Fill in its components. */
1658 symtab -> blockvector = blockvector;
1659 symtab -> free_code = free_linetable;
1661 /* Save the line number information. */
1663 line_vector -> nitems = line_vector_index;
1664 nbytes = sizeof (struct linetable);
1665 if (line_vector_index > 1)
1667 nbytes += (line_vector_index - 1) * sizeof (struct linetable_entry);
1669 symtab -> linetable = (struct linetable *) xrealloc (line_vector, nbytes);
1671 /* FIXME: The following may need to be expanded for other languages */
1676 symtab -> language = language_c;
1678 case LANG_C_PLUS_PLUS:
1679 symtab -> language = language_cplus;
1685 /* Link the new symtab into the list of such. */
1686 symtab -> next = symtab_list;
1687 symtab_list = symtab;
1689 /* Recursively free the scope tree */
1690 freescope (scopetree);
1691 scope = scopetree = NULL;
1693 /* Reinitialize for beginning of new file. */
1695 line_vector_length = -1;
1702 scopecount -- count the number of enclosed scopes
1706 static int scopecount (struct scopenode *node)
1710 Given pointer to a node, compute the size of the subtree which is
1711 rooted in this node, which also happens to be the number of scopes
1716 DEFUN(scopecount, (node), struct scopenode *node)
1722 count += scopecount (node -> child);
1723 count += scopecount (node -> sibling);
1733 openscope -- start a new lexical block scope
1737 static void openscope (struct symbol *namesym, CORE_ADDR lowpc,
1742 Start a new scope by allocating a new scopenode, adding it as the
1743 next child of the current scope (if any) or as the root of the
1744 scope tree, and then making the new node the current scope node.
1748 DEFUN(openscope, (namesym, lowpc, highpc),
1749 struct symbol *namesym AND
1753 struct scopenode *new;
1754 struct scopenode *child;
1756 new = (struct scopenode *) xmalloc (sizeof (*new));
1757 (void) memset (new, 0, sizeof (*new));
1758 new -> namesym = namesym;
1759 new -> lowpc = lowpc;
1760 new -> highpc = highpc;
1765 else if ((child = scope -> child) == NULL)
1767 scope -> child = new;
1768 new -> parent = scope;
1772 while (child -> sibling != NULL)
1774 child = child -> sibling;
1776 child -> sibling = new;
1777 new -> parent = scope;
1786 freescope -- free a scope tree rooted at the given node
1790 static void freescope (struct scopenode *node)
1794 Given a pointer to a node in the scope tree, free the subtree
1795 rooted at that node. First free all the children and sibling
1796 nodes, and then the node itself. Used primarily for cleaning
1797 up after ourselves and returning memory to the system.
1801 DEFUN(freescope, (node), struct scopenode *node)
1805 freescope (node -> child);
1806 freescope (node -> sibling);
1815 buildblock -- build a new block from pending symbols list
1819 static struct block *buildblock (struct pending_symbol *syms)
1823 Given a pointer to a list of symbols, build a new block and free
1824 the symbol list structure. Also check each symbol to see if it
1825 is the special symbol that flags that this block was compiled by
1826 gcc, and if so, mark the block appropriately.
1829 static struct block *
1830 DEFUN(buildblock, (syms), struct pending_symbol *syms)
1832 struct pending_symbol *next, *next1;
1834 struct block *newblock;
1837 for (next = syms, i = 0 ; next ; next = next -> next, i++) {;}
1839 /* Allocate a new block */
1841 nbytes = sizeof (struct block);
1844 nbytes += (i - 1) * sizeof (struct symbol *);
1846 newblock = (struct block *) obstack_alloc (symbol_obstack, nbytes);
1847 (void) memset (newblock, 0, nbytes);
1849 /* Copy the symbols into the block. */
1851 BLOCK_NSYMS (newblock) = i;
1852 for (next = syms ; next ; next = next -> next)
1854 BLOCK_SYM (newblock, --i) = next -> symbol;
1855 if (STREQ (GCC_COMPILED_FLAG_SYMBOL, SYMBOL_NAME (next -> symbol)) ||
1856 STREQ (GCC2_COMPILED_FLAG_SYMBOL, SYMBOL_NAME (next -> symbol)))
1858 BLOCK_GCC_COMPILED (newblock) = 1;
1862 /* Now free the links of the list, and empty the list. */
1864 for (next = syms ; next ; next = next1)
1866 next1 = next -> next;
1877 closescope -- close a lexical block scope
1881 static void closescope (void)
1885 Close the current lexical block scope. Closing the current scope
1886 is as simple as moving the current scope pointer up to the parent
1887 of the current scope pointer. But we also take this opportunity
1888 to build the block for the current scope first, since we now have
1889 all of it's symbols.
1893 DEFUN_VOID(closescope)
1895 struct scopenode *child;
1899 error ("DWARF parse error, too many close scopes");
1903 if (scope -> parent == NULL)
1905 global_symbol_block = buildblock (global_symbols);
1906 global_symbols = NULL;
1907 BLOCK_START (global_symbol_block) = scope -> lowpc + baseaddr;
1908 BLOCK_END (global_symbol_block) = scope -> highpc + baseaddr;
1910 scope -> block = buildblock (scope -> symbols);
1911 scope -> symbols = NULL;
1912 BLOCK_START (scope -> block) = scope -> lowpc + baseaddr;
1913 BLOCK_END (scope -> block) = scope -> highpc + baseaddr;
1915 /* Put the local block in as the value of the symbol that names it. */
1917 if (scope -> namesym)
1919 SYMBOL_BLOCK_VALUE (scope -> namesym) = scope -> block;
1920 BLOCK_FUNCTION (scope -> block) = scope -> namesym;
1923 /* Install this scope's local block as the superblock of all child
1926 for (child = scope -> child ; child ; child = child -> sibling)
1928 BLOCK_SUPERBLOCK (child -> block) = scope -> block;
1931 scope = scope -> parent;
1939 record_line -- record a line number entry in the line vector
1943 static void record_line (int line, CORE_ADDR pc)
1947 Given a line number and the corresponding pc value, record
1948 this pair in the line number vector, expanding the vector as
1953 DEFUN(record_line, (line, pc), int line AND CORE_ADDR pc)
1955 struct linetable_entry *e;
1958 /* Make sure line vector is big enough. */
1960 if (line_vector_index + 2 >= line_vector_length)
1962 line_vector_length *= 2;
1963 nbytes = sizeof (struct linetable);
1964 nbytes += (line_vector_length * sizeof (struct linetable_entry));
1965 line_vector = (struct linetable *) xrealloc (line_vector, nbytes);
1967 e = line_vector -> item + line_vector_index++;
1976 decode_line_numbers -- decode a line number table fragment
1980 static void decode_line_numbers (char *tblscan, char *tblend,
1981 long length, long base, long line, long pc)
1985 Translate the DWARF line number information to gdb form.
1987 The ".line" section contains one or more line number tables, one for
1988 each ".line" section from the objects that were linked.
1990 The AT_stmt_list attribute for each TAG_source_file entry in the
1991 ".debug" section contains the offset into the ".line" section for the
1992 start of the table for that file.
1994 The table itself has the following structure:
1996 <table length><base address><source statement entry>
1997 4 bytes 4 bytes 10 bytes
1999 The table length is the total size of the table, including the 4 bytes
2000 for the length information.
2002 The base address is the address of the first instruction generated
2003 for the source file.
2005 Each source statement entry has the following structure:
2007 <line number><statement position><address delta>
2008 4 bytes 2 bytes 4 bytes
2010 The line number is relative to the start of the file, starting with
2013 The statement position either -1 (0xFFFF) or the number of characters
2014 from the beginning of the line to the beginning of the statement.
2016 The address delta is the difference between the base address and
2017 the address of the first instruction for the statement.
2019 Note that we must copy the bytes from the packed table to our local
2020 variables before attempting to use them, to avoid alignment problems
2021 on some machines, particularly RISC processors.
2025 Does gdb expect the line numbers to be sorted? They are now by
2026 chance/luck, but are not required to be. (FIXME)
2028 The line with number 0 is unused, gdb apparently can discover the
2029 span of the last line some other way. How? (FIXME)
2033 DEFUN(decode_line_numbers, (linetable), char *linetable)
2042 if (linetable != NULL)
2044 tblscan = tblend = linetable;
2045 (void) memcpy (&length, tblscan, sizeof (long));
2046 tblscan += sizeof (long);
2048 (void) memcpy (&base, tblscan, sizeof (long));
2050 tblscan += sizeof (long);
2051 while (tblscan < tblend)
2053 (void) memcpy (&line, tblscan, sizeof (long));
2054 tblscan += sizeof (long) + sizeof (short);
2055 (void) memcpy (&pc, tblscan, sizeof (long));
2056 tblscan += sizeof (long);
2060 record_line (line, pc);
2070 add_symbol_to_list -- add a symbol to head of current symbol list
2074 static void add_symbol_to_list (struct symbol *symbol, struct
2075 pending_symbol **listhead)
2079 Given a pointer to a symbol and a pointer to a pointer to a
2080 list of symbols, add this symbol as the current head of the
2081 list. Typically used for example to add a symbol to the
2082 symbol list for the current scope.
2087 DEFUN(add_symbol_to_list, (symbol, listhead),
2088 struct symbol *symbol AND struct pending_symbol **listhead)
2090 struct pending_symbol *link;
2094 link = (struct pending_symbol *) xmalloc (sizeof (*link));
2095 link -> next = *listhead;
2096 link -> symbol = symbol;
2105 gatherblocks -- walk a scope tree and build block vectors
2109 static struct block **gatherblocks (struct block **dest,
2110 struct scopenode *node)
2114 Recursively walk a scope tree rooted in the given node, adding blocks
2115 to the array pointed to by DEST, in preorder. I.E., first we add the
2116 block for the current scope, then all the blocks for child scopes,
2117 and finally all the blocks for sibling scopes.
2120 static struct block **
2121 DEFUN(gatherblocks, (dest, node),
2122 struct block **dest AND struct scopenode *node)
2126 *dest++ = node -> block;
2127 dest = gatherblocks (dest, node -> child);
2128 dest = gatherblocks (dest, node -> sibling);
2137 make_blockvector -- make a block vector from current scope tree
2141 static struct blockvector *make_blockvector (void)
2145 Make a blockvector from all the blocks in the current scope tree.
2146 The first block is always the global symbol block, followed by the
2147 block for the root of the scope tree which is the local symbol block,
2148 followed by all the remaining blocks in the scope tree, which are all
2153 Note that since the root node of the scope tree is created at the time
2154 each file scope is entered, there are always at least two blocks,
2155 neither of which may have any symbols, but always contribute a block
2156 to the block vector. So the test for number of blocks greater than 1
2157 below is unnecessary given bug free code.
2159 The resulting block structure varies slightly from that produced
2160 by dbxread.c, in that block 0 and block 1 are sibling blocks while
2161 with dbxread.c, block 1 is a child of block 0. This does not
2162 seem to cause any problems, but probably should be fixed. (FIXME)
2165 static struct blockvector *
2166 DEFUN_VOID(make_blockvector)
2168 struct blockvector *blockvector = NULL;
2172 /* Recursively walk down the tree, counting the number of blocks.
2173 Then add one to account for the global's symbol block */
2175 i = scopecount (scopetree) + 1;
2176 nbytes = sizeof (struct blockvector);
2179 nbytes += (i - 1) * sizeof (struct block *);
2181 blockvector = (struct blockvector *)
2182 obstack_alloc (symbol_obstack, nbytes);
2184 /* Copy the blocks into the blockvector. */
2186 BLOCKVECTOR_NBLOCKS (blockvector) = i;
2187 BLOCKVECTOR_BLOCK (blockvector, 0) = global_symbol_block;
2188 gatherblocks (&BLOCKVECTOR_BLOCK (blockvector, 1), scopetree);
2190 return (blockvector);
2197 locval -- compute the value of a location attribute
2201 static int locval (char *loc)
2205 Given pointer to a string of bytes that define a location, compute
2206 the location and return the value.
2208 When computing values involving the current value of the frame pointer,
2209 the value zero is used, which results in a value relative to the frame
2210 pointer, rather than the absolute value. This is what GDB wants
2213 When the result is a register number, the global isreg flag is set,
2214 otherwise it is cleared. This is a kludge until we figure out a better
2215 way to handle the problem. Gdb's design does not mesh well with the
2216 DWARF notion of a location computing interpreter, which is a shame
2217 because the flexibility goes unused.
2221 Note that stack[0] is unused except as a default error return.
2222 Note that stack overflow is not yet handled.
2226 DEFUN(locval, (loc), char *loc)
2228 unsigned short nbytes;
2234 (void) memcpy (&nbytes, loc, sizeof (short));
2235 end = loc + sizeof (short) + nbytes;
2239 for (loc += sizeof (short); loc < end; loc += sizeof (long))
2247 /* push register (number) */
2248 (void) memcpy (&stack[++stacki], loc, sizeof (long));
2252 /* push value of register (number) */
2253 /* Actually, we compute the value as if register has 0 */
2254 (void) memcpy (®no, loc, sizeof (long));
2257 stack[++stacki] = 0;
2261 stack[++stacki] = 0;
2262 SQUAWK (("BASEREG %d not handled!", regno));
2266 /* push address (relocated address) */
2267 (void) memcpy (&stack[++stacki], loc, sizeof (long));
2270 /* push constant (number) */
2271 (void) memcpy (&stack[++stacki], loc, sizeof (long));
2274 /* pop, deref and push 2 bytes (as a long) */
2275 SQUAWK (("OP_DEREF2 address %#x not handled", stack[stacki]));
2277 case OP_DEREF4: /* pop, deref and push 4 bytes (as a long) */
2278 SQUAWK (("OP_DEREF4 address %#x not handled", stack[stacki]));
2280 case OP_ADD: /* pop top 2 items, add, push result */
2281 stack[stacki - 1] += stack[stacki];
2286 return (stack[stacki]);
2293 read_ofile_symtab -- build a full symtab entry from chunk of DIE's
2297 static struct symtab *read_ofile_symtab (struct partial_symtab *pst)
2301 OFFSET is a relocation offset which gets added to each symbol (FIXME).
2304 static struct symtab *
2305 DEFUN(read_ofile_symtab, (pst),
2306 struct partial_symtab *pst)
2308 struct cleanup *back_to;
2311 bfd *abfd = pst->objfile->obfd;
2313 /* Allocate a buffer for the entire chunk of DIE's for this compilation
2314 unit, seek to the location in the file, and read in all the DIE's. */
2317 dbbase = xmalloc (DBLENGTH(pst));
2318 dbroff = DBROFF(pst);
2319 foffset = DBFOFF(pst) + dbroff;
2320 if (bfd_seek (abfd, foffset, 0) ||
2321 (bfd_read (dbbase, DBLENGTH(pst), 1, abfd) != DBLENGTH(pst)))
2324 error ("can't read DWARF data");
2326 back_to = make_cleanup (free, dbbase);
2328 /* If there is a line number table associated with this compilation unit
2329 then read the first long word from the line number table fragment, which
2330 contains the size of the fragment in bytes (including the long word
2331 itself). Allocate a buffer for the fragment and read it in for future
2337 if (bfd_seek (abfd, LNFOFF (pst), 0) ||
2338 (bfd_read (&lnsize, sizeof(long), 1, abfd) != sizeof(long)))
2340 error ("can't read DWARF line number table size");
2342 lnbase = xmalloc (lnsize);
2343 if (bfd_seek (abfd, LNFOFF (pst), 0) ||
2344 (bfd_read (lnbase, lnsize, 1, abfd) != lnsize))
2347 error ("can't read DWARF line numbers");
2349 make_cleanup (free, lnbase);
2352 process_dies (dbbase, dbbase + DBLENGTH(pst), pst->objfile);
2353 do_cleanups (back_to);
2354 return (symtab_list);
2361 psymtab_to_symtab_1 -- do grunt work for building a full symtab entry
2365 static void psymtab_to_symtab_1 (struct partial_symtab *pst)
2369 Called once for each partial symbol table entry that needs to be
2370 expanded into a full symbol table entry.
2375 DEFUN(psymtab_to_symtab_1,
2377 struct partial_symtab *pst)
2387 fprintf (stderr, "Psymtab for %s already read in. Shouldn't happen.\n",
2392 /* Read in all partial symtabs on which this one is dependent */
2393 for (i = 0; i < pst -> number_of_dependencies; i++)
2394 if (!pst -> dependencies[i] -> readin)
2396 /* Inform about additional files that need to be read in. */
2399 fputs_filtered (" ", stdout);
2401 fputs_filtered ("and ", stdout);
2403 printf_filtered ("%s...", pst -> dependencies[i] -> filename);
2404 wrap_here (""); /* Flush output */
2407 psymtab_to_symtab_1 (pst -> dependencies[i]);
2410 if (DBLENGTH(pst)) /* Otherwise it's a dummy */
2412 /* Init stuff necessary for reading in symbols */
2413 pst -> symtab = read_ofile_symtab (pst);
2416 printf_filtered ("%d DIE's, sorting...", diecount);
2419 sort_symtab_syms (pst -> symtab);
2428 dwarf_psymtab_to_symtab -- build a full symtab entry from partial one
2432 static void dwarf_psymtab_to_symtab (struct partial_symtab *pst)
2436 This is the DWARF support entry point for building a full symbol
2437 table entry from a partial symbol table entry. We are passed a
2438 pointer to the partial symbol table entry that needs to be expanded.
2443 DEFUN(dwarf_psymtab_to_symtab, (pst), struct partial_symtab *pst)
2452 fprintf (stderr, "Psymtab for %s already read in. Shouldn't happen.\n",
2457 if (DBLENGTH(pst) || pst -> number_of_dependencies)
2459 /* Print the message now, before starting serious work, to avoid
2460 disconcerting pauses. */
2463 printf_filtered ("Reading in symbols for %s...", pst -> filename);
2467 psymtab_to_symtab_1 (pst);
2469 #if 0 /* FIXME: Check to see what dbxread is doing here and see if
2470 we need to do an equivalent or is this something peculiar to
2471 stabs/a.out format. */
2472 /* Match with global symbols. This only needs to be done once,
2473 after all of the symtabs and dependencies have been read in. */
2474 scan_file_globals ();
2477 /* Finish up the debug error message. */
2480 printf_filtered ("done.\n");
2489 init_psymbol_list -- initialize storage for partial symbols
2493 static void init_psymbol_list (int total_symbols)
2497 Initializes storage for all of the partial symbols that will be
2498 created by dwarf_build_psymtabs and subsidiaries.
2502 DEFUN(init_psymbol_list, (total_symbols), int total_symbols)
2504 /* Free any previously allocated psymbol lists. */
2506 if (global_psymbols.list)
2508 free (global_psymbols.list);
2510 if (static_psymbols.list)
2512 free (static_psymbols.list);
2515 /* Current best guess is that there are approximately a twentieth
2516 of the total symbols (in a debugging file) are global or static
2519 global_psymbols.size = total_symbols / 10;
2520 static_psymbols.size = total_symbols / 10;
2521 global_psymbols.next = global_psymbols.list = (struct partial_symbol *)
2522 xmalloc (global_psymbols.size * sizeof (struct partial_symbol));
2523 static_psymbols.next = static_psymbols.list = (struct partial_symbol *)
2524 xmalloc (static_psymbols.size * sizeof (struct partial_symbol));
2531 start_psymtab -- allocate and partially fill a partial symtab entry
2535 Allocate and partially fill a partial symtab. It will be completely
2536 filled at the end of the symbol list.
2538 SYMFILE_NAME is the name of the symbol-file we are reading from, and
2539 ADDR is the address relative to which its symbols are (incremental)
2540 or 0 (normal). FILENAME is the name of the compilation unit that
2541 these symbols were defined in, and they appear starting a address
2542 TEXTLOW. DBROFF is the absolute file offset in SYMFILE_NAME where
2543 the full symbols can be read for compilation unit FILENAME.
2544 GLOBAL_SYMS and STATIC_SYMS are pointers to the current end of the
2549 static struct partial_symtab *
2550 DEFUN(start_psymtab,
2551 (objfile, addr, filename, textlow, texthigh, dbfoff, curoff,
2552 culength, lnfoff, global_syms, static_syms),
2553 struct objfile *objfile AND
2556 CORE_ADDR textlow AND
2557 CORE_ADDR texthigh AND
2562 struct partial_symbol *global_syms AND
2563 struct partial_symbol *static_syms)
2565 struct partial_symtab *result;
2567 result = (struct partial_symtab *)
2568 obstack_alloc (psymbol_obstack, sizeof (struct partial_symtab));
2569 (void) memset (result, 0, sizeof (struct partial_symtab));
2570 result -> addr = addr;
2571 result -> objfile = objfile;
2572 result -> filename = create_name (filename, psymbol_obstack);
2573 result -> textlow = textlow;
2574 result -> texthigh = texthigh;
2575 result -> read_symtab_private = (char *) obstack_alloc (psymbol_obstack,
2576 sizeof (struct dwfinfo));
2577 DBFOFF (result) = dbfoff;
2578 DBROFF (result) = curoff;
2579 DBLENGTH (result) = culength;
2580 LNFOFF (result) = lnfoff;
2581 result -> readin = 0;
2582 result -> symtab = NULL;
2583 result -> read_symtab = dwarf_psymtab_to_symtab;
2584 result -> globals_offset = global_syms - global_psymbols.list;
2585 result -> statics_offset = static_syms - static_psymbols.list;
2587 result->n_global_syms = 0;
2588 result->n_static_syms = 0;
2597 add_psymbol_to_list -- add a partial symbol to given list
2601 Add a partial symbol to one of the partial symbol vectors (pointed to
2602 by listp). The vector is grown as necessary.
2607 DEFUN(add_psymbol_to_list,
2608 (listp, name, space, class, value),
2609 struct psymbol_allocation_list *listp AND
2611 enum namespace space AND
2612 enum address_class class AND
2615 struct partial_symbol *psym;
2618 if (listp -> next >= listp -> list + listp -> size)
2620 newsize = listp -> size * 2;
2621 listp -> list = (struct partial_symbol *)
2622 xrealloc (listp -> list, (newsize * sizeof (struct partial_symbol)));
2623 /* Next assumes we only went one over. Should be good if program works
2625 listp -> next = listp -> list + listp -> size;
2626 listp -> size = newsize;
2628 psym = listp -> next++;
2629 SYMBOL_NAME (psym) = create_name (name, psymbol_obstack);
2630 SYMBOL_NAMESPACE (psym) = space;
2631 SYMBOL_CLASS (psym) = class;
2632 SYMBOL_VALUE (psym) = value;
2639 add_partial_symbol -- add symbol to partial symbol table
2643 Given a DIE, if it is one of the types that we want to
2644 add to a partial symbol table, finish filling in the die info
2645 and then add a partial symbol table entry for it.
2650 DEFUN(add_partial_symbol, (dip), struct dieinfo *dip)
2652 switch (dip -> dietag)
2654 case TAG_global_subroutine:
2655 record_misc_function (dip -> at_name, dip -> at_low_pc, mf_text);
2656 add_psymbol_to_list (&global_psymbols, dip -> at_name, VAR_NAMESPACE,
2657 LOC_BLOCK, dip -> at_low_pc);
2659 case TAG_global_variable:
2660 record_misc_function (dip -> at_name, locval (dip -> at_location),
2662 add_psymbol_to_list (&global_psymbols, dip -> at_name, VAR_NAMESPACE,
2665 case TAG_subroutine:
2666 add_psymbol_to_list (&static_psymbols, dip -> at_name, VAR_NAMESPACE,
2667 LOC_BLOCK, dip -> at_low_pc);
2669 case TAG_local_variable:
2670 add_psymbol_to_list (&static_psymbols, dip -> at_name, VAR_NAMESPACE,
2674 add_psymbol_to_list (&static_psymbols, dip -> at_name, VAR_NAMESPACE,
2677 case TAG_structure_type:
2678 case TAG_union_type:
2679 case TAG_enumeration_type:
2680 add_psymbol_to_list (&static_psymbols, dip -> at_name, STRUCT_NAMESPACE,
2690 scan_partial_symbols -- scan DIE's within a single compilation unit
2694 Process the DIE's within a single compilation unit, looking for
2695 interesting DIE's that contribute to the partial symbol table entry
2696 for this compilation unit. Since we cannot follow any sibling
2697 chains without reading the complete DIE info for every DIE,
2698 it is probably faster to just sequentially check each one to
2699 see if it is one of the types we are interested in, and if
2700 so, then extracting all the attributes info and generating a
2701 partial symbol table entry.
2705 Don't attempt to add anonymous structures, unions, or enumerations
2706 since they have no name. Also, for variables and subroutines,
2707 check that this is the place where the actual definition occurs,
2708 rather than just a reference to an external.
2713 DEFUN(scan_partial_symbols, (thisdie, enddie), char *thisdie AND char *enddie)
2718 while (thisdie < enddie)
2720 basicdieinfo (&di, thisdie);
2721 if (di.dielength < sizeof (long))
2727 nextdie = thisdie + di.dielength;
2730 case TAG_global_subroutine:
2731 case TAG_subroutine:
2732 case TAG_global_variable:
2733 case TAG_local_variable:
2734 completedieinfo (&di);
2735 if (di.at_name && (di.has_at_low_pc || di.at_location))
2737 add_partial_symbol (&di);
2741 case TAG_structure_type:
2742 case TAG_union_type:
2743 case TAG_enumeration_type:
2744 completedieinfo (&di);
2747 add_partial_symbol (&di);
2760 scan_compilation_units -- build a psymtab entry for each compilation
2764 This is the top level dwarf parsing routine for building partial
2767 It scans from the beginning of the DWARF table looking for the first
2768 TAG_compile_unit DIE, and then follows the sibling chain to locate
2769 each additional TAG_compile_unit DIE.
2771 For each TAG_compile_unit DIE it creates a partial symtab structure,
2772 calls a subordinate routine to collect all the compilation unit's
2773 global DIE's, file scope DIEs, typedef DIEs, etc, and then links the
2774 new partial symtab structure into the partial symbol table. It also
2775 records the appropriate information in the partial symbol table entry
2776 to allow the chunk of DIE's and line number table for this compilation
2777 unit to be located and re-read later, to generate a complete symbol
2778 table entry for the compilation unit.
2780 Thus it effectively partitions up a chunk of DIE's for multiple
2781 compilation units into smaller DIE chunks and line number tables,
2782 and associates them with a partial symbol table entry.
2786 If any compilation unit has no line number table associated with
2787 it for some reason (a missing at_stmt_list attribute, rather than
2788 just one with a value of zero, which is valid) then we ensure that
2789 the recorded file offset is zero so that the routine which later
2790 reads line number table fragments knows that there is no fragment
2800 DEFUN(scan_compilation_units,
2801 (filename, addr, thisdie, enddie, dbfoff, lnoffset, objfile),
2806 unsigned int dbfoff AND
2807 unsigned int lnoffset AND
2808 struct objfile *objfile)
2812 struct partial_symtab *pst;
2817 while (thisdie < enddie)
2819 basicdieinfo (&di, thisdie);
2820 if (di.dielength < sizeof (long))
2824 else if (di.dietag != TAG_compile_unit)
2826 nextdie = thisdie + di.dielength;
2830 completedieinfo (&di);
2831 if (di.at_sibling != 0)
2833 nextdie = dbbase + di.at_sibling - dbroff;
2837 nextdie = thisdie + di.dielength;
2839 curoff = thisdie - dbbase;
2840 culength = nextdie - thisdie;
2841 curlnoffset = di.has_at_stmt_list ? lnoffset + di.at_stmt_list : 0;
2842 pst = start_psymtab (objfile, addr, di.at_name,
2843 di.at_low_pc, di.at_high_pc,
2844 dbfoff, curoff, culength, curlnoffset,
2845 global_psymbols.next,
2846 static_psymbols.next);
2847 scan_partial_symbols (thisdie + di.dielength, nextdie);
2848 pst -> n_global_syms = global_psymbols.next -
2849 (global_psymbols.list + pst -> globals_offset);
2850 pst -> n_static_syms = static_psymbols.next -
2851 (static_psymbols.list + pst -> statics_offset);
2852 /* Sort the global list; don't sort the static list */
2853 qsort (global_psymbols.list + pst -> globals_offset,
2854 pst -> n_global_syms, sizeof (struct partial_symbol),
2856 /* If there is already a psymtab or symtab for a file of this name,
2857 remove it. (If there is a symtab, more drastic things also
2858 happen.) This happens in VxWorks. */
2859 free_named_symtabs (pst -> filename);
2860 /* Place the partial symtab on the partial symtab list */
2861 pst -> next = partial_symtab_list;
2862 partial_symtab_list = pst;
2872 new_symbol -- make a symbol table entry for a new symbol
2876 static struct symbol *new_symbol (struct dieinfo *dip)
2880 Given a pointer to a DWARF information entry, figure out if we need
2881 to make a symbol table entry for it, and if so, create a new entry
2882 and return a pointer to it.
2885 static struct symbol *
2886 DEFUN(new_symbol, (dip), struct dieinfo *dip)
2888 struct symbol *sym = NULL;
2890 if (dip -> at_name != NULL)
2892 sym = (struct symbol *) obstack_alloc (symbol_obstack,
2893 sizeof (struct symbol));
2894 (void) memset (sym, 0, sizeof (struct symbol));
2895 SYMBOL_NAME (sym) = create_name (dip -> at_name, symbol_obstack);
2896 /* default assumptions */
2897 SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE;
2898 SYMBOL_CLASS (sym) = LOC_STATIC;
2899 SYMBOL_TYPE (sym) = decode_die_type (dip);
2900 switch (dip -> dietag)
2903 SYMBOL_VALUE (sym) = dip -> at_low_pc + baseaddr;
2904 SYMBOL_CLASS (sym) = LOC_LABEL;
2906 case TAG_global_subroutine:
2907 case TAG_subroutine:
2908 SYMBOL_VALUE (sym) = dip -> at_low_pc + baseaddr;
2909 SYMBOL_TYPE (sym) = lookup_function_type (SYMBOL_TYPE (sym));
2910 SYMBOL_CLASS (sym) = LOC_BLOCK;
2911 if (dip -> dietag == TAG_global_subroutine)
2913 add_symbol_to_list (sym, &global_symbols);
2917 add_symbol_to_list (sym, &scope -> symbols);
2920 case TAG_global_variable:
2921 case TAG_local_variable:
2922 if (dip -> at_location != NULL)
2924 SYMBOL_VALUE (sym) = locval (dip -> at_location);
2926 if (dip -> dietag == TAG_global_variable)
2928 add_symbol_to_list (sym, &global_symbols);
2929 SYMBOL_CLASS (sym) = LOC_STATIC;
2930 SYMBOL_VALUE (sym) += baseaddr;
2934 add_symbol_to_list (sym, &scope -> symbols);
2935 if (scope -> parent != NULL)
2939 SYMBOL_CLASS (sym) = LOC_REGISTER;
2943 SYMBOL_CLASS (sym) = LOC_LOCAL;
2948 SYMBOL_CLASS (sym) = LOC_STATIC;
2949 SYMBOL_VALUE (sym) += baseaddr;
2953 case TAG_formal_parameter:
2954 if (dip -> at_location != NULL)
2956 SYMBOL_VALUE (sym) = locval (dip -> at_location);
2958 add_symbol_to_list (sym, &scope -> symbols);
2961 SYMBOL_CLASS (sym) = LOC_REGPARM;
2965 SYMBOL_CLASS (sym) = LOC_ARG;
2968 case TAG_unspecified_parameters:
2969 /* From varargs functions; gdb doesn't seem to have any interest in
2970 this information, so just ignore it for now. (FIXME?) */
2972 case TAG_structure_type:
2973 case TAG_union_type:
2974 case TAG_enumeration_type:
2975 SYMBOL_CLASS (sym) = LOC_TYPEDEF;
2976 SYMBOL_NAMESPACE (sym) = STRUCT_NAMESPACE;
2977 add_symbol_to_list (sym, &scope -> symbols);
2980 SYMBOL_CLASS (sym) = LOC_TYPEDEF;
2981 SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE;
2982 add_symbol_to_list (sym, &scope -> symbols);
2985 /* Not a tag we recognize. Hopefully we aren't processing trash
2986 data, but since we must specifically ignore things we don't
2987 recognize, there is nothing else we should do at this point. */
2998 decode_mod_fund_type -- decode a modified fundamental type
3002 static struct type *decode_mod_fund_type (char *typedata)
3006 Decode a block of data containing a modified fundamental
3007 type specification. TYPEDATA is a pointer to the block,
3008 which consists of a two byte length, containing the size
3009 of the rest of the block. At the end of the block is a
3010 two byte value that gives the fundamental type. Everything
3011 in between are type modifiers.
3013 We simply compute the number of modifiers and call the general
3014 function decode_modified_type to do the actual work.
3017 static struct type *
3018 DEFUN(decode_mod_fund_type, (typedata), char *typedata)
3020 struct type *typep = NULL;
3021 unsigned short modcount;
3022 unsigned char *modifiers;
3024 /* Get the total size of the block, exclusive of the size itself */
3025 (void) memcpy (&modcount, typedata, sizeof (short));
3026 /* Deduct the size of the fundamental type bytes at the end of the block. */
3027 modcount -= sizeof (short);
3028 /* Skip over the two size bytes at the beginning of the block. */
3029 modifiers = (unsigned char *) typedata + sizeof (short);
3030 /* Now do the actual decoding */
3031 typep = decode_modified_type (modifiers, modcount, AT_mod_fund_type);
3039 decode_mod_u_d_type -- decode a modified user defined type
3043 static struct type *decode_mod_u_d_type (char *typedata)
3047 Decode a block of data containing a modified user defined
3048 type specification. TYPEDATA is a pointer to the block,
3049 which consists of a two byte length, containing the size
3050 of the rest of the block. At the end of the block is a
3051 four byte value that gives a reference to a user defined type.
3052 Everything in between are type modifiers.
3054 We simply compute the number of modifiers and call the general
3055 function decode_modified_type to do the actual work.
3058 static struct type *
3059 DEFUN(decode_mod_u_d_type, (typedata), char *typedata)
3061 struct type *typep = NULL;
3062 unsigned short modcount;
3063 unsigned char *modifiers;
3065 /* Get the total size of the block, exclusive of the size itself */
3066 (void) memcpy (&modcount, typedata, sizeof (short));
3067 /* Deduct the size of the reference type bytes at the end of the block. */
3068 modcount -= sizeof (long);
3069 /* Skip over the two size bytes at the beginning of the block. */
3070 modifiers = (unsigned char *) typedata + sizeof (short);
3071 /* Now do the actual decoding */
3072 typep = decode_modified_type (modifiers, modcount, AT_mod_u_d_type);
3080 decode_modified_type -- decode modified user or fundamental type
3084 static struct type *decode_modified_type (unsigned char *modifiers,
3085 unsigned short modcount, int mtype)
3089 Decode a modified type, either a modified fundamental type or
3090 a modified user defined type. MODIFIERS is a pointer to the
3091 block of bytes that define MODCOUNT modifiers. Immediately
3092 following the last modifier is a short containing the fundamental
3093 type or a long containing the reference to the user defined
3094 type. Which one is determined by MTYPE, which is either
3095 AT_mod_fund_type or AT_mod_u_d_type to indicate what modified
3096 type we are generating.
3098 We call ourself recursively to generate each modified type,`
3099 until MODCOUNT reaches zero, at which point we have consumed
3100 all the modifiers and generate either the fundamental type or
3101 user defined type. When the recursion unwinds, each modifier
3102 is applied in turn to generate the full modified type.
3106 If we find a modifier that we don't recognize, and it is not one
3107 of those reserved for application specific use, then we issue a
3108 warning and simply ignore the modifier.
3112 We currently ignore MOD_const and MOD_volatile. (FIXME)
3116 static struct type *
3117 DEFUN(decode_modified_type,
3118 (modifiers, modcount, mtype),
3119 unsigned char *modifiers AND unsigned short modcount AND int mtype)
3121 struct type *typep = NULL;
3122 unsigned short fundtype;
3124 unsigned char modifier;
3130 case AT_mod_fund_type:
3131 (void) memcpy (&fundtype, modifiers, sizeof (short));
3132 typep = decode_fund_type (fundtype);
3134 case AT_mod_u_d_type:
3135 (void) memcpy (&dieref, modifiers, sizeof (DIEREF));
3136 if ((typep = lookup_utype (dieref)) == NULL)
3138 typep = alloc_utype (dieref, NULL);
3142 SQUAWK (("botched modified type decoding (mtype 0x%x)", mtype));
3143 typep = builtin_type_int;
3149 modifier = *modifiers++;
3150 typep = decode_modified_type (modifiers, --modcount, mtype);
3153 case MOD_pointer_to:
3154 typep = lookup_pointer_type (typep);
3156 case MOD_reference_to:
3157 typep = lookup_reference_type (typep);
3160 SQUAWK (("type modifier 'const' ignored")); /* FIXME */
3163 SQUAWK (("type modifier 'volatile' ignored")); /* FIXME */
3166 if (!(MOD_lo_user <= modifier && modifier <= MOD_hi_user))
3168 SQUAWK (("unknown type modifier %u", modifier));
3180 decode_fund_type -- translate basic DWARF type to gdb base type
3184 Given an integer that is one of the fundamental DWARF types,
3185 translate it to one of the basic internal gdb types and return
3186 a pointer to the appropriate gdb type (a "struct type *").
3190 If we encounter a fundamental type that we are unprepared to
3191 deal with, and it is not in the range of those types defined
3192 as application specific types, then we issue a warning and
3193 treat the type as builtin_type_int.
3196 static struct type *
3197 DEFUN(decode_fund_type, (fundtype), unsigned short fundtype)
3199 struct type *typep = NULL;
3205 typep = builtin_type_void;
3208 case FT_pointer: /* (void *) */
3209 typep = lookup_pointer_type (builtin_type_void);
3213 case FT_signed_char:
3214 typep = builtin_type_char;
3218 case FT_signed_short:
3219 typep = builtin_type_short;
3223 case FT_signed_integer:
3224 case FT_boolean: /* Was FT_set in AT&T version */
3225 typep = builtin_type_int;
3229 case FT_signed_long:
3230 typep = builtin_type_long;
3234 typep = builtin_type_float;
3237 case FT_dbl_prec_float:
3238 typep = builtin_type_double;
3241 case FT_unsigned_char:
3242 typep = builtin_type_unsigned_char;
3245 case FT_unsigned_short:
3246 typep = builtin_type_unsigned_short;
3249 case FT_unsigned_integer:
3250 typep = builtin_type_unsigned_int;
3253 case FT_unsigned_long:
3254 typep = builtin_type_unsigned_long;
3257 case FT_ext_prec_float:
3258 typep = builtin_type_long_double;
3262 typep = builtin_type_complex;
3265 case FT_dbl_prec_complex:
3266 typep = builtin_type_double_complex;
3270 case FT_signed_long_long:
3271 typep = builtin_type_long_long;
3274 case FT_unsigned_long_long:
3275 typep = builtin_type_unsigned_long_long;
3280 if ((typep == NULL) && !(FT_lo_user <= fundtype && fundtype <= FT_hi_user))
3282 SQUAWK (("unexpected fundamental type 0x%x", fundtype));
3283 typep = builtin_type_void;
3293 create_name -- allocate a fresh copy of a string on an obstack
3297 Given a pointer to a string and a pointer to an obstack, allocates
3298 a fresh copy of the string on the specified obstack.
3303 DEFUN(create_name, (name, obstackp), char *name AND struct obstack *obstackp)
3308 length = strlen (name) + 1;
3309 newname = (char *) obstack_alloc (obstackp, length);
3310 (void) strcpy (newname, name);
3318 basicdieinfo -- extract the minimal die info from raw die data
3322 void basicdieinfo (char *diep, struct dieinfo *dip)
3326 Given a pointer to raw DIE data, and a pointer to an instance of a
3327 die info structure, this function extracts the basic information
3328 from the DIE data required to continue processing this DIE, along
3329 with some bookkeeping information about the DIE.
3331 The information we absolutely must have includes the DIE tag,
3332 and the DIE length. If we need the sibling reference, then we
3333 will have to call completedieinfo() to process all the remaining
3336 Note that since there is no guarantee that the data is properly
3337 aligned in memory for the type of access required (indirection
3338 through anything other than a char pointer), we use memcpy to
3339 shuffle data items larger than a char. Possibly inefficient, but
3342 We also take care of some other basic things at this point, such
3343 as ensuring that the instance of the die info structure starts
3344 out completely zero'd and that curdie is initialized for use
3345 in error reporting if we have a problem with the current die.
3349 All DIE's must have at least a valid length, thus the minimum
3350 DIE size is sizeof (long). In order to have a valid tag, the
3351 DIE size must be at least sizeof (short) larger, otherwise they
3352 are forced to be TAG_padding DIES.
3354 Padding DIES must be at least sizeof(long) in length, implying that
3355 if a padding DIE is used for alignment and the amount needed is less
3356 than sizeof(long) then the padding DIE has to be big enough to align
3357 to the next alignment boundry.
3361 DEFUN(basicdieinfo, (dip, diep), struct dieinfo *dip AND char *diep)
3364 (void) memset (dip, 0, sizeof (struct dieinfo));
3366 dip -> dieref = dbroff + (diep - dbbase);
3367 (void) memcpy (&dip -> dielength, diep, sizeof (long));
3368 if (dip -> dielength < sizeof (long))
3370 dwarfwarn ("malformed DIE, bad length (%d bytes)", dip -> dielength);
3372 else if (dip -> dielength < (sizeof (long) + sizeof (short)))
3374 dip -> dietag = TAG_padding;
3378 (void) memcpy (&dip -> dietag, diep + sizeof (long), sizeof (short));
3386 completedieinfo -- finish reading the information for a given DIE
3390 void completedieinfo (struct dieinfo *dip)
3394 Given a pointer to an already partially initialized die info structure,
3395 scan the raw DIE data and finish filling in the die info structure
3396 from the various attributes found.
3398 Note that since there is no guarantee that the data is properly
3399 aligned in memory for the type of access required (indirection
3400 through anything other than a char pointer), we use memcpy to
3401 shuffle data items larger than a char. Possibly inefficient, but
3406 Each time we are called, we increment the diecount variable, which
3407 keeps an approximate count of the number of dies processed for
3408 each compilation unit. This information is presented to the user
3409 if the info_verbose flag is set.
3414 DEFUN(completedieinfo, (dip), struct dieinfo *dip)
3416 char *diep; /* Current pointer into raw DIE data */
3417 char *end; /* Terminate DIE scan here */
3418 unsigned short attr; /* Current attribute being scanned */
3419 unsigned short form; /* Form of the attribute */
3420 short block2sz; /* Size of a block2 attribute field */
3421 long block4sz; /* Size of a block4 attribute field */
3425 end = diep + dip -> dielength;
3426 diep += sizeof (long) + sizeof (short);
3429 (void) memcpy (&attr, diep, sizeof (short));
3430 diep += sizeof (short);
3434 (void) memcpy (&dip -> at_fund_type, diep, sizeof (short));
3437 (void) memcpy (&dip -> at_ordering, diep, sizeof (short));
3440 (void) memcpy (&dip -> at_bit_offset, diep, sizeof (short));
3443 (void) memcpy (&dip -> at_visibility, diep, sizeof (short));
3446 (void) memcpy (&dip -> at_sibling, diep, sizeof (long));
3449 (void) memcpy (&dip -> at_stmt_list, diep, sizeof (long));
3450 dip -> has_at_stmt_list = 1;
3453 (void) memcpy (&dip -> at_low_pc, diep, sizeof (long));
3454 dip -> has_at_low_pc = 1;
3457 (void) memcpy (&dip -> at_high_pc, diep, sizeof (long));
3460 (void) memcpy (&dip -> at_language, diep, sizeof (long));
3462 case AT_user_def_type:
3463 (void) memcpy (&dip -> at_user_def_type, diep, sizeof (long));
3466 (void) memcpy (&dip -> at_byte_size, diep, sizeof (long));
3469 (void) memcpy (&dip -> at_bit_size, diep, sizeof (long));
3472 (void) memcpy (&dip -> at_member, diep, sizeof (long));
3475 (void) memcpy (&dip -> at_discr, diep, sizeof (long));
3478 (void) memcpy (&dip -> at_import, diep, sizeof (long));
3481 dip -> at_location = diep;
3483 case AT_mod_fund_type:
3484 dip -> at_mod_fund_type = diep;
3486 case AT_subscr_data:
3487 dip -> at_subscr_data = diep;
3489 case AT_mod_u_d_type:
3490 dip -> at_mod_u_d_type = diep;
3492 case AT_element_list:
3493 dip -> at_element_list = diep;
3494 dip -> short_element_list = 0;
3496 case AT_short_element_list:
3497 dip -> at_element_list = diep;
3498 dip -> short_element_list = 1;
3500 case AT_discr_value:
3501 dip -> at_discr_value = diep;
3503 case AT_string_length:
3504 dip -> at_string_length = diep;
3507 dip -> at_name = diep;
3510 dip -> at_comp_dir = diep;
3513 dip -> at_producer = diep;
3516 (void) memcpy (&dip -> at_frame_base, diep, sizeof (long));
3518 case AT_start_scope:
3519 (void) memcpy (&dip -> at_start_scope, diep, sizeof (long));
3521 case AT_stride_size:
3522 (void) memcpy (&dip -> at_stride_size, diep, sizeof (long));
3525 (void) memcpy (&dip -> at_src_info, diep, sizeof (long));
3528 (void) memcpy (&dip -> at_prototyped, diep, sizeof (short));
3531 /* Found an attribute that we are unprepared to handle. However
3532 it is specifically one of the design goals of DWARF that
3533 consumers should ignore unknown attributes. As long as the
3534 form is one that we recognize (so we know how to skip it),
3535 we can just ignore the unknown attribute. */
3542 diep += sizeof (short);
3545 diep += sizeof (long);
3548 diep += 8 * sizeof (char); /* sizeof (long long) ? */
3552 diep += sizeof (long);
3555 (void) memcpy (&block2sz, diep, sizeof (short));
3556 block2sz += sizeof (short);
3560 (void) memcpy (&block4sz, diep, sizeof (long));
3561 block4sz += sizeof (long);
3565 diep += strlen (diep) + 1;
3568 SQUAWK (("unknown attribute form (0x%x), skipped rest", form));