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
|
/* $Id: symtab.c,v 1.12 2024/12/14 14:40:24 tom Exp $ */
#include "defs.h"
/* TABLE_SIZE is the number of entries in the symbol table. */
/* TABLE_SIZE must be a power of two. */
#define TABLE_SIZE 1024
static bucket **symbol_table = NULL;
bucket *first_symbol;
bucket *last_symbol;
static int
hash(const char *name)
{
const char *s;
int c, k;
assert(name && *name);
s = name;
k = *s;
while ((c = *++s) != 0)
k = (31 * k + c) & (TABLE_SIZE - 1);
return (k);
}
bucket *
make_bucket(const char *name)
{
bucket *bp;
assert(name != NULL);
bp = TMALLOC(bucket, 1);
NO_SPACE(bp);
bp->link = NULL;
bp->next = NULL;
bp->name = TMALLOC(char, strlen(name) + 1);
NO_SPACE(bp->name);
bp->tag = NULL;
bp->value = UNDEFINED;
bp->index = 0;
bp->prec = 0;
bp->class = UNKNOWN;
bp->assoc = TOKEN;
#if defined(YYBTYACC)
bp->args = -1;
bp->argnames = NULL;
bp->argtags = NULL;
bp->destructor = NULL;
#endif
strcpy(bp->name, name);
return (bp);
}
bucket *
lookup(const char *name)
{
bucket *bp, **bpp;
bpp = symbol_table + hash(name);
bp = *bpp;
while (bp)
{
if (strcmp(name, bp->name) == 0)
return (bp);
bpp = &bp->link;
bp = *bpp;
}
*bpp = bp = make_bucket(name);
last_symbol->next = bp;
last_symbol = bp;
return (bp);
}
void
create_symbol_table(void)
{
int i;
bucket *bp;
symbol_table = TMALLOC(bucket *, TABLE_SIZE);
NO_SPACE(symbol_table);
for (i = 0; i < TABLE_SIZE; i++)
symbol_table[i] = NULL;
bp = make_bucket("error");
bp->index = 1;
bp->class = TERM;
first_symbol = bp;
last_symbol = bp;
symbol_table[hash("error")] = bp;
}
void
free_symbol_table(void)
{
FREE(symbol_table);
symbol_table = NULL;
}
void
free_symbols(void)
{
bucket *p, *q;
for (p = first_symbol; p; p = q)
{
q = p->next;
FREE(p);
}
}
|
