mirror of https://github.com/rusefi/lua.git
details (use original type when saving variable's value)
This commit is contained in:
parent
afbf5c5dab
commit
dcad08b76d
4
lapi.c
4
lapi.c
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
** $Id: lapi.c,v 2.248 2015/03/28 19:14:47 roberto Exp roberto $
|
** $Id: lapi.c,v 2.249 2015/04/06 12:23:48 roberto Exp roberto $
|
||||||
** Lua API
|
** Lua API
|
||||||
** See Copyright Notice in lua.h
|
** See Copyright Notice in lua.h
|
||||||
*/
|
*/
|
||||||
|
@ -1043,7 +1043,7 @@ LUA_API int lua_gc (lua_State *L, int what, int data) {
|
||||||
}
|
}
|
||||||
case LUA_GCSTEP: {
|
case LUA_GCSTEP: {
|
||||||
l_mem debt = 1; /* =1 to signal that it did an actual step */
|
l_mem debt = 1; /* =1 to signal that it did an actual step */
|
||||||
int oldrunning = g->gcrunning;
|
lu_byte oldrunning = g->gcrunning;
|
||||||
g->gcrunning = 1; /* allow GC to run */
|
g->gcrunning = 1; /* allow GC to run */
|
||||||
if (data == 0) {
|
if (data == 0) {
|
||||||
luaE_setdebt(g, -GCSTEPSIZE); /* to do a "small" step */
|
luaE_setdebt(g, -GCSTEPSIZE); /* to do a "small" step */
|
||||||
|
|
4
ldo.c
4
ldo.c
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
** $Id: ldo.c,v 2.137 2015/03/30 16:05:23 roberto Exp roberto $
|
** $Id: ldo.c,v 2.138 2015/05/22 17:48:19 roberto Exp roberto $
|
||||||
** Stack and Call structure of Lua
|
** Stack and Call structure of Lua
|
||||||
** See Copyright Notice in lua.h
|
** See Copyright Notice in lua.h
|
||||||
*/
|
*/
|
||||||
|
@ -570,7 +570,7 @@ static void resume (lua_State *L, void *ud) {
|
||||||
|
|
||||||
LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs) {
|
LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs) {
|
||||||
int status;
|
int status;
|
||||||
int oldnny = L->nny; /* save "number of non-yieldable" calls */
|
unsigned short oldnny = L->nny; /* save "number of non-yieldable" calls */
|
||||||
lua_lock(L);
|
lua_lock(L);
|
||||||
luai_userstateresume(L, nargs);
|
luai_userstateresume(L, nargs);
|
||||||
L->nCcalls = (from) ? from->nCcalls + 1 : 1;
|
L->nCcalls = (from) ? from->nCcalls + 1 : 1;
|
||||||
|
|
Loading…
Reference in New Issue