1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distri8buted in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
/**
* This code is heavily based on the pluto code base. Copyright below
*/
/* Tamed Pluto - Heavy-duty persistence for Lua
* Copyright (C) 2004 by Ben Sunshine-Hill, and released into the public
* domain. People making use of this software as part of an application
* are politely requested to email the author at sneftel@gmail.com
* with a brief description of the application, primarily to satisfy his
* curiosity.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* Instrumented by Stefan Reich (info@luaos.net)
* for Mobile Lua (http://luaos.net/pages/mobile-lua.php)
*/
/**
* This code is heavily based on the Pluto code base. Copyright below
*/
/* Tamed Pluto - Heavy-duty persistence for Lua
* Copyright (C) 2004 by Ben Sunshine-Hill, and released into the public
* domain. People making use of this software as part of an application
* are politely requested to email the author at sneftel@gmail.com
* with a brief description of the application, primarily to satisfy his
* curiosity.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* Instrumented by Stefan Reich (info@luaos.net)
* for Mobile Lua (http://luaos.net/pages/mobile-lua.php)
*/
#include "lua_persistence_util.h"
#include "common/scummsys.h"
#include "lobject.h"
#include "lstate.h"
#include "lgc.h"
#include "lopcodes.h"
namespace Lua {
void *lua_realloc(lua_State *luaState, void *block, size_t osize, size_t nsize) {
global_State *globalState = G(luaState);
block = (*globalState->frealloc)(globalState->ud, block, osize, nsize);
globalState->totalbytes = (globalState->totalbytes - osize) + nsize;
return block;
}
void pushObject(lua_State *luaState, TValue *obj) {
setobj2s(luaState, luaState->top, obj);
api_check(luaState, luaState->top < luaState->ci->top);
luaState->top++;
}
void pushProto(lua_State *luaState, Proto *proto) {
TValue obj;
setptvalue(luaState, &obj, proto);
pushObject(luaState, &obj);
}
void pushUpValue(lua_State *luaState, UpVal *upval) {
TValue obj;
obj.value.gc = cast(GCObject *, upval);
obj.tt = LUA_TUPVAL;
checkliveness(G(L), obj);
pushObject(luaState, &obj);
}
void pushString(lua_State *luaState, TString *str) {
TValue o;
setsvalue(luaState, &o, str);
pushObject(luaState, &o);
}
/* A simple reimplementation of the unfortunately static function luaA_index.
* Does not support the global table, registry, or upvalues. */
StkId getObject(lua_State *luaState, int stackpos) {
if (stackpos > 0) {
lua_assert(luaState->base + stackpos - 1 < luaState->top);
return luaState->base + stackpos - 1;
} else {
lua_assert(L->top - stackpos >= L->base);
return luaState->top + stackpos;
}
}
void lua_linkObjToGC(lua_State *luaState, GCObject *obj, lu_byte type) {
global_State *globalState = G(luaState);
obj->gch.next = globalState->rootgc;
globalState->rootgc = obj;
obj->gch.marked = luaC_white(globalState);
obj->gch.tt = type;
}
Closure *lua_newLclosure(lua_State *luaState, int numElements, Table *elementTable) {
Closure *c = (Closure *)lua_malloc(luaState, sizeLclosure(numElements));
lua_linkObjToGC(luaState, obj2gco(c), LUA_TFUNCTION);
c->l.isC = 0;
c->l.env = elementTable;
c->l.nupvalues = cast_byte(numElements);
while (numElements--) {
c->l.upvals[numElements] = NULL;
}
return c;
}
void pushClosure(lua_State *luaState, Closure *closure) {
TValue obj;
setclvalue(luaState, &obj, closure);
pushObject(luaState, &obj);
}
Proto *createProto(lua_State *luaState) {
Proto *newProto = (Proto *)lua_malloc(luaState, sizeof(Proto));
lua_linkObjToGC(luaState, obj2gco(newProto), LUA_TPROTO);
newProto->k = NULL;
newProto->sizek = 0;
newProto->p = NULL;
newProto->sizep = 0;
newProto->code = NULL;
newProto->sizecode = 0;
newProto->sizelineinfo = 0;
newProto->sizeupvalues = 0;
newProto->nups = 0;
newProto->upvalues = NULL;
newProto->numparams = 0;
newProto->is_vararg = 0;
newProto->maxstacksize = 0;
newProto->lineinfo = NULL;
newProto->sizelocvars = 0;
newProto->locvars = NULL;
newProto->linedefined = 0;
newProto->lastlinedefined = 0;
newProto->source = NULL;
return newProto;
}
TString *createString(lua_State *luaState, const char *str, size_t len) {
TString *res;
lua_pushlstring(luaState, str, len);
res = rawtsvalue(luaState->top - 1);
lua_pop(luaState, 1);
return res;
}
Proto *makeFakeProto(lua_State *L, lu_byte nups) {
Proto *p = createProto(L);
p->sizelineinfo = 1;
p->lineinfo = lua_newVector(L, 1, int);
p->lineinfo[0] = 1;
p->sizecode = 1;
p->code = lua_newVector(L, 1, Instruction);
p->code[0] = CREATE_ABC(OP_RETURN, 0, 1, 0);
p->source = createString(L, "", 0);
p->maxstacksize = 2;
p->nups = nups;
p->sizek = 0;
p->sizep = 0;
return p;
}
UpVal *createUpValue(lua_State *luaState, int stackpos) {
UpVal *upValue = (UpVal *)lua_malloc(luaState, sizeof(UpVal));
lua_linkObjToGC(luaState, (GCObject *)upValue, LUA_TUPVAL);
upValue->tt = LUA_TUPVAL;
upValue->v = &upValue->u.value;
upValue->u.l.prev = NULL;
upValue->u.l.next = NULL;
const TValue *o2 = (TValue *)getObject(luaState, stackpos);
upValue->v->value = o2->value;
upValue->v->tt = o2->tt;
checkliveness(G(L), upValue->v);
return upValue;
}
void unboxUpValue(lua_State *luaState) {
// >>>>> ...... func
LClosure *lcl;
UpVal *uv;
lcl = (LClosure *)clvalue(getObject(luaState, -1));
uv = lcl->upvals[0];
lua_pop(luaState, 1);
// >>>>> ......
pushUpValue(luaState, uv);
// >>>>> ...... upValue
}
size_t appendStackToStack_reverse(lua_State *from, lua_State *to) {
for (StkId id = from->top - 1; id >= from->stack; --id) {
setobj2s(to, to->top, id);
to->top++;
}
return from->top - from->stack;
}
void correctStack(lua_State *L, TValue *oldstack) {
CallInfo *ci;
GCObject *up;
L->top = (L->top - oldstack) + L->stack;
for (up = L->openupval; up != NULL; up = up->gch.next)
gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack;
for (ci = L->base_ci; ci <= L->ci; ci++) {
ci->top = (ci->top - oldstack) + L->stack;
ci->base = (ci->base - oldstack) + L->stack;
ci->func = (ci->func - oldstack) + L->stack;
}
L->base = (L->base - oldstack) + L->stack;
}
void lua_reallocstack(lua_State *L, int newsize) {
TValue *oldstack = L->stack;
int realsize = newsize + 1 + EXTRA_STACK;
lua_reallocvector(L, L->stack, L->stacksize, realsize, TValue);
L->stacksize = realsize;
L->stack_last = L->stack + newsize;
correctStack(L, oldstack);
}
void lua_reallocCallInfo(lua_State *lauState, int newsize) {
CallInfo *oldci = lauState->base_ci;
lua_reallocvector(lauState, lauState->base_ci, lauState->size_ci, newsize, CallInfo);
lauState->size_ci = newsize;
lauState->ci = (lauState->ci - oldci) + lauState->base_ci;
lauState->end_ci = lauState->base_ci + lauState->size_ci - 1;
}
void GCUnlink(lua_State *luaState, GCObject *gco) {
GCObject *prevslot;
if (G(luaState)->rootgc == gco) {
G(luaState)->rootgc = G(luaState)->rootgc->gch.next;
return;
}
prevslot = G(luaState)->rootgc;
while (prevslot->gch.next != gco) {
prevslot = prevslot->gch.next;
}
prevslot->gch.next = prevslot->gch.next->gch.next;
}
TString *lua_newlstr(lua_State *luaState, const char *str, size_t len) {
lua_pushlstring(luaState, str, len);
TString *luaStr = &(luaState->top - 1)->value.gc->ts;
lua_pop(luaState, 1);
return luaStr;
}
void lua_link(lua_State *luaState, GCObject *o, lu_byte tt) {
global_State *g = G(luaState);
o->gch.next = g->rootgc;
g->rootgc = o;
o->gch.marked = luaC_white(g);
o->gch.tt = tt;
}
Proto *lua_newproto(lua_State *luaState) {
Proto *f = (Proto *)lua_malloc(luaState, sizeof(Proto));
lua_link(luaState, obj2gco(f), LUA_TPROTO);
f->k = NULL;
f->sizek = 0;
f->p = NULL;
f->sizep = 0;
f->code = NULL;
f->sizecode = 0;
f->sizelineinfo = 0;
f->sizeupvalues = 0;
f->nups = 0;
f->upvalues = NULL;
f->numparams = 0;
f->is_vararg = 0;
f->maxstacksize = 0;
f->lineinfo = NULL;
f->sizelocvars = 0;
f->locvars = NULL;
f->linedefined = 0;
f->lastlinedefined = 0;
f->source = NULL;
return f;
}
UpVal *makeUpValue(lua_State *luaState, int stackPos) {
UpVal *uv = lua_new(luaState, UpVal);
lua_link(luaState, (GCObject *)uv, LUA_TUPVAL);
uv->tt = LUA_TUPVAL;
uv->v = &uv->u.value;
uv->u.l.prev = NULL;
uv->u.l.next = NULL;
setobj(luaState, uv->v, getObject(luaState, stackPos));
return uv;
}
void boxUpValue_start(lua_State *luaState) {
LClosure *closure;
closure = (LClosure *)lua_newLclosure(luaState, 1, hvalue(&luaState->l_gt));
pushClosure(luaState, (Closure *)closure);
// >>>>> ...... func
closure->p = makeFakeProto(luaState, 1);
// Temporarily initialize the upvalue to nil
lua_pushnil(luaState);
closure->upvals[0] = makeUpValue(luaState, -1);
lua_pop(luaState, 1);
}
void boxUpValue_finish(lua_State *luaState) {
// >>>>> ...... func obj
LClosure *lcl = (LClosure *)clvalue(getObject(luaState, -2));
lcl->upvals[0]->u.value = *getObject(luaState, -1);
lua_pop(luaState, 1);
// >>>>> ...... func
}
} // End of namespace Lua
|