1 /* Build symbol tables in GDB's internal format.
2 Copyright 1986, 1987, 1988, 1989, 1990, 1991 Free Software Foundation, Inc.
4 This file is part of GDB.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
20 /* This module provides subroutines used for creating and adding to
21 the symbol table. These routines are called from various symbol-
22 file-reading routines.
24 They originated in dbxread.c of gdb-4.2, and were split out to
25 make xcoffread.c more maintainable by sharing code. */
31 #include "breakpoint.h"
32 #include "gdbcore.h" /* for bfd stuff for symfile.h */
33 #include "symfile.h" /* Needed for "struct complaint" */
34 #include "aout/stab_gnu.h" /* We always use GNU stabs, not native */
38 /* Ask buildsym.h to define the vars it normally declares `extern'. */
40 #include "buildsym.h" /* Our own declarations */
44 extern double atof ();
46 /* Things we export from outside, and probably shouldn't. FIXME. */
47 extern void new_object_header_files ();
48 extern char *next_symbol_text ();
49 extern int hashname ();
50 extern void patch_block_stabs (); /* AIX xcoffread.c */
51 extern struct type
*builtin_type (); /* AIX xcoffread.c */
54 static void cleanup_undefined_types ();
55 static void fix_common_block ();
57 static const char vptr_name
[] = { '_','v','p','t','r',CPLUS_MARKER
,'\0' };
58 static const char vb_name
[] = { '_','v','b',CPLUS_MARKER
,'\0' };
60 /* Define this as 1 if a pcc declaration of a char or short argument
61 gives the correct address. Otherwise assume pcc gives the
62 address of the corresponding int, which is not the same on a
63 big-endian machine. */
65 #ifndef BELIEVE_PCC_PROMOTION
66 #define BELIEVE_PCC_PROMOTION 0
69 /* During some calls to read_type (and thus to read_range_type), this
70 contains the name of the type being defined. Range types are only
71 used in C as basic types. We use the name to distinguish the otherwise
72 identical basic types "int" and "long" and their unsigned versions.
73 FIXME, this should disappear with better type management. */
75 static char *long_kludge_name
;
77 /* Make a list of forward references which haven't been defined. */
78 static struct type
**undef_types
;
79 static int undef_types_allocated
, undef_types_length
;
81 /* Initial sizes of data structures. These are realloc'd larger if needed,
82 and realloc'd down to the size actually used, when completed. */
84 #define INITIAL_CONTEXT_STACK_SIZE 10
85 #define INITIAL_TYPE_VECTOR_LENGTH 160
86 #define INITIAL_LINE_VECTOR_LENGTH 1000
88 /* Complaints about the symbols we have encountered. */
90 struct complaint innerblock_complaint
=
91 {"inner block not inside outer block in %s", 0, 0};
93 struct complaint blockvector_complaint
=
94 {"block at %x out of order", 0, 0};
97 struct complaint dbx_class_complaint
=
98 {"encountered DBX-style class variable debugging information.\n\
99 You seem to have compiled your program with \
100 \"g++ -g0\" instead of \"g++ -g\".\n\
101 Therefore GDB will not know about your class variables", 0, 0};
104 struct complaint invalid_cpp_abbrev_complaint
=
105 {"invalid C++ abbreviation `%s'", 0, 0};
107 struct complaint invalid_cpp_type_complaint
=
108 {"C++ abbreviated type name unknown at symtab pos %d", 0, 0};
110 struct complaint member_fn_complaint
=
111 {"member function type missing, got '%c'", 0, 0};
113 struct complaint const_vol_complaint
=
114 {"const/volatile indicator missing, got '%c'", 0, 0};
116 struct complaint error_type_complaint
=
117 {"debug info mismatch between compiler and debugger", 0, 0};
119 struct complaint invalid_member_complaint
=
120 {"invalid (minimal) member type data format at symtab pos %d.", 0, 0};
122 struct complaint range_type_base_complaint
=
123 {"base type %d of range type is not defined", 0, 0};
125 /* Look up a dbx type-number pair. Return the address of the slot
126 where the type for that number-pair is stored.
127 The number-pair is in TYPENUMS.
129 This can be used for finding the type associated with that pair
130 or for associating a new type with the pair. */
133 dbx_lookup_type (typenums
)
136 register int filenum
= typenums
[0], index
= typenums
[1];
139 if (filenum
< 0 || filenum
>= n_this_object_header_files
)
140 error ("Invalid symbol data: type number (%d,%d) out of range at symtab pos %d.",
141 filenum
, index
, symnum
);
145 /* Type is defined outside of header files.
146 Find it in this object file's type vector. */
147 if (index
>= type_vector_length
)
149 old_len
= type_vector_length
;
151 type_vector_length
= INITIAL_TYPE_VECTOR_LENGTH
;
152 type_vector
= (struct type
**)
153 malloc (type_vector_length
* sizeof (struct type
*));
155 while (index
>= type_vector_length
)
156 type_vector_length
*= 2;
157 type_vector
= (struct type
**)
158 xrealloc (type_vector
,
159 (type_vector_length
* sizeof (struct type
*)));
160 bzero (&type_vector
[old_len
],
161 (type_vector_length
- old_len
) * sizeof (struct type
*));
163 return &type_vector
[index
];
167 register int real_filenum
= this_object_header_files
[filenum
];
168 register struct header_file
*f
;
171 if (real_filenum
>= n_header_files
)
174 f
= &header_files
[real_filenum
];
176 f_orig_length
= f
->length
;
177 if (index
>= f_orig_length
)
179 while (index
>= f
->length
)
181 f
->vector
= (struct type
**)
182 xrealloc (f
->vector
, f
->length
* sizeof (struct type
*));
183 bzero (&f
->vector
[f_orig_length
],
184 (f
->length
- f_orig_length
) * sizeof (struct type
*));
186 return &f
->vector
[index
];
190 /* Create a type object. Occaisionally used when you need a type
191 which isn't going to be given a type number. */
196 register struct type
*type
=
197 (struct type
*) obstack_alloc (symbol_obstack
, sizeof (struct type
));
199 bzero (type
, sizeof (struct type
));
200 TYPE_VPTR_FIELDNO (type
) = -1;
201 TYPE_VPTR_BASETYPE (type
) = 0;
205 /* Make sure there is a type allocated for type numbers TYPENUMS
206 and return the type object.
207 This can create an empty (zeroed) type object.
208 TYPENUMS may be (-1, -1) to return a new type object that is not
209 put into the type vector, and so may not be referred to by number. */
212 dbx_alloc_type (typenums
)
215 register struct type
**type_addr
;
216 register struct type
*type
;
218 if (typenums
[0] != -1)
220 type_addr
= dbx_lookup_type (typenums
);
229 /* If we are referring to a type not known at all yet,
230 allocate an empty type for it.
231 We will fill it in later if we find out how. */
234 type
= dbx_create_type ();
242 /* maintain the lists of symbols and blocks */
244 /* Add a symbol to one of the lists of symbols. */
246 add_symbol_to_list (symbol
, listhead
)
247 struct symbol
*symbol
;
248 struct pending
**listhead
;
250 /* We keep PENDINGSIZE symbols in each link of the list.
251 If we don't have a link with room in it, add a new link. */
252 if (*listhead
== 0 || (*listhead
)->nsyms
== PENDINGSIZE
)
254 register struct pending
*link
;
257 link
= free_pendings
;
258 free_pendings
= link
->next
;
261 link
= (struct pending
*) xmalloc (sizeof (struct pending
));
263 link
->next
= *listhead
;
268 (*listhead
)->symbol
[(*listhead
)->nsyms
++] = symbol
;
271 /* Find a symbol on a pending list. */
273 find_symbol_in_list (list
, name
, length
)
274 struct pending
*list
;
281 for (j
= list
->nsyms
; --j
>= 0; ) {
282 char *pp
= SYMBOL_NAME (list
->symbol
[j
]);
283 if (*pp
== *name
&& strncmp (pp
, name
, length
) == 0 && pp
[length
] == '\0')
284 return list
->symbol
[j
];
291 /* At end of reading syms, or in case of quit,
292 really free as many `struct pending's as we can easily find. */
296 really_free_pendings (foo
)
299 struct pending
*next
, *next1
;
301 struct pending_block
*bnext
, *bnext1
;
304 for (next
= free_pendings
; next
; next
= next1
)
311 #if 0 /* Now we make the links in the symbol_obstack, so don't free them. */
312 for (bnext
= pending_blocks
; bnext
; bnext
= bnext1
)
314 bnext1
= bnext
->next
;
320 for (next
= file_symbols
; next
; next
= next1
)
327 for (next
= global_symbols
; next
; next
= next1
)
335 /* Take one of the lists of symbols and make a block from it.
336 Keep the order the symbols have in the list (reversed from the input file).
337 Put the block on the list of pending blocks. */
340 finish_block (symbol
, listhead
, old_blocks
, start
, end
)
341 struct symbol
*symbol
;
342 struct pending
**listhead
;
343 struct pending_block
*old_blocks
;
344 CORE_ADDR start
, end
;
346 register struct pending
*next
, *next1
;
347 register struct block
*block
;
348 register struct pending_block
*pblock
;
349 struct pending_block
*opblock
;
352 /* Count the length of the list of symbols. */
354 for (next
= *listhead
, i
= 0;
356 i
+= next
->nsyms
, next
= next
->next
)
359 block
= (struct block
*) obstack_alloc (symbol_obstack
,
360 (sizeof (struct block
) + ((i
- 1) * sizeof (struct symbol
*))));
362 /* Copy the symbols into the block. */
364 BLOCK_NSYMS (block
) = i
;
365 for (next
= *listhead
; next
; next
= next
->next
)
368 for (j
= next
->nsyms
- 1; j
>= 0; j
--)
369 BLOCK_SYM (block
, --i
) = next
->symbol
[j
];
372 BLOCK_START (block
) = start
;
373 BLOCK_END (block
) = end
;
374 BLOCK_SUPERBLOCK (block
) = 0; /* Filled in when containing block is made */
375 BLOCK_GCC_COMPILED (block
) = processing_gcc_compilation
;
377 /* Put the block in as the value of the symbol that names it. */
381 SYMBOL_BLOCK_VALUE (symbol
) = block
;
382 BLOCK_FUNCTION (block
) = symbol
;
385 BLOCK_FUNCTION (block
) = 0;
387 /* Now "free" the links of the list, and empty the list. */
389 for (next
= *listhead
; next
; next
= next1
)
392 next
->next
= free_pendings
;
393 free_pendings
= next
;
397 /* Install this block as the superblock
398 of all blocks made since the start of this scope
399 that don't have superblocks yet. */
402 for (pblock
= pending_blocks
; pblock
!= old_blocks
; pblock
= pblock
->next
)
404 if (BLOCK_SUPERBLOCK (pblock
->block
) == 0) {
406 /* Check to be sure the blocks are nested as we receive them.
407 If the compiler/assembler/linker work, this just burns a small
409 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
)
410 || BLOCK_END (pblock
->block
) > BLOCK_END (block
)) {
411 complain(&innerblock_complaint
, symbol
? SYMBOL_NAME (symbol
):
413 BLOCK_START (pblock
->block
) = BLOCK_START (block
);
414 BLOCK_END (pblock
->block
) = BLOCK_END (block
);
417 BLOCK_SUPERBLOCK (pblock
->block
) = block
;
422 /* Record this block on the list of all blocks in the file.
423 Put it after opblock, or at the beginning if opblock is 0.
424 This puts the block in the list after all its subblocks. */
426 /* Allocate in the symbol_obstack to save time.
427 It wastes a little space. */
428 pblock
= (struct pending_block
*)
429 obstack_alloc (symbol_obstack
,
430 sizeof (struct pending_block
));
431 pblock
->block
= block
;
434 pblock
->next
= opblock
->next
;
435 opblock
->next
= pblock
;
439 pblock
->next
= pending_blocks
;
440 pending_blocks
= pblock
;
447 register struct pending_block
*next
;
448 register struct blockvector
*blockvector
;
451 /* Count the length of the list of blocks. */
453 for (next
= pending_blocks
, i
= 0; next
; next
= next
->next
, i
++);
455 blockvector
= (struct blockvector
*)
456 obstack_alloc (symbol_obstack
,
457 (sizeof (struct blockvector
)
458 + (i
- 1) * sizeof (struct block
*)));
460 /* Copy the blocks into the blockvector.
461 This is done in reverse order, which happens to put
462 the blocks into the proper order (ascending starting address).
463 finish_block has hair to insert each block into the list
464 after its subblocks in order to make sure this is true. */
466 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
467 for (next
= pending_blocks
; next
; next
= next
->next
) {
468 BLOCKVECTOR_BLOCK (blockvector
, --i
) = next
->block
;
471 #if 0 /* Now we make the links in the obstack, so don't free them. */
472 /* Now free the links of the list, and empty the list. */
474 for (next
= pending_blocks
; next
; next
= next1
)
482 #if 1 /* FIXME, shut this off after a while to speed up symbol reading. */
483 /* Some compilers output blocks in the wrong order, but we depend
484 on their being in the right order so we can binary search.
485 Check the order and moan about it. FIXME. */
486 if (BLOCKVECTOR_NBLOCKS (blockvector
) > 1)
487 for (i
= 1; i
< BLOCKVECTOR_NBLOCKS (blockvector
); i
++) {
488 if (BLOCK_START(BLOCKVECTOR_BLOCK (blockvector
, i
-1))
489 > BLOCK_START(BLOCKVECTOR_BLOCK (blockvector
, i
))) {
490 complain (&blockvector_complaint
,
491 BLOCK_START(BLOCKVECTOR_BLOCK (blockvector
, i
)));
499 /* Start recording information about source code that came from an included
500 (or otherwise merged-in) source file with a different name. */
503 start_subfile (name
, dirname
)
507 register struct subfile
*subfile
;
509 /* See if this subfile is already known as a subfile of the
510 current main source file. */
512 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
514 if (!strcmp (subfile
->name
, name
))
516 current_subfile
= subfile
;
521 /* This subfile is not known. Add an entry for it.
522 Make an entry for this subfile in the list of all subfiles
523 of the current main source file. */
525 subfile
= (struct subfile
*) xmalloc (sizeof (struct subfile
));
526 subfile
->next
= subfiles
;
528 current_subfile
= subfile
;
530 /* Save its name and compilation directory name */
531 subfile
->name
= obsavestring (name
, strlen (name
));
533 subfile
->dirname
= NULL
;
535 subfile
->dirname
= obsavestring (dirname
, strlen (dirname
));
537 /* Initialize line-number recording for this subfile. */
538 subfile
->line_vector
= 0;
541 /* Handle the N_BINCL and N_EINCL symbol types
542 that act like N_SOL for switching source files
543 (different subfiles, as we call them) within one object file,
544 but using a stack rather than in an arbitrary order. */
549 register struct subfile_stack
*tem
550 = (struct subfile_stack
*) xmalloc (sizeof (struct subfile_stack
));
552 tem
->next
= subfile_stack
;
554 if (current_subfile
== 0 || current_subfile
->name
== 0)
556 tem
->name
= current_subfile
->name
;
557 tem
->prev_index
= header_file_prev_index
;
564 register struct subfile_stack
*link
= subfile_stack
;
570 subfile_stack
= link
->next
;
571 header_file_prev_index
= link
->prev_index
;
577 /* Manage the vector of line numbers for each subfile. */
580 record_line (subfile
, line
, pc
)
581 register struct subfile
*subfile
;
585 struct linetable_entry
*e
;
586 /* Ignore the dummy line number in libg.o */
591 /* Make sure line vector exists and is big enough. */
592 if (!subfile
->line_vector
) {
593 subfile
->line_vector_length
= INITIAL_LINE_VECTOR_LENGTH
;
594 subfile
->line_vector
= (struct linetable
*)
595 xmalloc (sizeof (struct linetable
)
596 + subfile
->line_vector_length
* sizeof (struct linetable_entry
));
597 subfile
->line_vector
->nitems
= 0;
600 if (subfile
->line_vector
->nitems
+ 1 >= subfile
->line_vector_length
)
602 subfile
->line_vector_length
*= 2;
603 subfile
->line_vector
= (struct linetable
*)
604 xrealloc (subfile
->line_vector
, (sizeof (struct linetable
)
605 + subfile
->line_vector_length
* sizeof (struct linetable_entry
)));
608 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
++;
609 e
->line
= line
; e
->pc
= pc
;
613 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
617 compare_line_numbers (ln1
, ln2
)
618 struct linetable_entry
*ln1
, *ln2
;
620 return ln1
->line
- ln2
->line
;
623 /* Start a new symtab for a new source file.
624 This is called when a dbx symbol of type N_SO is seen;
625 it indicates the start of data for one original source file. */
628 start_symtab (name
, dirname
, start_addr
)
631 CORE_ADDR start_addr
;
634 last_source_file
= name
;
635 last_source_start_addr
= start_addr
;
638 global_stabs
= 0; /* AIX COFF */
639 file_stabs
= 0; /* AIX COFF */
642 /* Context stack is initially empty. Allocate first one with room for
643 10 levels; reuse it forever afterward. */
644 if (context_stack
== 0) {
645 context_stack_size
= INITIAL_CONTEXT_STACK_SIZE
;
646 context_stack
= (struct context_stack
*)
647 xmalloc (context_stack_size
* sizeof (struct context_stack
));
649 context_stack_depth
= 0;
651 new_object_header_files ();
653 type_vector_length
= 0;
654 type_vector
= (struct type
**) 0;
656 /* Initialize the list of sub source files with one entry
657 for this file (the top-level source file). */
661 start_subfile (name
, dirname
);
664 /* Finish the symbol definitions for one main source file,
665 close off all the lexical contexts for that file
666 (creating struct block's for them), then make the struct symtab
667 for that file and put it in the list of all such.
669 END_ADDR is the address of the end of the file's text. */
672 end_symtab (end_addr
, sort_pending
, sort_linevec
, objfile
)
676 struct objfile
*objfile
;
678 register struct symtab
*symtab
;
679 register struct blockvector
*blockvector
;
680 register struct subfile
*subfile
;
681 struct subfile
*nextsub
;
683 /* Finish the lexical context of the last function in the file;
684 pop the context stack. */
686 if (context_stack_depth
> 0)
688 register struct context_stack
*cstk
;
689 context_stack_depth
--;
690 cstk
= &context_stack
[context_stack_depth
];
691 /* Make a block for the local symbols within. */
692 finish_block (cstk
->name
, &local_symbols
, cstk
->old_blocks
,
693 cstk
->start_addr
, end_addr
);
695 /* Debug: if context stack still has something in it, we are in
697 if (context_stack_depth
> 0)
701 /* It is unfortunate that in aixcoff, pending blocks might not be ordered
702 in this stage. Especially, blocks for static functions will show up at
703 the end. We need to sort them, so tools like `find_pc_function' and
704 `find_pc_block' can work reliably. */
705 if (sort_pending
&& pending_blocks
) {
706 /* FIXME! Remove this horrid bubble sort and use qsort!!! */
709 struct pending_block
*pb
, *pbnext
;
711 pb
= pending_blocks
, pbnext
= pb
->next
;
716 /* swap blocks if unordered! */
718 if (BLOCK_START(pb
->block
) < BLOCK_START(pbnext
->block
)) {
719 struct block
*tmp
= pb
->block
;
720 pb
->block
= pbnext
->block
;
725 pbnext
= pbnext
->next
;
730 /* Cleanup any undefined types that have been left hanging around
731 (this needs to be done before the finish_blocks so that
732 file_symbols is still good). */
733 cleanup_undefined_types ();
735 /* Hooks for xcoffread.c */
737 patch_block_stabs (file_symbols
, file_stabs
);
743 patch_block_stabs (global_symbols
, global_stabs
);
748 if (pending_blocks
== 0
750 && global_symbols
== 0) {
751 /* Ignore symtabs that have no functions with real debugging info */
754 /* Define the STATIC_BLOCK and GLOBAL_BLOCK, and build the blockvector. */
755 finish_block (0, &file_symbols
, 0, last_source_start_addr
, end_addr
);
756 finish_block (0, &global_symbols
, 0, last_source_start_addr
, end_addr
);
757 blockvector
= make_blockvector ();
760 /* Now create the symtab objects proper, one for each subfile. */
761 /* (The main file is the last one on the chain.) */
763 for (subfile
= subfiles
; subfile
; subfile
= nextsub
)
765 /* If we have blocks of symbols, make a symtab.
766 Otherwise, just ignore this file and any line number info in it. */
769 if (subfile
->line_vector
) {
770 /* First, shrink the linetable to make more memory. */
771 subfile
->line_vector
= (struct linetable
*)
772 xrealloc (subfile
->line_vector
, (sizeof (struct linetable
)
773 + subfile
->line_vector
->nitems
* sizeof (struct linetable_entry
)));
776 qsort (subfile
->line_vector
->item
, subfile
->line_vector
->nitems
,
777 sizeof (struct linetable_entry
), compare_line_numbers
);
780 /* Now, allocate a symbol table. */
781 symtab
= allocate_symtab (subfile
->name
, objfile
);
783 /* Fill in its components. */
784 symtab
->blockvector
= blockvector
;
785 symtab
->linetable
= subfile
->line_vector
;
786 symtab
->dirname
= subfile
->dirname
;
787 symtab
->free_code
= free_linetable
;
788 symtab
->free_ptr
= 0;
790 /* Link the new symtab into the list of such. */
791 symtab
->next
= symtab_list
;
792 symtab_list
= symtab
;
794 /* No blocks for this file. Delete any line number info we have
796 if (subfile
->line_vector
)
797 free (subfile
->line_vector
);
800 nextsub
= subfile
->next
;
805 free ((char *) type_vector
);
807 type_vector_length
= 0;
809 last_source_file
= 0;
811 previous_stab_code
= 0;
817 /* Push a context block. Args are an identifying nesting level (checkable
818 when you pop it), and the starting PC address of this context. */
820 struct context_stack
*
821 push_context (desc
, valu
)
825 register struct context_stack
*new;
827 if (context_stack_depth
== context_stack_size
)
829 context_stack_size
*= 2;
830 context_stack
= (struct context_stack
*)
831 xrealloc (context_stack
,
833 * sizeof (struct context_stack
)));
836 new = &context_stack
[context_stack_depth
++];
838 new->locals
= local_symbols
;
839 new->old_blocks
= pending_blocks
;
840 new->start_addr
= valu
;
848 /* Initialize anything that needs initializing when starting to read
849 a fresh piece of a symbol file, e.g. reading in the stuff corresponding
861 /* Initialize anything that needs initializing when a completely new
862 symbol file is specified (not just adding some symbols from another
863 file, e.g. a shared library). */
868 /* Empty the hash table of global syms looking for values. */
869 bzero (global_sym_chain
, sizeof global_sym_chain
);
874 /* Scan through all of the global symbols defined in the object file,
875 assigning values to the debugging symbols that need to be assigned
876 to. Get these symbols from the misc function list. */
884 for (mf
= 0; mf
< misc_function_count
; mf
++)
886 char *namestring
= misc_function_vector
[mf
].name
;
887 struct symbol
*sym
, *prev
;
891 prev
= (struct symbol
*) 0;
893 /* Get the hash index and check all the symbols
894 under that hash index. */
896 hash
= hashname (namestring
);
898 for (sym
= global_sym_chain
[hash
]; sym
;)
900 if (*namestring
== SYMBOL_NAME (sym
)[0]
901 && !strcmp(namestring
+ 1, SYMBOL_NAME (sym
) + 1))
903 /* Splice this symbol out of the hash chain and
904 assign the value we have to it. */
906 SYMBOL_VALUE_CHAIN (prev
) = SYMBOL_VALUE_CHAIN (sym
);
908 global_sym_chain
[hash
] = SYMBOL_VALUE_CHAIN (sym
);
910 /* Check to see whether we need to fix up a common block. */
911 /* Note: this code might be executed several times for
912 the same symbol if there are multiple references. */
913 if (SYMBOL_CLASS (sym
) == LOC_BLOCK
)
914 fix_common_block (sym
, misc_function_vector
[mf
].address
);
916 SYMBOL_VALUE_ADDRESS (sym
) = misc_function_vector
[mf
].address
;
919 sym
= SYMBOL_VALUE_CHAIN (prev
);
921 sym
= global_sym_chain
[hash
];
926 sym
= SYMBOL_VALUE_CHAIN (sym
);
933 /* Read a number by which a type is referred to in dbx data,
934 or perhaps read a pair (FILENUM, TYPENUM) in parentheses.
935 Just a single number N is equivalent to (0,N).
936 Return the two numbers by storing them in the vector TYPENUMS.
937 TYPENUMS will then be used as an argument to dbx_lookup_type. */
940 read_type_number (pp
, typenums
)
942 register int *typenums
;
947 typenums
[0] = read_number (pp
, ',');
948 typenums
[1] = read_number (pp
, ')');
953 typenums
[1] = read_number (pp
, 0);
957 /* To handle GNU C++ typename abbreviation, we need to be able to
958 fill in a type's name as soon as space for that type is allocated.
959 `type_synonym_name' is the name of the type being allocated.
960 It is cleared as soon as it is used (lest all allocated types
962 static char *type_synonym_name
;
966 define_symbol (valu
, string
, desc
, type
)
972 register struct symbol
*sym
;
973 char *p
= (char *) strchr (string
, ':');
978 /* Ignore syms with empty names. */
982 /* Ignore old-style symbols from cc -go */
986 sym
= (struct symbol
*)obstack_alloc (symbol_obstack
, sizeof (struct symbol
));
988 if (processing_gcc_compilation
) {
989 /* GCC 2.x puts the line number in desc. SunOS apparently puts in the
990 number of bytes occupied by a type or object, which we ignore. */
991 SYMBOL_LINE(sym
) = desc
;
993 SYMBOL_LINE(sym
) = 0; /* unknown */
996 if (string
[0] == CPLUS_MARKER
)
998 /* Special GNU C++ names. */
1002 SYMBOL_NAME (sym
) = "this";
1004 case 'v': /* $vtbl_ptr_type */
1005 /* Was: SYMBOL_NAME (sym) = "vptr"; */
1008 SYMBOL_NAME (sym
) = "eh_throw";
1012 /* This was an anonymous type that was never fixed up. */
1023 = (char *) obstack_alloc (symbol_obstack
, ((p
- string
) + 1));
1024 /* Open-coded bcopy--saves function call time. */
1026 register char *p1
= string
;
1027 register char *p2
= SYMBOL_NAME (sym
);
1034 /* Determine the type of name being defined. */
1035 /* The Acorn RISC machine's compiler can put out locals that don't
1036 start with "234=" or "(3,4)=", so assume anything other than the
1037 deftypes we know how to handle is a local. */
1038 /* (Peter Watkins @ Computervision)
1039 Handle Sun-style local fortran array types 'ar...' .
1040 (gnu@cygnus.com) -- this strchr() handles them properly?
1041 (tiemann@cygnus.com) -- 'C' is for catch. */
1042 if (!strchr ("cfFGpPrStTvVXC", *p
))
1047 /* c is a special case, not followed by a type-number.
1048 SYMBOL:c=iVALUE for an integer constant symbol.
1049 SYMBOL:c=rVALUE for a floating constant symbol.
1050 SYMBOL:c=eTYPE,INTVALUE for an enum constant symbol.
1051 e.g. "b:c=e6,0" for "const b = blob1"
1052 (where type 6 is defined by "blobs:t6=eblob1:0,blob2:1,;"). */
1056 error ("Invalid symbol data at symtab pos %d.", symnum
);
1061 double d
= atof (p
);
1064 SYMBOL_TYPE (sym
) = builtin_type_double
;
1066 (char *) obstack_alloc (symbol_obstack
, sizeof (double));
1067 memcpy (dbl_valu
, &d
, sizeof (double));
1068 SWAP_TARGET_AND_HOST (dbl_valu
, sizeof (double));
1069 SYMBOL_VALUE_BYTES (sym
) = dbl_valu
;
1070 SYMBOL_CLASS (sym
) = LOC_CONST_BYTES
;
1075 SYMBOL_TYPE (sym
) = builtin_type_int
;
1076 SYMBOL_VALUE (sym
) = atoi (p
);
1077 SYMBOL_CLASS (sym
) = LOC_CONST
;
1081 /* SYMBOL:c=eTYPE,INTVALUE for an enum constant symbol.
1082 e.g. "b:c=e6,0" for "const b = blob1"
1083 (where type 6 is defined by "blobs:t6=eblob1:0,blob2:1,;"). */
1087 read_type_number (&p
, typenums
);
1089 error ("Invalid symbol data: no comma in enum const symbol");
1091 SYMBOL_TYPE (sym
) = *dbx_lookup_type (typenums
);
1092 SYMBOL_VALUE (sym
) = atoi (p
);
1093 SYMBOL_CLASS (sym
) = LOC_CONST
;
1097 error ("Invalid symbol data at symtab pos %d.", symnum
);
1099 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1100 add_symbol_to_list (sym
, &file_symbols
);
1104 /* Now usually comes a number that says which data type,
1105 and possibly more stuff to define the type
1106 (all of which is handled by read_type) */
1108 if (deftype
== 'p' && *p
== 'F')
1109 /* pF is a two-letter code that means a function parameter in Fortran.
1110 The type-number specifies the type of the return value.
1111 Translate it into a pointer-to-function type. */
1115 = lookup_pointer_type (lookup_function_type (read_type (&p
)));
1119 struct type
*type_read
;
1120 synonym
= *p
== 't';
1125 type_synonym_name
= obsavestring (SYMBOL_NAME (sym
),
1126 strlen (SYMBOL_NAME (sym
)));
1129 /* Here we save the name of the symbol for read_range_type, which
1130 ends up reading in the basic types. In stabs, unfortunately there
1131 is no distinction between "int" and "long" types except their
1132 names. Until we work out a saner type policy (eliminating most
1133 builtin types and using the names specified in the files), we
1134 save away the name so that far away from here in read_range_type,
1135 we can examine it to decide between "int" and "long". FIXME. */
1136 long_kludge_name
= SYMBOL_NAME (sym
);
1137 type_read
= read_type (&p
);
1139 if ((deftype
== 'F' || deftype
== 'f')
1140 && TYPE_CODE (type_read
) != TYPE_CODE_FUNC
)
1143 /* This code doesn't work -- it needs to realloc and can't. */
1144 struct type
*new = (struct type
*)
1145 obstack_alloc (symbol_obstack
, sizeof (struct type
));
1147 /* Generate a template for the type of this function. The
1148 types of the arguments will be added as we read the symbol
1150 *new = *lookup_function_type (type_read
);
1151 SYMBOL_TYPE(sym
) = new;
1152 in_function_type
= new;
1154 SYMBOL_TYPE (sym
) = lookup_function_type (type_read
);
1158 SYMBOL_TYPE (sym
) = type_read
;
1164 /* The name of a caught exception. */
1165 SYMBOL_CLASS (sym
) = LOC_LABEL
;
1166 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1167 SYMBOL_VALUE_ADDRESS (sym
) = valu
;
1168 add_symbol_to_list (sym
, &local_symbols
);
1172 SYMBOL_CLASS (sym
) = LOC_BLOCK
;
1173 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1174 add_symbol_to_list (sym
, &file_symbols
);
1178 SYMBOL_CLASS (sym
) = LOC_BLOCK
;
1179 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1180 add_symbol_to_list (sym
, &global_symbols
);
1184 /* For a class G (global) symbol, it appears that the
1185 value is not correct. It is necessary to search for the
1186 corresponding linker definition to find the value.
1187 These definitions appear at the end of the namelist. */
1188 i
= hashname (SYMBOL_NAME (sym
));
1189 SYMBOL_VALUE_CHAIN (sym
) = global_sym_chain
[i
];
1190 global_sym_chain
[i
] = sym
;
1191 SYMBOL_CLASS (sym
) = LOC_STATIC
;
1192 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1193 add_symbol_to_list (sym
, &global_symbols
);
1196 /* This case is faked by a conditional above,
1197 when there is no code letter in the dbx data.
1198 Dbx data never actually contains 'l'. */
1200 SYMBOL_CLASS (sym
) = LOC_LOCAL
;
1201 SYMBOL_VALUE (sym
) = valu
;
1202 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1203 add_symbol_to_list (sym
, &local_symbols
);
1207 /* Normally this is a parameter, a LOC_ARG. On the i960, it
1208 can also be a LOC_LOCAL_ARG depending on symbol type. */
1209 #ifndef DBX_PARM_SYMBOL_CLASS
1210 #define DBX_PARM_SYMBOL_CLASS(type) LOC_ARG
1212 SYMBOL_CLASS (sym
) = DBX_PARM_SYMBOL_CLASS (type
);
1213 SYMBOL_VALUE (sym
) = valu
;
1214 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1216 /* This doesn't work yet. */
1217 add_param_to_type (&in_function_type
, sym
);
1219 add_symbol_to_list (sym
, &local_symbols
);
1221 /* If it's gcc-compiled, if it says `short', believe it. */
1222 if (processing_gcc_compilation
|| BELIEVE_PCC_PROMOTION
)
1225 #if defined(BELIEVE_PCC_PROMOTION_TYPE)
1226 /* This macro is defined on machines (e.g. sparc) where
1227 we should believe the type of a PCC 'short' argument,
1228 but shouldn't believe the address (the address is
1229 the address of the corresponding int). Note that
1230 this is only different from the BELIEVE_PCC_PROMOTION
1231 case on big-endian machines.
1233 My guess is that this correction, as opposed to changing
1234 the parameter to an 'int' (as done below, for PCC
1235 on most machines), is the right thing to do
1236 on all machines, but I don't want to risk breaking
1237 something that already works. On most PCC machines,
1238 the sparc problem doesn't come up because the calling
1239 function has to zero the top bytes (not knowing whether
1240 the called function wants an int or a short), so there
1241 is no practical difference between an int and a short
1242 (except perhaps what happens when the GDB user types
1243 "print short_arg = 0x10000;").
1245 Hacked for SunOS 4.1 by gnu@cygnus.com. In 4.1, the compiler
1246 actually produces the correct address (we don't need to fix it
1247 up). I made this code adapt so that it will offset the symbol
1248 if it was pointing at an int-aligned location and not
1249 otherwise. This way you can use the same gdb for 4.0.x and
1252 If the parameter is shorter than an int, and is integral
1253 (e.g. char, short, or unsigned equivalent), and is claimed to
1254 be passed on an integer boundary, don't believe it! Offset the
1255 parameter's address to the tail-end of that integer. */
1257 if (TYPE_LENGTH (SYMBOL_TYPE (sym
)) < TYPE_LENGTH (builtin_type_int
)
1258 && TYPE_CODE (SYMBOL_TYPE (sym
)) == TYPE_CODE_INT
1259 && 0 == SYMBOL_VALUE (sym
) % TYPE_LENGTH (builtin_type_int
)) {
1260 SYMBOL_VALUE (sym
) += TYPE_LENGTH (builtin_type_int
)
1261 - TYPE_LENGTH (SYMBOL_TYPE (sym
));
1265 #else /* no BELIEVE_PCC_PROMOTION_TYPE. */
1267 /* If PCC says a parameter is a short or a char,
1268 it is really an int. */
1269 if (TYPE_LENGTH (SYMBOL_TYPE (sym
)) < TYPE_LENGTH (builtin_type_int
)
1270 && TYPE_CODE (SYMBOL_TYPE (sym
)) == TYPE_CODE_INT
) {
1271 SYMBOL_TYPE (sym
) = TYPE_UNSIGNED (SYMBOL_TYPE (sym
))?
1272 builtin_type_unsigned_int
:
1277 #endif /* no BELIEVE_PCC_PROMOTION_TYPE. */
1280 SYMBOL_CLASS (sym
) = LOC_REGPARM
;
1281 SYMBOL_VALUE (sym
) = STAB_REG_TO_REGNUM (valu
);
1282 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1283 add_symbol_to_list (sym
, &local_symbols
);
1287 SYMBOL_CLASS (sym
) = LOC_REGISTER
;
1288 SYMBOL_VALUE (sym
) = STAB_REG_TO_REGNUM (valu
);
1289 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1290 add_symbol_to_list (sym
, &local_symbols
);
1294 /* Static symbol at top level of file */
1295 SYMBOL_CLASS (sym
) = LOC_STATIC
;
1296 SYMBOL_VALUE_ADDRESS (sym
) = valu
;
1297 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1298 add_symbol_to_list (sym
, &file_symbols
);
1302 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
1303 SYMBOL_VALUE (sym
) = valu
;
1304 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1305 if (TYPE_NAME (SYMBOL_TYPE (sym
)) == 0
1306 && (TYPE_FLAGS (SYMBOL_TYPE (sym
)) & TYPE_FLAG_PERM
) == 0)
1307 TYPE_NAME (SYMBOL_TYPE (sym
)) =
1308 obsavestring (SYMBOL_NAME (sym
),
1309 strlen (SYMBOL_NAME (sym
)));
1310 /* C++ vagaries: we may have a type which is derived from
1311 a base type which did not have its name defined when the
1312 derived class was output. We fill in the derived class's
1313 base part member's name here in that case. */
1314 else if ((TYPE_CODE (SYMBOL_TYPE (sym
)) == TYPE_CODE_STRUCT
1315 || TYPE_CODE (SYMBOL_TYPE (sym
)) == TYPE_CODE_UNION
)
1316 && TYPE_N_BASECLASSES (SYMBOL_TYPE (sym
)))
1319 for (j
= TYPE_N_BASECLASSES (SYMBOL_TYPE (sym
)) - 1; j
>= 0; j
--)
1320 if (TYPE_BASECLASS_NAME (SYMBOL_TYPE (sym
), j
) == 0)
1321 TYPE_BASECLASS_NAME (SYMBOL_TYPE (sym
), j
) =
1322 type_name_no_tag (TYPE_BASECLASS (SYMBOL_TYPE (sym
), j
));
1325 add_symbol_to_list (sym
, &file_symbols
);
1329 SYMBOL_CLASS (sym
) = LOC_TYPEDEF
;
1330 SYMBOL_VALUE (sym
) = valu
;
1331 SYMBOL_NAMESPACE (sym
) = STRUCT_NAMESPACE
;
1332 if (TYPE_NAME (SYMBOL_TYPE (sym
)) == 0
1333 && (TYPE_FLAGS (SYMBOL_TYPE (sym
)) & TYPE_FLAG_PERM
) == 0)
1334 TYPE_NAME (SYMBOL_TYPE (sym
))
1336 (TYPE_CODE (SYMBOL_TYPE (sym
)) == TYPE_CODE_ENUM
1338 : (TYPE_CODE (SYMBOL_TYPE (sym
)) == TYPE_CODE_STRUCT
1339 ? "struct " : "union ")),
1341 add_symbol_to_list (sym
, &file_symbols
);
1345 register struct symbol
*typedef_sym
1346 = (struct symbol
*) obstack_alloc (symbol_obstack
, sizeof (struct symbol
));
1347 SYMBOL_NAME (typedef_sym
) = SYMBOL_NAME (sym
);
1348 SYMBOL_TYPE (typedef_sym
) = SYMBOL_TYPE (sym
);
1350 SYMBOL_CLASS (typedef_sym
) = LOC_TYPEDEF
;
1351 SYMBOL_VALUE (typedef_sym
) = valu
;
1352 SYMBOL_NAMESPACE (typedef_sym
) = VAR_NAMESPACE
;
1353 add_symbol_to_list (typedef_sym
, &file_symbols
);
1358 /* Static symbol of local scope */
1359 SYMBOL_CLASS (sym
) = LOC_STATIC
;
1360 SYMBOL_VALUE_ADDRESS (sym
) = valu
;
1361 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1362 add_symbol_to_list (sym
, &local_symbols
);
1366 /* Reference parameter */
1367 SYMBOL_CLASS (sym
) = LOC_REF_ARG
;
1368 SYMBOL_VALUE (sym
) = valu
;
1369 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1370 add_symbol_to_list (sym
, &local_symbols
);
1374 /* This is used by Sun FORTRAN for "function result value".
1375 Sun claims ("dbx and dbxtool interfaces", 2nd ed)
1376 that Pascal uses it too, but when I tried it Pascal used
1377 "x:3" (local symbol) instead. */
1378 SYMBOL_CLASS (sym
) = LOC_LOCAL
;
1379 SYMBOL_VALUE (sym
) = valu
;
1380 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
1381 add_symbol_to_list (sym
, &local_symbols
);
1385 error ("Invalid symbol data: unknown symbol-type code `%c' at symtab pos %d.", deftype
, symnum
);
1390 /* What about types defined as forward references inside of a small lexical
1392 /* Add a type to the list of undefined types to be checked through
1393 once this file has been read in. */
1395 add_undefined_type (type
)
1398 if (undef_types_length
== undef_types_allocated
)
1400 undef_types_allocated
*= 2;
1401 undef_types
= (struct type
**)
1402 xrealloc (undef_types
,
1403 undef_types_allocated
* sizeof (struct type
*));
1405 undef_types
[undef_types_length
++] = type
;
1408 /* Go through each undefined type, see if it's still undefined, and fix it
1409 up if possible. We have two kinds of undefined types:
1411 TYPE_CODE_ARRAY: Array whose target type wasn't defined yet.
1412 Fix: update array length using the element bounds
1413 and the target type's length.
1414 TYPE_CODE_STRUCT, TYPE_CODE_UNION: Structure whose fields were not
1415 yet defined at the time a pointer to it was made.
1416 Fix: Do a full lookup on the struct/union tag. */
1418 cleanup_undefined_types ()
1422 for (type
= undef_types
; type
< undef_types
+ undef_types_length
; type
++) {
1423 switch (TYPE_CODE (*type
)) {
1425 case TYPE_CODE_STRUCT
:
1426 case TYPE_CODE_UNION
:
1427 case TYPE_CODE_ENUM
:
1429 /* Reasonable test to see if it's been defined since. */
1430 if (TYPE_NFIELDS (*type
) == 0)
1432 struct pending
*ppt
;
1434 /* Name of the type, without "struct" or "union" */
1435 char *typename
= TYPE_NAME (*type
);
1437 if (!strncmp (typename
, "struct ", 7))
1439 if (!strncmp (typename
, "union ", 6))
1441 if (!strncmp (typename
, "enum ", 5))
1444 for (ppt
= file_symbols
; ppt
; ppt
= ppt
->next
)
1445 for (i
= 0; i
< ppt
->nsyms
; i
++)
1447 struct symbol
*sym
= ppt
->symbol
[i
];
1449 if (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
1450 && SYMBOL_NAMESPACE (sym
) == STRUCT_NAMESPACE
1451 && (TYPE_CODE (SYMBOL_TYPE (sym
)) ==
1453 && !strcmp (SYMBOL_NAME (sym
), typename
))
1454 memcpy (*type
, SYMBOL_TYPE (sym
), sizeof (struct type
));
1458 /* It has been defined; don't mark it as a stub. */
1459 TYPE_FLAGS (*type
) &= ~TYPE_FLAG_STUB
;
1463 case TYPE_CODE_ARRAY
:
1465 struct type
*range_type
;
1468 if (TYPE_LENGTH (*type
) != 0) /* Better be unknown */
1470 if (TYPE_NFIELDS (*type
) != 1)
1472 range_type
= TYPE_FIELD_TYPE (*type
, 0);
1473 if (TYPE_CODE (range_type
) != TYPE_CODE_RANGE
)
1476 /* Now recompute the length of the array type, based on its
1477 number of elements and the target type's length. */
1478 lower
= TYPE_FIELD_BITPOS (range_type
, 0);
1479 upper
= TYPE_FIELD_BITPOS (range_type
, 1);
1480 TYPE_LENGTH (*type
) = (upper
- lower
+ 1)
1481 * TYPE_LENGTH (TYPE_TARGET_TYPE (*type
));
1487 error ("GDB internal error. cleanup_undefined_types with bad\
1488 type %d.", TYPE_CODE (*type
));
1492 undef_types_length
= 0;
1495 /* Skip rest of this symbol and return an error type.
1497 General notes on error recovery: error_type always skips to the
1498 end of the symbol (modulo cretinous dbx symbol name continuation).
1499 Thus code like this:
1501 if (*(*pp)++ != ';')
1502 return error_type (pp);
1504 is wrong because if *pp starts out pointing at '\0' (typically as the
1505 result of an earlier error), it will be incremented to point to the
1506 start of the next symbol, which might produce strange results, at least
1507 if you run off the end of the string table. Instead use
1510 return error_type (pp);
1516 foo = error_type (pp);
1520 And in case it isn't obvious, the point of all this hair is so the compiler
1521 can define new types and new syntaxes, and old versions of the
1522 debugger will be able to read the new symbol tables. */
1528 complain (&error_type_complaint
, 0);
1531 /* Skip to end of symbol. */
1532 while (**pp
!= '\0')
1535 /* Check for and handle cretinous dbx symbol name continuation! */
1536 if ((*pp
)[-1] == '\\')
1537 *pp
= next_symbol_text ();
1541 return builtin_type_error
;
1544 /* Read a dbx type reference or definition;
1545 return the type that is meant.
1546 This can be just a number, in which case it references
1547 a type already defined and placed in type_vector.
1548 Or the number can be followed by an =, in which case
1549 it means to define a new type according to the text that
1556 register struct type
*type
= 0;
1561 /* Read type number if present. The type number may be omitted.
1562 for instance in a two-dimensional array declared with type
1563 "ar1;1;10;ar1;1;10;4". */
1564 if ((**pp
>= '0' && **pp
<= '9')
1567 read_type_number (pp
, typenums
);
1569 /* Type is not being defined here. Either it already exists,
1570 or this is a forward reference to it. dbx_alloc_type handles
1573 return dbx_alloc_type (typenums
);
1575 /* Type is being defined here. */
1576 #if 0 /* Callers aren't prepared for a NULL result! FIXME -- metin! */
1580 /* if such a type already exists, this is an unnecessary duplication
1581 of the stab string, which is common in (RS/6000) xlc generated
1582 objects. In that case, simply return NULL and let the caller take
1585 tt
= *dbx_lookup_type (typenums
);
1586 if (tt
&& tt
->length
&& tt
->code
)
1595 /* 'typenums=' not present, type is anonymous. Read and return
1596 the definition, but don't put it in the type vector. */
1597 typenums
[0] = typenums
[1] = -1;
1605 enum type_code code
;
1607 /* Used to index through file_symbols. */
1608 struct pending
*ppt
;
1611 /* Name including "struct", etc. */
1614 /* Name without "struct", etc. */
1615 char *type_name_only
;
1621 /* Set the type code according to the following letter. */
1625 code
= TYPE_CODE_STRUCT
;
1629 code
= TYPE_CODE_UNION
;
1633 code
= TYPE_CODE_ENUM
;
1637 return error_type (pp
);
1640 to
= type_name
= (char *)
1641 obstack_alloc (symbol_obstack
,
1643 ((char *) strchr (*pp
, ':') - (*pp
)) + 1));
1645 /* Copy the prefix. */
1647 while (*to
++ = *from
++)
1651 type_name_only
= to
;
1653 /* Copy the name. */
1655 while ((*to
++ = *from
++) != ':')
1659 /* Set the pointer ahead of the name which we just read. */
1663 /* The following hack is clearly wrong, because it doesn't
1664 check whether we are in a baseclass. I tried to reproduce
1665 the case that it is trying to fix, but I couldn't get
1666 g++ to put out a cross reference to a basetype. Perhaps
1667 it doesn't do it anymore. */
1668 /* Note: for C++, the cross reference may be to a base type which
1669 has not yet been seen. In this case, we skip to the comma,
1670 which will mark the end of the base class name. (The ':'
1671 at the end of the base class name will be skipped as well.)
1672 But sometimes (ie. when the cross ref is the last thing on
1673 the line) there will be no ','. */
1674 from
= (char *) strchr (*pp
, ',');
1680 /* Now check to see whether the type has already been declared. */
1681 /* This is necessary at least in the case where the
1682 program says something like
1684 The compiler puts out a cross-reference; we better find
1685 set the length of the structure correctly so we can
1686 set the length of the array. */
1687 for (ppt
= file_symbols
; ppt
; ppt
= ppt
->next
)
1688 for (i
= 0; i
< ppt
->nsyms
; i
++)
1690 struct symbol
*sym
= ppt
->symbol
[i
];
1692 if (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
1693 && SYMBOL_NAMESPACE (sym
) == STRUCT_NAMESPACE
1694 && (TYPE_CODE (SYMBOL_TYPE (sym
)) == code
)
1695 && !strcmp (SYMBOL_NAME (sym
), type_name_only
))
1697 obstack_free (symbol_obstack
, type_name
);
1698 type
= SYMBOL_TYPE (sym
);
1703 /* Didn't find the type to which this refers, so we must
1704 be dealing with a forward reference. Allocate a type
1705 structure for it, and keep track of it so we can
1706 fill in the rest of the fields when we get the full
1708 type
= dbx_alloc_type (typenums
);
1709 TYPE_CODE (type
) = code
;
1710 TYPE_NAME (type
) = type_name
;
1711 INIT_CPLUS_SPECIFIC(type
);
1712 TYPE_FLAGS (type
) |= TYPE_FLAG_STUB
;
1714 add_undefined_type (type
);
1718 case '-': /* RS/6000 built-in type */
1720 type
= builtin_type (pp
); /* (in xcoffread.c) */
1735 read_type_number (pp
, xtypenums
);
1736 type
= *dbx_lookup_type (xtypenums
);
1741 type
= builtin_type_void
;
1742 if (typenums
[0] != -1)
1743 *dbx_lookup_type (typenums
) = type
;
1747 type1
= read_type (pp
);
1748 /* FIXME -- we should be doing smash_to_XXX types here. */
1750 /* postponed type decoration should be allowed. */
1751 if (typenums
[1] > 0 && typenums
[1] < type_vector_length
&&
1752 (type
= type_vector
[typenums
[1]])) {
1753 smash_to_pointer_type (type
, type1
);
1757 type
= lookup_pointer_type (type1
);
1758 if (typenums
[0] != -1)
1759 *dbx_lookup_type (typenums
) = type
;
1764 struct type
*domain
= read_type (pp
);
1765 struct type
*memtype
;
1768 /* Invalid member type data format. */
1769 return error_type (pp
);
1772 memtype
= read_type (pp
);
1773 type
= dbx_alloc_type (typenums
);
1774 smash_to_member_type (type
, domain
, memtype
);
1779 if ((*pp
)[0] == '#')
1781 /* We'll get the parameter types from the name. */
1782 struct type
*return_type
;
1785 return_type
= read_type (pp
);
1786 if (*(*pp
)++ != ';')
1787 complain (&invalid_member_complaint
, symnum
);
1788 type
= allocate_stub_method (return_type
);
1789 if (typenums
[0] != -1)
1790 *dbx_lookup_type (typenums
) = type
;
1794 struct type
*domain
= read_type (pp
);
1795 struct type
*return_type
;
1798 if (*(*pp
)++ != ',')
1799 error ("invalid member type data format, at symtab pos %d.",
1802 return_type
= read_type (pp
);
1803 args
= read_args (pp
, ';');
1804 type
= dbx_alloc_type (typenums
);
1805 smash_to_method_type (type
, domain
, return_type
, args
);
1810 type1
= read_type (pp
);
1811 type
= lookup_reference_type (type1
);
1812 if (typenums
[0] != -1)
1813 *dbx_lookup_type (typenums
) = type
;
1817 type1
= read_type (pp
);
1818 type
= lookup_function_type (type1
);
1819 if (typenums
[0] != -1)
1820 *dbx_lookup_type (typenums
) = type
;
1824 type
= read_range_type (pp
, typenums
);
1825 if (typenums
[0] != -1)
1826 *dbx_lookup_type (typenums
) = type
;
1830 type
= dbx_alloc_type (typenums
);
1831 type
= read_enum_type (pp
, type
);
1832 *dbx_lookup_type (typenums
) = type
;
1836 type
= dbx_alloc_type (typenums
);
1837 TYPE_NAME (type
) = type_synonym_name
;
1838 type_synonym_name
= 0;
1839 type
= read_struct_type (pp
, type
);
1843 type
= dbx_alloc_type (typenums
);
1844 TYPE_NAME (type
) = type_synonym_name
;
1845 type_synonym_name
= 0;
1846 type
= read_struct_type (pp
, type
);
1847 TYPE_CODE (type
) = TYPE_CODE_UNION
;
1852 return error_type (pp
);
1855 type
= dbx_alloc_type (typenums
);
1856 type
= read_array_type (pp
, type
);
1860 --*pp
; /* Go back to the symbol in error */
1861 /* Particularly important if it was \0! */
1862 return error_type (pp
);
1869 /* If this is an overriding temporary alteration for a header file's
1870 contents, and this type number is unknown in the global definition,
1871 put this type into the global definition at this type number. */
1872 if (header_file_prev_index
>= 0)
1874 register struct type
**tp
1875 = explicit_lookup_type (header_file_prev_index
, typenums
[1]);
1883 /* This page contains subroutines of read_type. */
1885 /* Read the description of a structure (or union type)
1886 and return an object describing the type. */
1889 read_struct_type (pp
, type
)
1891 register struct type
*type
;
1893 /* Total number of methods defined in this class.
1894 If the class defines two `f' methods, and one `g' method,
1895 then this will have the value 3. */
1896 int total_length
= 0;
1900 struct nextfield
*next
;
1901 int visibility
; /* 0=public, 1=protected, 2=public */
1907 struct next_fnfield
*next
;
1908 struct fn_field fn_field
;
1911 struct next_fnfieldlist
1913 struct next_fnfieldlist
*next
;
1914 struct fn_fieldlist fn_fieldlist
;
1917 register struct nextfield
*list
= 0;
1918 struct nextfield
*new;
1921 int non_public_fields
= 0;
1924 register struct next_fnfieldlist
*mainlist
= 0;
1927 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
1928 INIT_CPLUS_SPECIFIC(type
);
1930 /* First comes the total size in bytes. */
1932 TYPE_LENGTH (type
) = read_number (pp
, 0);
1934 /* C++: Now, if the class is a derived class, then the next character
1935 will be a '!', followed by the number of base classes derived from.
1936 Each element in the list contains visibility information,
1937 the offset of this base class in the derived structure,
1938 and then the base type. */
1941 int i
, n_baseclasses
, offset
;
1942 struct type
*baseclass
;
1945 /* Nonzero if it is a virtual baseclass, i.e.,
1949 struct C : public B, public virtual A {};
1951 B is a baseclass of C; A is a virtual baseclass for C. This is a C++
1952 2.0 language feature. */
1957 ALLOCATE_CPLUS_STRUCT_TYPE(type
);
1959 n_baseclasses
= read_number (pp
, ',');
1960 TYPE_FIELD_VIRTUAL_BITS (type
) =
1961 (B_TYPE
*) obstack_alloc (symbol_obstack
, B_BYTES (n_baseclasses
));
1962 B_CLRALL (TYPE_FIELD_VIRTUAL_BITS (type
), n_baseclasses
);
1964 for (i
= 0; i
< n_baseclasses
; i
++)
1967 *pp
= next_symbol_text ();
1978 /* Bad visibility format. */
1979 return error_type (pp
);
1987 non_public_fields
++;
1993 /* Bad visibility format. */
1994 return error_type (pp
);
1997 SET_TYPE_FIELD_VIRTUAL (type
, i
);
2000 /* Offset of the portion of the object corresponding to
2001 this baseclass. Always zero in the absence of
2002 multiple inheritance. */
2003 offset
= read_number (pp
, ',');
2004 baseclass
= read_type (pp
);
2005 *pp
+= 1; /* skip trailing ';' */
2007 /* Make this baseclass visible for structure-printing purposes. */
2008 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
2011 list
->visibility
= via_public
;
2012 list
->field
.type
= baseclass
;
2013 list
->field
.name
= type_name_no_tag (baseclass
);
2014 list
->field
.bitpos
= offset
;
2015 list
->field
.bitsize
= 0; /* this should be an unpacked field! */
2018 TYPE_N_BASECLASSES (type
) = n_baseclasses
;
2021 /* Now come the fields, as NAME:?TYPENUM,BITPOS,BITSIZE; for each one.
2022 At the end, we see a semicolon instead of a field.
2024 In C++, this may wind up being NAME:?TYPENUM:PHYSNAME; for
2027 The `?' is a placeholder for one of '/2' (public visibility),
2028 '/1' (protected visibility), '/0' (private visibility), or nothing
2029 (C style symbol table, public visibility). */
2031 /* We better set p right now, in case there are no fields at all... */
2036 /* Check for and handle cretinous dbx symbol name continuation! */
2037 if (**pp
== '\\') *pp
= next_symbol_text ();
2039 /* Get space to record the next field's data. */
2040 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
2044 /* Get the field name. */
2046 if (*p
== CPLUS_MARKER
)
2048 /* Special GNU C++ name. */
2053 struct type
*context
;
2064 complain (&invalid_cpp_abbrev_complaint
, *pp
);
2065 prefix
= "INVALID_C++_ABBREV";
2069 context
= read_type (pp
);
2070 name
= type_name_no_tag (context
);
2073 complain (&invalid_cpp_type_complaint
, symnum
);
2074 TYPE_NAME (context
) = name
;
2076 list
->field
.name
= obconcat (prefix
, name
, "");
2079 complain (&invalid_cpp_abbrev_complaint
, *pp
);
2080 list
->field
.type
= read_type (pp
);
2081 (*pp
)++; /* Skip the comma. */
2082 list
->field
.bitpos
= read_number (pp
, ';');
2083 /* This field is unpacked. */
2084 list
->field
.bitsize
= 0;
2085 list
->visibility
= 0; /* private */
2086 non_public_fields
++;
2088 /* GNU C++ anonymous type. */
2092 complain (&invalid_cpp_abbrev_complaint
, *pp
);
2098 while (*p
!= ':') p
++;
2099 list
->field
.name
= obsavestring (*pp
, p
- *pp
);
2101 /* C++: Check to see if we have hit the methods yet. */
2107 /* This means we have a visibility for a field coming. */
2113 list
->visibility
= 0; /* private */
2114 non_public_fields
++;
2119 list
->visibility
= 1; /* protected */
2120 non_public_fields
++;
2125 list
->visibility
= 2; /* public */
2130 else /* normal dbx-style format. */
2131 list
->visibility
= 2; /* public */
2133 list
->field
.type
= read_type (pp
);
2136 /* Static class member. */
2137 list
->field
.bitpos
= (long)-1;
2139 while (*p
!= ';') p
++;
2140 list
->field
.bitsize
= (long) savestring (*pp
, p
- *pp
);
2145 else if (**pp
!= ',')
2146 /* Bad structure-type format. */
2147 return error_type (pp
);
2149 (*pp
)++; /* Skip the comma. */
2150 list
->field
.bitpos
= read_number (pp
, ',');
2151 list
->field
.bitsize
= read_number (pp
, ';');
2154 /* FIXME-tiemann: Can't the compiler put out something which
2155 lets us distinguish these? (or maybe just not put out anything
2156 for the field). What is the story here? What does the compiler
2157 really do? Also, patch gdb.texinfo for this case; I document
2158 it as a possible problem there. Search for "DBX-style". */
2160 /* This is wrong because this is identical to the symbols
2161 produced for GCC 0-size arrays. For example:
2166 The code which dumped core in such circumstances should be
2167 fixed not to dump core. */
2169 /* g++ -g0 can put out bitpos & bitsize zero for a static
2170 field. This does not give us any way of getting its
2171 class, so we can't know its name. But we can just
2172 ignore the field so we don't dump core and other nasty
2174 if (list
->field
.bitpos
== 0
2175 && list
->field
.bitsize
== 0)
2177 complain (&dbx_class_complaint
, 0);
2178 /* Ignore this field. */
2184 /* Detect an unpacked field and mark it as such.
2185 dbx gives a bit size for all fields.
2186 Note that forward refs cannot be packed,
2187 and treat enums as if they had the width of ints. */
2188 if (TYPE_CODE (list
->field
.type
) != TYPE_CODE_INT
2189 && TYPE_CODE (list
->field
.type
) != TYPE_CODE_ENUM
)
2190 list
->field
.bitsize
= 0;
2191 if ((list
->field
.bitsize
== 8 * TYPE_LENGTH (list
->field
.type
)
2192 || (TYPE_CODE (list
->field
.type
) == TYPE_CODE_ENUM
2193 && (list
->field
.bitsize
2194 == 8 * TYPE_LENGTH (builtin_type_int
))
2198 list
->field
.bitpos
% 8 == 0)
2199 list
->field
.bitsize
= 0;
2205 /* chill the list of fields: the last entry (at the head)
2206 is a partially constructed entry which we now scrub. */
2209 /* Now create the vector of fields, and record how big it is.
2210 We need this info to record proper virtual function table information
2211 for this class's virtual functions. */
2213 TYPE_NFIELDS (type
) = nfields
;
2214 TYPE_FIELDS (type
) = (struct field
*) obstack_alloc (symbol_obstack
,
2215 sizeof (struct field
) * nfields
);
2217 if (non_public_fields
)
2219 ALLOCATE_CPLUS_STRUCT_TYPE (type
);
2221 TYPE_FIELD_PRIVATE_BITS (type
) =
2222 (B_TYPE
*) obstack_alloc (symbol_obstack
, B_BYTES (nfields
));
2223 B_CLRALL (TYPE_FIELD_PRIVATE_BITS (type
), nfields
);
2225 TYPE_FIELD_PROTECTED_BITS (type
) =
2226 (B_TYPE
*) obstack_alloc (symbol_obstack
, B_BYTES (nfields
));
2227 B_CLRALL (TYPE_FIELD_PROTECTED_BITS (type
), nfields
);
2230 /* Copy the saved-up fields into the field vector. */
2232 for (n
= nfields
; list
; list
= list
->next
)
2235 TYPE_FIELD (type
, n
) = list
->field
;
2236 if (list
->visibility
== 0)
2237 SET_TYPE_FIELD_PRIVATE (type
, n
);
2238 else if (list
->visibility
== 1)
2239 SET_TYPE_FIELD_PROTECTED (type
, n
);
2242 /* Now come the method fields, as NAME::methods
2243 where each method is of the form TYPENUM,ARGS,...:PHYSNAME;
2244 At the end, we see a semicolon instead of a field.
2246 For the case of overloaded operators, the format is
2247 op$::*.methods, where $ is the CPLUS_MARKER (usually '$'),
2248 `*' holds the place for an operator name (such as `+=')
2249 and `.' marks the end of the operator name. */
2252 /* Now, read in the methods. To simplify matters, we
2253 "unread" the name that has been read, so that we can
2254 start from the top. */
2256 ALLOCATE_CPLUS_STRUCT_TYPE (type
);
2257 /* For each list of method lists... */
2261 struct next_fnfield
*sublist
= 0;
2262 struct type
*look_ahead_type
= NULL
;
2264 struct next_fnfieldlist
*new_mainlist
=
2265 (struct next_fnfieldlist
*)alloca (sizeof (struct next_fnfieldlist
));
2270 /* read in the name. */
2271 while (*p
!= ':') p
++;
2272 if ((*pp
)[0] == 'o' && (*pp
)[1] == 'p' && (*pp
)[2] == CPLUS_MARKER
)
2274 /* This is a completely wierd case. In order to stuff in the
2275 names that might contain colons (the usual name delimiter),
2276 Mike Tiemann defined a different name format which is
2277 signalled if the identifier is "op$". In that case, the
2278 format is "op$::XXXX." where XXXX is the name. This is
2279 used for names like "+" or "=". YUUUUUUUK! FIXME! */
2280 /* This lets the user type "break operator+".
2281 We could just put in "+" as the name, but that wouldn't
2283 static char opname
[32] = {'o', 'p', CPLUS_MARKER
};
2284 char *o
= opname
+ 3;
2286 /* Skip past '::'. */
2288 if (**pp
== '\\') *pp
= next_symbol_text ();
2292 main_fn_name
= savestring (opname
, o
- opname
);
2298 main_fn_name
= savestring (*pp
, p
- *pp
);
2299 /* Skip past '::'. */
2302 new_mainlist
->fn_fieldlist
.name
= main_fn_name
;
2306 struct next_fnfield
*new_sublist
=
2307 (struct next_fnfield
*)alloca (sizeof (struct next_fnfield
));
2309 /* Check for and handle cretinous dbx symbol name continuation! */
2310 if (look_ahead_type
== NULL
) /* Normal case. */
2312 if (**pp
== '\\') *pp
= next_symbol_text ();
2314 new_sublist
->fn_field
.type
= read_type (pp
);
2316 /* Invalid symtab info for method. */
2317 return error_type (pp
);
2320 { /* g++ version 1 kludge */
2321 new_sublist
->fn_field
.type
= look_ahead_type
;
2322 look_ahead_type
= NULL
;
2327 while (*p
!= ';') p
++;
2329 /* If this is just a stub, then we don't have the
2331 if (TYPE_FLAGS (new_sublist
->fn_field
.type
) & TYPE_FLAG_STUB
)
2332 new_sublist
->fn_field
.is_stub
= 1;
2333 new_sublist
->fn_field
.physname
= savestring (*pp
, p
- *pp
);
2336 /* Set this method's visibility fields. */
2337 switch (*(*pp
)++ - '0')
2340 new_sublist
->fn_field
.is_private
= 1;
2343 new_sublist
->fn_field
.is_protected
= 1;
2347 if (**pp
== '\\') *pp
= next_symbol_text ();
2350 case 'A': /* Normal functions. */
2351 new_sublist
->fn_field
.is_const
= 0;
2352 new_sublist
->fn_field
.is_volatile
= 0;
2355 case 'B': /* `const' member functions. */
2356 new_sublist
->fn_field
.is_const
= 1;
2357 new_sublist
->fn_field
.is_volatile
= 0;
2360 case 'C': /* `volatile' member function. */
2361 new_sublist
->fn_field
.is_const
= 0;
2362 new_sublist
->fn_field
.is_volatile
= 1;
2365 case 'D': /* `const volatile' member function. */
2366 new_sublist
->fn_field
.is_const
= 1;
2367 new_sublist
->fn_field
.is_volatile
= 1;
2370 case '*': /* File compiled with g++ version 1 -- no info */
2375 complain(&const_vol_complaint
, **pp
);
2382 /* virtual member function, followed by index. */
2383 /* The sign bit is set to distinguish pointers-to-methods
2384 from virtual function indicies. Since the array is
2385 in words, the quantity must be shifted left by 1
2386 on 16 bit machine, and by 2 on 32 bit machine, forcing
2387 the sign bit out, and usable as a valid index into
2388 the array. Remove the sign bit here. */
2389 new_sublist
->fn_field
.voffset
=
2390 (0x7fffffff & read_number (pp
, ';')) + 2;
2392 if (**pp
== '\\') *pp
= next_symbol_text ();
2394 if (**pp
== ';' || **pp
== '\0')
2395 /* Must be g++ version 1. */
2396 new_sublist
->fn_field
.fcontext
= 0;
2399 /* Figure out from whence this virtual function came.
2400 It may belong to virtual function table of
2401 one of its baseclasses. */
2402 look_ahead_type
= read_type (pp
);
2404 { /* g++ version 1 overloaded methods. */ }
2407 new_sublist
->fn_field
.fcontext
= look_ahead_type
;
2409 return error_type (pp
);
2412 look_ahead_type
= NULL
;
2418 /* static member function. */
2419 new_sublist
->fn_field
.voffset
= VOFFSET_STATIC
;
2420 if (strncmp (new_sublist
->fn_field
.physname
,
2421 main_fn_name
, strlen (main_fn_name
)))
2422 new_sublist
->fn_field
.is_stub
= 1;
2427 complain (&member_fn_complaint
, (*pp
)[-1]);
2428 /* Fall through into normal member function. */
2431 /* normal member function. */
2432 new_sublist
->fn_field
.voffset
= 0;
2433 new_sublist
->fn_field
.fcontext
= 0;
2437 new_sublist
->next
= sublist
;
2438 sublist
= new_sublist
;
2440 if (**pp
== '\\') *pp
= next_symbol_text ();
2442 while (**pp
!= ';' && **pp
!= '\0');
2446 new_mainlist
->fn_fieldlist
.fn_fields
=
2447 (struct fn_field
*) obstack_alloc (symbol_obstack
,
2448 sizeof (struct fn_field
) * length
);
2449 for (i
= length
; (i
--, sublist
); sublist
= sublist
->next
)
2450 new_mainlist
->fn_fieldlist
.fn_fields
[i
] = sublist
->fn_field
;
2452 new_mainlist
->fn_fieldlist
.length
= length
;
2453 new_mainlist
->next
= mainlist
;
2454 mainlist
= new_mainlist
;
2456 total_length
+= length
;
2458 while (**pp
!= ';');
2466 TYPE_FN_FIELDLISTS (type
) = (struct fn_fieldlist
*)
2467 obstack_alloc (symbol_obstack
,
2468 sizeof (struct fn_fieldlist
) * nfn_fields
);
2469 TYPE_NFN_FIELDS (type
) = nfn_fields
;
2470 TYPE_NFN_FIELDS_TOTAL (type
) = total_length
;
2475 for (i
= 0; i
< TYPE_N_BASECLASSES (type
); ++i
)
2476 TYPE_NFN_FIELDS_TOTAL (type
) +=
2477 TYPE_NFN_FIELDS_TOTAL (TYPE_BASECLASS (type
, i
));
2480 for (n
= nfn_fields
; mainlist
; mainlist
= mainlist
->next
) {
2481 --n
; /* Circumvent Sun3 compiler bug */
2482 TYPE_FN_FIELDLISTS (type
)[n
] = mainlist
->fn_fieldlist
;
2489 if (**pp
== '=' || **pp
== '+' || **pp
== '-')
2491 /* Obsolete flags that used to indicate the presence
2492 of constructors and/or destructors. */
2496 /* Read either a '%' or the final ';'. */
2497 if (*(*pp
)++ == '%')
2499 /* We'd like to be able to derive the vtable pointer field
2500 from the type information, but when it's inherited, that's
2501 hard. A reason it's hard is because we may read in the
2502 info about a derived class before we read in info about
2503 the base class that provides the vtable pointer field.
2504 Once the base info has been read, we could fill in the info
2505 for the derived classes, but for the fact that by then,
2506 we don't remember who needs what. */
2508 int predicted_fieldno
= -1;
2510 /* Now we must record the virtual function table pointer's
2511 field information. */
2519 /* In version 2, we derive the vfield ourselves. */
2520 for (n
= 0; n
< nfields
; n
++)
2522 if (! strncmp (TYPE_FIELD_NAME (type
, n
), vptr_name
,
2523 sizeof (vptr_name
) -1))
2525 predicted_fieldno
= n
;
2529 if (predicted_fieldno
< 0)
2530 for (n
= 0; n
< TYPE_N_BASECLASSES (type
); n
++)
2531 if (! TYPE_FIELD_VIRTUAL (type
, n
)
2532 && TYPE_VPTR_FIELDNO (TYPE_BASECLASS (type
, n
)) >= 0)
2534 predicted_fieldno
= TYPE_VPTR_FIELDNO (TYPE_BASECLASS (type
, n
));
2542 while (*p
!= '\0' && *p
!= ';')
2545 /* Premature end of symbol. */
2546 return error_type (pp
);
2548 TYPE_VPTR_BASETYPE (type
) = t
;
2551 if (TYPE_FIELD_NAME (t
, TYPE_N_BASECLASSES (t
)) == 0)
2553 /* FIXME-tiemann: what's this? */
2555 TYPE_VPTR_FIELDNO (type
) = i
= TYPE_N_BASECLASSES (t
);
2560 else for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); --i
)
2561 if (! strncmp (TYPE_FIELD_NAME (t
, i
), vptr_name
,
2562 sizeof (vptr_name
) -1))
2564 TYPE_VPTR_FIELDNO (type
) = i
;
2568 /* Virtual function table field not found. */
2569 return error_type (pp
);
2572 TYPE_VPTR_FIELDNO (type
) = TYPE_VPTR_FIELDNO (t
);
2575 if (TYPE_VPTR_FIELDNO (type
) != predicted_fieldno
)
2576 error ("TYPE_VPTR_FIELDNO miscalculated");
2586 /* Read a definition of an array type,
2587 and create and return a suitable type object.
2588 Also creates a range type which represents the bounds of that
2591 read_array_type (pp
, type
)
2593 register struct type
*type
;
2595 struct type
*index_type
, *element_type
, *range_type
;
2599 /* Format of an array type:
2600 "ar<index type>;lower;upper;<array_contents_type>". Put code in
2603 Fortran adjustable arrays use Adigits or Tdigits for lower or upper;
2604 for these, produce a type like float[][]. */
2606 index_type
= read_type (pp
);
2608 /* Improper format of array type decl. */
2609 return error_type (pp
);
2612 if (!(**pp
>= '0' && **pp
<= '9'))
2617 lower
= read_number (pp
, ';');
2619 if (!(**pp
>= '0' && **pp
<= '9'))
2624 upper
= read_number (pp
, ';');
2626 element_type
= read_type (pp
);
2635 /* Create range type. */
2636 range_type
= (struct type
*) obstack_alloc (symbol_obstack
,
2637 sizeof (struct type
));
2638 TYPE_CODE (range_type
) = TYPE_CODE_RANGE
;
2639 TYPE_TARGET_TYPE (range_type
) = index_type
;
2641 /* This should never be needed. */
2642 TYPE_LENGTH (range_type
) = sizeof (int);
2644 TYPE_NFIELDS (range_type
) = 2;
2645 TYPE_FIELDS (range_type
) =
2646 (struct field
*) obstack_alloc (symbol_obstack
,
2647 2 * sizeof (struct field
));
2648 TYPE_FIELD_BITPOS (range_type
, 0) = lower
;
2649 TYPE_FIELD_BITPOS (range_type
, 1) = upper
;
2652 TYPE_CODE (type
) = TYPE_CODE_ARRAY
;
2653 TYPE_TARGET_TYPE (type
) = element_type
;
2654 TYPE_LENGTH (type
) = (upper
- lower
+ 1) * TYPE_LENGTH (element_type
);
2655 TYPE_NFIELDS (type
) = 1;
2656 TYPE_FIELDS (type
) =
2657 (struct field
*) obstack_alloc (symbol_obstack
,
2658 sizeof (struct field
));
2659 TYPE_FIELD_TYPE (type
, 0) = range_type
;
2661 /* If we have an array whose element type is not yet known, but whose
2662 bounds *are* known, record it to be adjusted at the end of the file. */
2663 if (TYPE_LENGTH (element_type
) == 0 && !adjustable
)
2664 add_undefined_type (type
);
2670 /* Read a definition of an enumeration type,
2671 and create and return a suitable type object.
2672 Also defines the symbols that represent the values of the type. */
2675 read_enum_type (pp
, type
)
2677 register struct type
*type
;
2682 register struct symbol
*sym
;
2684 struct pending
**symlist
;
2685 struct pending
*osyms
, *syms
;
2688 if (within_function
)
2689 symlist
= &local_symbols
;
2691 symlist
= &file_symbols
;
2693 o_nsyms
= osyms
? osyms
->nsyms
: 0;
2695 /* Read the value-names and their values.
2696 The input syntax is NAME:VALUE,NAME:VALUE, and so on.
2697 A semicolon or comman instead of a NAME means the end. */
2698 while (**pp
&& **pp
!= ';' && **pp
!= ',')
2700 /* Check for and handle cretinous dbx symbol name continuation! */
2701 if (**pp
== '\\') *pp
= next_symbol_text ();
2704 while (*p
!= ':') p
++;
2705 name
= obsavestring (*pp
, p
- *pp
);
2707 n
= read_number (pp
, ',');
2709 sym
= (struct symbol
*) obstack_alloc (symbol_obstack
, sizeof (struct symbol
));
2710 bzero (sym
, sizeof (struct symbol
));
2711 SYMBOL_NAME (sym
) = name
;
2712 SYMBOL_CLASS (sym
) = LOC_CONST
;
2713 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
2714 SYMBOL_VALUE (sym
) = n
;
2715 add_symbol_to_list (sym
, symlist
);
2720 (*pp
)++; /* Skip the semicolon. */
2722 /* Now fill in the fields of the type-structure. */
2724 TYPE_LENGTH (type
) = sizeof (int);
2725 TYPE_CODE (type
) = TYPE_CODE_ENUM
;
2726 TYPE_NFIELDS (type
) = nsyms
;
2727 TYPE_FIELDS (type
) = (struct field
*) obstack_alloc (symbol_obstack
, sizeof (struct field
) * nsyms
);
2729 /* Find the symbols for the values and put them into the type.
2730 The symbols can be found in the symlist that we put them on
2731 to cause them to be defined. osyms contains the old value
2732 of that symlist; everything up to there was defined by us. */
2733 /* Note that we preserve the order of the enum constants, so
2734 that in something like "enum {FOO, LAST_THING=FOO}" we print
2735 FOO, not LAST_THING. */
2737 for (syms
= *symlist
, n
= 0; syms
; syms
= syms
->next
)
2742 for (; j
< syms
->nsyms
; j
++,n
++)
2744 struct symbol
*xsym
= syms
->symbol
[j
];
2745 SYMBOL_TYPE (xsym
) = type
;
2746 TYPE_FIELD_NAME (type
, n
) = SYMBOL_NAME (xsym
);
2747 TYPE_FIELD_VALUE (type
, n
) = 0;
2748 TYPE_FIELD_BITPOS (type
, n
) = SYMBOL_VALUE (xsym
);
2749 TYPE_FIELD_BITSIZE (type
, n
) = 0;
2756 /* This screws up perfectly good C programs with enums. FIXME. */
2757 /* Is this Modula-2's BOOLEAN type? Flag it as such if so. */
2758 if(TYPE_NFIELDS(type
) == 2 &&
2759 ((!strcmp(TYPE_FIELD_NAME(type
,0),"TRUE") &&
2760 !strcmp(TYPE_FIELD_NAME(type
,1),"FALSE")) ||
2761 (!strcmp(TYPE_FIELD_NAME(type
,1),"TRUE") &&
2762 !strcmp(TYPE_FIELD_NAME(type
,0),"FALSE"))))
2763 TYPE_CODE(type
) = TYPE_CODE_BOOL
;
2769 /* Read a number from the string pointed to by *PP.
2770 The value of *PP is advanced over the number.
2771 If END is nonzero, the character that ends the
2772 number must match END, or an error happens;
2773 and that character is skipped if it does match.
2774 If END is zero, *PP is left pointing to that character.
2776 If the number fits in a long, set *VALUE and set *BITS to 0.
2777 If not, set *BITS to be the number of bits in the number.
2779 If encounter garbage, set *BITS to -1. */
2782 read_huge_number (pp
, end
, valu
, bits
)
2803 /* Leading zero means octal. GCC uses this to output values larger
2804 than an int (because that would be hard in decimal). */
2811 upper_limit
= LONG_MAX
/ radix
;
2812 while ((c
= *p
++) >= '0' && c
<= ('0' + radix
))
2814 if (n
<= upper_limit
)
2817 n
+= c
- '0'; /* FIXME this overflows anyway */
2822 /* This depends on large values being output in octal, which is
2829 /* Ignore leading zeroes. */
2833 else if (c
== '2' || c
== '3')
2859 /* Large decimal constants are an error (because it is hard to
2860 count how many bits are in them). */
2866 /* -0x7f is the same as 0x80. So deal with it by adding one to
2867 the number of bits. */
2882 #define MAX_OF_C_TYPE(t) ((1 << (sizeof (t)*8 - 1)) - 1)
2883 #define MIN_OF_C_TYPE(t) (-(1 << (sizeof (t)*8 - 1)))
2886 read_range_type (pp
, typenums
)
2894 struct type
*result_type
;
2896 /* First comes a type we are a subrange of.
2897 In C it is usually 0, 1 or the type being defined. */
2898 read_type_number (pp
, rangenums
);
2899 self_subrange
= (rangenums
[0] == typenums
[0] &&
2900 rangenums
[1] == typenums
[1]);
2902 /* A semicolon should now follow; skip it. */
2906 /* The remaining two operands are usually lower and upper bounds
2907 of the range. But in some special cases they mean something else. */
2908 read_huge_number (pp
, ';', &n2
, &n2bits
);
2909 read_huge_number (pp
, ';', &n3
, &n3bits
);
2911 if (n2bits
== -1 || n3bits
== -1)
2912 return error_type (pp
);
2914 /* If limits are huge, must be large integral type. */
2915 if (n2bits
!= 0 || n3bits
!= 0)
2917 char got_signed
= 0;
2918 char got_unsigned
= 0;
2919 /* Number of bits in the type. */
2922 /* Range from 0 to <large number> is an unsigned large integral type. */
2923 if ((n2bits
== 0 && n2
== 0) && n3bits
!= 0)
2928 /* Range from <large number> to <large number>-1 is a large signed
2930 else if (n2bits
!= 0 && n3bits
!= 0 && n2bits
== n3bits
+ 1)
2936 /* Check for "long long". */
2937 if (got_signed
&& nbits
== TARGET_LONG_LONG_BIT
)
2938 return builtin_type_long_long
;
2939 if (got_unsigned
&& nbits
== TARGET_LONG_LONG_BIT
)
2940 return builtin_type_unsigned_long_long
;
2942 if (got_signed
|| got_unsigned
)
2944 result_type
= (struct type
*) obstack_alloc (symbol_obstack
,
2945 sizeof (struct type
));
2946 bzero (result_type
, sizeof (struct type
));
2947 TYPE_LENGTH (result_type
) = nbits
/ TARGET_CHAR_BIT
;
2948 TYPE_CODE (result_type
) = TYPE_CODE_INT
;
2950 TYPE_FLAGS (result_type
) |= TYPE_FLAG_UNSIGNED
;
2954 return error_type (pp
);
2957 /* A type defined as a subrange of itself, with bounds both 0, is void. */
2958 if (self_subrange
&& n2
== 0 && n3
== 0)
2959 return builtin_type_void
;
2961 /* If n3 is zero and n2 is not, we want a floating type,
2962 and n2 is the width in bytes.
2964 Fortran programs appear to use this for complex types also,
2965 and they give no way to distinguish between double and single-complex!
2966 We don't have complex types, so we would lose on all fortran files!
2967 So return type `double' for all of those. It won't work right
2968 for the complex values, but at least it makes the file loadable.
2970 FIXME, we may be able to distinguish these by their names. FIXME. */
2972 if (n3
== 0 && n2
> 0)
2974 if (n2
== sizeof (float))
2975 return builtin_type_float
;
2976 return builtin_type_double
;
2979 /* If the upper bound is -1, it must really be an unsigned int. */
2981 else if (n2
== 0 && n3
== -1)
2983 /* FIXME -- the only way to distinguish `unsigned int' from `unsigned
2984 long' is to look at its name! */
2986 long_kludge_name
&& ((long_kludge_name
[0] == 'u' /* unsigned */ &&
2987 long_kludge_name
[9] == 'l' /* long */)
2988 || (long_kludge_name
[0] == 'l' /* long unsigned */)))
2989 return builtin_type_unsigned_long
;
2991 return builtin_type_unsigned_int
;
2994 /* Special case: char is defined (Who knows why) as a subrange of
2995 itself with range 0-127. */
2996 else if (self_subrange
&& n2
== 0 && n3
== 127)
2997 return builtin_type_char
;
2999 /* Assumptions made here: Subrange of self is equivalent to subrange
3000 of int. FIXME: Host and target type-sizes assumed the same. */
3001 /* FIXME: This is the *only* place in GDB that depends on comparing
3002 some type to a builtin type with ==. Fix it! */
3004 && (self_subrange
||
3005 *dbx_lookup_type (rangenums
) == builtin_type_int
))
3007 /* an unsigned type */
3009 if (n3
== - sizeof (long long))
3010 return builtin_type_unsigned_long_long
;
3012 /* FIXME -- the only way to distinguish `unsigned int' from `unsigned
3013 long' is to look at its name! */
3014 if (n3
== (unsigned long)~0L &&
3015 long_kludge_name
&& ((long_kludge_name
[0] == 'u' /* unsigned */ &&
3016 long_kludge_name
[9] == 'l' /* long */)
3017 || (long_kludge_name
[0] == 'l' /* long unsigned */)))
3018 return builtin_type_unsigned_long
;
3019 if (n3
== (unsigned int)~0L)
3020 return builtin_type_unsigned_int
;
3021 if (n3
== (unsigned short)~0L)
3022 return builtin_type_unsigned_short
;
3023 if (n3
== (unsigned char)~0L)
3024 return builtin_type_unsigned_char
;
3027 else if (n3
== 0 && n2
== -sizeof (long long))
3028 return builtin_type_long_long
;
3030 else if (n2
== -n3
-1)
3033 /* FIXME -- the only way to distinguish `int' from `long' is to look
3035 if ((n3
== (1 << (8 * sizeof (long) - 1)) - 1) &&
3036 long_kludge_name
&& long_kludge_name
[0] == 'l' /* long */)
3037 return builtin_type_long
;
3038 if (n3
== (1 << (8 * sizeof (int) - 1)) - 1)
3039 return builtin_type_int
;
3040 if (n3
== (1 << (8 * sizeof (short) - 1)) - 1)
3041 return builtin_type_short
;
3042 if (n3
== (1 << (8 * sizeof (char) - 1)) - 1)
3043 return builtin_type_char
;
3046 /* We have a real range type on our hands. Allocate space and
3047 return a real pointer. */
3049 /* At this point I don't have the faintest idea how to deal with
3050 a self_subrange type; I'm going to assume that this is used
3051 as an idiom, and that all of them are special cases. So . . . */
3053 return error_type (pp
);
3055 result_type
= (struct type
*) obstack_alloc (symbol_obstack
,
3056 sizeof (struct type
));
3057 bzero (result_type
, sizeof (struct type
));
3059 TYPE_CODE (result_type
) = TYPE_CODE_RANGE
;
3061 TYPE_TARGET_TYPE (result_type
) = *dbx_lookup_type(rangenums
);
3062 if (TYPE_TARGET_TYPE (result_type
) == 0) {
3063 complain (&range_type_base_complaint
, rangenums
[1]);
3064 TYPE_TARGET_TYPE (result_type
) = builtin_type_int
;
3067 TYPE_NFIELDS (result_type
) = 2;
3068 TYPE_FIELDS (result_type
) =
3069 (struct field
*) obstack_alloc (symbol_obstack
,
3070 2 * sizeof (struct field
));
3071 bzero (TYPE_FIELDS (result_type
), 2 * sizeof (struct field
));
3072 TYPE_FIELD_BITPOS (result_type
, 0) = n2
;
3073 TYPE_FIELD_BITPOS (result_type
, 1) = n3
;
3075 TYPE_LENGTH (result_type
) = TYPE_LENGTH (TYPE_TARGET_TYPE (result_type
));
3080 /* Read a number from the string pointed to by *PP.
3081 The value of *PP is advanced over the number.
3082 If END is nonzero, the character that ends the
3083 number must match END, or an error happens;
3084 and that character is skipped if it does match.
3085 If END is zero, *PP is left pointing to that character. */
3088 read_number (pp
, end
)
3092 register char *p
= *pp
;
3093 register long n
= 0;
3097 /* Handle an optional leading minus sign. */
3105 /* Read the digits, as far as they go. */
3107 while ((c
= *p
++) >= '0' && c
<= '9')
3115 error ("Invalid symbol data: invalid character \\%03o at symbol pos %d.", c
, symnum
);
3124 /* Read in an argument list. This is a list of types, separated by commas
3125 and terminated with END. Return the list of types read in, or (struct type
3126 **)-1 if there is an error. */
3132 /* FIXME! Remove this arbitrary limit! */
3133 struct type
*types
[1024], **rval
; /* allow for fns of 1023 parameters */
3139 /* Invalid argument list: no ','. */
3140 return (struct type
**)-1;
3143 /* Check for and handle cretinous dbx symbol name continuation! */
3145 *pp
= next_symbol_text ();
3147 types
[n
++] = read_type (pp
);
3149 *pp
+= 1; /* get past `end' (the ':' character) */
3153 rval
= (struct type
**) xmalloc (2 * sizeof (struct type
*));
3155 else if (TYPE_CODE (types
[n
-1]) != TYPE_CODE_VOID
)
3157 rval
= (struct type
**) xmalloc ((n
+ 1) * sizeof (struct type
*));
3158 bzero (rval
+ n
, sizeof (struct type
*));
3162 rval
= (struct type
**) xmalloc (n
* sizeof (struct type
*));
3164 memcpy (rval
, types
, n
* sizeof (struct type
*));
3168 /* Add a common block's start address to the offset of each symbol
3169 declared to be in it (by being between a BCOMM/ECOMM pair that uses
3170 the common block name). */
3173 fix_common_block (sym
, valu
)
3177 struct pending
*next
= (struct pending
*) SYMBOL_NAMESPACE (sym
);
3178 for ( ; next
; next
= next
->next
)
3181 for (j
= next
->nsyms
- 1; j
>= 0; j
--)
3182 SYMBOL_VALUE_ADDRESS (next
->symbol
[j
]) += valu
;
3186 /* Initializer for this module */
3188 _initialize_buildsym ()
3190 undef_types_allocated
= 20;
3191 undef_types_length
= 0;
3192 undef_types
= (struct type
**) xmalloc (undef_types_allocated
*
3193 sizeof (struct type
*));