1997-09-16 12:25:59 -07:00
|
|
|
/*
|
2003-12-10 04:13:36 -08:00
|
|
|
** $Id: lstring.c,v 1.85 2003/12/09 16:56:11 roberto Exp roberto $
|
1997-12-09 05:50:08 -08:00
|
|
|
** String table (keeps all strings handled by Lua)
|
1997-09-16 12:25:59 -07:00
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
|
2002-12-04 09:38:31 -08:00
|
|
|
#define lstring_c
|
|
|
|
|
2000-06-12 06:52:05 -07:00
|
|
|
#include "lua.h"
|
|
|
|
|
1997-09-16 12:25:59 -07:00
|
|
|
#include "lmem.h"
|
|
|
|
#include "lobject.h"
|
1997-11-19 09:29:23 -08:00
|
|
|
#include "lstate.h"
|
1997-09-16 12:25:59 -07:00
|
|
|
#include "lstring.h"
|
|
|
|
|
|
|
|
|
1997-09-26 08:02:26 -07:00
|
|
|
|
1999-11-22 05:12:07 -08:00
|
|
|
void luaS_freeall (lua_State *L) {
|
2001-01-19 05:20:30 -08:00
|
|
|
lua_assert(G(L)->strt.nuse==0);
|
|
|
|
luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size, TString *);
|
1999-10-04 10:51:04 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-06-06 11:00:19 -07:00
|
|
|
void luaS_resize (lua_State *L, int newsize) {
|
2003-12-04 09:22:42 -08:00
|
|
|
GCObject **newhash;
|
|
|
|
stringtable *tb;
|
1997-09-16 12:25:59 -07:00
|
|
|
int i;
|
2003-12-04 09: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;
|
1999-11-26 10:59:20 -08:00
|
|
|
for (i=0; i<newsize; i++) newhash[i] = NULL;
|
1997-09-16 12:25:59 -07:00
|
|
|
/* rehash */
|
|
|
|
for (i=0; i<tb->size; i++) {
|
2002-08-30 12:09:21 -07:00
|
|
|
GCObject *p = tb->hash[i];
|
1999-10-11 09:13:42 -07:00
|
|
|
while (p) { /* for each node in the list */
|
2002-08-30 12:09:21 -07:00
|
|
|
GCObject *next = p->gch.next; /* save next */
|
2003-12-10 04:13:36 -08:00
|
|
|
unsigned int h = gco2ts(p)->hash;
|
2001-01-10 09:41:50 -08:00
|
|
|
int h1 = lmod(h, newsize); /* new position */
|
2001-08-31 12:46:07 -07:00
|
|
|
lua_assert(cast(int, h%newsize) == lmod(h, newsize));
|
2002-08-30 12:09:21 -07:00
|
|
|
p->gch.next = newhash[h1]; /* chain it */
|
2000-05-08 12:32:53 -07:00
|
|
|
newhash[h1] = p;
|
1999-10-11 09:13:42 -07:00
|
|
|
p = next;
|
1997-09-16 12:25:59 -07:00
|
|
|
}
|
|
|
|
}
|
2000-12-28 04:55:41 -08:00
|
|
|
luaM_freearray(L, tb->hash, tb->size, TString *);
|
1999-11-26 10:59:20 -08:00
|
|
|
tb->size = newsize;
|
1997-09-16 12:25:59 -07:00
|
|
|
tb->hash = newhash;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-04-28 12:26:16 -07:00
|
|
|
static TString *newlstr (lua_State *L, const char *str, size_t l,
|
|
|
|
unsigned int h) {
|
2001-08-31 12:46:07 -07:00
|
|
|
TString *ts = cast(TString *, luaM_malloc(L, sizestring(l)));
|
2001-06-07 08:01:21 -07:00
|
|
|
stringtable *tb;
|
2001-06-15 13:36:57 -07:00
|
|
|
ts->tsv.len = l;
|
|
|
|
ts->tsv.hash = h;
|
2003-12-03 12:03:07 -08:00
|
|
|
ts->tsv.marked = luaC_white(G(L));
|
2002-08-30 12:09:21 -07:00
|
|
|
ts->tsv.tt = LUA_TSTRING;
|
2002-08-16 07:45:55 -07:00
|
|
|
ts->tsv.reserved = 0;
|
2002-02-08 14:41:09 -08:00
|
|
|
memcpy(ts+1, str, l*sizeof(char));
|
|
|
|
((char *)(ts+1))[l] = '\0'; /* ending 0 */
|
2001-06-07 08:01:21 -07:00
|
|
|
tb = &G(L)->strt;
|
|
|
|
h = lmod(h, tb->size);
|
2002-08-30 12:09:21 -07:00
|
|
|
ts->tsv.next = tb->hash[h]; /* chain new entry */
|
2003-12-10 04:13:36 -08:00
|
|
|
tb->hash[h] = obj2gco(ts);
|
2001-06-07 08:01:21 -07:00
|
|
|
tb->nuse++;
|
2003-04-28 12:26:16 -07:00
|
|
|
if (tb->nuse > cast(lu_int32, tb->size) && tb->size <= MAX_INT/2)
|
2001-06-07 08:01:21 -07:00
|
|
|
luaS_resize(L, tb->size*2); /* too crowded */
|
|
|
|
return ts;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-11-28 12:13:13 -08:00
|
|
|
TString *luaS_newlstr (lua_State *L, const char *str, size_t l) {
|
2002-11-13 03:32:26 -08:00
|
|
|
GCObject *o;
|
2003-04-28 12:26:16 -07:00
|
|
|
unsigned int h = cast(unsigned int, l); /* seed */
|
2001-01-10 09: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 */
|
2001-11-28 12:13:13 -08:00
|
|
|
h = h ^ ((h<<5)+(h>>2)+(unsigned char)(str[l1-1]));
|
2002-11-13 03:32:26 -08:00
|
|
|
for (o = G(L)->strt.hash[lmod(h, G(L)->strt.size)];
|
|
|
|
o != NULL;
|
|
|
|
o = o->gch.next) {
|
2003-12-10 04:13:36 -08:00
|
|
|
TString *ts = rawgco2ts(o);
|
2003-12-09 08: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 03:32:26 -08:00
|
|
|
return ts;
|
2003-12-09 08:56:11 -08:00
|
|
|
}
|
1999-11-04 09:23:12 -08:00
|
|
|
}
|
2001-06-07 08:01:21 -07:00
|
|
|
return newlstr(L, str, l, h); /* not found */
|
1998-03-06 08:54:42 -08:00
|
|
|
}
|
|
|
|
|
1999-02-08 08:28:48 -08:00
|
|
|
|
2001-06-06 11:00:19 -07:00
|
|
|
Udata *luaS_newudata (lua_State *L, size_t s) {
|
2001-12-05 12:15:18 -08:00
|
|
|
Udata *u;
|
|
|
|
u = cast(Udata *, luaM_malloc(L, sizeudata(s)));
|
2003-12-03 12:03:07 -08:00
|
|
|
u->uv.marked = luaC_white(G(L)); /* is not finalized */
|
2002-08-30 12:09:21 -07:00
|
|
|
u->uv.tt = LUA_TUSERDATA;
|
2001-06-15 13:36:57 -07:00
|
|
|
u->uv.len = s;
|
2003-12-01 10:22:56 -08:00
|
|
|
u->uv.metatable = NULL;
|
2001-06-06 11:00:19 -07:00
|
|
|
/* chain it on udata list */
|
2003-12-03 04:30:41 -08:00
|
|
|
u->uv.next = G(L)->firstudata->uv.next;
|
2003-12-10 04:13:36 -08:00
|
|
|
G(L)->firstudata->uv.next = obj2gco(u);
|
2001-06-06 11:00:19 -07:00
|
|
|
return u;
|
1997-09-16 12:25:59 -07:00
|
|
|
}
|
|
|
|
|