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