NASM 2.10rc15
[nasm/avx512.git] / rdoff / symtab.c
blob1dfee1ae14965178b6dff340cb38a87515e659fa
1 /* ----------------------------------------------------------------------- *
2 *
3 * Copyright 1996-2009 The NASM Authors - All Rights Reserved
4 * See the file AUTHORS included with the NASM distribution for
5 * the specific copyright holders.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following
9 * conditions are met:
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
30 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 * ----------------------------------------------------------------------- */
34 /*
35 * symtab.c Routines to maintain and manipulate a symbol table
37 * These routines donated to the NASM effort by Graeme Defty.
40 #include "compiler.h"
42 #include <stdio.h>
43 #include <stdlib.h>
44 #include <string.h>
46 #include "symtab.h"
47 #include "hash.h"
49 #define SYMTABSIZE 64
50 #define slotnum(x) (hash((x)) % SYMTABSIZE)
52 /* ------------------------------------- */
53 /* Private data types */
55 typedef struct tagSymtabNode {
56 struct tagSymtabNode *next;
57 symtabEnt ent;
58 } symtabNode;
60 typedef symtabNode *(symtabTab[SYMTABSIZE]);
62 typedef symtabTab *symtab;
64 /* ------------------------------------- */
65 void *symtabNew(void)
67 symtab mytab;
69 mytab = (symtabTab *) calloc(SYMTABSIZE, sizeof(symtabNode *));
70 if (mytab == NULL) {
71 fprintf(stderr, "symtab: out of memory\n");
72 exit(3);
75 return mytab;
78 /* ------------------------------------- */
79 void symtabDone(void *stab)
81 symtab mytab = (symtab) stab;
82 int i;
83 symtabNode *this, *next;
85 for (i = 0; i < SYMTABSIZE; ++i) {
87 for (this = (*mytab)[i]; this; this = next) {
88 next = this->next;
89 free(this);
93 free(*mytab);
96 /* ------------------------------------- */
97 void symtabInsert(void *stab, symtabEnt * ent)
99 symtab mytab = (symtab) stab;
100 symtabNode *node;
101 int slot;
103 node = malloc(sizeof(symtabNode));
104 if (node == NULL) {
105 fprintf(stderr, "symtab: out of memory\n");
106 exit(3);
109 slot = slotnum(ent->name);
111 node->ent = *ent;
112 node->next = (*mytab)[slot];
113 (*mytab)[slot] = node;
116 /* ------------------------------------- */
117 symtabEnt *symtabFind(void *stab, const char *name)
119 symtab mytab = (symtab) stab;
120 int slot = slotnum(name);
121 symtabNode *node = (*mytab)[slot];
123 while (node) {
124 if (!strcmp(node->ent.name, name)) {
125 return &(node->ent);
127 node = node->next;
130 return NULL;
133 /* ------------------------------------- */
134 void symtabDump(void *stab, FILE * of)
136 symtab mytab = (symtab) stab;
137 int i;
138 char *SegNames[3] = { "code", "data", "bss" };
140 fprintf(of, "Symbol table is ...\n");
141 for (i = 0; i < SYMTABSIZE; ++i) {
142 symtabNode *l = (symtabNode *) (*mytab)[i];
144 if (l) {
145 fprintf(of, " ... slot %d ...\n", i);
147 while (l) {
148 if ((l->ent.segment) == -1) {
149 fprintf(of, "%-32s Unresolved reference\n", l->ent.name);
150 } else {
151 fprintf(of, "%-32s %s:%08"PRIx32" (%"PRId32")\n", l->ent.name,
152 SegNames[l->ent.segment],
153 l->ent.offset, l->ent.flags);
155 l = l->next;
158 fprintf(of, "........... end of Symbol table.\n");