1 /* Read a symbol table in MIPS' format (Third-Eye).
2 Copyright (C) 1986, 1987, 1989-1991 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* This module provides three functions: mipscoff_symfile_init,
22 which initializes to read a symbol file; mipscoff_new_init, which
23 discards existing cached information when all symbols are being
24 discarded; and mipscoff_symfile_read, which reads a symbol table
27 mipscoff_symfile_read only does the minimum work necessary for letting the
28 user "name" things symbolically; it does not read the entire symtab.
29 Instead, it reads the external and static symbols and puts them in partial
30 symbol tables. When more extensive information is requested of a
31 file, the corresponding partial symbol table is mutated into a full
32 fledged symbol table by going back and reading the symbols
33 for real. mipscoff_psymtab_to_symtab() is called indirectly through
34 a pointer in the psymtab to do this. */
39 #include <sys/param.h>
47 #include <mips/syms.h>
51 #endif /* not CMUCS */
53 #include "coff-mips.h"
56 struct external_filehdr f;
57 struct external_aouthdr a;
60 /* Each partial symbol table entry contains a pointer to private data for the
61 read_symtab() function to use when expanding a partial symbol table entry
62 to a full symbol table entry.
64 For mipsread this structure contains the index of the FDR that this psymtab
65 represents and a pointer to the symbol table header HDRR from the symbol
66 file that the psymtab was created from. */
68 #define FDR_IDX(p) (((struct symloc *)((p)->read_symtab_private))->fdr_idx)
69 #define CUR_HDR(p) (((struct symloc *)((p)->read_symtab_private))->cur_hdr)
76 /* Things we import explicitly from other modules */
78 extern int info_verbose;
79 extern struct block *block_for_pc();
80 extern void sort_symtab_syms();
82 /* Various complaints about symbol reading that don't abort the process */
84 struct complaint unknown_ext_complaint =
85 {"unknown external symbol %s", 0, 0};
87 struct complaint unknown_sym_complaint =
88 {"unknown local symbol %s", 0, 0};
90 struct complaint unknown_st_complaint =
91 {"with type %d", 0, 0};
93 struct complaint block_overflow_complaint =
94 {"block containing %s overfilled", 0, 0};
96 struct complaint basic_type_complaint =
97 {"cannot map MIPS basic type 0x%x", 0, 0};
99 struct complaint unknown_type_qual_complaint =
100 {"unknown type qualifier 0x%x", 0, 0};
102 struct complaint array_bitsize_complaint =
103 {"size of array target type not known, assuming %d bits", 0, 0};
105 struct complaint array_parse_complaint =
106 {"array type with strange relative symbol", 0, 0};
108 /* Macros and extra defs */
110 /* Already-parsed symbols are marked specially */
112 #define stParsed stType
114 /* Puns: hard to find whether -g was used and how */
116 #define MIN_GLEVEL GLEVEL_0
117 #define compare_glevel(a,b) \
118 (((a) == GLEVEL_3) ? ((b) < GLEVEL_3) : \
119 ((b) == GLEVEL_3) ? -1 : (int)((b) - (a)))
121 /* When looking at .o files, avoid tripping over bad addresses */
123 #define SAFE_TEXT_ADDR 0x400000
124 #define SAFE_DATA_ADDR 0x10000000
126 #define UNSAFE_DATA_ADDR(p) ((unsigned)p < SAFE_DATA_ADDR || (unsigned)p > 2*SAFE_DATA_ADDR)
128 /* Things that really are local to this module */
130 /* GDB symtable for the current compilation unit */
132 static struct symtab *cur_stab;
134 /* MIPS symtab header for the current file */
136 static HDRR *cur_hdr;
138 /* Pointer to current file decriptor record, and its index */
143 /* Index of current symbol */
147 /* Note how much "debuggable" this image is. We would like
148 to see at least one FDR with full symbols */
153 /* When examining .o files, report on undefined symbols */
155 static int n_undef_symbols, n_undef_labels, n_undef_vars, n_undef_procs;
157 /* Extra builtin types */
159 struct type *builtin_type_complex;
160 struct type *builtin_type_double_complex;
161 struct type *builtin_type_fixed_dec;
162 struct type *builtin_type_float_dec;
163 struct type *builtin_type_string;
167 static struct type *builtin_type_ptr;
168 static struct type *builtin_type_struct;
169 static struct type *builtin_type_union;
170 static struct type *builtin_type_enum;
171 static struct type *builtin_type_range;
172 static struct type *builtin_type_set;
174 /* Forward declarations */
176 static struct symbol *new_symbol();
177 static struct type *new_type();
178 static struct field *new_field();
179 static struct block *new_block();
180 static struct symtab *new_symtab();
181 static struct linetable *new_linetable();
182 static struct blockvector *new_bvect();
184 static struct type *parse_type();
185 static struct type *make_type();
186 static struct symbol *mylookup_symbol();
187 static struct block *shrink_block();
189 static int compare_symtabs();
190 static int compare_psymtabs();
191 static int compare_blocks();
193 static struct partial_symtab *new_psymtab();
194 static struct partial_symtab *parse_fdr();
195 static int compare_psymbols();
197 static void psymtab_to_symtab_1();
198 static void add_block();
199 static void add_symbol();
200 static int add_line();
201 static void reorder_symtabs();
202 static void reorder_psymtabs();
203 static void shrink_linetable();
205 /* Things we export to other modules */
207 /* Address bounds for the signal trampoline in inferior, if any */
208 /* FIXME: Nothing really seems to use this. Why is it here? */
210 CORE_ADDR sigtramp_address, sigtramp_end;
212 /* The entry point (starting address) of the file, if it is an executable. */
214 extern CORE_ADDR startup_file_start; /* From blockframe.c */
215 extern CORE_ADDR startup_file_end; /* From blockframe.c */
220 /* If we have a file symbol header lying around, blow it away. */
222 free ((char *)cur_hdr);
227 mipscoff_symfile_init (sf)
230 sf->sym_private = NULL;
234 mipscoff_symfile_read(sf, addr, mainline)
239 struct coff_symfile_info *info = (struct coff_symfile_info *)sf->sym_private;
240 bfd *abfd = sf->objfile->obfd;
241 char *name = bfd_get_filename (abfd);
245 int stringtab_offset;
247 /* Initialize a variable that we couldn't do at _initialize_ time. */
248 builtin_type_ptr = lookup_pointer_type (builtin_type_void);
250 /* WARNING WILL ROBINSON! ACCESSING BFD-PRIVATE DATA HERE! FIXME! */
251 desc = fileno ((FILE *)(abfd->iostream)); /* Raw file descriptor */
254 /* Position to read the symbol table. */
255 val = lseek (desc, (long)symtab_offset, 0);
257 perror_with_name (name);
259 init_misc_bunches ();
260 make_cleanup (discard_misc_bunches, 0);
262 /* Now that the executable file is positioned at symbol table,
263 process it and define symbols accordingly. */
265 read_mips_symtab(sf->objfile, desc);
267 /* Go over the misc symbol bunches and install them in vector. */
269 condense_misc_bunches (!mainline);
272 /* Exported procedure: Allocate zeroed memory */
277 char *p = xmalloc(size);
283 /* Exported procedure: Builds a symtab from the PST partial one.
284 Restores the environment in effect when PST was created, delegates
285 most of the work to an ancillary procedure, and sorts
286 and reorders the symtab list at the end */
289 mipscoff_psymtab_to_symtab(pst)
290 struct partial_symtab *pst;
299 printf_filtered("Reading in symbols for %s...", pst->filename);
302 /* Restore the header and list of pending typedefs */
303 cur_hdr = CUR_HDR(pst);
305 psymtab_to_symtab_1(pst, pst->filename);
310 printf_filtered("done.\n");
313 /* Exported procedure: Is PC in the signal trampoline code */
316 in_sigtramp(pc, name)
320 if (sigtramp_address == 0)
322 return (pc >= sigtramp_address && pc < sigtramp_end);
325 /* File-level interface functions */
327 /* Read the symtab information from file FSYM into memory. Also,
328 return address just past end of our text segment in *END_OF_TEXT_SEGP. */
331 read_the_mips_symtab(abfd, fsym, end_of_text_segp)
334 CORE_ADDR *end_of_text_segp;
336 int stsize, st_hdrsize;
339 /* Header for executable/object file we read symbols from */
340 struct coff_exec filhdr;
342 /* We get here with DESC pointing to the symtab header. But we need
343 * other info from the initial headers */
345 myread(fsym, &filhdr, sizeof filhdr);
347 if (end_of_text_segp)
349 bfd_h_get_32 (abfd, filhdr.a.text_start) +
350 bfd_h_get_32 (abfd, filhdr.a.tsize);
352 /* Find and read the symbol table header */
353 st_hdrsize = bfd_h_get_32 (abfd, filhdr.f.f_nsyms);
354 st_filptr = bfd_h_get_32 (abfd, filhdr.f.f_symptr);
358 lseek(fsym, st_filptr, L_SET);
359 if (st_hdrsize > sizeof (st_hdr)) /* Profanity check */
361 if (read(fsym, &st_hdr, st_hdrsize) != st_hdrsize)
364 /* Find out how large the symbol table is */
365 stsize = (st_hdr.cbExtOffset - (st_filptr + st_hdrsize))
366 + st_hdr.iextMax * cbEXTR;
368 /* Allocate space for the symbol table. Read it in. */
369 cur_hdr = (HDRR *) xmalloc(stsize + st_hdrsize);
371 bcopy(&st_hdr, cur_hdr, st_hdrsize);
372 if (read(fsym, (char *) cur_hdr + st_hdrsize, stsize) != stsize)
375 /* Fixup file_pointers in it */
376 fixup_symtab(cur_hdr, (char *) cur_hdr + st_hdrsize,
377 st_filptr + st_hdrsize);
381 error("Short read on %s", bfd_get_filename (abfd));
385 /* Turn all file-relative pointers in the symtab described by HDR
386 into memory pointers, given that the symtab itself is located
387 at DATA in memory and F_PTR in the file. */
390 fixup_symtab( hdr, data, f_ptr)
402 * These fields are useless (and empty) by now:
403 * hdr->cbDnOffset, hdr->cbOptOffset
404 * We use them for other internal purposes.
407 hdr->cbOptOffset = 0;
410 if (hdr->off) hdr->off = (unsigned int)data + (hdr->off - f_ptr);
426 * Fix all string pointers inside the symtab, and
427 * the FDR records. Also fix other miscellany.
429 for (f_idx = 0; f_idx < hdr->ifdMax; f_idx++) {
430 register unsigned code_offset;
432 /* Header itself, and strings */
433 fh = (FDR *) (hdr->cbFdOffset) + f_idx;
434 fh->issBase += hdr->cbSsOffset;
436 fh->rss = (long)fh->rss + fh->issBase;
437 for (s_idx = 0; s_idx < fh->csym; s_idx++) {
438 sh = (SYMR*)(hdr->cbSymOffset) + fh->isymBase + s_idx;
439 sh->iss = (long) sh->iss + fh->issBase;
446 fh->isymBase = (int)((SYMR*)(hdr->cbSymOffset)+fh->isymBase);
448 /* cannot fix fh->ipdFirst because it is a short */
449 #define IPDFIRST(h,fh) \
450 ((long)h->cbPdOffset + fh->ipdFirst * sizeof(PDR))
452 /* Optional symbols (actually used for partial_symtabs) */
458 fh->iauxBase = hdr->cbAuxOffset + fh->iauxBase * sizeof(AUXU);
459 /* Relative file descriptor table */
460 fh->rfdBase = hdr->cbRfdOffset + fh->rfdBase * sizeof(RFDT);
464 fh->cbLineOffset += hdr->cbLineOffset;
466 /* Procedure symbols. (XXX This should be done later) */
467 code_offset = fh->adr;
468 for (s_idx = 0; s_idx < fh->cpd; s_idx++) {
469 unsigned name, only_ext;
471 pr = (PDR*)(IPDFIRST(hdr,fh)) + s_idx;
473 /* Simple rule to find files linked "-x" */
474 only_ext = fh->rss == -1;
476 if (pr->isym == -1) {
477 /* static function */
481 name = hdr->cbExtOffset + pr->isym * sizeof(EXTR);
482 sh = &((EXTR*)name)->asym;
486 sh = (SYMR*)fh->isymBase + pr->isym;
487 /* Included code ? */
488 if (s_idx == 0 && pr->adr != 0)
489 code_offset -= pr->adr;
492 /* Turn index into a pointer */
495 /* Fix line numbers */
496 pr->cbLineOffset += fh->cbLineOffset;
498 /* Relocate address */
500 pr->adr += code_offset;
504 /* External symbols: fix string */
505 for (s_idx = 0; s_idx < hdr->iextMax; s_idx++) {
506 esh = (EXTR*)(hdr->cbExtOffset) + s_idx;
507 esh->asym.iss = esh->asym.iss + hdr->cbSsExtOffset;
512 /* Find a file descriptor given its index RF relative to a file CF */
520 f = (FDR *) (cur_hdr->cbFdOffset) + cf;
521 /* Object files do not have the RFD table, all refs are absolute */
523 return (FDR *) (cur_hdr->cbFdOffset) + rf;
524 cf = *((pRFDT) f->rfdBase + rf);
525 return (FDR *) (cur_hdr->cbFdOffset) + cf;
528 /* Return a safer print NAME for a file descriptor */
534 if (name == (char *) -1)
535 return "<stripped file>";
536 if (UNSAFE_DATA_ADDR(name))
542 /* Read in and parse the symtab of the file DESC. INCREMENTAL says
543 whether we are adding to the general symtab or not.
544 FIXME: INCREMENTAL is currently always zero, though it should not be. */
547 read_mips_symtab (objfile, desc)
548 struct objfile *objfile;
551 CORE_ADDR end_of_text_seg;
553 read_the_mips_symtab(objfile->obfd, desc, &end_of_text_seg);
555 parse_partial_symbols(end_of_text_seg, objfile);
558 * Check to make sure file was compiled with -g.
559 * If not, warn the user of this limitation.
561 if (compare_glevel(max_glevel, GLEVEL_2) < 0) {
562 if (max_gdbinfo == 0)
564 "\n%s not compiled with -g, debugging support is limited.\n",
567 "You should compile with -g2 or -g3 for best debugging support.\n");
572 /* Local utilities */
574 /* Map of FDR indexes to partial symtabs */
576 static struct pst_map {
577 struct partial_symtab *pst; /* the psymtab proper */
578 int n_globals; /* globals it exports */
579 int n_statics; /* statics (locals) it contains */
583 /* Utility stack, used to nest procedures and blocks properly.
584 It is a doubly linked list, to avoid too many alloc/free.
585 Since we might need it quite a few times it is NOT deallocated
588 static struct parse_stack {
589 struct parse_stack *next, *prev;
590 struct symtab *cur_st; /* Current symtab */
591 struct block *cur_block; /* Block in it */
592 int blocktype; /* What are we parsing */
593 int maxsyms; /* Max symbols in this block */
594 struct type *cur_type; /* Type we parse fields for */
595 int procadr; /* Start addres of this procedure */
596 int numargs; /* Its argument count */
597 } *top_stack; /* Top stack ptr */
600 /* Enter a new lexical context */
602 static push_parse_stack()
604 struct parse_stack *new;
606 /* Reuse frames if possible */
607 if (top_stack && top_stack->prev)
608 new = top_stack->prev;
610 new = (struct parse_stack *) xzalloc(sizeof(struct parse_stack));
611 /* Initialize new frame with previous content */
613 register struct parse_stack *prev = new->prev;
616 top_stack->prev = new;
618 new->next = top_stack;
623 /* Exit a lexical context */
625 static pop_parse_stack()
630 top_stack = top_stack->next;
634 /* Cross-references might be to things we haven't looked at
635 yet, e.g. type references. To avoid too many type
636 duplications we keep a quick fixup table, an array
637 of lists of references indexed by file descriptor */
639 static struct pending {
640 struct pending *next; /* link */
641 SYMR *s; /* the symbol */
642 struct type *t; /* its partial type descriptor */
646 /* Check whether we already saw symbol SH in file FH as undefined */
649 struct pending *is_pending_symbol(fh, sh)
653 int f_idx = fh - (FDR *) cur_hdr->cbFdOffset;
654 register struct pending *p;
656 /* Linear search is ok, list is typically no more than 10 deep */
657 for (p = pending_list[f_idx]; p; p = p->next)
663 /* Check whether we already saw type T in file FH as undefined */
666 struct pending *is_pending_type(fh, t)
670 int f_idx = fh - (FDR *) cur_hdr->cbFdOffset;
671 register struct pending *p;
673 for (p = pending_list[f_idx]; p; p = p->next)
679 /* Add a new undef symbol SH of type T */
682 add_pending(fh, sh, t)
687 int f_idx = fh - (FDR *) cur_hdr->cbFdOffset;
688 struct pending *p = is_pending_symbol(fh, sh);
690 /* Make sure we do not make duplicates */
692 p = (struct pending *) xmalloc(sizeof(*p));
695 p->next = pending_list[f_idx];
696 pending_list[f_idx] = p;
698 sh->reserved = 1; /* for quick check */
701 /* Throw away undef entries when done with file index F_IDX */
706 register struct pending *p, *q;
708 for (p = pending_list[f_idx]; p; p = q) {
712 pending_list[f_idx] = 0;
715 /* The number of args to a procedure is not explicit in the symtab,
716 this is the list of all those we know of.
717 This makes parsing more reasonable and avoids extra passes */
719 static struct numarg {
720 struct numarg *next; /* link */
721 unsigned adr; /* procedure's start address */
722 unsigned num; /* arg count */
725 /* Record that the procedure at ADR takes NUM arguments. */
730 struct numarg *n = (struct numarg *) xmalloc(sizeof(struct numarg));
734 n->next = numargs_list;
738 /* See if we know how many arguments the procedure at ADR takes */
743 struct numarg *n = numargs_list;
745 while (n && n->adr != adr)
747 return (n) ? n->num : -1;
750 /* Release storage when done with this file */
755 struct numarg *n = numargs_list, *m;
766 /* Parsing Routines proper. */
768 /* Parse a single symbol. Mostly just make up a GDB symbol for it.
769 For blocks, procedures and types we open a new lexical context.
770 This is basically just a big switch on the symbol's type */
781 /* When a symbol is cross-referenced from other files/symbols
782 we mark it explicitly */
783 int pend = (sh->reserved == 1);
784 enum address_class class;
791 case stGlobal: /* external symbol, goes into global block */
793 b = BLOCKVECTOR_BLOCK(BLOCKVECTOR(top_stack->cur_st),
795 s = new_symbol(sh->iss);
796 SYMBOL_VALUE_ADDRESS(s) = (CORE_ADDR)sh->value;
799 case stStatic: /* static data, goes into current block. */
801 b = top_stack->cur_block;
802 s = new_symbol(sh->iss);
803 SYMBOL_VALUE_ADDRESS(s) = (CORE_ADDR)sh->value;
806 case stLocal: /* local variable, goes into current block */
807 if (sh->sc == scRegister) {
808 class = LOC_REGISTER;
813 b = top_stack->cur_block;
814 s = new_symbol(sh->iss);
815 SYMBOL_VALUE(s) = sh->value;
817 data: /* Common code for symbols describing data */
818 SYMBOL_NAMESPACE(s) = VAR_NAMESPACE;
819 SYMBOL_CLASS(s) = class;
822 /* Type could be missing in a number of cases */
823 if (sh->sc == scUndefined || sh->sc == scNil ||
824 sh->index == 0xfffff)
825 SYMBOL_TYPE(s) = builtin_type_int; /* undefined? */
827 SYMBOL_TYPE(s) = parse_type(ax + sh->index, sh, 0);
828 /* Value of a data symbol is its memory address */
831 case stParam: /* arg to procedure, goes into current block */
833 top_stack->numargs++;
834 s = new_symbol(sh->iss);
835 SYMBOL_NAMESPACE(s) = VAR_NAMESPACE;
836 if (sh->sc == scRegister) {
837 SYMBOL_CLASS(s) = LOC_REGPARM;
841 SYMBOL_CLASS(s) = LOC_ARG;
842 SYMBOL_VALUE(s) = sh->value;
843 SYMBOL_TYPE(s) = parse_type(ax + sh->index, sh, 0);
844 add_symbol(s, top_stack->cur_block);
846 /* FIXME: This has not been tested. See dbxread.c */
847 /* Add the type of this parameter to the function/procedure
848 type of this block. */
849 add_param_to_type(&top_stack->cur_block->function->type,s);
853 case stLabel: /* label, goes into current block */
854 s = new_symbol(sh->iss);
855 SYMBOL_NAMESPACE(s) = VAR_NAMESPACE; /* so that it can be used */
856 SYMBOL_CLASS(s) = LOC_LABEL; /* but not misused */
857 SYMBOL_VALUE_ADDRESS(s) = (CORE_ADDR)sh->value;
858 SYMBOL_TYPE(s) = builtin_type_int;
859 add_symbol(s, top_stack->cur_block);
862 case stProc: /* Procedure, usually goes into global block */
863 case stStaticProc: /* Static procedure, goes into current block */
864 s = new_symbol(sh->iss);
865 SYMBOL_NAMESPACE(s) = VAR_NAMESPACE;
866 SYMBOL_CLASS(s) = LOC_BLOCK;
867 /* Type of the return value */
868 if (sh->sc == scUndefined || sh->sc == scNil)
869 t = builtin_type_int;
871 t = parse_type(ax + sh->index, sh, 0);
872 b = top_stack->cur_block;
873 if (sh->st == stProc) {
874 struct blockvector *bv = BLOCKVECTOR(top_stack->cur_st);
875 /* The next test should normally be true,
876 but provides a hook for nested functions
877 (which we don't want to make global). */
878 if (b == BLOCKVECTOR_BLOCK(bv, STATIC_BLOCK))
879 b = BLOCKVECTOR_BLOCK(bv, GLOBAL_BLOCK);
883 /* Make a type for the procedure itself */
885 /* FIXME: This has not been tested yet! See dbxread.c */
886 /* Generate a template for the type of this function. The
887 types of the arguments will be added as we read the symbol
889 bcopy(SYMBOL_TYPE(s),lookup_function_type(t),sizeof(struct type));
891 SYMBOL_TYPE(s) = lookup_function_type (t);
894 /* Create and enter a new lexical context */
895 b = new_block(top_stack->maxsyms);
896 SYMBOL_BLOCK_VALUE(s) = b;
897 BLOCK_FUNCTION(b) = s;
898 BLOCK_START(b) = BLOCK_END(b) = sh->value;
899 BLOCK_SUPERBLOCK(b) = top_stack->cur_block;
900 add_block(b, top_stack->cur_st);
902 /* Not if we only have partial info */
903 if (sh->sc == scUndefined || sh->sc == scNil)
907 top_stack->cur_block = b;
908 top_stack->blocktype = sh->st;
909 top_stack->cur_type = SYMBOL_TYPE(s);
910 top_stack->procadr = sh->value;
911 top_stack->numargs = 0;
913 sh->value = (long) SYMBOL_TYPE(s);
916 case stBlock: /* Either a lexical block, or some type */
918 top_stack->blocktype = stBlock;
919 if (sh->sc == scInfo) { /* structure/union/enum def */
920 s = new_symbol(sh->iss);
921 SYMBOL_NAMESPACE(s) = STRUCT_NAMESPACE;
922 SYMBOL_CLASS(s) = LOC_TYPEDEF;
924 add_symbol(s, top_stack->cur_block);
925 /* If this type was expected, use its partial definition */
927 t = is_pending_symbol(cur_fdr, sh)->t;
929 /* Uhmm, can`t decide yet. Smash later */
930 t = new_type(sh->iss);
931 TYPE_CODE(t) = TYPE_CODE_UNDEF;
932 add_pending(cur_fdr, sh, t);
935 /* make this the current type */
936 top_stack->cur_type = t;
937 TYPE_LENGTH(t) = sh->value;
938 /* Mark that symbol has a type, and say which one */
939 sh->value = (long) t;
941 /* beginnning of (code) block. Value of symbol
942 is the displacement from procedure start */
943 b = new_block(top_stack->maxsyms);
944 BLOCK_START(b) = sh->value + top_stack->procadr;
945 BLOCK_SUPERBLOCK(b) = top_stack->cur_block;
946 top_stack->cur_block = b;
947 add_block(b, top_stack->cur_st);
951 case stEnd: /* end (of anything) */
952 if (sh->sc == scInfo) {
953 /* Finished with type */
954 top_stack->cur_type = 0;
955 } else if (sh->sc == scText &&
956 (top_stack->blocktype == stProc ||
957 top_stack->blocktype == stStaticProc)) {
958 /* Finished with procedure */
959 struct blockvector *bv = BLOCKVECTOR(top_stack->cur_st);
963 BLOCK_END(top_stack->cur_block) += sh->value; /* size */
964 got_numargs(top_stack->procadr, top_stack->numargs);
965 /* Reallocate symbols, saving memory */
966 b = shrink_block(top_stack->cur_block, top_stack->cur_st);
968 /* f77 emits proc-level with address bounds==[0,0],
969 So look for such child blocks, and patch them. */
970 for (i = 0; i < BLOCKVECTOR_NBLOCKS(bv); i++) {
971 struct block *b_bad = BLOCKVECTOR_BLOCK(bv,i);
972 if (BLOCK_SUPERBLOCK(b_bad) == b
973 && BLOCK_START(b_bad) == top_stack->procadr
974 && BLOCK_END(b_bad) == top_stack->procadr) {
975 BLOCK_START(b_bad) = BLOCK_START(b);
976 BLOCK_END(b_bad) = BLOCK_END(b);
979 if (entry_point < BLOCK_END(b)
980 && entry_point >= BLOCK_START(b)) {
981 startup_file_start = BLOCK_START(b);
982 startup_file_end = BLOCK_END(b);
984 } else if (sh->sc == scText && top_stack->blocktype == stBlock) {
985 /* End of (code) block. The value of the symbol
986 is the displacement from the procedure`s start
987 address of the end of this block. */
988 BLOCK_END(top_stack->cur_block) = sh->value + top_stack->procadr;
989 (void) shrink_block(top_stack->cur_block, top_stack->cur_st);
991 pop_parse_stack(); /* restore previous lexical context */
994 case stMember: /* member of struct/union/enum.. */
995 f = new_field(top_stack->cur_type, sh->iss);
996 f->bitpos = sh->value;
997 f->type = parse_type(ax + sh->index, sh, &f->bitsize);
1000 case stTypedef: /* type definition */
1001 s = new_symbol(sh->iss);
1002 SYMBOL_NAMESPACE(s) = VAR_NAMESPACE;
1003 SYMBOL_CLASS(s) = LOC_TYPEDEF;
1004 SYMBOL_BLOCK_VALUE(s) = top_stack->cur_block;
1005 add_symbol(s, top_stack->cur_block);
1006 SYMBOL_TYPE(s) = parse_type(ax + sh->index, sh, 0);
1007 sh->value = (long) SYMBOL_TYPE(s);
1010 case stFile: /* file name */
1012 top_stack->blocktype = sh->st;
1015 /* I`ve never seen these for C */
1017 break; /* register relocation */
1019 break; /* forwarding address */
1021 break; /* constant */
1023 error("Unknown symbol type %x.", sh->st);
1028 /* Parse the type information provided in the AX entries for
1029 the symbol SH. Return the bitfield size in BS, in case. */
1031 static struct type *parse_type(ax, sh, bs)
1036 /* Null entries in this map are treated specially */
1037 static struct type **map_bt[] =
1039 &builtin_type_void, /* btNil */
1041 &builtin_type_char, /* btChar */
1042 &builtin_type_unsigned_char, /* btUChar */
1043 &builtin_type_short, /* btShort */
1044 &builtin_type_unsigned_short, /* btUShort */
1045 &builtin_type_int, /* btInt */
1046 &builtin_type_unsigned_int, /* btUInt */
1047 &builtin_type_long, /* btLong */
1048 &builtin_type_unsigned_long, /* btULong */
1049 &builtin_type_float, /* btFloat */
1050 &builtin_type_double, /* btDouble */
1057 &builtin_type_complex, /* btComplex */
1058 &builtin_type_double_complex, /* btDComplex */
1060 &builtin_type_fixed_dec, /* btFixedDec */
1061 &builtin_type_float_dec, /* btFloatDec */
1062 &builtin_type_string, /* btString */
1065 &builtin_type_void, /* btVoid */
1069 struct type *tp = 0, *tp1;
1072 /* Procedures start off by one */
1073 if (sh->st == stProc || sh->st == stStaticProc)
1076 /* Undefined ? Should not happen */
1077 if (ax->rndx.rfd == 0xfff) {
1078 return builtin_type_void;
1081 /* Use aux as a type information record, map its basic type */
1083 if (t->bt > 26 || t->bt == btPicture) {
1084 complain (&basic_type_complaint, t->bt);
1085 return builtin_type_int;
1088 tp = *map_bt[t->bt];
1090 /* Cannot use builtin types, use templates */
1091 tp = make_type(TYPE_CODE_VOID, 0, 0, 0);
1094 *tp = *builtin_type_ptr;
1097 *tp = *builtin_type_struct;
1101 *tp = *builtin_type_union;
1105 *tp = *builtin_type_enum;
1109 *tp = *builtin_type_range;
1112 *tp = *builtin_type_set;
1118 /* Move on to next aux */
1121 /* This is the way it would work if the compiler worked */
1122 register TIR *t1 = t;
1123 while (t1->continued)
1127 /* For bitfields all we need is the width */
1133 /* All these types really point to some (common) MIPS type
1134 definition, and only the type-qualifiers fully identify
1135 them. We`ll make the same effort at sharing */
1136 if (t->bt == btIndirect ||
1137 t->bt == btStruct ||
1140 t->bt == btTypedef ||
1143 char name[256], *pn;
1145 /* Try to cross reference this type */
1147 ax += cross_ref(ax, &tp1, &pn);
1148 /* SOMEONE OUGHT TO FIX DBXREAD TO DROP "STRUCT" */
1149 sprintf(name, fmt, pn);
1151 /* reading .o file ? */
1152 if (UNSAFE_DATA_ADDR(tp1))
1154 if (TYPE_CODE(tp1) == TYPE_CODE_UNDEF) {
1156 * Type was incompletely defined, now we know.
1158 TYPE_CODE(tp1) = TYPE_CODE(tp);
1159 TYPE_NAME(tp1) = obsavestring(name, strlen(name));
1160 if (TYPE_CODE(tp1) == TYPE_CODE_ENUM) {
1163 for (i = 0; i < TYPE_NFIELDS(tp1); i++)
1164 make_enum_constant(&TYPE_FIELD(tp1,i), tp1);
1168 /* found as cross ref, rid of our template */
1169 if ((TYPE_FLAGS(tp) & TYPE_FLAG_PERM) == 0)
1172 /* stupid idea of prepending "struct" to type names */
1173 if (t->bt == btStruct && !index(TYPE_NAME(tp), ' ')) {
1174 sprintf(name, fmt, TYPE_NAME(tp));
1175 TYPE_NAME(tp) = obsavestring(name, strlen(name));
1178 TYPE_NAME(tp) = savestring(name, strlen(name));
1181 /* Deal with range types */
1182 if (t->bt == btRange) {
1185 f = new_field(tp, "Low");
1186 f->bitpos = ax->dnLow;
1188 f = new_field(tp, "High");
1189 f->bitpos = ax->dnHigh;
1193 /* Parse all the type qualifiers now. If there are more
1194 than 6 the game will continue in the next aux */
1196 #define PARSE_TQ(tq) \
1197 if (t->tq != tqNil) ax += upgrade_type(&tp, t->tq, ax, sh);
1199 again: PARSE_TQ(tq0);
1214 /* Make up a complex type from a basic one. Type is passed by
1215 reference in TPP and side-effected as necessary. The type
1216 qualifier TQ says how to handle the aux symbols at AX for
1217 the symbol SX we are currently analyzing.
1218 Returns the number of aux symbols we parsed. */
1221 upgrade_type(tpp, tq, ax, sh)
1229 /* Used in array processing */
1238 t = lookup_pointer_type (*tpp);
1243 t = lookup_function_type (*tpp);
1249 t = make_type(TYPE_CODE_ARRAY, 0, 0, 0);
1250 TYPE_TARGET_TYPE(t) = *tpp;
1252 /* Determine and record the domain type (type of index) */
1253 id = ax->rndx.index;
1259 fh = get_rfd(cur_fd, rf);
1260 f = new_field(t, (char *)0);
1261 bzero(&ss, sizeof ss);
1262 /* XXX */ f->type = parse_type(fh->iauxBase + id * sizeof(AUXU),
1267 * This seems to be a pointer to the end of the Block defining
1268 * the type. Why it is here is magic for me, and I have no
1269 * good use for it anyways.
1271 /* This used to occur because cross_ref returned
1272 the wrong result (ax pointed wrong). FIXME,
1273 delete this code in a while. -- gnu@cygnus jul91 */
1274 complain (&array_parse_complaint, 0);
1276 id = (++ax)->rndx.index;
1277 if ((rf = ax->rndx.rfd) == 0xfff)
1278 rf = (++ax)->isym, off++;
1280 lower = (++ax)->dnLow;
1281 upper = (++ax)->dnHigh;
1282 rf = (++ax)->width; /* bit size of array element */
1284 /* Check whether supplied array element bit size matches
1285 the known size of the element type. If this complaint
1286 ends up not happening, we can remove this code. It's
1287 here because we aren't sure we understand this *&%&$
1289 id = TYPE_LENGTH(TYPE_TARGET_TYPE(t)) << 3; /* bitsize */
1291 /* Most likely an undefined type */
1293 TYPE_LENGTH(TYPE_TARGET_TYPE(t)) = id >> 3;
1296 complain (&array_bitsize_complaint, rf);
1298 TYPE_LENGTH(t) = (upper < 0) ? 0 :
1299 (upper - lower + 1) * (rf >> 3);
1304 /* Volatile -- currently ignored */
1308 complain (&unknown_type_qual_complaint, tq);
1314 /* Parse a procedure descriptor record PR. Note that the procedure
1315 is parsed _after_ the local symbols, now we just make up the
1316 extra information we need into a special symbol that we insert
1317 in the procedure's main block. Note also that images that
1318 have been partially stripped (ld -x) have been deprived
1319 of local symbols, and we have to cope with them here.
1320 The procedure's code ends at BOUND */
1323 parse_procedure(pr, bound)
1326 struct symbol *s, *i;
1327 SYMR *sh = (SYMR*)pr->isym;
1329 struct mips_extra_func_info *e;
1333 /* Reuse the MIPS record */
1334 e = (struct mips_extra_func_info *) pr;
1335 e->numargs = lookup_numargs(pr->adr);
1337 /* Make up our special symbol */
1338 i = new_symbol(".gdbinfo.");
1339 SYMBOL_VALUE(i) = (int)e;
1340 SYMBOL_NAMESPACE(i) = LABEL_NAMESPACE;
1341 SYMBOL_CLASS(i) = LOC_CONST;
1342 SYMBOL_TYPE(i) = builtin_type_void;
1344 /* Make up a name for static procedures. Sigh. */
1345 if (sh == (SYMR*)-1) {
1346 sprintf(name,".static_procedure@%x",pr->adr);
1347 sh_name = savestring(name, strlen(name));
1351 sh_name = (char*)sh->iss;
1352 s = mylookup_symbol(sh_name, top_stack->cur_block,
1353 VAR_NAMESPACE, LOC_BLOCK);
1356 b = SYMBOL_BLOCK_VALUE(s);
1358 s = new_symbol(sh_name);
1359 SYMBOL_NAMESPACE(s) = VAR_NAMESPACE;
1360 SYMBOL_CLASS(s) = LOC_BLOCK;
1361 /* Donno its type, hope int is ok */
1362 SYMBOL_TYPE(s) = lookup_function_type (builtin_type_int);
1363 add_symbol(s, top_stack->cur_block);
1364 /* Wont have symbols for this one */
1366 SYMBOL_BLOCK_VALUE(s) = b;
1367 BLOCK_FUNCTION(b) = s;
1368 BLOCK_START(b) = pr->adr;
1369 BLOCK_END(b) = bound;
1370 BLOCK_SUPERBLOCK(b) = top_stack->cur_block;
1371 add_block(b, top_stack->cur_st);
1377 /* Parse the external symbol ES. Just call parse_symbol() after
1378 making sure we know where the aux are for it. For procedures,
1379 parsing of the PDRs has already provided all the needed
1380 information, we only parse them if SKIP_PROCEDURES is false,
1381 and only if this causes no symbol duplication.
1383 This routine clobbers top_stack->cur_block and ->cur_st. */
1386 parse_external(es, skip_procedures)
1391 if (es->ifd != ifdNil) {
1393 cur_fdr = (FDR*)(cur_hdr->cbFdOffset) + cur_fd;
1394 ax = (AUXU*)cur_fdr->iauxBase;
1396 cur_fdr = (FDR*)(cur_hdr->cbFdOffset);
1399 top_stack->cur_st = cur_stab;
1400 top_stack->cur_block = BLOCKVECTOR_BLOCK(BLOCKVECTOR(top_stack->cur_st),
1403 /* Reading .o files */
1404 if (es->asym.sc == scUndefined || es->asym.sc == scNil) {
1406 switch (es->asym.st) {
1408 case stProc: what = "procedure"; n_undef_procs++; break;
1409 case stGlobal: what = "variable"; n_undef_vars++; break;
1410 case stLabel: what = "label"; n_undef_labels++; break;
1411 default : what = "symbol"; break;
1415 printf_filtered("Warning: %s `%s' is undefined (in %s)\n", what,
1416 es->asym.iss, fdr_name(cur_fdr->rss));
1420 switch (es->asym.st) {
1422 /* If we have full symbols we do not need more */
1423 if (skip_procedures)
1425 if (mylookup_symbol (es->asym.iss, top_stack->cur_block,
1426 VAR_NAMESPACE, LOC_BLOCK))
1432 * Note that the case of a symbol with indexNil
1433 * must be handled anyways by parse_symbol().
1435 parse_symbol(&es->asym, ax);
1442 /* Parse the line number info for file descriptor FH into
1443 GDB's linetable LT. MIPS' encoding requires a little bit
1444 of magic to get things out. Note also that MIPS' line
1445 numbers can go back and forth, apparently we can live
1446 with that and do not need to reorder our linetables */
1451 struct linetable *lt;
1453 unsigned char *base = (unsigned char*)fh->cbLineOffset;
1455 int delta, count, lineno = 0;
1461 /* Scan by procedure descriptors */
1462 i = 0; j = 0, k = 0;
1463 for (pr = (PDR*)IPDFIRST(cur_hdr,fh); j < fh->cpd; j++, pr++) {
1466 /* No code for this one */
1467 if (pr->iline == ilineNil ||
1468 pr->lnLow == -1 || pr->lnHigh == -1)
1471 * Aurgh! To know where to stop expanding we
1474 for (l = 1; l < (fh->cpd - j); l++)
1475 if (pr[l].iline != -1)
1477 if (l == (fh->cpd - j))
1482 * When procedures are moved around the linenumbers
1483 * are attributed to the next procedure up
1485 if (pr->iline >= halt) continue;
1487 base = (unsigned char*)pr->cbLineOffset;
1488 l = pr->adr >> 2; /* in words */
1489 halt += (pr->adr >> 2) - pr->iline;
1490 for (lineno = pr->lnLow; l < halt;) {
1491 count = *base & 0x0f;
1492 delta = *base++ >> 4;
1496 delta = (base[0] << 8) | base[1];
1497 if (delta >= 0x8000)
1501 lineno += delta;/* first delta is 0 */
1502 k = add_line(lt, lineno, l, k);
1509 /* Parse the symbols of the file described by FH, whose index is F_IDX.
1510 BOUND is the highest core address of this file's procedures */
1513 parse_one_file(fh, f_idx, bound)
1520 /* Parse local symbols first */
1522 for (s_idx = 0; s_idx < fh->csym; s_idx++) {
1523 sh = (SYMR *) (fh->isymBase) + s_idx;
1525 parse_symbol(sh, fh->iauxBase);
1528 /* Procedures next, note we need to look-ahead to
1529 find out where the procedure's code ends */
1531 for (s_idx = 0; s_idx < fh->cpd-1; s_idx++) {
1532 pr = (PDR *) (IPDFIRST(cur_hdr, fh)) + s_idx;
1533 parse_procedure(pr, pr[1].adr); /* next proc up */
1536 pr = (PDR *) (IPDFIRST(cur_hdr, fh)) + s_idx;
1537 parse_procedure(pr, bound); /* next file up */
1540 /* Linenumbers. At the end, check if we can save memory */
1541 parse_lines(fh, LINETABLE(cur_stab));
1542 if (LINETABLE(cur_stab)->nitems < fh->cline)
1543 shrink_linetable(cur_stab);
1546 /* Master parsing procedure for first-pass reading of file symbols
1547 into a partial_symtab.
1549 Parses the symtab described by the global symbolic header CUR_HDR.
1550 END_OF_TEXT_SEG gives the address just after the text segment for
1551 the symtab we are reading. */
1554 parse_partial_symbols(end_of_text_seg, objfile)
1555 int end_of_text_seg;
1556 struct objfile *objfile;
1558 int f_idx, s_idx, h_max, stat_idx;
1560 /* Running pointers */
1565 struct partial_symtab *pst;
1570 * Only parse the Local and External symbols, and the Relative FDR.
1571 * Fixup enough of the loader symtab to be able to use it.
1572 * Allocate space only for the file's portions we need to
1578 max_glevel = MIN_GLEVEL;
1580 /* Allocate the map FDR -> PST.
1581 Minor hack: -O3 images might claim some global data belongs
1582 to FDR -1. We`ll go along with that */
1583 fdr_to_pst = (struct pst_map *)xzalloc((hdr->ifdMax+1) * sizeof *fdr_to_pst);
1586 struct partial_symtab * pst = new_psymtab("", objfile);
1587 fdr_to_pst[-1].pst = pst;
1591 /* Now scan the FDRs, mostly for dependencies */
1592 for (f_idx = 0; f_idx < hdr->ifdMax; f_idx++)
1593 (void) parse_fdr(f_idx, 1, objfile);
1595 /* Take a good guess at how many symbols we might ever need */
1596 h_max = hdr->iextMax;
1598 /* Parse externals: two passes because they can be ordered
1599 in any way, but gdb likes to have them segregated by their
1602 /* Pass 1 over external syms: Presize and partition the list */
1603 for (s_idx = 0; s_idx < hdr->iextMax; s_idx++) {
1604 esh = (EXTR *) (hdr->cbExtOffset) + s_idx;
1605 fdr_to_pst[esh->ifd].n_globals++;
1608 if (global_psymbols.list) {
1609 int origsize = global_psymbols.next - global_psymbols.list;
1611 global_psymbols.list = (struct partial_symbol *)
1612 xrealloc (global_psymbols.list,
1613 (h_max + origsize) * sizeof(struct partial_symbol));
1614 global_psymbols.next = global_psymbols.list + origsize;
1615 global_psymbols.size = h_max + origsize;
1617 global_psymbols.list = (struct partial_symbol *)
1618 xmalloc (h_max * sizeof(struct partial_symbol));
1619 global_psymbols.next = global_psymbols.list;
1620 global_psymbols.size = h_max;
1623 /* Pass 1.5 over files: partition out global symbol space */
1624 s_idx = global_psymbols.next - global_psymbols.list;
1625 for (f_idx = -1; f_idx < hdr->ifdMax; f_idx++) {
1626 fdr_to_pst[f_idx].pst->globals_offset = s_idx;
1627 s_idx += fdr_to_pst[f_idx].n_globals;
1630 /* Pass 1.6 over files: partition out static symbol space.
1631 Note that this loop starts at 0, not at -1. */
1632 stat_idx = static_psymbols.next - static_psymbols.list;
1633 for (f_idx = 0; f_idx < hdr->ifdMax; f_idx++) {
1634 fdr_to_pst[f_idx].pst->statics_offset = stat_idx;
1635 fh = f_idx + (FDR *)(hdr->cbFdOffset);
1636 stat_idx += fh->csym;
1639 /* Now that we know its max size, allocate static symbol list */
1640 if (static_psymbols.list) {
1641 int origsize = static_psymbols.next - static_psymbols.list;
1643 static_psymbols.list = (struct partial_symbol *)
1644 xrealloc (static_psymbols.list,
1645 stat_idx * sizeof(struct partial_symbol));
1646 static_psymbols.next = static_psymbols.list + origsize;
1647 static_psymbols.size = stat_idx;
1649 static_psymbols.list = (struct partial_symbol *)
1650 xmalloc (stat_idx * sizeof(struct partial_symbol));
1651 static_psymbols.next = static_psymbols.list;
1652 static_psymbols.size = stat_idx;
1655 /* Pass 2 over external syms: fill in external symbols */
1656 for (s_idx = 0; s_idx < hdr->iextMax; s_idx++) {
1657 register struct partial_symbol *p;
1658 enum misc_function_type misc_type = mf_text;
1659 esh = (EXTR *) (hdr->cbExtOffset) + s_idx;
1661 if (esh->asym.sc == scUndefined || esh->asym.sc == scNil)
1664 /* Locate the psymtab and the preallocated psymbol. */
1665 pst = fdr_to_pst[esh->ifd].pst;
1666 p = global_psymbols.list + pst->globals_offset +
1667 pst->n_global_syms++;
1668 SYMBOL_NAME(p) = (char *)(esh->asym.iss);
1669 SYMBOL_NAMESPACE(p) = VAR_NAMESPACE;
1671 switch (esh->asym.st) {
1673 SYMBOL_CLASS(p) = LOC_BLOCK;
1674 SYMBOL_VALUE(p) = esh->asym.value;
1677 SYMBOL_CLASS(p) = LOC_STATIC;
1678 SYMBOL_VALUE_ADDRESS(p) = (CORE_ADDR)esh->asym.value;
1679 misc_type = mf_data;
1682 SYMBOL_CLASS(p) = LOC_LABEL;
1683 SYMBOL_VALUE_ADDRESS(p) = (CORE_ADDR)esh->asym.value;
1686 misc_type = mf_unknown;
1687 complain (&unknown_ext_complaint, SYMBOL_NAME(p));
1689 prim_record_misc_function (SYMBOL_NAME(p),
1694 /* Pass 3 over files, over local syms: fill in static symbols */
1695 for (f_idx = 0; f_idx < hdr->ifdMax; f_idx++) {
1696 fh = f_idx + (FDR *)(cur_hdr->cbFdOffset);
1697 pst = fdr_to_pst[f_idx].pst;
1698 pst->texthigh = pst->textlow;
1700 for (s_idx = 0; s_idx < fh->csym; ) {
1701 register struct partial_symbol *p;
1703 sh = s_idx + (SYMR *) fh->isymBase;
1705 if (sh->sc == scUndefined || sh->sc == scNil) {
1706 /* FIXME, premature? */
1711 /* Locate the preallocated psymbol. */
1712 p = static_psymbols.list + pst->statics_offset +
1714 SYMBOL_NAME(p) = (char *)(sh->iss);
1715 SYMBOL_VALUE(p) = sh->value;
1716 SYMBOL_NAMESPACE(p) = VAR_NAMESPACE;
1719 case stProc: /* Asm labels apparently */
1720 case stStaticProc: /* Function */
1721 SYMBOL_CLASS(p) = LOC_BLOCK;
1722 pst->n_static_syms++; /* Use gdb symbol */
1723 /* Skip over procedure to next one. */
1724 s_idx = (sh->index + (AUXU *)fh->iauxBase)
1728 long procaddr = sh->value;
1730 sh = s_idx + (SYMR *) fh->isymBase - 1;
1731 if (sh->st != stEnd)
1733 high = procaddr + sh->value;
1734 if (high > pst->texthigh)
1735 pst->texthigh = high;
1738 case stStatic: /* Variable */
1739 SYMBOL_CLASS(p) = LOC_STATIC;
1740 SYMBOL_VALUE_ADDRESS(p) = (CORE_ADDR)sh->value;
1742 case stTypedef: /* Typedef */
1743 SYMBOL_CLASS(p) = LOC_TYPEDEF;
1745 case stConstant: /* Constant decl */
1746 SYMBOL_CLASS(p) = LOC_CONST;
1748 case stBlock: /* { }, str, un, enum*/
1749 if (sh->sc == scInfo) {
1750 SYMBOL_NAMESPACE(p) = STRUCT_NAMESPACE;
1751 SYMBOL_CLASS(p) = LOC_TYPEDEF;
1752 pst->n_static_syms++;
1754 /* Skip over the block */
1757 case stFile: /* File headers */
1758 case stLabel: /* Labels */
1759 case stEnd: /* Ends of files */
1762 complain (&unknown_sym_complaint, SYMBOL_NAME(p));
1763 complain (&unknown_st_complaint, sh->st);
1767 pst->n_static_syms++; /* Use this gdb symbol */
1769 s_idx++; /* Go to next file symbol */
1771 /* We don't usually record static syms, but some we seem to. chk dbxread. */
1772 /*FIXME*/ prim_record_misc_function (SYMBOL_NAME(p),
1779 /* The array (of lists) of globals must be sorted. */
1782 /* Now sort the global psymbols. */
1783 for (f_idx = 0; f_idx < hdr->ifdMax; f_idx++) {
1784 struct partial_symtab *pst = fdr_to_pst[f_idx].pst;
1785 if (pst->n_global_syms > 1)
1786 qsort (global_psymbols.list + pst->globals_offset,
1787 pst->n_global_syms, sizeof (struct partial_symbol),
1791 /* Mark the last code address, and remember it for later */
1792 hdr->cbDnOffset = end_of_text_seg;
1794 free(&fdr_to_pst[-1]);
1799 /* Do the initial analisys of the F_IDX-th file descriptor.
1800 Allocates a partial symtab for it, and builds the list
1801 of dependent files by recursion. LEV says at which level
1802 of recursion we are called (to pretty up debug traces) */
1804 static struct partial_symtab *
1805 parse_fdr(f_idx, lev, objfile)
1808 struct objfile *objfile;
1811 register struct partial_symtab *pst;
1814 fh = (FDR *) (cur_hdr->cbFdOffset) + f_idx;
1816 /* Use this to indicate into which symtab this file was parsed */
1818 return (struct partial_symtab *) fh->ioptBase;
1820 /* Debuggability level */
1821 if (compare_glevel(max_glevel, fh->glevel) < 0)
1822 max_glevel = fh->glevel;
1824 /* Make a new partial_symtab */
1825 pst = new_psymtab(fh->rss, objfile);
1830 pst->textlow = fh->adr;
1831 pst->texthigh = fh->cpd; /* To be fixed later */
1834 /* Make everything point to everything. */
1835 FDR_IDX(pst) = f_idx;
1836 fdr_to_pst[f_idx].pst = pst;
1837 fh->ioptBase = (int)pst;
1839 /* Analyze its dependencies */
1844 if (fh->cpd == 0) { /* If there are no functions defined here ... */
1845 /* ...then presumably a .h file: drop reverse depends .h->.c */
1846 for (; s_id0 < fh->crfd; s_id0++) {
1847 RFDT *rh = (RFDT *) (fh->rfdBase) + s_id0;
1849 s_id0++; /* Skip self-dependency */
1854 pst->number_of_dependencies = fh->crfd - s_id0;
1855 pst->dependencies = (struct partial_symtab **)
1856 obstack_alloc (psymbol_obstack,
1857 pst->number_of_dependencies *
1858 sizeof (struct partial_symtab *));
1859 for (s_idx = s_id0; s_idx < fh->crfd; s_idx++) {
1860 RFDT *rh = (RFDT *) (fh->rfdBase) + s_idx;
1862 pst->dependencies[s_idx-s_id0] = parse_fdr(*rh, lev+1, objfile);
1869 /* Ancillary function to psymtab_to_symtab(). Does all the work
1870 for turning the partial symtab PST into a symtab, recurring
1871 first on all dependent psymtabs. The argument FILENAME is
1872 only passed so we can see in debug stack traces what file
1876 psymtab_to_symtab_1(pst, filename)
1877 struct partial_symtab *pst;
1888 pending_list = (struct pending **) cur_hdr->cbOptOffset;
1889 if (pending_list == 0) {
1890 pending_list = (struct pending **)
1891 xzalloc(cur_hdr->ifdMax * sizeof(struct pending *));
1892 cur_hdr->cbOptOffset = (int)pending_list;
1895 /* How many symbols will we need */
1896 /* FIXME, this does not count enum values. */
1897 f_max = pst->n_global_syms + pst->n_static_syms;
1898 if (FDR_IDX(pst) == -1) {
1900 st = new_symtab ("unknown", f_max, 0, pst->objfile);
1902 fh = (FDR *) (cur_hdr->cbFdOffset) + FDR_IDX(pst);
1903 f_max += fh->csym + fh->cpd;
1904 st = new_symtab (pst->filename, 2 * f_max, 2 * fh->cline,
1908 /* Read in all partial symbtabs on which this one is dependent.
1909 NOTE that we do have circular dependencies, sigh. We solved
1910 that by setting pst->readin before this point. */
1912 for (i = 0; i < pst->number_of_dependencies; i++)
1913 if (!pst->dependencies[i]->readin) {
1914 /* Inform about additional files to be read in. */
1917 fputs_filtered (" ", stdout);
1919 fputs_filtered ("and ", stdout);
1921 printf_filtered ("%s...",
1922 pst->dependencies[i]->filename);
1923 wrap_here (""); /* Flush output */
1926 /* We only pass the filename for debug purposes */
1927 psymtab_to_symtab_1(pst->dependencies[i],
1928 pst->dependencies[i]->filename);
1931 /* Now read the symbols for this symtab */
1933 cur_fd = FDR_IDX(pst);
1937 /* Get a new lexical context */
1940 top_stack->cur_st = cur_stab;
1941 top_stack->cur_block = BLOCKVECTOR_BLOCK(BLOCKVECTOR(cur_stab),
1943 BLOCK_START(top_stack->cur_block) = fh ? fh->adr : 0;
1944 BLOCK_END(top_stack->cur_block) = 0;
1945 top_stack->blocktype = stFile;
1946 top_stack->maxsyms = 2*f_max;
1947 top_stack->cur_type = 0;
1948 top_stack->procadr = 0;
1949 top_stack->numargs = 0;
1951 /* Parse locals and procedures */
1953 parse_one_file(fh, cur_fd, (cur_fd == (cur_hdr->ifdMax - 1)) ?
1954 cur_hdr->cbDnOffset : fh[1].adr);
1956 /* .. and our share of externals.
1957 XXX use the global list to speed up things here. how ?
1958 FIXME, Maybe quit once we have found the right number of ext's? */
1959 /* parse_external clobbers top_stack->cur_block and ->cur_st here. */
1960 top_stack->blocktype = stFile;
1961 top_stack->maxsyms = cur_hdr->isymMax + cur_hdr->ipdMax + cur_hdr->iextMax;
1962 for (i = 0; i < cur_hdr->iextMax; i++) {
1963 register EXTR *esh = (EXTR *) (cur_hdr->cbExtOffset) + i;
1964 if (esh->ifd == cur_fd)
1965 parse_external(esh, 1);
1968 /* If there are undefined, tell the user */
1969 if (n_undef_symbols) {
1970 printf_filtered("File %s contains %d unresolved references:",
1971 st->filename, n_undef_symbols);
1972 printf_filtered("\n\t%4d variables\n\t%4d procedures\n\t%4d labels\n",
1973 n_undef_vars, n_undef_procs, n_undef_labels);
1974 n_undef_symbols = n_undef_labels = n_undef_vars = n_undef_procs = 0;
1980 * Sort the symbol table now, we are done adding symbols to it.
1982 sort_symtab_syms(st);
1984 /* Now link the psymtab and the symtab. */
1988 /* Ancillary parsing procedures. */
1990 /* Lookup the type at relative index RN. Return it in TPP
1991 if found and in any event come up with its name PNAME.
1992 Return value says how many aux symbols we ate */
1995 cross_ref(rn, tpp, pname)
2002 /* Escape index means 'the next one' */
2003 if (rn->rfd == 0xfff)
2004 rf = *(unsigned *) (rn + 1);
2010 *pname = "<undefined>";
2013 * Find the relative file descriptor and the symbol in it
2015 FDR *fh = get_rfd(cur_fd, rf);
2020 * If we have processed this symbol then we left a forwarding
2021 * pointer to the corresponding GDB symbol. If not, we`ll put
2022 * it in a list of pending symbols, to be processed later when
2023 * the file f will be. In any event, we collect the name for
2024 * the type here. Which is why we made a first pass at
2027 sh = (SYMR *) (fh->isymBase) + rn->index;
2029 /* Careful, we might be looking at .o files */
2030 *pname = (UNSAFE_DATA_ADDR(sh->iss)) ? "<undefined>" :
2033 /* Have we parsed it ? */
2034 if ((!UNSAFE_DATA_ADDR(sh->value)) && (sh->st == stParsed)) {
2035 t = (struct type *) sh->value;
2040 /* Avoid duplicates */
2041 p = is_pending_symbol(fh, sh);
2046 add_pending(fh, sh, *tpp);
2050 /* We used one auxent normally, two if we got a "next one" rf. */
2051 return (rn->rfd == 0xfff? 2: 1);
2055 /* Quick&dirty lookup procedure, to avoid the MI ones that require
2056 keeping the symtab sorted */
2058 static struct symbol *
2059 mylookup_symbol (name, block, namespace, class)
2061 register struct block *block;
2062 enum namespace namespace;
2063 enum address_class class;
2065 register int bot, top, inc;
2066 register struct symbol *sym;
2069 top = BLOCK_NSYMS(block);
2072 sym = BLOCK_SYM(block, bot);
2073 if (SYMBOL_NAME(sym)[0] == inc
2074 && SYMBOL_NAMESPACE(sym) == namespace
2075 && SYMBOL_CLASS(sym) == class
2076 && !strcmp(SYMBOL_NAME(sym), name))
2080 if (block = BLOCK_SUPERBLOCK (block))
2081 return mylookup_symbol (name, block, namespace, class);
2086 /* Add a new symbol S to a block B.
2087 Infrequently, we will need to reallocate the block to make it bigger.
2088 We only detect this case when adding to top_stack->cur_block, since
2089 that's the only time we know how big the block is. FIXME. */
2096 int nsyms = BLOCK_NSYMS(b)++;
2097 struct block *origb;
2098 struct parse_stack *stackp;
2100 if (b == top_stack->cur_block &&
2101 nsyms >= top_stack->maxsyms) {
2102 complain (&block_overflow_complaint, s->name);
2103 /* In this case shrink_block is actually grow_block, since
2104 BLOCK_NSYMS(b) is larger than its current size. */
2106 b = shrink_block (top_stack->cur_block, top_stack->cur_st);
2108 /* Now run through the stack replacing pointers to the
2109 original block. shrink_block has already done this
2110 for the blockvector and BLOCK_FUNCTION. */
2111 for (stackp = top_stack; stackp; stackp = stackp->next) {
2112 if (stackp->cur_block == origb) {
2113 stackp->cur_block = b;
2114 stackp->maxsyms = BLOCK_NSYMS (b);
2118 BLOCK_SYM(b,nsyms) = s;
2121 /* Add a new block B to a symtab S */
2128 struct blockvector *bv = BLOCKVECTOR(s);
2130 bv = (struct blockvector *)xrealloc(bv, sizeof(struct blockvector) +
2131 BLOCKVECTOR_NBLOCKS(bv) * sizeof(bv->block));
2132 if (bv != BLOCKVECTOR(s))
2133 BLOCKVECTOR(s) = bv;
2135 BLOCKVECTOR_BLOCK(bv, BLOCKVECTOR_NBLOCKS(bv)++) = b;
2138 /* Add a new linenumber entry (LINENO,ADR) to a linevector LT.
2139 MIPS' linenumber encoding might need more than one byte
2140 to describe it, LAST is used to detect these continuation lines */
2143 add_line(lt, lineno, adr, last)
2144 struct linetable *lt;
2150 last = -2; /* make sure we record first line */
2152 if (last == lineno) /* skip continuation lines */
2155 lt->item[lt->nitems].line = lineno;
2156 lt->item[lt->nitems++].pc = adr << 2;
2162 /* Comparison functions, used when sorting things */
2164 /* Symtabs must be ordered viz the code segments they cover */
2167 compare_symtabs( s1, s2)
2168 struct symtab **s1, **s2;
2170 /* "most specific" first */
2172 register struct block *b1, *b2;
2173 b1 = BLOCKVECTOR_BLOCK(BLOCKVECTOR(*s1),GLOBAL_BLOCK);
2174 b2 = BLOCKVECTOR_BLOCK(BLOCKVECTOR(*s2),GLOBAL_BLOCK);
2175 if (BLOCK_END(b1) == BLOCK_END(b2))
2176 return BLOCK_START(b1) - BLOCK_START(b2);
2177 return BLOCK_END(b1) - BLOCK_END(b2);
2181 /* Partial Symtabs, same */
2184 compare_psymtabs( s1, s2)
2185 struct partial_symtab **s1, **s2;
2187 /* Perf twist: put the ones with no code at the end */
2189 register int a = (*s1)->textlow;
2190 register int b = (*s2)->textlow;
2199 /* Partial symbols are compared lexicog by their print names */
2202 compare_psymbols (s1, s2)
2203 register struct partial_symbol *s1, *s2;
2206 *st1 = SYMBOL_NAME(s1),
2207 *st2 = SYMBOL_NAME(s2);
2209 return (st1[0] - st2[0] ? st1[0] - st2[0] :
2210 strcmp(st1 + 1, st2 + 1));
2213 /* Blocks with a smaller low bound should come first */
2215 static int compare_blocks(b1,b2)
2216 struct block **b1, **b2;
2218 register int addr_diff;
2220 addr_diff = (BLOCK_START((*b1))) - (BLOCK_START((*b2)));
2222 return (BLOCK_END((*b1))) - (BLOCK_END((*b2)));
2227 /* Sorting and reordering procedures */
2229 /* Sort the blocks of a symtab S.
2230 Reorder the blocks in the blockvector by code-address,
2231 as required by some MI search routines */
2237 struct blockvector *bv = BLOCKVECTOR(s);
2239 if (BLOCKVECTOR_NBLOCKS(bv) <= 2) {
2241 if (BLOCK_END(BLOCKVECTOR_BLOCK(bv,GLOBAL_BLOCK)) == 0)
2242 BLOCK_START(BLOCKVECTOR_BLOCK(bv,GLOBAL_BLOCK)) = 0;
2243 if (BLOCK_END(BLOCKVECTOR_BLOCK(bv,STATIC_BLOCK)) == 0)
2244 BLOCK_START(BLOCKVECTOR_BLOCK(bv,STATIC_BLOCK)) = 0;
2248 * This is very unfortunate: normally all functions are compiled in
2249 * the order they are found, but if the file is compiled -O3 things
2250 * are very different. It would be nice to find a reliable test
2251 * to detect -O3 images in advance.
2253 if (BLOCKVECTOR_NBLOCKS(bv) > 3)
2254 qsort(&BLOCKVECTOR_BLOCK(bv,FIRST_LOCAL_BLOCK),
2255 BLOCKVECTOR_NBLOCKS(bv) - FIRST_LOCAL_BLOCK,
2256 sizeof(struct block *),
2260 register CORE_ADDR high = 0;
2261 register int i, j = BLOCKVECTOR_NBLOCKS(bv);
2263 for (i = FIRST_LOCAL_BLOCK; i < j; i++)
2264 if (high < BLOCK_END(BLOCKVECTOR_BLOCK(bv,i)))
2265 high = BLOCK_END(BLOCKVECTOR_BLOCK(bv,i));
2266 BLOCK_END(BLOCKVECTOR_BLOCK(bv,GLOBAL_BLOCK)) = high;
2269 BLOCK_START(BLOCKVECTOR_BLOCK(bv,GLOBAL_BLOCK)) =
2270 BLOCK_START(BLOCKVECTOR_BLOCK(bv,FIRST_LOCAL_BLOCK));
2272 BLOCK_START(BLOCKVECTOR_BLOCK(bv,STATIC_BLOCK)) =
2273 BLOCK_START(BLOCKVECTOR_BLOCK(bv,GLOBAL_BLOCK));
2274 BLOCK_END (BLOCKVECTOR_BLOCK(bv,STATIC_BLOCK)) =
2275 BLOCK_END (BLOCKVECTOR_BLOCK(bv,GLOBAL_BLOCK));
2278 /* Sort the symtab list, as required by some search procedures.
2279 We want files ordered to make them look right to users, and for
2280 searching (see block_for_pc). */
2286 struct symtab *stab;
2287 register struct symtab **all_symtabs;
2288 register int symtab_count;
2293 /* Create an array of pointers to all the symtabs. */
2294 for (symtab_count = 0, stab = symtab_list;
2296 symtab_count++, stab = stab->next) {
2297 obstack_grow (psymbol_obstack, &stab, sizeof (stab));
2298 /* FIXME: Only sort blocks for new symtabs ??? */
2302 all_symtabs = (struct symtab **)
2303 obstack_base (psymbol_obstack);
2304 qsort((char *)all_symtabs, symtab_count,
2305 sizeof(struct symtab *), compare_symtabs);
2307 /* Re-construct the symtab list, but now it is sorted. */
2308 for (i = 0; i < symtab_count-1; i++)
2309 all_symtabs[i]->next = all_symtabs[i+1];
2310 all_symtabs[i]->next = 0;
2311 symtab_list = all_symtabs[0];
2313 obstack_free (psymbol_obstack, all_symtabs);
2316 /* Sort the partial symtab list, as required by some search procedures.
2317 PC lookups stop at the first psymtab such that textlow <= PC < texthigh */
2323 register int all_psymtabs_count;
2324 struct partial_symtab *pstab;
2325 struct partial_symtab **all_psymtabs;
2327 if (!partial_symtab_list)
2330 /* Create an array of pointers to all the partial_symtabs. */
2332 for (all_psymtabs_count = 0, pstab = partial_symtab_list;
2334 all_psymtabs_count++, pstab = pstab->next)
2335 obstack_grow (psymbol_obstack, &pstab, sizeof (pstab));
2337 all_psymtabs = (struct partial_symtab **)
2338 obstack_base (psymbol_obstack);
2340 qsort((char *)all_psymtabs, all_psymtabs_count,
2341 sizeof(struct partial_symtab *), compare_psymtabs);
2343 /* Re-construct the partial_symtab_list, but now it is sorted. */
2345 for (i = 0; i < all_psymtabs_count-1; i++)
2346 all_psymtabs[i]->next = all_psymtabs[i+1];
2347 all_psymtabs[i]->next = 0;
2348 partial_symtab_list = all_psymtabs[0];
2350 obstack_free (psymbol_obstack, all_psymtabs);
2353 /* Constructor/restructor/destructor procedures */
2355 /* Allocate a new symtab for NAME. Needs an estimate of how many symbols
2356 MAXSYMS and linenumbers MAXLINES we'll put in it */
2360 new_symtab(name, maxsyms, maxlines, objfile)
2363 struct symtab *s = allocate_symtab (name, objfile);
2365 LINETABLE(s) = new_linetable(maxlines);
2367 /* All symtabs must have at least two blocks */
2368 BLOCKVECTOR(s) = new_bvect(2);
2369 BLOCKVECTOR_BLOCK(BLOCKVECTOR(s), GLOBAL_BLOCK) = new_block(maxsyms);
2370 BLOCKVECTOR_BLOCK(BLOCKVECTOR(s), STATIC_BLOCK) = new_block(maxsyms);
2371 BLOCK_SUPERBLOCK( BLOCKVECTOR_BLOCK(BLOCKVECTOR(s),STATIC_BLOCK)) =
2372 BLOCKVECTOR_BLOCK(BLOCKVECTOR(s), GLOBAL_BLOCK);
2374 s->free_code = free_linetable;
2376 /* Link the new symtab into the list of such. */
2377 s->next = symtab_list;
2383 /* Allocate a new partial_symtab NAME */
2385 static struct partial_symtab *
2386 new_psymtab(name, objfile)
2388 struct objfile *objfile;
2390 struct partial_symtab *pst;
2392 pst = (struct partial_symtab *)
2393 obstack_alloc (psymbol_obstack, sizeof (*pst));
2394 bzero (pst, sizeof (*pst));
2396 if (name == (char*)-1) /* FIXME -- why not null here? */
2397 pst->filename = "<no name>";
2399 pst->filename = name;
2401 /* Chain it to its object file */
2402 pst->objfile = objfile;
2403 pst->objfile_chain = sym_objfile->psymtabs;
2404 sym_objfile->psymtabs = pst;
2406 pst->next = partial_symtab_list;
2407 partial_symtab_list = pst;
2409 /* Keep a backpointer to the file's symbols */
2410 pst->read_symtab_private = (char *) obstack_alloc (psymbol_obstack,
2411 sizeof (struct symloc));
2412 CUR_HDR(pst) = cur_hdr;
2414 /* The way to turn this into a symtab is to call... */
2415 pst->read_symtab = mipscoff_psymtab_to_symtab;
2421 /* Allocate a linetable array of the given SIZE */
2424 struct linetable *new_linetable(size)
2426 struct linetable *l;
2428 size = size * sizeof(l->item) + sizeof(struct linetable);
2429 l = (struct linetable *)xmalloc(size);
2434 /* Oops, too big. Shrink it. This was important with the 2.4 linetables,
2435 I am not so sure about the 3.4 ones */
2441 struct linetable *l = new_linetable(LINETABLE(s)->nitems);
2443 bcopy(LINETABLE(s), l,
2444 LINETABLE(s)->nitems * sizeof(l->item) + sizeof(struct linetable));
2445 free (LINETABLE(s));
2449 /* Allocate and zero a new blockvector of NBLOCKS blocks. */
2452 struct blockvector *
2455 struct blockvector *bv;
2458 size = sizeof(struct blockvector) + nblocks * sizeof(struct block*);
2459 bv = (struct blockvector *) xzalloc(size);
2461 BLOCKVECTOR_NBLOCKS(bv) = nblocks;
2466 /* Allocate and zero a new block of MAXSYMS symbols */
2472 int size = sizeof(struct block) + (maxsyms-1) * sizeof(struct symbol *);
2473 struct block *b = (struct block *)xzalloc(size);
2478 /* Ooops, too big. Shrink block B in symtab S to its minimal size.
2479 Shrink_block can also be used by add_symbol to grow a block. */
2481 static struct block *
2487 struct blockvector *bv = BLOCKVECTOR(s);
2490 /* Just reallocate it and fix references to the old one */
2492 new = (struct block *) xrealloc ((char *)b, sizeof(struct block) +
2493 (BLOCK_NSYMS(b)-1) * sizeof(struct symbol *));
2495 /* Should chase pointers to old one. Fortunately, that`s just
2496 the block`s function and inferior blocks */
2497 if (BLOCK_FUNCTION(new) && SYMBOL_BLOCK_VALUE(BLOCK_FUNCTION(new)) == b)
2498 SYMBOL_BLOCK_VALUE(BLOCK_FUNCTION(new)) = new;
2499 for (i = 0; i < BLOCKVECTOR_NBLOCKS(bv); i++)
2500 if (BLOCKVECTOR_BLOCK(bv,i) == b)
2501 BLOCKVECTOR_BLOCK(bv,i) = new;
2502 else if (BLOCK_SUPERBLOCK(BLOCKVECTOR_BLOCK(bv,i)) == b)
2503 BLOCK_SUPERBLOCK(BLOCKVECTOR_BLOCK(bv,i)) = new;
2507 /* Create a new symbol with printname NAME */
2514 struct symbol *s = (struct symbol *)
2515 obstack_alloc (symbol_obstack, sizeof (struct symbol));
2517 bzero (s, sizeof (*s));
2518 SYMBOL_NAME(s) = name;
2522 /* Create a new type with printname NAME */
2529 struct type *t = (struct type *)
2530 obstack_alloc (symbol_obstack, sizeof (struct type));
2532 bzero (t, sizeof (*t));
2533 TYPE_VPTR_FIELDNO (t) = -1;
2534 TYPE_NAME(t) = name;
2538 /* Create and initialize a new type with printname NAME.
2539 CODE and LENGTH are the initial info we put in,
2540 UNS says whether the type is unsigned or not. */
2544 make_type(code, length, uns, name)
2545 enum type_code code;
2549 register struct type *type;
2551 type = (struct type *) xzalloc(sizeof(struct type));
2552 TYPE_CODE(type) = code;
2553 TYPE_LENGTH(type) = length;
2554 TYPE_FLAGS(type) = uns ? TYPE_FLAG_UNSIGNED : 0;
2555 TYPE_NAME(type) = name;
2556 TYPE_VPTR_FIELDNO (type) = -1;
2561 /* Allocate a new field named NAME to the type TYPE */
2565 new_field(type,name)
2571 /* Fields are kept in an array */
2572 if (TYPE_NFIELDS(type))
2573 TYPE_FIELDS(type) = (struct field*)xrealloc(TYPE_FIELDS(type),
2574 (TYPE_NFIELDS(type)+1) * sizeof(struct field));
2576 TYPE_FIELDS(type) = (struct field*)xzalloc(sizeof(struct field));
2577 f = &(TYPE_FIELD(type,TYPE_NFIELDS(type)));
2578 TYPE_NFIELDS(type)++;
2579 bzero(f, sizeof(struct field));
2580 f->name = name; /* Whether or not NAME is zero, this works. */
2584 /* Make an enum constant for a member F of an enumerated type T */
2587 make_enum_constant(f,t)
2593 * This is awful, but that`s the way it is supposed to be
2594 * (BTW, no need to free the real 'type', it's a builtin)
2596 f->type = (struct type *) f->bitpos;
2598 s = new_symbol(f->name);
2599 SYMBOL_NAMESPACE(s) = VAR_NAMESPACE;
2600 SYMBOL_CLASS(s) = LOC_CONST;
2602 SYMBOL_VALUE(s) = f->bitpos;
2603 add_symbol(s, top_stack->cur_block);
2608 /* Things used for calling functions in the inferior.
2609 These functions are exported to our companion
2610 mips-dep.c file and are here because they play
2611 with the symbol-table explicitly. */
2614 /* Need to make a new symbol on the fly for the dummy
2615 frame we put on the stack. Which goes in the.. */
2617 static struct symtab *dummy_symtab;
2619 /* Make up a dummy symbol for the code we put at END_PC,
2620 of size SIZE, invoking a function with NARGS arguments
2621 and using a frame of FRAMESIZE bytes */
2623 mips_create_dummy_symbol(end_pc, size, nargs, framesize)
2627 struct mips_extra_func_info *gdbinfo;
2629 /* Allocate symtab if not done already */
2630 if (dummy_symtab == 0)
2631 dummy_symtab = new_symtab(".dummy_symtab.", 100, 0);
2633 /* Make a new block. Only needs one symbol */
2635 BLOCK_START(bl) = end_pc - size;
2636 BLOCK_END(bl) = end_pc;
2638 BLOCK_SUPERBLOCK(bl) =
2639 BLOCKVECTOR_BLOCK(BLOCKVECTOR(dummy_symtab),GLOBAL_BLOCK);
2640 add_block(bl, dummy_symtab);
2641 sort_blocks(dummy_symtab);
2643 BLOCK_FUNCTION(bl) = new_symbol("??");
2644 SYMBOL_BLOCK_VALUE(BLOCK_FUNCTION(bl)) = bl;
2645 g = new_symbol(".gdbinfo.");
2646 BLOCK_SYM(bl,BLOCK_NSYMS(bl)++) = g;
2648 SYMBOL_NAMESPACE(g) = LABEL_NAMESPACE;
2649 SYMBOL_CLASS(g) = LOC_CONST;
2650 SYMBOL_TYPE(g) = builtin_type_void;
2651 gdbinfo = (struct mips_extra_func_info *)
2652 xzalloc(sizeof(struct mips_extra_func_info));
2654 SYMBOL_VALUE(g) = (long) gdbinfo;
2656 gdbinfo->numargs = nargs;
2657 gdbinfo->framesize = framesize;
2658 gdbinfo->framereg = 29;
2659 gdbinfo->pcreg = 31;
2660 gdbinfo->regmask = -2;
2661 gdbinfo->regoffset = -4;
2662 gdbinfo->fregmask = 0; /* XXX */
2663 gdbinfo->fregoffset = 0; /* XXX */
2666 /* We just returned from the dummy code at END_PC, drop its symbol */
2668 mips_destroy_dummy_symbol(end_pc)
2671 struct blockvector *bv = BLOCKVECTOR(dummy_symtab);
2674 bl = block_for_pc(end_pc);
2675 free(BLOCK_FUNCTION(bl));
2676 free(SYMBOL_VALUE(BLOCK_SYM(bl,0)));
2677 free(BLOCK_SYM(bl,0));
2679 for (i = FIRST_LOCAL_BLOCK; i < BLOCKVECTOR_NBLOCKS(bv); i++)
2680 if (BLOCKVECTOR_BLOCK(bv,i) == bl)
2682 for (; i < BLOCKVECTOR_NBLOCKS(bv) - 1; i++)
2683 BLOCKVECTOR_BLOCK(bv,i) = BLOCKVECTOR_BLOCK(bv,i+1);
2684 BLOCKVECTOR_NBLOCKS(bv)--;
2685 sort_blocks(dummy_symtab);
2690 /* Sigtramp: make sure we have all the necessary information
2691 about the signal trampoline code. Since the official code
2692 from MIPS does not do so, we make up that information ourselves.
2693 If they fix the library (unlikely) this code will neutralize itself. */
2700 struct block *b, *b0;
2702 sigtramp_address = -1;
2704 /* We know it is sold as sigvec */
2705 s = lookup_symbol("sigvec", 0, VAR_NAMESPACE, 0, NULL);
2707 /* Most programs do not play with signals */
2711 b0 = SYMBOL_BLOCK_VALUE(s);
2713 /* A label of sigvec, to be more precise */
2714 s = lookup_symbol("sigtramp", b0, VAR_NAMESPACE, 0, NULL);
2716 /* But maybe this program uses its own version of sigvec */
2720 sigtramp_address = SYMBOL_VALUE(s);
2721 sigtramp_end = sigtramp_address + 0x88; /* black magic */
2723 /* Did we or MIPSco fix the library ? */
2724 if (SYMBOL_CLASS(s) == LOC_BLOCK)
2727 /* But what symtab does it live in ? */
2728 st = find_pc_symtab(SYMBOL_VALUE(s));
2731 * Ok, there goes the fix: turn it into a procedure, with all the
2732 * needed info. Note we make it a nested procedure of sigvec,
2733 * which is the way the (assembly) code is actually written.
2735 SYMBOL_NAMESPACE(s) = VAR_NAMESPACE;
2736 SYMBOL_CLASS(s) = LOC_BLOCK;
2737 SYMBOL_TYPE(s) = make_type(TYPE_CODE_FUNC, 4, 0, 0);
2738 TYPE_TARGET_TYPE(SYMBOL_TYPE(s)) = builtin_type_void;
2740 /* Need a block to allocate .gdbinfo. in */
2742 SYMBOL_BLOCK_VALUE(s) = b;
2743 BLOCK_START(b) = sigtramp_address;
2744 BLOCK_END(b) = sigtramp_end;
2745 BLOCK_FUNCTION(b) = s;
2746 BLOCK_SUPERBLOCK(b) = BLOCK_SUPERBLOCK(b0);
2750 /* Make a .gdbinfo. for it */
2752 struct mips_extra_func_info *e =
2753 (struct mips_extra_func_info *)
2754 xzalloc(sizeof(struct mips_extra_func_info));
2756 e->numargs = 0; /* the kernel thinks otherwise */
2757 /* align_longword(sigcontext + SIGFRAME) */
2758 e->framesize = 0x150;
2759 e->framereg = SP_REGNUM;
2762 e->regoffset = -(41 * sizeof(int));
2764 e->fregoffset = -(37 * sizeof(int));
2767 s = new_symbol(".gdbinfo.");
2768 SYMBOL_VALUE(s) = (int) e;
2769 SYMBOL_NAMESPACE(s) = LABEL_NAMESPACE;
2770 SYMBOL_CLASS(s) = LOC_CONST;
2771 SYMBOL_TYPE(s) = builtin_type_void;
2774 BLOCK_SYM(b,BLOCK_NSYMS(b)++) = s;
2777 /* Initialization */
2779 static struct sym_fns ecoff_sym_fns = {"ecoff", 5,
2780 mipscoff_new_init, mipscoff_symfile_init,
2781 mipscoff_symfile_read};
2783 _initialize_mipsread ()
2785 add_symtab_fns (&ecoff_sym_fns);
2787 /* Missing basic types */
2788 builtin_type_string = make_type(TYPE_CODE_PASCAL_ARRAY,
2790 builtin_type_complex = make_type(TYPE_CODE_FLT,
2791 2 * sizeof(float), 0, "complex");
2792 builtin_type_double_complex = make_type(TYPE_CODE_FLT,
2793 2 * sizeof(double), 0, "double_complex");
2794 builtin_type_fixed_dec = make_type(TYPE_CODE_INT, sizeof(int),
2795 0, "fixed_decimal");
2796 builtin_type_float_dec = make_type(TYPE_CODE_FLT, sizeof(double),
2797 0, "floating_decimal");
2799 /* Templates types */
2800 builtin_type_struct = make_type(TYPE_CODE_STRUCT, 0, 0, 0);
2801 builtin_type_union = make_type(TYPE_CODE_UNION, 0, 0, 0);
2802 builtin_type_enum = make_type(TYPE_CODE_ENUM, 0, 0, 0);
2803 builtin_type_range = make_type(TYPE_CODE_RANGE, 0, 0, 0);
2804 builtin_type_set = make_type(TYPE_CODE_SET, 0, 0, 0);
2806 /* We can't do this now because builtin_type_void may not
2807 be set yet. Do it at symbol reading time. */
2808 /* builtin_type_ptr = lookup_pointer_type (builtin_type_void); */