Subversion Repositories or1k

/* Symbol table definitions for GDB.

   Copyright 1986, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996,

   1997, 1998, 1999, 2000, 2001

   Free Software Foundation, Inc.

   This file is part of GDB.

   This program is free software; you can redistribute it and/or modify

   it under the terms of the GNU General Public License as published by

   the Free Software Foundation; either version 2 of the License, or

   (at your option) any later version.

   This program is distributed in the hope that it will be useful,

   but WITHOUT ANY WARRANTY; without even the implied warranty of

   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License

   along with this program; if not, write to the Free Software

   Foundation, Inc., 59 Temple Place - Suite 330,

   Boston, MA 02111-1307, USA.  */

#if !defined (SYMTAB_H)

#define SYMTAB_H 1

/* Opaque declarations.  */

struct obstack;

/* Don't do this; it means that if some .o's are compiled with GNU C

   and some are not (easy to do accidentally the way we configure

   things; also it is a pain to have to "make clean" every time you

   want to switch compilers), then GDB dies a horrible death.  */

/* GNU C supports enums that are bitfields.  Some compilers don't. */

#if 0 && defined(__GNUC__) && !defined(BYTE_BITFIELD)

#define BYTE_BITFIELD   :8;

#else

#define BYTE_BITFIELD           /*nothing */

#endif

/* Define a structure for the information that is common to all symbol types,

   including minimal symbols, partial symbols, and full symbols.  In a

   multilanguage environment, some language specific information may need to

   be recorded along with each symbol.

   These fields are ordered to encourage good packing, since we frequently

   have tens or hundreds of thousands of these.  */

struct general_symbol_info

  {

    /* Name of the symbol.  This is a required field.  Storage for the name is

       allocated on the psymbol_obstack or symbol_obstack for the associated

       objfile. */

    char *name;

    /* Value of the symbol.  Which member of this union to use, and what

       it means, depends on what kind of symbol this is and its

       SYMBOL_CLASS.  See comments there for more details.  All of these

       are in host byte order (though what they point to might be in

       target byte order, e.g. LOC_CONST_BYTES).  */

    union

      {

        /* The fact that this is a long not a LONGEST mainly limits the

           range of a LOC_CONST.  Since LOC_CONST_BYTES exists, I'm not

           sure that is a big deal.  */

        long ivalue;

        struct block *block;

        char *bytes;

        CORE_ADDR address;

        /* for opaque typedef struct chain */

        struct symbol *chain;

      }

    value;

    /* Since one and only one language can apply, wrap the language specific

       information inside a union. */

    union

      {

        struct cplus_specific   /* For C++ */

        /*  and Java */

          {

            char *demangled_name;

          }

        cplus_specific;

#if 0

        /* OBSOLETE struct chill_specific        *//* For Chill */

        /* OBSOLETE   { */

        /* OBSOLETE     char *demangled_name; */

        /* OBSOLETE   } */

        /* OBSOLETE chill_specific; */

#endif

      }

    language_specific;

    /* Record the source code language that applies to this symbol.

       This is used to select one of the fields from the language specific

       union above. */

    enum language language BYTE_BITFIELD;

    /* Which section is this symbol in?  This is an index into

       section_offsets for this objfile.  Negative means that the symbol

       does not get relocated relative to a section.

       Disclaimer: currently this is just used for xcoff, so don't

       expect all symbol-reading code to set it correctly (the ELF code

       also tries to set it correctly).  */

    short section;

    /* The bfd section associated with this symbol. */

    asection *bfd_section;

  };

extern CORE_ADDR symbol_overlayed_address (CORE_ADDR, asection *);

#define SYMBOL_NAME(symbol)             (symbol)->ginfo.name

#define SYMBOL_VALUE(symbol)            (symbol)->ginfo.value.ivalue

#define SYMBOL_VALUE_ADDRESS(symbol)    (symbol)->ginfo.value.address

#define SYMBOL_VALUE_BYTES(symbol)      (symbol)->ginfo.value.bytes

#define SYMBOL_BLOCK_VALUE(symbol)      (symbol)->ginfo.value.block

#define SYMBOL_VALUE_CHAIN(symbol)      (symbol)->ginfo.value.chain

#define SYMBOL_LANGUAGE(symbol)         (symbol)->ginfo.language

#define SYMBOL_SECTION(symbol)          (symbol)->ginfo.section

#define SYMBOL_BFD_SECTION(symbol)      (symbol)->ginfo.bfd_section

#define SYMBOL_CPLUS_DEMANGLED_NAME(symbol)     \

  (symbol)->ginfo.language_specific.cplus_specific.demangled_name

/* Macro that initializes the language dependent portion of a symbol

   depending upon the language for the symbol. */

#define SYMBOL_INIT_LANGUAGE_SPECIFIC(symbol,language)                  \

  do {                                                                  \

    SYMBOL_LANGUAGE (symbol) = language;                                \

    if (SYMBOL_LANGUAGE (symbol) == language_cplus                      \

        || SYMBOL_LANGUAGE (symbol) == language_java                    \

        )                                                               \

      {                                                                 \

        SYMBOL_CPLUS_DEMANGLED_NAME (symbol) = NULL;                    \

      }                                                                 \

    /* OBSOLETE else if (SYMBOL_LANGUAGE (symbol) == language_chill) */ \

    /* OBSOLETE   { */                                                  \

    /* OBSOLETE     SYMBOL_CHILL_DEMANGLED_NAME (symbol) = NULL; */     \

    /* OBSOLETE   } */                                                  \

    else                                                                \

      {                                                                 \

        memset (&(symbol)->ginfo.language_specific, 0,                   \

                sizeof ((symbol)->ginfo.language_specific));            \

      }                                                                 \

  } while (0)

#define SYMBOL_INIT_DEMANGLED_NAME(symbol,obstack) \

  (symbol_init_demangled_name (&symbol->ginfo, (obstack)))

extern void symbol_init_demangled_name (struct general_symbol_info *symbol,

                                        struct obstack *obstack);

/* Macro that returns the demangled name for a symbol based on the language

   for that symbol.  If no demangled name exists, returns NULL. */

#define SYMBOL_DEMANGLED_NAME(symbol)                                   \

  (SYMBOL_LANGUAGE (symbol) == language_cplus                           \

   || SYMBOL_LANGUAGE (symbol) == language_java                         \

   ? SYMBOL_CPLUS_DEMANGLED_NAME (symbol)                               \

   : /* OBSOLETE (SYMBOL_LANGUAGE (symbol) == language_chill */         \

     /* OBSOLETE ? SYMBOL_CHILL_DEMANGLED_NAME (symbol) */              \

     NULL)

/* OBSOLETE #define SYMBOL_CHILL_DEMANGLED_NAME(symbol) */

/* OBSOLETE (symbol)->ginfo.language_specific.chill_specific.demangled_name */

/* Macro that returns the "natural source name" of a symbol.  In C++ this is

   the "demangled" form of the name if demangle is on and the "mangled" form

   of the name if demangle is off.  In other languages this is just the

   symbol name.  The result should never be NULL. */

#define SYMBOL_SOURCE_NAME(symbol)                                      \

  (demangle && SYMBOL_DEMANGLED_NAME (symbol) != NULL                   \

   ? SYMBOL_DEMANGLED_NAME (symbol)                                     \

   : SYMBOL_NAME (symbol))

/* Macro that returns the "natural assembly name" of a symbol.  In C++ this is

   the "mangled" form of the name if demangle is off, or if demangle is on and

   asm_demangle is off.  Otherwise if asm_demangle is on it is the "demangled"

   form.  In other languages this is just the symbol name.  The result should

   never be NULL. */

#define SYMBOL_LINKAGE_NAME(symbol)                                     \

  (demangle && asm_demangle && SYMBOL_DEMANGLED_NAME (symbol) != NULL   \

   ? SYMBOL_DEMANGLED_NAME (symbol)                                     \

   : SYMBOL_NAME (symbol))

/* Macro that tests a symbol for a match against a specified name string.

   First test the unencoded name, then looks for and test a C++ encoded

   name if it exists.  Note that whitespace is ignored while attempting to

   match a C++ encoded name, so that "foo::bar(int,long)" is the same as

   "foo :: bar (int, long)".

   Evaluates to zero if the match fails, or nonzero if it succeeds. */

#define SYMBOL_MATCHES_NAME(symbol, name)                               \

  (STREQ (SYMBOL_NAME (symbol), (name))                                 \

   || (SYMBOL_DEMANGLED_NAME (symbol) != NULL                           \

       && strcmp_iw (SYMBOL_DEMANGLED_NAME (symbol), (name)) == 0))

/* Macro that tests a symbol for an re-match against the last compiled regular

   expression.  First test the unencoded name, then look for and test a C++

   encoded name if it exists.

   Evaluates to zero if the match fails, or nonzero if it succeeds. */

#define SYMBOL_MATCHES_REGEXP(symbol)                                   \

  (re_exec (SYMBOL_NAME (symbol)) != 0                                   \

   || (SYMBOL_DEMANGLED_NAME (symbol) != NULL                           \

       && re_exec (SYMBOL_DEMANGLED_NAME (symbol)) != 0))

/* Define a simple structure used to hold some very basic information about

   all defined global symbols (text, data, bss, abs, etc).  The only required

   information is the general_symbol_info.

   In many cases, even if a file was compiled with no special options for

   debugging at all, as long as was not stripped it will contain sufficient

   information to build a useful minimal symbol table using this structure.

   Even when a file contains enough debugging information to build a full

   symbol table, these minimal symbols are still useful for quickly mapping

   between names and addresses, and vice versa.  They are also sometimes

   used to figure out what full symbol table entries need to be read in. */

struct minimal_symbol

  {

    /* The general symbol info required for all types of symbols.

       The SYMBOL_VALUE_ADDRESS contains the address that this symbol

       corresponds to.  */

    struct general_symbol_info ginfo;

    /* The info field is available for caching machine-specific information

       so it doesn't have to rederive the info constantly (over a serial line).

       It is initialized to zero and stays that way until target-dependent code

       sets it.  Storage for any data pointed to by this field should be allo-

       cated on the symbol_obstack for the associated objfile.

       The type would be "void *" except for reasons of compatibility with older

       compilers.  This field is optional.

       Currently, the AMD 29000 tdep.c uses it to remember things it has decoded

       from the instructions in the function header, and the MIPS-16 code uses

       it to identify 16-bit procedures.  */

    char *info;

#ifdef SOFUN_ADDRESS_MAYBE_MISSING

    /* Which source file is this symbol in?  Only relevant for mst_file_*.  */

    char *filename;

#endif

    /* Classification types for this symbol.  These should be taken as "advisory

       only", since if gdb can't easily figure out a classification it simply

       selects mst_unknown.  It may also have to guess when it can't figure out

       which is a better match between two types (mst_data versus mst_bss) for

       example.  Since the minimal symbol info is sometimes derived from the

       BFD library's view of a file, we need to live with what information bfd

       supplies. */

    enum minimal_symbol_type

      {

        mst_unknown = 0, /* Unknown type, the default */

        mst_text,               /* Generally executable instructions */

        mst_data,               /* Generally initialized data */

        mst_bss,                /* Generally uninitialized data */

        mst_abs,                /* Generally absolute (nonrelocatable) */

        /* GDB uses mst_solib_trampoline for the start address of a shared

           library trampoline entry.  Breakpoints for shared library functions

           are put there if the shared library is not yet loaded.

           After the shared library is loaded, lookup_minimal_symbol will

           prefer the minimal symbol from the shared library (usually

           a mst_text symbol) over the mst_solib_trampoline symbol, and the

           breakpoints will be moved to their true address in the shared

           library via breakpoint_re_set.  */

        mst_solib_trampoline,   /* Shared library trampoline code */

        /* For the mst_file* types, the names are only guaranteed to be unique

           within a given .o file.  */

        mst_file_text,          /* Static version of mst_text */

        mst_file_data,          /* Static version of mst_data */

        mst_file_bss            /* Static version of mst_bss */

      }

    type BYTE_BITFIELD;

    /* Minimal symbols with the same hash key are kept on a linked

       list.  This is the link.  */

    struct minimal_symbol *hash_next;

    /* Minimal symbols are stored in two different hash tables.  This is

       the `next' pointer for the demangled hash table.  */

    struct minimal_symbol *demangled_hash_next;

  };

#define MSYMBOL_INFO(msymbol)           (msymbol)->info

#define MSYMBOL_TYPE(msymbol)           (msymbol)->type

/* All of the name-scope contours of the program

   are represented by `struct block' objects.

   All of these objects are pointed to by the blockvector.

   Each block represents one name scope.

   Each lexical context has its own block.

   The blockvector begins with some special blocks.

   The GLOBAL_BLOCK contains all the symbols defined in this compilation

   whose scope is the entire program linked together.

   The STATIC_BLOCK contains all the symbols whose scope is the

   entire compilation excluding other separate compilations.

   Blocks starting with the FIRST_LOCAL_BLOCK are not special.

   Each block records a range of core addresses for the code that

   is in the scope of the block.  The STATIC_BLOCK and GLOBAL_BLOCK

   give, for the range of code, the entire range of code produced

   by the compilation that the symbol segment belongs to.

   The blocks appear in the blockvector

   in order of increasing starting-address,

   and, within that, in order of decreasing ending-address.

   This implies that within the body of one function

   the blocks appear in the order of a depth-first tree walk.  */

struct blockvector

  {

    /* Number of blocks in the list.  */

    int nblocks;

    /* The blocks themselves.  */

    struct block *block[1];

  };

#define BLOCKVECTOR_NBLOCKS(blocklist) (blocklist)->nblocks

#define BLOCKVECTOR_BLOCK(blocklist,n) (blocklist)->block[n]

/* Special block numbers */

#define GLOBAL_BLOCK            0

#define STATIC_BLOCK            1

#define FIRST_LOCAL_BLOCK       2

struct block

  {

    /* Addresses in the executable code that are in this block.  */

    CORE_ADDR startaddr;

    CORE_ADDR endaddr;

    /* The symbol that names this block, if the block is the body of a

       function; otherwise, zero.  */

    struct symbol *function;

    /* The `struct block' for the containing block, or 0 if none.

       The superblock of a top-level local block (i.e. a function in the

       case of C) is the STATIC_BLOCK.  The superblock of the

       STATIC_BLOCK is the GLOBAL_BLOCK.  */

    struct block *superblock;

    /* Version of GCC used to compile the function corresponding

       to this block, or 0 if not compiled with GCC.  When possible,

       GCC should be compatible with the native compiler, or if that

       is not feasible, the differences should be fixed during symbol

       reading.  As of 16 Apr 93, this flag is never used to distinguish

       between gcc2 and the native compiler.

       If there is no function corresponding to this block, this meaning

       of this flag is undefined.  */

    unsigned char gcc_compile_flag;

    /* The symbols for this block are either in a simple linear list or

       in a simple hashtable.  Blocks which correspond to a function

       (which have a list of symbols corresponding to arguments) use

       a linear list, as do some older symbol readers (currently only

       mdebugread and dstread).  Other blocks are hashed.

       The hashtable uses the same hash function as the minsym hashtables,

       found in minsyms.c:minsym_hash_iw.  Symbols are hashed based on

       their demangled name if appropriate, and on their name otherwise.

       The hash function ignores space, and stops at the beginning of the

       argument list if any.

       The table is laid out in NSYMS/5 buckets and symbols are chained via

       their hash_next field.  */

    /* If this is really a hashtable of the symbols, this flag is 1.  */

    unsigned char hashtable;

    /* Number of local symbols.  */

    int nsyms;

    /* The symbols.  If some of them are arguments, then they must be

       in the order in which we would like to print them.  */

    struct symbol *sym[1];

  };

#define BLOCK_START(bl)         (bl)->startaddr

#define BLOCK_END(bl)           (bl)->endaddr

#define BLOCK_FUNCTION(bl)      (bl)->function

#define BLOCK_SUPERBLOCK(bl)    (bl)->superblock

#define BLOCK_GCC_COMPILED(bl)  (bl)->gcc_compile_flag

#define BLOCK_HASHTABLE(bl)     (bl)->hashtable

/* For blocks without a hashtable (BLOCK_HASHTABLE (bl) == 0) only.  */

#define BLOCK_NSYMS(bl)         (bl)->nsyms

#define BLOCK_SYM(bl, n)        (bl)->sym[n]

/* For blocks with a hashtable, but these are valid for non-hashed blocks as

   well - each symbol will appear to be one bucket by itself.  */

#define BLOCK_BUCKETS(bl)       (bl)->nsyms

#define BLOCK_BUCKET(bl, n)     (bl)->sym[n]

/* Macro used to set the size of a hashtable for N symbols.  */

#define BLOCK_HASHTABLE_SIZE(n) ((n)/5 + 1)

/* Macro to loop through all symbols in a block BL, in no particular order.

   i counts which bucket we are in, and sym points to the current symbol.  */

#define ALL_BLOCK_SYMBOLS(bl, i, sym)                           \

        for ((i) = 0; (i) < BLOCK_BUCKETS ((bl)); (i)++) \

          for ((sym) = BLOCK_BUCKET ((bl), (i)); (sym);         \

               (sym) = (sym)->hash_next)

/* Nonzero if symbols of block BL should be sorted alphabetically.

   Don't sort a block which corresponds to a function.  If we did the

   sorting would have to preserve the order of the symbols for the

   arguments.  Also don't sort any block that we chose to hash.  */

#define BLOCK_SHOULD_SORT(bl) (! BLOCK_HASHTABLE (bl) \

                               && BLOCK_FUNCTION (bl) == NULL)

/* Represent one symbol name; a variable, constant, function or typedef.  */

/* Different name spaces for symbols.  Looking up a symbol specifies a

   namespace and ignores symbol definitions in other name spaces. */

typedef enum

  {

    /* UNDEF_NAMESPACE is used when a namespace has not been discovered or

       none of the following apply.  This usually indicates an error either

       in the symbol information or in gdb's handling of symbols. */

    UNDEF_NAMESPACE,

    /* VAR_NAMESPACE is the usual namespace.  In C, this contains variables,

       function names, typedef names and enum type values. */

    VAR_NAMESPACE,

    /* STRUCT_NAMESPACE is used in C to hold struct, union and enum type names.

       Thus, if `struct foo' is used in a C program, it produces a symbol named

       `foo' in the STRUCT_NAMESPACE. */

    STRUCT_NAMESPACE,

    /* LABEL_NAMESPACE may be used for names of labels (for gotos);

       currently it is not used and labels are not recorded at all.  */

    LABEL_NAMESPACE,

    /* Searching namespaces. These overlap with VAR_NAMESPACE, providing

       some granularity with the search_symbols function. */

    /* Everything in VAR_NAMESPACE minus FUNCTIONS_-, TYPES_-, and

       METHODS_NAMESPACE */

    VARIABLES_NAMESPACE,

    /* All functions -- for some reason not methods, though. */

    FUNCTIONS_NAMESPACE,

    /* All defined types */

    TYPES_NAMESPACE,

    /* All class methods -- why is this separated out? */

    METHODS_NAMESPACE

  }

namespace_enum;

/* An address-class says where to find the value of a symbol.  */

enum address_class

  {

    /* Not used; catches errors */

    LOC_UNDEF,

    /* Value is constant int SYMBOL_VALUE, host byteorder */

    LOC_CONST,

    /* Value is at fixed address SYMBOL_VALUE_ADDRESS */

    LOC_STATIC,

    /* Value is in register.  SYMBOL_VALUE is the register number.  */

    LOC_REGISTER,

    /* It's an argument; the value is at SYMBOL_VALUE offset in arglist.  */

    LOC_ARG,

    /* Value address is at SYMBOL_VALUE offset in arglist.  */

    LOC_REF_ARG,

    /* Value is in register number SYMBOL_VALUE.  Just like LOC_REGISTER

       except this is an argument.  Probably the cleaner way to handle

       this would be to separate address_class (which would include

       separate ARG and LOCAL to deal with FRAME_ARGS_ADDRESS versus

       FRAME_LOCALS_ADDRESS), and an is_argument flag.

       For some symbol formats (stabs, for some compilers at least),

       the compiler generates two symbols, an argument and a register.

       In some cases we combine them to a single LOC_REGPARM in symbol

       reading, but currently not for all cases (e.g. it's passed on the

       stack and then loaded into a register).  */

    LOC_REGPARM,

    /* Value is in specified register.  Just like LOC_REGPARM except the

       register holds the address of the argument instead of the argument

       itself. This is currently used for the passing of structs and unions

       on sparc and hppa.  It is also used for call by reference where the

       address is in a register, at least by mipsread.c.  */

    LOC_REGPARM_ADDR,

    /* Value is a local variable at SYMBOL_VALUE offset in stack frame.  */

    LOC_LOCAL,

    /* Value not used; definition in SYMBOL_TYPE.  Symbols in the namespace

       STRUCT_NAMESPACE all have this class.  */

    LOC_TYPEDEF,

    /* Value is address SYMBOL_VALUE_ADDRESS in the code */

    LOC_LABEL,

    /* In a symbol table, value is SYMBOL_BLOCK_VALUE of a `struct block'.

       In a partial symbol table, SYMBOL_VALUE_ADDRESS is the start address

       of the block.  Function names have this class. */

    LOC_BLOCK,

    /* Value is a constant byte-sequence pointed to by SYMBOL_VALUE_BYTES, in

       target byte order.  */

    LOC_CONST_BYTES,

    /* Value is arg at SYMBOL_VALUE offset in stack frame. Differs from

       LOC_LOCAL in that symbol is an argument; differs from LOC_ARG in

       that we find it in the frame (FRAME_LOCALS_ADDRESS), not in the

       arglist (FRAME_ARGS_ADDRESS).  Added for i960, which passes args

       in regs then copies to frame.  */

    LOC_LOCAL_ARG,

    /* Value is at SYMBOL_VALUE offset from the current value of

       register number SYMBOL_BASEREG.  This exists mainly for the same

       things that LOC_LOCAL and LOC_ARG do; but we need to do this

       instead because on 88k DWARF gives us the offset from the

       frame/stack pointer, rather than the offset from the "canonical

       frame address" used by COFF, stabs, etc., and we don't know how

       to convert between these until we start examining prologues.

       Note that LOC_BASEREG is much less general than a DWARF expression.

       We don't need the generality (at least not yet), and storing a general

       DWARF expression would presumably take up more space than the existing

       scheme.  */

    LOC_BASEREG,

    /* Same as LOC_BASEREG but it is an argument.  */

    LOC_BASEREG_ARG,

    /* Value is at fixed address, but the address of the variable has

       to be determined from the minimal symbol table whenever the

       variable is referenced.

       This happens if debugging information for a global symbol is

       emitted and the corresponding minimal symbol is defined

       in another object file or runtime common storage.

       The linker might even remove the minimal symbol if the global

       symbol is never referenced, in which case the symbol remains

       unresolved.  */

    LOC_UNRESOLVED,

    /* Value is at a thread-specific location calculated by a

       target-specific method. */

    LOC_THREAD_LOCAL_STATIC,

    /* The variable does not actually exist in the program.

       The value is ignored.  */

    LOC_OPTIMIZED_OUT,

    /* The variable is static, but actually lives at * (address).

     * I.e. do an extra indirection to get to it.

     * This is used on HP-UX to get at globals that are allocated

     * in shared libraries, where references from images other

     * than the one where the global was allocated are done

     * with a level of indirection.

     */

    LOC_INDIRECT

  };

/* Linked list of symbol's live ranges. */

struct range_list

  {

    CORE_ADDR start;

    CORE_ADDR end;

    struct range_list *next;

  };

/* Linked list of aliases for a particular main/primary symbol.  */

struct alias_list

  {

    struct symbol *sym;

    struct alias_list *next;

  };

struct symbol

  {

    /* The general symbol info required for all types of symbols. */

    struct general_symbol_info ginfo;

    /* Data type of value */

    struct type *type;

    /* Name space code.  */

#ifdef __MFC4__

    /* FIXME: don't conflict with C++'s namespace */

    /* would be safer to do a global change for all namespace identifiers. */

#define namespace _namespace

#endif

    namespace_enum namespace BYTE_BITFIELD;

    /* Address class */

    enum address_class aclass BYTE_BITFIELD;

    /* Line number of definition.  FIXME:  Should we really make the assumption

       that nobody will try to debug files longer than 64K lines?  What about

       machine generated programs? */

    unsigned short line;

    /* Some symbols require an additional value to be recorded on a per-

       symbol basis.  Stash those values here. */

    union

      {

        /* Used by LOC_BASEREG and LOC_BASEREG_ARG.  */

        short basereg;

      }

    aux_value;

    /* Link to a list of aliases for this symbol.

       Only a "primary/main symbol may have aliases.  */

    struct alias_list *aliases;

    /* List of ranges where this symbol is active.  This is only

       used by alias symbols at the current time.  */

    struct range_list *ranges;

    struct symbol *hash_next;

  };

#define SYMBOL_NAMESPACE(symbol)        (symbol)->namespace

#define SYMBOL_CLASS(symbol)            (symbol)->aclass

#define SYMBOL_TYPE(symbol)             (symbol)->type

#define SYMBOL_LINE(symbol)             (symbol)->line

#define SYMBOL_BASEREG(symbol)          (symbol)->aux_value.basereg

#define SYMBOL_ALIASES(symbol)          (symbol)->aliases

#define SYMBOL_RANGES(symbol)           (symbol)->ranges

/* A partial_symbol records the name, namespace, and address class of

   symbols whose types we have not parsed yet.  For functions, it also

   contains their memory address, so we can find them from a PC value.

   Each partial_symbol sits in a partial_symtab, all of which are chained

   on a  partial symtab list and which points to the corresponding

   normal symtab once the partial_symtab has been referenced.  */

struct partial_symbol

  {

    /* The general symbol info required for all types of symbols. */

    struct general_symbol_info ginfo;

    /* Name space code.  */

    namespace_enum namespace BYTE_BITFIELD;

    /* Address class (for info_symbols) */

    enum address_class aclass BYTE_BITFIELD;

  };

#define PSYMBOL_NAMESPACE(psymbol)      (psymbol)->namespace

#define PSYMBOL_CLASS(psymbol)          (psymbol)->aclass

/* Source-file information.  This describes the relation between source files,

   line numbers and addresses in the program text.  */

struct sourcevector

  {

    int length;                 /* Number of source files described */

    struct source *source[1];   /* Descriptions of the files */

  };

/* Each item represents a line-->pc (or the reverse) mapping.  This is

   somewhat more wasteful of space than one might wish, but since only

   the files which are actually debugged are read in to core, we don't

   waste much space.  */

struct linetable_entry

  {

    int line;

    CORE_ADDR pc;

  };

/* The order of entries in the linetable is significant.  They should

   be sorted by increasing values of the pc field.  If there is more than

   one entry for a given pc, then I'm not sure what should happen (and

   I not sure whether we currently handle it the best way).

   Example: a C for statement generally looks like this

   10   0x100   - for the init/test part of a for stmt.

   20   0x200

   30   0x300

   10   0x400   - for the increment part of a for stmt.

   If an entry has a line number of zero, it marks the start of a PC

   range for which no line number information is available.  It is

   acceptable, though wasteful of table space, for such a range to be

   zero length.  */

struct linetable

  {

    int nitems;

    /* Actually NITEMS elements.  If you don't like this use of the

       `struct hack', you can shove it up your ANSI (seriously, if the

       committee tells us how to do it, we can probably go along).  */

    struct linetable_entry item[1];

  };

/* All the information on one source file.  */

struct source

  {

    char *name;                 /* Name of file */

    struct linetable contents;

  };

/* How to relocate the symbols from each section in a symbol file.

   Each struct contains an array of offsets.

   The ordering and meaning of the offsets is file-type-dependent;

   typically it is indexed by section numbers or symbol types or

   something like that.

   To give us flexibility in changing the internal representation

   of these offsets, the ANOFFSET macro must be used to insert and

   extract offset values in the struct.  */

struct section_offsets

  {

    CORE_ADDR offsets[1];       /* As many as needed. */

  };

#define ANOFFSET(secoff, whichone) \

   ((whichone == -1) \

    ? (internal_error (__FILE__, __LINE__, "Section index is uninitialized"), -1) \

    : secoff->offsets[whichone])

/* The maximum possible size of a section_offsets table.  */

#define SIZEOF_SECTION_OFFSETS \

  (sizeof (struct section_offsets) \

   + sizeof (((struct section_offsets *) 0)->offsets) * (SECT_OFF_MAX-1))

/* Each source file or header is represented by a struct symtab.

   These objects are chained through the `next' field.  */

struct symtab

  {

    /* Chain of all existing symtabs.  */

    struct symtab *next;

    /* List of all symbol scope blocks for this symtab.  May be shared

       between different symtabs (and normally is for all the symtabs

       in a given compilation unit).  */

    struct blockvector *blockvector;