lua/lstring.c

99 lines
2.6 KiB
C
Raw Normal View History

/*
2002-03-20 21:37:13 +03:00
** $Id: lstring.c,v 1.72 2002/02/08 22:41:09 roberto Exp roberto $
1997-12-09 16:50:08 +03:00
** 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_freeall (lua_State *L) {
lua_assert(G(L)->strt.nuse==0);
luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size, TString *);
}
void luaS_resize (lua_State *L, int newsize) {
2000-03-10 21:37:44 +03:00
TString **newhash = luaM_newvector(L, newsize, TString *);
stringtable *tb = &G(L)->strt;
int i;
for (i=0; i<newsize; i++) newhash[i] = NULL;
/* rehash */
for (i=0; i<tb->size; i++) {
2000-03-10 21:37:44 +03:00
TString *p = tb->hash[i];
while (p) { /* for each node in the list */
TString *next = p->tsv.nexthash; /* save next */
lu_hash h = p->tsv.hash;
2001-01-10 20:41:50 +03:00
int h1 = lmod(h, newsize); /* new position */
2001-08-31 23:46:07 +04:00
lua_assert(cast(int, h%newsize) == lmod(h, newsize));
p->tsv.nexthash = newhash[h1]; /* chain it in new position */
newhash[h1] = p;
p = next;
}
}
luaM_freearray(L, tb->hash, tb->size, TString *);
tb->size = newsize;
tb->hash = newhash;
}
static TString *newlstr (lua_State *L, const char *str, size_t l, lu_hash h) {
2001-08-31 23:46:07 +04:00
TString *ts = cast(TString *, luaM_malloc(L, sizestring(l)));
stringtable *tb;
ts->tsv.nexthash = NULL;
ts->tsv.len = l;
ts->tsv.hash = h;
ts->tsv.marked = 0;
2002-02-09 01:41:09 +03:00
memcpy(ts+1, str, l*sizeof(char));
((char *)(ts+1))[l] = '\0'; /* ending 0 */
tb = &G(L)->strt;
h = lmod(h, tb->size);
ts->tsv.nexthash = tb->hash[h]; /* chain new entry */
tb->hash[h] = ts;
tb->nuse++;
2001-08-31 23:46:07 +04:00
if (tb->nuse > cast(ls_nstr, tb->size) && tb->size <= MAX_INT/2)
luaS_resize(L, tb->size*2); /* too crowded */
return ts;
}
TString *luaS_newlstr (lua_State *L, const char *str, size_t l) {
2000-03-10 21:37:44 +03:00
TString *ts;
2002-01-11 23:23:01 +03:00
lu_hash h = (lu_hash)l; /* seed */
2001-01-10 20:41:50 +03:00
size_t step = (l>>5)+1; /* if string is too long, don't hash all its chars */
size_t l1;
for (l1=l; l1>=step; l1-=step) /* compute hash */
h = h ^ ((h<<5)+(h>>2)+(unsigned char)(str[l1-1]));
for (ts = G(L)->strt.hash[lmod(h, G(L)->strt.size)];
ts != NULL;
ts = ts->tsv.nexthash) {
if (ts->tsv.len == l && (memcmp(str, getstr(ts), l) == 0))
return ts;
}
return newlstr(L, str, l, h); /* not found */
1998-03-06 19:54:42 +03:00
}
Udata *luaS_newudata (lua_State *L, size_t s) {
2001-12-05 23:15:18 +03:00
Udata *u;
2002-03-20 21:37:13 +03:00
s = (s+3) & (~(size_t)3); /* make sure size is multiple of 4 */
2001-12-05 23:15:18 +03:00
u = cast(Udata *, luaM_malloc(L, sizeudata(s)));
u->uv.len = s;
2002-01-30 20:26:44 +03:00
u->uv.metatable = hvalue(defaultmeta(L));
u->uv.value = u + 1;
/* chain it on udata list */
u->uv.next = G(L)->rootudata;
G(L)->rootudata = u;
return u;
}