mirror of
https://github.com/lua/lua
synced 2024-11-27 07:09:36 +03:00
147 lines
2.7 KiB
C
147 lines
2.7 KiB
C
/*
|
|
** tree.c
|
|
** TecCGraf - PUC-Rio
|
|
*/
|
|
|
|
char *rcs_tree="$Id: tree.c,v 1.17 1996/02/14 13:35:51 roberto Exp roberto $";
|
|
|
|
|
|
#include <string.h>
|
|
|
|
#include "mem.h"
|
|
#include "lua.h"
|
|
#include "tree.h"
|
|
#include "lex.h"
|
|
#include "hash.h"
|
|
#include "table.h"
|
|
|
|
|
|
#define NUM_HASHS 64
|
|
|
|
typedef struct {
|
|
int size;
|
|
int nuse; /* number of elements (including EMPTYs) */
|
|
TaggedString **hash;
|
|
} stringtable;
|
|
|
|
static int initialized = 0;
|
|
|
|
static stringtable string_root[NUM_HASHS];
|
|
|
|
static TaggedString EMPTY = {NOT_USED, NOT_USED, 0, 2, {0}};
|
|
|
|
|
|
static unsigned long hash (char *str)
|
|
{
|
|
unsigned long h = 0;
|
|
while (*str)
|
|
h = ((h<<5)-h)^(unsigned char)*(str++);
|
|
return h;
|
|
}
|
|
|
|
static void initialize (void)
|
|
{
|
|
initialized = 1;
|
|
luaI_addReserved();
|
|
luaI_initsymbol();
|
|
luaI_initconstant();
|
|
}
|
|
|
|
|
|
static void grow (stringtable *tb)
|
|
{
|
|
int newsize = luaI_redimension(tb->size);
|
|
TaggedString **newhash = newvector(newsize, TaggedString *);
|
|
int i;
|
|
for (i=0; i<newsize; i++)
|
|
newhash[i] = NULL;
|
|
if (tb->size > 0)
|
|
{ /* rehash */
|
|
tb->nuse = 0;
|
|
for (i=0; i<tb->size; i++)
|
|
if (tb->hash[i] != NULL && tb->hash[i] != &EMPTY)
|
|
{
|
|
int h = tb->hash[i]->hash%newsize;
|
|
while (newhash[h])
|
|
h = (h+1)%newsize;
|
|
newhash[h] = tb->hash[i];
|
|
tb->nuse++;
|
|
}
|
|
luaI_free(tb->hash);
|
|
}
|
|
tb->size = newsize;
|
|
tb->hash = newhash;
|
|
}
|
|
|
|
static TaggedString *insert (char *str, stringtable *tb)
|
|
{
|
|
TaggedString *ts;
|
|
unsigned long h = hash(str);
|
|
int i;
|
|
int j = -1;
|
|
if ((Long)tb->nuse*3 >= (Long)tb->size*2)
|
|
{
|
|
if (!initialized)
|
|
initialize();
|
|
grow(tb);
|
|
}
|
|
i = h%tb->size;
|
|
while (tb->hash[i])
|
|
{
|
|
if (tb->hash[i] == &EMPTY)
|
|
j = i;
|
|
else if (strcmp(str, tb->hash[i]->str) == 0)
|
|
return tb->hash[i];
|
|
i = (i+1)%tb->size;
|
|
}
|
|
/* not found */
|
|
if (j != -1) /* is there an EMPTY space? */
|
|
i = j;
|
|
else
|
|
tb->nuse++;
|
|
ts = tb->hash[i] = (TaggedString *)luaI_malloc(sizeof(TaggedString)+strlen(str));
|
|
strcpy(ts->str, str);
|
|
ts->marked = 0;
|
|
ts->hash = h;
|
|
ts->varindex = ts->constindex = NOT_USED;
|
|
return ts;
|
|
}
|
|
|
|
TaggedString *lua_createstring (char *str)
|
|
{
|
|
return insert(str, &string_root[(unsigned)str[0]%NUM_HASHS]);
|
|
}
|
|
|
|
|
|
/*
|
|
** Garbage collection function.
|
|
** This function traverse the string list freeing unindexed strings
|
|
*/
|
|
Long lua_strcollector (void)
|
|
{
|
|
Long counter = 0;
|
|
int i;
|
|
for (i=0; i<NUM_HASHS; i++)
|
|
{
|
|
stringtable *tb = &string_root[i];
|
|
int j;
|
|
for (j=0; j<tb->size; j++)
|
|
{
|
|
TaggedString *t = tb->hash[j];
|
|
if (t != NULL && t->marked <= 1)
|
|
{
|
|
if (t->marked)
|
|
t->marked = 0;
|
|
else
|
|
{
|
|
luaI_free(t);
|
|
tb->hash[j] = &EMPTY;
|
|
counter++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return counter;
|
|
}
|
|
|