1997-09-16 23:25:59 +04:00
|
|
|
/*
|
1999-10-19 17:33:22 +04:00
|
|
|
** $Id: lstring.c,v 1.24 1999/10/14 19:13:31 roberto Exp roberto $
|
1997-12-09 16:50:08 +03:00
|
|
|
** String table (keeps all strings handled by Lua)
|
1997-09-16 23:25:59 +04:00
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include "lmem.h"
|
|
|
|
#include "lobject.h"
|
1997-11-19 20:29:23 +03:00
|
|
|
#include "lstate.h"
|
1997-09-16 23:25:59 +04:00
|
|
|
#include "lstring.h"
|
|
|
|
#include "lua.h"
|
|
|
|
|
|
|
|
|
1997-09-26 19:02:26 +04:00
|
|
|
|
1997-12-09 16:50:08 +03:00
|
|
|
#define gcsizestring(l) (1+(l/64)) /* "weight" for a string with length 'l' */
|
1997-10-23 20:26:37 +04:00
|
|
|
|
|
|
|
|
1997-09-16 23:25:59 +04:00
|
|
|
|
1999-09-28 16:27:06 +04:00
|
|
|
/*
|
|
|
|
** to avoid hash tables with size = 0 (cannot hash with size=0), all
|
|
|
|
** hash tables are initialized with this `array'. Elements are never
|
|
|
|
** written here, because this table (with size=1) must grow to get an
|
|
|
|
** element, and before it grows we replace it for a `real' table.
|
|
|
|
**
|
|
|
|
*/
|
|
|
|
static TaggedString *init_hash[1] = {NULL};
|
|
|
|
|
|
|
|
|
1999-01-04 16:37:29 +03:00
|
|
|
void luaS_init (void) {
|
1997-11-04 18:27:53 +03:00
|
|
|
int i;
|
1997-11-19 20:29:23 +03:00
|
|
|
L->string_root = luaM_newvector(NUM_HASHS, stringtable);
|
1997-11-04 18:27:53 +03:00
|
|
|
for (i=0; i<NUM_HASHS; i++) {
|
1999-09-28 16:27:06 +04:00
|
|
|
L->string_root[i].size = 1;
|
1997-11-19 20:29:23 +03:00
|
|
|
L->string_root[i].nuse = 0;
|
1999-09-28 16:27:06 +04:00
|
|
|
L->string_root[i].hash = init_hash;
|
1997-11-04 18:27:53 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1997-09-16 23:25:59 +04:00
|
|
|
|
1999-10-04 21:51:04 +04:00
|
|
|
void luaS_freeall (void) {
|
|
|
|
int i;
|
|
|
|
for (i=0; i<NUM_HASHS; i++) {
|
1999-10-11 20:13:42 +04:00
|
|
|
LUA_ASSERT(L->string_root[i].nuse==0, "non-empty string table");
|
1999-10-04 21:51:04 +04:00
|
|
|
if (L->string_root[i].hash != init_hash)
|
|
|
|
luaM_free(L->string_root[i].hash);
|
|
|
|
}
|
|
|
|
luaM_free(L->string_root);
|
1999-10-14 23:13:31 +04:00
|
|
|
LUA_ASSERT(init_hash[0] == NULL, "init_hash corrupted");
|
1999-10-04 21:51:04 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-08-17 00:52:00 +04:00
|
|
|
static unsigned long hash_s (const char *s, long l) {
|
1999-10-11 20:13:42 +04:00
|
|
|
unsigned long h = l; /* seed */
|
1998-03-06 19:54:42 +03:00
|
|
|
while (l--)
|
1998-07-27 21:06:17 +04:00
|
|
|
h = h ^ ((h<<5)+(h>>2)+(unsigned char)*(s++));
|
1997-09-16 23:25:59 +04:00
|
|
|
return h;
|
|
|
|
}
|
|
|
|
|
1999-09-28 16:27:06 +04:00
|
|
|
|
1999-10-14 23:13:31 +04:00
|
|
|
void luaS_grow (stringtable *tb) {
|
|
|
|
int ns = luaO_redimension(tb->nuse*2); /* new size */
|
1998-01-28 19:50:33 +03:00
|
|
|
TaggedString **newhash = luaM_newvector(ns, TaggedString *);
|
1997-09-16 23:25:59 +04:00
|
|
|
int i;
|
1999-10-11 20:13:42 +04:00
|
|
|
for (i=0; i<ns; i++) newhash[i] = NULL;
|
1997-09-16 23:25:59 +04:00
|
|
|
/* rehash */
|
|
|
|
for (i=0; i<tb->size; i++) {
|
1999-10-11 20:13:42 +04:00
|
|
|
TaggedString *p = tb->hash[i];
|
|
|
|
while (p) { /* for each node in the list */
|
|
|
|
TaggedString *next = p->nexthash; /* save next */
|
|
|
|
int h = p->hash%ns; /* new position */
|
|
|
|
p->nexthash = newhash[h]; /* chain it in new position */
|
|
|
|
newhash[h] = p;
|
|
|
|
p = next;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
luaM_free(tb->hash);
|
1998-01-28 19:50:33 +03:00
|
|
|
tb->size = ns;
|
1997-09-16 23:25:59 +04:00
|
|
|
tb->hash = newhash;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-11 20:13:42 +04:00
|
|
|
static TaggedString *newone (long l, unsigned long h) {
|
|
|
|
TaggedString *ts = (TaggedString *)luaM_malloc(
|
|
|
|
sizeof(TaggedString)+l*sizeof(char));
|
|
|
|
ts->marked = 0;
|
|
|
|
ts->nexthash = NULL;
|
|
|
|
ts->nextglobal = ts; /* signal it is not in global list */
|
|
|
|
ts->hash = h;
|
|
|
|
return ts;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-08-17 00:52:00 +04:00
|
|
|
static TaggedString *newone_s (const char *str, long l, unsigned long h) {
|
1999-10-11 20:13:42 +04:00
|
|
|
TaggedString *ts = newone(l, h);
|
1998-03-06 19:54:42 +03:00
|
|
|
memcpy(ts->str, str, l);
|
|
|
|
ts->str[l] = 0; /* ending 0 */
|
|
|
|
ts->u.s.globalval.ttype = LUA_T_NIL; /* initialize global value */
|
|
|
|
ts->u.s.len = l;
|
|
|
|
ts->constindex = 0;
|
|
|
|
L->nblocks += gcsizestring(l);
|
1997-09-16 23:25:59 +04:00
|
|
|
return ts;
|
|
|
|
}
|
|
|
|
|
1999-10-11 20:13:42 +04:00
|
|
|
|
1999-08-17 00:52:00 +04:00
|
|
|
static TaggedString *newone_u (void *buff, int tag, unsigned long h) {
|
1999-10-11 20:13:42 +04:00
|
|
|
TaggedString *ts = newone(0, h);
|
1998-03-06 19:54:42 +03:00
|
|
|
ts->u.d.v = buff;
|
|
|
|
ts->u.d.tag = (tag == LUA_ANYTAG) ? 0 : tag;
|
|
|
|
ts->constindex = -1; /* tag -> this is a userdata */
|
|
|
|
L->nblocks++;
|
|
|
|
return ts;
|
|
|
|
}
|
|
|
|
|
1999-09-28 16:27:06 +04:00
|
|
|
|
1999-10-11 20:13:42 +04:00
|
|
|
static void newentry (stringtable *tb, TaggedString *ts, int h) {
|
1999-09-28 16:27:06 +04:00
|
|
|
tb->nuse++;
|
1999-10-11 20:13:42 +04:00
|
|
|
if (tb->nuse >= tb->size) { /* no more room? */
|
1999-09-28 16:27:06 +04:00
|
|
|
if (tb->hash == init_hash) { /* cannot change init_hash */
|
1999-10-11 20:13:42 +04:00
|
|
|
LUA_ASSERT(h==0, "`init_hash' has size 1");
|
1999-09-28 16:27:06 +04:00
|
|
|
tb->hash = luaM_newvector(1, TaggedString *); /* so, `clone' it */
|
1999-10-11 20:13:42 +04:00
|
|
|
tb->hash[0] = NULL;
|
1999-09-28 16:27:06 +04:00
|
|
|
}
|
1999-10-14 23:13:31 +04:00
|
|
|
luaS_grow(tb);
|
1999-10-11 20:13:42 +04:00
|
|
|
h = ts->hash%tb->size; /* new hash position */
|
1999-09-28 16:27:06 +04:00
|
|
|
}
|
1999-10-11 20:13:42 +04:00
|
|
|
ts->nexthash = tb->hash[h]; /* chain new entry */
|
|
|
|
tb->hash[h] = ts;
|
1999-09-28 16:27:06 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-11 20:13:42 +04:00
|
|
|
static TaggedString *insert_s (const char *str, long l,
|
|
|
|
stringtable *tb, unsigned long h) {
|
|
|
|
int h1 = h%tb->size;
|
1998-03-06 19:54:42 +03:00
|
|
|
TaggedString *ts;
|
1999-10-11 20:13:42 +04:00
|
|
|
for (ts = tb->hash[h1]; ts; ts = ts->nexthash)
|
|
|
|
if (ts->u.s.len == l && (memcmp(str, ts->str, l) == 0))
|
1999-02-08 19:28:48 +03:00
|
|
|
return ts;
|
1998-03-06 19:54:42 +03:00
|
|
|
/* not found */
|
1999-09-28 16:27:06 +04:00
|
|
|
ts = newone_s(str, l, h); /* create new entry */
|
1999-10-11 20:13:42 +04:00
|
|
|
newentry(tb, ts, h1); /* insert it on table */
|
1998-03-06 19:54:42 +03:00
|
|
|
return ts;
|
|
|
|
}
|
|
|
|
|
1999-02-08 19:28:48 +03:00
|
|
|
|
1999-01-04 16:37:29 +03:00
|
|
|
static TaggedString *insert_u (void *buff, int tag, stringtable *tb) {
|
1999-10-19 17:33:22 +04:00
|
|
|
unsigned long h = (IntPoint)buff;
|
1999-10-11 20:13:42 +04:00
|
|
|
int h1 = h%tb->size;
|
|
|
|
TaggedString *ts;
|
|
|
|
for (ts = tb->hash[h1]; ts; ts = ts->nexthash)
|
|
|
|
if ((tag == ts->u.d.tag || tag == LUA_ANYTAG) && buff == ts->u.d.v)
|
1999-02-08 19:28:48 +03:00
|
|
|
return ts;
|
1999-10-11 20:13:42 +04:00
|
|
|
/* not found */
|
1999-09-28 16:27:06 +04:00
|
|
|
ts = newone_u(buff, tag, h);
|
1999-10-11 20:13:42 +04:00
|
|
|
newentry(tb, ts, h1);
|
1997-09-16 23:25:59 +04:00
|
|
|
return ts;
|
|
|
|
}
|
|
|
|
|
1999-01-25 20:38:04 +03:00
|
|
|
|
1999-01-04 16:37:29 +03:00
|
|
|
TaggedString *luaS_createudata (void *udata, int tag) {
|
1999-10-19 17:33:22 +04:00
|
|
|
int t = ((IntPoint)udata%NUM_HASHUDATA)+NUM_HASHSTR;
|
1999-02-08 19:28:48 +03:00
|
|
|
return insert_u(udata, tag, &L->string_root[t]);
|
1998-03-06 19:54:42 +03:00
|
|
|
}
|
|
|
|
|
1999-08-17 00:52:00 +04:00
|
|
|
TaggedString *luaS_newlstr (const char *str, long l) {
|
1999-10-11 20:13:42 +04:00
|
|
|
unsigned long h = hash_s(str, l);
|
|
|
|
return insert_s(str, l, &L->string_root[h%NUM_HASHSTR], h);
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
1999-08-17 00:52:00 +04:00
|
|
|
TaggedString *luaS_new (const char *str) {
|
1998-03-06 19:54:42 +03:00
|
|
|
return luaS_newlstr(str, strlen(str));
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
1999-08-17 00:52:00 +04:00
|
|
|
TaggedString *luaS_newfixedstring (const char *str) {
|
1997-09-16 23:25:59 +04:00
|
|
|
TaggedString *ts = luaS_new(str);
|
1999-10-11 20:13:42 +04:00
|
|
|
if (ts->marked == 0) ts->marked = FIXMARK; /* avoid GC */
|
1997-09-16 23:25:59 +04:00
|
|
|
return ts;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-04 21:51:04 +04:00
|
|
|
void luaS_free (TaggedString *t) {
|
|
|
|
L->nblocks -= (t->constindex == -1) ? 1 : gcsizestring(t->u.s.len);
|
|
|
|
luaM_free(t);
|
1997-12-01 23:31:25 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-04 21:51:04 +04:00
|
|
|
void luaS_rawsetglobal (TaggedString *ts, const TObject *newval) {
|
1998-03-06 19:54:42 +03:00
|
|
|
ts->u.s.globalval = *newval;
|
1999-10-11 20:13:42 +04:00
|
|
|
if (ts->nextglobal == ts) { /* is not in list? */
|
|
|
|
ts->nextglobal = L->rootglobal;
|
1999-10-04 21:51:04 +04:00
|
|
|
L->rootglobal = ts;
|
1997-09-26 19:02:26 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-08-17 00:52:00 +04:00
|
|
|
int luaS_globaldefined (const char *name) {
|
1997-09-26 19:02:26 +04:00
|
|
|
TaggedString *ts = luaS_new(name);
|
1998-03-06 19:54:42 +03:00
|
|
|
return ts->u.s.globalval.ttype != LUA_T_NIL;
|
1997-09-26 19:02:26 +04:00
|
|
|
}
|
|
|
|
|
1999-10-04 21:51:04 +04:00
|
|
|
|