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
:
1428 /* Reasonable test to see if it's been defined since. */
1429 if (TYPE_NFIELDS (*type
) == 0)
1431 struct pending
*ppt
;
1433 /* Name of the type, without "struct" or "union" */
1434 char *typename
= TYPE_NAME (*type
);
1436 if (!strncmp (typename
, "struct ", 7))
1438 if (!strncmp (typename
, "union ", 6))
1441 for (ppt
= file_symbols
; ppt
; ppt
= ppt
->next
)
1442 for (i
= 0; i
< ppt
->nsyms
; i
++)
1444 struct symbol
*sym
= ppt
->symbol
[i
];
1446 if (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
1447 && SYMBOL_NAMESPACE (sym
) == STRUCT_NAMESPACE
1448 && (TYPE_CODE (SYMBOL_TYPE (sym
)) ==
1450 && !strcmp (SYMBOL_NAME (sym
), typename
))
1451 memcpy (*type
, SYMBOL_TYPE (sym
), sizeof (struct type
));
1455 /* It has been defined; don't mark it as a stub. */
1456 TYPE_FLAGS (*type
) &= ~TYPE_FLAG_STUB
;
1460 case TYPE_CODE_ARRAY
:
1462 struct type
*range_type
;
1465 if (TYPE_LENGTH (*type
) != 0) /* Better be unknown */
1467 if (TYPE_NFIELDS (*type
) != 1)
1469 range_type
= TYPE_FIELD_TYPE (*type
, 0);
1470 if (TYPE_CODE (range_type
) != TYPE_CODE_RANGE
)
1473 /* Now recompute the length of the array type, based on its
1474 number of elements and the target type's length. */
1475 lower
= TYPE_FIELD_BITPOS (range_type
, 0);
1476 upper
= TYPE_FIELD_BITPOS (range_type
, 1);
1477 TYPE_LENGTH (*type
) = (upper
- lower
+ 1)
1478 * TYPE_LENGTH (TYPE_TARGET_TYPE (*type
));
1484 error ("GDB internal error. cleanup_undefined_types with bad type.");
1488 undef_types_length
= 0;
1491 /* Skip rest of this symbol and return an error type.
1493 General notes on error recovery: error_type always skips to the
1494 end of the symbol (modulo cretinous dbx symbol name continuation).
1495 Thus code like this:
1497 if (*(*pp)++ != ';')
1498 return error_type (pp);
1500 is wrong because if *pp starts out pointing at '\0' (typically as the
1501 result of an earlier error), it will be incremented to point to the
1502 start of the next symbol, which might produce strange results, at least
1503 if you run off the end of the string table. Instead use
1506 return error_type (pp);
1512 foo = error_type (pp);
1516 And in case it isn't obvious, the point of all this hair is so the compiler
1517 can define new types and new syntaxes, and old versions of the
1518 debugger will be able to read the new symbol tables. */
1524 complain (&error_type_complaint
, 0);
1527 /* Skip to end of symbol. */
1528 while (**pp
!= '\0')
1531 /* Check for and handle cretinous dbx symbol name continuation! */
1532 if ((*pp
)[-1] == '\\')
1533 *pp
= next_symbol_text ();
1537 return builtin_type_error
;
1540 /* Read a dbx type reference or definition;
1541 return the type that is meant.
1542 This can be just a number, in which case it references
1543 a type already defined and placed in type_vector.
1544 Or the number can be followed by an =, in which case
1545 it means to define a new type according to the text that
1552 register struct type
*type
= 0;
1557 /* Read type number if present. The type number may be omitted.
1558 for instance in a two-dimensional array declared with type
1559 "ar1;1;10;ar1;1;10;4". */
1560 if ((**pp
>= '0' && **pp
<= '9')
1563 read_type_number (pp
, typenums
);
1565 /* Type is not being defined here. Either it already exists,
1566 or this is a forward reference to it. dbx_alloc_type handles
1569 return dbx_alloc_type (typenums
);
1571 /* Type is being defined here. */
1572 #if 0 /* Callers aren't prepared for a NULL result! FIXME -- metin! */
1576 /* if such a type already exists, this is an unnecessary duplication
1577 of the stab string, which is common in (RS/6000) xlc generated
1578 objects. In that case, simply return NULL and let the caller take
1581 tt
= *dbx_lookup_type (typenums
);
1582 if (tt
&& tt
->length
&& tt
->code
)
1591 /* 'typenums=' not present, type is anonymous. Read and return
1592 the definition, but don't put it in the type vector. */
1593 typenums
[0] = typenums
[1] = -1;
1601 enum type_code code
;
1603 /* Used to index through file_symbols. */
1604 struct pending
*ppt
;
1607 /* Name including "struct", etc. */
1610 /* Name without "struct", etc. */
1611 char *type_name_only
;
1617 /* Set the type code according to the following letter. */
1621 code
= TYPE_CODE_STRUCT
;
1625 code
= TYPE_CODE_UNION
;
1629 code
= TYPE_CODE_ENUM
;
1633 return error_type (pp
);
1636 to
= type_name
= (char *)
1637 obstack_alloc (symbol_obstack
,
1639 ((char *) strchr (*pp
, ':') - (*pp
)) + 1));
1641 /* Copy the prefix. */
1643 while (*to
++ = *from
++)
1647 type_name_only
= to
;
1649 /* Copy the name. */
1651 while ((*to
++ = *from
++) != ':')
1655 /* Set the pointer ahead of the name which we just read. */
1659 /* The following hack is clearly wrong, because it doesn't
1660 check whether we are in a baseclass. I tried to reproduce
1661 the case that it is trying to fix, but I couldn't get
1662 g++ to put out a cross reference to a basetype. Perhaps
1663 it doesn't do it anymore. */
1664 /* Note: for C++, the cross reference may be to a base type which
1665 has not yet been seen. In this case, we skip to the comma,
1666 which will mark the end of the base class name. (The ':'
1667 at the end of the base class name will be skipped as well.)
1668 But sometimes (ie. when the cross ref is the last thing on
1669 the line) there will be no ','. */
1670 from
= (char *) strchr (*pp
, ',');
1676 /* Now check to see whether the type has already been declared. */
1677 /* This is necessary at least in the case where the
1678 program says something like
1680 The compiler puts out a cross-reference; we better find
1681 set the length of the structure correctly so we can
1682 set the length of the array. */
1683 for (ppt
= file_symbols
; ppt
; ppt
= ppt
->next
)
1684 for (i
= 0; i
< ppt
->nsyms
; i
++)
1686 struct symbol
*sym
= ppt
->symbol
[i
];
1688 if (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
1689 && SYMBOL_NAMESPACE (sym
) == STRUCT_NAMESPACE
1690 && (TYPE_CODE (SYMBOL_TYPE (sym
)) == code
)
1691 && !strcmp (SYMBOL_NAME (sym
), type_name_only
))
1693 obstack_free (symbol_obstack
, type_name
);
1694 type
= SYMBOL_TYPE (sym
);
1699 /* Didn't find the type to which this refers, so we must
1700 be dealing with a forward reference. Allocate a type
1701 structure for it, and keep track of it so we can
1702 fill in the rest of the fields when we get the full
1704 type
= dbx_alloc_type (typenums
);
1705 TYPE_CODE (type
) = code
;
1706 TYPE_NAME (type
) = type_name
;
1707 INIT_CPLUS_SPECIFIC(type
);
1708 TYPE_FLAGS (type
) |= TYPE_FLAG_STUB
;
1710 add_undefined_type (type
);
1714 case '-': /* RS/6000 built-in type */
1716 type
= builtin_type (pp
); /* (in xcoffread.c) */
1731 read_type_number (pp
, xtypenums
);
1732 type
= *dbx_lookup_type (xtypenums
);
1737 type
= builtin_type_void
;
1738 if (typenums
[0] != -1)
1739 *dbx_lookup_type (typenums
) = type
;
1743 type1
= read_type (pp
);
1744 /* FIXME -- we should be doing smash_to_XXX types here. */
1746 /* postponed type decoration should be allowed. */
1747 if (typenums
[1] > 0 && typenums
[1] < type_vector_length
&&
1748 (type
= type_vector
[typenums
[1]])) {
1749 smash_to_pointer_type (type
, type1
);
1753 type
= lookup_pointer_type (type1
);
1754 if (typenums
[0] != -1)
1755 *dbx_lookup_type (typenums
) = type
;
1760 struct type
*domain
= read_type (pp
);
1761 struct type
*memtype
;
1764 /* Invalid member type data format. */
1765 return error_type (pp
);
1768 memtype
= read_type (pp
);
1769 type
= dbx_alloc_type (typenums
);
1770 smash_to_member_type (type
, domain
, memtype
);
1775 if ((*pp
)[0] == '#')
1777 /* We'll get the parameter types from the name. */
1778 struct type
*return_type
;
1781 return_type
= read_type (pp
);
1782 if (*(*pp
)++ != ';')
1783 complain (&invalid_member_complaint
, symnum
);
1784 type
= allocate_stub_method (return_type
);
1785 if (typenums
[0] != -1)
1786 *dbx_lookup_type (typenums
) = type
;
1790 struct type
*domain
= read_type (pp
);
1791 struct type
*return_type
;
1794 if (*(*pp
)++ != ',')
1795 error ("invalid member type data format, at symtab pos %d.",
1798 return_type
= read_type (pp
);
1799 args
= read_args (pp
, ';');
1800 type
= dbx_alloc_type (typenums
);
1801 smash_to_method_type (type
, domain
, return_type
, args
);
1806 type1
= read_type (pp
);
1807 type
= lookup_reference_type (type1
);
1808 if (typenums
[0] != -1)
1809 *dbx_lookup_type (typenums
) = type
;
1813 type1
= read_type (pp
);
1814 type
= lookup_function_type (type1
);
1815 if (typenums
[0] != -1)
1816 *dbx_lookup_type (typenums
) = type
;
1820 type
= read_range_type (pp
, typenums
);
1821 if (typenums
[0] != -1)
1822 *dbx_lookup_type (typenums
) = type
;
1826 type
= dbx_alloc_type (typenums
);
1827 type
= read_enum_type (pp
, type
);
1828 *dbx_lookup_type (typenums
) = type
;
1832 type
= dbx_alloc_type (typenums
);
1833 TYPE_NAME (type
) = type_synonym_name
;
1834 type_synonym_name
= 0;
1835 type
= read_struct_type (pp
, type
);
1839 type
= dbx_alloc_type (typenums
);
1840 TYPE_NAME (type
) = type_synonym_name
;
1841 type_synonym_name
= 0;
1842 type
= read_struct_type (pp
, type
);
1843 TYPE_CODE (type
) = TYPE_CODE_UNION
;
1848 return error_type (pp
);
1851 type
= dbx_alloc_type (typenums
);
1852 type
= read_array_type (pp
, type
);
1856 --*pp
; /* Go back to the symbol in error */
1857 /* Particularly important if it was \0! */
1858 return error_type (pp
);
1865 /* If this is an overriding temporary alteration for a header file's
1866 contents, and this type number is unknown in the global definition,
1867 put this type into the global definition at this type number. */
1868 if (header_file_prev_index
>= 0)
1870 register struct type
**tp
1871 = explicit_lookup_type (header_file_prev_index
, typenums
[1]);
1879 /* This page contains subroutines of read_type. */
1881 /* Read the description of a structure (or union type)
1882 and return an object describing the type. */
1885 read_struct_type (pp
, type
)
1887 register struct type
*type
;
1889 /* Total number of methods defined in this class.
1890 If the class defines two `f' methods, and one `g' method,
1891 then this will have the value 3. */
1892 int total_length
= 0;
1896 struct nextfield
*next
;
1897 int visibility
; /* 0=public, 1=protected, 2=public */
1903 struct next_fnfield
*next
;
1904 struct fn_field fn_field
;
1907 struct next_fnfieldlist
1909 struct next_fnfieldlist
*next
;
1910 struct fn_fieldlist fn_fieldlist
;
1913 register struct nextfield
*list
= 0;
1914 struct nextfield
*new;
1917 int non_public_fields
= 0;
1920 register struct next_fnfieldlist
*mainlist
= 0;
1923 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
1924 INIT_CPLUS_SPECIFIC(type
);
1926 /* First comes the total size in bytes. */
1928 TYPE_LENGTH (type
) = read_number (pp
, 0);
1930 /* C++: Now, if the class is a derived class, then the next character
1931 will be a '!', followed by the number of base classes derived from.
1932 Each element in the list contains visibility information,
1933 the offset of this base class in the derived structure,
1934 and then the base type. */
1937 int i
, n_baseclasses
, offset
;
1938 struct type
*baseclass
;
1941 /* Nonzero if it is a virtual baseclass, i.e.,
1945 struct C : public B, public virtual A {};
1947 B is a baseclass of C; A is a virtual baseclass for C. This is a C++
1948 2.0 language feature. */
1953 ALLOCATE_CPLUS_STRUCT_TYPE(type
);
1955 n_baseclasses
= read_number (pp
, ',');
1956 TYPE_FIELD_VIRTUAL_BITS (type
) =
1957 (B_TYPE
*) obstack_alloc (symbol_obstack
, B_BYTES (n_baseclasses
));
1958 B_CLRALL (TYPE_FIELD_VIRTUAL_BITS (type
), n_baseclasses
);
1960 for (i
= 0; i
< n_baseclasses
; i
++)
1963 *pp
= next_symbol_text ();
1974 /* Bad visibility format. */
1975 return error_type (pp
);
1983 non_public_fields
++;
1989 /* Bad visibility format. */
1990 return error_type (pp
);
1993 SET_TYPE_FIELD_VIRTUAL (type
, i
);
1996 /* Offset of the portion of the object corresponding to
1997 this baseclass. Always zero in the absence of
1998 multiple inheritance. */
1999 offset
= read_number (pp
, ',');
2000 baseclass
= read_type (pp
);
2001 *pp
+= 1; /* skip trailing ';' */
2003 /* Make this baseclass visible for structure-printing purposes. */
2004 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
2007 list
->visibility
= via_public
;
2008 list
->field
.type
= baseclass
;
2009 list
->field
.name
= type_name_no_tag (baseclass
);
2010 list
->field
.bitpos
= offset
;
2011 list
->field
.bitsize
= 0; /* this should be an unpacked field! */
2014 TYPE_N_BASECLASSES (type
) = n_baseclasses
;
2017 /* Now come the fields, as NAME:?TYPENUM,BITPOS,BITSIZE; for each one.
2018 At the end, we see a semicolon instead of a field.
2020 In C++, this may wind up being NAME:?TYPENUM:PHYSNAME; for
2023 The `?' is a placeholder for one of '/2' (public visibility),
2024 '/1' (protected visibility), '/0' (private visibility), or nothing
2025 (C style symbol table, public visibility). */
2027 /* We better set p right now, in case there are no fields at all... */
2032 /* Check for and handle cretinous dbx symbol name continuation! */
2033 if (**pp
== '\\') *pp
= next_symbol_text ();
2035 /* Get space to record the next field's data. */
2036 new = (struct nextfield
*) alloca (sizeof (struct nextfield
));
2040 /* Get the field name. */
2042 if (*p
== CPLUS_MARKER
)
2044 /* Special GNU C++ name. */
2049 struct type
*context
;
2060 complain (&invalid_cpp_abbrev_complaint
, *pp
);
2061 prefix
= "INVALID_C++_ABBREV";
2065 context
= read_type (pp
);
2066 name
= type_name_no_tag (context
);
2069 complain (&invalid_cpp_type_complaint
, symnum
);
2070 TYPE_NAME (context
) = name
;
2072 list
->field
.name
= obconcat (prefix
, name
, "");
2075 complain (&invalid_cpp_abbrev_complaint
, *pp
);
2076 list
->field
.type
= read_type (pp
);
2077 (*pp
)++; /* Skip the comma. */
2078 list
->field
.bitpos
= read_number (pp
, ';');
2079 /* This field is unpacked. */
2080 list
->field
.bitsize
= 0;
2081 list
->visibility
= 0; /* private */
2082 non_public_fields
++;
2084 /* GNU C++ anonymous type. */
2088 complain (&invalid_cpp_abbrev_complaint
, *pp
);
2094 while (*p
!= ':') p
++;
2095 list
->field
.name
= obsavestring (*pp
, p
- *pp
);
2097 /* C++: Check to see if we have hit the methods yet. */
2103 /* This means we have a visibility for a field coming. */
2109 list
->visibility
= 0; /* private */
2110 non_public_fields
++;
2115 list
->visibility
= 1; /* protected */
2116 non_public_fields
++;
2121 list
->visibility
= 2; /* public */
2126 else /* normal dbx-style format. */
2127 list
->visibility
= 2; /* public */
2129 list
->field
.type
= read_type (pp
);
2132 /* Static class member. */
2133 list
->field
.bitpos
= (long)-1;
2135 while (*p
!= ';') p
++;
2136 list
->field
.bitsize
= (long) savestring (*pp
, p
- *pp
);
2141 else if (**pp
!= ',')
2142 /* Bad structure-type format. */
2143 return error_type (pp
);
2145 (*pp
)++; /* Skip the comma. */
2146 list
->field
.bitpos
= read_number (pp
, ',');
2147 list
->field
.bitsize
= read_number (pp
, ';');
2150 /* FIXME-tiemann: Can't the compiler put out something which
2151 lets us distinguish these? (or maybe just not put out anything
2152 for the field). What is the story here? What does the compiler
2153 really do? Also, patch gdb.texinfo for this case; I document
2154 it as a possible problem there. Search for "DBX-style". */
2156 /* This is wrong because this is identical to the symbols
2157 produced for GCC 0-size arrays. For example:
2162 The code which dumped core in such circumstances should be
2163 fixed not to dump core. */
2165 /* g++ -g0 can put out bitpos & bitsize zero for a static
2166 field. This does not give us any way of getting its
2167 class, so we can't know its name. But we can just
2168 ignore the field so we don't dump core and other nasty
2170 if (list
->field
.bitpos
== 0
2171 && list
->field
.bitsize
== 0)
2173 complain (&dbx_class_complaint
, 0);
2174 /* Ignore this field. */
2180 /* Detect an unpacked field and mark it as such.
2181 dbx gives a bit size for all fields.
2182 Note that forward refs cannot be packed,
2183 and treat enums as if they had the width of ints. */
2184 if (TYPE_CODE (list
->field
.type
) != TYPE_CODE_INT
2185 && TYPE_CODE (list
->field
.type
) != TYPE_CODE_ENUM
)
2186 list
->field
.bitsize
= 0;
2187 if ((list
->field
.bitsize
== 8 * TYPE_LENGTH (list
->field
.type
)
2188 || (TYPE_CODE (list
->field
.type
) == TYPE_CODE_ENUM
2189 && (list
->field
.bitsize
2190 == 8 * TYPE_LENGTH (builtin_type_int
))
2194 list
->field
.bitpos
% 8 == 0)
2195 list
->field
.bitsize
= 0;
2201 /* chill the list of fields: the last entry (at the head)
2202 is a partially constructed entry which we now scrub. */
2205 /* Now create the vector of fields, and record how big it is.
2206 We need this info to record proper virtual function table information
2207 for this class's virtual functions. */
2209 TYPE_NFIELDS (type
) = nfields
;
2210 TYPE_FIELDS (type
) = (struct field
*) obstack_alloc (symbol_obstack
,
2211 sizeof (struct field
) * nfields
);
2213 if (non_public_fields
)
2215 ALLOCATE_CPLUS_STRUCT_TYPE (type
);
2217 TYPE_FIELD_PRIVATE_BITS (type
) =
2218 (B_TYPE
*) obstack_alloc (symbol_obstack
, B_BYTES (nfields
));
2219 B_CLRALL (TYPE_FIELD_PRIVATE_BITS (type
), nfields
);
2221 TYPE_FIELD_PROTECTED_BITS (type
) =
2222 (B_TYPE
*) obstack_alloc (symbol_obstack
, B_BYTES (nfields
));
2223 B_CLRALL (TYPE_FIELD_PROTECTED_BITS (type
), nfields
);
2226 /* Copy the saved-up fields into the field vector. */
2228 for (n
= nfields
; list
; list
= list
->next
)
2231 TYPE_FIELD (type
, n
) = list
->field
;
2232 if (list
->visibility
== 0)
2233 SET_TYPE_FIELD_PRIVATE (type
, n
);
2234 else if (list
->visibility
== 1)
2235 SET_TYPE_FIELD_PROTECTED (type
, n
);
2238 /* Now come the method fields, as NAME::methods
2239 where each method is of the form TYPENUM,ARGS,...:PHYSNAME;
2240 At the end, we see a semicolon instead of a field.
2242 For the case of overloaded operators, the format is
2243 OPERATOR::*.methods, where OPERATOR is the string "operator",
2244 `*' holds the place for an operator name (such as `+=')
2245 and `.' marks the end of the operator name. */
2248 /* Now, read in the methods. To simplify matters, we
2249 "unread" the name that has been read, so that we can
2250 start from the top. */
2252 ALLOCATE_CPLUS_STRUCT_TYPE (type
);
2253 /* For each list of method lists... */
2257 struct next_fnfield
*sublist
= 0;
2258 struct type
*look_ahead_type
= NULL
;
2260 struct next_fnfieldlist
*new_mainlist
=
2261 (struct next_fnfieldlist
*)alloca (sizeof (struct next_fnfieldlist
));
2266 /* read in the name. */
2267 while (*p
!= ':') p
++;
2268 if ((*pp
)[0] == 'o' && (*pp
)[1] == 'p' && (*pp
)[2] == CPLUS_MARKER
)
2270 /* This is a completely wierd case. In order to stuff in the
2271 names that might contain colons (the usual name delimiter),
2272 Mike Tiemann defined a different name format which is
2273 signalled if the identifier is "op$". In that case, the
2274 format is "op$::XXXX." where XXXX is the name. This is
2275 used for names like "+" or "=". YUUUUUUUK! FIXME! */
2276 /* This lets the user type "break operator+".
2277 We could just put in "+" as the name, but that wouldn't
2279 static char opname
[32] = {'o', 'p', CPLUS_MARKER
};
2280 char *o
= opname
+ 3;
2282 /* Skip past '::'. */
2284 if (**pp
== '\\') *pp
= next_symbol_text ();
2288 main_fn_name
= savestring (opname
, o
- opname
);
2293 main_fn_name
= savestring (*pp
, p
- *pp
);
2294 /* Skip past '::'. */
2296 new_mainlist
->fn_fieldlist
.name
= main_fn_name
;
2300 struct next_fnfield
*new_sublist
=
2301 (struct next_fnfield
*)alloca (sizeof (struct next_fnfield
));
2303 /* Check for and handle cretinous dbx symbol name continuation! */
2304 if (look_ahead_type
== NULL
) /* Normal case. */
2306 if (**pp
== '\\') *pp
= next_symbol_text ();
2308 new_sublist
->fn_field
.type
= read_type (pp
);
2310 /* Invalid symtab info for method. */
2311 return error_type (pp
);
2314 { /* g++ version 1 kludge */
2315 new_sublist
->fn_field
.type
= look_ahead_type
;
2316 look_ahead_type
= NULL
;
2321 while (*p
!= ';') p
++;
2323 /* If this is just a stub, then we don't have the
2325 if (TYPE_FLAGS (new_sublist
->fn_field
.type
) & TYPE_FLAG_STUB
)
2326 new_sublist
->fn_field
.is_stub
= 1;
2327 new_sublist
->fn_field
.physname
= savestring (*pp
, p
- *pp
);
2330 /* Set this method's visibility fields. */
2331 switch (*(*pp
)++ - '0')
2334 new_sublist
->fn_field
.is_private
= 1;
2337 new_sublist
->fn_field
.is_protected
= 1;
2341 if (**pp
== '\\') *pp
= next_symbol_text ();
2344 case 'A': /* Normal functions. */
2345 new_sublist
->fn_field
.is_const
= 0;
2346 new_sublist
->fn_field
.is_volatile
= 0;
2349 case 'B': /* `const' member functions. */
2350 new_sublist
->fn_field
.is_const
= 1;
2351 new_sublist
->fn_field
.is_volatile
= 0;
2354 case 'C': /* `volatile' member function. */
2355 new_sublist
->fn_field
.is_const
= 0;
2356 new_sublist
->fn_field
.is_volatile
= 1;
2359 case 'D': /* `const volatile' member function. */
2360 new_sublist
->fn_field
.is_const
= 1;
2361 new_sublist
->fn_field
.is_volatile
= 1;
2364 case '*': /* File compiled with g++ version 1 -- no info */
2369 complain(&const_vol_complaint
, **pp
);
2376 /* virtual member function, followed by index. */
2377 /* The sign bit is set to distinguish pointers-to-methods
2378 from virtual function indicies. Since the array is
2379 in words, the quantity must be shifted left by 1
2380 on 16 bit machine, and by 2 on 32 bit machine, forcing
2381 the sign bit out, and usable as a valid index into
2382 the array. Remove the sign bit here. */
2383 new_sublist
->fn_field
.voffset
=
2384 (0x7fffffff & read_number (pp
, ';')) + 2;
2386 if (**pp
== '\\') *pp
= next_symbol_text ();
2388 if (**pp
== ';' || **pp
== '\0')
2389 /* Must be g++ version 1. */
2390 new_sublist
->fn_field
.fcontext
= 0;
2393 /* Figure out from whence this virtual function came.
2394 It may belong to virtual function table of
2395 one of its baseclasses. */
2396 look_ahead_type
= read_type (pp
);
2398 { /* g++ version 1 overloaded methods. */ }
2401 new_sublist
->fn_field
.fcontext
= look_ahead_type
;
2403 return error_type (pp
);
2406 look_ahead_type
= NULL
;
2412 /* static member function. */
2413 new_sublist
->fn_field
.voffset
= VOFFSET_STATIC
;
2414 if (strncmp (new_sublist
->fn_field
.physname
,
2415 main_fn_name
, strlen (main_fn_name
)))
2416 new_sublist
->fn_field
.is_stub
= 1;
2421 complain (&member_fn_complaint
, (*pp
)[-1]);
2422 /* Fall through into normal member function. */
2425 /* normal member function. */
2426 new_sublist
->fn_field
.voffset
= 0;
2427 new_sublist
->fn_field
.fcontext
= 0;
2431 new_sublist
->next
= sublist
;
2432 sublist
= new_sublist
;
2434 if (**pp
== '\\') *pp
= next_symbol_text ();
2436 while (**pp
!= ';' && **pp
!= '\0');
2440 new_mainlist
->fn_fieldlist
.fn_fields
=
2441 (struct fn_field
*) obstack_alloc (symbol_obstack
,
2442 sizeof (struct fn_field
) * length
);
2443 for (i
= length
; (i
--, sublist
); sublist
= sublist
->next
)
2444 new_mainlist
->fn_fieldlist
.fn_fields
[i
] = sublist
->fn_field
;
2446 new_mainlist
->fn_fieldlist
.length
= length
;
2447 new_mainlist
->next
= mainlist
;
2448 mainlist
= new_mainlist
;
2450 total_length
+= length
;
2452 while (**pp
!= ';');
2460 TYPE_FN_FIELDLISTS (type
) = (struct fn_fieldlist
*)
2461 obstack_alloc (symbol_obstack
,
2462 sizeof (struct fn_fieldlist
) * nfn_fields
);
2463 TYPE_NFN_FIELDS (type
) = nfn_fields
;
2464 TYPE_NFN_FIELDS_TOTAL (type
) = total_length
;
2469 for (i
= 0; i
< TYPE_N_BASECLASSES (type
); ++i
)
2470 TYPE_NFN_FIELDS_TOTAL (type
) +=
2471 TYPE_NFN_FIELDS_TOTAL (TYPE_BASECLASS (type
, i
));
2474 for (n
= nfn_fields
; mainlist
; mainlist
= mainlist
->next
)
2475 TYPE_FN_FIELDLISTS (type
)[--n
] = mainlist
->fn_fieldlist
;
2481 if (**pp
== '=' || **pp
== '+' || **pp
== '-')
2483 /* Obsolete flags that used to indicate the presence
2484 of constructors and/or destructors. */
2488 /* Read either a '%' or the final ';'. */
2489 if (*(*pp
)++ == '%')
2491 /* We'd like to be able to derive the vtable pointer field
2492 from the type information, but when it's inherited, that's
2493 hard. A reason it's hard is because we may read in the
2494 info about a derived class before we read in info about
2495 the base class that provides the vtable pointer field.
2496 Once the base info has been read, we could fill in the info
2497 for the derived classes, but for the fact that by then,
2498 we don't remember who needs what. */
2500 int predicted_fieldno
= -1;
2502 /* Now we must record the virtual function table pointer's
2503 field information. */
2511 /* In version 2, we derive the vfield ourselves. */
2512 for (n
= 0; n
< nfields
; n
++)
2514 if (! strncmp (TYPE_FIELD_NAME (type
, n
), vptr_name
,
2515 sizeof (vptr_name
) -1))
2517 predicted_fieldno
= n
;
2521 if (predicted_fieldno
< 0)
2522 for (n
= 0; n
< TYPE_N_BASECLASSES (type
); n
++)
2523 if (! TYPE_FIELD_VIRTUAL (type
, n
)
2524 && TYPE_VPTR_FIELDNO (TYPE_BASECLASS (type
, n
)) >= 0)
2526 predicted_fieldno
= TYPE_VPTR_FIELDNO (TYPE_BASECLASS (type
, n
));
2534 while (*p
!= '\0' && *p
!= ';')
2537 /* Premature end of symbol. */
2538 return error_type (pp
);
2540 TYPE_VPTR_BASETYPE (type
) = t
;
2543 if (TYPE_FIELD_NAME (t
, TYPE_N_BASECLASSES (t
)) == 0)
2545 /* FIXME-tiemann: what's this? */
2547 TYPE_VPTR_FIELDNO (type
) = i
= TYPE_N_BASECLASSES (t
);
2552 else for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); --i
)
2553 if (! strncmp (TYPE_FIELD_NAME (t
, i
), vptr_name
,
2554 sizeof (vptr_name
) -1))
2556 TYPE_VPTR_FIELDNO (type
) = i
;
2560 /* Virtual function table field not found. */
2561 return error_type (pp
);
2564 TYPE_VPTR_FIELDNO (type
) = TYPE_VPTR_FIELDNO (t
);
2567 if (TYPE_VPTR_FIELDNO (type
) != predicted_fieldno
)
2568 error ("TYPE_VPTR_FIELDNO miscalculated");
2578 /* Read a definition of an array type,
2579 and create and return a suitable type object.
2580 Also creates a range type which represents the bounds of that
2583 read_array_type (pp
, type
)
2585 register struct type
*type
;
2587 struct type
*index_type
, *element_type
, *range_type
;
2591 /* Format of an array type:
2592 "ar<index type>;lower;upper;<array_contents_type>". Put code in
2595 Fortran adjustable arrays use Adigits or Tdigits for lower or upper;
2596 for these, produce a type like float[][]. */
2598 index_type
= read_type (pp
);
2600 /* Improper format of array type decl. */
2601 return error_type (pp
);
2604 if (!(**pp
>= '0' && **pp
<= '9'))
2609 lower
= read_number (pp
, ';');
2611 if (!(**pp
>= '0' && **pp
<= '9'))
2616 upper
= read_number (pp
, ';');
2618 element_type
= read_type (pp
);
2627 /* Create range type. */
2628 range_type
= (struct type
*) obstack_alloc (symbol_obstack
,
2629 sizeof (struct type
));
2630 TYPE_CODE (range_type
) = TYPE_CODE_RANGE
;
2631 TYPE_TARGET_TYPE (range_type
) = index_type
;
2633 /* This should never be needed. */
2634 TYPE_LENGTH (range_type
) = sizeof (int);
2636 TYPE_NFIELDS (range_type
) = 2;
2637 TYPE_FIELDS (range_type
) =
2638 (struct field
*) obstack_alloc (symbol_obstack
,
2639 2 * sizeof (struct field
));
2640 TYPE_FIELD_BITPOS (range_type
, 0) = lower
;
2641 TYPE_FIELD_BITPOS (range_type
, 1) = upper
;
2644 TYPE_CODE (type
) = TYPE_CODE_ARRAY
;
2645 TYPE_TARGET_TYPE (type
) = element_type
;
2646 TYPE_LENGTH (type
) = (upper
- lower
+ 1) * TYPE_LENGTH (element_type
);
2647 TYPE_NFIELDS (type
) = 1;
2648 TYPE_FIELDS (type
) =
2649 (struct field
*) obstack_alloc (symbol_obstack
,
2650 sizeof (struct field
));
2651 TYPE_FIELD_TYPE (type
, 0) = range_type
;
2653 /* If we have an array whose element type is not yet known, but whose
2654 bounds *are* known, record it to be adjusted at the end of the file. */
2655 if (TYPE_LENGTH (element_type
) == 0 && !adjustable
)
2656 add_undefined_type (type
);
2662 /* Read a definition of an enumeration type,
2663 and create and return a suitable type object.
2664 Also defines the symbols that represent the values of the type. */
2667 read_enum_type (pp
, type
)
2669 register struct type
*type
;
2674 register struct symbol
*sym
;
2676 struct pending
**symlist
;
2677 struct pending
*osyms
, *syms
;
2680 if (within_function
)
2681 symlist
= &local_symbols
;
2683 symlist
= &file_symbols
;
2685 o_nsyms
= osyms
? osyms
->nsyms
: 0;
2687 /* Read the value-names and their values.
2688 The input syntax is NAME:VALUE,NAME:VALUE, and so on.
2689 A semicolon or comman instead of a NAME means the end. */
2690 while (**pp
&& **pp
!= ';' && **pp
!= ',')
2692 /* Check for and handle cretinous dbx symbol name continuation! */
2693 if (**pp
== '\\') *pp
= next_symbol_text ();
2696 while (*p
!= ':') p
++;
2697 name
= obsavestring (*pp
, p
- *pp
);
2699 n
= read_number (pp
, ',');
2701 sym
= (struct symbol
*) obstack_alloc (symbol_obstack
, sizeof (struct symbol
));
2702 bzero (sym
, sizeof (struct symbol
));
2703 SYMBOL_NAME (sym
) = name
;
2704 SYMBOL_CLASS (sym
) = LOC_CONST
;
2705 SYMBOL_NAMESPACE (sym
) = VAR_NAMESPACE
;
2706 SYMBOL_VALUE (sym
) = n
;
2707 add_symbol_to_list (sym
, symlist
);
2712 (*pp
)++; /* Skip the semicolon. */
2714 /* Now fill in the fields of the type-structure. */
2716 TYPE_LENGTH (type
) = sizeof (int);
2717 TYPE_CODE (type
) = TYPE_CODE_ENUM
;
2718 TYPE_NFIELDS (type
) = nsyms
;
2719 TYPE_FIELDS (type
) = (struct field
*) obstack_alloc (symbol_obstack
, sizeof (struct field
) * nsyms
);
2721 /* Find the symbols for the values and put them into the type.
2722 The symbols can be found in the symlist that we put them on
2723 to cause them to be defined. osyms contains the old value
2724 of that symlist; everything up to there was defined by us. */
2725 /* Note that we preserve the order of the enum constants, so
2726 that in something like "enum {FOO, LAST_THING=FOO}" we print
2727 FOO, not LAST_THING. */
2729 for (syms
= *symlist
, n
= 0; syms
; syms
= syms
->next
)
2734 for (; j
< syms
->nsyms
; j
++,n
++)
2736 struct symbol
*xsym
= syms
->symbol
[j
];
2737 SYMBOL_TYPE (xsym
) = type
;
2738 TYPE_FIELD_NAME (type
, n
) = SYMBOL_NAME (xsym
);
2739 TYPE_FIELD_VALUE (type
, n
) = 0;
2740 TYPE_FIELD_BITPOS (type
, n
) = SYMBOL_VALUE (xsym
);
2741 TYPE_FIELD_BITSIZE (type
, n
) = 0;
2748 /* This screws up perfectly good C programs with enums. FIXME. */
2749 /* Is this Modula-2's BOOLEAN type? Flag it as such if so. */
2750 if(TYPE_NFIELDS(type
) == 2 &&
2751 ((!strcmp(TYPE_FIELD_NAME(type
,0),"TRUE") &&
2752 !strcmp(TYPE_FIELD_NAME(type
,1),"FALSE")) ||
2753 (!strcmp(TYPE_FIELD_NAME(type
,1),"TRUE") &&
2754 !strcmp(TYPE_FIELD_NAME(type
,0),"FALSE"))))
2755 TYPE_CODE(type
) = TYPE_CODE_BOOL
;
2761 /* Read a number from the string pointed to by *PP.
2762 The value of *PP is advanced over the number.
2763 If END is nonzero, the character that ends the
2764 number must match END, or an error happens;
2765 and that character is skipped if it does match.
2766 If END is zero, *PP is left pointing to that character.
2768 If the number fits in a long, set *VALUE and set *BITS to 0.
2769 If not, set *BITS to be the number of bits in the number.
2771 If encounter garbage, set *BITS to -1. */
2774 read_huge_number (pp
, end
, valu
, bits
)
2795 /* Leading zero means octal. GCC uses this to output values larger
2796 than an int (because that would be hard in decimal). */
2803 upper_limit
= LONG_MAX
/ radix
;
2804 while ((c
= *p
++) >= '0' && c
<= ('0' + radix
))
2806 if (n
<= upper_limit
)
2809 n
+= c
- '0'; /* FIXME this overflows anyway */
2814 /* This depends on large values being output in octal, which is
2821 /* Ignore leading zeroes. */
2825 else if (c
== '2' || c
== '3')
2851 /* Large decimal constants are an error (because it is hard to
2852 count how many bits are in them). */
2858 /* -0x7f is the same as 0x80. So deal with it by adding one to
2859 the number of bits. */
2874 #define MAX_OF_C_TYPE(t) ((1 << (sizeof (t)*8 - 1)) - 1)
2875 #define MIN_OF_C_TYPE(t) (-(1 << (sizeof (t)*8 - 1)))
2878 read_range_type (pp
, typenums
)
2886 struct type
*result_type
;
2888 /* First comes a type we are a subrange of.
2889 In C it is usually 0, 1 or the type being defined. */
2890 read_type_number (pp
, rangenums
);
2891 self_subrange
= (rangenums
[0] == typenums
[0] &&
2892 rangenums
[1] == typenums
[1]);
2894 /* A semicolon should now follow; skip it. */
2898 /* The remaining two operands are usually lower and upper bounds
2899 of the range. But in some special cases they mean something else. */
2900 read_huge_number (pp
, ';', &n2
, &n2bits
);
2901 read_huge_number (pp
, ';', &n3
, &n3bits
);
2903 if (n2bits
== -1 || n3bits
== -1)
2904 return error_type (pp
);
2906 /* If limits are huge, must be large integral type. */
2907 if (n2bits
!= 0 || n3bits
!= 0)
2909 char got_signed
= 0;
2910 char got_unsigned
= 0;
2911 /* Number of bits in the type. */
2914 /* Range from 0 to <large number> is an unsigned large integral type. */
2915 if ((n2bits
== 0 && n2
== 0) && n3bits
!= 0)
2920 /* Range from <large number> to <large number>-1 is a large signed
2922 else if (n2bits
!= 0 && n3bits
!= 0 && n2bits
== n3bits
+ 1)
2928 /* Check for "long long". */
2929 if (got_signed
&& nbits
== TARGET_LONG_LONG_BIT
)
2930 return builtin_type_long_long
;
2931 if (got_unsigned
&& nbits
== TARGET_LONG_LONG_BIT
)
2932 return builtin_type_unsigned_long_long
;
2934 if (got_signed
|| got_unsigned
)
2936 result_type
= (struct type
*) obstack_alloc (symbol_obstack
,
2937 sizeof (struct type
));
2938 bzero (result_type
, sizeof (struct type
));
2939 TYPE_LENGTH (result_type
) = nbits
/ TARGET_CHAR_BIT
;
2940 TYPE_CODE (result_type
) = TYPE_CODE_INT
;
2942 TYPE_FLAGS (result_type
) |= TYPE_FLAG_UNSIGNED
;
2946 return error_type (pp
);
2949 /* A type defined as a subrange of itself, with bounds both 0, is void. */
2950 if (self_subrange
&& n2
== 0 && n3
== 0)
2951 return builtin_type_void
;
2953 /* If n3 is zero and n2 is not, we want a floating type,
2954 and n2 is the width in bytes.
2956 Fortran programs appear to use this for complex types also,
2957 and they give no way to distinguish between double and single-complex!
2958 We don't have complex types, so we would lose on all fortran files!
2959 So return type `double' for all of those. It won't work right
2960 for the complex values, but at least it makes the file loadable.
2962 FIXME, we may be able to distinguish these by their names. FIXME. */
2964 if (n3
== 0 && n2
> 0)
2966 if (n2
== sizeof (float))
2967 return builtin_type_float
;
2968 return builtin_type_double
;
2971 /* If the upper bound is -1, it must really be an unsigned int. */
2973 else if (n2
== 0 && n3
== -1)
2975 /* FIXME -- the only way to distinguish `unsigned int' from `unsigned
2976 long' is to look at its name! */
2978 long_kludge_name
&& ((long_kludge_name
[0] == 'u' /* unsigned */ &&
2979 long_kludge_name
[9] == 'l' /* long */)
2980 || (long_kludge_name
[0] == 'l' /* long unsigned */)))
2981 return builtin_type_unsigned_long
;
2983 return builtin_type_unsigned_int
;
2986 /* Special case: char is defined (Who knows why) as a subrange of
2987 itself with range 0-127. */
2988 else if (self_subrange
&& n2
== 0 && n3
== 127)
2989 return builtin_type_char
;
2991 /* Assumptions made here: Subrange of self is equivalent to subrange
2992 of int. FIXME: Host and target type-sizes assumed the same. */
2993 /* FIXME: This is the *only* place in GDB that depends on comparing
2994 some type to a builtin type with ==. Fix it! */
2996 && (self_subrange
||
2997 *dbx_lookup_type (rangenums
) == builtin_type_int
))
2999 /* an unsigned type */
3001 if (n3
== - sizeof (long long))
3002 return builtin_type_unsigned_long_long
;
3004 /* FIXME -- the only way to distinguish `unsigned int' from `unsigned
3005 long' is to look at its name! */
3006 if (n3
== (unsigned long)~0L &&
3007 long_kludge_name
&& ((long_kludge_name
[0] == 'u' /* unsigned */ &&
3008 long_kludge_name
[9] == 'l' /* long */)
3009 || (long_kludge_name
[0] == 'l' /* long unsigned */)))
3010 return builtin_type_unsigned_long
;
3011 if (n3
== (unsigned int)~0L)
3012 return builtin_type_unsigned_int
;
3013 if (n3
== (unsigned short)~0L)
3014 return builtin_type_unsigned_short
;
3015 if (n3
== (unsigned char)~0L)
3016 return builtin_type_unsigned_char
;
3019 else if (n3
== 0 && n2
== -sizeof (long long))
3020 return builtin_type_long_long
;
3022 else if (n2
== -n3
-1)
3025 /* FIXME -- the only way to distinguish `int' from `long' is to look
3027 if ((n3
== (1 << (8 * sizeof (long) - 1)) - 1) &&
3028 long_kludge_name
&& long_kludge_name
[0] == 'l' /* long */)
3029 return builtin_type_long
;
3030 if (n3
== (1 << (8 * sizeof (int) - 1)) - 1)
3031 return builtin_type_int
;
3032 if (n3
== (1 << (8 * sizeof (short) - 1)) - 1)
3033 return builtin_type_short
;
3034 if (n3
== (1 << (8 * sizeof (char) - 1)) - 1)
3035 return builtin_type_char
;
3038 /* We have a real range type on our hands. Allocate space and
3039 return a real pointer. */
3041 /* At this point I don't have the faintest idea how to deal with
3042 a self_subrange type; I'm going to assume that this is used
3043 as an idiom, and that all of them are special cases. So . . . */
3045 return error_type (pp
);
3047 result_type
= (struct type
*) obstack_alloc (symbol_obstack
,
3048 sizeof (struct type
));
3049 bzero (result_type
, sizeof (struct type
));
3051 TYPE_CODE (result_type
) = TYPE_CODE_RANGE
;
3053 TYPE_TARGET_TYPE (result_type
) = *dbx_lookup_type(rangenums
);
3054 if (TYPE_TARGET_TYPE (result_type
) == 0) {
3055 complain (&range_type_base_complaint
, rangenums
[1]);
3056 TYPE_TARGET_TYPE (result_type
) = builtin_type_int
;
3059 TYPE_NFIELDS (result_type
) = 2;
3060 TYPE_FIELDS (result_type
) =
3061 (struct field
*) obstack_alloc (symbol_obstack
,
3062 2 * sizeof (struct field
));
3063 bzero (TYPE_FIELDS (result_type
), 2 * sizeof (struct field
));
3064 TYPE_FIELD_BITPOS (result_type
, 0) = n2
;
3065 TYPE_FIELD_BITPOS (result_type
, 1) = n3
;
3067 TYPE_LENGTH (result_type
) = TYPE_LENGTH (TYPE_TARGET_TYPE (result_type
));
3072 /* Read a number from the string pointed to by *PP.
3073 The value of *PP is advanced over the number.
3074 If END is nonzero, the character that ends the
3075 number must match END, or an error happens;
3076 and that character is skipped if it does match.
3077 If END is zero, *PP is left pointing to that character. */
3080 read_number (pp
, end
)
3084 register char *p
= *pp
;
3085 register long n
= 0;
3089 /* Handle an optional leading minus sign. */
3097 /* Read the digits, as far as they go. */
3099 while ((c
= *p
++) >= '0' && c
<= '9')
3107 error ("Invalid symbol data: invalid character \\%03o at symbol pos %d.", c
, symnum
);
3116 /* Read in an argument list. This is a list of types, separated by commas
3117 and terminated with END. Return the list of types read in, or (struct type
3118 **)-1 if there is an error. */
3124 /* FIXME! Remove this arbitrary limit! */
3125 struct type
*types
[1024], **rval
; /* allow for fns of 1023 parameters */
3131 /* Invalid argument list: no ','. */
3132 return (struct type
**)-1;
3135 /* Check for and handle cretinous dbx symbol name continuation! */
3137 *pp
= next_symbol_text ();
3139 types
[n
++] = read_type (pp
);
3141 *pp
+= 1; /* get past `end' (the ':' character) */
3145 rval
= (struct type
**) xmalloc (2 * sizeof (struct type
*));
3147 else if (TYPE_CODE (types
[n
-1]) != TYPE_CODE_VOID
)
3149 rval
= (struct type
**) xmalloc ((n
+ 1) * sizeof (struct type
*));
3150 bzero (rval
+ n
, sizeof (struct type
*));
3154 rval
= (struct type
**) xmalloc (n
* sizeof (struct type
*));
3156 memcpy (rval
, types
, n
* sizeof (struct type
*));
3160 /* Add a common block's start address to the offset of each symbol
3161 declared to be in it (by being between a BCOMM/ECOMM pair that uses
3162 the common block name). */
3165 fix_common_block (sym
, valu
)
3169 struct pending
*next
= (struct pending
*) SYMBOL_NAMESPACE (sym
);
3170 for ( ; next
; next
= next
->next
)
3173 for (j
= next
->nsyms
- 1; j
>= 0; j
--)
3174 SYMBOL_VALUE_ADDRESS (next
->symbol
[j
]) += valu
;
3178 /* Initializer for this module */
3180 _initialize_buildsym ()
3182 undef_types_allocated
= 20;
3183 undef_types_length
= 0;
3184 undef_types
= (struct type
**) xmalloc (undef_types_allocated
*
3185 sizeof (struct type
*));