diff options
| author | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2017-05-13 10:54:47 -0300 |
|---|---|---|
| committer | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2017-05-13 10:54:47 -0300 |
| commit | 6d95de83c644da5f720cf468c38df9782f1c890d (patch) | |
| tree | 734170c5082ae1e44ad9fe69d85b167fd4d07207 /ldo.c | |
| parent | 5c8770f8969a73cf4ca503f54c2217f76de62e04 (diff) | |
| download | lua-6d95de83c644da5f720cf468c38df9782f1c890d.tar.gz lua-6d95de83c644da5f720cf468c38df9782f1c890d.tar.bz2 lua-6d95de83c644da5f720cf468c38df9782f1c890d.zip | |
no more field 'base' in CallInfo (base is always equal to 'func + 1',
with old/new vararg implementation)
Diffstat (limited to 'ldo.c')
| -rw-r--r-- | ldo.c | 5 |
1 files changed, 1 insertions, 4 deletions
| @@ -1,5 +1,5 @@ | |||
| 1 | /* | 1 | /* |
| 2 | ** $Id: ldo.c,v 2.157 2016/12/13 15:52:21 roberto Exp roberto $ | 2 | ** $Id: ldo.c,v 2.158 2017/05/13 12:57:20 roberto Exp roberto $ |
| 3 | ** Stack and Call structure of Lua | 3 | ** Stack and Call structure of Lua |
| 4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
| 5 | */ | 5 | */ |
| @@ -164,8 +164,6 @@ static void correctstack (lua_State *L, TValue *oldstack) { | |||
| 164 | for (ci = L->ci; ci != NULL; ci = ci->previous) { | 164 | for (ci = L->ci; ci != NULL; ci = ci->previous) { |
| 165 | ci->top = (ci->top - oldstack) + L->stack; | 165 | ci->top = (ci->top - oldstack) + L->stack; |
| 166 | ci->func = (ci->func - oldstack) + L->stack; | 166 | ci->func = (ci->func - oldstack) + L->stack; |
| 167 | if (isLua(ci)) | ||
| 168 | ci->u.l.base = (ci->u.l.base - oldstack) + L->stack; | ||
| 169 | } | 167 | } |
| 170 | } | 168 | } |
| 171 | 169 | ||
| @@ -424,7 +422,6 @@ int luaD_precall (lua_State *L, StkId func, int nresults) { | |||
| 424 | ci = next_ci(L); /* now 'enter' new function */ | 422 | ci = next_ci(L); /* now 'enter' new function */ |
| 425 | ci->nresults = nresults; | 423 | ci->nresults = nresults; |
| 426 | ci->func = func; | 424 | ci->func = func; |
| 427 | ci->u.l.base = func + 1; | ||
| 428 | L->top = ci->top = func + 1 + fsize; | 425 | L->top = ci->top = func + 1 + fsize; |
| 429 | lua_assert(ci->top <= L->stack_last); | 426 | lua_assert(ci->top <= L->stack_last); |
| 430 | ci->u.l.savedpc = p->code; /* starting point */ | 427 | ci->u.l.savedpc = p->code; /* starting point */ |
