lua/lstring.c

111 lines
3.0 KiB
C
Raw Normal View History

/*
** $Id: lstring.c,v 2.1 2003/12/10 12:13:36 roberto Exp roberto $
1997-12-09 21:50:08 +08:00
** String table (keeps all strings handled by Lua)
** See Copyright Notice in lua.h
*/
#include <string.h>
2002-12-05 01:38:31 +08:00
#define lstring_c
#define LUA_CORE
2002-12-05 01:38:31 +08:00
#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) {
2003-12-05 01:22:42 +08:00
GCObject **newhash;
stringtable *tb;
int i;
2003-12-05 01:22:42 +08:00
if (G(L)->sweepstrgc > 0) return; /* cannot resize during GC traverse */
newhash = luaM_newvector(L, newsize, GCObject *);
tb = &G(L)->strt;
for (i=0; i<newsize; i++) newhash[i] = NULL;
/* rehash */
for (i=0; i<tb->size; i++) {
GCObject *p = tb->hash[i];
while (p) { /* for each node in the list */
GCObject *next = p->gch.next; /* save next */
unsigned int h = gco2ts(p)->hash;
2001-01-11 01:41:50 +08:00
int h1 = lmod(h, newsize); /* new position */
2001-09-01 03:46:07 +08:00
lua_assert(cast(int, h%newsize) == lmod(h, newsize));
p->gch.next = newhash[h1]; /* chain it */
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,
unsigned int h) {
2001-09-01 03:46:07 +08:00
TString *ts = cast(TString *, luaM_malloc(L, sizestring(l)));
stringtable *tb;
ts->tsv.len = l;
ts->tsv.hash = h;
ts->tsv.marked = luaC_white(G(L));
ts->tsv.tt = LUA_TSTRING;
ts->tsv.reserved = 0;
2002-02-09 06:41:09 +08: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.next = tb->hash[h]; /* chain new entry */
tb->hash[h] = obj2gco(ts);
tb->nuse++;
if (tb->nuse > cast(lu_int32, 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) {
2002-11-13 19:32:26 +08:00
GCObject *o;
unsigned int h = cast(unsigned int, l); /* seed */
2001-01-11 01:41:50 +08: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]));
2002-11-13 19:32:26 +08:00
for (o = G(L)->strt.hash[lmod(h, G(L)->strt.size)];
o != NULL;
o = o->gch.next) {
TString *ts = rawgco2ts(o);
2003-12-10 00:56:11 +08:00
if (ts->tsv.len == l && (memcmp(str, getstr(ts), l) == 0)) {
/* string may be dead */
if (isdead(G(L), o)) changewhite(o);
2002-11-13 19:32:26 +08:00
return ts;
2003-12-10 00:56:11 +08:00
}
}
return newlstr(L, str, l, h); /* not found */
1998-03-07 00:54:42 +08:00
}
Udata *luaS_newudata (lua_State *L, size_t s) {
2001-12-06 04:15:18 +08:00
Udata *u;
u = cast(Udata *, luaM_malloc(L, sizeudata(s)));
u->uv.marked = luaC_white(G(L)); /* is not finalized */
u->uv.tt = LUA_TUSERDATA;
u->uv.len = s;
2003-12-02 02:22:56 +08:00
u->uv.metatable = NULL;
/* chain it on udata list */
u->uv.next = G(L)->firstudata->uv.next;
G(L)->firstudata->uv.next = obj2gco(u);
return u;
}