- [NEW] Updatada la versió de Lua a 5.5.0
- [FIX] Afegits defines de Lua per a cada SO
This commit is contained in:
+121
-40
@@ -10,12 +10,16 @@
|
||||
#include "lprefix.h"
|
||||
|
||||
|
||||
#include <limits.h>
|
||||
#include <stddef.h>
|
||||
|
||||
#include "lua.h"
|
||||
|
||||
#include "lapi.h"
|
||||
#include "lgc.h"
|
||||
#include "lobject.h"
|
||||
#include "lstate.h"
|
||||
#include "ltable.h"
|
||||
#include "lundump.h"
|
||||
|
||||
|
||||
@@ -23,8 +27,11 @@ typedef struct {
|
||||
lua_State *L;
|
||||
lua_Writer writer;
|
||||
void *data;
|
||||
size_t offset; /* current position relative to beginning of dump */
|
||||
int strip;
|
||||
int status;
|
||||
Table *h; /* table to track saved strings */
|
||||
lua_Unsigned nstr; /* counter for counting saved strings */
|
||||
} DumpState;
|
||||
|
||||
|
||||
@@ -37,15 +44,36 @@ typedef struct {
|
||||
#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char))
|
||||
|
||||
|
||||
/*
|
||||
** Dump the block of memory pointed by 'b' with given 'size'.
|
||||
** 'b' should not be NULL, except for the last call signaling the end
|
||||
** of the dump.
|
||||
*/
|
||||
static void dumpBlock (DumpState *D, const void *b, size_t size) {
|
||||
if (D->status == 0 && size > 0) {
|
||||
if (D->status == 0) { /* do not write anything after an error */
|
||||
lua_unlock(D->L);
|
||||
D->status = (*D->writer)(D->L, b, size, D->data);
|
||||
lua_lock(D->L);
|
||||
D->offset += size;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
** Dump enough zeros to ensure that current position is a multiple of
|
||||
** 'align'.
|
||||
*/
|
||||
static void dumpAlign (DumpState *D, unsigned align) {
|
||||
unsigned padding = align - cast_uint(D->offset % align);
|
||||
if (padding < align) { /* padding == align means no padding */
|
||||
static lua_Integer paddingContent = 0;
|
||||
lua_assert(align <= sizeof(lua_Integer));
|
||||
dumpBlock(D, &paddingContent, padding);
|
||||
}
|
||||
lua_assert(D->offset % align == 0);
|
||||
}
|
||||
|
||||
|
||||
#define dumpVar(D,x) dumpVector(D,&x,1)
|
||||
|
||||
|
||||
@@ -55,23 +83,33 @@ static void dumpByte (DumpState *D, int y) {
|
||||
}
|
||||
|
||||
|
||||
/* dumpInt Buff Size */
|
||||
#define DIBS ((sizeof(size_t) * 8 / 7) + 1)
|
||||
/*
|
||||
** size for 'dumpVarint' buffer: each byte can store up to 7 bits.
|
||||
** (The "+6" rounds up the division.)
|
||||
*/
|
||||
#define DIBS ((l_numbits(lua_Unsigned) + 6) / 7)
|
||||
|
||||
static void dumpSize (DumpState *D, size_t x) {
|
||||
/*
|
||||
** Dumps an unsigned integer using the MSB Varint encoding
|
||||
*/
|
||||
static void dumpVarint (DumpState *D, lua_Unsigned x) {
|
||||
lu_byte buff[DIBS];
|
||||
int n = 0;
|
||||
do {
|
||||
buff[DIBS - (++n)] = x & 0x7f; /* fill buffer in reverse order */
|
||||
x >>= 7;
|
||||
} while (x != 0);
|
||||
buff[DIBS - 1] |= 0x80; /* mark last byte */
|
||||
unsigned n = 1;
|
||||
buff[DIBS - 1] = x & 0x7f; /* fill least-significant byte */
|
||||
while ((x >>= 7) != 0) /* fill other bytes in reverse order */
|
||||
buff[DIBS - (++n)] = cast_byte((x & 0x7f) | 0x80);
|
||||
dumpVector(D, buff + DIBS - n, n);
|
||||
}
|
||||
|
||||
|
||||
static void dumpSize (DumpState *D, size_t sz) {
|
||||
dumpVarint(D, cast(lua_Unsigned, sz));
|
||||
}
|
||||
|
||||
|
||||
static void dumpInt (DumpState *D, int x) {
|
||||
dumpSize(D, x);
|
||||
lua_assert(x >= 0);
|
||||
dumpVarint(D, cast_uint(x));
|
||||
}
|
||||
|
||||
|
||||
@@ -80,30 +118,65 @@ static void dumpNumber (DumpState *D, lua_Number x) {
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
** Signed integers are coded to keep small values small. (Coding -1 as
|
||||
** 0xfff...fff would use too many bytes to save a quite common value.)
|
||||
** A non-negative x is coded as 2x; a negative x is coded as -2x - 1.
|
||||
** (0 => 0; -1 => 1; 1 => 2; -2 => 3; 2 => 4; ...)
|
||||
*/
|
||||
static void dumpInteger (DumpState *D, lua_Integer x) {
|
||||
dumpVar(D, x);
|
||||
lua_Unsigned cx = (x >= 0) ? 2u * l_castS2U(x)
|
||||
: (2u * ~l_castS2U(x)) + 1;
|
||||
dumpVarint(D, cx);
|
||||
}
|
||||
|
||||
|
||||
static void dumpString (DumpState *D, const TString *s) {
|
||||
if (s == NULL)
|
||||
dumpSize(D, 0);
|
||||
/*
|
||||
** Dump a String. First dump its "size":
|
||||
** size==0 is followed by an index and means "reuse saved string with
|
||||
** that index"; index==0 means NULL.
|
||||
** size>=1 is followed by the string contents with real size==size-1 and
|
||||
** means that string, which will be saved with the next available index.
|
||||
** The real size does not include the ending '\0' (which is not dumped),
|
||||
** so adding 1 to it cannot overflow a size_t.
|
||||
*/
|
||||
static void dumpString (DumpState *D, TString *ts) {
|
||||
if (ts == NULL) {
|
||||
dumpVarint(D, 0); /* will "reuse" NULL */
|
||||
dumpVarint(D, 0); /* special index for NULL */
|
||||
}
|
||||
else {
|
||||
size_t size = tsslen(s);
|
||||
const char *str = getstr(s);
|
||||
dumpSize(D, size + 1);
|
||||
dumpVector(D, str, size);
|
||||
TValue idx;
|
||||
int tag = luaH_getstr(D->h, ts, &idx);
|
||||
if (!tagisempty(tag)) { /* string already saved? */
|
||||
dumpVarint(D, 0); /* reuse a saved string */
|
||||
dumpVarint(D, l_castS2U(ivalue(&idx))); /* index of saved string */
|
||||
}
|
||||
else { /* must write and save the string */
|
||||
TValue key, value; /* to save the string in the hash */
|
||||
size_t size;
|
||||
const char *s = getlstr(ts, size);
|
||||
dumpSize(D, size + 1);
|
||||
dumpVector(D, s, size + 1); /* include ending '\0' */
|
||||
D->nstr++; /* one more saved string */
|
||||
setsvalue(D->L, &key, ts); /* the string is the key */
|
||||
setivalue(&value, l_castU2S(D->nstr)); /* its index is the value */
|
||||
luaH_set(D->L, D->h, &key, &value); /* h[ts] = nstr */
|
||||
/* integer value does not need barrier */
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
static void dumpCode (DumpState *D, const Proto *f) {
|
||||
dumpInt(D, f->sizecode);
|
||||
dumpVector(D, f->code, f->sizecode);
|
||||
dumpAlign(D, sizeof(f->code[0]));
|
||||
lua_assert(f->code != NULL);
|
||||
dumpVector(D, f->code, cast_uint(f->sizecode));
|
||||
}
|
||||
|
||||
|
||||
static void dumpFunction(DumpState *D, const Proto *f, TString *psource);
|
||||
static void dumpFunction (DumpState *D, const Proto *f);
|
||||
|
||||
static void dumpConstants (DumpState *D, const Proto *f) {
|
||||
int i;
|
||||
@@ -136,7 +209,7 @@ static void dumpProtos (DumpState *D, const Proto *f) {
|
||||
int n = f->sizep;
|
||||
dumpInt(D, n);
|
||||
for (i = 0; i < n; i++)
|
||||
dumpFunction(D, f->p[i], f->source);
|
||||
dumpFunction(D, f->p[i]);
|
||||
}
|
||||
|
||||
|
||||
@@ -155,12 +228,14 @@ static void dumpDebug (DumpState *D, const Proto *f) {
|
||||
int i, n;
|
||||
n = (D->strip) ? 0 : f->sizelineinfo;
|
||||
dumpInt(D, n);
|
||||
dumpVector(D, f->lineinfo, n);
|
||||
if (f->lineinfo != NULL)
|
||||
dumpVector(D, f->lineinfo, cast_uint(n));
|
||||
n = (D->strip) ? 0 : f->sizeabslineinfo;
|
||||
dumpInt(D, n);
|
||||
for (i = 0; i < n; i++) {
|
||||
dumpInt(D, f->abslineinfo[i].pc);
|
||||
dumpInt(D, f->abslineinfo[i].line);
|
||||
if (n > 0) {
|
||||
/* 'abslineinfo' is an array of structures of int's */
|
||||
dumpAlign(D, sizeof(int));
|
||||
dumpVector(D, f->abslineinfo, cast_uint(n));
|
||||
}
|
||||
n = (D->strip) ? 0 : f->sizelocvars;
|
||||
dumpInt(D, n);
|
||||
@@ -176,51 +251,57 @@ static void dumpDebug (DumpState *D, const Proto *f) {
|
||||
}
|
||||
|
||||
|
||||
static void dumpFunction (DumpState *D, const Proto *f, TString *psource) {
|
||||
if (D->strip || f->source == psource)
|
||||
dumpString(D, NULL); /* no debug info or same source as its parent */
|
||||
else
|
||||
dumpString(D, f->source);
|
||||
static void dumpFunction (DumpState *D, const Proto *f) {
|
||||
dumpInt(D, f->linedefined);
|
||||
dumpInt(D, f->lastlinedefined);
|
||||
dumpByte(D, f->numparams);
|
||||
dumpByte(D, f->is_vararg);
|
||||
dumpByte(D, f->flag);
|
||||
dumpByte(D, f->maxstacksize);
|
||||
dumpCode(D, f);
|
||||
dumpConstants(D, f);
|
||||
dumpUpvalues(D, f);
|
||||
dumpProtos(D, f);
|
||||
dumpString(D, D->strip ? NULL : f->source);
|
||||
dumpDebug(D, f);
|
||||
}
|
||||
|
||||
|
||||
#define dumpNumInfo(D, tvar, value) \
|
||||
{ tvar i = value; dumpByte(D, sizeof(tvar)); dumpVar(D, i); }
|
||||
|
||||
|
||||
static void dumpHeader (DumpState *D) {
|
||||
dumpLiteral(D, LUA_SIGNATURE);
|
||||
dumpByte(D, LUAC_VERSION);
|
||||
dumpByte(D, LUAC_FORMAT);
|
||||
dumpLiteral(D, LUAC_DATA);
|
||||
dumpByte(D, sizeof(Instruction));
|
||||
dumpByte(D, sizeof(lua_Integer));
|
||||
dumpByte(D, sizeof(lua_Number));
|
||||
dumpInteger(D, LUAC_INT);
|
||||
dumpNumber(D, LUAC_NUM);
|
||||
dumpNumInfo(D, int, LUAC_INT);
|
||||
dumpNumInfo(D, Instruction, LUAC_INST);
|
||||
dumpNumInfo(D, lua_Integer, LUAC_INT);
|
||||
dumpNumInfo(D, lua_Number, LUAC_NUM);
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
** dump Lua function as precompiled chunk
|
||||
*/
|
||||
int luaU_dump(lua_State *L, const Proto *f, lua_Writer w, void *data,
|
||||
int strip) {
|
||||
int luaU_dump (lua_State *L, const Proto *f, lua_Writer w, void *data,
|
||||
int strip) {
|
||||
DumpState D;
|
||||
D.h = luaH_new(L); /* aux. table to keep strings already dumped */
|
||||
sethvalue2s(L, L->top.p, D.h); /* anchor it */
|
||||
L->top.p++;
|
||||
D.L = L;
|
||||
D.writer = w;
|
||||
D.offset = 0;
|
||||
D.data = data;
|
||||
D.strip = strip;
|
||||
D.status = 0;
|
||||
D.nstr = 0;
|
||||
dumpHeader(&D);
|
||||
dumpByte(&D, f->sizeupvalues);
|
||||
dumpFunction(&D, f, NULL);
|
||||
dumpFunction(&D, f);
|
||||
dumpBlock(&D, NULL, 0); /* signal end of dump */
|
||||
return D.status;
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user