* stabsread.c (get_substring): Declare second arg as int.
[deliverable/binutils-gdb.git] / gdb / dwarfread.c
1 /* DWARF debugging format support for GDB.
2 Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996
3 Free Software Foundation, Inc.
4 Written by Fred Fish at Cygnus Support. Portions based on dbxread.c,
5 mipsread.c, coffread.c, and dwarfread.c from a Data General SVR4 gdb port.
6
7 This file is part of GDB.
8
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
13
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
22
23 /*
24
25 FIXME: Do we need to generate dependencies in partial symtabs?
26 (Perhaps we don't need to).
27
28 FIXME: Resolve minor differences between what information we put in the
29 partial symbol table and what dbxread puts in. For example, we don't yet
30 put enum constants there. And dbxread seems to invent a lot of typedefs
31 we never see. Use the new printpsym command to see the partial symbol table
32 contents.
33
34 FIXME: Figure out a better way to tell gdb about the name of the function
35 contain the user's entry point (I.E. main())
36
37 FIXME: See other FIXME's and "ifdef 0" scattered throughout the code for
38 other things to work on, if you get bored. :-)
39
40 */
41
42 #include "defs.h"
43 #include "symtab.h"
44 #include "gdbtypes.h"
45 #include "symfile.h"
46 #include "objfiles.h"
47 #include "elf/dwarf.h"
48 #include "buildsym.h"
49 #include "demangle.h"
50 #include "expression.h" /* Needed for enum exp_opcode in language.h, sigh... */
51 #include "language.h"
52 #include "complaints.h"
53
54 #include <fcntl.h>
55 #include "gdb_string.h"
56
57 #ifndef NO_SYS_FILE
58 #include <sys/file.h>
59 #endif
60
61 /* Some macros to provide DIE info for complaints. */
62
63 #define DIE_ID (curdie!=NULL ? curdie->die_ref : 0)
64 #define DIE_NAME (curdie!=NULL && curdie->at_name!=NULL) ? curdie->at_name : ""
65
66 /* Complaints that can be issued during DWARF debug info reading. */
67
68 struct complaint no_bfd_get_N =
69 {
70 "DIE @ 0x%x \"%s\", no bfd support for %d byte data object", 0, 0
71 };
72
73 struct complaint malformed_die =
74 {
75 "DIE @ 0x%x \"%s\", malformed DIE, bad length (%d bytes)", 0, 0
76 };
77
78 struct complaint bad_die_ref =
79 {
80 "DIE @ 0x%x \"%s\", reference to DIE (0x%x) outside compilation unit", 0, 0
81 };
82
83 struct complaint unknown_attribute_form =
84 {
85 "DIE @ 0x%x \"%s\", unknown attribute form (0x%x)", 0, 0
86 };
87
88 struct complaint unknown_attribute_length =
89 {
90 "DIE @ 0x%x \"%s\", unknown attribute length, skipped remaining attributes", 0, 0
91 };
92
93 struct complaint unexpected_fund_type =
94 {
95 "DIE @ 0x%x \"%s\", unexpected fundamental type 0x%x", 0, 0
96 };
97
98 struct complaint unknown_type_modifier =
99 {
100 "DIE @ 0x%x \"%s\", unknown type modifier %u", 0, 0
101 };
102
103 struct complaint volatile_ignored =
104 {
105 "DIE @ 0x%x \"%s\", type modifier 'volatile' ignored", 0, 0
106 };
107
108 struct complaint const_ignored =
109 {
110 "DIE @ 0x%x \"%s\", type modifier 'const' ignored", 0, 0
111 };
112
113 struct complaint botched_modified_type =
114 {
115 "DIE @ 0x%x \"%s\", botched modified type decoding (mtype 0x%x)", 0, 0
116 };
117
118 struct complaint op_deref2 =
119 {
120 "DIE @ 0x%x \"%s\", OP_DEREF2 address 0x%x not handled", 0, 0
121 };
122
123 struct complaint op_deref4 =
124 {
125 "DIE @ 0x%x \"%s\", OP_DEREF4 address 0x%x not handled", 0, 0
126 };
127
128 struct complaint basereg_not_handled =
129 {
130 "DIE @ 0x%x \"%s\", BASEREG %d not handled", 0, 0
131 };
132
133 struct complaint dup_user_type_allocation =
134 {
135 "DIE @ 0x%x \"%s\", internal error: duplicate user type allocation", 0, 0
136 };
137
138 struct complaint dup_user_type_definition =
139 {
140 "DIE @ 0x%x \"%s\", internal error: duplicate user type definition", 0, 0
141 };
142
143 struct complaint missing_tag =
144 {
145 "DIE @ 0x%x \"%s\", missing class, structure, or union tag", 0, 0
146 };
147
148 struct complaint bad_array_element_type =
149 {
150 "DIE @ 0x%x \"%s\", bad array element type attribute 0x%x", 0, 0
151 };
152
153 struct complaint subscript_data_items =
154 {
155 "DIE @ 0x%x \"%s\", can't decode subscript data items", 0, 0
156 };
157
158 struct complaint unhandled_array_subscript_format =
159 {
160 "DIE @ 0x%x \"%s\", array subscript format 0x%x not handled yet", 0, 0
161 };
162
163 struct complaint unknown_array_subscript_format =
164 {
165 "DIE @ 0x%x \"%s\", unknown array subscript format %x", 0, 0
166 };
167
168 struct complaint not_row_major =
169 {
170 "DIE @ 0x%x \"%s\", array not row major; not handled correctly", 0, 0
171 };
172
173 struct complaint missing_at_name =
174 {
175 "DIE @ 0x%x, AT_name tag missing", 0, 0
176 };
177
178 typedef unsigned int DIE_REF; /* Reference to a DIE */
179
180 #ifndef GCC_PRODUCER
181 #define GCC_PRODUCER "GNU C "
182 #endif
183
184 #ifndef GPLUS_PRODUCER
185 #define GPLUS_PRODUCER "GNU C++ "
186 #endif
187
188 #ifndef LCC_PRODUCER
189 #define LCC_PRODUCER "NCR C/C++"
190 #endif
191
192 #ifndef CHILL_PRODUCER
193 #define CHILL_PRODUCER "GNU Chill "
194 #endif
195
196 /* Provide a default mapping from a DWARF register number to a gdb REGNUM. */
197 #ifndef DWARF_REG_TO_REGNUM
198 #define DWARF_REG_TO_REGNUM(num) (num)
199 #endif
200
201 /* Flags to target_to_host() that tell whether or not the data object is
202 expected to be signed. Used, for example, when fetching a signed
203 integer in the target environment which is used as a signed integer
204 in the host environment, and the two environments have different sized
205 ints. In this case, *somebody* has to sign extend the smaller sized
206 int. */
207
208 #define GET_UNSIGNED 0 /* No sign extension required */
209 #define GET_SIGNED 1 /* Sign extension required */
210
211 /* Defines for things which are specified in the document "DWARF Debugging
212 Information Format" published by UNIX International, Programming Languages
213 SIG. These defines are based on revision 1.0.0, Jan 20, 1992. */
214
215 #define SIZEOF_DIE_LENGTH 4
216 #define SIZEOF_DIE_TAG 2
217 #define SIZEOF_ATTRIBUTE 2
218 #define SIZEOF_FORMAT_SPECIFIER 1
219 #define SIZEOF_FMT_FT 2
220 #define SIZEOF_LINETBL_LENGTH 4
221 #define SIZEOF_LINETBL_LINENO 4
222 #define SIZEOF_LINETBL_STMT 2
223 #define SIZEOF_LINETBL_DELTA 4
224 #define SIZEOF_LOC_ATOM_CODE 1
225
226 #define FORM_FROM_ATTR(attr) ((attr) & 0xF) /* Implicitly specified */
227
228 /* Macros that return the sizes of various types of data in the target
229 environment.
230
231 FIXME: Currently these are just compile time constants (as they are in
232 other parts of gdb as well). They need to be able to get the right size
233 either from the bfd or possibly from the DWARF info. It would be nice if
234 the DWARF producer inserted DIES that describe the fundamental types in
235 the target environment into the DWARF info, similar to the way dbx stabs
236 producers produce information about their fundamental types. */
237
238 #define TARGET_FT_POINTER_SIZE(objfile) (TARGET_PTR_BIT / TARGET_CHAR_BIT)
239 #define TARGET_FT_LONG_SIZE(objfile) (TARGET_LONG_BIT / TARGET_CHAR_BIT)
240
241 /* The Amiga SVR4 header file <dwarf.h> defines AT_element_list as a
242 FORM_BLOCK2, and this is the value emitted by the AT&T compiler.
243 However, the Issue 2 DWARF specification from AT&T defines it as
244 a FORM_BLOCK4, as does the latest specification from UI/PLSIG.
245 For backwards compatibility with the AT&T compiler produced executables
246 we define AT_short_element_list for this variant. */
247
248 #define AT_short_element_list (0x00f0|FORM_BLOCK2)
249
250 /* External variables referenced. */
251
252 extern int info_verbose; /* From main.c; nonzero => verbose */
253 extern char *warning_pre_print; /* From utils.c */
254
255 /* The DWARF debugging information consists of two major pieces,
256 one is a block of DWARF Information Entries (DIE's) and the other
257 is a line number table. The "struct dieinfo" structure contains
258 the information for a single DIE, the one currently being processed.
259
260 In order to make it easier to randomly access the attribute fields
261 of the current DIE, which are specifically unordered within the DIE,
262 each DIE is scanned and an instance of the "struct dieinfo"
263 structure is initialized.
264
265 Initialization is done in two levels. The first, done by basicdieinfo(),
266 just initializes those fields that are vital to deciding whether or not
267 to use this DIE, how to skip past it, etc. The second, done by the
268 function completedieinfo(), fills in the rest of the information.
269
270 Attributes which have block forms are not interpreted at the time
271 the DIE is scanned, instead we just save pointers to the start
272 of their value fields.
273
274 Some fields have a flag <name>_p that is set when the value of the
275 field is valid (I.E. we found a matching attribute in the DIE). Since
276 we may want to test for the presence of some attributes in the DIE,
277 such as AT_low_pc, without restricting the values of the field,
278 we need someway to note that we found such an attribute.
279
280 */
281
282 typedef char BLOCK;
283
284 struct dieinfo {
285 char * die; /* Pointer to the raw DIE data */
286 unsigned long die_length; /* Length of the raw DIE data */
287 DIE_REF die_ref; /* Offset of this DIE */
288 unsigned short die_tag; /* Tag for this DIE */
289 unsigned long at_padding;
290 unsigned long at_sibling;
291 BLOCK * at_location;
292 char * at_name;
293 unsigned short at_fund_type;
294 BLOCK * at_mod_fund_type;
295 unsigned long at_user_def_type;
296 BLOCK * at_mod_u_d_type;
297 unsigned short at_ordering;
298 BLOCK * at_subscr_data;
299 unsigned long at_byte_size;
300 unsigned short at_bit_offset;
301 unsigned long at_bit_size;
302 BLOCK * at_element_list;
303 unsigned long at_stmt_list;
304 CORE_ADDR at_low_pc;
305 CORE_ADDR at_high_pc;
306 unsigned long at_language;
307 unsigned long at_member;
308 unsigned long at_discr;
309 BLOCK * at_discr_value;
310 BLOCK * at_string_length;
311 char * at_comp_dir;
312 char * at_producer;
313 unsigned long at_start_scope;
314 unsigned long at_stride_size;
315 unsigned long at_src_info;
316 char * at_prototyped;
317 unsigned int has_at_low_pc:1;
318 unsigned int has_at_stmt_list:1;
319 unsigned int has_at_byte_size:1;
320 unsigned int short_element_list:1;
321 };
322
323 static int diecount; /* Approximate count of dies for compilation unit */
324 static struct dieinfo *curdie; /* For warnings and such */
325
326 static char *dbbase; /* Base pointer to dwarf info */
327 static int dbsize; /* Size of dwarf info in bytes */
328 static int dbroff; /* Relative offset from start of .debug section */
329 static char *lnbase; /* Base pointer to line section */
330 static int isreg; /* Kludge to identify register variables */
331 static int optimized_out; /* Kludge to identify optimized out variables */
332 /* Kludge to identify basereg references. Nonzero if we have an offset
333 relative to a basereg. */
334 static int offreg;
335 /* Which base register is it relative to? */
336 static int basereg;
337
338 /* This value is added to each symbol value. FIXME: Generalize to
339 the section_offsets structure used by dbxread (once this is done,
340 pass the appropriate section number to end_symtab). */
341 static CORE_ADDR baseaddr; /* Add to each symbol value */
342
343 /* The section offsets used in the current psymtab or symtab. FIXME,
344 only used to pass one value (baseaddr) at the moment. */
345 static struct section_offsets *base_section_offsets;
346
347 /* We put a pointer to this structure in the read_symtab_private field
348 of the psymtab. */
349
350 struct dwfinfo {
351 /* Always the absolute file offset to the start of the ".debug"
352 section for the file containing the DIE's being accessed. */
353 file_ptr dbfoff;
354 /* Relative offset from the start of the ".debug" section to the
355 first DIE to be accessed. When building the partial symbol
356 table, this value will be zero since we are accessing the
357 entire ".debug" section. When expanding a partial symbol
358 table entry, this value will be the offset to the first
359 DIE for the compilation unit containing the symbol that
360 triggers the expansion. */
361 int dbroff;
362 /* The size of the chunk of DIE's being examined, in bytes. */
363 int dblength;
364 /* The absolute file offset to the line table fragment. Ignored
365 when building partial symbol tables, but used when expanding
366 them, and contains the absolute file offset to the fragment
367 of the ".line" section containing the line numbers for the
368 current compilation unit. */
369 file_ptr lnfoff;
370 };
371
372 #define DBFOFF(p) (((struct dwfinfo *)((p)->read_symtab_private))->dbfoff)
373 #define DBROFF(p) (((struct dwfinfo *)((p)->read_symtab_private))->dbroff)
374 #define DBLENGTH(p) (((struct dwfinfo *)((p)->read_symtab_private))->dblength)
375 #define LNFOFF(p) (((struct dwfinfo *)((p)->read_symtab_private))->lnfoff)
376
377 /* The generic symbol table building routines have separate lists for
378 file scope symbols and all all other scopes (local scopes). So
379 we need to select the right one to pass to add_symbol_to_list().
380 We do it by keeping a pointer to the correct list in list_in_scope.
381
382 FIXME: The original dwarf code just treated the file scope as the first
383 local scope, and all other local scopes as nested local scopes, and worked
384 fine. Check to see if we really need to distinguish these in buildsym.c */
385
386 struct pending **list_in_scope = &file_symbols;
387
388 /* DIES which have user defined types or modified user defined types refer to
389 other DIES for the type information. Thus we need to associate the offset
390 of a DIE for a user defined type with a pointer to the type information.
391
392 Originally this was done using a simple but expensive algorithm, with an
393 array of unsorted structures, each containing an offset/type-pointer pair.
394 This array was scanned linearly each time a lookup was done. The result
395 was that gdb was spending over half it's startup time munging through this
396 array of pointers looking for a structure that had the right offset member.
397
398 The second attempt used the same array of structures, but the array was
399 sorted using qsort each time a new offset/type was recorded, and a binary
400 search was used to find the type pointer for a given DIE offset. This was
401 even slower, due to the overhead of sorting the array each time a new
402 offset/type pair was entered.
403
404 The third attempt uses a fixed size array of type pointers, indexed by a
405 value derived from the DIE offset. Since the minimum DIE size is 4 bytes,
406 we can divide any DIE offset by 4 to obtain a unique index into this fixed
407 size array. Since each element is a 4 byte pointer, it takes exactly as
408 much memory to hold this array as to hold the DWARF info for a given
409 compilation unit. But it gets freed as soon as we are done with it.
410 This has worked well in practice, as a reasonable tradeoff between memory
411 consumption and speed, without having to resort to much more complicated
412 algorithms. */
413
414 static struct type **utypes; /* Pointer to array of user type pointers */
415 static int numutypes; /* Max number of user type pointers */
416
417 /* Maintain an array of referenced fundamental types for the current
418 compilation unit being read. For DWARF version 1, we have to construct
419 the fundamental types on the fly, since no information about the
420 fundamental types is supplied. Each such fundamental type is created by
421 calling a language dependent routine to create the type, and then a
422 pointer to that type is then placed in the array at the index specified
423 by it's FT_<TYPENAME> value. The array has a fixed size set by the
424 FT_NUM_MEMBERS compile time constant, which is the number of predefined
425 fundamental types gdb knows how to construct. */
426
427 static struct type *ftypes[FT_NUM_MEMBERS]; /* Fundamental types */
428
429 /* Record the language for the compilation unit which is currently being
430 processed. We know it once we have seen the TAG_compile_unit DIE,
431 and we need it while processing the DIE's for that compilation unit.
432 It is eventually saved in the symtab structure, but we don't finalize
433 the symtab struct until we have processed all the DIE's for the
434 compilation unit. We also need to get and save a pointer to the
435 language struct for this language, so we can call the language
436 dependent routines for doing things such as creating fundamental
437 types. */
438
439 static enum language cu_language;
440 static const struct language_defn *cu_language_defn;
441
442 /* Forward declarations of static functions so we don't have to worry
443 about ordering within this file. */
444
445 static void
446 free_utypes PARAMS ((PTR));
447
448 static int
449 attribute_size PARAMS ((unsigned int));
450
451 static CORE_ADDR
452 target_to_host PARAMS ((char *, int, int, struct objfile *));
453
454 static void
455 add_enum_psymbol PARAMS ((struct dieinfo *, struct objfile *));
456
457 static void
458 handle_producer PARAMS ((char *));
459
460 static void
461 read_file_scope PARAMS ((struct dieinfo *, char *, char *, struct objfile *));
462
463 static void
464 read_func_scope PARAMS ((struct dieinfo *, char *, char *, struct objfile *));
465
466 static void
467 read_lexical_block_scope PARAMS ((struct dieinfo *, char *, char *,
468 struct objfile *));
469
470 static void
471 scan_partial_symbols PARAMS ((char *, char *, struct objfile *));
472
473 static void
474 scan_compilation_units PARAMS ((char *, char *, file_ptr,
475 file_ptr, struct objfile *));
476
477 static void
478 add_partial_symbol PARAMS ((struct dieinfo *, struct objfile *));
479
480 static void
481 basicdieinfo PARAMS ((struct dieinfo *, char *, struct objfile *));
482
483 static void
484 completedieinfo PARAMS ((struct dieinfo *, struct objfile *));
485
486 static void
487 dwarf_psymtab_to_symtab PARAMS ((struct partial_symtab *));
488
489 static void
490 psymtab_to_symtab_1 PARAMS ((struct partial_symtab *));
491
492 static void
493 read_ofile_symtab PARAMS ((struct partial_symtab *));
494
495 static void
496 process_dies PARAMS ((char *, char *, struct objfile *));
497
498 static void
499 read_structure_scope PARAMS ((struct dieinfo *, char *, char *,
500 struct objfile *));
501
502 static struct type *
503 decode_array_element_type PARAMS ((char *));
504
505 static struct type *
506 decode_subscript_data_item PARAMS ((char *, char *));
507
508 static void
509 dwarf_read_array_type PARAMS ((struct dieinfo *));
510
511 static void
512 read_tag_pointer_type PARAMS ((struct dieinfo *dip));
513
514 static void
515 read_tag_string_type PARAMS ((struct dieinfo *dip));
516
517 static void
518 read_subroutine_type PARAMS ((struct dieinfo *, char *, char *));
519
520 static void
521 read_enumeration PARAMS ((struct dieinfo *, char *, char *, struct objfile *));
522
523 static struct type *
524 struct_type PARAMS ((struct dieinfo *, char *, char *, struct objfile *));
525
526 static struct type *
527 enum_type PARAMS ((struct dieinfo *, struct objfile *));
528
529 static void
530 decode_line_numbers PARAMS ((char *));
531
532 static struct type *
533 decode_die_type PARAMS ((struct dieinfo *));
534
535 static struct type *
536 decode_mod_fund_type PARAMS ((char *));
537
538 static struct type *
539 decode_mod_u_d_type PARAMS ((char *));
540
541 static struct type *
542 decode_modified_type PARAMS ((char *, unsigned int, int));
543
544 static struct type *
545 decode_fund_type PARAMS ((unsigned int));
546
547 static char *
548 create_name PARAMS ((char *, struct obstack *));
549
550 static struct type *
551 lookup_utype PARAMS ((DIE_REF));
552
553 static struct type *
554 alloc_utype PARAMS ((DIE_REF, struct type *));
555
556 static struct symbol *
557 new_symbol PARAMS ((struct dieinfo *, struct objfile *));
558
559 static void
560 synthesize_typedef PARAMS ((struct dieinfo *, struct objfile *,
561 struct type *));
562
563 static int
564 locval PARAMS ((char *));
565
566 static void
567 set_cu_language PARAMS ((struct dieinfo *));
568
569 static struct type *
570 dwarf_fundamental_type PARAMS ((struct objfile *, int));
571
572
573 /*
574
575 LOCAL FUNCTION
576
577 dwarf_fundamental_type -- lookup or create a fundamental type
578
579 SYNOPSIS
580
581 struct type *
582 dwarf_fundamental_type (struct objfile *objfile, int typeid)
583
584 DESCRIPTION
585
586 DWARF version 1 doesn't supply any fundamental type information,
587 so gdb has to construct such types. It has a fixed number of
588 fundamental types that it knows how to construct, which is the
589 union of all types that it knows how to construct for all languages
590 that it knows about. These are enumerated in gdbtypes.h.
591
592 As an example, assume we find a DIE that references a DWARF
593 fundamental type of FT_integer. We first look in the ftypes
594 array to see if we already have such a type, indexed by the
595 gdb internal value of FT_INTEGER. If so, we simply return a
596 pointer to that type. If not, then we ask an appropriate
597 language dependent routine to create a type FT_INTEGER, using
598 defaults reasonable for the current target machine, and install
599 that type in ftypes for future reference.
600
601 RETURNS
602
603 Pointer to a fundamental type.
604
605 */
606
607 static struct type *
608 dwarf_fundamental_type (objfile, typeid)
609 struct objfile *objfile;
610 int typeid;
611 {
612 if (typeid < 0 || typeid >= FT_NUM_MEMBERS)
613 {
614 error ("internal error - invalid fundamental type id %d", typeid);
615 }
616
617 /* Look for this particular type in the fundamental type vector. If one is
618 not found, create and install one appropriate for the current language
619 and the current target machine. */
620
621 if (ftypes[typeid] == NULL)
622 {
623 ftypes[typeid] = cu_language_defn -> la_fund_type(objfile, typeid);
624 }
625
626 return (ftypes[typeid]);
627 }
628
629 /*
630
631 LOCAL FUNCTION
632
633 set_cu_language -- set local copy of language for compilation unit
634
635 SYNOPSIS
636
637 void
638 set_cu_language (struct dieinfo *dip)
639
640 DESCRIPTION
641
642 Decode the language attribute for a compilation unit DIE and
643 remember what the language was. We use this at various times
644 when processing DIE's for a given compilation unit.
645
646 RETURNS
647
648 No return value.
649
650 */
651
652 static void
653 set_cu_language (dip)
654 struct dieinfo *dip;
655 {
656 switch (dip -> at_language)
657 {
658 case LANG_C89:
659 case LANG_C:
660 cu_language = language_c;
661 break;
662 case LANG_C_PLUS_PLUS:
663 cu_language = language_cplus;
664 break;
665 case LANG_CHILL:
666 cu_language = language_chill;
667 break;
668 case LANG_MODULA2:
669 cu_language = language_m2;
670 break;
671 case LANG_ADA83:
672 case LANG_COBOL74:
673 case LANG_COBOL85:
674 case LANG_FORTRAN77:
675 case LANG_FORTRAN90:
676 case LANG_PASCAL83:
677 /* We don't know anything special about these yet. */
678 cu_language = language_unknown;
679 break;
680 default:
681 /* If no at_language, try to deduce one from the filename */
682 cu_language = deduce_language_from_filename (dip -> at_name);
683 break;
684 }
685 cu_language_defn = language_def (cu_language);
686 }
687
688 /*
689
690 GLOBAL FUNCTION
691
692 dwarf_build_psymtabs -- build partial symtabs from DWARF debug info
693
694 SYNOPSIS
695
696 void dwarf_build_psymtabs (struct objfile *objfile,
697 struct section_offsets *section_offsets,
698 int mainline, file_ptr dbfoff, unsigned int dbfsize,
699 file_ptr lnoffset, unsigned int lnsize)
700
701 DESCRIPTION
702
703 This function is called upon to build partial symtabs from files
704 containing DIE's (Dwarf Information Entries) and DWARF line numbers.
705
706 It is passed a bfd* containing the DIES
707 and line number information, the corresponding filename for that
708 file, a base address for relocating the symbols, a flag indicating
709 whether or not this debugging information is from a "main symbol
710 table" rather than a shared library or dynamically linked file,
711 and file offset/size pairs for the DIE information and line number
712 information.
713
714 RETURNS
715
716 No return value.
717
718 */
719
720 void
721 dwarf_build_psymtabs (objfile, section_offsets, mainline, dbfoff, dbfsize,
722 lnoffset, lnsize)
723 struct objfile *objfile;
724 struct section_offsets *section_offsets;
725 int mainline;
726 file_ptr dbfoff;
727 unsigned int dbfsize;
728 file_ptr lnoffset;
729 unsigned int lnsize;
730 {
731 bfd *abfd = objfile->obfd;
732 struct cleanup *back_to;
733
734 current_objfile = objfile;
735 dbsize = dbfsize;
736 dbbase = xmalloc (dbsize);
737 dbroff = 0;
738 if ((bfd_seek (abfd, dbfoff, SEEK_SET) != 0) ||
739 (bfd_read (dbbase, dbsize, 1, abfd) != dbsize))
740 {
741 free (dbbase);
742 error ("can't read DWARF data from '%s'", bfd_get_filename (abfd));
743 }
744 back_to = make_cleanup (free, dbbase);
745
746 /* If we are reinitializing, or if we have never loaded syms yet, init.
747 Since we have no idea how many DIES we are looking at, we just guess
748 some arbitrary value. */
749
750 if (mainline || objfile -> global_psymbols.size == 0 ||
751 objfile -> static_psymbols.size == 0)
752 {
753 init_psymbol_list (objfile, 1024);
754 }
755
756 /* Save the relocation factor where everybody can see it. */
757
758 base_section_offsets = section_offsets;
759 baseaddr = ANOFFSET (section_offsets, 0);
760
761 /* Follow the compilation unit sibling chain, building a partial symbol
762 table entry for each one. Save enough information about each compilation
763 unit to locate the full DWARF information later. */
764
765 scan_compilation_units (dbbase, dbbase + dbsize, dbfoff, lnoffset, objfile);
766
767 do_cleanups (back_to);
768 current_objfile = NULL;
769 }
770
771 /*
772
773 LOCAL FUNCTION
774
775 read_lexical_block_scope -- process all dies in a lexical block
776
777 SYNOPSIS
778
779 static void read_lexical_block_scope (struct dieinfo *dip,
780 char *thisdie, char *enddie)
781
782 DESCRIPTION
783
784 Process all the DIES contained within a lexical block scope.
785 Start a new scope, process the dies, and then close the scope.
786
787 */
788
789 static void
790 read_lexical_block_scope (dip, thisdie, enddie, objfile)
791 struct dieinfo *dip;
792 char *thisdie;
793 char *enddie;
794 struct objfile *objfile;
795 {
796 register struct context_stack *new;
797
798 push_context (0, dip -> at_low_pc);
799 process_dies (thisdie + dip -> die_length, enddie, objfile);
800 new = pop_context ();
801 if (local_symbols != NULL)
802 {
803 finish_block (0, &local_symbols, new -> old_blocks, new -> start_addr,
804 dip -> at_high_pc, objfile);
805 }
806 local_symbols = new -> locals;
807 }
808
809 /*
810
811 LOCAL FUNCTION
812
813 lookup_utype -- look up a user defined type from die reference
814
815 SYNOPSIS
816
817 static type *lookup_utype (DIE_REF die_ref)
818
819 DESCRIPTION
820
821 Given a DIE reference, lookup the user defined type associated with
822 that DIE, if it has been registered already. If not registered, then
823 return NULL. Alloc_utype() can be called to register an empty
824 type for this reference, which will be filled in later when the
825 actual referenced DIE is processed.
826 */
827
828 static struct type *
829 lookup_utype (die_ref)
830 DIE_REF die_ref;
831 {
832 struct type *type = NULL;
833 int utypeidx;
834
835 utypeidx = (die_ref - dbroff) / 4;
836 if ((utypeidx < 0) || (utypeidx >= numutypes))
837 {
838 complain (&bad_die_ref, DIE_ID, DIE_NAME);
839 }
840 else
841 {
842 type = *(utypes + utypeidx);
843 }
844 return (type);
845 }
846
847
848 /*
849
850 LOCAL FUNCTION
851
852 alloc_utype -- add a user defined type for die reference
853
854 SYNOPSIS
855
856 static type *alloc_utype (DIE_REF die_ref, struct type *utypep)
857
858 DESCRIPTION
859
860 Given a die reference DIE_REF, and a possible pointer to a user
861 defined type UTYPEP, register that this reference has a user
862 defined type and either use the specified type in UTYPEP or
863 make a new empty type that will be filled in later.
864
865 We should only be called after calling lookup_utype() to verify that
866 there is not currently a type registered for DIE_REF.
867 */
868
869 static struct type *
870 alloc_utype (die_ref, utypep)
871 DIE_REF die_ref;
872 struct type *utypep;
873 {
874 struct type **typep;
875 int utypeidx;
876
877 utypeidx = (die_ref - dbroff) / 4;
878 typep = utypes + utypeidx;
879 if ((utypeidx < 0) || (utypeidx >= numutypes))
880 {
881 utypep = dwarf_fundamental_type (current_objfile, FT_INTEGER);
882 complain (&bad_die_ref, DIE_ID, DIE_NAME);
883 }
884 else if (*typep != NULL)
885 {
886 utypep = *typep;
887 complain (&dup_user_type_allocation, DIE_ID, DIE_NAME);
888 }
889 else
890 {
891 if (utypep == NULL)
892 {
893 utypep = alloc_type (current_objfile);
894 }
895 *typep = utypep;
896 }
897 return (utypep);
898 }
899
900 /*
901
902 LOCAL FUNCTION
903
904 free_utypes -- free the utypes array and reset pointer & count
905
906 SYNOPSIS
907
908 static void free_utypes (PTR dummy)
909
910 DESCRIPTION
911
912 Called via do_cleanups to free the utypes array, reset the pointer to NULL,
913 and set numutypes back to zero. This ensures that the utypes does not get
914 referenced after being freed.
915 */
916
917 static void
918 free_utypes (dummy)
919 PTR dummy;
920 {
921 free (utypes);
922 utypes = NULL;
923 numutypes = 0;
924 }
925
926
927 /*
928
929 LOCAL FUNCTION
930
931 decode_die_type -- return a type for a specified die
932
933 SYNOPSIS
934
935 static struct type *decode_die_type (struct dieinfo *dip)
936
937 DESCRIPTION
938
939 Given a pointer to a die information structure DIP, decode the
940 type of the die and return a pointer to the decoded type. All
941 dies without specific types default to type int.
942 */
943
944 static struct type *
945 decode_die_type (dip)
946 struct dieinfo *dip;
947 {
948 struct type *type = NULL;
949
950 if (dip -> at_fund_type != 0)
951 {
952 type = decode_fund_type (dip -> at_fund_type);
953 }
954 else if (dip -> at_mod_fund_type != NULL)
955 {
956 type = decode_mod_fund_type (dip -> at_mod_fund_type);
957 }
958 else if (dip -> at_user_def_type)
959 {
960 if ((type = lookup_utype (dip -> at_user_def_type)) == NULL)
961 {
962 type = alloc_utype (dip -> at_user_def_type, NULL);
963 }
964 }
965 else if (dip -> at_mod_u_d_type)
966 {
967 type = decode_mod_u_d_type (dip -> at_mod_u_d_type);
968 }
969 else
970 {
971 type = dwarf_fundamental_type (current_objfile, FT_INTEGER);
972 }
973 return (type);
974 }
975
976 /*
977
978 LOCAL FUNCTION
979
980 struct_type -- compute and return the type for a struct or union
981
982 SYNOPSIS
983
984 static struct type *struct_type (struct dieinfo *dip, char *thisdie,
985 char *enddie, struct objfile *objfile)
986
987 DESCRIPTION
988
989 Given pointer to a die information structure for a die which
990 defines a union or structure (and MUST define one or the other),
991 and pointers to the raw die data that define the range of dies which
992 define the members, compute and return the user defined type for the
993 structure or union.
994 */
995
996 static struct type *
997 struct_type (dip, thisdie, enddie, objfile)
998 struct dieinfo *dip;
999 char *thisdie;
1000 char *enddie;
1001 struct objfile *objfile;
1002 {
1003 struct type *type;
1004 struct nextfield {
1005 struct nextfield *next;
1006 struct field field;
1007 };
1008 struct nextfield *list = NULL;
1009 struct nextfield *new;
1010 int nfields = 0;
1011 int n;
1012 struct dieinfo mbr;
1013 char *nextdie;
1014 int anonymous_size;
1015
1016 if ((type = lookup_utype (dip -> die_ref)) == NULL)
1017 {
1018 /* No forward references created an empty type, so install one now */
1019 type = alloc_utype (dip -> die_ref, NULL);
1020 }
1021 INIT_CPLUS_SPECIFIC(type);
1022 switch (dip -> die_tag)
1023 {
1024 case TAG_class_type:
1025 TYPE_CODE (type) = TYPE_CODE_CLASS;
1026 break;
1027 case TAG_structure_type:
1028 TYPE_CODE (type) = TYPE_CODE_STRUCT;
1029 break;
1030 case TAG_union_type:
1031 TYPE_CODE (type) = TYPE_CODE_UNION;
1032 break;
1033 default:
1034 /* Should never happen */
1035 TYPE_CODE (type) = TYPE_CODE_UNDEF;
1036 complain (&missing_tag, DIE_ID, DIE_NAME);
1037 break;
1038 }
1039 /* Some compilers try to be helpful by inventing "fake" names for
1040 anonymous enums, structures, and unions, like "~0fake" or ".0fake".
1041 Thanks, but no thanks... */
1042 if (dip -> at_name != NULL
1043 && *dip -> at_name != '~'
1044 && *dip -> at_name != '.')
1045 {
1046 TYPE_TAG_NAME (type) = obconcat (&objfile -> type_obstack,
1047 "", "", dip -> at_name);
1048 }
1049 /* Use whatever size is known. Zero is a valid size. We might however
1050 wish to check has_at_byte_size to make sure that some byte size was
1051 given explicitly, but DWARF doesn't specify that explicit sizes of
1052 zero have to present, so complaining about missing sizes should
1053 probably not be the default. */
1054 TYPE_LENGTH (type) = dip -> at_byte_size;
1055 thisdie += dip -> die_length;
1056 while (thisdie < enddie)
1057 {
1058 basicdieinfo (&mbr, thisdie, objfile);
1059 completedieinfo (&mbr, objfile);
1060 if (mbr.die_length <= SIZEOF_DIE_LENGTH)
1061 {
1062 break;
1063 }
1064 else if (mbr.at_sibling != 0)
1065 {
1066 nextdie = dbbase + mbr.at_sibling - dbroff;
1067 }
1068 else
1069 {
1070 nextdie = thisdie + mbr.die_length;
1071 }
1072 switch (mbr.die_tag)
1073 {
1074 case TAG_member:
1075 /* Get space to record the next field's data. */
1076 new = (struct nextfield *) alloca (sizeof (struct nextfield));
1077 new -> next = list;
1078 list = new;
1079 /* Save the data. */
1080 list -> field.name =
1081 obsavestring (mbr.at_name, strlen (mbr.at_name),
1082 &objfile -> type_obstack);
1083 list -> field.type = decode_die_type (&mbr);
1084 list -> field.bitpos = 8 * locval (mbr.at_location);
1085 /* Handle bit fields. */
1086 list -> field.bitsize = mbr.at_bit_size;
1087 if (BITS_BIG_ENDIAN)
1088 {
1089 /* For big endian bits, the at_bit_offset gives the
1090 additional bit offset from the MSB of the containing
1091 anonymous object to the MSB of the field. We don't
1092 have to do anything special since we don't need to
1093 know the size of the anonymous object. */
1094 list -> field.bitpos += mbr.at_bit_offset;
1095 }
1096 else
1097 {
1098 /* For little endian bits, we need to have a non-zero
1099 at_bit_size, so that we know we are in fact dealing
1100 with a bitfield. Compute the bit offset to the MSB
1101 of the anonymous object, subtract off the number of
1102 bits from the MSB of the field to the MSB of the
1103 object, and then subtract off the number of bits of
1104 the field itself. The result is the bit offset of
1105 the LSB of the field. */
1106 if (mbr.at_bit_size > 0)
1107 {
1108 if (mbr.has_at_byte_size)
1109 {
1110 /* The size of the anonymous object containing
1111 the bit field is explicit, so use the
1112 indicated size (in bytes). */
1113 anonymous_size = mbr.at_byte_size;
1114 }
1115 else
1116 {
1117 /* The size of the anonymous object containing
1118 the bit field matches the size of an object
1119 of the bit field's type. DWARF allows
1120 at_byte_size to be left out in such cases, as
1121 a debug information size optimization. */
1122 anonymous_size = TYPE_LENGTH (list -> field.type);
1123 }
1124 list -> field.bitpos +=
1125 anonymous_size * 8 - mbr.at_bit_offset - mbr.at_bit_size;
1126 }
1127 }
1128 nfields++;
1129 break;
1130 default:
1131 process_dies (thisdie, nextdie, objfile);
1132 break;
1133 }
1134 thisdie = nextdie;
1135 }
1136 /* Now create the vector of fields, and record how big it is. We may
1137 not even have any fields, if this DIE was generated due to a reference
1138 to an anonymous structure or union. In this case, TYPE_FLAG_STUB is
1139 set, which clues gdb in to the fact that it needs to search elsewhere
1140 for the full structure definition. */
1141 if (nfields == 0)
1142 {
1143 TYPE_FLAGS (type) |= TYPE_FLAG_STUB;
1144 }
1145 else
1146 {
1147 TYPE_NFIELDS (type) = nfields;
1148 TYPE_FIELDS (type) = (struct field *)
1149 TYPE_ALLOC (type, sizeof (struct field) * nfields);
1150 /* Copy the saved-up fields into the field vector. */
1151 for (n = nfields; list; list = list -> next)
1152 {
1153 TYPE_FIELD (type, --n) = list -> field;
1154 }
1155 }
1156 return (type);
1157 }
1158
1159 /*
1160
1161 LOCAL FUNCTION
1162
1163 read_structure_scope -- process all dies within struct or union
1164
1165 SYNOPSIS
1166
1167 static void read_structure_scope (struct dieinfo *dip,
1168 char *thisdie, char *enddie, struct objfile *objfile)
1169
1170 DESCRIPTION
1171
1172 Called when we find the DIE that starts a structure or union
1173 scope (definition) to process all dies that define the members
1174 of the structure or union. DIP is a pointer to the die info
1175 struct for the DIE that names the structure or union.
1176
1177 NOTES
1178
1179 Note that we need to call struct_type regardless of whether or not
1180 the DIE has an at_name attribute, since it might be an anonymous
1181 structure or union. This gets the type entered into our set of
1182 user defined types.
1183
1184 However, if the structure is incomplete (an opaque struct/union)
1185 then suppress creating a symbol table entry for it since gdb only
1186 wants to find the one with the complete definition. Note that if
1187 it is complete, we just call new_symbol, which does it's own
1188 checking about whether the struct/union is anonymous or not (and
1189 suppresses creating a symbol table entry itself).
1190
1191 */
1192
1193 static void
1194 read_structure_scope (dip, thisdie, enddie, objfile)
1195 struct dieinfo *dip;
1196 char *thisdie;
1197 char *enddie;
1198 struct objfile *objfile;
1199 {
1200 struct type *type;
1201 struct symbol *sym;
1202
1203 type = struct_type (dip, thisdie, enddie, objfile);
1204 if (!(TYPE_FLAGS (type) & TYPE_FLAG_STUB))
1205 {
1206 sym = new_symbol (dip, objfile);
1207 if (sym != NULL)
1208 {
1209 SYMBOL_TYPE (sym) = type;
1210 if (cu_language == language_cplus)
1211 {
1212 synthesize_typedef (dip, objfile, type);
1213 }
1214 }
1215 }
1216 }
1217
1218 /*
1219
1220 LOCAL FUNCTION
1221
1222 decode_array_element_type -- decode type of the array elements
1223
1224 SYNOPSIS
1225
1226 static struct type *decode_array_element_type (char *scan, char *end)
1227
1228 DESCRIPTION
1229
1230 As the last step in decoding the array subscript information for an
1231 array DIE, we need to decode the type of the array elements. We are
1232 passed a pointer to this last part of the subscript information and
1233 must return the appropriate type. If the type attribute is not
1234 recognized, just warn about the problem and return type int.
1235 */
1236
1237 static struct type *
1238 decode_array_element_type (scan)
1239 char *scan;
1240 {
1241 struct type *typep;
1242 DIE_REF die_ref;
1243 unsigned short attribute;
1244 unsigned short fundtype;
1245 int nbytes;
1246
1247 attribute = target_to_host (scan, SIZEOF_ATTRIBUTE, GET_UNSIGNED,
1248 current_objfile);
1249 scan += SIZEOF_ATTRIBUTE;
1250 if ((nbytes = attribute_size (attribute)) == -1)
1251 {
1252 complain (&bad_array_element_type, DIE_ID, DIE_NAME, attribute);
1253 typep = dwarf_fundamental_type (current_objfile, FT_INTEGER);
1254 }
1255 else
1256 {
1257 switch (attribute)
1258 {
1259 case AT_fund_type:
1260 fundtype = target_to_host (scan, nbytes, GET_UNSIGNED,
1261 current_objfile);
1262 typep = decode_fund_type (fundtype);
1263 break;
1264 case AT_mod_fund_type:
1265 typep = decode_mod_fund_type (scan);
1266 break;
1267 case AT_user_def_type:
1268 die_ref = target_to_host (scan, nbytes, GET_UNSIGNED,
1269 current_objfile);
1270 if ((typep = lookup_utype (die_ref)) == NULL)
1271 {
1272 typep = alloc_utype (die_ref, NULL);
1273 }
1274 break;
1275 case AT_mod_u_d_type:
1276 typep = decode_mod_u_d_type (scan);
1277 break;
1278 default:
1279 complain (&bad_array_element_type, DIE_ID, DIE_NAME, attribute);
1280 typep = dwarf_fundamental_type (current_objfile, FT_INTEGER);
1281 break;
1282 }
1283 }
1284 return (typep);
1285 }
1286
1287 /*
1288
1289 LOCAL FUNCTION
1290
1291 decode_subscript_data_item -- decode array subscript item
1292
1293 SYNOPSIS
1294
1295 static struct type *
1296 decode_subscript_data_item (char *scan, char *end)
1297
1298 DESCRIPTION
1299
1300 The array subscripts and the data type of the elements of an
1301 array are described by a list of data items, stored as a block
1302 of contiguous bytes. There is a data item describing each array
1303 dimension, and a final data item describing the element type.
1304 The data items are ordered the same as their appearance in the
1305 source (I.E. leftmost dimension first, next to leftmost second,
1306 etc).
1307
1308 The data items describing each array dimension consist of four
1309 parts: (1) a format specifier, (2) type type of the subscript
1310 index, (3) a description of the low bound of the array dimension,
1311 and (4) a description of the high bound of the array dimension.
1312
1313 The last data item is the description of the type of each of
1314 the array elements.
1315
1316 We are passed a pointer to the start of the block of bytes
1317 containing the remaining data items, and a pointer to the first
1318 byte past the data. This function recursively decodes the
1319 remaining data items and returns a type.
1320
1321 If we somehow fail to decode some data, we complain about it
1322 and return a type "array of int".
1323
1324 BUGS
1325 FIXME: This code only implements the forms currently used
1326 by the AT&T and GNU C compilers.
1327
1328 The end pointer is supplied for error checking, maybe we should
1329 use it for that...
1330 */
1331
1332 static struct type *
1333 decode_subscript_data_item (scan, end)
1334 char *scan;
1335 char *end;
1336 {
1337 struct type *typep = NULL; /* Array type we are building */
1338 struct type *nexttype; /* Type of each element (may be array) */
1339 struct type *indextype; /* Type of this index */
1340 struct type *rangetype;
1341 unsigned int format;
1342 unsigned short fundtype;
1343 unsigned long lowbound;
1344 unsigned long highbound;
1345 int nbytes;
1346
1347 format = target_to_host (scan, SIZEOF_FORMAT_SPECIFIER, GET_UNSIGNED,
1348 current_objfile);
1349 scan += SIZEOF_FORMAT_SPECIFIER;
1350 switch (format)
1351 {
1352 case FMT_ET:
1353 typep = decode_array_element_type (scan);
1354 break;
1355 case FMT_FT_C_C:
1356 fundtype = target_to_host (scan, SIZEOF_FMT_FT, GET_UNSIGNED,
1357 current_objfile);
1358 indextype = decode_fund_type (fundtype);
1359 scan += SIZEOF_FMT_FT;
1360 nbytes = TARGET_FT_LONG_SIZE (current_objfile);
1361 lowbound = target_to_host (scan, nbytes, GET_UNSIGNED, current_objfile);
1362 scan += nbytes;
1363 highbound = target_to_host (scan, nbytes, GET_UNSIGNED, current_objfile);
1364 scan += nbytes;
1365 nexttype = decode_subscript_data_item (scan, end);
1366 if (nexttype == NULL)
1367 {
1368 /* Munged subscript data or other problem, fake it. */
1369 complain (&subscript_data_items, DIE_ID, DIE_NAME);
1370 nexttype = dwarf_fundamental_type (current_objfile, FT_INTEGER);
1371 }
1372 rangetype = create_range_type ((struct type *) NULL, indextype,
1373 lowbound, highbound);
1374 typep = create_array_type ((struct type *) NULL, nexttype, rangetype);
1375 break;
1376 case FMT_FT_C_X:
1377 case FMT_FT_X_C:
1378 case FMT_FT_X_X:
1379 case FMT_UT_C_C:
1380 case FMT_UT_C_X:
1381 case FMT_UT_X_C:
1382 case FMT_UT_X_X:
1383 complain (&unhandled_array_subscript_format, DIE_ID, DIE_NAME, format);
1384 nexttype = dwarf_fundamental_type (current_objfile, FT_INTEGER);
1385 rangetype = create_range_type ((struct type *) NULL, nexttype, 0, 0);
1386 typep = create_array_type ((struct type *) NULL, nexttype, rangetype);
1387 break;
1388 default:
1389 complain (&unknown_array_subscript_format, DIE_ID, DIE_NAME, format);
1390 nexttype = dwarf_fundamental_type (current_objfile, FT_INTEGER);
1391 rangetype = create_range_type ((struct type *) NULL, nexttype, 0, 0);
1392 typep = create_array_type ((struct type *) NULL, nexttype, rangetype);
1393 break;
1394 }
1395 return (typep);
1396 }
1397
1398 /*
1399
1400 LOCAL FUNCTION
1401
1402 dwarf_read_array_type -- read TAG_array_type DIE
1403
1404 SYNOPSIS
1405
1406 static void dwarf_read_array_type (struct dieinfo *dip)
1407
1408 DESCRIPTION
1409
1410 Extract all information from a TAG_array_type DIE and add to
1411 the user defined type vector.
1412 */
1413
1414 static void
1415 dwarf_read_array_type (dip)
1416 struct dieinfo *dip;
1417 {
1418 struct type *type;
1419 struct type *utype;
1420 char *sub;
1421 char *subend;
1422 unsigned short blocksz;
1423 int nbytes;
1424
1425 if (dip -> at_ordering != ORD_row_major)
1426 {
1427 /* FIXME: Can gdb even handle column major arrays? */
1428 complain (&not_row_major, DIE_ID, DIE_NAME);
1429 }
1430 if ((sub = dip -> at_subscr_data) != NULL)
1431 {
1432 nbytes = attribute_size (AT_subscr_data);
1433 blocksz = target_to_host (sub, nbytes, GET_UNSIGNED, current_objfile);
1434 subend = sub + nbytes + blocksz;
1435 sub += nbytes;
1436 type = decode_subscript_data_item (sub, subend);
1437 if ((utype = lookup_utype (dip -> die_ref)) == NULL)
1438 {
1439 /* Install user defined type that has not been referenced yet. */
1440 alloc_utype (dip -> die_ref, type);
1441 }
1442 else if (TYPE_CODE (utype) == TYPE_CODE_UNDEF)
1443 {
1444 /* Ick! A forward ref has already generated a blank type in our
1445 slot, and this type probably already has things pointing to it
1446 (which is what caused it to be created in the first place).
1447 If it's just a place holder we can plop our fully defined type
1448 on top of it. We can't recover the space allocated for our
1449 new type since it might be on an obstack, but we could reuse
1450 it if we kept a list of them, but it might not be worth it
1451 (FIXME). */
1452 *utype = *type;
1453 }
1454 else
1455 {
1456 /* Double ick! Not only is a type already in our slot, but
1457 someone has decorated it. Complain and leave it alone. */
1458 complain (&dup_user_type_definition, DIE_ID, DIE_NAME);
1459 }
1460 }
1461 }
1462
1463 /*
1464
1465 LOCAL FUNCTION
1466
1467 read_tag_pointer_type -- read TAG_pointer_type DIE
1468
1469 SYNOPSIS
1470
1471 static void read_tag_pointer_type (struct dieinfo *dip)
1472
1473 DESCRIPTION
1474
1475 Extract all information from a TAG_pointer_type DIE and add to
1476 the user defined type vector.
1477 */
1478
1479 static void
1480 read_tag_pointer_type (dip)
1481 struct dieinfo *dip;
1482 {
1483 struct type *type;
1484 struct type *utype;
1485
1486 type = decode_die_type (dip);
1487 if ((utype = lookup_utype (dip -> die_ref)) == NULL)
1488 {
1489 utype = lookup_pointer_type (type);
1490 alloc_utype (dip -> die_ref, utype);
1491 }
1492 else
1493 {
1494 TYPE_TARGET_TYPE (utype) = type;
1495 TYPE_POINTER_TYPE (type) = utype;
1496
1497 /* We assume the machine has only one representation for pointers! */
1498 /* FIXME: This confuses host<->target data representations, and is a
1499 poor assumption besides. */
1500
1501 TYPE_LENGTH (utype) = sizeof (char *);
1502 TYPE_CODE (utype) = TYPE_CODE_PTR;
1503 }
1504 }
1505
1506 /*
1507
1508 LOCAL FUNCTION
1509
1510 read_tag_string_type -- read TAG_string_type DIE
1511
1512 SYNOPSIS
1513
1514 static void read_tag_string_type (struct dieinfo *dip)
1515
1516 DESCRIPTION
1517
1518 Extract all information from a TAG_string_type DIE and add to
1519 the user defined type vector. It isn't really a user defined
1520 type, but it behaves like one, with other DIE's using an
1521 AT_user_def_type attribute to reference it.
1522 */
1523
1524 static void
1525 read_tag_string_type (dip)
1526 struct dieinfo *dip;
1527 {
1528 struct type *utype;
1529 struct type *indextype;
1530 struct type *rangetype;
1531 unsigned long lowbound = 0;
1532 unsigned long highbound;
1533
1534 if (dip -> has_at_byte_size)
1535 {
1536 /* A fixed bounds string */
1537 highbound = dip -> at_byte_size - 1;
1538 }
1539 else
1540 {
1541 /* A varying length string. Stub for now. (FIXME) */
1542 highbound = 1;
1543 }
1544 indextype = dwarf_fundamental_type (current_objfile, FT_INTEGER);
1545 rangetype = create_range_type ((struct type *) NULL, indextype, lowbound,
1546 highbound);
1547
1548 utype = lookup_utype (dip -> die_ref);
1549 if (utype == NULL)
1550 {
1551 /* No type defined, go ahead and create a blank one to use. */
1552 utype = alloc_utype (dip -> die_ref, (struct type *) NULL);
1553 }
1554 else
1555 {
1556 /* Already a type in our slot due to a forward reference. Make sure it
1557 is a blank one. If not, complain and leave it alone. */
1558 if (TYPE_CODE (utype) != TYPE_CODE_UNDEF)
1559 {
1560 complain (&dup_user_type_definition, DIE_ID, DIE_NAME);
1561 return;
1562 }
1563 }
1564
1565 /* Create the string type using the blank type we either found or created. */
1566 utype = create_string_type (utype, rangetype);
1567 }
1568
1569 /*
1570
1571 LOCAL FUNCTION
1572
1573 read_subroutine_type -- process TAG_subroutine_type dies
1574
1575 SYNOPSIS
1576
1577 static void read_subroutine_type (struct dieinfo *dip, char thisdie,
1578 char *enddie)
1579
1580 DESCRIPTION
1581
1582 Handle DIES due to C code like:
1583
1584 struct foo {
1585 int (*funcp)(int a, long l); (Generates TAG_subroutine_type DIE)
1586 int b;
1587 };
1588
1589 NOTES
1590
1591 The parameter DIES are currently ignored. See if gdb has a way to
1592 include this info in it's type system, and decode them if so. Is
1593 this what the type structure's "arg_types" field is for? (FIXME)
1594 */
1595
1596 static void
1597 read_subroutine_type (dip, thisdie, enddie)
1598 struct dieinfo *dip;
1599 char *thisdie;
1600 char *enddie;
1601 {
1602 struct type *type; /* Type that this function returns */
1603 struct type *ftype; /* Function that returns above type */
1604
1605 /* Decode the type that this subroutine returns */
1606
1607 type = decode_die_type (dip);
1608
1609 /* Check to see if we already have a partially constructed user
1610 defined type for this DIE, from a forward reference. */
1611
1612 if ((ftype = lookup_utype (dip -> die_ref)) == NULL)
1613 {
1614 /* This is the first reference to one of these types. Make
1615 a new one and place it in the user defined types. */
1616 ftype = lookup_function_type (type);
1617 alloc_utype (dip -> die_ref, ftype);
1618 }
1619 else if (TYPE_CODE (ftype) == TYPE_CODE_UNDEF)
1620 {
1621 /* We have an existing partially constructed type, so bash it
1622 into the correct type. */
1623 TYPE_TARGET_TYPE (ftype) = type;
1624 TYPE_LENGTH (ftype) = 1;
1625 TYPE_CODE (ftype) = TYPE_CODE_FUNC;
1626 }
1627 else
1628 {
1629 complain (&dup_user_type_definition, DIE_ID, DIE_NAME);
1630 }
1631 }
1632
1633 /*
1634
1635 LOCAL FUNCTION
1636
1637 read_enumeration -- process dies which define an enumeration
1638
1639 SYNOPSIS
1640
1641 static void read_enumeration (struct dieinfo *dip, char *thisdie,
1642 char *enddie, struct objfile *objfile)
1643
1644 DESCRIPTION
1645
1646 Given a pointer to a die which begins an enumeration, process all
1647 the dies that define the members of the enumeration.
1648
1649 NOTES
1650
1651 Note that we need to call enum_type regardless of whether or not we
1652 have a symbol, since we might have an enum without a tag name (thus
1653 no symbol for the tagname).
1654 */
1655
1656 static void
1657 read_enumeration (dip, thisdie, enddie, objfile)
1658 struct dieinfo *dip;
1659 char *thisdie;
1660 char *enddie;
1661 struct objfile *objfile;
1662 {
1663 struct type *type;
1664 struct symbol *sym;
1665
1666 type = enum_type (dip, objfile);
1667 sym = new_symbol (dip, objfile);
1668 if (sym != NULL)
1669 {
1670 SYMBOL_TYPE (sym) = type;
1671 if (cu_language == language_cplus)
1672 {
1673 synthesize_typedef (dip, objfile, type);
1674 }
1675 }
1676 }
1677
1678 /*
1679
1680 LOCAL FUNCTION
1681
1682 enum_type -- decode and return a type for an enumeration
1683
1684 SYNOPSIS
1685
1686 static type *enum_type (struct dieinfo *dip, struct objfile *objfile)
1687
1688 DESCRIPTION
1689
1690 Given a pointer to a die information structure for the die which
1691 starts an enumeration, process all the dies that define the members
1692 of the enumeration and return a type pointer for the enumeration.
1693
1694 At the same time, for each member of the enumeration, create a
1695 symbol for it with namespace VAR_NAMESPACE and class LOC_CONST,
1696 and give it the type of the enumeration itself.
1697
1698 NOTES
1699
1700 Note that the DWARF specification explicitly mandates that enum
1701 constants occur in reverse order from the source program order,
1702 for "consistency" and because this ordering is easier for many
1703 compilers to generate. (Draft 6, sec 3.8.5, Enumeration type
1704 Entries). Because gdb wants to see the enum members in program
1705 source order, we have to ensure that the order gets reversed while
1706 we are processing them.
1707 */
1708
1709 static struct type *
1710 enum_type (dip, objfile)
1711 struct dieinfo *dip;
1712 struct objfile *objfile;
1713 {
1714 struct type *type;
1715 struct nextfield {
1716 struct nextfield *next;
1717 struct field field;
1718 };
1719 struct nextfield *list = NULL;
1720 struct nextfield *new;
1721 int nfields = 0;
1722 int n;
1723 char *scan;
1724 char *listend;
1725 unsigned short blocksz;
1726 struct symbol *sym;
1727 int nbytes;
1728 int unsigned_enum = 1;
1729
1730 if ((type = lookup_utype (dip -> die_ref)) == NULL)
1731 {
1732 /* No forward references created an empty type, so install one now */
1733 type = alloc_utype (dip -> die_ref, NULL);
1734 }
1735 TYPE_CODE (type) = TYPE_CODE_ENUM;
1736 /* Some compilers try to be helpful by inventing "fake" names for
1737 anonymous enums, structures, and unions, like "~0fake" or ".0fake".
1738 Thanks, but no thanks... */
1739 if (dip -> at_name != NULL
1740 && *dip -> at_name != '~'
1741 && *dip -> at_name != '.')
1742 {
1743 TYPE_TAG_NAME (type) = obconcat (&objfile -> type_obstack,
1744 "", "", dip -> at_name);
1745 }
1746 if (dip -> at_byte_size != 0)
1747 {
1748 TYPE_LENGTH (type) = dip -> at_byte_size;
1749 }
1750 if ((scan = dip -> at_element_list) != NULL)
1751 {
1752 if (dip -> short_element_list)
1753 {
1754 nbytes = attribute_size (AT_short_element_list);
1755 }
1756 else
1757 {
1758 nbytes = attribute_size (AT_element_list);
1759 }
1760 blocksz = target_to_host (scan, nbytes, GET_UNSIGNED, objfile);
1761 listend = scan + nbytes + blocksz;
1762 scan += nbytes;
1763 while (scan < listend)
1764 {
1765 new = (struct nextfield *) alloca (sizeof (struct nextfield));
1766 new -> next = list;
1767 list = new;
1768 list -> field.type = NULL;
1769 list -> field.bitsize = 0;
1770 list -> field.bitpos =
1771 target_to_host (scan, TARGET_FT_LONG_SIZE (objfile), GET_SIGNED,
1772 objfile);
1773 scan += TARGET_FT_LONG_SIZE (objfile);
1774 list -> field.name = obsavestring (scan, strlen (scan),
1775 &objfile -> type_obstack);
1776 scan += strlen (scan) + 1;
1777 nfields++;
1778 /* Handcraft a new symbol for this enum member. */
1779 sym = (struct symbol *) obstack_alloc (&objfile->symbol_obstack,
1780 sizeof (struct symbol));
1781 memset (sym, 0, sizeof (struct symbol));
1782 SYMBOL_NAME (sym) = create_name (list -> field.name,
1783 &objfile->symbol_obstack);
1784 SYMBOL_INIT_LANGUAGE_SPECIFIC (sym, cu_language);
1785 SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE;
1786 SYMBOL_CLASS (sym) = LOC_CONST;
1787 SYMBOL_TYPE (sym) = type;
1788 SYMBOL_VALUE (sym) = list -> field.bitpos;
1789 if (SYMBOL_VALUE (sym) < 0)
1790 unsigned_enum = 0;
1791 add_symbol_to_list (sym, list_in_scope);
1792 }
1793 /* Now create the vector of fields, and record how big it is. This is
1794 where we reverse the order, by pulling the members off the list in
1795 reverse order from how they were inserted. If we have no fields
1796 (this is apparently possible in C++) then skip building a field
1797 vector. */
1798 if (nfields > 0)
1799 {
1800 if (unsigned_enum)
1801 TYPE_FLAGS (type) |= TYPE_FLAG_UNSIGNED;
1802 TYPE_NFIELDS (type) = nfields;
1803 TYPE_FIELDS (type) = (struct field *)
1804 obstack_alloc (&objfile->symbol_obstack, sizeof (struct field) * nfields);
1805 /* Copy the saved-up fields into the field vector. */
1806 for (n = 0; (n < nfields) && (list != NULL); list = list -> next)
1807 {
1808 TYPE_FIELD (type, n++) = list -> field;
1809 }
1810 }
1811 }
1812 return (type);
1813 }
1814
1815 /*
1816
1817 LOCAL FUNCTION
1818
1819 read_func_scope -- process all dies within a function scope
1820
1821 DESCRIPTION
1822
1823 Process all dies within a given function scope. We are passed
1824 a die information structure pointer DIP for the die which
1825 starts the function scope, and pointers into the raw die data
1826 that define the dies within the function scope.
1827
1828 For now, we ignore lexical block scopes within the function.
1829 The problem is that AT&T cc does not define a DWARF lexical
1830 block scope for the function itself, while gcc defines a
1831 lexical block scope for the function. We need to think about
1832 how to handle this difference, or if it is even a problem.
1833 (FIXME)
1834 */
1835
1836 static void
1837 read_func_scope (dip, thisdie, enddie, objfile)
1838 struct dieinfo *dip;
1839 char *thisdie;
1840 char *enddie;
1841 struct objfile *objfile;
1842 {
1843 register struct context_stack *new;
1844
1845 /* AT_name is absent if the function is described with an
1846 AT_abstract_origin tag.
1847 Ignore the function description for now to avoid GDB core dumps.
1848 FIXME: Add code to handle AT_abstract_origin tags properly. */
1849 if (dip -> at_name == NULL)
1850 {
1851 complain (&missing_at_name, DIE_ID);
1852 return;
1853 }
1854
1855 if (objfile -> ei.entry_point >= dip -> at_low_pc &&
1856 objfile -> ei.entry_point < dip -> at_high_pc)
1857 {
1858 objfile -> ei.entry_func_lowpc = dip -> at_low_pc;
1859 objfile -> ei.entry_func_highpc = dip -> at_high_pc;
1860 }
1861 if (STREQ (dip -> at_name, "main")) /* FIXME: hardwired name */
1862 {
1863 objfile -> ei.main_func_lowpc = dip -> at_low_pc;
1864 objfile -> ei.main_func_highpc = dip -> at_high_pc;
1865 }
1866 new = push_context (0, dip -> at_low_pc);
1867 new -> name = new_symbol (dip, objfile);
1868 list_in_scope = &local_symbols;
1869 process_dies (thisdie + dip -> die_length, enddie, objfile);
1870 new = pop_context ();
1871 /* Make a block for the local symbols within. */
1872 finish_block (new -> name, &local_symbols, new -> old_blocks,
1873 new -> start_addr, dip -> at_high_pc, objfile);
1874 list_in_scope = &file_symbols;
1875 }
1876
1877
1878 /*
1879
1880 LOCAL FUNCTION
1881
1882 handle_producer -- process the AT_producer attribute
1883
1884 DESCRIPTION
1885
1886 Perform any operations that depend on finding a particular
1887 AT_producer attribute.
1888
1889 */
1890
1891 static void
1892 handle_producer (producer)
1893 char *producer;
1894 {
1895
1896 /* If this compilation unit was compiled with g++ or gcc, then set the
1897 processing_gcc_compilation flag. */
1898
1899 processing_gcc_compilation =
1900 STREQN (producer, GPLUS_PRODUCER, strlen (GPLUS_PRODUCER))
1901 || STREQN (producer, CHILL_PRODUCER, strlen (CHILL_PRODUCER))
1902 || STREQN (producer, GCC_PRODUCER, strlen (GCC_PRODUCER));
1903
1904 /* Select a demangling style if we can identify the producer and if
1905 the current style is auto. We leave the current style alone if it
1906 is not auto. We also leave the demangling style alone if we find a
1907 gcc (cc1) producer, as opposed to a g++ (cc1plus) producer. */
1908
1909 if (AUTO_DEMANGLING)
1910 {
1911 if (STREQN (producer, GPLUS_PRODUCER, strlen (GPLUS_PRODUCER)))
1912 {
1913 set_demangling_style (GNU_DEMANGLING_STYLE_STRING);
1914 }
1915 else if (STREQN (producer, LCC_PRODUCER, strlen (LCC_PRODUCER)))
1916 {
1917 set_demangling_style (LUCID_DEMANGLING_STYLE_STRING);
1918 }
1919 }
1920 }
1921
1922
1923 /*
1924
1925 LOCAL FUNCTION
1926
1927 read_file_scope -- process all dies within a file scope
1928
1929 DESCRIPTION
1930
1931 Process all dies within a given file scope. We are passed a
1932 pointer to the die information structure for the die which
1933 starts the file scope, and pointers into the raw die data which
1934 mark the range of dies within the file scope.
1935
1936 When the partial symbol table is built, the file offset for the line
1937 number table for each compilation unit is saved in the partial symbol
1938 table entry for that compilation unit. As the symbols for each
1939 compilation unit are read, the line number table is read into memory
1940 and the variable lnbase is set to point to it. Thus all we have to
1941 do is use lnbase to access the line number table for the current
1942 compilation unit.
1943 */
1944
1945 static void
1946 read_file_scope (dip, thisdie, enddie, objfile)
1947 struct dieinfo *dip;
1948 char *thisdie;
1949 char *enddie;
1950 struct objfile *objfile;
1951 {
1952 struct cleanup *back_to;
1953 struct symtab *symtab;
1954
1955 if (objfile -> ei.entry_point >= dip -> at_low_pc &&
1956 objfile -> ei.entry_point < dip -> at_high_pc)
1957 {
1958 objfile -> ei.entry_file_lowpc = dip -> at_low_pc;
1959 objfile -> ei.entry_file_highpc = dip -> at_high_pc;
1960 }
1961 set_cu_language (dip);
1962 if (dip -> at_producer != NULL)
1963 {
1964 handle_producer (dip -> at_producer);
1965 }
1966 numutypes = (enddie - thisdie) / 4;
1967 utypes = (struct type **) xmalloc (numutypes * sizeof (struct type *));
1968 back_to = make_cleanup (free_utypes, NULL);
1969 memset (utypes, 0, numutypes * sizeof (struct type *));
1970 memset (ftypes, 0, FT_NUM_MEMBERS * sizeof (struct type *));
1971 start_symtab (dip -> at_name, dip -> at_comp_dir, dip -> at_low_pc);
1972 decode_line_numbers (lnbase);
1973 process_dies (thisdie + dip -> die_length, enddie, objfile);
1974
1975 symtab = end_symtab (dip -> at_high_pc, objfile, 0);
1976 if (symtab != NULL)
1977 {
1978 symtab -> language = cu_language;
1979 }
1980 do_cleanups (back_to);
1981 }
1982
1983 /*
1984
1985 LOCAL FUNCTION
1986
1987 process_dies -- process a range of DWARF Information Entries
1988
1989 SYNOPSIS
1990
1991 static void process_dies (char *thisdie, char *enddie,
1992 struct objfile *objfile)
1993
1994 DESCRIPTION
1995
1996 Process all DIE's in a specified range. May be (and almost
1997 certainly will be) called recursively.
1998 */
1999
2000 static void
2001 process_dies (thisdie, enddie, objfile)
2002 char *thisdie;
2003 char *enddie;
2004 struct objfile *objfile;
2005 {
2006 char *nextdie;
2007 struct dieinfo di;
2008
2009 while (thisdie < enddie)
2010 {
2011 basicdieinfo (&di, thisdie, objfile);
2012 if (di.die_length < SIZEOF_DIE_LENGTH)
2013 {
2014 break;
2015 }
2016 else if (di.die_tag == TAG_padding)
2017 {
2018 nextdie = thisdie + di.die_length;
2019 }
2020 else
2021 {
2022 completedieinfo (&di, objfile);
2023 if (di.at_sibling != 0)
2024 {
2025 nextdie = dbbase + di.at_sibling - dbroff;
2026 }
2027 else
2028 {
2029 nextdie = thisdie + di.die_length;
2030 }
2031 #ifdef SMASH_TEXT_ADDRESS
2032 /* I think that these are always text, not data, addresses. */
2033 SMASH_TEXT_ADDRESS (di.at_low_pc);
2034 SMASH_TEXT_ADDRESS (di.at_high_pc);
2035 #endif
2036 switch (di.die_tag)
2037 {
2038 case TAG_compile_unit:
2039 /* Skip Tag_compile_unit if we are already inside a compilation
2040 unit, we are unable to handle nested compilation units
2041 properly (FIXME). */
2042 if (current_subfile == NULL)
2043 read_file_scope (&di, thisdie, nextdie, objfile);
2044 else
2045 nextdie = thisdie + di.die_length;
2046 break;
2047 case TAG_global_subroutine:
2048 case TAG_subroutine:
2049 if (di.has_at_low_pc)
2050 {
2051 read_func_scope (&di, thisdie, nextdie, objfile);
2052 }
2053 break;
2054 case TAG_lexical_block:
2055 read_lexical_block_scope (&di, thisdie, nextdie, objfile);
2056 break;
2057 case TAG_class_type:
2058 case TAG_structure_type:
2059 case TAG_union_type:
2060 read_structure_scope (&di, thisdie, nextdie, objfile);
2061 break;
2062 case TAG_enumeration_type:
2063 read_enumeration (&di, thisdie, nextdie, objfile);
2064 break;
2065 case TAG_subroutine_type:
2066 read_subroutine_type (&di, thisdie, nextdie);
2067 break;
2068 case TAG_array_type:
2069 dwarf_read_array_type (&di);
2070 break;
2071 case TAG_pointer_type:
2072 read_tag_pointer_type (&di);
2073 break;
2074 case TAG_string_type:
2075 read_tag_string_type (&di);
2076 break;
2077 default:
2078 new_symbol (&di, objfile);
2079 break;
2080 }
2081 }
2082 thisdie = nextdie;
2083 }
2084 }
2085
2086 /*
2087
2088 LOCAL FUNCTION
2089
2090 decode_line_numbers -- decode a line number table fragment
2091
2092 SYNOPSIS
2093
2094 static void decode_line_numbers (char *tblscan, char *tblend,
2095 long length, long base, long line, long pc)
2096
2097 DESCRIPTION
2098
2099 Translate the DWARF line number information to gdb form.
2100
2101 The ".line" section contains one or more line number tables, one for
2102 each ".line" section from the objects that were linked.
2103
2104 The AT_stmt_list attribute for each TAG_source_file entry in the
2105 ".debug" section contains the offset into the ".line" section for the
2106 start of the table for that file.
2107
2108 The table itself has the following structure:
2109
2110 <table length><base address><source statement entry>
2111 4 bytes 4 bytes 10 bytes
2112
2113 The table length is the total size of the table, including the 4 bytes
2114 for the length information.
2115
2116 The base address is the address of the first instruction generated
2117 for the source file.
2118
2119 Each source statement entry has the following structure:
2120
2121 <line number><statement position><address delta>
2122 4 bytes 2 bytes 4 bytes
2123
2124 The line number is relative to the start of the file, starting with
2125 line 1.
2126
2127 The statement position either -1 (0xFFFF) or the number of characters
2128 from the beginning of the line to the beginning of the statement.
2129
2130 The address delta is the difference between the base address and
2131 the address of the first instruction for the statement.
2132
2133 Note that we must copy the bytes from the packed table to our local
2134 variables before attempting to use them, to avoid alignment problems
2135 on some machines, particularly RISC processors.
2136
2137 BUGS
2138
2139 Does gdb expect the line numbers to be sorted? They are now by
2140 chance/luck, but are not required to be. (FIXME)
2141
2142 The line with number 0 is unused, gdb apparently can discover the
2143 span of the last line some other way. How? (FIXME)
2144 */
2145
2146 static void
2147 decode_line_numbers (linetable)
2148 char *linetable;
2149 {
2150 char *tblscan;
2151 char *tblend;
2152 unsigned long length;
2153 unsigned long base;
2154 unsigned long line;
2155 unsigned long pc;
2156
2157 if (linetable != NULL)
2158 {
2159 tblscan = tblend = linetable;
2160 length = target_to_host (tblscan, SIZEOF_LINETBL_LENGTH, GET_UNSIGNED,
2161 current_objfile);
2162 tblscan += SIZEOF_LINETBL_LENGTH;
2163 tblend += length;
2164 base = target_to_host (tblscan, TARGET_FT_POINTER_SIZE (objfile),
2165 GET_UNSIGNED, current_objfile);
2166 tblscan += TARGET_FT_POINTER_SIZE (objfile);
2167 base += baseaddr;
2168 while (tblscan < tblend)
2169 {
2170 line = target_to_host (tblscan, SIZEOF_LINETBL_LINENO, GET_UNSIGNED,
2171 current_objfile);
2172 tblscan += SIZEOF_LINETBL_LINENO + SIZEOF_LINETBL_STMT;
2173 pc = target_to_host (tblscan, SIZEOF_LINETBL_DELTA, GET_UNSIGNED,
2174 current_objfile);
2175 tblscan += SIZEOF_LINETBL_DELTA;
2176 pc += base;
2177 if (line != 0)
2178 {
2179 record_line (current_subfile, line, pc);
2180 }
2181 }
2182 }
2183 }
2184
2185 /*
2186
2187 LOCAL FUNCTION
2188
2189 locval -- compute the value of a location attribute
2190
2191 SYNOPSIS
2192
2193 static int locval (char *loc)
2194
2195 DESCRIPTION
2196
2197 Given pointer to a string of bytes that define a location, compute
2198 the location and return the value.
2199 A location description containing no atoms indicates that the
2200 object is optimized out. The global optimized_out flag is set for
2201 those, the return value is meaningless.
2202
2203 When computing values involving the current value of the frame pointer,
2204 the value zero is used, which results in a value relative to the frame
2205 pointer, rather than the absolute value. This is what GDB wants
2206 anyway.
2207
2208 When the result is a register number, the global isreg flag is set,
2209 otherwise it is cleared. This is a kludge until we figure out a better
2210 way to handle the problem. Gdb's design does not mesh well with the
2211 DWARF notion of a location computing interpreter, which is a shame
2212 because the flexibility goes unused.
2213
2214 NOTES
2215
2216 Note that stack[0] is unused except as a default error return.
2217 Note that stack overflow is not yet handled.
2218 */
2219
2220 static int
2221 locval (loc)
2222 char *loc;
2223 {
2224 unsigned short nbytes;
2225 unsigned short locsize;
2226 auto long stack[64];
2227 int stacki;
2228 char *end;
2229 int loc_atom_code;
2230 int loc_value_size;
2231
2232 nbytes = attribute_size (AT_location);
2233 locsize = target_to_host (loc, nbytes, GET_UNSIGNED, current_objfile);
2234 loc += nbytes;
2235 end = loc + locsize;
2236 stacki = 0;
2237 stack[stacki] = 0;
2238 isreg = 0;
2239 offreg = 0;
2240 optimized_out = 1;
2241 loc_value_size = TARGET_FT_LONG_SIZE (current_objfile);
2242 while (loc < end)
2243 {
2244 optimized_out = 0;
2245 loc_atom_code = target_to_host (loc, SIZEOF_LOC_ATOM_CODE, GET_UNSIGNED,
2246 current_objfile);
2247 loc += SIZEOF_LOC_ATOM_CODE;
2248 switch (loc_atom_code)
2249 {
2250 case 0:
2251 /* error */
2252 loc = end;
2253 break;
2254 case OP_REG:
2255 /* push register (number) */
2256 stack[++stacki]
2257 = DWARF_REG_TO_REGNUM (target_to_host (loc, loc_value_size,
2258 GET_UNSIGNED,
2259 current_objfile));
2260 loc += loc_value_size;
2261 isreg = 1;
2262 break;
2263 case OP_BASEREG:
2264 /* push value of register (number) */
2265 /* Actually, we compute the value as if register has 0, so the
2266 value ends up being the offset from that register. */
2267 offreg = 1;
2268 basereg = target_to_host (loc, loc_value_size, GET_UNSIGNED,
2269 current_objfile);
2270 loc += loc_value_size;
2271 stack[++stacki] = 0;
2272 break;
2273 case OP_ADDR:
2274 /* push address (relocated address) */
2275 stack[++stacki] = target_to_host (loc, loc_value_size,
2276 GET_UNSIGNED, current_objfile);
2277 loc += loc_value_size;
2278 break;
2279 case OP_CONST:
2280 /* push constant (number) FIXME: signed or unsigned! */
2281 stack[++stacki] = target_to_host (loc, loc_value_size,
2282 GET_SIGNED, current_objfile);
2283 loc += loc_value_size;
2284 break;
2285 case OP_DEREF2:
2286 /* pop, deref and push 2 bytes (as a long) */
2287 complain (&op_deref2, DIE_ID, DIE_NAME, stack[stacki]);
2288 break;
2289 case OP_DEREF4: /* pop, deref and push 4 bytes (as a long) */
2290 complain (&op_deref4, DIE_ID, DIE_NAME, stack[stacki]);
2291 break;
2292 case OP_ADD: /* pop top 2 items, add, push result */
2293 stack[stacki - 1] += stack[stacki];
2294 stacki--;
2295 break;
2296 }
2297 }
2298 return (stack[stacki]);
2299 }
2300
2301 /*
2302
2303 LOCAL FUNCTION
2304
2305 read_ofile_symtab -- build a full symtab entry from chunk of DIE's
2306
2307 SYNOPSIS
2308
2309 static void read_ofile_symtab (struct partial_symtab *pst)
2310
2311 DESCRIPTION
2312
2313 When expanding a partial symbol table entry to a full symbol table
2314 entry, this is the function that gets called to read in the symbols
2315 for the compilation unit. A pointer to the newly constructed symtab,
2316 which is now the new first one on the objfile's symtab list, is
2317 stashed in the partial symbol table entry.
2318 */
2319
2320 static void
2321 read_ofile_symtab (pst)
2322 struct partial_symtab *pst;
2323 {
2324 struct cleanup *back_to;
2325 unsigned long lnsize;
2326 file_ptr foffset;
2327 bfd *abfd;
2328 char lnsizedata[SIZEOF_LINETBL_LENGTH];
2329
2330 abfd = pst -> objfile -> obfd;
2331 current_objfile = pst -> objfile;
2332
2333 /* Allocate a buffer for the entire chunk of DIE's for this compilation
2334 unit, seek to the location in the file, and read in all the DIE's. */
2335
2336 diecount = 0;
2337 dbsize = DBLENGTH (pst);
2338 dbbase = xmalloc (dbsize);
2339 dbroff = DBROFF(pst);
2340 foffset = DBFOFF(pst) + dbroff;
2341 base_section_offsets = pst->section_offsets;
2342 baseaddr = ANOFFSET (pst->section_offsets, 0);
2343 if (bfd_seek (abfd, foffset, SEEK_SET) ||
2344 (bfd_read (dbbase, dbsize, 1, abfd) != dbsize))
2345 {
2346 free (dbbase);
2347 error ("can't read DWARF data");
2348 }
2349 back_to = make_cleanup (free, dbbase);
2350
2351 /* If there is a line number table associated with this compilation unit
2352 then read the size of this fragment in bytes, from the fragment itself.
2353 Allocate a buffer for the fragment and read it in for future
2354 processing. */
2355
2356 lnbase = NULL;
2357 if (LNFOFF (pst))
2358 {
2359 if (bfd_seek (abfd, LNFOFF (pst), SEEK_SET) ||
2360 (bfd_read ((PTR) lnsizedata, sizeof (lnsizedata), 1, abfd) !=
2361 sizeof (lnsizedata)))
2362 {
2363 error ("can't read DWARF line number table size");
2364 }
2365 lnsize = target_to_host (lnsizedata, SIZEOF_LINETBL_LENGTH,
2366 GET_UNSIGNED, pst -> objfile);
2367 lnbase = xmalloc (lnsize);
2368 if (bfd_seek (abfd, LNFOFF (pst), SEEK_SET) ||
2369 (bfd_read (lnbase, lnsize, 1, abfd) != lnsize))
2370 {
2371 free (lnbase);
2372 error ("can't read DWARF line numbers");
2373 }
2374 make_cleanup (free, lnbase);
2375 }
2376
2377 process_dies (dbbase, dbbase + dbsize, pst -> objfile);
2378 do_cleanups (back_to);
2379 current_objfile = NULL;
2380 pst -> symtab = pst -> objfile -> symtabs;
2381 }
2382
2383 /*
2384
2385 LOCAL FUNCTION
2386
2387 psymtab_to_symtab_1 -- do grunt work for building a full symtab entry
2388
2389 SYNOPSIS
2390
2391 static void psymtab_to_symtab_1 (struct partial_symtab *pst)
2392
2393 DESCRIPTION
2394
2395 Called once for each partial symbol table entry that needs to be
2396 expanded into a full symbol table entry.
2397
2398 */
2399
2400 static void
2401 psymtab_to_symtab_1 (pst)
2402 struct partial_symtab *pst;
2403 {
2404 int i;
2405 struct cleanup *old_chain;
2406
2407 if (pst != NULL)
2408 {
2409 if (pst->readin)
2410 {
2411 warning ("psymtab for %s already read in. Shouldn't happen.",
2412 pst -> filename);
2413 }
2414 else
2415 {
2416 /* Read in all partial symtabs on which this one is dependent */
2417 for (i = 0; i < pst -> number_of_dependencies; i++)
2418 {
2419 if (!pst -> dependencies[i] -> readin)
2420 {
2421 /* Inform about additional files that need to be read in. */
2422 if (info_verbose)
2423 {
2424 fputs_filtered (" ", gdb_stdout);
2425 wrap_here ("");
2426 fputs_filtered ("and ", gdb_stdout);
2427 wrap_here ("");
2428 printf_filtered ("%s...",
2429 pst -> dependencies[i] -> filename);
2430 wrap_here ("");
2431 gdb_flush (gdb_stdout); /* Flush output */
2432 }
2433 psymtab_to_symtab_1 (pst -> dependencies[i]);
2434 }
2435 }
2436 if (DBLENGTH (pst)) /* Otherwise it's a dummy */
2437 {
2438 buildsym_init ();
2439 old_chain = make_cleanup (really_free_pendings, 0);
2440 read_ofile_symtab (pst);
2441 if (info_verbose)
2442 {
2443 printf_filtered ("%d DIE's, sorting...", diecount);
2444 wrap_here ("");
2445 gdb_flush (gdb_stdout);
2446 }
2447 sort_symtab_syms (pst -> symtab);
2448 do_cleanups (old_chain);
2449 }
2450 pst -> readin = 1;
2451 }
2452 }
2453 }
2454
2455 /*
2456
2457 LOCAL FUNCTION
2458
2459 dwarf_psymtab_to_symtab -- build a full symtab entry from partial one
2460
2461 SYNOPSIS
2462
2463 static void dwarf_psymtab_to_symtab (struct partial_symtab *pst)
2464
2465 DESCRIPTION
2466
2467 This is the DWARF support entry point for building a full symbol
2468 table entry from a partial symbol table entry. We are passed a
2469 pointer to the partial symbol table entry that needs to be expanded.
2470
2471 */
2472
2473 static void
2474 dwarf_psymtab_to_symtab (pst)
2475 struct partial_symtab *pst;
2476 {
2477
2478 if (pst != NULL)
2479 {
2480 if (pst -> readin)
2481 {
2482 warning ("psymtab for %s already read in. Shouldn't happen.",
2483 pst -> filename);
2484 }
2485 else
2486 {
2487 if (DBLENGTH (pst) || pst -> number_of_dependencies)
2488 {
2489 /* Print the message now, before starting serious work, to avoid
2490 disconcerting pauses. */
2491 if (info_verbose)
2492 {
2493 printf_filtered ("Reading in symbols for %s...",
2494 pst -> filename);
2495 gdb_flush (gdb_stdout);
2496 }
2497
2498 psymtab_to_symtab_1 (pst);
2499
2500 #if 0 /* FIXME: Check to see what dbxread is doing here and see if
2501 we need to do an equivalent or is this something peculiar to
2502 stabs/a.out format.
2503 Match with global symbols. This only needs to be done once,
2504 after all of the symtabs and dependencies have been read in.
2505 */
2506 scan_file_globals (pst -> objfile);
2507 #endif
2508
2509 /* Finish up the verbose info message. */
2510 if (info_verbose)
2511 {
2512 printf_filtered ("done.\n");
2513 gdb_flush (gdb_stdout);
2514 }
2515 }
2516 }
2517 }
2518 }
2519
2520 /*
2521
2522 LOCAL FUNCTION
2523
2524 add_enum_psymbol -- add enumeration members to partial symbol table
2525
2526 DESCRIPTION
2527
2528 Given pointer to a DIE that is known to be for an enumeration,
2529 extract the symbolic names of the enumeration members and add
2530 partial symbols for them.
2531 */
2532
2533 static void
2534 add_enum_psymbol (dip, objfile)
2535 struct dieinfo *dip;
2536 struct objfile *objfile;
2537 {
2538 char *scan;
2539 char *listend;
2540 unsigned short blocksz;
2541 int nbytes;
2542
2543 if ((scan = dip -> at_element_list) != NULL)
2544 {
2545 if (dip -> short_element_list)
2546 {
2547 nbytes = attribute_size (AT_short_element_list);
2548 }
2549 else
2550 {
2551 nbytes = attribute_size (AT_element_list);
2552 }
2553 blocksz = target_to_host (scan, nbytes, GET_UNSIGNED, objfile);
2554 scan += nbytes;
2555 listend = scan + blocksz;
2556 while (scan < listend)
2557 {
2558 scan += TARGET_FT_LONG_SIZE (objfile);
2559 add_psymbol_to_list (scan, strlen (scan), VAR_NAMESPACE, LOC_CONST,
2560 &objfile -> static_psymbols, 0, 0, cu_language,
2561 objfile);
2562 scan += strlen (scan) + 1;
2563 }
2564 }
2565 }
2566
2567 /*
2568
2569 LOCAL FUNCTION
2570
2571 add_partial_symbol -- add symbol to partial symbol table
2572
2573 DESCRIPTION
2574
2575 Given a DIE, if it is one of the types that we want to
2576 add to a partial symbol table, finish filling in the die info
2577 and then add a partial symbol table entry for it.
2578
2579 NOTES
2580
2581 The caller must ensure that the DIE has a valid name attribute.
2582 */
2583
2584 static void
2585 add_partial_symbol (dip, objfile)
2586 struct dieinfo *dip;
2587 struct objfile *objfile;
2588 {
2589 switch (dip -> die_tag)
2590 {
2591 case TAG_global_subroutine:
2592 add_psymbol_to_list (dip -> at_name, strlen (dip -> at_name),
2593 VAR_NAMESPACE, LOC_BLOCK,
2594 &objfile -> global_psymbols,
2595 0, dip -> at_low_pc, cu_language, objfile);
2596 break;
2597 case TAG_global_variable:
2598 add_psymbol_to_list (dip -> at_name, strlen (dip -> at_name),
2599 VAR_NAMESPACE, LOC_STATIC,
2600 &objfile -> global_psymbols,
2601 0, 0, cu_language, objfile);
2602 break;
2603 case TAG_subroutine:
2604 add_psymbol_to_list (dip -> at_name, strlen (dip -> at_name),
2605 VAR_NAMESPACE, LOC_BLOCK,
2606 &objfile -> static_psymbols,
2607 0, dip -> at_low_pc, cu_language, objfile);
2608 break;
2609 case TAG_local_variable:
2610 add_psymbol_to_list (dip -> at_name, strlen (dip -> at_name),
2611 VAR_NAMESPACE, LOC_STATIC,
2612 &objfile -> static_psymbols,
2613 0, 0, cu_language, objfile);
2614 break;
2615 case TAG_typedef:
2616 add_psymbol_to_list (dip -> at_name, strlen (dip -> at_name),
2617 VAR_NAMESPACE, LOC_TYPEDEF,
2618 &objfile -> static_psymbols,
2619 0, 0, cu_language, objfile);
2620 break;
2621 case TAG_class_type:
2622 case TAG_structure_type:
2623 case TAG_union_type:
2624 case TAG_enumeration_type:
2625 /* Do not add opaque aggregate definitions to the psymtab. */
2626 if (!dip -> has_at_byte_size)
2627 break;
2628 add_psymbol_to_list (dip -> at_name, strlen (dip -> at_name),
2629 STRUCT_NAMESPACE, LOC_TYPEDEF,
2630 &objfile -> static_psymbols,
2631 0, 0, cu_language, objfile);
2632 if (cu_language == language_cplus)
2633 {
2634 /* For C++, these implicitly act as typedefs as well. */
2635 add_psymbol_to_list (dip -> at_name, strlen (dip -> at_name),
2636 VAR_NAMESPACE, LOC_TYPEDEF,
2637 &objfile -> static_psymbols,
2638 0, 0, cu_language, objfile);
2639 }
2640 break;
2641 }
2642 }
2643
2644 /*
2645
2646 LOCAL FUNCTION
2647
2648 scan_partial_symbols -- scan DIE's within a single compilation unit
2649
2650 DESCRIPTION
2651
2652 Process the DIE's within a single compilation unit, looking for
2653 interesting DIE's that contribute to the partial symbol table entry
2654 for this compilation unit.
2655
2656 NOTES
2657
2658 There are some DIE's that may appear both at file scope and within
2659 the scope of a function. We are only interested in the ones at file
2660 scope, and the only way to tell them apart is to keep track of the
2661 scope. For example, consider the test case:
2662
2663 static int i;
2664 main () { int j; }
2665
2666 for which the relevant DWARF segment has the structure:
2667
2668 0x51:
2669 0x23 global subrtn sibling 0x9b
2670 name main
2671 fund_type FT_integer
2672 low_pc 0x800004cc
2673 high_pc 0x800004d4
2674
2675 0x74:
2676 0x23 local var sibling 0x97
2677 name j
2678 fund_type FT_integer
2679 location OP_BASEREG 0xe
2680 OP_CONST 0xfffffffc
2681 OP_ADD
2682 0x97:
2683 0x4
2684
2685 0x9b:
2686 0x1d local var sibling 0xb8
2687 name i
2688 fund_type FT_integer
2689 location OP_ADDR 0x800025dc
2690
2691 0xb8:
2692 0x4
2693
2694 We want to include the symbol 'i' in the partial symbol table, but
2695 not the symbol 'j'. In essence, we want to skip all the dies within
2696 the scope of a TAG_global_subroutine DIE.
2697
2698 Don't attempt to add anonymous structures or unions since they have
2699 no name. Anonymous enumerations however are processed, because we
2700 want to extract their member names (the check for a tag name is
2701 done later).
2702
2703 Also, for variables and subroutines, check that this is the place
2704 where the actual definition occurs, rather than just a reference
2705 to an external.
2706 */
2707
2708 static void
2709 scan_partial_symbols (thisdie, enddie, objfile)
2710 char *thisdie;
2711 char *enddie;
2712 struct objfile *objfile;
2713 {
2714 char *nextdie;
2715 char *temp;
2716 struct dieinfo di;
2717
2718 while (thisdie < enddie)
2719 {
2720 basicdieinfo (&di, thisdie, objfile);
2721 if (di.die_length < SIZEOF_DIE_LENGTH)
2722 {
2723 break;
2724 }
2725 else
2726 {
2727 nextdie = thisdie + di.die_length;
2728 /* To avoid getting complete die information for every die, we
2729 only do it (below) for the cases we are interested in. */
2730 switch (di.die_tag)
2731 {
2732 case TAG_global_subroutine:
2733 case TAG_subroutine:
2734 completedieinfo (&di, objfile);
2735 if (di.at_name && (di.has_at_low_pc || di.at_location))
2736 {
2737 add_partial_symbol (&di, objfile);
2738 /* If there is a sibling attribute, adjust the nextdie
2739 pointer to skip the entire scope of the subroutine.
2740 Apply some sanity checking to make sure we don't
2741 overrun or underrun the range of remaining DIE's */
2742 if (di.at_sibling != 0)
2743 {
2744 temp = dbbase + di.at_sibling - dbroff;
2745 if ((temp < thisdie) || (temp >= enddie))
2746 {
2747 complain (&bad_die_ref, DIE_ID, DIE_NAME,
2748 di.at_sibling);
2749 }
2750 else
2751 {
2752 nextdie = temp;
2753 }
2754 }
2755 }
2756 break;
2757 case TAG_global_variable:
2758 case TAG_local_variable:
2759 completedieinfo (&di, objfile);
2760 if (di.at_name && (di.has_at_low_pc || di.at_location))
2761 {
2762 add_partial_symbol (&di, objfile);
2763 }
2764 break;
2765 case TAG_typedef:
2766 case TAG_class_type:
2767 case TAG_structure_type:
2768 case TAG_union_type:
2769 completedieinfo (&di, objfile);
2770 if (di.at_name)
2771 {
2772 add_partial_symbol (&di, objfile);
2773 }
2774 break;
2775 case TAG_enumeration_type:
2776 completedieinfo (&di, objfile);
2777 if (di.at_name)
2778 {
2779 add_partial_symbol (&di, objfile);
2780 }
2781 add_enum_psymbol (&di, objfile);
2782 break;
2783 }
2784 }
2785 thisdie = nextdie;
2786 }
2787 }
2788
2789 /*
2790
2791 LOCAL FUNCTION
2792
2793 scan_compilation_units -- build a psymtab entry for each compilation
2794
2795 DESCRIPTION
2796
2797 This is the top level dwarf parsing routine for building partial
2798 symbol tables.
2799
2800 It scans from the beginning of the DWARF table looking for the first
2801 TAG_compile_unit DIE, and then follows the sibling chain to locate
2802 each additional TAG_compile_unit DIE.
2803
2804 For each TAG_compile_unit DIE it creates a partial symtab structure,
2805 calls a subordinate routine to collect all the compilation unit's
2806 global DIE's, file scope DIEs, typedef DIEs, etc, and then links the
2807 new partial symtab structure into the partial symbol table. It also
2808 records the appropriate information in the partial symbol table entry
2809 to allow the chunk of DIE's and line number table for this compilation
2810 unit to be located and re-read later, to generate a complete symbol
2811 table entry for the compilation unit.
2812
2813 Thus it effectively partitions up a chunk of DIE's for multiple
2814 compilation units into smaller DIE chunks and line number tables,
2815 and associates them with a partial symbol table entry.
2816
2817 NOTES
2818
2819 If any compilation unit has no line number table associated with
2820 it for some reason (a missing at_stmt_list attribute, rather than
2821 just one with a value of zero, which is valid) then we ensure that
2822 the recorded file offset is zero so that the routine which later
2823 reads line number table fragments knows that there is no fragment
2824 to read.
2825
2826 RETURNS
2827
2828 Returns no value.
2829
2830 */
2831
2832 static void
2833 scan_compilation_units (thisdie, enddie, dbfoff, lnoffset, objfile)
2834 char *thisdie;
2835 char *enddie;
2836 file_ptr dbfoff;
2837 file_ptr lnoffset;
2838 struct objfile *objfile;
2839 {
2840 char *nextdie;
2841 struct dieinfo di;
2842 struct partial_symtab *pst;
2843 int culength;
2844 int curoff;
2845 file_ptr curlnoffset;
2846
2847 while (thisdie < enddie)
2848 {
2849 basicdieinfo (&di, thisdie, objfile);
2850 if (di.die_length < SIZEOF_DIE_LENGTH)
2851 {
2852 break;
2853 }
2854 else if (di.die_tag != TAG_compile_unit)
2855 {
2856 nextdie = thisdie + di.die_length;
2857 }
2858 else
2859 {
2860 completedieinfo (&di, objfile);
2861 set_cu_language (&di);
2862 if (di.at_sibling != 0)
2863 {
2864 nextdie = dbbase + di.at_sibling - dbroff;
2865 }
2866 else
2867 {
2868 nextdie = thisdie + di.die_length;
2869 }
2870 curoff = thisdie - dbbase;
2871 culength = nextdie - thisdie;
2872 curlnoffset = di.has_at_stmt_list ? lnoffset + di.at_stmt_list : 0;
2873
2874 /* First allocate a new partial symbol table structure */
2875
2876 pst = start_psymtab_common (objfile, base_section_offsets,
2877 di.at_name, di.at_low_pc,
2878 objfile -> global_psymbols.next,
2879 objfile -> static_psymbols.next);
2880
2881 pst -> texthigh = di.at_high_pc;
2882 pst -> read_symtab_private = (char *)
2883 obstack_alloc (&objfile -> psymbol_obstack,
2884 sizeof (struct dwfinfo));
2885 DBFOFF (pst) = dbfoff;
2886 DBROFF (pst) = curoff;
2887 DBLENGTH (pst) = culength;
2888 LNFOFF (pst) = curlnoffset;
2889 pst -> read_symtab = dwarf_psymtab_to_symtab;
2890
2891 /* Now look for partial symbols */
2892
2893 scan_partial_symbols (thisdie + di.die_length, nextdie, objfile);
2894
2895 pst -> n_global_syms = objfile -> global_psymbols.next -
2896 (objfile -> global_psymbols.list + pst -> globals_offset);
2897 pst -> n_static_syms = objfile -> static_psymbols.next -
2898 (objfile -> static_psymbols.list + pst -> statics_offset);
2899 sort_pst_symbols (pst);
2900 /* If there is already a psymtab or symtab for a file of this name,
2901 remove it. (If there is a symtab, more drastic things also
2902 happen.) This happens in VxWorks. */
2903 free_named_symtabs (pst -> filename);
2904 }
2905 thisdie = nextdie;
2906 }
2907 }
2908
2909 /*
2910
2911 LOCAL FUNCTION
2912
2913 new_symbol -- make a symbol table entry for a new symbol
2914
2915 SYNOPSIS
2916
2917 static struct symbol *new_symbol (struct dieinfo *dip,
2918 struct objfile *objfile)
2919
2920 DESCRIPTION
2921
2922 Given a pointer to a DWARF information entry, figure out if we need
2923 to make a symbol table entry for it, and if so, create a new entry
2924 and return a pointer to it.
2925 */
2926
2927 static struct symbol *
2928 new_symbol (dip, objfile)
2929 struct dieinfo *dip;
2930 struct objfile *objfile;
2931 {
2932 struct symbol *sym = NULL;
2933
2934 if (dip -> at_name != NULL)
2935 {
2936 sym = (struct symbol *) obstack_alloc (&objfile -> symbol_obstack,
2937 sizeof (struct symbol));
2938 OBJSTAT (objfile, n_syms++);
2939 memset (sym, 0, sizeof (struct symbol));
2940 SYMBOL_NAME (sym) = create_name (dip -> at_name,
2941 &objfile->symbol_obstack);
2942 /* default assumptions */
2943 SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE;
2944 SYMBOL_CLASS (sym) = LOC_STATIC;
2945 SYMBOL_TYPE (sym) = decode_die_type (dip);
2946
2947 /* If this symbol is from a C++ compilation, then attempt to cache the
2948 demangled form for future reference. This is a typical time versus
2949 space tradeoff, that was decided in favor of time because it sped up
2950 C++ symbol lookups by a factor of about 20. */
2951
2952 SYMBOL_LANGUAGE (sym) = cu_language;
2953 SYMBOL_INIT_DEMANGLED_NAME (sym, &objfile -> symbol_obstack);
2954 switch (dip -> die_tag)
2955 {
2956 case TAG_label:
2957 SYMBOL_VALUE_ADDRESS (sym) = dip -> at_low_pc;
2958 SYMBOL_CLASS (sym) = LOC_LABEL;
2959 break;
2960 case TAG_global_subroutine:
2961 case TAG_subroutine:
2962 SYMBOL_VALUE_ADDRESS (sym) = dip -> at_low_pc;
2963 SYMBOL_TYPE (sym) = lookup_function_type (SYMBOL_TYPE (sym));
2964 SYMBOL_CLASS (sym) = LOC_BLOCK;
2965 if (dip -> die_tag == TAG_global_subroutine)
2966 {
2967 add_symbol_to_list (sym, &global_symbols);
2968 }
2969 else
2970 {
2971 add_symbol_to_list (sym, list_in_scope);
2972 }
2973 break;
2974 case TAG_global_variable:
2975 if (dip -> at_location != NULL)
2976 {
2977 SYMBOL_VALUE (sym) = locval (dip -> at_location);
2978 add_symbol_to_list (sym, &global_symbols);
2979 SYMBOL_CLASS (sym) = LOC_STATIC;
2980 SYMBOL_VALUE (sym) += baseaddr;
2981 }
2982 break;
2983 case TAG_local_variable:
2984 if (dip -> at_location != NULL)
2985 {
2986 SYMBOL_VALUE (sym) = locval (dip -> at_location);
2987 add_symbol_to_list (sym, list_in_scope);
2988 if (optimized_out)
2989 {
2990 SYMBOL_CLASS (sym) = LOC_OPTIMIZED_OUT;
2991 }
2992 else if (isreg)
2993 {
2994 SYMBOL_CLASS (sym) = LOC_REGISTER;
2995 }
2996 else if (offreg)
2997 {
2998 SYMBOL_CLASS (sym) = LOC_BASEREG;
2999 SYMBOL_BASEREG (sym) = basereg;
3000 }
3001 else
3002 {
3003 SYMBOL_CLASS (sym) = LOC_STATIC;
3004 SYMBOL_VALUE (sym) += baseaddr;
3005 }
3006 }
3007 break;
3008 case TAG_formal_parameter:
3009 if (dip -> at_location != NULL)
3010 {
3011 SYMBOL_VALUE (sym) = locval (dip -> at_location);
3012 }
3013 add_symbol_to_list (sym, list_in_scope);
3014 if (isreg)
3015 {
3016 SYMBOL_CLASS (sym) = LOC_REGPARM;
3017 }
3018 else if (offreg)
3019 {
3020 SYMBOL_CLASS (sym) = LOC_BASEREG_ARG;
3021 SYMBOL_BASEREG (sym) = basereg;
3022 }
3023 else
3024 {
3025 SYMBOL_CLASS (sym) = LOC_ARG;
3026 }
3027 break;
3028 case TAG_unspecified_parameters:
3029 /* From varargs functions; gdb doesn't seem to have any interest in
3030 this information, so just ignore it for now. (FIXME?) */
3031 break;
3032 case TAG_class_type:
3033 case TAG_structure_type:
3034 case TAG_union_type:
3035 case TAG_enumeration_type:
3036 SYMBOL_CLASS (sym) = LOC_TYPEDEF;
3037 SYMBOL_NAMESPACE (sym) = STRUCT_NAMESPACE;
3038 add_symbol_to_list (sym, list_in_scope);
3039 break;
3040 case TAG_typedef:
3041 SYMBOL_CLASS (sym) = LOC_TYPEDEF;
3042 SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE;
3043 add_symbol_to_list (sym, list_in_scope);
3044 break;
3045 default:
3046 /* Not a tag we recognize. Hopefully we aren't processing trash
3047 data, but since we must specifically ignore things we don't
3048 recognize, there is nothing else we should do at this point. */
3049 break;
3050 }
3051 }
3052 return (sym);
3053 }
3054
3055 /*
3056
3057 LOCAL FUNCTION
3058
3059 synthesize_typedef -- make a symbol table entry for a "fake" typedef
3060
3061 SYNOPSIS
3062
3063 static void synthesize_typedef (struct dieinfo *dip,
3064 struct objfile *objfile,
3065 struct type *type);
3066
3067 DESCRIPTION
3068
3069 Given a pointer to a DWARF information entry, synthesize a typedef
3070 for the name in the DIE, using the specified type.
3071
3072 This is used for C++ class, structs, unions, and enumerations to
3073 set up the tag name as a type.
3074
3075 */
3076
3077 static void
3078 synthesize_typedef (dip, objfile, type)
3079 struct dieinfo *dip;
3080 struct objfile *objfile;
3081 struct type *type;
3082 {
3083 struct symbol *sym = NULL;
3084
3085 if (dip -> at_name != NULL)
3086 {
3087 sym = (struct symbol *)
3088 obstack_alloc (&objfile -> symbol_obstack, sizeof (struct symbol));
3089 OBJSTAT (objfile, n_syms++);
3090 memset (sym, 0, sizeof (struct symbol));
3091 SYMBOL_NAME (sym) = create_name (dip -> at_name,
3092 &objfile->symbol_obstack);
3093 SYMBOL_INIT_LANGUAGE_SPECIFIC (sym, cu_language);
3094 SYMBOL_TYPE (sym) = type;
3095 SYMBOL_CLASS (sym) = LOC_TYPEDEF;
3096 SYMBOL_NAMESPACE (sym) = VAR_NAMESPACE;
3097 add_symbol_to_list (sym, list_in_scope);
3098 }
3099 }
3100
3101 /*
3102
3103 LOCAL FUNCTION
3104
3105 decode_mod_fund_type -- decode a modified fundamental type
3106
3107 SYNOPSIS
3108
3109 static struct type *decode_mod_fund_type (char *typedata)
3110
3111 DESCRIPTION
3112
3113 Decode a block of data containing a modified fundamental
3114 type specification. TYPEDATA is a pointer to the block,
3115 which starts with a length containing the size of the rest
3116 of the block. At the end of the block is a fundmental type
3117 code value that gives the fundamental type. Everything
3118 in between are type modifiers.
3119
3120 We simply compute the number of modifiers and call the general
3121 function decode_modified_type to do the actual work.
3122 */
3123
3124 static struct type *
3125 decode_mod_fund_type (typedata)
3126 char *typedata;
3127 {
3128 struct type *typep = NULL;
3129 unsigned short modcount;
3130 int nbytes;
3131
3132 /* Get the total size of the block, exclusive of the size itself */
3133
3134 nbytes = attribute_size (AT_mod_fund_type);
3135 modcount = target_to_host (typedata, nbytes, GET_UNSIGNED, current_objfile);
3136 typedata += nbytes;
3137
3138 /* Deduct the size of the fundamental type bytes at the end of the block. */
3139
3140 modcount -= attribute_size (AT_fund_type);
3141
3142 /* Now do the actual decoding */
3143
3144 typep = decode_modified_type (typedata, modcount, AT_mod_fund_type);
3145 return (typep);
3146 }
3147
3148 /*
3149
3150 LOCAL FUNCTION
3151
3152 decode_mod_u_d_type -- decode a modified user defined type
3153
3154 SYNOPSIS
3155
3156 static struct type *decode_mod_u_d_type (char *typedata)
3157
3158 DESCRIPTION
3159
3160 Decode a block of data containing a modified user defined
3161 type specification. TYPEDATA is a pointer to the block,
3162 which consists of a two byte length, containing the size
3163 of the rest of the block. At the end of the block is a
3164 four byte value that gives a reference to a user defined type.
3165 Everything in between are type modifiers.
3166
3167 We simply compute the number of modifiers and call the general
3168 function decode_modified_type to do the actual work.
3169 */
3170
3171 static struct type *
3172 decode_mod_u_d_type (typedata)
3173 char *typedata;
3174 {
3175 struct type *typep = NULL;
3176 unsigned short modcount;
3177 int nbytes;
3178
3179 /* Get the total size of the block, exclusive of the size itself */
3180
3181 nbytes = attribute_size (AT_mod_u_d_type);
3182 modcount = target_to_host (typedata, nbytes, GET_UNSIGNED, current_objfile);
3183 typedata += nbytes;
3184
3185 /* Deduct the size of the reference type bytes at the end of the block. */
3186
3187 modcount -= attribute_size (AT_user_def_type);
3188
3189 /* Now do the actual decoding */
3190
3191 typep = decode_modified_type (typedata, modcount, AT_mod_u_d_type);
3192 return (typep);
3193 }
3194
3195 /*
3196
3197 LOCAL FUNCTION
3198
3199 decode_modified_type -- decode modified user or fundamental type
3200
3201 SYNOPSIS
3202
3203 static struct type *decode_modified_type (char *modifiers,
3204 unsigned short modcount, int mtype)
3205
3206 DESCRIPTION
3207
3208 Decode a modified type, either a modified fundamental type or
3209 a modified user defined type. MODIFIERS is a pointer to the
3210 block of bytes that define MODCOUNT modifiers. Immediately
3211 following the last modifier is a short containing the fundamental
3212 type or a long containing the reference to the user defined
3213 type. Which one is determined by MTYPE, which is either
3214 AT_mod_fund_type or AT_mod_u_d_type to indicate what modified
3215 type we are generating.
3216
3217 We call ourself recursively to generate each modified type,`
3218 until MODCOUNT reaches zero, at which point we have consumed
3219 all the modifiers and generate either the fundamental type or
3220 user defined type. When the recursion unwinds, each modifier
3221 is applied in turn to generate the full modified type.
3222
3223 NOTES
3224
3225 If we find a modifier that we don't recognize, and it is not one
3226 of those reserved for application specific use, then we issue a
3227 warning and simply ignore the modifier.
3228
3229 BUGS
3230
3231 We currently ignore MOD_const and MOD_volatile. (FIXME)
3232
3233 */
3234
3235 static struct type *
3236 decode_modified_type (modifiers, modcount, mtype)
3237 char *modifiers;
3238 unsigned int modcount;
3239 int mtype;
3240 {
3241 struct type *typep = NULL;
3242 unsigned short fundtype;
3243 DIE_REF die_ref;
3244 char modifier;
3245 int nbytes;
3246
3247 if (modcount == 0)
3248 {
3249 switch (mtype)
3250 {
3251 case AT_mod_fund_type:
3252 nbytes = attribute_size (AT_fund_type);
3253 fundtype = target_to_host (modifiers, nbytes, GET_UNSIGNED,
3254 current_objfile);
3255 typep = decode_fund_type (fundtype);
3256 break;
3257 case AT_mod_u_d_type:
3258 nbytes = attribute_size (AT_user_def_type);
3259 die_ref = target_to_host (modifiers, nbytes, GET_UNSIGNED,
3260 current_objfile);
3261 if ((typep = lookup_utype (die_ref)) == NULL)
3262 {
3263 typep = alloc_utype (die_ref, NULL);
3264 }
3265 break;
3266 default:
3267 complain (&botched_modified_type, DIE_ID, DIE_NAME, mtype);
3268 typep = dwarf_fundamental_type (current_objfile, FT_INTEGER);
3269 break;
3270 }
3271 }
3272 else
3273 {
3274 modifier = *modifiers++;
3275 typep = decode_modified_type (modifiers, --modcount, mtype);
3276 switch (modifier)
3277 {
3278 case MOD_pointer_to:
3279 typep = lookup_pointer_type (typep);
3280 break;
3281 case MOD_reference_to:
3282 typep = lookup_reference_type (typep);
3283 break;
3284 case MOD_const:
3285 complain (&const_ignored, DIE_ID, DIE_NAME); /* FIXME */
3286 break;
3287 case MOD_volatile:
3288 complain (&volatile_ignored, DIE_ID, DIE_NAME); /* FIXME */
3289 break;
3290 default:
3291 if (!(MOD_lo_user <= (unsigned char) modifier
3292 && (unsigned char) modifier <= MOD_hi_user))
3293 {
3294 complain (&unknown_type_modifier, DIE_ID, DIE_NAME, modifier);
3295 }
3296 break;
3297 }
3298 }
3299 return (typep);
3300 }
3301
3302 /*
3303
3304 LOCAL FUNCTION
3305
3306 decode_fund_type -- translate basic DWARF type to gdb base type
3307
3308 DESCRIPTION
3309
3310 Given an integer that is one of the fundamental DWARF types,
3311 translate it to one of the basic internal gdb types and return
3312 a pointer to the appropriate gdb type (a "struct type *").
3313
3314 NOTES
3315
3316 For robustness, if we are asked to translate a fundamental
3317 type that we are unprepared to deal with, we return int so
3318 callers can always depend upon a valid type being returned,
3319 and so gdb may at least do something reasonable by default.
3320 If the type is not in the range of those types defined as
3321 application specific types, we also issue a warning.
3322 */
3323
3324 static struct type *
3325 decode_fund_type (fundtype)
3326 unsigned int fundtype;
3327 {
3328 struct type *typep = NULL;
3329
3330 switch (fundtype)
3331 {
3332
3333 case FT_void:
3334 typep = dwarf_fundamental_type (current_objfile, FT_VOID);
3335 break;
3336
3337 case FT_boolean: /* Was FT_set in AT&T version */
3338 typep = dwarf_fundamental_type (current_objfile, FT_BOOLEAN);
3339 break;
3340
3341 case FT_pointer: /* (void *) */
3342 typep = dwarf_fundamental_type (current_objfile, FT_VOID);
3343 typep = lookup_pointer_type (typep);
3344 break;
3345
3346 case FT_char:
3347 typep = dwarf_fundamental_type (current_objfile, FT_CHAR);
3348 break;
3349
3350 case FT_signed_char:
3351 typep = dwarf_fundamental_type (current_objfile, FT_SIGNED_CHAR);
3352 break;
3353
3354 case FT_unsigned_char:
3355 typep = dwarf_fundamental_type (current_objfile, FT_UNSIGNED_CHAR);
3356 break;
3357
3358 case FT_short:
3359 typep = dwarf_fundamental_type (current_objfile, FT_SHORT);
3360 break;
3361
3362 case FT_signed_short:
3363 typep = dwarf_fundamental_type (current_objfile, FT_SIGNED_SHORT);
3364 break;
3365
3366 case FT_unsigned_short:
3367 typep = dwarf_fundamental_type (current_objfile, FT_UNSIGNED_SHORT);
3368 break;
3369
3370 case FT_integer:
3371 typep = dwarf_fundamental_type (current_objfile, FT_INTEGER);
3372 break;
3373
3374 case FT_signed_integer:
3375 typep = dwarf_fundamental_type (current_objfile, FT_SIGNED_INTEGER);
3376 break;
3377
3378 case FT_unsigned_integer:
3379 typep = dwarf_fundamental_type (current_objfile, FT_UNSIGNED_INTEGER);
3380 break;
3381
3382 case FT_long:
3383 typep = dwarf_fundamental_type (current_objfile, FT_LONG);
3384 break;
3385
3386 case FT_signed_long:
3387 typep = dwarf_fundamental_type (current_objfile, FT_SIGNED_LONG);
3388 break;
3389
3390 case FT_unsigned_long:
3391 typep = dwarf_fundamental_type (current_objfile, FT_UNSIGNED_LONG);
3392 break;
3393
3394 case FT_long_long:
3395 typep = dwarf_fundamental_type (current_objfile, FT_LONG_LONG);
3396 break;
3397
3398 case FT_signed_long_long:
3399 typep = dwarf_fundamental_type (current_objfile, FT_SIGNED_LONG_LONG);
3400 break;
3401
3402 case FT_unsigned_long_long:
3403 typep = dwarf_fundamental_type (current_objfile, FT_UNSIGNED_LONG_LONG);
3404 break;
3405
3406 case FT_float:
3407 typep = dwarf_fundamental_type (current_objfile, FT_FLOAT);
3408 break;
3409
3410 case FT_dbl_prec_float:
3411 typep = dwarf_fundamental_type (current_objfile, FT_DBL_PREC_FLOAT);
3412 break;
3413
3414 case FT_ext_prec_float:
3415 typep = dwarf_fundamental_type (current_objfile, FT_EXT_PREC_FLOAT);
3416 break;
3417
3418 case FT_complex:
3419 typep = dwarf_fundamental_type (current_objfile, FT_COMPLEX);
3420 break;
3421
3422 case FT_dbl_prec_complex:
3423 typep = dwarf_fundamental_type (current_objfile, FT_DBL_PREC_COMPLEX);
3424 break;
3425
3426 case FT_ext_prec_complex:
3427 typep = dwarf_fundamental_type (current_objfile, FT_EXT_PREC_COMPLEX);
3428 break;
3429
3430 }
3431
3432 if (typep == NULL)
3433 {
3434 typep = dwarf_fundamental_type (current_objfile, FT_INTEGER);
3435 if (!(FT_lo_user <= fundtype && fundtype <= FT_hi_user))
3436 {
3437 complain (&unexpected_fund_type, DIE_ID, DIE_NAME, fundtype);
3438 }
3439 }
3440
3441 return (typep);
3442 }
3443
3444 /*
3445
3446 LOCAL FUNCTION
3447
3448 create_name -- allocate a fresh copy of a string on an obstack
3449
3450 DESCRIPTION
3451
3452 Given a pointer to a string and a pointer to an obstack, allocates
3453 a fresh copy of the string on the specified obstack.
3454
3455 */
3456
3457 static char *
3458 create_name (name, obstackp)
3459 char *name;
3460 struct obstack *obstackp;
3461 {
3462 int length;
3463 char *newname;
3464
3465 length = strlen (name) + 1;
3466 newname = (char *) obstack_alloc (obstackp, length);
3467 strcpy (newname, name);
3468 return (newname);
3469 }
3470
3471 /*
3472
3473 LOCAL FUNCTION
3474
3475 basicdieinfo -- extract the minimal die info from raw die data
3476
3477 SYNOPSIS
3478
3479 void basicdieinfo (char *diep, struct dieinfo *dip,
3480 struct objfile *objfile)
3481
3482 DESCRIPTION
3483
3484 Given a pointer to raw DIE data, and a pointer to an instance of a
3485 die info structure, this function extracts the basic information
3486 from the DIE data required to continue processing this DIE, along
3487 with some bookkeeping information about the DIE.
3488
3489 The information we absolutely must have includes the DIE tag,
3490 and the DIE length. If we need the sibling reference, then we
3491 will have to call completedieinfo() to process all the remaining
3492 DIE information.
3493
3494 Note that since there is no guarantee that the data is properly
3495 aligned in memory for the type of access required (indirection
3496 through anything other than a char pointer), and there is no
3497 guarantee that it is in the same byte order as the gdb host,
3498 we call a function which deals with both alignment and byte
3499 swapping issues. Possibly inefficient, but quite portable.
3500
3501 We also take care of some other basic things at this point, such
3502 as ensuring that the instance of the die info structure starts
3503 out completely zero'd and that curdie is initialized for use
3504 in error reporting if we have a problem with the current die.
3505
3506 NOTES
3507
3508 All DIE's must have at least a valid length, thus the minimum
3509 DIE size is SIZEOF_DIE_LENGTH. In order to have a valid tag, the
3510 DIE size must be at least SIZEOF_DIE_TAG larger, otherwise they
3511 are forced to be TAG_padding DIES.
3512
3513 Padding DIES must be at least SIZEOF_DIE_LENGTH in length, implying
3514 that if a padding DIE is used for alignment and the amount needed is
3515 less than SIZEOF_DIE_LENGTH, then the padding DIE has to be big
3516 enough to align to the next alignment boundry.
3517
3518 We do some basic sanity checking here, such as verifying that the
3519 length of the die would not cause it to overrun the recorded end of
3520 the buffer holding the DIE info. If we find a DIE that is either
3521 too small or too large, we force it's length to zero which should
3522 cause the caller to take appropriate action.
3523 */
3524
3525 static void
3526 basicdieinfo (dip, diep, objfile)
3527 struct dieinfo *dip;
3528 char *diep;
3529 struct objfile *objfile;
3530 {
3531 curdie = dip;
3532 memset (dip, 0, sizeof (struct dieinfo));
3533 dip -> die = diep;
3534 dip -> die_ref = dbroff + (diep - dbbase);
3535 dip -> die_length = target_to_host (diep, SIZEOF_DIE_LENGTH, GET_UNSIGNED,
3536 objfile);
3537 if ((dip -> die_length < SIZEOF_DIE_LENGTH) ||
3538 ((diep + dip -> die_length) > (dbbase + dbsize)))
3539 {
3540 complain (&malformed_die, DIE_ID, DIE_NAME, dip -> die_length);
3541 dip -> die_length = 0;
3542 }
3543 else if (dip -> die_length < (SIZEOF_DIE_LENGTH + SIZEOF_DIE_TAG))
3544 {
3545 dip -> die_tag = TAG_padding;
3546 }
3547 else
3548 {
3549 diep += SIZEOF_DIE_LENGTH;
3550 dip -> die_tag = target_to_host (diep, SIZEOF_DIE_TAG, GET_UNSIGNED,
3551 objfile);
3552 }
3553 }
3554
3555 /*
3556
3557 LOCAL FUNCTION
3558
3559 completedieinfo -- finish reading the information for a given DIE
3560
3561 SYNOPSIS
3562
3563 void completedieinfo (struct dieinfo *dip, struct objfile *objfile)
3564
3565 DESCRIPTION
3566
3567 Given a pointer to an already partially initialized die info structure,
3568 scan the raw DIE data and finish filling in the die info structure
3569 from the various attributes found.
3570
3571 Note that since there is no guarantee that the data is properly
3572 aligned in memory for the type of access required (indirection
3573 through anything other than a char pointer), and there is no
3574 guarantee that it is in the same byte order as the gdb host,
3575 we call a function which deals with both alignment and byte
3576 swapping issues. Possibly inefficient, but quite portable.
3577
3578 NOTES
3579
3580 Each time we are called, we increment the diecount variable, which
3581 keeps an approximate count of the number of dies processed for
3582 each compilation unit. This information is presented to the user
3583 if the info_verbose flag is set.
3584
3585 */
3586
3587 static void
3588 completedieinfo (dip, objfile)
3589 struct dieinfo *dip;
3590 struct objfile *objfile;
3591 {
3592 char *diep; /* Current pointer into raw DIE data */
3593 char *end; /* Terminate DIE scan here */
3594 unsigned short attr; /* Current attribute being scanned */
3595 unsigned short form; /* Form of the attribute */
3596 int nbytes; /* Size of next field to read */
3597
3598 diecount++;
3599 diep = dip -> die;
3600 end = diep + dip -> die_length;
3601 diep += SIZEOF_DIE_LENGTH + SIZEOF_DIE_TAG;
3602 while (diep < end)
3603 {
3604 attr = target_to_host (diep, SIZEOF_ATTRIBUTE, GET_UNSIGNED, objfile);
3605 diep += SIZEOF_ATTRIBUTE;
3606 if ((nbytes = attribute_size (attr)) == -1)
3607 {
3608 complain (&unknown_attribute_length, DIE_ID, DIE_NAME);
3609 diep = end;
3610 continue;
3611 }
3612 switch (attr)
3613 {
3614 case AT_fund_type:
3615 dip -> at_fund_type = target_to_host (diep, nbytes, GET_UNSIGNED,
3616 objfile);
3617 break;
3618 case AT_ordering:
3619 dip -> at_ordering = target_to_host (diep, nbytes, GET_UNSIGNED,
3620 objfile);
3621 break;
3622 case AT_bit_offset:
3623 dip -> at_bit_offset = target_to_host (diep, nbytes, GET_UNSIGNED,
3624 objfile);
3625 break;
3626 case AT_sibling:
3627 dip -> at_sibling = target_to_host (diep, nbytes, GET_UNSIGNED,
3628 objfile);
3629 break;
3630 case AT_stmt_list:
3631 dip -> at_stmt_list = target_to_host (diep, nbytes, GET_UNSIGNED,
3632 objfile);
3633 dip -> has_at_stmt_list = 1;
3634 break;
3635 case AT_low_pc:
3636 dip -> at_low_pc = target_to_host (diep, nbytes, GET_UNSIGNED,
3637 objfile);
3638 dip -> at_low_pc += baseaddr;
3639 dip -> has_at_low_pc = 1;
3640 break;
3641 case AT_high_pc:
3642 dip -> at_high_pc = target_to_host (diep, nbytes, GET_UNSIGNED,
3643 objfile);
3644 dip -> at_high_pc += baseaddr;
3645 break;
3646 case AT_language:
3647 dip -> at_language = target_to_host (diep, nbytes, GET_UNSIGNED,
3648 objfile);
3649 break;
3650 case AT_user_def_type:
3651 dip -> at_user_def_type = target_to_host (diep, nbytes,
3652 GET_UNSIGNED, objfile);
3653 break;
3654 case AT_byte_size:
3655 dip -> at_byte_size = target_to_host (diep, nbytes, GET_UNSIGNED,
3656 objfile);
3657 dip -> has_at_byte_size = 1;
3658 break;
3659 case AT_bit_size:
3660 dip -> at_bit_size = target_to_host (diep, nbytes, GET_UNSIGNED,
3661 objfile);
3662 break;
3663 case AT_member:
3664 dip -> at_member = target_to_host (diep, nbytes, GET_UNSIGNED,
3665 objfile);
3666 break;
3667 case AT_discr:
3668 dip -> at_discr = target_to_host (diep, nbytes, GET_UNSIGNED,
3669 objfile);
3670 break;
3671 case AT_location:
3672 dip -> at_location = diep;
3673 break;
3674 case AT_mod_fund_type:
3675 dip -> at_mod_fund_type = diep;
3676 break;
3677 case AT_subscr_data:
3678 dip -> at_subscr_data = diep;
3679 break;
3680 case AT_mod_u_d_type:
3681 dip -> at_mod_u_d_type = diep;
3682 break;
3683 case AT_element_list:
3684 dip -> at_element_list = diep;
3685 dip -> short_element_list = 0;
3686 break;
3687 case AT_short_element_list:
3688 dip -> at_element_list = diep;
3689 dip -> short_element_list = 1;
3690 break;
3691 case AT_discr_value:
3692 dip -> at_discr_value = diep;
3693 break;
3694 case AT_string_length:
3695 dip -> at_string_length = diep;
3696 break;
3697 case AT_name:
3698 dip -> at_name = diep;
3699 break;
3700 case AT_comp_dir:
3701 /* For now, ignore any "hostname:" portion, since gdb doesn't
3702 know how to deal with it. (FIXME). */
3703 dip -> at_comp_dir = strrchr (diep, ':');
3704 if (dip -> at_comp_dir != NULL)
3705 {
3706 dip -> at_comp_dir++;
3707 }
3708 else
3709 {
3710 dip -> at_comp_dir = diep;
3711 }
3712 break;
3713 case AT_producer:
3714 dip -> at_producer = diep;
3715 break;
3716 case AT_start_scope:
3717 dip -> at_start_scope = target_to_host (diep, nbytes, GET_UNSIGNED,
3718 objfile);
3719 break;
3720 case AT_stride_size:
3721 dip -> at_stride_size = target_to_host (diep, nbytes, GET_UNSIGNED,
3722 objfile);
3723 break;
3724 case AT_src_info:
3725 dip -> at_src_info = target_to_host (diep, nbytes, GET_UNSIGNED,
3726 objfile);
3727 break;
3728 case AT_prototyped:
3729 dip -> at_prototyped = diep;
3730 break;
3731 default:
3732 /* Found an attribute that we are unprepared to handle. However
3733 it is specifically one of the design goals of DWARF that
3734 consumers should ignore unknown attributes. As long as the
3735 form is one that we recognize (so we know how to skip it),
3736 we can just ignore the unknown attribute. */
3737 break;
3738 }
3739 form = FORM_FROM_ATTR (attr);
3740 switch (form)
3741 {
3742 case FORM_DATA2:
3743 diep += 2;
3744 break;
3745 case FORM_DATA4:
3746 case FORM_REF:
3747 diep += 4;
3748 break;
3749 case FORM_DATA8:
3750 diep += 8;
3751 break;
3752 case FORM_ADDR:
3753 diep += TARGET_FT_POINTER_SIZE (objfile);
3754 break;
3755 case FORM_BLOCK2:
3756 diep += 2 + target_to_host (diep, nbytes, GET_UNSIGNED, objfile);
3757 break;
3758 case FORM_BLOCK4:
3759 diep += 4 + target_to_host (diep, nbytes, GET_UNSIGNED, objfile);
3760 break;
3761 case FORM_STRING:
3762 diep += strlen (diep) + 1;
3763 break;
3764 default:
3765 complain (&unknown_attribute_form, DIE_ID, DIE_NAME, form);
3766 diep = end;
3767 break;
3768 }
3769 }
3770 }
3771
3772 /*
3773
3774 LOCAL FUNCTION
3775
3776 target_to_host -- swap in target data to host
3777
3778 SYNOPSIS
3779
3780 target_to_host (char *from, int nbytes, int signextend,
3781 struct objfile *objfile)
3782
3783 DESCRIPTION
3784
3785 Given pointer to data in target format in FROM, a byte count for
3786 the size of the data in NBYTES, a flag indicating whether or not
3787 the data is signed in SIGNEXTEND, and a pointer to the current
3788 objfile in OBJFILE, convert the data to host format and return
3789 the converted value.
3790
3791 NOTES
3792
3793 FIXME: If we read data that is known to be signed, and expect to
3794 use it as signed data, then we need to explicitly sign extend the
3795 result until the bfd library is able to do this for us.
3796
3797 FIXME: Would a 32 bit target ever need an 8 byte result?
3798
3799 */
3800
3801 static CORE_ADDR
3802 target_to_host (from, nbytes, signextend, objfile)
3803 char *from;
3804 int nbytes;
3805 int signextend; /* FIXME: Unused */
3806 struct objfile *objfile;
3807 {
3808 CORE_ADDR rtnval;
3809
3810 switch (nbytes)
3811 {
3812 case 8:
3813 rtnval = bfd_get_64 (objfile -> obfd, (bfd_byte *) from);
3814 break;
3815 case 4:
3816 rtnval = bfd_get_32 (objfile -> obfd, (bfd_byte *) from);
3817 break;
3818 case 2:
3819 rtnval = bfd_get_16 (objfile -> obfd, (bfd_byte *) from);
3820 break;
3821 case 1:
3822 rtnval = bfd_get_8 (objfile -> obfd, (bfd_byte *) from);
3823 break;
3824 default:
3825 complain (&no_bfd_get_N, DIE_ID, DIE_NAME, nbytes);
3826 rtnval = 0;
3827 break;
3828 }
3829 return (rtnval);
3830 }
3831
3832 /*
3833
3834 LOCAL FUNCTION
3835
3836 attribute_size -- compute size of data for a DWARF attribute
3837
3838 SYNOPSIS
3839
3840 static int attribute_size (unsigned int attr)
3841
3842 DESCRIPTION
3843
3844 Given a DWARF attribute in ATTR, compute the size of the first
3845 piece of data associated with this attribute and return that
3846 size.
3847
3848 Returns -1 for unrecognized attributes.
3849
3850 */
3851
3852 static int
3853 attribute_size (attr)
3854 unsigned int attr;
3855 {
3856 int nbytes; /* Size of next data for this attribute */
3857 unsigned short form; /* Form of the attribute */
3858
3859 form = FORM_FROM_ATTR (attr);
3860 switch (form)
3861 {
3862 case FORM_STRING: /* A variable length field is next */
3863 nbytes = 0;
3864 break;
3865 case FORM_DATA2: /* Next 2 byte field is the data itself */
3866 case FORM_BLOCK2: /* Next 2 byte field is a block length */
3867 nbytes = 2;
3868 break;
3869 case FORM_DATA4: /* Next 4 byte field is the data itself */
3870 case FORM_BLOCK4: /* Next 4 byte field is a block length */
3871 case FORM_REF: /* Next 4 byte field is a DIE offset */
3872 nbytes = 4;
3873 break;
3874 case FORM_DATA8: /* Next 8 byte field is the data itself */
3875 nbytes = 8;
3876 break;
3877 case FORM_ADDR: /* Next field size is target sizeof(void *) */
3878 nbytes = TARGET_FT_POINTER_SIZE (objfile);
3879 break;
3880 default:
3881 complain (&unknown_attribute_form, DIE_ID, DIE_NAME, form);
3882 nbytes = -1;
3883 break;
3884 }
3885 return (nbytes);
3886 }
This page took 0.107479 seconds and 4 git commands to generate.