mirror of
https://github.com/luau-lang/luau.git
synced 2024-12-14 14:11:08 +00:00
46110524ef
Co-authored-by: Rodactor <rodactor@roblox.com>
237 lines
6.4 KiB
C++
237 lines
6.4 KiB
C++
// This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
|
|
// This code is based on Lua 5.x implementation licensed under MIT License; see lua_LICENSE.txt for details
|
|
#include "lstring.h"
|
|
|
|
#include "lgc.h"
|
|
#include "lmem.h"
|
|
|
|
#include <string.h>
|
|
|
|
unsigned int luaS_hash(const char* str, size_t len)
|
|
{
|
|
// Note that this hashing algorithm is replicated in BytecodeBuilder.cpp, BytecodeBuilder::getStringHash
|
|
unsigned int a = 0, b = 0;
|
|
unsigned int h = unsigned(len);
|
|
|
|
// hash prefix in 12b chunks (using aligned reads) with ARX based hash (LuaJIT v2.1, lookup3)
|
|
// note that we stop at length<32 to maintain compatibility with Lua 5.1
|
|
while (len >= 32)
|
|
{
|
|
#define rol(x, s) ((x >> s) | (x << (32 - s)))
|
|
#define mix(u, v, w) a ^= h, a -= rol(h, u), b ^= a, b -= rol(a, v), h ^= b, h -= rol(b, w)
|
|
|
|
// should compile into fast unaligned reads
|
|
uint32_t block[3];
|
|
memcpy(block, str, 12);
|
|
|
|
a += block[0];
|
|
b += block[1];
|
|
h += block[2];
|
|
mix(14, 11, 25);
|
|
str += 12;
|
|
len -= 12;
|
|
|
|
#undef mix
|
|
#undef rol
|
|
}
|
|
|
|
// original Lua 5.1 hash for compatibility (exact match when len<32)
|
|
for (size_t i = len; i > 0; --i)
|
|
h ^= (h << 5) + (h >> 2) + (uint8_t)str[i - 1];
|
|
|
|
return h;
|
|
}
|
|
|
|
void luaS_resize(lua_State* L, int newsize)
|
|
{
|
|
GCObject** newhash;
|
|
stringtable* tb;
|
|
int i;
|
|
if (L->global->gcstate == GCSsweepstring)
|
|
return; /* cannot resize during GC traverse */
|
|
newhash = luaM_newarray(L, newsize, GCObject*, 0);
|
|
tb = &L->global->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;
|
|
int h1 = lmod(h, newsize); /* new position */
|
|
LUAU_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*, 0);
|
|
tb->size = newsize;
|
|
tb->hash = newhash;
|
|
}
|
|
|
|
static TString* newlstr(lua_State* L, const char* str, size_t l, unsigned int h)
|
|
{
|
|
TString* ts;
|
|
stringtable* tb;
|
|
if (l > MAXSSIZE)
|
|
luaM_toobig(L);
|
|
ts = luaM_new(L, TString, sizestring(l), L->activememcat);
|
|
ts->len = unsigned(l);
|
|
ts->hash = h;
|
|
ts->marked = luaC_white(L->global);
|
|
ts->tt = LUA_TSTRING;
|
|
ts->memcat = L->activememcat;
|
|
memcpy(ts->data, str, l);
|
|
ts->data[l] = '\0'; /* ending 0 */
|
|
ts->atom = L->global->cb.useratom ? L->global->cb.useratom(ts->data, l) : -1;
|
|
tb = &L->global->strt;
|
|
h = lmod(h, tb->size);
|
|
ts->next = tb->hash[h]; /* chain new entry */
|
|
tb->hash[h] = obj2gco(ts);
|
|
tb->nuse++;
|
|
if (tb->nuse > cast_to(uint32_t, tb->size) && tb->size <= INT_MAX / 2)
|
|
luaS_resize(L, tb->size * 2); /* too crowded */
|
|
return ts;
|
|
}
|
|
|
|
static void linkstrbuf(lua_State* L, TString* ts)
|
|
{
|
|
global_State* g = L->global;
|
|
GCObject* o = obj2gco(ts);
|
|
o->gch.next = g->strbufgc;
|
|
g->strbufgc = o;
|
|
o->gch.marked = luaC_white(g);
|
|
}
|
|
|
|
static void unlinkstrbuf(lua_State* L, TString* ts)
|
|
{
|
|
global_State* g = L->global;
|
|
|
|
GCObject** p = &g->strbufgc;
|
|
|
|
while (GCObject* curr = *p)
|
|
{
|
|
if (curr == obj2gco(ts))
|
|
{
|
|
*p = curr->gch.next;
|
|
return;
|
|
}
|
|
else
|
|
{
|
|
p = &curr->gch.next;
|
|
}
|
|
}
|
|
|
|
LUAU_ASSERT(!"failed to find string buffer");
|
|
}
|
|
|
|
TString* luaS_bufstart(lua_State* L, size_t size)
|
|
{
|
|
if (size > MAXSSIZE)
|
|
luaM_toobig(L);
|
|
|
|
TString* ts = luaM_new(L, TString, sizestring(size), L->activememcat);
|
|
|
|
ts->tt = LUA_TSTRING;
|
|
ts->memcat = L->activememcat;
|
|
linkstrbuf(L, ts);
|
|
|
|
ts->len = unsigned(size);
|
|
|
|
return ts;
|
|
}
|
|
|
|
TString* luaS_buffinish(lua_State* L, TString* ts)
|
|
{
|
|
unsigned int h = luaS_hash(ts->data, ts->len);
|
|
stringtable* tb = &L->global->strt;
|
|
int bucket = lmod(h, tb->size);
|
|
|
|
// search if we already have this string in the hash table
|
|
for (GCObject* o = tb->hash[bucket]; o != NULL; o = o->gch.next)
|
|
{
|
|
TString* el = gco2ts(o);
|
|
|
|
if (el->len == ts->len && memcmp(el->data, ts->data, ts->len) == 0)
|
|
{
|
|
// string may be dead
|
|
if (isdead(L->global, o))
|
|
changewhite(o);
|
|
|
|
return el;
|
|
}
|
|
}
|
|
|
|
unlinkstrbuf(L, ts);
|
|
|
|
ts->hash = h;
|
|
ts->data[ts->len] = '\0'; // ending 0
|
|
|
|
// Complete string object
|
|
ts->atom = L->global->cb.useratom ? L->global->cb.useratom(ts->data, ts->len) : -1;
|
|
ts->next = tb->hash[bucket]; // chain new entry
|
|
tb->hash[bucket] = obj2gco(ts);
|
|
|
|
tb->nuse++;
|
|
if (tb->nuse > cast_to(uint32_t, tb->size) && tb->size <= INT_MAX / 2)
|
|
luaS_resize(L, tb->size * 2); // too crowded
|
|
|
|
return ts;
|
|
}
|
|
|
|
TString* luaS_newlstr(lua_State* L, const char* str, size_t l)
|
|
{
|
|
GCObject* o;
|
|
unsigned int h = luaS_hash(str, l);
|
|
for (o = L->global->strt.hash[lmod(h, L->global->strt.size)]; o != NULL; o = o->gch.next)
|
|
{
|
|
TString* ts = gco2ts(o);
|
|
if (ts->len == l && (memcmp(str, getstr(ts), l) == 0))
|
|
{
|
|
/* string may be dead */
|
|
if (isdead(L->global, o))
|
|
changewhite(o);
|
|
return ts;
|
|
}
|
|
}
|
|
return newlstr(L, str, l, h); /* not found */
|
|
}
|
|
|
|
void luaS_free(lua_State* L, TString* ts)
|
|
{
|
|
L->global->strt.nuse--;
|
|
luaM_free(L, ts, sizestring(ts->len), ts->memcat);
|
|
}
|
|
|
|
Udata* luaS_newudata(lua_State* L, size_t s, int tag)
|
|
{
|
|
if (s > INT_MAX - sizeof(Udata))
|
|
luaM_toobig(L);
|
|
Udata* u = luaM_new(L, Udata, sizeudata(s), L->activememcat);
|
|
luaC_link(L, u, LUA_TUSERDATA);
|
|
u->len = int(s);
|
|
u->metatable = NULL;
|
|
LUAU_ASSERT(tag >= 0 && tag <= 255);
|
|
u->tag = uint8_t(tag);
|
|
return u;
|
|
}
|
|
|
|
void luaS_freeudata(lua_State* L, Udata* u)
|
|
{
|
|
LUAU_ASSERT(u->tag < LUA_UTAG_LIMIT || u->tag == UTAG_IDTOR);
|
|
|
|
void (*dtor)(void*) = nullptr;
|
|
if (u->tag == UTAG_IDTOR)
|
|
memcpy(&dtor, u->data + u->len - sizeof(dtor), sizeof(dtor));
|
|
else if (u->tag)
|
|
dtor = L->global->udatagc[u->tag];
|
|
|
|
if (dtor)
|
|
dtor(u->data);
|
|
|
|
luaM_free(L, u, sizeudata(u->len), u->memcat);
|
|
}
|