1995-08-09 08:06:35 -07:00
|
|
|
/***********************************************************************/
|
|
|
|
/* */
|
1996-04-30 07:53:58 -07:00
|
|
|
/* Objective Caml */
|
1995-08-09 08:06:35 -07:00
|
|
|
/* */
|
|
|
|
/* Xavier Leroy, projet Cristal, INRIA Rocquencourt */
|
|
|
|
/* */
|
1996-04-30 07:53:58 -07:00
|
|
|
/* Copyright 1996 Institut National de Recherche en Informatique et */
|
1995-08-09 08:06:35 -07:00
|
|
|
/* Automatique. Distributed only by permission. */
|
|
|
|
/* */
|
|
|
|
/***********************************************************************/
|
|
|
|
|
1995-08-09 08:25:52 -07:00
|
|
|
/* Based on public-domain code from Berkeley Yacc */
|
|
|
|
|
1995-08-09 08:06:35 -07:00
|
|
|
/* $Id$ */
|
|
|
|
|
1995-08-08 09:44:29 -07:00
|
|
|
#include <string.h>
|
1995-05-04 03:15:53 -07:00
|
|
|
#include "defs.h"
|
|
|
|
|
|
|
|
|
|
|
|
bucket **symbol_table;
|
|
|
|
bucket *first_symbol;
|
|
|
|
bucket *last_symbol;
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
hash(name)
|
1995-08-08 09:44:29 -07:00
|
|
|
char *name;
|
1995-05-04 03:15:53 -07:00
|
|
|
{
|
|
|
|
register char *s;
|
|
|
|
register int c, k;
|
|
|
|
|
|
|
|
assert(name && *name);
|
|
|
|
s = name;
|
|
|
|
k = *s;
|
1995-08-08 09:44:29 -07:00
|
|
|
while ((c = *++s))
|
1995-05-04 03:15:53 -07:00
|
|
|
k = (31*k + c) & (TABLE_SIZE - 1);
|
|
|
|
|
|
|
|
return (k);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bucket *
|
|
|
|
make_bucket(name)
|
1995-08-08 09:44:29 -07:00
|
|
|
char *name;
|
1995-05-04 03:15:53 -07:00
|
|
|
{
|
|
|
|
register bucket *bp;
|
|
|
|
|
|
|
|
assert(name);
|
|
|
|
bp = (bucket *) MALLOC(sizeof(bucket));
|
|
|
|
if (bp == 0) no_space();
|
|
|
|
bp->link = 0;
|
|
|
|
bp->next = 0;
|
|
|
|
bp->name = MALLOC(strlen(name) + 1);
|
|
|
|
if (bp->name == 0) no_space();
|
|
|
|
bp->tag = 0;
|
|
|
|
bp->value = UNDEFINED;
|
|
|
|
bp->index = 0;
|
|
|
|
bp->prec = 0;
|
|
|
|
bp-> class = UNKNOWN;
|
|
|
|
bp->assoc = TOKEN;
|
|
|
|
bp->entry = 0;
|
|
|
|
bp->true_token = 0;
|
|
|
|
|
|
|
|
if (bp->name == 0) no_space();
|
|
|
|
strcpy(bp->name, name);
|
|
|
|
|
|
|
|
return (bp);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bucket *
|
|
|
|
lookup(name)
|
1995-08-08 09:44:29 -07:00
|
|
|
char *name;
|
1995-05-04 03:15:53 -07:00
|
|
|
{
|
|
|
|
register 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);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1995-08-08 09:44:29 -07:00
|
|
|
void create_symbol_table()
|
1995-05-04 03:15:53 -07:00
|
|
|
{
|
|
|
|
register int i;
|
|
|
|
register bucket *bp;
|
|
|
|
|
|
|
|
symbol_table = (bucket **) MALLOC(TABLE_SIZE*sizeof(bucket *));
|
|
|
|
if (symbol_table == 0) no_space();
|
|
|
|
for (i = 0; i < TABLE_SIZE; i++)
|
|
|
|
symbol_table[i] = 0;
|
|
|
|
|
|
|
|
bp = make_bucket("error");
|
|
|
|
bp->index = 1;
|
|
|
|
bp->class = TERM;
|
|
|
|
|
|
|
|
first_symbol = bp;
|
|
|
|
last_symbol = bp;
|
|
|
|
symbol_table[hash("error")] = bp;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1995-08-08 09:44:29 -07:00
|
|
|
void free_symbol_table()
|
1995-05-04 03:15:53 -07:00
|
|
|
{
|
|
|
|
FREE(symbol_table);
|
|
|
|
symbol_table = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1995-08-08 09:44:29 -07:00
|
|
|
void free_symbols()
|
1995-05-04 03:15:53 -07:00
|
|
|
{
|
|
|
|
register bucket *p, *q;
|
|
|
|
|
|
|
|
for (p = first_symbol; p; p = q)
|
|
|
|
{
|
|
|
|
q = p->next;
|
|
|
|
FREE(p);
|
|
|
|
}
|
|
|
|
}
|