static void DumpVector(const void* b, int n, size_t size, DumpState* D)
{
DumpInt(n,D);
if (D->status==0)
{
lua_unlock(D->L);
if (D->swap)
{
char* origSwapBuffer=luaZ_openspace(D->L,&D->b,n*size);
char* swapBuffer = origSwapBuffer;
char* q=(char*) b;
int orign = n;
while (n--)
{
char* p =(char*) q+size-1;
while (p >= q)
*swapBuffer++ = *p--;
q+=size;
}
D->status=(*D->writer)(D->L,origSwapBuffer,orign*size,D->data);
}
else
{
D->status=(*D->writer)(D->L,b,n*size,D->data);
}
lua_lock(D->L);
}
}
void luaV_concat (lua_State *L, int total, int last) {
do {
StkId top = L->base + last + 1;
int n = 2; /* number of elements handled in this pass (at least 2) */
if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {
if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
luaG_concaterror(L, top-2, top-1);
} else if (tsvalue(top-1)->len == 0) /* second op is empty? */
(void)tostring(L, top - 2); /* result is first op (as string) */
else {
/* at least two string values; get as many as possible */
size_t tl = tsvalue(top-1)->len;
char *buffer;
int i;
/* collect total length */
for (n = 1; n < total && tostring(L, top-n-1); n++) {
size_t l = tsvalue(top-n-1)->len;
if (l >= MAX_SIZET - tl) luaG_runerror(L, "string length overflow");
tl += l;
}
buffer = luaZ_openspace(L, &G(L)->buff, tl);
tl = 0;
for (i=n; i>0; i--) { /* concat all strings */
size_t l = tsvalue(top-i)->len;
memcpy(buffer+tl, svalue(top-i), l);
tl += l;
}
setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));
}
total -= n-1; /* got `n' strings to create 1 new */
last -= n-1;
} while (total > 1); /* repeat until only 1 result left */
}
void luaV_concat (lua_State *L, int total, int last) {
do {
StkId top = L->base + last + 1;
int n = 2; /* number of elements handled in this pass (at least 2) */
if (!tostring(L, top-2) || !tostring(L, top-1)) {
if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
luaG_concaterror(L, top-2, top-1);
} else if (tsvalue(top-1)->tsv.len > 0) { /* if len=0, do nothing */
/* at least two string values; get as many as possible */
lu_mem tl = cast(lu_mem, tsvalue(top-1)->tsv.len) +
cast(lu_mem, tsvalue(top-2)->tsv.len);
char *buffer;
int i;
while (n < total && tostring(L, top-n-1)) { /* collect total length */
tl += tsvalue(top-n-1)->tsv.len;
n++;
}
if (tl > MAX_SIZET) luaG_runerror(L, "string size overflow");
buffer = luaZ_openspace(L, &G(L)->buff, tl);
tl = 0;
for (i=n; i>0; i--) { /* concat all strings */
size_t l = tsvalue(top-i)->tsv.len;
memcpy(buffer+tl, svalue(top-i), l);
tl += l;
}
setsvalue2s(top-n, luaS_newlstr(L, buffer, tl));
}
total -= n-1; /* got `n' strings to create 1 new */
last -= n-1;
} while (total > 1); /* repeat until only 1 result left */
}
static TString* LoadString (LoadState* S)
{
size_t size=LoadSize(S);
if (size==0)
return NULL;
else
{
char* s=luaZ_openspace(S->L,S->b,size);
ezread(S,s,size);
return luaS_newlstr(S->L,s,size-1); /* remove trailing '\0' */
}
}
static TString* LoadWString (LoadState* S)
{
size_t size=LoadSize(S);
if (size==0)
return NULL;
else
{
lua_WChar* s=(lua_WChar *)luaZ_openspace(S->L,S->b,size*2);
ezread(S,s,size*2);
return luaS_newlwstr(S->L,(const lua_WChar*)s,size-1); /* remove trailing '\0' */
}
}
static TString *LoadString (LoadState *S) {
size_t size = LoadByte(S);
if (size == 0xFF)
LoadVar(S, size);
if (size == 0)
return NULL;
else {
char *s = luaZ_openspace(S->L, S->b, --size);
LoadVector(S, s, size);
return luaS_newlstr(S->L, s, size);
}
}
static TString* LoadString(LoadState* S)
{
size_t size;
LoadVar(S,size);
if (size==0)
return NULL;
else
{
char* s=luaZ_openspace(S->L,S->b,size);
LoadBlock(S,s,size*sizeof(char));
return luaS_newlstr(S->L,s,size-1); /* remove trailing '\0' */
}
}
static TString* LoadWString(LoadState* S)
{
size_t size;
LoadVar(S,size);
if (size==0)
return NULL;
else
{
lua_WChar* s=(lua_WChar*)luaZ_openspace(S->L,S->b,size*2);
LoadVector(S,s,size,2);
return luaS_newlwstr(S->L,s,size-1); /* remove trailing '\0' */
}
}
static TString* LoadString(LoadState* S)
{
size_t size = 0;
if ( sizeof(size_t) <= SIZE_T_PRECOMPILED_CHUNK )
LoadVar(S,size);
else
LoadMem(S,&size,1,SIZE_T_PRECOMPILED_CHUNK);
if (size==0)
return NULL;
else
{
char* s=luaZ_openspace(S->L,S->b,size);
LoadBlock(S,s,size);
return luaS_newlstr(S->L,s,size-1); /* remove trailing '\0' */
}
}
void luaV_concat (lua_State *L, int total, int last) {
lu_mem max_sizet = MAX_SIZET;
if (G(L)->memlimit < max_sizet) max_sizet = G(L)->memlimit;
do {
/* Any call which does a memory allocation may trim the stack,
invalidating top unless the stack is fixed duri ng the allocation */
StkId top = L->base + last + 1;
fixedstack(L);
int n = 2; /* number of elements handled in this pass (at least 2) */
if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {
unfixedstack(L);
if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT)) {
/* restore 'top' pointer, since stack might have been reallocted */
top = L->base + last + 1;
luaG_concaterror(L, top-2, top-1);
}
} else if (tsvalue(top-1)->len == 0) { /* second op is empty? */
(void)tostring(L, top - 2); /* result is first op (as string) */
} else {
/* at least two string values; get as many as possible */
size_t tl = tsvalue(top-1)->len;
char *buffer;
int i;
/* collect total length */
for (n = 1; n < total && tostring(L, top-n-1); n++) {
size_t l = tsvalue(top-n-1)->len;
if (l >= max_sizet - tl) luaG_runerror(L, "string length overflow");
tl += l;
}
G(L)->buff.n = tl;
buffer = luaZ_openspace(L, &G(L)->buff, tl);
tl = 0;
for (i=n; i>0; i--) { /* concat all strings */
size_t l = tsvalue(top-i)->len;
c_memcpy(buffer+tl, svalue(top-i), l);
tl += l;
}
setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));
luaZ_resetbuffer(&G(L)->buff);
}
total -= n-1; /* got `n' strings to create 1 new */
last -= n-1;
unfixedstack(L);
} while (total > 1); /* repeat until only 1 result left */
}
static TString* LoadString(LoadState* S)
{
int32_t size;
LoadVar(S,size);
if (size==0)
return NULL;
else
{
char* s;
if (!luaZ_direct_mode(S->Z)) {
s = luaZ_openspace(S->L,S->b,size);
LoadBlock(S,s,size);
return luaS_newlstr(S->L,s,size-1); /* remove trailing zero */
} else {
s = (char*)luaZ_get_crt_address(S->Z);
LoadBlock(S,NULL,size);
return luaS_newrolstr(S->L,s,size-1);
}
}
}
static void DumpEndianBlock(const void* b, size_t size, DumpState* D)
{
if (D->status==0)
{
lua_unlock(D->L);
if (D->swap)
{
char* origSwapBuffer=luaZ_openspace(D->L,&D->b,size);
char* swapBuffer = origSwapBuffer;
char* p =(char*) b+size-1;
while (p >= (char*)b)
*swapBuffer++ = *p--;
D->status=(*D->writer)(D->L,origSwapBuffer,size,D->data);
}
else
{
D->status=(*D->writer)(D->L,b,size,D->data);
}
lua_lock(D->L);
}
}
void luaV_concat (lua_State *L, int total) {
lua_assert(total >= 2);
do {
StkId top = L->top;
int n = 2; /* number of elements handled in this pass (at least 2) */
if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {
if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
luaG_concaterror(L, top-2, top-1);
}
else if (tsvalue(top-1)->len == 0) /* second operand is empty? */
(void)tostring(L, top - 2); /* result is first operand */
else if (ttisstring(top-2) && tsvalue(top-2)->len == 0) {
setsvalue2s(L, top-2, rawtsvalue(top-1)); /* result is second op. */
}
else {
/* at least two non-empty string values; get as many as possible */
size_t tl = tsvalue(top-1)->len;
char *buffer;
int i;
/* collect total length */
for (i = 1; i < total && tostring(L, top-i-1); i++) {
size_t l = tsvalue(top-i-1)->len;
if (l >= (MAX_SIZET/sizeof(char)) - tl)
luaG_runerror(L, "string length overflow");
tl += l;
}
buffer = luaZ_openspace(L, &G(L)->buff, tl);
tl = 0;
n = i;
do { /* concat all strings */
size_t l = tsvalue(top-i)->len;
memcpy(buffer+tl, svalue(top-i), l * sizeof(char));
tl += l;
} while (--i > 0);
setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));
}
total -= n-1; /* got 'n' strings to create 1 new */
L->top -= n-1; /* popped 'n' strings and pushed one */
} while (total > 1); /* repeat until only 1 result left */
}
void luaV_concat (lua_State *L, int total, int last) {
int useType = LUA_TSTRING;
int i;
StkId top = L->base + last + 1;
for (i = 0; i < total; ++i)
{
if (ttype(top-1-i) == LUA_TSTRING || ttype(top-1-i) == LUA_TWSTRING)
{
useType = ttype(top-1-i);
break;
}
}
if (useType == LUA_TSTRING)
{
do {
StkId top = L->base + last + 1;
int n = 2; /* number of elements handled in this pass (at least 2) */
if (!tostring(L, top-2) || !tostring(L, top-1)) {
if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
luaG_concaterror(L, top-2, top-1);
} else if (tsvalue(top-1)->len > 0) { /* if len=0, do nothing */
/* at least two string values; get as many as possible */
size_t tl = tsvalue(top-1)->len;
char *buffer;
int i;
/* collect total length */
for (n = 1; n < total && tostring(L, top-n-1); n++) {
size_t l = tsvalue(top-n-1)->len;
if (l >= MAX_SIZET - tl) luaG_runerror(L, "string length overflow");
tl += l;
}
buffer = luaZ_openspace(L, &G(L)->buff, tl);
tl = 0;
for (i=n; i>0; i--) { /* concat all strings */
size_t l = tsvalue(top-i)->len;
memcpy(buffer+tl, svalue(top-i), l);
tl += l;
#if LUA_REFCOUNT
luarc_cleanvalue(top-i);
#endif /* LUA_REFCOUNT */
}
setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));
}
total -= n-1; /* got `n' strings to create 1 new */
last -= n-1;
} while (total > 1); /* repeat until only 1 result left */
} else {
do {
StkId top = L->base + last + 1;
int n = 2; /* number of elements handled in this pass (at least 2) */
if (!towstring(L, top-2) || !towstring(L, top-1)) {
if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
luaG_concaterror(L, top-2, top-1);
} else if (tsvalue(top-1)->len > 0) { /* if len=0, do nothing */
/* at least two string values; get as many as possible */
size_t tl = tsvalue(top-1)->len;
char *buffer;
int i;
/* collect total length */
for (n = 1; n < total && towstring(L, top-n-1); n++) {
size_t l = tsvalue(top-n-1)->len;
if (l >= MAX_SIZET - tl) luaG_runerror(L, "string length overflow");
tl += l;
}
buffer = luaZ_openspace(L, &G(L)->buff, tl*2);
tl = 0;
for (i=n; i>0; i--) { /* concat all strings */
size_t l = tsvalue(top-i)->len;
memcpy(buffer+tl*2, wsvalue(top-i), l*2);
tl += l;
#if LUA_REFCOUNT
luarc_cleanvalue(top-i);
#endif /* LUA_REFCOUNT */
}
setwsvalue2s(L, top-n, luaS_newlwstr(L, (const lua_WChar*)buffer, tl));
}
total -= n-1; /* got `n' strings to create 1 new */
last -= n-1;
} while (total > 1); /* repeat until only 1 result left */
}
}
/*
** open parts that may cause memory-allocation errors
*/
static void f_luaopen (lua_State *L, void *ud) {
int i;
global_State globalState;
lua_State luaState;
global_State *g;
#ifdef _DEBUG
luaState.allocName = "Lua_global_State";
#endif _DEBUG
luaState.l_G = &globalState;
globalState.reallocFunc = luaHelper_Realloc;
globalState.freeFunc = luaHelper_Free;
globalState.memData = luaHelper_memData;
globalState.nblocks = sizeof(lua_State) + sizeof(global_State); // Bogus.
/* create a new global state */
g = luaM_new(&luaState, global_State);
UNUSED(ud);
if (g == NULL) luaD_throw(L, LUA_ERRMEM);
L->l_G = g;
g->mainthread = L;
g->GCthreshold = 0; /* mark it as unfinished state */
g->strt.size = 0;
g->strt.nuse = 0;
g->strt.hash = NULL;
setnilvalue2n(defaultmeta(L));
setnilvalue2n(registry(L));
luaZ_initbuffer(L, &g->buff);
g->panic = default_panic;
#if !LUA_REFCOUNT
g->rootgc = NULL;
g->rootudata = NULL;
g->tmudata = NULL;
#else LUA_REFCOUNT
g->rootgc_head.next = (GCObject*)&g->rootgc_tail;
g->rootgc_head.prev = NULL;
g->rootgc_tail.next = NULL;
g->rootgc_tail.prev = (GCObject*)&g->rootgc_head;
g->rootgc_head.tt = LUA_TNIL;
g->rootgc_head.marked = 0;
g->rootgc_head.ref = 0;
g->rootgc_tail.tt = LUA_TNIL;
g->rootgc_tail.marked = 0;
g->rootgc_tail.ref = 0;
g->rootudata_head.next = (GCObject*)&g->rootudata_tail;
g->rootudata_head.prev = NULL;
g->rootudata_tail.next = NULL;
g->rootudata_tail.prev = (GCObject*)&g->rootudata_head;
g->rootudata_head.tt = LUA_TNIL;
g->rootudata_head.marked = 0;
g->rootudata_head.ref = 0;
g->rootudata_tail.tt = LUA_TNIL;
g->rootudata_tail.marked = 0;
g->rootudata_tail.ref = 0;
g->tmudata_head.next = (GCObject*)&g->tmudata_tail;
g->tmudata_head.prev = NULL;
g->tmudata_tail.next = NULL;
g->tmudata_tail.prev = (GCObject*)&g->tmudata_head;
g->tmudata_head.tt = LUA_TNIL;
g->tmudata_head.marked = 0;
g->tmudata_head.ref = 0;
g->tmudata_tail.tt = LUA_TNIL;
g->tmudata_tail.marked = 0;
g->tmudata_tail.ref = 0;
#endif LUA_REFCOUNT
setnilvalue2n(gkey(g->dummynode));
setnilvalue2n(gval(g->dummynode));
g->dummynode->next = NULL;
g->nblocks = sizeof(lua_State) + sizeof(global_State);
g->reallocFunc = luaHelper_Realloc;
g->freeFunc = luaHelper_Free;
g->memData = luaHelper_memData;
g->fatalErrorFunc = defaultFatalErrorFunc;
#ifdef LUA_MTSUPPORT
g->lockData = NULL;
g->lockFunc = NULL;
g->unlockFunc = NULL;
#endif LUA_MTSUPPORT
g->userGCFunction = NULL;
g->globalUserData = NULL;
stack_init(L, L); /* init stack */
for (i = 0; i < LUA_NTYPES; i++)
{
defaultmetatypes(L, i)->value.gc = NULL;
}
/* create default meta table with a dummy table, and then close the loop */
defaultmeta(L)->tt = LUA_TNUMBER;
defaultmeta(L)->value.gc = NULL;
sethvalue2n(defaultmeta(L), luaH_new(L, 0, 0));
__AddRefDirect(hvalue(defaultmeta(L)));
hvalue(defaultmeta(L))->metatable = hvalue(defaultmeta(L));
__AddRefDirect(hvalue(defaultmeta(L))->metatable);
/* build meta tables */
for (i = 0; i < LUA_NTYPES; i++)
{
luaM_setname(L, "Lua_defaultMetaTypes");
sethvalue2n(defaultmetatypes(L, i), luaH_new(L, 0, 0));
hvalue(defaultmetatypes(L, i))->metatable = hvalue(defaultmeta(L));
}
luaM_setname(L, "Lua_Globals");
sethvalue(gt(L), luaH_new(L, 0, 4)); /* table of globals */
__AddRefDirect(hvalue(gt(L)));
luaM_setname(L, "Lua_Registry");
sethvalue(registry(L), luaH_new(L, 4, 4)); /* registry */
__AddRef(registry(L));
g->minimumstrings = lua_minimumnumstrings;
luaS_resize(L, MINSTRTABSIZE); /* initial size of string table */
luaT_init(L);
luaX_init(L);
luaS_fix(luaS_newliteral(L, MEMERRMSG));
g->GCthreshold = 4*G(L)->nblocks;
luaZ_openspace(L, &g->buff, lua_minimumauxspace);
}
void SexeLoadConstants(LoadState* S, Proto* f, sexe_stack_t *stack)
{
char *lit;
char **lits;
char *s_ptr;
int tot;
int idx;
int i;
lit = NULL;
lits = NULL;
if (stack->type == SESTACK_LITERAL) {
/* literals */
lit = (char *)calloc(stack->size + 1, sizeof(char));
LoadBlock(S, lit, stack->size);
tot = 0;
for (i = 0; i < stack->size; i++) {
if (lit[i] == '\0')
tot++;
}
VERBOSE("[CONSTANT] loaded x%d literal strings <%d bytes>\n", tot, sizeof(stack) + stack->size);
lits = (char **)calloc(tot + 1, sizeof(char *));
idx = 0;
s_ptr = lit;
for (i = 0; i < stack->size; i++) {
if (lit[i] == '\0') {
lits[idx] = s_ptr;
VERBOSE("[CONSTANT] lits[%d] = '%s'\n", idx, lits[idx]);
idx++;
s_ptr = &lit[i+1];
}
}
}
/* constants */
memset(stack, 0, sizeof(sexe_stack_t));
LoadBlock(S, stack, sizeof(sexe_stack_t));
VERBOSE("[CONSTANT] loading x%d constants\n", stack->size);
f->k=luaM_newvector(S->L, stack->size, TValue);
f->sizek = stack->size;
for (i=0; i < stack->size; i++) setnilvalue(&f->k[i]);
for (i=0; i < stack->size; i++) {
TValue* o=&f->k[i];
sexe_const_t con;
memset(&con, 0, sizeof(con));
LoadBlock(S, &con, sizeof(con));
switch (con.con_type)
{
case LUA_TNIL:
setnilvalue(o);
break;
case LUA_TBOOLEAN:
setbvalue(o, (unsigned char)con.con_val);
break;
case LUA_TNUMBER:
setnvalue(o, (lua_Number)con.con_val);
break;
case LUA_TSTRING:
if (lits && con.con_val < tot) {
char *raw = lits[con.con_val];
size_t str_len = strlen(raw);
char *s = luaZ_openspace(S->L, S->b, str_len);
memcpy(s, raw, str_len);
setsvalue2n(S->, o, luaS_newlstr(S->L, s, str_len));
}
//setsvalue2n(S->L, o, lits[con.con_val]);
break;
}
}
