aeeae31e6f4e88d8c74a768f5f1475c60bdac293
[binutils-gdb.git] / ld / ldsym.h
1 /* ldsym.h -
2
3 Copyright (C) 1991 Free Software Foundation, Inc.
4
5 This file is part of GLD, the Gnu Linker.
6
7 GLD 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 1, or (at your option)
10 any later version.
11
12 GLD 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.
16
17 You should have received a copy of the GNU General Public License
18 along with GLD; see the file COPYING. If not, write to
19 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
20
21 typedef struct user_symbol_struct
22 {
23 /* Point to next symbol in this hash chain */
24 struct user_symbol_struct *link;
25
26 /* Name of this symbol. */
27 char *name;
28
29 /* Pointer to next symbol in order of symbol creation */
30 struct user_symbol_struct *next;
31
32 /* Chain of asymbols we see from input files
33 note that we point to the entry in the canonical table of
34 the pointer to the asymbol, *not* the asymbol. This means
35 that we can run back and fix all refs to point to the
36 defs nearly for free.
37 */
38 asymbol **srefs_chain;
39 asymbol **sdefs_chain;
40
41 /* only ever point to the largest ever common definition -
42 * all the rest are turned into refs
43 * scoms and sdefs are never != NULL at same time
44 */
45 asymbol **scoms_chain;
46
47 } ldsym_type;
48
49
50 PROTO(ldsym_type *, ldsym_get, (CONST char *));
51 PROTO(ldsym_type *, ldsym_get_soft, (CONST char *));
52 PROTO(void, ldsym_print_symbol_table,(void));
53 PROTO(void, ldsym_write, (void));
54 PROTO(boolean, ldsym_undefined, (CONST char *));
55 #define FOR_EACH_LDSYM(x) \
56 extern ldsym_type *symbol_head; \
57 ldsym_type *x; \
58 for (x = symbol_head; x != (ldsym_type *)NULL; x = x->next)
59
60