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: Figure out a better way to tell gdb about the name of the function
40 contain the user's entry point (I.E. main())
42 FIXME: The current DWARF specification has a very strong bias towards
43 machines with 32-bit integers, as it assumes that many attributes of the
44 program (such as an address) will fit in such an integer. There are many
45 references in the spec to things that are 2, 4, or 8 bytes long. Given that
46 we will probably run into problems on machines where some of these assumptions
47 are invalid (64-bit ints for example), we don't bother at this time to try to
48 make this code more flexible and just use shorts, ints, and longs (and their
49 sizes) where it seems appropriate. I.E. we use a short int to hold DWARF
50 tags, and assume that the tag size in the file is the same as sizeof(short).
52 FIXME: See other FIXME's and "ifdef 0" scattered throughout the code for
53 other things to work on, if you get bored. :-)
69 #include "elf/dwarf.h"
73 #ifdef MAINTENANCE /* Define to 1 to compile in some maintenance stuff */
74 #define SQUAWK(stuff) dwarfwarn stuff
79 #ifndef R_FP /* FIXME */
80 #define R_FP 14 /* Kludge to get frame pointer register number */
83 typedef unsigned int DIEREF; /* Reference to a DIE */
86 #define GCC_PRODUCER "GNU C "
89 #define STREQ(a,b) (strcmp(a,b)==0)
90 #define STREQN(a,b,n) (strncmp(a,b,n)==0)
92 /* The Amiga SVR4 header file <dwarf.h> defines AT_element_list as a
93 FORM_BLOCK2, and this is the value emitted by the AT&T compiler.
94 However, the Issue 2 DWARF specification from AT&T defines it as
95 a FORM_BLOCK4, as does the latest specification from UI/PLSIG.
96 For backwards compatibility with the AT&T compiler produced executables
97 we define AT_short_element_list for this variant. */
99 #define AT_short_element_list (0x00f0|FORM_BLOCK2)
101 /* External variables referenced. */
103 extern CORE_ADDR startup_file_start; /* From blockframe.c */
104 extern CORE_ADDR startup_file_end; /* From blockframe.c */
105 extern CORE_ADDR entry_scope_lowpc; /* From blockframe.c */
106 extern CORE_ADDR entry_scope_highpc; /* From blockframc.c */
107 extern CORE_ADDR main_scope_lowpc; /* From blockframe.c */
108 extern CORE_ADDR main_scope_highpc; /* From blockframc.c */
109 extern int info_verbose; /* From main.c; nonzero => verbose */
112 /* The DWARF debugging information consists of two major pieces,
113 one is a block of DWARF Information Entries (DIE's) and the other
114 is a line number table. The "struct dieinfo" structure contains
115 the information for a single DIE, the one currently being processed.
117 In order to make it easier to randomly access the attribute fields
118 of the current DIE, which are specifically unordered within the DIE
119 each DIE is scanned and an instance of the "struct dieinfo"
120 structure is initialized.
122 Initialization is done in two levels. The first, done by basicdieinfo(),
123 just initializes those fields that are vital to deciding whether or not
124 to use this DIE, how to skip past it, etc. The second, done by the
125 function completedieinfo(), fills in the rest of the information.
127 Attributes which have block forms are not interpreted at the time
128 the DIE is scanned, instead we just save pointers to the start
129 of their value fields.
131 Some fields have a flag <name>_p that is set when the value of the
132 field is valid (I.E. we found a matching attribute in the DIE). Since
133 we may want to test for the presence of some attributes in the DIE,
134 such as AT_low_pc, without restricting the values of the field,
135 we need someway to note that we found such an attribute.
142 char * die; /* Pointer to the raw DIE data */
143 long dielength; /* Length of the raw DIE data */
144 DIEREF dieref; /* Offset of this DIE */
145 short dietag; /* Tag for this DIE */
150 unsigned short at_fund_type;
151 BLOCK * at_mod_fund_type;
152 long at_user_def_type;
153 BLOCK * at_mod_u_d_type;
155 BLOCK * at_subscr_data;
159 BLOCK * at_element_list;
166 BLOCK * at_discr_value;
169 BLOCK * at_string_length;
177 unsigned int has_at_low_pc:1;
178 unsigned int has_at_stmt_list:1;
179 unsigned int short_element_list:1;
182 static int diecount; /* Approximate count of dies for compilation unit */
183 static struct dieinfo *curdie; /* For warnings and such */
185 static char *dbbase; /* Base pointer to dwarf info */
186 static int dbroff; /* Relative offset from start of .debug section */
187 static char *lnbase; /* Base pointer to line section */
188 static int isreg; /* Kludge to identify register variables */
189 static int offreg; /* Kludge to identify basereg references */
191 static CORE_ADDR baseaddr; /* Add to each symbol value */
193 /* Each partial symbol table entry contains a pointer to private data for the
194 read_symtab() function to use when expanding a partial symbol table entry
195 to a full symbol table entry. For DWARF debugging info, this data is
196 contained in the following structure and macros are provided for easy
197 access to the members given a pointer to a partial symbol table entry.
199 dbfoff Always the absolute file offset to the start of the ".debug"
200 section for the file containing the DIE's being accessed.
202 dbroff Relative offset from the start of the ".debug" access to the
203 first DIE to be accessed. When building the partial symbol
204 table, this value will be zero since we are accessing the
205 entire ".debug" section. When expanding a partial symbol
206 table entry, this value will be the offset to the first
207 DIE for the compilation unit containing the symbol that
208 triggers the expansion.
210 dblength The size of the chunk of DIE's being examined, in bytes.
212 lnfoff The absolute file offset to the line table fragment. Ignored
213 when building partial symbol tables, but used when expanding
214 them, and contains the absolute file offset to the fragment
215 of the ".line" section containing the line numbers for the
216 current compilation unit.
220 int dbfoff; /* Absolute file offset to start of .debug section */
221 int dbroff; /* Relative offset from start of .debug section */
222 int dblength; /* Size of the chunk of DIE's being examined */
223 int lnfoff; /* Absolute file offset to line table fragment */
226 #define DBFOFF(p) (((struct dwfinfo *)((p)->read_symtab_private))->dbfoff)
227 #define DBROFF(p) (((struct dwfinfo *)((p)->read_symtab_private))->dbroff)
228 #define DBLENGTH(p) (((struct dwfinfo *)((p)->read_symtab_private))->dblength)
229 #define LNFOFF(p) (((struct dwfinfo *)((p)->read_symtab_private))->lnfoff)
231 /* The generic symbol table building routines have separate lists for
232 file scope symbols and all all other scopes (local scopes). So
233 we need to select the right one to pass to add_symbol_to_list().
234 We do it by keeping a pointer to the correct list in list_in_scope.
236 FIXME: The original dwarf code just treated the file scope as the first
237 local scope, and all other local scopes as nested local scopes, and worked
238 fine. Check to see if we really need to distinguish these in buildsym.c */
240 struct pending **list_in_scope = &file_symbols;
242 /* DIES which have user defined types or modified user defined types refer to
243 other DIES for the type information. Thus we need to associate the offset
244 of a DIE for a user defined type with a pointer to the type information.
246 Originally this was done using a simple but expensive algorithm, with an
247 array of unsorted structures, each containing an offset/type-pointer pair.
248 This array was scanned linearly each time a lookup was done. The result
249 was that gdb was spending over half it's startup time munging through this
250 array of pointers looking for a structure that had the right offset member.
252 The second attempt used the same array of structures, but the array was
253 sorted using qsort each time a new offset/type was recorded, and a binary
254 search was used to find the type pointer for a given DIE offset. This was
255 even slower, due to the overhead of sorting the array each time a new
256 offset/type pair was entered.
258 The third attempt uses a fixed size array of type pointers, indexed by a
259 value derived from the DIE offset. Since the minimum DIE size is 4 bytes,
260 we can divide any DIE offset by 4 to obtain a unique index into this fixed
261 size array. Since each element is a 4 byte pointer, it takes exactly as
262 much memory to hold this array as to hold the DWARF info for a given
263 compilation unit. But it gets freed as soon as we are done with it. */
265 static struct type **utypes; /* Pointer to array of user type pointers */
266 static int numutypes; /* Max number of user type pointers */
268 /* Forward declarations of static functions so we don't have to worry
269 about ordering within this file. The EXFUN macro may be slightly
270 misleading. Should probably be called DCLFUN instead, or something
271 more intuitive, since it can be used for both static and external
275 EXFUN (dwarfwarn, (char *fmt DOTS));
278 EXFUN (scan_partial_symbols, (char *thisdie AND char *enddie));
281 EXFUN (scan_compilation_units,
282 (char *filename AND char *thisdie AND char *enddie
283 AND unsigned int dbfoff AND unsigned int lnoffset
284 AND struct objfile *objfile));
286 static struct partial_symtab *
287 EXFUN(dwarf_start_psymtab, (struct objfile *objfile AND CORE_ADDR addr
288 AND char *filename AND CORE_ADDR textlow
289 AND CORE_ADDR texthigh AND int dbfoff
290 AND int curoff AND int culength AND int lnfoff
291 AND struct partial_symbol *global_syms
292 AND struct partial_symbol *static_syms));
295 EXFUN(add_partial_symbol, (struct dieinfo *dip));
298 EXFUN(init_psymbol_list, (int total_symbols));
301 EXFUN(basicdieinfo, (struct dieinfo *dip AND char *diep));
304 EXFUN(completedieinfo, (struct dieinfo *dip));
307 EXFUN(dwarf_psymtab_to_symtab, (struct partial_symtab *pst));
310 EXFUN(psymtab_to_symtab_1, (struct partial_symtab *pst));
312 static struct symtab *
313 EXFUN(read_ofile_symtab, (struct partial_symtab *pst));
317 (char *thisdie AND char *enddie AND struct objfile *objfile));
320 EXFUN(read_structure_scope,
321 (struct dieinfo *dip AND char *thisdie AND char *enddie AND
322 struct objfile *objfile));
325 EXFUN(decode_array_element_type, (char *scan AND char *end));
328 EXFUN(decode_subscr_data, (char *scan AND char *end));
331 EXFUN(dwarf_read_array_type, (struct dieinfo *dip));
334 EXFUN(read_subroutine_type,
335 (struct dieinfo *dip AND char *thisdie AND char *enddie));
338 EXFUN(read_enumeration,
339 (struct dieinfo *dip AND char *thisdie AND char *enddie));
343 (struct dieinfo *dip AND char *thisdie AND char *enddie AND
344 struct objfile *objfile));
347 EXFUN(enum_type, (struct dieinfo *dip));
350 EXFUN(decode_line_numbers, (char *linetable));
353 EXFUN(decode_die_type, (struct dieinfo *dip));
356 EXFUN(decode_mod_fund_type, (char *typedata));
359 EXFUN(decode_mod_u_d_type, (char *typedata));
362 EXFUN(decode_modified_type,
363 (unsigned char *modifiers AND unsigned short modcount AND int mtype));
366 EXFUN(decode_fund_type, (unsigned short fundtype));
369 EXFUN(create_name, (char *name AND struct obstack *obstackp));
372 EXFUN(lookup_utype, (DIEREF dieref));
375 EXFUN(alloc_utype, (DIEREF dieref AND struct type *usetype));
377 static struct symbol *
378 EXFUN(new_symbol, (struct dieinfo *dip));
381 EXFUN(locval, (char *loc));
384 EXFUN(record_misc_function, (char *name AND CORE_ADDR address AND
385 enum misc_function_type));
388 EXFUN(compare_psymbols,
389 (struct partial_symbol *s1 AND struct partial_symbol *s2));
396 dwarf_build_psymtabs -- build partial symtabs from DWARF debug info
400 void dwarf_build_psymtabs (int desc, char *filename, CORE_ADDR addr,
401 int mainline, unsigned int dbfoff, unsigned int dbsize,
402 unsigned int lnoffset, unsigned int lnsize,
403 struct objfile *objfile)
407 This function is called upon to build partial symtabs from files
408 containing DIE's (Dwarf Information Entries) and DWARF line numbers.
410 It is passed a file descriptor for an open file containing the DIES
411 and line number information, the corresponding filename for that
412 file, a base address for relocating the symbols, a flag indicating
413 whether or not this debugging information is from a "main symbol
414 table" rather than a shared library or dynamically linked file,
415 and file offset/size pairs for the DIE information and line number
425 DEFUN(dwarf_build_psymtabs,
426 (desc, filename, addr, mainline, dbfoff, dbsize, lnoffset, lnsize,
432 unsigned int dbfoff AND
433 unsigned int dbsize AND
434 unsigned int lnoffset AND
435 unsigned int lnsize AND
436 struct objfile *objfile)
438 struct cleanup *back_to;
440 dbbase = xmalloc (dbsize);
442 if ((lseek (desc, dbfoff, 0) != dbfoff) ||
443 (read (desc, dbbase, dbsize) != dbsize))
446 error ("can't read DWARF data from '%s'", filename);
448 back_to = make_cleanup (free, dbbase);
450 /* If we are reinitializing, or if we have never loaded syms yet, init.
451 Since we have no idea how many DIES we are looking at, we just guess
452 some arbitrary value. */
454 if (mainline || global_psymbols.size == 0 || static_psymbols.size == 0)
456 init_psymbol_list (1024);
459 /* From this point on, we don't need to pass mainline around, so zap
460 baseaddr to zero if we don't need relocation. */
471 /* Follow the compilation unit sibling chain, building a partial symbol
472 table entry for each one. Save enough information about each compilation
473 unit to locate the full DWARF information later. */
475 scan_compilation_units (filename, dbbase, dbbase + dbsize,
476 dbfoff, lnoffset, objfile);
478 do_cleanups (back_to);
486 record_misc_function -- add entry to miscellaneous function vector
490 static void record_misc_function (char *name, CORE_ADDR address,
491 enum misc_function_type mf_type)
495 Given a pointer to the name of a symbol that should be added to the
496 miscellaneous function vector, and the address associated with that
497 symbol, records this information for later use in building the
498 miscellaneous function vector.
503 DEFUN(record_misc_function, (name, address, mf_type),
504 char *name AND CORE_ADDR address AND enum misc_function_type mf_type)
506 prim_record_misc_function (obsavestring (name, strlen (name)), address,
514 dwarfwarn -- issue a DWARF related warning
518 Issue warnings about DWARF related things that aren't serious enough
519 to warrant aborting with an error, but should not be ignored either.
520 This includes things like detectable corruption in DIE's, missing
521 DIE's, unimplemented features, etc.
523 In general, running across tags or attributes that we don't recognize
524 is not considered to be a problem and we should not issue warnings
529 We mostly follow the example of the error() routine, but without
530 returning to command level. It is arguable about whether warnings
531 should be issued at all, and if so, where they should go (stdout or
534 We assume that curdie is valid and contains at least the basic
535 information for the DIE where the problem was noticed.
541 DEFUN(dwarfwarn, (fmt), char *fmt DOTS)
547 fprintf (stderr, "DWARF warning (ref 0x%x): ", curdie -> dieref);
548 if (curdie -> at_name)
550 fprintf (stderr, "'%s': ", curdie -> at_name);
552 vfprintf (stderr, fmt, ap);
553 fprintf (stderr, "\n");
568 fmt = va_arg (ap, char *);
570 fprintf (stderr, "DWARF warning (ref 0x%x): ", curdie -> dieref);
571 if (curdie -> at_name)
573 fprintf (stderr, "'%s': ", curdie -> at_name);
575 vfprintf (stderr, fmt, ap);
576 fprintf (stderr, "\n");
587 compare_psymbols -- compare two partial symbols by name
591 Given pointer to two partial symbol table entries, compare
592 them by name and return -N, 0, or +N (ala strcmp). Typically
593 used by sorting routines like qsort().
597 This is a copy from dbxread.c. It should be moved to a generic
598 gdb file and made available for all psymtab builders (FIXME).
600 Does direct compare of first two characters before punting
601 and passing to strcmp for longer compares. Note that the
602 original version had a bug whereby two null strings or two
603 identically named one character strings would return the
604 comparison of memory following the null byte.
609 DEFUN(compare_psymbols, (s1, s2),
610 struct partial_symbol *s1 AND
611 struct partial_symbol *s2)
613 register char *st1 = SYMBOL_NAME (s1);
614 register char *st2 = SYMBOL_NAME (s2);
616 if ((st1[0] - st2[0]) || !st1[0])
618 return (st1[0] - st2[0]);
620 else if ((st1[1] - st2[1]) || !st1[1])
622 return (st1[1] - st2[1]);
626 return (strcmp (st1 + 2, st2 + 2));
634 read_lexical_block_scope -- process all dies in a lexical block
638 static void read_lexical_block_scope (struct dieinfo *dip,
639 char *thisdie, char *enddie)
643 Process all the DIES contained within a lexical block scope.
644 Start a new scope, process the dies, and then close the scope.
649 DEFUN(read_lexical_block_scope, (dip, thisdie, enddie, objfile),
650 struct dieinfo *dip AND
653 struct objfile *objfile)
655 register struct context_stack *new;
657 (void) push_context (0, dip -> at_low_pc);
658 process_dies (thisdie + dip -> dielength, enddie, objfile);
659 new = pop_context ();
660 if (local_symbols != NULL)
662 finish_block (0, &local_symbols, new -> old_blocks, new -> start_addr,
665 local_symbols = new -> locals;
672 lookup_utype -- look up a user defined type from die reference
676 static type *lookup_utype (DIEREF dieref)
680 Given a DIE reference, lookup the user defined type associated with
681 that DIE, if it has been registered already. If not registered, then
682 return NULL. Alloc_utype() can be called to register an empty
683 type for this reference, which will be filled in later when the
684 actual referenced DIE is processed.
688 DEFUN(lookup_utype, (dieref), DIEREF dieref)
690 struct type *type = NULL;
693 utypeidx = (dieref - dbroff) / 4;
694 if ((utypeidx < 0) || (utypeidx >= numutypes))
696 dwarfwarn ("reference to DIE (0x%x) outside compilation unit", dieref);
700 type = *(utypes + utypeidx);
710 alloc_utype -- add a user defined type for die reference
714 static type *alloc_utype (DIEREF dieref, struct type *utypep)
718 Given a die reference DIEREF, and a possible pointer to a user
719 defined type UTYPEP, register that this reference has a user
720 defined type and either use the specified type in UTYPEP or
721 make a new empty type that will be filled in later.
723 We should only be called after calling lookup_utype() to verify that
724 there is not currently a type registered for DIEREF.
728 DEFUN(alloc_utype, (dieref, utypep),
735 utypeidx = (dieref - dbroff) / 4;
736 typep = utypes + utypeidx;
737 if ((utypeidx < 0) || (utypeidx >= numutypes))
739 utypep = builtin_type_int;
740 dwarfwarn ("reference to DIE (0x%x) outside compilation unit", dieref);
742 else if (*typep != NULL)
745 SQUAWK (("internal error: dup user type allocation"));
751 utypep = (struct type *)
752 obstack_alloc (symbol_obstack, sizeof (struct type));
753 (void) memset (utypep, 0, sizeof (struct type));
764 decode_die_type -- return a type for a specified die
768 static struct type *decode_die_type (struct dieinfo *dip)
772 Given a pointer to a die information structure DIP, decode the
773 type of the die and return a pointer to the decoded type. All
774 dies without specific types default to type int.
778 DEFUN(decode_die_type, (dip), struct dieinfo *dip)
780 struct type *type = NULL;
782 if (dip -> at_fund_type != 0)
784 type = decode_fund_type (dip -> at_fund_type);
786 else if (dip -> at_mod_fund_type != NULL)
788 type = decode_mod_fund_type (dip -> at_mod_fund_type);
790 else if (dip -> at_user_def_type)
792 if ((type = lookup_utype (dip -> at_user_def_type)) == NULL)
794 type = alloc_utype (dip -> at_user_def_type, NULL);
797 else if (dip -> at_mod_u_d_type)
799 type = decode_mod_u_d_type (dip -> at_mod_u_d_type);
803 type = builtin_type_int;
812 struct_type -- compute and return the type for a struct or union
816 static struct type *struct_type (struct dieinfo *dip, char *thisdie,
817 char *enddie, struct objfile *objfile)
821 Given pointer to a die information structure for a die which
822 defines a union or structure (and MUST define one or the other),
823 and pointers to the raw die data that define the range of dies which
824 define the members, compute and return the user defined type for the
829 DEFUN(struct_type, (dip, thisdie, enddie, objfile),
830 struct dieinfo *dip AND
833 struct objfile *objfile)
837 struct nextfield *next;
840 struct nextfield *list = NULL;
841 struct nextfield *new;
848 if ((type = lookup_utype (dip -> dieref)) == NULL)
850 /* No forward references created an empty type, so install one now */
851 type = alloc_utype (dip -> dieref, NULL);
853 INIT_CPLUS_SPECIFIC(type);
854 switch (dip -> dietag)
856 case TAG_structure_type:
857 TYPE_CODE (type) = TYPE_CODE_STRUCT;
861 TYPE_CODE (type) = TYPE_CODE_UNION;
865 /* Should never happen */
866 TYPE_CODE (type) = TYPE_CODE_UNDEF;
868 SQUAWK (("missing structure or union tag"));
871 /* Some compilers try to be helpful by inventing "fake" names for
872 anonymous enums, structures, and unions, like "~0fake" or ".0fake".
873 Thanks, but no thanks... */
874 if (dip -> at_name != NULL
875 && *dip -> at_name != '~'
876 && *dip -> at_name != '.')
878 TYPE_NAME (type) = obconcat (tpart1, " ", dip -> at_name);
880 if (dip -> at_byte_size != 0)
882 TYPE_LENGTH (type) = dip -> at_byte_size;
884 thisdie += dip -> dielength;
885 while (thisdie < enddie)
887 basicdieinfo (&mbr, thisdie);
888 completedieinfo (&mbr);
889 if (mbr.dielength <= sizeof (long))
893 else if (mbr.at_sibling != 0)
895 nextdie = dbbase + mbr.at_sibling - dbroff;
899 nextdie = thisdie + mbr.dielength;
904 /* Get space to record the next field's data. */
905 new = (struct nextfield *) alloca (sizeof (struct nextfield));
909 list -> field.name = savestring (mbr.at_name, strlen (mbr.at_name));
910 list -> field.type = decode_die_type (&mbr);
911 list -> field.bitpos = 8 * locval (mbr.at_location);
912 list -> field.bitsize = 0;
916 process_dies (thisdie, nextdie, objfile);
921 /* Now create the vector of fields, and record how big it is. We may
922 not even have any fields, if this DIE was generated due to a reference
923 to an anonymous structure or union. In this case, TYPE_FLAG_STUB is
924 set, which clues gdb in to the fact that it needs to search elsewhere
925 for the full structure definition. */
928 TYPE_FLAGS (type) |= TYPE_FLAG_STUB;
932 TYPE_NFIELDS (type) = nfields;
933 TYPE_FIELDS (type) = (struct field *)
934 obstack_alloc (symbol_obstack, sizeof (struct field) * nfields);
935 /* Copy the saved-up fields into the field vector. */
936 for (n = nfields; list; list = list -> next)
938 TYPE_FIELD (type, --n) = list -> field;
948 read_structure_scope -- process all dies within struct or union
952 static void read_structure_scope (struct dieinfo *dip,
953 char *thisdie, char *enddie, struct objfile *objfile)
957 Called when we find the DIE that starts a structure or union
958 scope (definition) to process all dies that define the members
959 of the structure or union. DIP is a pointer to the die info
960 struct for the DIE that names the structure or union.
964 Note that we need to call struct_type regardless of whether or not
965 the DIE has an at_name attribute, since it might be an anonymous
966 structure or union. This gets the type entered into our set of
969 However, if the structure is incomplete (an opaque struct/union)
970 then suppress creating a symbol table entry for it since gdb only
971 wants to find the one with the complete definition. Note that if
972 it is complete, we just call new_symbol, which does it's own
973 checking about whether the struct/union is anonymous or not (and
974 suppresses creating a symbol table entry itself).
979 DEFUN(read_structure_scope, (dip, thisdie, enddie, objfile),
980 struct dieinfo *dip AND
983 struct objfile *objfile)
988 type = struct_type (dip, thisdie, enddie, objfile);
989 if (!(TYPE_FLAGS (type) & TYPE_FLAG_STUB))
991 if ((sym = new_symbol (dip)) != NULL)
993 SYMBOL_TYPE (sym) = type;
1002 decode_array_element_type -- decode type of the array elements
1006 static struct type *decode_array_element_type (char *scan, char *end)
1010 As the last step in decoding the array subscript information for an
1011 array DIE, we need to decode the type of the array elements. We are
1012 passed a pointer to this last part of the subscript information and
1013 must return the appropriate type. If the type attribute is not
1014 recognized, just warn about the problem and return type int.
1017 static struct type *
1018 DEFUN(decode_array_element_type, (scan, end), char *scan AND char *end)
1023 unsigned short fundtype;
1025 (void) memcpy (&attribute, scan, sizeof (short));
1026 scan += sizeof (short);
1030 (void) memcpy (&fundtype, scan, sizeof (short));
1031 typep = decode_fund_type (fundtype);
1033 case AT_mod_fund_type:
1034 typep = decode_mod_fund_type (scan);
1036 case AT_user_def_type:
1037 (void) memcpy (&dieref, scan, sizeof (DIEREF));
1038 if ((typep = lookup_utype (dieref)) == NULL)
1040 typep = alloc_utype (dieref, NULL);
1043 case AT_mod_u_d_type:
1044 typep = decode_mod_u_d_type (scan);
1047 SQUAWK (("bad array element type attribute 0x%x", attribute));
1048 typep = builtin_type_int;
1058 decode_subscr_data -- decode array subscript and element type data
1062 static struct type *decode_subscr_data (char *scan, char *end)
1066 The array subscripts and the data type of the elements of an
1067 array are described by a list of data items, stored as a block
1068 of contiguous bytes. There is a data item describing each array
1069 dimension, and a final data item describing the element type.
1070 The data items are ordered the same as their appearance in the
1071 source (I.E. leftmost dimension first, next to leftmost second,
1074 We are passed a pointer to the start of the block of bytes
1075 containing the data items, and a pointer to the first byte past
1076 the data. This function decodes the data and returns a type.
1079 FIXME: This code only implements the forms currently used
1080 by the AT&T and GNU C compilers.
1082 The end pointer is supplied for error checking, maybe we should
1086 static struct type *
1087 DEFUN(decode_subscr_data, (scan, end), char *scan AND char *end)
1089 struct type *typep = NULL;
1090 struct type *nexttype;
1100 typep = decode_array_element_type (scan, end);
1103 (void) memcpy (&fundtype, scan, sizeof (short));
1104 scan += sizeof (short);
1105 if (fundtype != FT_integer && fundtype != FT_signed_integer
1106 && fundtype != FT_unsigned_integer)
1108 SQUAWK (("array subscripts must be integral types, not type 0x%x",
1113 (void) memcpy (&lowbound, scan, sizeof (long));
1114 scan += sizeof (long);
1115 (void) memcpy (&highbound, scan, sizeof (long));
1116 scan += sizeof (long);
1117 nexttype = decode_subscr_data (scan, end);
1118 if (nexttype != NULL)
1120 typep = (struct type *)
1121 obstack_alloc (symbol_obstack, sizeof (struct type));
1122 (void) memset (typep, 0, sizeof (struct type));
1123 TYPE_CODE (typep) = TYPE_CODE_ARRAY;
1124 TYPE_LENGTH (typep) = TYPE_LENGTH (nexttype);
1125 TYPE_LENGTH (typep) *= lowbound + highbound + 1;
1126 TYPE_TARGET_TYPE (typep) = nexttype;
1137 SQUAWK (("array subscript format 0x%x not handled yet", format));
1140 SQUAWK (("unknown array subscript format %x", format));
1150 dwarf_read_array_type -- read TAG_array_type DIE
1154 static void dwarf_read_array_type (struct dieinfo *dip)
1158 Extract all information from a TAG_array_type DIE and add to
1159 the user defined type vector.
1163 DEFUN(dwarf_read_array_type, (dip), struct dieinfo *dip)
1171 if (dip -> at_ordering != ORD_row_major)
1173 /* FIXME: Can gdb even handle column major arrays? */
1174 SQUAWK (("array not row major; not handled correctly"));
1176 if ((sub = dip -> at_subscr_data) != NULL)
1178 (void) memcpy (&temp, sub, sizeof (short));
1179 subend = sub + sizeof (short) + temp;
1180 sub += sizeof (short);
1181 type = decode_subscr_data (sub, subend);
1184 if ((utype = lookup_utype (dip -> dieref)) == NULL)
1186 utype = alloc_utype (dip -> dieref, NULL);
1188 TYPE_CODE (utype) = TYPE_CODE_ARRAY;
1189 TYPE_TARGET_TYPE (utype) = builtin_type_int;
1190 TYPE_LENGTH (utype) = 1 * TYPE_LENGTH (TYPE_TARGET_TYPE (utype));
1194 if ((utype = lookup_utype (dip -> dieref)) == NULL)
1196 (void) alloc_utype (dip -> dieref, type);
1200 TYPE_CODE (utype) = TYPE_CODE_ARRAY;
1201 TYPE_LENGTH (utype) = TYPE_LENGTH (type);
1202 TYPE_TARGET_TYPE (utype) = TYPE_TARGET_TYPE (type);
1212 read_subroutine_type -- process TAG_subroutine_type dies
1216 static void read_subroutine_type (struct dieinfo *dip, char thisdie,
1221 Handle DIES due to C code like:
1224 int (*funcp)(int a, long l); (Generates TAG_subroutine_type DIE)
1230 The parameter DIES are currently ignored. See if gdb has a way to
1231 include this info in it's type system, and decode them if so. Is
1232 this what the type structure's "arg_types" field is for? (FIXME)
1236 DEFUN(read_subroutine_type, (dip, thisdie, enddie),
1237 struct dieinfo *dip AND
1241 struct type *type; /* Type that this function returns */
1242 struct type *ftype; /* Function that returns above type */
1244 /* Decode the type that this subroutine returns */
1246 type = decode_die_type (dip);
1248 /* Check to see if we already have a partially constructed user
1249 defined type for this DIE, from a forward reference. */
1251 if ((ftype = lookup_utype (dip -> dieref)) == NULL)
1253 /* This is the first reference to one of these types. Make
1254 a new one and place it in the user defined types. */
1255 ftype = lookup_function_type (type);
1256 (void) alloc_utype (dip -> dieref, ftype);
1260 /* We have an existing partially constructed type, so bash it
1261 into the correct type. */
1262 TYPE_TARGET_TYPE (ftype) = type;
1263 TYPE_FUNCTION_TYPE (type) = ftype;
1264 TYPE_LENGTH (ftype) = 1;
1265 TYPE_CODE (ftype) = TYPE_CODE_FUNC;
1273 read_enumeration -- process dies which define an enumeration
1277 static void read_enumeration (struct dieinfo *dip, char *thisdie,
1282 Given a pointer to a die which begins an enumeration, process all
1283 the dies that define the members of the enumeration.
1287 Note that we need to call enum_type regardless of whether or not we
1288 have a symbol, since we might have an enum without a tag name (thus
1289 no symbol for the tagname).
1293 DEFUN(read_enumeration, (dip, thisdie, enddie),
1294 struct dieinfo *dip AND
1301 type = enum_type (dip);
1302 if ((sym = new_symbol (dip)) != NULL)
1304 SYMBOL_TYPE (sym) = type;
1312 enum_type -- decode and return a type for an enumeration
1316 static type *enum_type (struct dieinfo *dip)
1320 Given a pointer to a die information structure for the die which
1321 starts an enumeration, process all the dies that define the members
1322 of the enumeration and return a type pointer for the enumeration.
1324 At the same time, for each member of the enumeration, create a
1325 symbol for it with namespace VAR_NAMESPACE and class LOC_CONST,
1326 and give it the type of the enumeration itself.
1330 Note that the DWARF specification explicitly mandates that enum
1331 constants occur in reverse order from the source program order,
1332 for "consistency" and because this ordering is easier for many
1333 compilers to generate. (Draft 5, sec 3.9.5, Enumeration type
1334 Entries). Because gdb wants to see the enum members in program
1335 source order, we have to ensure that the order gets reversed while
1336 we are processing them.
1339 static struct type *
1340 DEFUN(enum_type, (dip), struct dieinfo *dip)
1344 struct nextfield *next;
1347 struct nextfield *list = NULL;
1348 struct nextfield *new;
1357 if ((type = lookup_utype (dip -> dieref)) == NULL)
1359 /* No forward references created an empty type, so install one now */
1360 type = alloc_utype (dip -> dieref, NULL);
1362 TYPE_CODE (type) = TYPE_CODE_ENUM;
1363 /* Some compilers try to be helpful by inventing "fake" names for
1364 anonymous enums, structures, and unions, like "~0fake" or ".0fake".
1365 Thanks, but no thanks... */
1366 if (dip -> at_name != NULL
1367 && *dip -> at_name != '~'
1368 && *dip -> at_name != '.')
1370 TYPE_NAME (type) = obconcat ("enum", " ", dip -> at_name);
1372 if (dip -> at_byte_size != 0)
1374 TYPE_LENGTH (type) = dip -> at_byte_size;
1376 if ((scan = dip -> at_element_list) != NULL)
1378 if (dip -> short_element_list)
1380 (void) memcpy (&stemp, scan, sizeof (stemp));
1381 listend = scan + stemp + sizeof (stemp);
1382 scan += sizeof (stemp);
1386 (void) memcpy (<emp, scan, sizeof (ltemp));
1387 listend = scan + ltemp + sizeof (ltemp);
1388 scan += sizeof (ltemp);
1390 while (scan < listend)
1392 new = (struct nextfield *) alloca (sizeof (struct nextfield));
1395 list -> field.type = NULL;
1396 list -> field.bitsize = 0;
1397 (void) memcpy (&list -> field.bitpos, scan, sizeof (long));
1398 scan += sizeof (long);
1399 list -> field.name = savestring (scan, strlen (scan));
1400 scan += strlen (scan) + 1;
1402 /* Handcraft a new symbol for this enum member. */
1403 sym = (struct symbol *) obstack_alloc (symbol_obstack,
1404 sizeof (struct symbol));
1405 (void) memset (sym, 0, sizeof (struct symbol));
1406 SYMBOL_NAME (sym) = create_name (list -> field.name, symbol_obstack);
1407 SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE;
1408 SYMBOL_CLASS (sym) = LOC_CONST;
1409 SYMBOL_TYPE (sym) = type;
1410 SYMBOL_VALUE (sym) = list -> field.bitpos;
1411 add_symbol_to_list (sym, list_in_scope);
1413 /* Now create the vector of fields, and record how big it is. This is
1414 where we reverse the order, by pulling the members of the list in
1415 reverse order from how they were inserted. If we have no fields
1416 (this is apparently possible in C++) then skip building a field
1420 TYPE_NFIELDS (type) = nfields;
1421 TYPE_FIELDS (type) = (struct field *)
1422 obstack_alloc (symbol_obstack, sizeof (struct field) * nfields);
1423 /* Copy the saved-up fields into the field vector. */
1424 for (n = 0; (n < nfields) && (list != NULL); list = list -> next)
1426 TYPE_FIELD (type, n++) = list -> field;
1437 read_func_scope -- process all dies within a function scope
1441 Process all dies within a given function scope. We are passed
1442 a die information structure pointer DIP for the die which
1443 starts the function scope, and pointers into the raw die data
1444 that define the dies within the function scope.
1446 For now, we ignore lexical block scopes within the function.
1447 The problem is that AT&T cc does not define a DWARF lexical
1448 block scope for the function itself, while gcc defines a
1449 lexical block scope for the function. We need to think about
1450 how to handle this difference, or if it is even a problem.
1455 DEFUN(read_func_scope, (dip, thisdie, enddie, objfile),
1456 struct dieinfo *dip AND
1459 struct objfile *objfile)
1461 register struct context_stack *new;
1463 if (entry_point >= dip -> at_low_pc && entry_point < dip -> at_high_pc)
1465 entry_scope_lowpc = dip -> at_low_pc;
1466 entry_scope_highpc = dip -> at_high_pc;
1468 if (STREQ (dip -> at_name, "main")) /* FIXME: hardwired name */
1470 main_scope_lowpc = dip -> at_low_pc;
1471 main_scope_highpc = dip -> at_high_pc;
1473 new = push_context (0, dip -> at_low_pc);
1474 new -> name = new_symbol (dip);
1475 list_in_scope = &local_symbols;
1476 process_dies (thisdie + dip -> dielength, enddie, objfile);
1477 new = pop_context ();
1478 /* Make a block for the local symbols within. */
1479 finish_block (new -> name, &local_symbols, new -> old_blocks,
1480 new -> start_addr, dip -> at_high_pc);
1481 list_in_scope = &file_symbols;
1488 read_file_scope -- process all dies within a file scope
1492 Process all dies within a given file scope. We are passed a
1493 pointer to the die information structure for the die which
1494 starts the file scope, and pointers into the raw die data which
1495 mark the range of dies within the file scope.
1497 When the partial symbol table is built, the file offset for the line
1498 number table for each compilation unit is saved in the partial symbol
1499 table entry for that compilation unit. As the symbols for each
1500 compilation unit are read, the line number table is read into memory
1501 and the variable lnbase is set to point to it. Thus all we have to
1502 do is use lnbase to access the line number table for the current
1507 DEFUN(read_file_scope, (dip, thisdie, enddie, objfile),
1508 struct dieinfo *dip AND
1511 struct objfile *objfile)
1513 struct cleanup *back_to;
1514 struct symtab *symtab;
1516 if (entry_point >= dip -> at_low_pc && entry_point < dip -> at_high_pc)
1518 startup_file_start = dip -> at_low_pc;
1519 startup_file_end = dip -> at_high_pc;
1521 if (dip -> at_producer != NULL)
1523 processing_gcc_compilation =
1524 STREQN (dip -> at_producer, GCC_PRODUCER, strlen (GCC_PRODUCER));
1526 numutypes = (enddie - thisdie) / 4;
1527 utypes = (struct type **) xmalloc (numutypes * sizeof (struct type *));
1528 back_to = make_cleanup (free, utypes);
1529 (void) memset (utypes, 0, numutypes * sizeof (struct type *));
1530 start_symtab (dip -> at_name, NULL, dip -> at_low_pc);
1531 decode_line_numbers (lnbase);
1532 process_dies (thisdie + dip -> dielength, enddie, objfile);
1533 symtab = end_symtab (dip -> at_high_pc, 0, 0, objfile);
1534 /* FIXME: The following may need to be expanded for other languages */
1535 switch (dip -> at_language)
1539 symtab -> language = language_c;
1541 case LANG_C_PLUS_PLUS:
1542 symtab -> language = language_cplus;
1547 do_cleanups (back_to);
1556 process_dies -- process a range of DWARF Information Entries
1560 static void process_dies (char *thisdie, char *enddie,
1561 struct objfile *objfile)
1565 Process all DIE's in a specified range. May be (and almost
1566 certainly will be) called recursively.
1570 DEFUN(process_dies, (thisdie, enddie, objfile),
1571 char *thisdie AND char *enddie AND struct objfile *objfile)
1576 while (thisdie < enddie)
1578 basicdieinfo (&di, thisdie);
1579 if (di.dielength < sizeof (long))
1583 else if (di.dietag == TAG_padding)
1585 nextdie = thisdie + di.dielength;
1589 completedieinfo (&di);
1590 if (di.at_sibling != 0)
1592 nextdie = dbbase + di.at_sibling - dbroff;
1596 nextdie = thisdie + di.dielength;
1600 case TAG_compile_unit:
1601 read_file_scope (&di, thisdie, nextdie, objfile);
1603 case TAG_global_subroutine:
1604 case TAG_subroutine:
1605 if (di.has_at_low_pc)
1607 read_func_scope (&di, thisdie, nextdie, objfile);
1610 case TAG_lexical_block:
1611 read_lexical_block_scope (&di, thisdie, nextdie, objfile);
1613 case TAG_structure_type:
1614 case TAG_union_type:
1615 read_structure_scope (&di, thisdie, nextdie, objfile);
1617 case TAG_enumeration_type:
1618 read_enumeration (&di, thisdie, nextdie);
1620 case TAG_subroutine_type:
1621 read_subroutine_type (&di, thisdie, nextdie);
1623 case TAG_array_type:
1624 dwarf_read_array_type (&di);
1627 (void) new_symbol (&di);
1639 decode_line_numbers -- decode a line number table fragment
1643 static void decode_line_numbers (char *tblscan, char *tblend,
1644 long length, long base, long line, long pc)
1648 Translate the DWARF line number information to gdb form.
1650 The ".line" section contains one or more line number tables, one for
1651 each ".line" section from the objects that were linked.
1653 The AT_stmt_list attribute for each TAG_source_file entry in the
1654 ".debug" section contains the offset into the ".line" section for the
1655 start of the table for that file.
1657 The table itself has the following structure:
1659 <table length><base address><source statement entry>
1660 4 bytes 4 bytes 10 bytes
1662 The table length is the total size of the table, including the 4 bytes
1663 for the length information.
1665 The base address is the address of the first instruction generated
1666 for the source file.
1668 Each source statement entry has the following structure:
1670 <line number><statement position><address delta>
1671 4 bytes 2 bytes 4 bytes
1673 The line number is relative to the start of the file, starting with
1676 The statement position either -1 (0xFFFF) or the number of characters
1677 from the beginning of the line to the beginning of the statement.
1679 The address delta is the difference between the base address and
1680 the address of the first instruction for the statement.
1682 Note that we must copy the bytes from the packed table to our local
1683 variables before attempting to use them, to avoid alignment problems
1684 on some machines, particularly RISC processors.
1688 Does gdb expect the line numbers to be sorted? They are now by
1689 chance/luck, but are not required to be. (FIXME)
1691 The line with number 0 is unused, gdb apparently can discover the
1692 span of the last line some other way. How? (FIXME)
1696 DEFUN(decode_line_numbers, (linetable), char *linetable)
1705 if (linetable != NULL)
1707 tblscan = tblend = linetable;
1708 (void) memcpy (&length, tblscan, sizeof (long));
1709 tblscan += sizeof (long);
1711 (void) memcpy (&base, tblscan, sizeof (long));
1713 tblscan += sizeof (long);
1714 while (tblscan < tblend)
1716 (void) memcpy (&line, tblscan, sizeof (long));
1717 tblscan += sizeof (long) + sizeof (short);
1718 (void) memcpy (&pc, tblscan, sizeof (long));
1719 tblscan += sizeof (long);
1723 record_line (current_subfile, line, pc);
1733 locval -- compute the value of a location attribute
1737 static int locval (char *loc)
1741 Given pointer to a string of bytes that define a location, compute
1742 the location and return the value.
1744 When computing values involving the current value of the frame pointer,
1745 the value zero is used, which results in a value relative to the frame
1746 pointer, rather than the absolute value. This is what GDB wants
1749 When the result is a register number, the global isreg flag is set,
1750 otherwise it is cleared. This is a kludge until we figure out a better
1751 way to handle the problem. Gdb's design does not mesh well with the
1752 DWARF notion of a location computing interpreter, which is a shame
1753 because the flexibility goes unused.
1757 Note that stack[0] is unused except as a default error return.
1758 Note that stack overflow is not yet handled.
1762 DEFUN(locval, (loc), char *loc)
1764 unsigned short nbytes;
1770 (void) memcpy (&nbytes, loc, sizeof (short));
1771 end = loc + sizeof (short) + nbytes;
1776 for (loc += sizeof (short); loc < end; loc += sizeof (long))
1784 /* push register (number) */
1785 (void) memcpy (&stack[++stacki], loc, sizeof (long));
1789 /* push value of register (number) */
1790 /* Actually, we compute the value as if register has 0 */
1792 (void) memcpy (®no, loc, sizeof (long));
1795 stack[++stacki] = 0;
1799 stack[++stacki] = 0;
1800 SQUAWK (("BASEREG %d not handled!", regno));
1804 /* push address (relocated address) */
1805 (void) memcpy (&stack[++stacki], loc, sizeof (long));
1808 /* push constant (number) */
1809 (void) memcpy (&stack[++stacki], loc, sizeof (long));
1812 /* pop, deref and push 2 bytes (as a long) */
1813 SQUAWK (("OP_DEREF2 address %#x not handled", stack[stacki]));
1815 case OP_DEREF4: /* pop, deref and push 4 bytes (as a long) */
1816 SQUAWK (("OP_DEREF4 address %#x not handled", stack[stacki]));
1818 case OP_ADD: /* pop top 2 items, add, push result */
1819 stack[stacki - 1] += stack[stacki];
1824 return (stack[stacki]);
1831 read_ofile_symtab -- build a full symtab entry from chunk of DIE's
1835 static struct symtab *read_ofile_symtab (struct partial_symtab *pst)
1841 static struct symtab *
1842 DEFUN(read_ofile_symtab, (pst),
1843 struct partial_symtab *pst)
1845 struct cleanup *back_to;
1848 bfd *abfd = pst->objfile->obfd;
1850 /* Allocate a buffer for the entire chunk of DIE's for this compilation
1851 unit, seek to the location in the file, and read in all the DIE's. */
1854 dbbase = xmalloc (DBLENGTH(pst));
1855 dbroff = DBROFF(pst);
1856 foffset = DBFOFF(pst) + dbroff;
1857 baseaddr = pst -> addr;
1858 if (bfd_seek (abfd, foffset, 0) ||
1859 (bfd_read (dbbase, DBLENGTH(pst), 1, abfd) != DBLENGTH(pst)))
1862 error ("can't read DWARF data");
1864 back_to = make_cleanup (free, dbbase);
1866 /* If there is a line number table associated with this compilation unit
1867 then read the first long word from the line number table fragment, which
1868 contains the size of the fragment in bytes (including the long word
1869 itself). Allocate a buffer for the fragment and read it in for future
1875 if (bfd_seek (abfd, LNFOFF (pst), 0) ||
1876 (bfd_read (&lnsize, sizeof(long), 1, abfd) != sizeof(long)))
1878 error ("can't read DWARF line number table size");
1880 lnbase = xmalloc (lnsize);
1881 if (bfd_seek (abfd, LNFOFF (pst), 0) ||
1882 (bfd_read (lnbase, lnsize, 1, abfd) != lnsize))
1885 error ("can't read DWARF line numbers");
1887 make_cleanup (free, lnbase);
1890 process_dies (dbbase, dbbase + DBLENGTH(pst), pst -> objfile);
1891 do_cleanups (back_to);
1892 return (symtab_list);
1899 psymtab_to_symtab_1 -- do grunt work for building a full symtab entry
1903 static void psymtab_to_symtab_1 (struct partial_symtab *pst)
1907 Called once for each partial symbol table entry that needs to be
1908 expanded into a full symbol table entry.
1913 DEFUN(psymtab_to_symtab_1,
1915 struct partial_symtab *pst)
1925 fprintf (stderr, "Psymtab for %s already read in. Shouldn't happen.\n",
1930 /* Read in all partial symtabs on which this one is dependent */
1931 for (i = 0; i < pst -> number_of_dependencies; i++)
1932 if (!pst -> dependencies[i] -> readin)
1934 /* Inform about additional files that need to be read in. */
1937 fputs_filtered (" ", stdout);
1939 fputs_filtered ("and ", stdout);
1941 printf_filtered ("%s...", pst -> dependencies[i] -> filename);
1942 wrap_here (""); /* Flush output */
1945 psymtab_to_symtab_1 (pst -> dependencies[i]);
1948 if (DBLENGTH(pst)) /* Otherwise it's a dummy */
1950 pst -> symtab = read_ofile_symtab (pst);
1953 printf_filtered ("%d DIE's, sorting...", diecount);
1956 sort_symtab_syms (pst -> symtab);
1965 dwarf_psymtab_to_symtab -- build a full symtab entry from partial one
1969 static void dwarf_psymtab_to_symtab (struct partial_symtab *pst)
1973 This is the DWARF support entry point for building a full symbol
1974 table entry from a partial symbol table entry. We are passed a
1975 pointer to the partial symbol table entry that needs to be expanded.
1980 DEFUN(dwarf_psymtab_to_symtab, (pst), struct partial_symtab *pst)
1989 fprintf (stderr, "Psymtab for %s already read in. Shouldn't happen.\n",
1994 if (DBLENGTH(pst) || pst -> number_of_dependencies)
1996 /* Print the message now, before starting serious work, to avoid
1997 disconcerting pauses. */
2000 printf_filtered ("Reading in symbols for %s...", pst -> filename);
2004 psymtab_to_symtab_1 (pst);
2006 #if 0 /* FIXME: Check to see what dbxread is doing here and see if
2007 we need to do an equivalent or is this something peculiar to
2008 stabs/a.out format. */
2009 /* Match with global symbols. This only needs to be done once,
2010 after all of the symtabs and dependencies have been read in. */
2011 scan_file_globals ();
2014 /* Finish up the debug error message. */
2017 printf_filtered ("done.\n");
2026 init_psymbol_list -- initialize storage for partial symbols
2030 static void init_psymbol_list (int total_symbols)
2034 Initializes storage for all of the partial symbols that will be
2035 created by dwarf_build_psymtabs and subsidiaries.
2039 DEFUN(init_psymbol_list, (total_symbols), int total_symbols)
2041 /* Free any previously allocated psymbol lists. */
2043 if (global_psymbols.list)
2045 free (global_psymbols.list);
2047 if (static_psymbols.list)
2049 free (static_psymbols.list);
2052 /* Current best guess is that there are approximately a twentieth
2053 of the total symbols (in a debugging file) are global or static
2056 global_psymbols.size = total_symbols / 10;
2057 static_psymbols.size = total_symbols / 10;
2058 global_psymbols.next = global_psymbols.list = (struct partial_symbol *)
2059 xmalloc (global_psymbols.size * sizeof (struct partial_symbol));
2060 static_psymbols.next = static_psymbols.list = (struct partial_symbol *)
2061 xmalloc (static_psymbols.size * sizeof (struct partial_symbol));
2068 dwarf_start_psymtab -- allocate and fill a partial symtab entry
2072 Allocate and partially fill a partial symtab. It will be completely
2073 filled at the end of the symbol list.
2075 SYMFILE_NAME is the name of the symbol-file we are reading from, and
2076 ADDR is the address relative to which its symbols are (incremental)
2077 or 0 (normal). FILENAME is the name of the compilation unit that
2078 these symbols were defined in, and they appear starting a address
2079 TEXTLOW. DBROFF is the absolute file offset in SYMFILE_NAME where
2080 the full symbols can be read for compilation unit FILENAME.
2081 GLOBAL_SYMS and STATIC_SYMS are pointers to the current end of the
2086 static struct partial_symtab *
2087 DEFUN(dwarf_start_psymtab,
2088 (objfile, addr, filename, textlow, texthigh, dbfoff, curoff,
2089 culength, lnfoff, global_syms, static_syms),
2090 struct objfile *objfile AND
2093 CORE_ADDR textlow AND
2094 CORE_ADDR texthigh AND
2099 struct partial_symbol *global_syms AND
2100 struct partial_symbol *static_syms)
2102 struct partial_symtab *result;
2104 result = (struct partial_symtab *)
2105 obstack_alloc (psymbol_obstack, sizeof (struct partial_symtab));
2106 (void) memset (result, 0, sizeof (struct partial_symtab));
2107 result -> addr = addr;
2108 result -> objfile = objfile;
2109 result -> filename = create_name (filename, psymbol_obstack);
2110 result -> textlow = textlow;
2111 result -> texthigh = texthigh;
2112 result -> read_symtab_private = (char *) obstack_alloc (psymbol_obstack,
2113 sizeof (struct dwfinfo));
2114 DBFOFF (result) = dbfoff;
2115 DBROFF (result) = curoff;
2116 DBLENGTH (result) = culength;
2117 LNFOFF (result) = lnfoff;
2118 result -> readin = 0;
2119 result -> symtab = NULL;
2120 result -> read_symtab = dwarf_psymtab_to_symtab;
2121 result -> globals_offset = global_syms - global_psymbols.list;
2122 result -> statics_offset = static_syms - static_psymbols.list;
2124 result->n_global_syms = 0;
2125 result->n_static_syms = 0;
2134 add_enum_psymbol -- add enumeration members to partial symbol table
2138 Given pointer to a DIE that is known to be for an enumeration,
2139 extract the symbolic names of the enumeration members and add
2140 partial symbols for them.
2144 DEFUN(add_enum_psymbol, (dip), struct dieinfo *dip)
2151 if ((scan = dip -> at_element_list) != NULL)
2153 if (dip -> short_element_list)
2155 (void) memcpy (&stemp, scan, sizeof (stemp));
2156 listend = scan + stemp + sizeof (stemp);
2157 scan += sizeof (stemp);
2161 (void) memcpy (<emp, scan, sizeof (ltemp));
2162 listend = scan + ltemp + sizeof (ltemp);
2163 scan += sizeof (ltemp);
2165 while (scan < listend)
2167 scan += sizeof (long);
2168 ADD_PSYMBOL_TO_LIST (scan, strlen (scan), VAR_NAMESPACE, LOC_CONST,
2169 static_psymbols, 0);
2170 scan += strlen (scan) + 1;
2179 add_partial_symbol -- add symbol to partial symbol table
2183 Given a DIE, if it is one of the types that we want to
2184 add to a partial symbol table, finish filling in the die info
2185 and then add a partial symbol table entry for it.
2190 DEFUN(add_partial_symbol, (dip), struct dieinfo *dip)
2192 switch (dip -> dietag)
2194 case TAG_global_subroutine:
2195 record_misc_function (dip -> at_name, dip -> at_low_pc, mf_text);
2196 ADD_PSYMBOL_TO_LIST (dip -> at_name, strlen (dip -> at_name),
2197 VAR_NAMESPACE, LOC_BLOCK, global_psymbols,
2200 case TAG_global_variable:
2201 record_misc_function (dip -> at_name, locval (dip -> at_location),
2203 ADD_PSYMBOL_TO_LIST (dip -> at_name, strlen (dip -> at_name),
2204 VAR_NAMESPACE, LOC_STATIC, global_psymbols,
2207 case TAG_subroutine:
2208 ADD_PSYMBOL_TO_LIST (dip -> at_name, strlen (dip -> at_name),
2209 VAR_NAMESPACE, LOC_BLOCK, static_psymbols,
2212 case TAG_local_variable:
2213 ADD_PSYMBOL_TO_LIST (dip -> at_name, strlen (dip -> at_name),
2214 VAR_NAMESPACE, LOC_STATIC, static_psymbols,
2218 ADD_PSYMBOL_TO_LIST (dip -> at_name, strlen (dip -> at_name),
2219 VAR_NAMESPACE, LOC_TYPEDEF, static_psymbols,
2222 case TAG_structure_type:
2223 case TAG_union_type:
2224 ADD_PSYMBOL_TO_LIST (dip -> at_name, strlen (dip -> at_name),
2225 STRUCT_NAMESPACE, LOC_TYPEDEF, static_psymbols,
2228 case TAG_enumeration_type:
2231 ADD_PSYMBOL_TO_LIST (dip -> at_name, strlen (dip -> at_name),
2232 STRUCT_NAMESPACE, LOC_TYPEDEF, static_psymbols,
2235 add_enum_psymbol (dip);
2244 scan_partial_symbols -- scan DIE's within a single compilation unit
2248 Process the DIE's within a single compilation unit, looking for
2249 interesting DIE's that contribute to the partial symbol table entry
2250 for this compilation unit. Since we cannot follow any sibling
2251 chains without reading the complete DIE info for every DIE,
2252 it is probably faster to just sequentially check each one to
2253 see if it is one of the types we are interested in, and if so,
2254 then extract all the attributes info and generate a partial
2259 Don't attempt to add anonymous structures or unions since they have
2260 no name. Anonymous enumerations however are processed, because we
2261 want to extract their member names (the check for a tag name is
2264 Also, for variables and subroutines, check that this is the place
2265 where the actual definition occurs, rather than just a reference
2270 DEFUN(scan_partial_symbols, (thisdie, enddie), char *thisdie AND char *enddie)
2275 while (thisdie < enddie)
2277 basicdieinfo (&di, thisdie);
2278 if (di.dielength < sizeof (long))
2284 nextdie = thisdie + di.dielength;
2285 /* To avoid getting complete die information for every die, we
2286 only do it (below) for the cases we are interested in. */
2289 case TAG_global_subroutine:
2290 case TAG_subroutine:
2291 case TAG_global_variable:
2292 case TAG_local_variable:
2293 completedieinfo (&di);
2294 if (di.at_name && (di.has_at_low_pc || di.at_location))
2296 add_partial_symbol (&di);
2300 case TAG_structure_type:
2301 case TAG_union_type:
2302 completedieinfo (&di);
2305 add_partial_symbol (&di);
2308 case TAG_enumeration_type:
2309 completedieinfo (&di);
2310 add_partial_symbol (&di);
2322 scan_compilation_units -- build a psymtab entry for each compilation
2326 This is the top level dwarf parsing routine for building partial
2329 It scans from the beginning of the DWARF table looking for the first
2330 TAG_compile_unit DIE, and then follows the sibling chain to locate
2331 each additional TAG_compile_unit DIE.
2333 For each TAG_compile_unit DIE it creates a partial symtab structure,
2334 calls a subordinate routine to collect all the compilation unit's
2335 global DIE's, file scope DIEs, typedef DIEs, etc, and then links the
2336 new partial symtab structure into the partial symbol table. It also
2337 records the appropriate information in the partial symbol table entry
2338 to allow the chunk of DIE's and line number table for this compilation
2339 unit to be located and re-read later, to generate a complete symbol
2340 table entry for the compilation unit.
2342 Thus it effectively partitions up a chunk of DIE's for multiple
2343 compilation units into smaller DIE chunks and line number tables,
2344 and associates them with a partial symbol table entry.
2348 If any compilation unit has no line number table associated with
2349 it for some reason (a missing at_stmt_list attribute, rather than
2350 just one with a value of zero, which is valid) then we ensure that
2351 the recorded file offset is zero so that the routine which later
2352 reads line number table fragments knows that there is no fragment
2362 DEFUN(scan_compilation_units,
2363 (filename, thisdie, enddie, dbfoff, lnoffset, objfile),
2367 unsigned int dbfoff AND
2368 unsigned int lnoffset AND
2369 struct objfile *objfile)
2373 struct partial_symtab *pst;
2378 while (thisdie < enddie)
2380 basicdieinfo (&di, thisdie);
2381 if (di.dielength < sizeof (long))
2385 else if (di.dietag != TAG_compile_unit)
2387 nextdie = thisdie + di.dielength;
2391 completedieinfo (&di);
2392 if (di.at_sibling != 0)
2394 nextdie = dbbase + di.at_sibling - dbroff;
2398 nextdie = thisdie + di.dielength;
2400 curoff = thisdie - dbbase;
2401 culength = nextdie - thisdie;
2402 curlnoffset = di.has_at_stmt_list ? lnoffset + di.at_stmt_list : 0;
2403 pst = dwarf_start_psymtab (objfile, baseaddr, di.at_name,
2406 dbfoff, curoff, culength, curlnoffset,
2407 global_psymbols.next,
2408 static_psymbols.next);
2409 scan_partial_symbols (thisdie + di.dielength, nextdie);
2410 pst -> n_global_syms = global_psymbols.next -
2411 (global_psymbols.list + pst -> globals_offset);
2412 pst -> n_static_syms = static_psymbols.next -
2413 (static_psymbols.list + pst -> statics_offset);
2414 /* Sort the global list; don't sort the static list */
2415 qsort (global_psymbols.list + pst -> globals_offset,
2416 pst -> n_global_syms, sizeof (struct partial_symbol),
2418 /* If there is already a psymtab or symtab for a file of this name,
2419 remove it. (If there is a symtab, more drastic things also
2420 happen.) This happens in VxWorks. */
2421 free_named_symtabs (pst -> filename);
2422 /* Place the partial symtab on the partial symtab list */
2423 pst -> next = partial_symtab_list;
2424 partial_symtab_list = pst;
2434 new_symbol -- make a symbol table entry for a new symbol
2438 static struct symbol *new_symbol (struct dieinfo *dip)
2442 Given a pointer to a DWARF information entry, figure out if we need
2443 to make a symbol table entry for it, and if so, create a new entry
2444 and return a pointer to it.
2447 static struct symbol *
2448 DEFUN(new_symbol, (dip), struct dieinfo *dip)
2450 struct symbol *sym = NULL;
2452 if (dip -> at_name != NULL)
2454 sym = (struct symbol *) obstack_alloc (symbol_obstack,
2455 sizeof (struct symbol));
2456 (void) memset (sym, 0, sizeof (struct symbol));
2457 SYMBOL_NAME (sym) = create_name (dip -> at_name, symbol_obstack);
2458 /* default assumptions */
2459 SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE;
2460 SYMBOL_CLASS (sym) = LOC_STATIC;
2461 SYMBOL_TYPE (sym) = decode_die_type (dip);
2462 switch (dip -> dietag)
2465 SYMBOL_VALUE (sym) = dip -> at_low_pc;
2466 SYMBOL_CLASS (sym) = LOC_LABEL;
2468 case TAG_global_subroutine:
2469 case TAG_subroutine:
2470 SYMBOL_VALUE (sym) = dip -> at_low_pc;
2471 SYMBOL_TYPE (sym) = lookup_function_type (SYMBOL_TYPE (sym));
2472 SYMBOL_CLASS (sym) = LOC_BLOCK;
2473 if (dip -> dietag == TAG_global_subroutine)
2475 add_symbol_to_list (sym, &global_symbols);
2479 add_symbol_to_list (sym, list_in_scope);
2482 case TAG_global_variable:
2483 if (dip -> at_location != NULL)
2485 SYMBOL_VALUE (sym) = locval (dip -> at_location);
2486 add_symbol_to_list (sym, &global_symbols);
2487 SYMBOL_CLASS (sym) = LOC_STATIC;
2488 SYMBOL_VALUE (sym) += baseaddr;
2491 case TAG_local_variable:
2492 if (dip -> at_location != NULL)
2494 SYMBOL_VALUE (sym) = locval (dip -> at_location);
2495 add_symbol_to_list (sym, list_in_scope);
2498 SYMBOL_CLASS (sym) = LOC_REGISTER;
2502 SYMBOL_CLASS (sym) = LOC_LOCAL;
2506 SYMBOL_CLASS (sym) = LOC_STATIC;
2507 SYMBOL_VALUE (sym) += baseaddr;
2511 case TAG_formal_parameter:
2512 if (dip -> at_location != NULL)
2514 SYMBOL_VALUE (sym) = locval (dip -> at_location);
2516 add_symbol_to_list (sym, list_in_scope);
2519 SYMBOL_CLASS (sym) = LOC_REGPARM;
2523 SYMBOL_CLASS (sym) = LOC_ARG;
2526 case TAG_unspecified_parameters:
2527 /* From varargs functions; gdb doesn't seem to have any interest in
2528 this information, so just ignore it for now. (FIXME?) */
2530 case TAG_structure_type:
2531 case TAG_union_type:
2532 case TAG_enumeration_type:
2533 SYMBOL_CLASS (sym) = LOC_TYPEDEF;
2534 SYMBOL_NAMESPACE (sym) = STRUCT_NAMESPACE;
2535 add_symbol_to_list (sym, list_in_scope);
2538 SYMBOL_CLASS (sym) = LOC_TYPEDEF;
2539 SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE;
2540 add_symbol_to_list (sym, list_in_scope);
2543 /* Not a tag we recognize. Hopefully we aren't processing trash
2544 data, but since we must specifically ignore things we don't
2545 recognize, there is nothing else we should do at this point. */
2556 decode_mod_fund_type -- decode a modified fundamental type
2560 static struct type *decode_mod_fund_type (char *typedata)
2564 Decode a block of data containing a modified fundamental
2565 type specification. TYPEDATA is a pointer to the block,
2566 which consists of a two byte length, containing the size
2567 of the rest of the block. At the end of the block is a
2568 two byte value that gives the fundamental type. Everything
2569 in between are type modifiers.
2571 We simply compute the number of modifiers and call the general
2572 function decode_modified_type to do the actual work.
2575 static struct type *
2576 DEFUN(decode_mod_fund_type, (typedata), char *typedata)
2578 struct type *typep = NULL;
2579 unsigned short modcount;
2580 unsigned char *modifiers;
2582 /* Get the total size of the block, exclusive of the size itself */
2583 (void) memcpy (&modcount, typedata, sizeof (short));
2584 /* Deduct the size of the fundamental type bytes at the end of the block. */
2585 modcount -= sizeof (short);
2586 /* Skip over the two size bytes at the beginning of the block. */
2587 modifiers = (unsigned char *) typedata + sizeof (short);
2588 /* Now do the actual decoding */
2589 typep = decode_modified_type (modifiers, modcount, AT_mod_fund_type);
2597 decode_mod_u_d_type -- decode a modified user defined type
2601 static struct type *decode_mod_u_d_type (char *typedata)
2605 Decode a block of data containing a modified user defined
2606 type specification. TYPEDATA is a pointer to the block,
2607 which consists of a two byte length, containing the size
2608 of the rest of the block. At the end of the block is a
2609 four byte value that gives a reference to a user defined type.
2610 Everything in between are type modifiers.
2612 We simply compute the number of modifiers and call the general
2613 function decode_modified_type to do the actual work.
2616 static struct type *
2617 DEFUN(decode_mod_u_d_type, (typedata), char *typedata)
2619 struct type *typep = NULL;
2620 unsigned short modcount;
2621 unsigned char *modifiers;
2623 /* Get the total size of the block, exclusive of the size itself */
2624 (void) memcpy (&modcount, typedata, sizeof (short));
2625 /* Deduct the size of the reference type bytes at the end of the block. */
2626 modcount -= sizeof (long);
2627 /* Skip over the two size bytes at the beginning of the block. */
2628 modifiers = (unsigned char *) typedata + sizeof (short);
2629 /* Now do the actual decoding */
2630 typep = decode_modified_type (modifiers, modcount, AT_mod_u_d_type);
2638 decode_modified_type -- decode modified user or fundamental type
2642 static struct type *decode_modified_type (unsigned char *modifiers,
2643 unsigned short modcount, int mtype)
2647 Decode a modified type, either a modified fundamental type or
2648 a modified user defined type. MODIFIERS is a pointer to the
2649 block of bytes that define MODCOUNT modifiers. Immediately
2650 following the last modifier is a short containing the fundamental
2651 type or a long containing the reference to the user defined
2652 type. Which one is determined by MTYPE, which is either
2653 AT_mod_fund_type or AT_mod_u_d_type to indicate what modified
2654 type we are generating.
2656 We call ourself recursively to generate each modified type,`
2657 until MODCOUNT reaches zero, at which point we have consumed
2658 all the modifiers and generate either the fundamental type or
2659 user defined type. When the recursion unwinds, each modifier
2660 is applied in turn to generate the full modified type.
2664 If we find a modifier that we don't recognize, and it is not one
2665 of those reserved for application specific use, then we issue a
2666 warning and simply ignore the modifier.
2670 We currently ignore MOD_const and MOD_volatile. (FIXME)
2674 static struct type *
2675 DEFUN(decode_modified_type,
2676 (modifiers, modcount, mtype),
2677 unsigned char *modifiers AND unsigned short modcount AND int mtype)
2679 struct type *typep = NULL;
2680 unsigned short fundtype;
2682 unsigned char modifier;
2688 case AT_mod_fund_type:
2689 (void) memcpy (&fundtype, modifiers, sizeof (short));
2690 typep = decode_fund_type (fundtype);
2692 case AT_mod_u_d_type:
2693 (void) memcpy (&dieref, modifiers, sizeof (DIEREF));
2694 if ((typep = lookup_utype (dieref)) == NULL)
2696 typep = alloc_utype (dieref, NULL);
2700 SQUAWK (("botched modified type decoding (mtype 0x%x)", mtype));
2701 typep = builtin_type_int;
2707 modifier = *modifiers++;
2708 typep = decode_modified_type (modifiers, --modcount, mtype);
2711 case MOD_pointer_to:
2712 typep = lookup_pointer_type (typep);
2714 case MOD_reference_to:
2715 typep = lookup_reference_type (typep);
2718 SQUAWK (("type modifier 'const' ignored")); /* FIXME */
2721 SQUAWK (("type modifier 'volatile' ignored")); /* FIXME */
2724 if (!(MOD_lo_user <= modifier && modifier <= MOD_hi_user))
2726 SQUAWK (("unknown type modifier %u", modifier));
2738 decode_fund_type -- translate basic DWARF type to gdb base type
2742 Given an integer that is one of the fundamental DWARF types,
2743 translate it to one of the basic internal gdb types and return
2744 a pointer to the appropriate gdb type (a "struct type *").
2748 If we encounter a fundamental type that we are unprepared to
2749 deal with, and it is not in the range of those types defined
2750 as application specific types, then we issue a warning and
2751 treat the type as builtin_type_int.
2754 static struct type *
2755 DEFUN(decode_fund_type, (fundtype), unsigned short fundtype)
2757 struct type *typep = NULL;
2763 typep = builtin_type_void;
2766 case FT_pointer: /* (void *) */
2767 typep = lookup_pointer_type (builtin_type_void);
2771 case FT_signed_char:
2772 typep = builtin_type_char;
2776 case FT_signed_short:
2777 typep = builtin_type_short;
2781 case FT_signed_integer:
2782 case FT_boolean: /* Was FT_set in AT&T version */
2783 typep = builtin_type_int;
2787 case FT_signed_long:
2788 typep = builtin_type_long;
2792 typep = builtin_type_float;
2795 case FT_dbl_prec_float:
2796 typep = builtin_type_double;
2799 case FT_unsigned_char:
2800 typep = builtin_type_unsigned_char;
2803 case FT_unsigned_short:
2804 typep = builtin_type_unsigned_short;
2807 case FT_unsigned_integer:
2808 typep = builtin_type_unsigned_int;
2811 case FT_unsigned_long:
2812 typep = builtin_type_unsigned_long;
2815 case FT_ext_prec_float:
2816 typep = builtin_type_long_double;
2820 typep = builtin_type_complex;
2823 case FT_dbl_prec_complex:
2824 typep = builtin_type_double_complex;
2828 case FT_signed_long_long:
2829 typep = builtin_type_long_long;
2832 case FT_unsigned_long_long:
2833 typep = builtin_type_unsigned_long_long;
2838 if ((typep == NULL) && !(FT_lo_user <= fundtype && fundtype <= FT_hi_user))
2840 SQUAWK (("unexpected fundamental type 0x%x", fundtype));
2841 typep = builtin_type_void;
2851 create_name -- allocate a fresh copy of a string on an obstack
2855 Given a pointer to a string and a pointer to an obstack, allocates
2856 a fresh copy of the string on the specified obstack.
2861 DEFUN(create_name, (name, obstackp), char *name AND struct obstack *obstackp)
2866 length = strlen (name) + 1;
2867 newname = (char *) obstack_alloc (obstackp, length);
2868 (void) strcpy (newname, name);
2876 basicdieinfo -- extract the minimal die info from raw die data
2880 void basicdieinfo (char *diep, struct dieinfo *dip)
2884 Given a pointer to raw DIE data, and a pointer to an instance of a
2885 die info structure, this function extracts the basic information
2886 from the DIE data required to continue processing this DIE, along
2887 with some bookkeeping information about the DIE.
2889 The information we absolutely must have includes the DIE tag,
2890 and the DIE length. If we need the sibling reference, then we
2891 will have to call completedieinfo() to process all the remaining
2894 Note that since there is no guarantee that the data is properly
2895 aligned in memory for the type of access required (indirection
2896 through anything other than a char pointer), we use memcpy to
2897 shuffle data items larger than a char. Possibly inefficient, but
2900 We also take care of some other basic things at this point, such
2901 as ensuring that the instance of the die info structure starts
2902 out completely zero'd and that curdie is initialized for use
2903 in error reporting if we have a problem with the current die.
2907 All DIE's must have at least a valid length, thus the minimum
2908 DIE size is sizeof (long). In order to have a valid tag, the
2909 DIE size must be at least sizeof (short) larger, otherwise they
2910 are forced to be TAG_padding DIES.
2912 Padding DIES must be at least sizeof(long) in length, implying that
2913 if a padding DIE is used for alignment and the amount needed is less
2914 than sizeof(long) then the padding DIE has to be big enough to align
2915 to the next alignment boundry.
2919 DEFUN(basicdieinfo, (dip, diep), struct dieinfo *dip AND char *diep)
2922 (void) memset (dip, 0, sizeof (struct dieinfo));
2924 dip -> dieref = dbroff + (diep - dbbase);
2925 (void) memcpy (&dip -> dielength, diep, sizeof (long));
2926 if (dip -> dielength < sizeof (long))
2928 dwarfwarn ("malformed DIE, bad length (%d bytes)", dip -> dielength);
2930 else if (dip -> dielength < (sizeof (long) + sizeof (short)))
2932 dip -> dietag = TAG_padding;
2936 (void) memcpy (&dip -> dietag, diep + sizeof (long), sizeof (short));
2944 completedieinfo -- finish reading the information for a given DIE
2948 void completedieinfo (struct dieinfo *dip)
2952 Given a pointer to an already partially initialized die info structure,
2953 scan the raw DIE data and finish filling in the die info structure
2954 from the various attributes found.
2956 Note that since there is no guarantee that the data is properly
2957 aligned in memory for the type of access required (indirection
2958 through anything other than a char pointer), we use memcpy to
2959 shuffle data items larger than a char. Possibly inefficient, but
2964 Each time we are called, we increment the diecount variable, which
2965 keeps an approximate count of the number of dies processed for
2966 each compilation unit. This information is presented to the user
2967 if the info_verbose flag is set.
2972 DEFUN(completedieinfo, (dip), struct dieinfo *dip)
2974 char *diep; /* Current pointer into raw DIE data */
2975 char *end; /* Terminate DIE scan here */
2976 unsigned short attr; /* Current attribute being scanned */
2977 unsigned short form; /* Form of the attribute */
2978 short block2sz; /* Size of a block2 attribute field */
2979 long block4sz; /* Size of a block4 attribute field */
2983 end = diep + dip -> dielength;
2984 diep += sizeof (long) + sizeof (short);
2987 (void) memcpy (&attr, diep, sizeof (short));
2988 diep += sizeof (short);
2992 (void) memcpy (&dip -> at_fund_type, diep, sizeof (short));
2995 (void) memcpy (&dip -> at_ordering, diep, sizeof (short));
2998 (void) memcpy (&dip -> at_bit_offset, diep, sizeof (short));
3001 (void) memcpy (&dip -> at_visibility, diep, sizeof (short));
3004 (void) memcpy (&dip -> at_sibling, diep, sizeof (long));
3007 (void) memcpy (&dip -> at_stmt_list, diep, sizeof (long));
3008 dip -> has_at_stmt_list = 1;
3011 (void) memcpy (&dip -> at_low_pc, diep, sizeof (long));
3012 dip -> at_low_pc += baseaddr;
3013 dip -> has_at_low_pc = 1;
3016 (void) memcpy (&dip -> at_high_pc, diep, sizeof (long));
3017 dip -> at_high_pc += baseaddr;
3020 (void) memcpy (&dip -> at_language, diep, sizeof (long));
3022 case AT_user_def_type:
3023 (void) memcpy (&dip -> at_user_def_type, diep, sizeof (long));
3026 (void) memcpy (&dip -> at_byte_size, diep, sizeof (long));
3029 (void) memcpy (&dip -> at_bit_size, diep, sizeof (long));
3032 (void) memcpy (&dip -> at_member, diep, sizeof (long));
3035 (void) memcpy (&dip -> at_discr, diep, sizeof (long));
3038 (void) memcpy (&dip -> at_import, diep, sizeof (long));
3041 dip -> at_location = diep;
3043 case AT_mod_fund_type:
3044 dip -> at_mod_fund_type = diep;
3046 case AT_subscr_data:
3047 dip -> at_subscr_data = diep;
3049 case AT_mod_u_d_type:
3050 dip -> at_mod_u_d_type = diep;
3052 case AT_element_list:
3053 dip -> at_element_list = diep;
3054 dip -> short_element_list = 0;
3056 case AT_short_element_list:
3057 dip -> at_element_list = diep;
3058 dip -> short_element_list = 1;
3060 case AT_discr_value:
3061 dip -> at_discr_value = diep;
3063 case AT_string_length:
3064 dip -> at_string_length = diep;
3067 dip -> at_name = diep;
3070 dip -> at_comp_dir = diep;
3073 dip -> at_producer = diep;
3076 (void) memcpy (&dip -> at_frame_base, diep, sizeof (long));
3078 case AT_start_scope:
3079 (void) memcpy (&dip -> at_start_scope, diep, sizeof (long));
3081 case AT_stride_size:
3082 (void) memcpy (&dip -> at_stride_size, diep, sizeof (long));
3085 (void) memcpy (&dip -> at_src_info, diep, sizeof (long));
3088 (void) memcpy (&dip -> at_prototyped, diep, sizeof (short));
3091 /* Found an attribute that we are unprepared to handle. However
3092 it is specifically one of the design goals of DWARF that
3093 consumers should ignore unknown attributes. As long as the
3094 form is one that we recognize (so we know how to skip it),
3095 we can just ignore the unknown attribute. */
3102 diep += sizeof (short);
3105 diep += sizeof (long);
3108 diep += 8 * sizeof (char); /* sizeof (long long) ? */
3112 diep += sizeof (long);
3115 (void) memcpy (&block2sz, diep, sizeof (short));
3116 block2sz += sizeof (short);
3120 (void) memcpy (&block4sz, diep, sizeof (long));
3121 block4sz += sizeof (long);
3125 diep += strlen (diep) + 1;
3128 SQUAWK (("unknown attribute form (0x%x), skipped rest", form));