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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
/* hashed symbol table manipulation functions
*
* Implements hashed symbol tables. A hashed symbol table stores
* a table of pointers to linked lists of symbols; each entry in
* the table corresponds to a hash value, allowing a large table
* to be searched for a symbol rapidly.
*
* Notes: Separated from tokenizer.cpp to allow the run-time to link the hashed
* symbol table functions without needing to link the rest of the
* lexical analysis subsystem.
*/
#include "glk/tads/tads2/tokenizer.h"
#include "glk/tads/tads2/error.h"
#include "glk/tads/os_glk.h"
namespace Glk {
namespace TADS {
namespace TADS2 {
/* compute a hash value */
uint tokhsh(char *nam)
{
uint hash = 0;
while (*nam) hash = ((hash + *nam++) & (TOKHASHSIZE - 1));
return(hash);
}
/* for allocation - size of tokshdef without name portion */
struct toksh1def
{
tokthpdef tokshnxt;
toks1def tokshsc;
};
typedef struct toksh1def toksh1def;
/* initialize a hashed symbol table */
void tokthini(errcxdef *errctx, mcmcxdef *memctx, toktdef *toktab1)
{
tokthdef *toktab = (tokthdef *)toktab1; /* convert to correct type */
int i;
CLRSTRUCT(*toktab);
toktab->tokthsc.toktfadd = tokthadd; /* set add-symbol method */
toktab->tokthsc.toktfsea = tokthsea; /* set search-table method */
toktab->tokthsc.toktfset = tokthset; /* update symbol */
toktab->tokthsc.toktfeach = toktheach; /* call fn for all symbols */
toktab->tokthsc.tokterr = errctx; /* set error handling context */
toktab->tokthmem = memctx; /* memory manager context */
toktab->tokthcpool = mcmalo(memctx, (ushort)TOKTHSIZE,
&toktab->tokthpool[0]);
toktab->tokthpcnt = 0;
toktab->tokthsize = TOKTHSIZE;
/* set hash table entries to point to nothing (MCMONINV) */
for (i = 0 ; i < TOKHASHSIZE ; ++i)
toktab->tokthhsh[i].tokthpobj = MCMONINV;
}
/* add a symbol to a hashed symbol table */
void tokthadd(toktdef *toktab1, char *name, int namel,
int typ, int val, int hash)
{
int siz = sizeof(toksh1def) + namel;
toksdef *sym;
tokshdef *symh;
tokthdef *toktab = (tokthdef *)toktab1;
if (toktab->tokthsize < siz)
{
mcmcxdef *mctx = toktab->tokthmem;
/* insufficient space in current pool; add a new pool */
if (toktab->tokthpcnt >= TOKPOOLMAX)
errsig(toktab->tokthsc.tokterr, ERR_MANYSYM);
/* unlock current pool page, and note its final size */
mcmunlck(mctx, toktab->tokthpool[toktab->tokthpcnt]);
toktab->tokthfinal[toktab->tokthpcnt] = toktab->tokthofs;
/* allocate a new pool page, and leave it locked */
toktab->tokthcpool = mcmalo(mctx, (ushort)TOKTHSIZE,
&toktab->tokthpool[++(toktab->tokthpcnt)]);
toktab->tokthsize = TOKTHSIZE;
toktab->tokthofs = 0;
}
symh = (tokshdef *)(toktab->tokthcpool + toktab->tokthofs);
sym = &symh->tokshsc;
/* link into list for this hash value */
OSCPYSTRUCT(symh->tokshnxt, toktab->tokthhsh[hash]);
toktab->tokthhsh[hash].tokthpobj = toktab->tokthpool[toktab->tokthpcnt];
toktab->tokthhsh[hash].tokthpofs = toktab->tokthofs;
/* fill in rest of toksdef */
sym->toksval = val;
sym->tokslen = namel;
sym->tokstyp = typ;
sym->tokshsh = hash;
sym->toksfr = 0;
memcpy(sym->toksnam, name, (size_t)namel);
/* update free pool pointer */
siz = osrndsz(siz);
toktab->tokthofs += siz;
if (siz > toktab->tokthsize) toktab->tokthsize = 0;
else toktab->tokthsize -= siz;
}
/*
* Scan a hash chain, calling a callback for each entry. If the
* callback returns TRUE for any symbol, we stop there, and return TRUE.
* If the callback returns FALSE for a symbol, we keep going. If the
* callback returns FALSE for all symbols, we return FALSE.
*/
static int tokthscan(tokthdef *tab, uint hash,
int (*cb)(void *, toksdef *, mcmon),
void *cbctx)
{
tokshdef *symh;
toksdef *sym;
tokthpdef p;
tokthpdef nxt;
uchar *pg = nullptr;
mcmcxdef *mctx = tab->tokthmem;
mcmon curobj;
/* get first object, and lock its page if there is one */
OSCPYSTRUCT(p, tab->tokthhsh[hash]);
if ((curobj = p.tokthpobj) != MCMONINV)
pg = mcmlck(mctx, curobj);
/* look for a match using the callback */
for ( ; p.tokthpobj != MCMONINV ; OSCPYSTRUCT(p, nxt))
{
symh = (tokshdef *)(pg + p.tokthpofs);
sym = &symh->tokshsc;
OSCPYSTRUCT(nxt, symh->tokshnxt);
/* check for a match; copy to return buffer if found */
if ((*cb)(cbctx, sym, p.tokthpobj))
{
mcmunlck(mctx, p.tokthpobj);
return(TRUE);
}
/* if the next page is different from this one, get new lock */
if (nxt.tokthpobj != curobj && nxt.tokthpobj != MCMONINV)
{
mcmunlck(mctx, curobj);
curobj = nxt.tokthpobj;
pg = mcmlck(mctx, curobj);
}
}
/* unlock last object, if we had a lock at all */
if (curobj != MCMONINV) mcmunlck(mctx, curobj);
return(FALSE);
}
struct tokseadef
{
char *tokseanam;
toksdef tokseasym;
toksdef *toksearet;
mcmcxdef *tokseamctx;
};
typedef struct tokseadef tokseadef;
/* search callback */
static int tokthsea1(void *ctx0, toksdef *sym, mcmon objn)
{
tokseadef *ctx = (tokseadef *)ctx0;
VARUSED(objn);
if (sym->tokslen == ctx->tokseasym.tokslen &&
!memcmp(sym->toksnam, ctx->tokseanam, ctx->tokseasym.tokslen))
{
memcpy(ctx->toksearet, sym,
(size_t)(sizeof(toks1def) + ctx->tokseasym.tokslen));
return(TRUE);
}
else
return(FALSE);
}
/* search a hashed symbol table for a symbol */
int tokthsea(toktdef *tab1, char *name, int namel, int hash, toksdef *ret)
{
tokseadef ctx;
ctx.tokseanam = name;
ctx.tokseasym.tokslen = namel;
ctx.toksearet = ret;
return(tokthscan((tokthdef *)tab1, hash, tokthsea1, &ctx));
}
/* callback for tokthset */
static int tokthset1(void *ctx0, toksdef *sym, mcmon objn)
{
tokseadef *ctx = (tokseadef *)ctx0;
if (sym->tokslen == ctx->tokseasym.tokslen
&& !memcmp(sym->toksnam, ctx->tokseasym.toksnam,
ctx->tokseasym.tokslen))
{
sym->toksval = ctx->tokseasym.toksval;
sym->tokstyp = ctx->tokseasym.tokstyp;
/* touch object, since it's been changed */
mcmtch(ctx->tokseamctx, objn);
return(TRUE);
}
else
return(FALSE);
}
/* update a symbol in a hashed symbol table */
void tokthset(toktdef *tab1, toksdef *newsym)
{
tokseadef ctx;
tokthdef *tab = (tokthdef *)tab1;
OSCPYSTRUCT(ctx.tokseasym, *newsym);
ctx.tokseamctx = tab->tokthmem;
tokthscan((tokthdef *)tab1, newsym->tokshsh, tokthset1, &ctx);
}
/* callback for tokthfind */
static int tokthfind1(void *ctx0, toksdef *sym, mcmon objn)
{
tokseadef *ctx = (tokseadef *)ctx0;
VARUSED(objn);
if (sym->toksval == ctx->tokseasym.toksval
&& sym->tokstyp == ctx->tokseasym.tokstyp)
{
memcpy(ctx->toksearet, sym,
(size_t)(sizeof(toks1def) + sym->tokslen));
return(TRUE);
}
else
return(FALSE);
}
/* find a symbol of a particular type and value */
int tokthfind(toktdef *tab1, int typ, uint val, toksdef *ret)
{
tokseadef ctx;
int i;
ctx.tokseasym.tokstyp = typ;
ctx.tokseasym.toksval = val;
ctx.toksearet = ret;
for (i = 0 ; i < TOKHASHSIZE ; ++i)
{
if (tokthscan((tokthdef *)tab1, i, tokthfind1, &ctx))
return(TRUE);
}
return(FALSE);
}
/* call a callback for each function in a hashed symbol table */
void toktheach(toktdef *tab1,
void (*cb)(void *, toksdef *), void *ctx)
{
tokthdef *tab = (tokthdef *)tab1;
uchar *p;
uint max;
uint ofs;
tokshdef *symh;
toksdef *sym;
uint siz;
uint i;
for (i = 0 ; i <= tab->tokthpcnt ; ++i)
{
/* lock the current page */
p = mcmlck(tab->tokthmem, tab->tokthpool[i]);
ERRBEGIN(tab1->tokterr)
max = (i == tab->tokthpcnt ? tab->tokthofs : tab->tokthfinal[i]);
for (ofs = 0 ; ofs < max ; )
{
/* get this symbol */
symh = (tokshdef *)(p + ofs);
sym = &symh->tokshsc;
/* call the user callback */
(*cb)(ctx, sym);
/* advance to the next symbol on this page */
siz = sizeof(toksh1def) + sym->tokslen;
ofs += osrndsz(siz);
}
ERRCLEAN(tab1->tokterr)
mcmunlck(tab->tokthmem, tab->tokthpool[i]);
ERRENDCLN(tab1->tokterr)
/* done with current page; unlock it */
mcmunlck(tab->tokthmem, tab->tokthpool[i]);
}
}
} // End of namespace TADS2
} // End of namespace TADS
} // End of namespace Glk
|