diff options
Diffstat (limited to 'apps/plugins/lua/ldo.c')
-rw-r--r-- | apps/plugins/lua/ldo.c | 671 |
1 files changed, 254 insertions, 417 deletions
diff --git a/apps/plugins/lua/ldo.c b/apps/plugins/lua/ldo.c index e9dd5fa951..f303c744c7 100644 --- a/apps/plugins/lua/ldo.c +++ b/apps/plugins/lua/ldo.c | |||
@@ -1,11 +1,11 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: ldo.c,v 2.108.1.3 2013/11/08 18:22:50 roberto Exp $ | 2 | ** $Id: ldo.c,v 2.38.1.3 2008/01/18 22:31:22 roberto Exp $ |
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 | */ |
6 | 6 | ||
7 | 7 | ||
8 | #include <setjmp.h> | 8 | /* #include <setjmp.h> */ |
9 | #include <stdlib.h> | 9 | #include <stdlib.h> |
10 | #include <string.h> | 10 | #include <string.h> |
11 | 11 | ||
@@ -14,7 +14,6 @@ | |||
14 | 14 | ||
15 | #include "lua.h" | 15 | #include "lua.h" |
16 | 16 | ||
17 | #include "lapi.h" | ||
18 | #include "ldebug.h" | 17 | #include "ldebug.h" |
19 | #include "ldo.h" | 18 | #include "ldo.h" |
20 | #include "lfunc.h" | 19 | #include "lfunc.h" |
@@ -40,38 +39,6 @@ | |||
40 | ** ======================================================= | 39 | ** ======================================================= |
41 | */ | 40 | */ |
42 | 41 | ||
43 | /* | ||
44 | ** LUAI_THROW/LUAI_TRY define how Lua does exception handling. By | ||
45 | ** default, Lua handles errors with exceptions when compiling as | ||
46 | ** C++ code, with _longjmp/_setjmp when asked to use them, and with | ||
47 | ** longjmp/setjmp otherwise. | ||
48 | */ | ||
49 | #if !defined(LUAI_THROW) | ||
50 | |||
51 | #if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) | ||
52 | /* C++ exceptions */ | ||
53 | #define LUAI_THROW(L,c) throw(c) | ||
54 | #define LUAI_TRY(L,c,a) \ | ||
55 | try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } | ||
56 | #define luai_jmpbuf int /* dummy variable */ | ||
57 | |||
58 | #elif defined(LUA_USE_ULONGJMP) | ||
59 | /* in Unix, try _longjmp/_setjmp (more efficient) */ | ||
60 | #define LUAI_THROW(L,c) _longjmp((c)->b, 1) | ||
61 | #define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } | ||
62 | #define luai_jmpbuf jmp_buf | ||
63 | |||
64 | #else | ||
65 | /* default handling with long jumps */ | ||
66 | #define LUAI_THROW(L,c) longjmp((c)->b, 1) | ||
67 | #define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } | ||
68 | #define luai_jmpbuf jmp_buf | ||
69 | |||
70 | #endif | ||
71 | |||
72 | #endif | ||
73 | |||
74 | |||
75 | 42 | ||
76 | /* chain list of long jump buffers */ | 43 | /* chain list of long jump buffers */ |
77 | struct lua_longjmp { | 44 | struct lua_longjmp { |
@@ -81,17 +48,18 @@ struct lua_longjmp { | |||
81 | }; | 48 | }; |
82 | 49 | ||
83 | 50 | ||
84 | static void seterrorobj (lua_State *L, int errcode, StkId oldtop) { | 51 | void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) { |
85 | switch (errcode) { | 52 | switch (errcode) { |
86 | case LUA_ERRMEM: { /* memory error? */ | 53 | case LUA_ERRMEM: { |
87 | setsvalue2s(L, oldtop, G(L)->memerrmsg); /* reuse preregistered msg. */ | 54 | setsvalue2s(L, oldtop, luaS_newliteral(L, MEMERRMSG)); |
88 | break; | 55 | break; |
89 | } | 56 | } |
90 | case LUA_ERRERR: { | 57 | case LUA_ERRERR: { |
91 | setsvalue2s(L, oldtop, luaS_newliteral(L, "error in error handling")); | 58 | setsvalue2s(L, oldtop, luaS_newliteral(L, "error in error handling")); |
92 | break; | 59 | break; |
93 | } | 60 | } |
94 | default: { | 61 | case LUA_ERRSYNTAX: |
62 | case LUA_ERRRUN: { | ||
95 | setobjs2s(L, oldtop, L->top - 1); /* error message on current top */ | 63 | setobjs2s(L, oldtop, L->top - 1); /* error message on current top */ |
96 | break; | 64 | break; |
97 | } | 65 | } |
@@ -100,39 +68,55 @@ static void seterrorobj (lua_State *L, int errcode, StkId oldtop) { | |||
100 | } | 68 | } |
101 | 69 | ||
102 | 70 | ||
103 | l_noret luaD_throw (lua_State *L, int errcode) { | 71 | static void restore_stack_limit (lua_State *L) { |
104 | if (L->errorJmp) { /* thread has an error handler? */ | 72 | lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1); |
105 | L->errorJmp->status = errcode; /* set status */ | 73 | if (L->size_ci > LUAI_MAXCALLS) { /* there was an overflow? */ |
106 | LUAI_THROW(L, L->errorJmp); /* jump to it */ | 74 | int inuse = cast_int(L->ci - L->base_ci); |
75 | if (inuse + 1 < LUAI_MAXCALLS) /* can `undo' overflow? */ | ||
76 | luaD_reallocCI(L, LUAI_MAXCALLS); | ||
107 | } | 77 | } |
108 | else { /* thread has no error handler */ | 78 | } |
109 | L->status = cast_byte(errcode); /* mark it as dead */ | 79 | |
110 | if (G(L)->mainthread->errorJmp) { /* main thread has a handler? */ | 80 | |
111 | setobjs2s(L, G(L)->mainthread->top++, L->top - 1); /* copy error obj. */ | 81 | static void resetstack (lua_State *L, int status) { |
112 | luaD_throw(G(L)->mainthread, errcode); /* re-throw in main thread */ | 82 | L->ci = L->base_ci; |
113 | } | 83 | L->base = L->ci->base; |
114 | else { /* no handler at all; abort */ | 84 | luaF_close(L, L->base); /* close eventual pending closures */ |
115 | if (G(L)->panic) { /* panic function? */ | 85 | luaD_seterrorobj(L, status, L->base); |
116 | lua_unlock(L); | 86 | L->nCcalls = L->baseCcalls; |
117 | G(L)->panic(L); /* call it (last chance to jump out) */ | 87 | L->allowhook = 1; |
118 | } | 88 | restore_stack_limit(L); |
119 | abort(); | 89 | L->errfunc = 0; |
90 | L->errorJmp = NULL; | ||
91 | } | ||
92 | |||
93 | |||
94 | void luaD_throw (lua_State *L, int errcode) { | ||
95 | if (L->errorJmp) { | ||
96 | L->errorJmp->status = errcode; | ||
97 | LUAI_THROW(L, L->errorJmp); | ||
98 | } | ||
99 | else { | ||
100 | L->status = cast_byte(errcode); | ||
101 | if (G(L)->panic) { | ||
102 | resetstack(L, errcode); | ||
103 | lua_unlock(L); | ||
104 | G(L)->panic(L); | ||
120 | } | 105 | } |
106 | exit(EXIT_FAILURE); | ||
121 | } | 107 | } |
122 | } | 108 | } |
123 | 109 | ||
124 | 110 | ||
125 | int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { | 111 | int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { |
126 | unsigned short oldnCcalls = L->nCcalls; | ||
127 | struct lua_longjmp lj; | 112 | struct lua_longjmp lj; |
128 | lj.status = LUA_OK; | 113 | lj.status = 0; |
129 | lj.previous = L->errorJmp; /* chain new error handler */ | 114 | lj.previous = L->errorJmp; /* chain new error handler */ |
130 | L->errorJmp = &lj; | 115 | L->errorJmp = &lj; |
131 | LUAI_TRY(L, &lj, | 116 | LUAI_TRY(L, &lj, |
132 | (*f)(L, ud); | 117 | (*f)(L, ud); |
133 | ); | 118 | ); |
134 | L->errorJmp = lj.previous; /* restore old error handler */ | 119 | L->errorJmp = lj.previous; /* restore old error handler */ |
135 | L->nCcalls = oldnCcalls; | ||
136 | return lj.status; | 120 | return lj.status; |
137 | } | 121 | } |
138 | 122 | ||
@@ -145,127 +129,112 @@ static void correctstack (lua_State *L, TValue *oldstack) { | |||
145 | L->top = (L->top - oldstack) + L->stack; | 129 | L->top = (L->top - oldstack) + L->stack; |
146 | for (up = L->openupval; up != NULL; up = up->gch.next) | 130 | for (up = L->openupval; up != NULL; up = up->gch.next) |
147 | gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack; | 131 | gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack; |
148 | for (ci = L->ci; ci != NULL; ci = ci->previous) { | 132 | for (ci = L->base_ci; ci <= L->ci; ci++) { |
149 | ci->top = (ci->top - oldstack) + L->stack; | 133 | ci->top = (ci->top - oldstack) + L->stack; |
134 | ci->base = (ci->base - oldstack) + L->stack; | ||
150 | ci->func = (ci->func - oldstack) + L->stack; | 135 | ci->func = (ci->func - oldstack) + L->stack; |
151 | if (isLua(ci)) | ||
152 | ci->u.l.base = (ci->u.l.base - oldstack) + L->stack; | ||
153 | } | 136 | } |
137 | L->base = (L->base - oldstack) + L->stack; | ||
154 | } | 138 | } |
155 | 139 | ||
156 | 140 | ||
157 | /* some space for error handling */ | ||
158 | #define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) | ||
159 | |||
160 | |||
161 | void luaD_reallocstack (lua_State *L, int newsize) { | 141 | void luaD_reallocstack (lua_State *L, int newsize) { |
162 | TValue *oldstack = L->stack; | 142 | TValue *oldstack = L->stack; |
163 | int lim = L->stacksize; | 143 | int realsize = newsize + 1 + EXTRA_STACK; |
164 | lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); | 144 | lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1); |
165 | lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK); | 145 | luaM_reallocvector(L, L->stack, L->stacksize, realsize, TValue); |
166 | luaM_reallocvector(L, L->stack, L->stacksize, newsize, TValue); | 146 | L->stacksize = realsize; |
167 | for (; lim < newsize; lim++) | 147 | L->stack_last = L->stack+newsize; |
168 | setnilvalue(L->stack + lim); /* erase new segment */ | ||
169 | L->stacksize = newsize; | ||
170 | L->stack_last = L->stack + newsize - EXTRA_STACK; | ||
171 | correctstack(L, oldstack); | 148 | correctstack(L, oldstack); |
172 | } | 149 | } |
173 | 150 | ||
174 | 151 | ||
175 | void luaD_growstack (lua_State *L, int n) { | 152 | void luaD_reallocCI (lua_State *L, int newsize) { |
176 | int size = L->stacksize; | 153 | CallInfo *oldci = L->base_ci; |
177 | if (size > LUAI_MAXSTACK) /* error after extra size? */ | 154 | luaM_reallocvector(L, L->base_ci, L->size_ci, newsize, CallInfo); |
178 | luaD_throw(L, LUA_ERRERR); | 155 | L->size_ci = newsize; |
179 | else { | 156 | L->ci = (L->ci - oldci) + L->base_ci; |
180 | int needed = cast_int(L->top - L->stack) + n + EXTRA_STACK; | 157 | L->end_ci = L->base_ci + L->size_ci - 1; |
181 | int newsize = 2 * size; | ||
182 | if (newsize > LUAI_MAXSTACK) newsize = LUAI_MAXSTACK; | ||
183 | if (newsize < needed) newsize = needed; | ||
184 | if (newsize > LUAI_MAXSTACK) { /* stack overflow? */ | ||
185 | luaD_reallocstack(L, ERRORSTACKSIZE); | ||
186 | luaG_runerror(L, "stack overflow"); | ||
187 | } | ||
188 | else | ||
189 | luaD_reallocstack(L, newsize); | ||
190 | } | ||
191 | } | 158 | } |
192 | 159 | ||
193 | 160 | ||
194 | static int stackinuse (lua_State *L) { | 161 | void luaD_growstack (lua_State *L, int n) { |
195 | CallInfo *ci; | 162 | if (n <= L->stacksize) /* double size is enough? */ |
196 | StkId lim = L->top; | 163 | luaD_reallocstack(L, 2*L->stacksize); |
197 | for (ci = L->ci; ci != NULL; ci = ci->previous) { | 164 | else |
198 | lua_assert(ci->top <= L->stack_last); | 165 | luaD_reallocstack(L, L->stacksize + n); |
199 | if (lim < ci->top) lim = ci->top; | ||
200 | } | ||
201 | return cast_int(lim - L->stack) + 1; /* part of stack in use */ | ||
202 | } | 166 | } |
203 | 167 | ||
204 | 168 | ||
205 | void luaD_shrinkstack (lua_State *L) { | 169 | static CallInfo *growCI (lua_State *L) { |
206 | int inuse = stackinuse(L); | 170 | if (L->size_ci > LUAI_MAXCALLS) /* overflow while handling overflow? */ |
207 | int goodsize = inuse + (inuse / 8) + 2*EXTRA_STACK; | 171 | luaD_throw(L, LUA_ERRERR); |
208 | if (goodsize > LUAI_MAXSTACK) goodsize = LUAI_MAXSTACK; | 172 | else { |
209 | if (inuse > LUAI_MAXSTACK || /* handling stack overflow? */ | 173 | luaD_reallocCI(L, 2*L->size_ci); |
210 | goodsize >= L->stacksize) /* would grow instead of shrink? */ | 174 | if (L->size_ci > LUAI_MAXCALLS) |
211 | condmovestack(L); /* don't change stack (change only for debugging) */ | 175 | luaG_runerror(L, "stack overflow"); |
212 | else | 176 | } |
213 | luaD_reallocstack(L, goodsize); /* shrink it */ | 177 | return ++L->ci; |
214 | } | 178 | } |
215 | 179 | ||
216 | 180 | ||
217 | void luaD_hook (lua_State *L, int event, int line) { | 181 | void luaD_callhook (lua_State *L, int event, int line) { |
218 | lua_Hook hook = L->hook; | 182 | lua_Hook hook = L->hook; |
219 | if (hook && L->allowhook) { | 183 | if (hook && L->allowhook) { |
220 | CallInfo *ci = L->ci; | ||
221 | ptrdiff_t top = savestack(L, L->top); | 184 | ptrdiff_t top = savestack(L, L->top); |
222 | ptrdiff_t ci_top = savestack(L, ci->top); | 185 | ptrdiff_t ci_top = savestack(L, L->ci->top); |
223 | lua_Debug ar; | 186 | lua_Debug ar; |
224 | ar.event = event; | 187 | ar.event = event; |
225 | ar.currentline = line; | 188 | ar.currentline = line; |
226 | ar.i_ci = ci; | 189 | if (event == LUA_HOOKTAILRET) |
190 | ar.i_ci = 0; /* tail call; no debug information about it */ | ||
191 | else | ||
192 | ar.i_ci = cast_int(L->ci - L->base_ci); | ||
227 | luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ | 193 | luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ |
228 | ci->top = L->top + LUA_MINSTACK; | 194 | L->ci->top = L->top + LUA_MINSTACK; |
229 | lua_assert(ci->top <= L->stack_last); | 195 | lua_assert(L->ci->top <= L->stack_last); |
230 | L->allowhook = 0; /* cannot call hooks inside a hook */ | 196 | L->allowhook = 0; /* cannot call hooks inside a hook */ |
231 | ci->callstatus |= CIST_HOOKED; | ||
232 | lua_unlock(L); | 197 | lua_unlock(L); |
233 | (*hook)(L, &ar); | 198 | (*hook)(L, &ar); |
234 | lua_lock(L); | 199 | lua_lock(L); |
235 | lua_assert(!L->allowhook); | 200 | lua_assert(!L->allowhook); |
236 | L->allowhook = 1; | 201 | L->allowhook = 1; |
237 | ci->top = restorestack(L, ci_top); | 202 | L->ci->top = restorestack(L, ci_top); |
238 | L->top = restorestack(L, top); | 203 | L->top = restorestack(L, top); |
239 | ci->callstatus &= ~CIST_HOOKED; | ||
240 | } | ||
241 | } | ||
242 | |||
243 | |||
244 | static void callhook (lua_State *L, CallInfo *ci) { | ||
245 | int hook = LUA_HOOKCALL; | ||
246 | ci->u.l.savedpc++; /* hooks assume 'pc' is already incremented */ | ||
247 | if (isLua(ci->previous) && | ||
248 | GET_OPCODE(*(ci->previous->u.l.savedpc - 1)) == OP_TAILCALL) { | ||
249 | ci->callstatus |= CIST_TAIL; | ||
250 | hook = LUA_HOOKTAILCALL; | ||
251 | } | 204 | } |
252 | luaD_hook(L, hook, -1); | ||
253 | ci->u.l.savedpc--; /* correct 'pc' */ | ||
254 | } | 205 | } |
255 | 206 | ||
256 | 207 | ||
257 | static StkId adjust_varargs (lua_State *L, Proto *p, int actual) { | 208 | static StkId adjust_varargs (lua_State *L, Proto *p, int actual) { |
258 | int i; | 209 | int i; |
259 | int nfixargs = p->numparams; | 210 | int nfixargs = p->numparams; |
211 | Table *htab = NULL; | ||
260 | StkId base, fixed; | 212 | StkId base, fixed; |
261 | lua_assert(actual >= nfixargs); | 213 | for (; actual < nfixargs; ++actual) |
214 | setnilvalue(L->top++); | ||
215 | #if defined(LUA_COMPAT_VARARG) | ||
216 | if (p->is_vararg & VARARG_NEEDSARG) { /* compat. with old-style vararg? */ | ||
217 | int nvar = actual - nfixargs; /* number of extra arguments */ | ||
218 | lua_assert(p->is_vararg & VARARG_HASARG); | ||
219 | luaC_checkGC(L); | ||
220 | htab = luaH_new(L, nvar, 1); /* create `arg' table */ | ||
221 | for (i=0; i<nvar; i++) /* put extra arguments into `arg' table */ | ||
222 | setobj2n(L, luaH_setnum(L, htab, i+1), L->top - nvar + i); | ||
223 | /* store counter in field `n' */ | ||
224 | setnvalue(luaH_setstr(L, htab, luaS_newliteral(L, "n")), cast_num(nvar)); | ||
225 | } | ||
226 | #endif | ||
262 | /* move fixed parameters to final position */ | 227 | /* move fixed parameters to final position */ |
263 | luaD_checkstack(L, p->maxstacksize); /* check again for new 'base' */ | ||
264 | fixed = L->top - actual; /* first fixed argument */ | 228 | fixed = L->top - actual; /* first fixed argument */ |
265 | base = L->top; /* final position of first argument */ | 229 | base = L->top; /* final position of first argument */ |
266 | for (i=0; i<nfixargs; i++) { | 230 | for (i=0; i<nfixargs; i++) { |
267 | setobjs2s(L, L->top++, fixed + i); | 231 | setobjs2s(L, L->top++, fixed+i); |
268 | setnilvalue(fixed + i); | 232 | setnilvalue(fixed+i); |
233 | } | ||
234 | /* add `arg' parameter */ | ||
235 | if (htab) { | ||
236 | sethvalue(L, L->top++, htab); | ||
237 | lua_assert(iswhite(obj2gco(htab))); | ||
269 | } | 238 | } |
270 | return base; | 239 | return base; |
271 | } | 240 | } |
@@ -287,93 +256,100 @@ static StkId tryfuncTM (lua_State *L, StkId func) { | |||
287 | 256 | ||
288 | 257 | ||
289 | 258 | ||
290 | #define next_ci(L) (L->ci = (L->ci->next ? L->ci->next : luaE_extendCI(L))) | 259 | #define inc_ci(L) \ |
260 | ((L->ci == L->end_ci) ? growCI(L) : \ | ||
261 | (condhardstacktests(luaD_reallocCI(L, L->size_ci)), ++L->ci)) | ||
291 | 262 | ||
292 | 263 | ||
293 | /* | ||
294 | ** returns true if function has been executed (C function) | ||
295 | */ | ||
296 | int luaD_precall (lua_State *L, StkId func, int nresults) { | 264 | int luaD_precall (lua_State *L, StkId func, int nresults) { |
297 | lua_CFunction f; | 265 | LClosure *cl; |
298 | CallInfo *ci; | 266 | ptrdiff_t funcr; |
299 | int n; /* number of arguments (Lua) or returns (C) */ | 267 | if (!ttisfunction(func)) /* `func' is not a function? */ |
300 | ptrdiff_t funcr = savestack(L, func); | 268 | func = tryfuncTM(L, func); /* check the `function' tag method */ |
301 | switch (ttype(func)) { | 269 | funcr = savestack(L, func); |
302 | case LUA_TLCF: /* light C function */ | 270 | cl = &clvalue(func)->l; |
303 | f = fvalue(func); | 271 | L->ci->savedpc = L->savedpc; |
304 | goto Cfunc; | 272 | if (!cl->isC) { /* Lua function? prepare its call */ |
305 | case LUA_TCCL: { /* C closure */ | 273 | CallInfo *ci; |
306 | f = clCvalue(func)->f; | 274 | StkId st, base; |
307 | Cfunc: | 275 | Proto *p = cl->p; |
308 | luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ | 276 | luaD_checkstack(L, p->maxstacksize); |
309 | ci = next_ci(L); /* now 'enter' new function */ | 277 | func = restorestack(L, funcr); |
310 | ci->nresults = nresults; | 278 | if (!p->is_vararg) { /* no varargs? */ |
311 | ci->func = restorestack(L, funcr); | 279 | base = func + 1; |
312 | ci->top = L->top + LUA_MINSTACK; | 280 | if (L->top > base + p->numparams) |
313 | lua_assert(ci->top <= L->stack_last); | 281 | L->top = base + p->numparams; |
314 | ci->callstatus = 0; | ||
315 | luaC_checkGC(L); /* stack grow uses memory */ | ||
316 | if (L->hookmask & LUA_MASKCALL) | ||
317 | luaD_hook(L, LUA_HOOKCALL, -1); | ||
318 | lua_unlock(L); | ||
319 | n = (*f)(L); /* do the actual call */ | ||
320 | lua_lock(L); | ||
321 | api_checknelems(L, n); | ||
322 | luaD_poscall(L, L->top - n); | ||
323 | return 1; | ||
324 | } | 282 | } |
325 | case LUA_TLCL: { /* Lua function: prepare its call */ | 283 | else { /* vararg function */ |
326 | StkId base; | 284 | int nargs = cast_int(L->top - func) - 1; |
327 | Proto *p = clLvalue(func)->p; | 285 | base = adjust_varargs(L, p, nargs); |
328 | n = cast_int(L->top - func) - 1; /* number of real arguments */ | 286 | func = restorestack(L, funcr); /* previous call may change the stack */ |
329 | luaD_checkstack(L, p->maxstacksize); | 287 | } |
330 | for (; n < p->numparams; n++) | 288 | ci = inc_ci(L); /* now `enter' new function */ |
331 | setnilvalue(L->top++); /* complete missing arguments */ | 289 | ci->func = func; |
332 | if (!p->is_vararg) { | 290 | L->base = ci->base = base; |
333 | func = restorestack(L, funcr); | 291 | ci->top = L->base + p->maxstacksize; |
334 | base = func + 1; | 292 | lua_assert(ci->top <= L->stack_last); |
335 | } | 293 | L->savedpc = p->code; /* starting point */ |
336 | else { | 294 | ci->tailcalls = 0; |
337 | base = adjust_varargs(L, p, n); | 295 | ci->nresults = nresults; |
338 | func = restorestack(L, funcr); /* previous call can change stack */ | 296 | for (st = L->top; st < ci->top; st++) |
339 | } | 297 | setnilvalue(st); |
340 | ci = next_ci(L); /* now 'enter' new function */ | 298 | L->top = ci->top; |
341 | ci->nresults = nresults; | 299 | if (L->hookmask & LUA_MASKCALL) { |
342 | ci->func = func; | 300 | L->savedpc++; /* hooks assume 'pc' is already incremented */ |
343 | ci->u.l.base = base; | 301 | luaD_callhook(L, LUA_HOOKCALL, -1); |
344 | ci->top = base + p->maxstacksize; | 302 | L->savedpc--; /* correct 'pc' */ |
345 | lua_assert(ci->top <= L->stack_last); | ||
346 | ci->u.l.savedpc = p->code; /* starting point */ | ||
347 | ci->callstatus = CIST_LUA; | ||
348 | L->top = ci->top; | ||
349 | luaC_checkGC(L); /* stack grow uses memory */ | ||
350 | if (L->hookmask & LUA_MASKCALL) | ||
351 | callhook(L, ci); | ||
352 | return 0; | ||
353 | } | 303 | } |
354 | default: { /* not a function */ | 304 | return PCRLUA; |
355 | func = tryfuncTM(L, func); /* retry with 'function' tag method */ | 305 | } |
356 | return luaD_precall(L, func, nresults); /* now it must be a function */ | 306 | else { /* if is a C function, call it */ |
307 | CallInfo *ci; | ||
308 | int n; | ||
309 | luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ | ||
310 | ci = inc_ci(L); /* now `enter' new function */ | ||
311 | ci->func = restorestack(L, funcr); | ||
312 | L->base = ci->base = ci->func + 1; | ||
313 | ci->top = L->top + LUA_MINSTACK; | ||
314 | lua_assert(ci->top <= L->stack_last); | ||
315 | ci->nresults = nresults; | ||
316 | if (L->hookmask & LUA_MASKCALL) | ||
317 | luaD_callhook(L, LUA_HOOKCALL, -1); | ||
318 | lua_unlock(L); | ||
319 | n = (*curr_func(L)->c.f)(L); /* do the actual call */ | ||
320 | lua_lock(L); | ||
321 | if (n < 0) /* yielding? */ | ||
322 | return PCRYIELD; | ||
323 | else { | ||
324 | luaD_poscall(L, L->top - n); | ||
325 | return PCRC; | ||
357 | } | 326 | } |
358 | } | 327 | } |
359 | } | 328 | } |
360 | 329 | ||
361 | 330 | ||
331 | static StkId callrethooks (lua_State *L, StkId firstResult) { | ||
332 | ptrdiff_t fr = savestack(L, firstResult); /* next call may change stack */ | ||
333 | luaD_callhook(L, LUA_HOOKRET, -1); | ||
334 | if (f_isLua(L->ci)) { /* Lua function? */ | ||
335 | while ((L->hookmask & LUA_MASKRET) && L->ci->tailcalls--) /* tail calls */ | ||
336 | luaD_callhook(L, LUA_HOOKTAILRET, -1); | ||
337 | } | ||
338 | return restorestack(L, fr); | ||
339 | } | ||
340 | |||
341 | |||
362 | int luaD_poscall (lua_State *L, StkId firstResult) { | 342 | int luaD_poscall (lua_State *L, StkId firstResult) { |
363 | StkId res; | 343 | StkId res; |
364 | int wanted, i; | 344 | int wanted, i; |
365 | CallInfo *ci = L->ci; | 345 | CallInfo *ci; |
366 | if (L->hookmask & (LUA_MASKRET | LUA_MASKLINE)) { | 346 | if (L->hookmask & LUA_MASKRET) |
367 | if (L->hookmask & LUA_MASKRET) { | 347 | firstResult = callrethooks(L, firstResult); |
368 | ptrdiff_t fr = savestack(L, firstResult); /* hook may change stack */ | 348 | ci = L->ci--; |
369 | luaD_hook(L, LUA_HOOKRET, -1); | ||
370 | firstResult = restorestack(L, fr); | ||
371 | } | ||
372 | L->oldpc = ci->previous->u.l.savedpc; /* 'oldpc' for caller function */ | ||
373 | } | ||
374 | res = ci->func; /* res == final position of 1st result */ | 349 | res = ci->func; /* res == final position of 1st result */ |
375 | wanted = ci->nresults; | 350 | wanted = ci->nresults; |
376 | L->ci = ci = ci->previous; /* back to caller */ | 351 | L->base = (ci - 1)->base; /* restore base */ |
352 | L->savedpc = (ci - 1)->savedpc; /* restore savedpc */ | ||
377 | /* move results to correct place */ | 353 | /* move results to correct place */ |
378 | for (i = wanted; i != 0 && firstResult < L->top; i--) | 354 | for (i = wanted; i != 0 && firstResult < L->top; i--) |
379 | setobjs2s(L, res++, firstResult++); | 355 | setobjs2s(L, res++, firstResult++); |
@@ -389,226 +365,112 @@ int luaD_poscall (lua_State *L, StkId firstResult) { | |||
389 | ** The arguments are on the stack, right after the function. | 365 | ** The arguments are on the stack, right after the function. |
390 | ** When returns, all the results are on the stack, starting at the original | 366 | ** When returns, all the results are on the stack, starting at the original |
391 | ** function position. | 367 | ** function position. |
392 | */ | 368 | */ |
393 | void luaD_call (lua_State *L, StkId func, int nResults, int allowyield) { | 369 | void luaD_call (lua_State *L, StkId func, int nResults) { |
394 | if (++L->nCcalls >= LUAI_MAXCCALLS) { | 370 | if (++L->nCcalls >= LUAI_MAXCCALLS) { |
395 | if (L->nCcalls == LUAI_MAXCCALLS) | 371 | if (L->nCcalls == LUAI_MAXCCALLS) |
396 | luaG_runerror(L, "C stack overflow"); | 372 | luaG_runerror(L, "C stack overflow"); |
397 | else if (L->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3))) | 373 | else if (L->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3))) |
398 | luaD_throw(L, LUA_ERRERR); /* error while handing stack error */ | 374 | luaD_throw(L, LUA_ERRERR); /* error while handing stack error */ |
399 | } | 375 | } |
400 | if (!allowyield) L->nny++; | 376 | if (luaD_precall(L, func, nResults) == PCRLUA) /* is a Lua function? */ |
401 | if (!luaD_precall(L, func, nResults)) /* is a Lua function? */ | 377 | luaV_execute(L, 1); /* call it */ |
402 | luaV_execute(L); /* call it */ | ||
403 | if (!allowyield) L->nny--; | ||
404 | L->nCcalls--; | 378 | L->nCcalls--; |
379 | luaC_checkGC(L); | ||
405 | } | 380 | } |
406 | 381 | ||
407 | 382 | ||
408 | static void finishCcall (lua_State *L) { | ||
409 | CallInfo *ci = L->ci; | ||
410 | int n; | ||
411 | lua_assert(ci->u.c.k != NULL); /* must have a continuation */ | ||
412 | lua_assert(L->nny == 0); | ||
413 | if (ci->callstatus & CIST_YPCALL) { /* was inside a pcall? */ | ||
414 | ci->callstatus &= ~CIST_YPCALL; /* finish 'lua_pcall' */ | ||
415 | L->errfunc = ci->u.c.old_errfunc; | ||
416 | } | ||
417 | /* finish 'lua_callk'/'lua_pcall' */ | ||
418 | adjustresults(L, ci->nresults); | ||
419 | /* call continuation function */ | ||
420 | if (!(ci->callstatus & CIST_STAT)) /* no call status? */ | ||
421 | ci->u.c.status = LUA_YIELD; /* 'default' status */ | ||
422 | lua_assert(ci->u.c.status != LUA_OK); | ||
423 | ci->callstatus = (ci->callstatus & ~(CIST_YPCALL | CIST_STAT)) | CIST_YIELDED; | ||
424 | lua_unlock(L); | ||
425 | n = (*ci->u.c.k)(L); | ||
426 | lua_lock(L); | ||
427 | api_checknelems(L, n); | ||
428 | /* finish 'luaD_precall' */ | ||
429 | luaD_poscall(L, L->top - n); | ||
430 | } | ||
431 | |||
432 | |||
433 | static void unroll (lua_State *L, void *ud) { | ||
434 | UNUSED(ud); | ||
435 | for (;;) { | ||
436 | if (L->ci == &L->base_ci) /* stack is empty? */ | ||
437 | return; /* coroutine finished normally */ | ||
438 | if (!isLua(L->ci)) /* C function? */ | ||
439 | finishCcall(L); | ||
440 | else { /* Lua function */ | ||
441 | luaV_finishOp(L); /* finish interrupted instruction */ | ||
442 | luaV_execute(L); /* execute down to higher C 'boundary' */ | ||
443 | } | ||
444 | } | ||
445 | } | ||
446 | |||
447 | |||
448 | /* | ||
449 | ** check whether thread has a suspended protected call | ||
450 | */ | ||
451 | static CallInfo *findpcall (lua_State *L) { | ||
452 | CallInfo *ci; | ||
453 | for (ci = L->ci; ci != NULL; ci = ci->previous) { /* search for a pcall */ | ||
454 | if (ci->callstatus & CIST_YPCALL) | ||
455 | return ci; | ||
456 | } | ||
457 | return NULL; /* no pending pcall */ | ||
458 | } | ||
459 | |||
460 | |||
461 | static int recover (lua_State *L, int status) { | ||
462 | StkId oldtop; | ||
463 | CallInfo *ci = findpcall(L); | ||
464 | if (ci == NULL) return 0; /* no recovery point */ | ||
465 | /* "finish" luaD_pcall */ | ||
466 | oldtop = restorestack(L, ci->extra); | ||
467 | luaF_close(L, oldtop); | ||
468 | seterrorobj(L, status, oldtop); | ||
469 | L->ci = ci; | ||
470 | L->allowhook = ci->u.c.old_allowhook; | ||
471 | L->nny = 0; /* should be zero to be yieldable */ | ||
472 | luaD_shrinkstack(L); | ||
473 | L->errfunc = ci->u.c.old_errfunc; | ||
474 | ci->callstatus |= CIST_STAT; /* call has error status */ | ||
475 | ci->u.c.status = status; /* (here it is) */ | ||
476 | return 1; /* continue running the coroutine */ | ||
477 | } | ||
478 | |||
479 | |||
480 | /* | ||
481 | ** signal an error in the call to 'resume', not in the execution of the | ||
482 | ** coroutine itself. (Such errors should not be handled by any coroutine | ||
483 | ** error handler and should not kill the coroutine.) | ||
484 | */ | ||
485 | static l_noret resume_error (lua_State *L, const char *msg, StkId firstArg) { | ||
486 | L->top = firstArg; /* remove args from the stack */ | ||
487 | setsvalue2s(L, L->top, luaS_new(L, msg)); /* push error message */ | ||
488 | api_incr_top(L); | ||
489 | luaD_throw(L, -1); /* jump back to 'lua_resume' */ | ||
490 | } | ||
491 | |||
492 | |||
493 | /* | ||
494 | ** do the work for 'lua_resume' in protected mode | ||
495 | */ | ||
496 | static void resume (lua_State *L, void *ud) { | 383 | static void resume (lua_State *L, void *ud) { |
497 | int nCcalls = L->nCcalls; | ||
498 | StkId firstArg = cast(StkId, ud); | 384 | StkId firstArg = cast(StkId, ud); |
499 | CallInfo *ci = L->ci; | 385 | CallInfo *ci = L->ci; |
500 | if (nCcalls >= LUAI_MAXCCALLS) | 386 | if (L->status == 0) { /* start coroutine? */ |
501 | resume_error(L, "C stack overflow", firstArg); | 387 | lua_assert(ci == L->base_ci && firstArg > L->base); |
502 | if (L->status == LUA_OK) { /* may be starting a coroutine */ | 388 | if (luaD_precall(L, firstArg - 1, LUA_MULTRET) != PCRLUA) |
503 | if (ci != &L->base_ci) /* not in base level? */ | 389 | return; |
504 | resume_error(L, "cannot resume non-suspended coroutine", firstArg); | ||
505 | /* coroutine is in base level; start running it */ | ||
506 | if (!luaD_precall(L, firstArg - 1, LUA_MULTRET)) /* Lua function? */ | ||
507 | luaV_execute(L); /* call it */ | ||
508 | } | 390 | } |
509 | else if (L->status != LUA_YIELD) | ||
510 | resume_error(L, "cannot resume dead coroutine", firstArg); | ||
511 | else { /* resuming from previous yield */ | 391 | else { /* resuming from previous yield */ |
512 | L->status = LUA_OK; | 392 | lua_assert(L->status == LUA_YIELD); |
513 | ci->func = restorestack(L, ci->extra); | 393 | L->status = 0; |
514 | if (isLua(ci)) /* yielded inside a hook? */ | 394 | if (!f_isLua(ci)) { /* `common' yield? */ |
515 | luaV_execute(L); /* just continue running Lua code */ | 395 | /* finish interrupted execution of `OP_CALL' */ |
516 | else { /* 'common' yield */ | 396 | lua_assert(GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_CALL || |
517 | if (ci->u.c.k != NULL) { /* does it have a continuation? */ | 397 | GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_TAILCALL); |
518 | int n; | 398 | if (luaD_poscall(L, firstArg)) /* complete it... */ |
519 | ci->u.c.status = LUA_YIELD; /* 'default' status */ | 399 | L->top = L->ci->top; /* and correct top if not multiple results */ |
520 | ci->callstatus |= CIST_YIELDED; | ||
521 | lua_unlock(L); | ||
522 | n = (*ci->u.c.k)(L); /* call continuation */ | ||
523 | lua_lock(L); | ||
524 | api_checknelems(L, n); | ||
525 | firstArg = L->top - n; /* yield results come from continuation */ | ||
526 | } | ||
527 | luaD_poscall(L, firstArg); /* finish 'luaD_precall' */ | ||
528 | } | 400 | } |
529 | unroll(L, NULL); | 401 | else /* yielded inside a hook: just continue its execution */ |
402 | L->base = L->ci->base; | ||
530 | } | 403 | } |
531 | lua_assert(nCcalls == L->nCcalls); | 404 | luaV_execute(L, cast_int(L->ci - L->base_ci)); |
405 | } | ||
406 | |||
407 | |||
408 | static int resume_error (lua_State *L, const char *msg) { | ||
409 | L->top = L->ci->base; | ||
410 | setsvalue2s(L, L->top, luaS_new(L, msg)); | ||
411 | incr_top(L); | ||
412 | lua_unlock(L); | ||
413 | return LUA_ERRRUN; | ||
532 | } | 414 | } |
533 | 415 | ||
534 | 416 | ||
535 | LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs) { | 417 | LUA_API int lua_resume (lua_State *L, int nargs) { |
536 | int status; | 418 | int status; |
537 | int oldnny = L->nny; /* save 'nny' */ | ||
538 | lua_lock(L); | 419 | lua_lock(L); |
420 | if (L->status != LUA_YIELD && (L->status != 0 || L->ci != L->base_ci)) | ||
421 | return resume_error(L, "cannot resume non-suspended coroutine"); | ||
422 | if (L->nCcalls >= LUAI_MAXCCALLS) | ||
423 | return resume_error(L, "C stack overflow"); | ||
539 | luai_userstateresume(L, nargs); | 424 | luai_userstateresume(L, nargs); |
540 | L->nCcalls = (from) ? from->nCcalls + 1 : 1; | 425 | lua_assert(L->errfunc == 0); |
541 | L->nny = 0; /* allow yields */ | 426 | L->baseCcalls = ++L->nCcalls; |
542 | api_checknelems(L, (L->status == LUA_OK) ? nargs + 1 : nargs); | ||
543 | status = luaD_rawrunprotected(L, resume, L->top - nargs); | 427 | status = luaD_rawrunprotected(L, resume, L->top - nargs); |
544 | if (status == -1) /* error calling 'lua_resume'? */ | 428 | if (status != 0) { /* error? */ |
545 | status = LUA_ERRRUN; | 429 | L->status = cast_byte(status); /* mark thread as `dead' */ |
546 | else { /* yield or regular error */ | 430 | luaD_seterrorobj(L, status, L->top); |
547 | while (status != LUA_OK && status != LUA_YIELD) { /* error? */ | 431 | L->ci->top = L->top; |
548 | if (recover(L, status)) /* recover point? */ | ||
549 | status = luaD_rawrunprotected(L, unroll, NULL); /* run continuation */ | ||
550 | else { /* unrecoverable error */ | ||
551 | L->status = cast_byte(status); /* mark thread as `dead' */ | ||
552 | seterrorobj(L, status, L->top); | ||
553 | L->ci->top = L->top; | ||
554 | break; | ||
555 | } | ||
556 | } | ||
557 | lua_assert(status == L->status); | ||
558 | } | 432 | } |
559 | L->nny = oldnny; /* restore 'nny' */ | 433 | else { |
560 | L->nCcalls--; | 434 | lua_assert(L->nCcalls == L->baseCcalls); |
561 | lua_assert(L->nCcalls == ((from) ? from->nCcalls : 0)); | 435 | status = L->status; |
436 | } | ||
437 | --L->nCcalls; | ||
562 | lua_unlock(L); | 438 | lua_unlock(L); |
563 | return status; | 439 | return status; |
564 | } | 440 | } |
565 | 441 | ||
566 | 442 | ||
567 | LUA_API int lua_yieldk (lua_State *L, int nresults, int ctx, lua_CFunction k) { | 443 | LUA_API int lua_yield (lua_State *L, int nresults) { |
568 | CallInfo *ci = L->ci; | ||
569 | luai_userstateyield(L, nresults); | 444 | luai_userstateyield(L, nresults); |
570 | lua_lock(L); | 445 | lua_lock(L); |
571 | api_checknelems(L, nresults); | 446 | if (L->nCcalls > L->baseCcalls) |
572 | if (L->nny > 0) { | 447 | luaG_runerror(L, "attempt to yield across metamethod/C-call boundary"); |
573 | if (L != G(L)->mainthread) | 448 | L->base = L->top - nresults; /* protect stack slots below */ |
574 | luaG_runerror(L, "attempt to yield across a C-call boundary"); | ||
575 | else | ||
576 | luaG_runerror(L, "attempt to yield from outside a coroutine"); | ||
577 | } | ||
578 | L->status = LUA_YIELD; | 449 | L->status = LUA_YIELD; |
579 | ci->extra = savestack(L, ci->func); /* save current 'func' */ | ||
580 | if (isLua(ci)) { /* inside a hook? */ | ||
581 | api_check(L, k == NULL, "hooks cannot continue after yielding"); | ||
582 | } | ||
583 | else { | ||
584 | if ((ci->u.c.k = k) != NULL) /* is there a continuation? */ | ||
585 | ci->u.c.ctx = ctx; /* save context */ | ||
586 | ci->func = L->top - nresults - 1; /* protect stack below results */ | ||
587 | luaD_throw(L, LUA_YIELD); | ||
588 | } | ||
589 | lua_assert(ci->callstatus & CIST_HOOKED); /* must be inside a hook */ | ||
590 | lua_unlock(L); | 450 | lua_unlock(L); |
591 | return 0; /* return to 'luaD_hook' */ | 451 | return -1; |
592 | } | 452 | } |
593 | 453 | ||
594 | 454 | ||
595 | int luaD_pcall (lua_State *L, Pfunc func, void *u, | 455 | int luaD_pcall (lua_State *L, Pfunc func, void *u, |
596 | ptrdiff_t old_top, ptrdiff_t ef) { | 456 | ptrdiff_t old_top, ptrdiff_t ef) { |
597 | int status; | 457 | int status; |
598 | CallInfo *old_ci = L->ci; | 458 | unsigned short oldnCcalls = L->nCcalls; |
459 | ptrdiff_t old_ci = saveci(L, L->ci); | ||
599 | lu_byte old_allowhooks = L->allowhook; | 460 | lu_byte old_allowhooks = L->allowhook; |
600 | unsigned short old_nny = L->nny; | ||
601 | ptrdiff_t old_errfunc = L->errfunc; | 461 | ptrdiff_t old_errfunc = L->errfunc; |
602 | L->errfunc = ef; | 462 | L->errfunc = ef; |
603 | status = luaD_rawrunprotected(L, func, u); | 463 | status = luaD_rawrunprotected(L, func, u); |
604 | if (status != LUA_OK) { /* an error occurred? */ | 464 | if (status != 0) { /* an error occurred? */ |
605 | StkId oldtop = restorestack(L, old_top); | 465 | StkId oldtop = restorestack(L, old_top); |
606 | luaF_close(L, oldtop); /* close possible pending closures */ | 466 | luaF_close(L, oldtop); /* close eventual pending closures */ |
607 | seterrorobj(L, status, oldtop); | 467 | luaD_seterrorobj(L, status, oldtop); |
608 | L->ci = old_ci; | 468 | L->nCcalls = oldnCcalls; |
469 | L->ci = restoreci(L, old_ci); | ||
470 | L->base = L->ci->base; | ||
471 | L->savedpc = L->ci->savedpc; | ||
609 | L->allowhook = old_allowhooks; | 472 | L->allowhook = old_allowhooks; |
610 | L->nny = old_nny; | 473 | restore_stack_limit(L); |
611 | luaD_shrinkstack(L); | ||
612 | } | 474 | } |
613 | L->errfunc = old_errfunc; | 475 | L->errfunc = old_errfunc; |
614 | return status; | 476 | return status; |
@@ -621,60 +483,35 @@ int luaD_pcall (lua_State *L, Pfunc func, void *u, | |||
621 | */ | 483 | */ |
622 | struct SParser { /* data to `f_parser' */ | 484 | struct SParser { /* data to `f_parser' */ |
623 | ZIO *z; | 485 | ZIO *z; |
624 | Mbuffer buff; /* dynamic structure used by the scanner */ | 486 | Mbuffer buff; /* buffer to be used by the scanner */ |
625 | Dyndata dyd; /* dynamic structures used by the parser */ | ||
626 | const char *mode; | ||
627 | const char *name; | 487 | const char *name; |
628 | }; | 488 | }; |
629 | 489 | ||
630 | |||
631 | static void checkmode (lua_State *L, const char *mode, const char *x) { | ||
632 | if (mode && strchr(mode, x[0]) == NULL) { | ||
633 | luaO_pushfstring(L, | ||
634 | "attempt to load a %s chunk (mode is " LUA_QS ")", x, mode); | ||
635 | luaD_throw(L, LUA_ERRSYNTAX); | ||
636 | } | ||
637 | } | ||
638 | |||
639 | |||
640 | static void f_parser (lua_State *L, void *ud) { | 490 | static void f_parser (lua_State *L, void *ud) { |
641 | int i; | 491 | int i; |
492 | Proto *tf; | ||
642 | Closure *cl; | 493 | Closure *cl; |
643 | struct SParser *p = cast(struct SParser *, ud); | 494 | struct SParser *p = cast(struct SParser *, ud); |
644 | int c = zgetc(p->z); /* read first character */ | 495 | int c = luaZ_lookahead(p->z); |
645 | if (c == LUA_SIGNATURE[0]) { | 496 | luaC_checkGC(L); |
646 | checkmode(L, p->mode, "binary"); | 497 | tf = ((c == LUA_SIGNATURE[0]) ? luaU_undump : luaY_parser)(L, p->z, |
647 | cl = luaU_undump(L, p->z, &p->buff, p->name); | 498 | &p->buff, p->name); |
648 | } | 499 | cl = luaF_newLclosure(L, tf->nups, hvalue(gt(L))); |
649 | else { | 500 | cl->l.p = tf; |
650 | checkmode(L, p->mode, "text"); | 501 | for (i = 0; i < tf->nups; i++) /* initialize eventual upvalues */ |
651 | cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); | 502 | cl->l.upvals[i] = luaF_newupval(L); |
652 | } | 503 | setclvalue(L, L->top, cl); |
653 | lua_assert(cl->l.nupvalues == cl->l.p->sizeupvalues); | 504 | incr_top(L); |
654 | for (i = 0; i < cl->l.nupvalues; i++) { /* initialize upvalues */ | ||
655 | UpVal *up = luaF_newupval(L); | ||
656 | cl->l.upvals[i] = up; | ||
657 | luaC_objbarrier(L, cl, up); | ||
658 | } | ||
659 | } | 505 | } |
660 | 506 | ||
661 | 507 | ||
662 | int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, | 508 | int luaD_protectedparser (lua_State *L, ZIO *z, const char *name) { |
663 | const char *mode) { | ||
664 | struct SParser p; | 509 | struct SParser p; |
665 | int status; | 510 | int status; |
666 | L->nny++; /* cannot yield during parsing */ | 511 | p.z = z; p.name = name; |
667 | p.z = z; p.name = name; p.mode = mode; | ||
668 | p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; | ||
669 | p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; | ||
670 | p.dyd.label.arr = NULL; p.dyd.label.size = 0; | ||
671 | luaZ_initbuffer(L, &p.buff); | 512 | luaZ_initbuffer(L, &p.buff); |
672 | status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc); | 513 | status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc); |
673 | luaZ_freebuffer(L, &p.buff); | 514 | luaZ_freebuffer(L, &p.buff); |
674 | luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); | ||
675 | luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); | ||
676 | luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); | ||
677 | L->nny--; | ||
678 | return status; | 515 | return status; |
679 | } | 516 | } |
680 | 517 | ||