mirror of
https://github.com/lua/lua.git
synced 2024-11-24 18:53:46 +08:00
136 lines
3.6 KiB
C
136 lines
3.6 KiB
C
/*
|
|
** $Id: lstring.c,v 1.42 2000/08/09 19:16:57 roberto Exp roberto $
|
|
** String table (keeps all strings handled by Lua)
|
|
** See Copyright Notice in lua.h
|
|
*/
|
|
|
|
|
|
#include <string.h>
|
|
|
|
#include "lua.h"
|
|
|
|
#include "lmem.h"
|
|
#include "lobject.h"
|
|
#include "lstate.h"
|
|
#include "lstring.h"
|
|
|
|
|
|
|
|
void luaS_init (lua_State *L) {
|
|
L->strt.hash = luaM_newvector(L, 1, TString *);
|
|
L->udt.hash = luaM_newvector(L, 1, TString *);
|
|
L->nblocks += 2*sizeof(TString *);
|
|
L->strt.size = L->udt.size = 1;
|
|
L->strt.nuse = L->udt.nuse = 0;
|
|
L->strt.hash[0] = L->udt.hash[0] = NULL;
|
|
}
|
|
|
|
|
|
void luaS_freeall (lua_State *L) {
|
|
LUA_ASSERT(L->strt.nuse==0, "non-empty string table");
|
|
L->nblocks -= (L->strt.size + L->udt.size)*sizeof(TString *);
|
|
luaM_free(L, L->strt.hash);
|
|
LUA_ASSERT(L->udt.nuse==0, "non-empty udata table");
|
|
luaM_free(L, L->udt.hash);
|
|
}
|
|
|
|
|
|
static unsigned long hash_s (const char *s, size_t l) {
|
|
unsigned long h = l; /* seed */
|
|
size_t step = (l>>5)|1; /* if string is too long, don't hash all its chars */
|
|
for (; l>=step; l-=step)
|
|
h = h ^ ((h<<5)+(h>>2)+(unsigned char)*(s++));
|
|
return h;
|
|
}
|
|
|
|
|
|
void luaS_resize (lua_State *L, stringtable *tb, int newsize) {
|
|
TString **newhash = luaM_newvector(L, newsize, TString *);
|
|
int i;
|
|
for (i=0; i<newsize; i++) newhash[i] = NULL;
|
|
/* rehash */
|
|
for (i=0; i<tb->size; i++) {
|
|
TString *p = tb->hash[i];
|
|
while (p) { /* for each node in the list */
|
|
TString *next = p->nexthash; /* save next */
|
|
unsigned long h = (tb == &L->strt) ? p->u.s.hash : IntPoint(p->u.d.value);
|
|
int h1 = h&(newsize-1); /* new position */
|
|
LUA_ASSERT(h%newsize == (h&(newsize-1)),
|
|
"a&(x-1) == a%x, for x power of 2");
|
|
p->nexthash = newhash[h1]; /* chain it in new position */
|
|
newhash[h1] = p;
|
|
p = next;
|
|
}
|
|
}
|
|
luaM_free(L, tb->hash);
|
|
L->nblocks += (newsize - tb->size)*sizeof(TString *);
|
|
tb->size = newsize;
|
|
tb->hash = newhash;
|
|
}
|
|
|
|
|
|
static void newentry (lua_State *L, stringtable *tb, TString *ts, int h) {
|
|
ts->nexthash = tb->hash[h]; /* chain new entry */
|
|
tb->hash[h] = ts;
|
|
tb->nuse++;
|
|
if (tb->nuse > (lint32)tb->size && tb->size < MAX_INT/2) /* too crowded? */
|
|
luaS_resize(L, tb, tb->size*2);
|
|
}
|
|
|
|
|
|
|
|
TString *luaS_newlstr (lua_State *L, const char *str, size_t l) {
|
|
unsigned long h = hash_s(str, l);
|
|
int h1 = h&(L->strt.size-1);
|
|
TString *ts;
|
|
for (ts = L->strt.hash[h1]; ts; ts = ts->nexthash) {
|
|
if (ts->u.s.len == l && (memcmp(str, ts->str, l) == 0))
|
|
return ts;
|
|
}
|
|
/* not found */
|
|
ts = (TString *)luaM_malloc(L, sizestring(l));
|
|
ts->marked = 0;
|
|
ts->nexthash = NULL;
|
|
ts->u.s.len = l;
|
|
ts->u.s.hash = h;
|
|
ts->u.s.constindex = 0;
|
|
memcpy(ts->str, str, l);
|
|
ts->str[l] = 0; /* ending 0 */
|
|
L->nblocks += sizestring(l);
|
|
newentry(L, &L->strt, ts, h1); /* insert it on table */
|
|
return ts;
|
|
}
|
|
|
|
|
|
TString *luaS_createudata (lua_State *L, void *udata, int tag) {
|
|
unsigned long h = IntPoint(udata);
|
|
int h1 = h&(L->udt.size-1);
|
|
TString *ts;
|
|
for (ts = L->udt.hash[h1]; ts; ts = ts->nexthash) {
|
|
if (udata == ts->u.d.value && (tag == ts->u.d.tag || tag == LUA_ANYTAG))
|
|
return ts;
|
|
}
|
|
/* not found */
|
|
ts = luaM_new(L, TString);
|
|
ts->marked = 0;
|
|
ts->nexthash = NULL;
|
|
ts->u.d.value = udata;
|
|
ts->u.d.tag = (tag == LUA_ANYTAG) ? 0 : tag;
|
|
L->nblocks += gcsizeudata;
|
|
newentry(L, &L->udt, ts, h1); /* insert it on table */
|
|
return ts;
|
|
}
|
|
|
|
|
|
TString *luaS_new (lua_State *L, const char *str) {
|
|
return luaS_newlstr(L, str, strlen(str));
|
|
}
|
|
|
|
|
|
TString *luaS_newfixed (lua_State *L, const char *str) {
|
|
TString *ts = luaS_new(L, str);
|
|
if (ts->marked == 0) ts->marked = FIXMARK; /* avoid GC */
|
|
return ts;
|
|
}
|
|
|