/src/testdir/build/lua-master/source/lvm.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | ** $Id: lvm.c $ |
3 | | ** Lua virtual machine |
4 | | ** See Copyright Notice in lua.h |
5 | | */ |
6 | | |
7 | | #define lvm_c |
8 | | #define LUA_CORE |
9 | | |
10 | | #include "lprefix.h" |
11 | | |
12 | | #include <float.h> |
13 | | #include <limits.h> |
14 | | #include <math.h> |
15 | | #include <stdio.h> |
16 | | #include <stdlib.h> |
17 | | #include <string.h> |
18 | | |
19 | | #include "lua.h" |
20 | | |
21 | | #include "ldebug.h" |
22 | | #include "ldo.h" |
23 | | #include "lfunc.h" |
24 | | #include "lgc.h" |
25 | | #include "lobject.h" |
26 | | #include "lopcodes.h" |
27 | | #include "lstate.h" |
28 | | #include "lstring.h" |
29 | | #include "ltable.h" |
30 | | #include "ltm.h" |
31 | | #include "lvm.h" |
32 | | |
33 | | |
34 | | /* |
35 | | ** By default, use jump tables in the main interpreter loop on gcc |
36 | | ** and compatible compilers. |
37 | | */ |
38 | | #if !defined(LUA_USE_JUMPTABLE) |
39 | | #if defined(__GNUC__) |
40 | | #define LUA_USE_JUMPTABLE 1 |
41 | | #else |
42 | | #define LUA_USE_JUMPTABLE 0 |
43 | | #endif |
44 | | #endif |
45 | | |
46 | | |
47 | | |
48 | | /* limit for table tag-method chains (to avoid infinite loops) */ |
49 | 265 | #define MAXTAGLOOP 2000 |
50 | | |
51 | | |
52 | | /* |
53 | | ** 'l_intfitsf' checks whether a given integer is in the range that |
54 | | ** can be converted to a float without rounding. Used in comparisons. |
55 | | */ |
56 | | |
57 | | /* number of bits in the mantissa of a float */ |
58 | 0 | #define NBM (l_floatatt(MANT_DIG)) |
59 | | |
60 | | /* |
61 | | ** Check whether some integers may not fit in a float, testing whether |
62 | | ** (maxinteger >> NBM) > 0. (That implies (1 << NBM) <= maxinteger.) |
63 | | ** (The shifts are done in parts, to avoid shifting by more than the size |
64 | | ** of an integer. In a worst case, NBM == 113 for long double and |
65 | | ** sizeof(long) == 32.) |
66 | | */ |
67 | | #if ((((LUA_MAXINTEGER >> (NBM / 4)) >> (NBM / 4)) >> (NBM / 4)) \ |
68 | | >> (NBM - (3 * (NBM / 4)))) > 0 |
69 | | |
70 | | /* limit for integers that fit in a float */ |
71 | 0 | #define MAXINTFITSF ((lua_Unsigned)1 << NBM) |
72 | | |
73 | | /* check whether 'i' is in the interval [-MAXINTFITSF, MAXINTFITSF] */ |
74 | 0 | #define l_intfitsf(i) ((MAXINTFITSF + l_castS2U(i)) <= (2 * MAXINTFITSF)) |
75 | | |
76 | | #else /* all integers fit in a float precisely */ |
77 | | |
78 | | #define l_intfitsf(i) 1 |
79 | | |
80 | | #endif |
81 | | |
82 | | |
83 | | /* |
84 | | ** Try to convert a value from string to a number value. |
85 | | ** If the value is not a string or is a string not representing |
86 | | ** a valid numeral (or if coercions from strings to numbers |
87 | | ** are disabled via macro 'cvt2num'), do not modify 'result' |
88 | | ** and return 0. |
89 | | */ |
90 | 0 | static int l_strton (const TValue *obj, TValue *result) { |
91 | 0 | lua_assert(obj != result); |
92 | 0 | if (!cvt2num(obj)) /* is object not a string? */ |
93 | 0 | return 0; |
94 | 0 | else { |
95 | 0 | TString *st = tsvalue(obj); |
96 | 0 | return (luaO_str2num(getstr(st), result) == tsslen(st) + 1); |
97 | 0 | } |
98 | 0 | } |
99 | | |
100 | | |
101 | | /* |
102 | | ** Try to convert a value to a float. The float case is already handled |
103 | | ** by the macro 'tonumber'. |
104 | | */ |
105 | 0 | int luaV_tonumber_ (const TValue *obj, lua_Number *n) { |
106 | 0 | TValue v; |
107 | 0 | if (ttisinteger(obj)) { |
108 | 0 | *n = cast_num(ivalue(obj)); |
109 | 0 | return 1; |
110 | 0 | } |
111 | 0 | else if (l_strton(obj, &v)) { /* string coercible to number? */ |
112 | 0 | *n = nvalue(&v); /* convert result of 'luaO_str2num' to a float */ |
113 | 0 | return 1; |
114 | 0 | } |
115 | 0 | else |
116 | 0 | return 0; /* conversion failed */ |
117 | 0 | } |
118 | | |
119 | | |
120 | | /* |
121 | | ** try to convert a float to an integer, rounding according to 'mode'. |
122 | | */ |
123 | 0 | int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode) { |
124 | 0 | lua_Number f = l_floor(n); |
125 | 0 | if (n != f) { /* not an integral value? */ |
126 | 0 | if (mode == F2Ieq) return 0; /* fails if mode demands integral value */ |
127 | 0 | else if (mode == F2Iceil) /* needs ceil? */ |
128 | 0 | f += 1; /* convert floor to ceil (remember: n != f) */ |
129 | 0 | } |
130 | 0 | return lua_numbertointeger(f, p); |
131 | 0 | } |
132 | | |
133 | | |
134 | | /* |
135 | | ** try to convert a value to an integer, rounding according to 'mode', |
136 | | ** without string coercion. |
137 | | ** ("Fast track" handled by macro 'tointegerns'.) |
138 | | */ |
139 | 0 | int luaV_tointegerns (const TValue *obj, lua_Integer *p, F2Imod mode) { |
140 | 0 | if (ttisfloat(obj)) |
141 | 0 | return luaV_flttointeger(fltvalue(obj), p, mode); |
142 | 0 | else if (ttisinteger(obj)) { |
143 | 0 | *p = ivalue(obj); |
144 | 0 | return 1; |
145 | 0 | } |
146 | 0 | else |
147 | 0 | return 0; |
148 | 0 | } |
149 | | |
150 | | |
151 | | /* |
152 | | ** try to convert a value to an integer. |
153 | | */ |
154 | 0 | int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode) { |
155 | 0 | TValue v; |
156 | 0 | if (l_strton(obj, &v)) /* does 'obj' point to a numerical string? */ |
157 | 0 | obj = &v; /* change it to point to its corresponding number */ |
158 | 0 | return luaV_tointegerns(obj, p, mode); |
159 | 0 | } |
160 | | |
161 | | |
162 | | /* |
163 | | ** Try to convert a 'for' limit to an integer, preserving the semantics |
164 | | ** of the loop. Return true if the loop must not run; otherwise, '*p' |
165 | | ** gets the integer limit. |
166 | | ** (The following explanation assumes a positive step; it is valid for |
167 | | ** negative steps mutatis mutandis.) |
168 | | ** If the limit is an integer or can be converted to an integer, |
169 | | ** rounding down, that is the limit. |
170 | | ** Otherwise, check whether the limit can be converted to a float. If |
171 | | ** the float is too large, clip it to LUA_MAXINTEGER. If the float |
172 | | ** is too negative, the loop should not run, because any initial |
173 | | ** integer value is greater than such limit; so, the function returns |
174 | | ** true to signal that. (For this latter case, no integer limit would be |
175 | | ** correct; even a limit of LUA_MININTEGER would run the loop once for |
176 | | ** an initial value equal to LUA_MININTEGER.) |
177 | | */ |
178 | | static int forlimit (lua_State *L, lua_Integer init, const TValue *lim, |
179 | 0 | lua_Integer *p, lua_Integer step) { |
180 | 0 | if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) { |
181 | | /* not coercible to in integer */ |
182 | 0 | lua_Number flim; /* try to convert to float */ |
183 | 0 | if (!tonumber(lim, &flim)) /* cannot convert to float? */ |
184 | 0 | luaG_forerror(L, lim, "limit"); |
185 | | /* else 'flim' is a float out of integer bounds */ |
186 | 0 | if (luai_numlt(0, flim)) { /* if it is positive, it is too large */ |
187 | 0 | if (step < 0) return 1; /* initial value must be less than it */ |
188 | 0 | *p = LUA_MAXINTEGER; /* truncate */ |
189 | 0 | } |
190 | 0 | else { /* it is less than min integer */ |
191 | 0 | if (step > 0) return 1; /* initial value must be greater than it */ |
192 | 0 | *p = LUA_MININTEGER; /* truncate */ |
193 | 0 | } |
194 | 0 | } |
195 | 0 | return (step > 0 ? init > *p : init < *p); /* not to run? */ |
196 | 0 | } |
197 | | |
198 | | |
199 | | /* |
200 | | ** Prepare a numerical for loop (opcode OP_FORPREP). |
201 | | ** Return true to skip the loop. Otherwise, |
202 | | ** after preparation, stack will be as follows: |
203 | | ** ra : internal index (safe copy of the control variable) |
204 | | ** ra + 1 : loop counter (integer loops) or limit (float loops) |
205 | | ** ra + 2 : step |
206 | | ** ra + 3 : control variable |
207 | | */ |
208 | 0 | static int forprep (lua_State *L, StkId ra) { |
209 | 0 | TValue *pinit = s2v(ra); |
210 | 0 | TValue *plimit = s2v(ra + 1); |
211 | 0 | TValue *pstep = s2v(ra + 2); |
212 | 0 | if (ttisinteger(pinit) && ttisinteger(pstep)) { /* integer loop? */ |
213 | 0 | lua_Integer init = ivalue(pinit); |
214 | 0 | lua_Integer step = ivalue(pstep); |
215 | 0 | lua_Integer limit; |
216 | 0 | if (step == 0) |
217 | 0 | luaG_runerror(L, "'for' step is zero"); |
218 | 0 | setivalue(s2v(ra + 3), init); /* control variable */ |
219 | 0 | if (forlimit(L, init, plimit, &limit, step)) |
220 | 0 | return 1; /* skip the loop */ |
221 | 0 | else { /* prepare loop counter */ |
222 | 0 | lua_Unsigned count; |
223 | 0 | if (step > 0) { /* ascending loop? */ |
224 | 0 | count = l_castS2U(limit) - l_castS2U(init); |
225 | 0 | if (step != 1) /* avoid division in the too common case */ |
226 | 0 | count /= l_castS2U(step); |
227 | 0 | } |
228 | 0 | else { /* step < 0; descending loop */ |
229 | 0 | count = l_castS2U(init) - l_castS2U(limit); |
230 | | /* 'step+1' avoids negating 'mininteger' */ |
231 | 0 | count /= l_castS2U(-(step + 1)) + 1u; |
232 | 0 | } |
233 | | /* store the counter in place of the limit (which won't be |
234 | | needed anymore) */ |
235 | 0 | setivalue(plimit, l_castU2S(count)); |
236 | 0 | } |
237 | 0 | } |
238 | 0 | else { /* try making all values floats */ |
239 | 0 | lua_Number init; lua_Number limit; lua_Number step; |
240 | 0 | if (l_unlikely(!tonumber(plimit, &limit))) |
241 | 0 | luaG_forerror(L, plimit, "limit"); |
242 | 0 | if (l_unlikely(!tonumber(pstep, &step))) |
243 | 0 | luaG_forerror(L, pstep, "step"); |
244 | 0 | if (l_unlikely(!tonumber(pinit, &init))) |
245 | 0 | luaG_forerror(L, pinit, "initial value"); |
246 | 0 | if (step == 0) |
247 | 0 | luaG_runerror(L, "'for' step is zero"); |
248 | 0 | if (luai_numlt(0, step) ? luai_numlt(limit, init) |
249 | 0 | : luai_numlt(init, limit)) |
250 | 0 | return 1; /* skip the loop */ |
251 | 0 | else { |
252 | | /* make sure internal values are all floats */ |
253 | 0 | setfltvalue(plimit, limit); |
254 | 0 | setfltvalue(pstep, step); |
255 | 0 | setfltvalue(s2v(ra), init); /* internal index */ |
256 | 0 | setfltvalue(s2v(ra + 3), init); /* control variable */ |
257 | 0 | } |
258 | 0 | } |
259 | 0 | return 0; |
260 | 0 | } |
261 | | |
262 | | |
263 | | /* |
264 | | ** Execute a step of a float numerical for loop, returning |
265 | | ** true iff the loop must continue. (The integer case is |
266 | | ** written online with opcode OP_FORLOOP, for performance.) |
267 | | */ |
268 | 0 | static int floatforloop (StkId ra) { |
269 | 0 | lua_Number step = fltvalue(s2v(ra + 2)); |
270 | 0 | lua_Number limit = fltvalue(s2v(ra + 1)); |
271 | 0 | lua_Number idx = fltvalue(s2v(ra)); /* internal index */ |
272 | 0 | idx = luai_numadd(L, idx, step); /* increment index */ |
273 | 0 | if (luai_numlt(0, step) ? luai_numle(idx, limit) |
274 | 0 | : luai_numle(limit, idx)) { |
275 | 0 | chgfltvalue(s2v(ra), idx); /* update internal index */ |
276 | 0 | setfltvalue(s2v(ra + 3), idx); /* and control variable */ |
277 | 0 | return 1; /* jump back */ |
278 | 0 | } |
279 | 0 | else |
280 | 0 | return 0; /* finish the loop */ |
281 | 0 | } |
282 | | |
283 | | |
284 | | /* |
285 | | ** Finish the table access 'val = t[key]'. |
286 | | ** if 'slot' is NULL, 't' is not a table; otherwise, 'slot' points to |
287 | | ** t[k] entry (which must be empty). |
288 | | */ |
289 | | void luaV_finishget (lua_State *L, const TValue *t, TValue *key, StkId val, |
290 | 53 | const TValue *slot) { |
291 | 53 | int loop; /* counter to avoid infinite loops */ |
292 | 53 | const TValue *tm; /* metamethod */ |
293 | 53 | for (loop = 0; loop < MAXTAGLOOP; loop++) { |
294 | 53 | if (slot == NULL) { /* 't' is not a table? */ |
295 | 0 | lua_assert(!ttistable(t)); |
296 | 0 | tm = luaT_gettmbyobj(L, t, TM_INDEX); |
297 | 0 | if (l_unlikely(notm(tm))) |
298 | 0 | luaG_typeerror(L, t, "index"); /* no metamethod */ |
299 | | /* else will try the metamethod */ |
300 | 0 | } |
301 | 53 | else { /* 't' is a table */ |
302 | 53 | lua_assert(isempty(slot)); |
303 | 53 | tm = fasttm(L, hvalue(t)->metatable, TM_INDEX); /* table's metamethod */ |
304 | 53 | if (tm == NULL) { /* no metamethod? */ |
305 | 53 | setnilvalue(s2v(val)); /* result is nil */ |
306 | 53 | return; |
307 | 53 | } |
308 | | /* else will try the metamethod */ |
309 | 53 | } |
310 | 0 | if (ttisfunction(tm)) { /* is metamethod a function? */ |
311 | 0 | luaT_callTMres(L, tm, t, key, val); /* call it */ |
312 | 0 | return; |
313 | 0 | } |
314 | 0 | t = tm; /* else try to access 'tm[key]' */ |
315 | 0 | if (luaV_fastget(L, t, key, slot, luaH_get)) { /* fast track? */ |
316 | 0 | setobj2s(L, val, slot); /* done */ |
317 | 0 | return; |
318 | 0 | } |
319 | | /* else repeat (tail call 'luaV_finishget') */ |
320 | 0 | } |
321 | 0 | luaG_runerror(L, "'__index' chain too long; possible loop"); |
322 | 53 | } |
323 | | |
324 | | |
325 | | /* |
326 | | ** Finish a table assignment 't[key] = val'. |
327 | | ** If 'slot' is NULL, 't' is not a table. Otherwise, 'slot' points |
328 | | ** to the entry 't[key]', or to a value with an absent key if there |
329 | | ** is no such entry. (The value at 'slot' must be empty, otherwise |
330 | | ** 'luaV_fastget' would have done the job.) |
331 | | */ |
332 | | void luaV_finishset (lua_State *L, const TValue *t, TValue *key, |
333 | 212 | TValue *val, const TValue *slot) { |
334 | 212 | int loop; /* counter to avoid infinite loops */ |
335 | 212 | for (loop = 0; loop < MAXTAGLOOP; loop++) { |
336 | 212 | const TValue *tm; /* '__newindex' metamethod */ |
337 | 212 | if (slot != NULL) { /* is 't' a table? */ |
338 | 212 | Table *h = hvalue(t); /* save 't' table */ |
339 | 212 | lua_assert(isempty(slot)); /* slot must be empty */ |
340 | 212 | tm = fasttm(L, h->metatable, TM_NEWINDEX); /* get metamethod */ |
341 | 212 | if (tm == NULL) { /* no metamethod? */ |
342 | 212 | luaH_finishset(L, h, key, slot, val); /* set new value */ |
343 | 212 | invalidateTMcache(h); |
344 | 212 | luaC_barrierback(L, obj2gco(h), val); |
345 | 212 | return; |
346 | 212 | } |
347 | | /* else will try the metamethod */ |
348 | 212 | } |
349 | 0 | else { /* not a table; check metamethod */ |
350 | 0 | tm = luaT_gettmbyobj(L, t, TM_NEWINDEX); |
351 | 0 | if (l_unlikely(notm(tm))) |
352 | 0 | luaG_typeerror(L, t, "index"); |
353 | 0 | } |
354 | | /* try the metamethod */ |
355 | 0 | if (ttisfunction(tm)) { |
356 | 0 | luaT_callTM(L, tm, t, key, val); |
357 | 0 | return; |
358 | 0 | } |
359 | 0 | t = tm; /* else repeat assignment over 'tm' */ |
360 | 0 | if (luaV_fastget(L, t, key, slot, luaH_get)) { |
361 | 0 | luaV_finishfastset(L, t, slot, val); |
362 | 0 | return; /* done */ |
363 | 0 | } |
364 | | /* else 'return luaV_finishset(L, t, key, val, slot)' (loop) */ |
365 | 0 | } |
366 | 0 | luaG_runerror(L, "'__newindex' chain too long; possible loop"); |
367 | 212 | } |
368 | | |
369 | | |
370 | | /* |
371 | | ** Compare two strings 'ts1' x 'ts2', returning an integer less-equal- |
372 | | ** -greater than zero if 'ts1' is less-equal-greater than 'ts2'. |
373 | | ** The code is a little tricky because it allows '\0' in the strings |
374 | | ** and it uses 'strcoll' (to respect locales) for each segment |
375 | | ** of the strings. Note that segments can compare equal but still |
376 | | ** have different lengths. |
377 | | */ |
378 | 0 | static int l_strcmp (const TString *ts1, const TString *ts2) { |
379 | 0 | const char *s1 = getstr(ts1); |
380 | 0 | size_t rl1 = tsslen(ts1); /* real length */ |
381 | 0 | const char *s2 = getstr(ts2); |
382 | 0 | size_t rl2 = tsslen(ts2); |
383 | 0 | for (;;) { /* for each segment */ |
384 | 0 | int temp = strcoll(s1, s2); |
385 | 0 | if (temp != 0) /* not equal? */ |
386 | 0 | return temp; /* done */ |
387 | 0 | else { /* strings are equal up to a '\0' */ |
388 | 0 | size_t zl1 = strlen(s1); /* index of first '\0' in 's1' */ |
389 | 0 | size_t zl2 = strlen(s2); /* index of first '\0' in 's2' */ |
390 | 0 | if (zl2 == rl2) /* 's2' is finished? */ |
391 | 0 | return (zl1 == rl1) ? 0 : 1; /* check 's1' */ |
392 | 0 | else if (zl1 == rl1) /* 's1' is finished? */ |
393 | 0 | return -1; /* 's1' is less than 's2' ('s2' is not finished) */ |
394 | | /* both strings longer than 'zl'; go on comparing after the '\0' */ |
395 | 0 | zl1++; zl2++; |
396 | 0 | s1 += zl1; rl1 -= zl1; s2 += zl2; rl2 -= zl2; |
397 | 0 | } |
398 | 0 | } |
399 | 0 | } |
400 | | |
401 | | |
402 | | /* |
403 | | ** Check whether integer 'i' is less than float 'f'. If 'i' has an |
404 | | ** exact representation as a float ('l_intfitsf'), compare numbers as |
405 | | ** floats. Otherwise, use the equivalence 'i < f <=> i < ceil(f)'. |
406 | | ** If 'ceil(f)' is out of integer range, either 'f' is greater than |
407 | | ** all integers or less than all integers. |
408 | | ** (The test with 'l_intfitsf' is only for performance; the else |
409 | | ** case is correct for all values, but it is slow due to the conversion |
410 | | ** from float to int.) |
411 | | ** When 'f' is NaN, comparisons must result in false. |
412 | | */ |
413 | 0 | l_sinline int LTintfloat (lua_Integer i, lua_Number f) { |
414 | 0 | if (l_intfitsf(i)) |
415 | 0 | return luai_numlt(cast_num(i), f); /* compare them as floats */ |
416 | 0 | else { /* i < f <=> i < ceil(f) */ |
417 | 0 | lua_Integer fi; |
418 | 0 | if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ |
419 | 0 | return i < fi; /* compare them as integers */ |
420 | 0 | else /* 'f' is either greater or less than all integers */ |
421 | 0 | return f > 0; /* greater? */ |
422 | 0 | } |
423 | 0 | } |
424 | | |
425 | | |
426 | | /* |
427 | | ** Check whether integer 'i' is less than or equal to float 'f'. |
428 | | ** See comments on previous function. |
429 | | */ |
430 | 0 | l_sinline int LEintfloat (lua_Integer i, lua_Number f) { |
431 | 0 | if (l_intfitsf(i)) |
432 | 0 | return luai_numle(cast_num(i), f); /* compare them as floats */ |
433 | 0 | else { /* i <= f <=> i <= floor(f) */ |
434 | 0 | lua_Integer fi; |
435 | 0 | if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ |
436 | 0 | return i <= fi; /* compare them as integers */ |
437 | 0 | else /* 'f' is either greater or less than all integers */ |
438 | 0 | return f > 0; /* greater? */ |
439 | 0 | } |
440 | 0 | } |
441 | | |
442 | | |
443 | | /* |
444 | | ** Check whether float 'f' is less than integer 'i'. |
445 | | ** See comments on previous function. |
446 | | */ |
447 | 0 | l_sinline int LTfloatint (lua_Number f, lua_Integer i) { |
448 | 0 | if (l_intfitsf(i)) |
449 | 0 | return luai_numlt(f, cast_num(i)); /* compare them as floats */ |
450 | 0 | else { /* f < i <=> floor(f) < i */ |
451 | 0 | lua_Integer fi; |
452 | 0 | if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ |
453 | 0 | return fi < i; /* compare them as integers */ |
454 | 0 | else /* 'f' is either greater or less than all integers */ |
455 | 0 | return f < 0; /* less? */ |
456 | 0 | } |
457 | 0 | } |
458 | | |
459 | | |
460 | | /* |
461 | | ** Check whether float 'f' is less than or equal to integer 'i'. |
462 | | ** See comments on previous function. |
463 | | */ |
464 | 0 | l_sinline int LEfloatint (lua_Number f, lua_Integer i) { |
465 | 0 | if (l_intfitsf(i)) |
466 | 0 | return luai_numle(f, cast_num(i)); /* compare them as floats */ |
467 | 0 | else { /* f <= i <=> ceil(f) <= i */ |
468 | 0 | lua_Integer fi; |
469 | 0 | if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ |
470 | 0 | return fi <= i; /* compare them as integers */ |
471 | 0 | else /* 'f' is either greater or less than all integers */ |
472 | 0 | return f < 0; /* less? */ |
473 | 0 | } |
474 | 0 | } |
475 | | |
476 | | |
477 | | /* |
478 | | ** Return 'l < r', for numbers. |
479 | | */ |
480 | 0 | l_sinline int LTnum (const TValue *l, const TValue *r) { |
481 | 0 | lua_assert(ttisnumber(l) && ttisnumber(r)); |
482 | 0 | if (ttisinteger(l)) { |
483 | 0 | lua_Integer li = ivalue(l); |
484 | 0 | if (ttisinteger(r)) |
485 | 0 | return li < ivalue(r); /* both are integers */ |
486 | 0 | else /* 'l' is int and 'r' is float */ |
487 | 0 | return LTintfloat(li, fltvalue(r)); /* l < r ? */ |
488 | 0 | } |
489 | 0 | else { |
490 | 0 | lua_Number lf = fltvalue(l); /* 'l' must be float */ |
491 | 0 | if (ttisfloat(r)) |
492 | 0 | return luai_numlt(lf, fltvalue(r)); /* both are float */ |
493 | 0 | else /* 'l' is float and 'r' is int */ |
494 | 0 | return LTfloatint(lf, ivalue(r)); |
495 | 0 | } |
496 | 0 | } |
497 | | |
498 | | |
499 | | /* |
500 | | ** Return 'l <= r', for numbers. |
501 | | */ |
502 | 0 | l_sinline int LEnum (const TValue *l, const TValue *r) { |
503 | 0 | lua_assert(ttisnumber(l) && ttisnumber(r)); |
504 | 0 | if (ttisinteger(l)) { |
505 | 0 | lua_Integer li = ivalue(l); |
506 | 0 | if (ttisinteger(r)) |
507 | 0 | return li <= ivalue(r); /* both are integers */ |
508 | 0 | else /* 'l' is int and 'r' is float */ |
509 | 0 | return LEintfloat(li, fltvalue(r)); /* l <= r ? */ |
510 | 0 | } |
511 | 0 | else { |
512 | 0 | lua_Number lf = fltvalue(l); /* 'l' must be float */ |
513 | 0 | if (ttisfloat(r)) |
514 | 0 | return luai_numle(lf, fltvalue(r)); /* both are float */ |
515 | 0 | else /* 'l' is float and 'r' is int */ |
516 | 0 | return LEfloatint(lf, ivalue(r)); |
517 | 0 | } |
518 | 0 | } |
519 | | |
520 | | |
521 | | /* |
522 | | ** return 'l < r' for non-numbers. |
523 | | */ |
524 | 0 | static int lessthanothers (lua_State *L, const TValue *l, const TValue *r) { |
525 | 0 | lua_assert(!ttisnumber(l) || !ttisnumber(r)); |
526 | 0 | if (ttisstring(l) && ttisstring(r)) /* both are strings? */ |
527 | 0 | return l_strcmp(tsvalue(l), tsvalue(r)) < 0; |
528 | 0 | else |
529 | 0 | return luaT_callorderTM(L, l, r, TM_LT); |
530 | 0 | } |
531 | | |
532 | | |
533 | | /* |
534 | | ** Main operation less than; return 'l < r'. |
535 | | */ |
536 | 0 | int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { |
537 | 0 | if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ |
538 | 0 | return LTnum(l, r); |
539 | 0 | else return lessthanothers(L, l, r); |
540 | 0 | } |
541 | | |
542 | | |
543 | | /* |
544 | | ** return 'l <= r' for non-numbers. |
545 | | */ |
546 | 0 | static int lessequalothers (lua_State *L, const TValue *l, const TValue *r) { |
547 | 0 | lua_assert(!ttisnumber(l) || !ttisnumber(r)); |
548 | 0 | if (ttisstring(l) && ttisstring(r)) /* both are strings? */ |
549 | 0 | return l_strcmp(tsvalue(l), tsvalue(r)) <= 0; |
550 | 0 | else |
551 | 0 | return luaT_callorderTM(L, l, r, TM_LE); |
552 | 0 | } |
553 | | |
554 | | |
555 | | /* |
556 | | ** Main operation less than or equal to; return 'l <= r'. |
557 | | */ |
558 | 0 | int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { |
559 | 0 | if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ |
560 | 0 | return LEnum(l, r); |
561 | 0 | else return lessequalothers(L, l, r); |
562 | 0 | } |
563 | | |
564 | | |
565 | | /* |
566 | | ** Main operation for equality of Lua values; return 't1 == t2'. |
567 | | ** L == NULL means raw equality (no metamethods) |
568 | | */ |
569 | 0 | int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2) { |
570 | 0 | const TValue *tm; |
571 | 0 | if (ttypetag(t1) != ttypetag(t2)) { /* not the same variant? */ |
572 | 0 | if (ttype(t1) != ttype(t2) || ttype(t1) != LUA_TNUMBER) |
573 | 0 | return 0; /* only numbers can be equal with different variants */ |
574 | 0 | else { /* two numbers with different variants */ |
575 | | /* One of them is an integer. If the other does not have an |
576 | | integer value, they cannot be equal; otherwise, compare their |
577 | | integer values. */ |
578 | 0 | lua_Integer i1, i2; |
579 | 0 | return (luaV_tointegerns(t1, &i1, F2Ieq) && |
580 | 0 | luaV_tointegerns(t2, &i2, F2Ieq) && |
581 | 0 | i1 == i2); |
582 | 0 | } |
583 | 0 | } |
584 | | /* values have same type and same variant */ |
585 | 0 | switch (ttypetag(t1)) { |
586 | 0 | case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: return 1; |
587 | 0 | case LUA_VNUMINT: return (ivalue(t1) == ivalue(t2)); |
588 | 0 | case LUA_VNUMFLT: return luai_numeq(fltvalue(t1), fltvalue(t2)); |
589 | 0 | case LUA_VLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); |
590 | 0 | case LUA_VLCF: return fvalue(t1) == fvalue(t2); |
591 | 0 | case LUA_VSHRSTR: return eqshrstr(tsvalue(t1), tsvalue(t2)); |
592 | 0 | case LUA_VLNGSTR: return luaS_eqlngstr(tsvalue(t1), tsvalue(t2)); |
593 | 0 | case LUA_VUSERDATA: { |
594 | 0 | if (uvalue(t1) == uvalue(t2)) return 1; |
595 | 0 | else if (L == NULL) return 0; |
596 | 0 | tm = fasttm(L, uvalue(t1)->metatable, TM_EQ); |
597 | 0 | if (tm == NULL) |
598 | 0 | tm = fasttm(L, uvalue(t2)->metatable, TM_EQ); |
599 | 0 | break; /* will try TM */ |
600 | 0 | } |
601 | 0 | case LUA_VTABLE: { |
602 | 0 | if (hvalue(t1) == hvalue(t2)) return 1; |
603 | 0 | else if (L == NULL) return 0; |
604 | 0 | tm = fasttm(L, hvalue(t1)->metatable, TM_EQ); |
605 | 0 | if (tm == NULL) |
606 | 0 | tm = fasttm(L, hvalue(t2)->metatable, TM_EQ); |
607 | 0 | break; /* will try TM */ |
608 | 0 | } |
609 | 0 | default: |
610 | 0 | return gcvalue(t1) == gcvalue(t2); |
611 | 0 | } |
612 | 0 | if (tm == NULL) /* no TM? */ |
613 | 0 | return 0; /* objects are different */ |
614 | 0 | else { |
615 | 0 | luaT_callTMres(L, tm, t1, t2, L->top.p); /* call TM */ |
616 | 0 | return !l_isfalse(s2v(L->top.p)); |
617 | 0 | } |
618 | 0 | } |
619 | | |
620 | | |
621 | | /* macro used by 'luaV_concat' to ensure that element at 'o' is a string */ |
622 | | #define tostring(L,o) \ |
623 | 0 | (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) |
624 | | |
625 | 0 | #define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) |
626 | | |
627 | | /* copy strings in stack from top - n up to top - 1 to buffer */ |
628 | 0 | static void copy2buff (StkId top, int n, char *buff) { |
629 | 0 | size_t tl = 0; /* size already copied */ |
630 | 0 | do { |
631 | 0 | TString *st = tsvalue(s2v(top - n)); |
632 | 0 | size_t l = tsslen(st); /* length of string being copied */ |
633 | 0 | memcpy(buff + tl, getstr(st), l * sizeof(char)); |
634 | 0 | tl += l; |
635 | 0 | } while (--n > 0); |
636 | 0 | } |
637 | | |
638 | | |
639 | | /* |
640 | | ** Main operation for concatenation: concat 'total' values in the stack, |
641 | | ** from 'L->top.p - total' up to 'L->top.p - 1'. |
642 | | */ |
643 | 0 | void luaV_concat (lua_State *L, int total) { |
644 | 0 | if (total == 1) |
645 | 0 | return; /* "all" values already concatenated */ |
646 | 0 | do { |
647 | 0 | StkId top = L->top.p; |
648 | 0 | int n = 2; /* number of elements handled in this pass (at least 2) */ |
649 | 0 | if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || |
650 | 0 | !tostring(L, s2v(top - 1))) |
651 | 0 | luaT_tryconcatTM(L); /* may invalidate 'top' */ |
652 | 0 | else if (isemptystr(s2v(top - 1))) /* second operand is empty? */ |
653 | 0 | cast_void(tostring(L, s2v(top - 2))); /* result is first operand */ |
654 | 0 | else if (isemptystr(s2v(top - 2))) { /* first operand is empty string? */ |
655 | 0 | setobjs2s(L, top - 2, top - 1); /* result is second op. */ |
656 | 0 | } |
657 | 0 | else { |
658 | | /* at least two non-empty string values; get as many as possible */ |
659 | 0 | size_t tl = tsslen(tsvalue(s2v(top - 1))); |
660 | 0 | TString *ts; |
661 | | /* collect total length and number of strings */ |
662 | 0 | for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { |
663 | 0 | size_t l = tsslen(tsvalue(s2v(top - n - 1))); |
664 | 0 | if (l_unlikely(l >= (MAX_SIZE/sizeof(char)) - tl)) { |
665 | 0 | L->top.p = top - total; /* pop strings to avoid wasting stack */ |
666 | 0 | luaG_runerror(L, "string length overflow"); |
667 | 0 | } |
668 | 0 | tl += l; |
669 | 0 | } |
670 | 0 | if (tl <= LUAI_MAXSHORTLEN) { /* is result a short string? */ |
671 | 0 | char buff[LUAI_MAXSHORTLEN]; |
672 | 0 | copy2buff(top, n, buff); /* copy strings to buffer */ |
673 | 0 | ts = luaS_newlstr(L, buff, tl); |
674 | 0 | } |
675 | 0 | else { /* long string; copy strings directly to final result */ |
676 | 0 | ts = luaS_createlngstrobj(L, tl); |
677 | 0 | copy2buff(top, n, getlngstr(ts)); |
678 | 0 | } |
679 | 0 | setsvalue2s(L, top - n, ts); /* create result */ |
680 | 0 | } |
681 | 0 | total -= n - 1; /* got 'n' strings to create one new */ |
682 | 0 | L->top.p -= n - 1; /* popped 'n' strings and pushed one */ |
683 | 0 | } while (total > 1); /* repeat until only 1 result left */ |
684 | 0 | } |
685 | | |
686 | | |
687 | | /* |
688 | | ** Main operation 'ra = #rb'. |
689 | | */ |
690 | 0 | void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { |
691 | 0 | const TValue *tm; |
692 | 0 | switch (ttypetag(rb)) { |
693 | 0 | case LUA_VTABLE: { |
694 | 0 | Table *h = hvalue(rb); |
695 | 0 | tm = fasttm(L, h->metatable, TM_LEN); |
696 | 0 | if (tm) break; /* metamethod? break switch to call it */ |
697 | 0 | setivalue(s2v(ra), luaH_getn(h)); /* else primitive len */ |
698 | 0 | return; |
699 | 0 | } |
700 | 0 | case LUA_VSHRSTR: { |
701 | 0 | setivalue(s2v(ra), tsvalue(rb)->shrlen); |
702 | 0 | return; |
703 | 0 | } |
704 | 0 | case LUA_VLNGSTR: { |
705 | 0 | setivalue(s2v(ra), tsvalue(rb)->u.lnglen); |
706 | 0 | return; |
707 | 0 | } |
708 | 0 | default: { /* try metamethod */ |
709 | 0 | tm = luaT_gettmbyobj(L, rb, TM_LEN); |
710 | 0 | if (l_unlikely(notm(tm))) /* no metamethod? */ |
711 | 0 | luaG_typeerror(L, rb, "get length of"); |
712 | 0 | break; |
713 | 0 | } |
714 | 0 | } |
715 | 0 | luaT_callTMres(L, tm, rb, rb, ra); |
716 | 0 | } |
717 | | |
718 | | |
719 | | /* |
720 | | ** Integer division; return 'm // n', that is, floor(m/n). |
721 | | ** C division truncates its result (rounds towards zero). |
722 | | ** 'floor(q) == trunc(q)' when 'q >= 0' or when 'q' is integer, |
723 | | ** otherwise 'floor(q) == trunc(q) - 1'. |
724 | | */ |
725 | 0 | lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { |
726 | 0 | if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ |
727 | 0 | if (n == 0) |
728 | 0 | luaG_runerror(L, "attempt to divide by zero"); |
729 | 0 | return intop(-, 0, m); /* n==-1; avoid overflow with 0x80000...//-1 */ |
730 | 0 | } |
731 | 0 | else { |
732 | 0 | lua_Integer q = m / n; /* perform C division */ |
733 | 0 | if ((m ^ n) < 0 && m % n != 0) /* 'm/n' would be negative non-integer? */ |
734 | 0 | q -= 1; /* correct result for different rounding */ |
735 | 0 | return q; |
736 | 0 | } |
737 | 0 | } |
738 | | |
739 | | |
740 | | /* |
741 | | ** Integer modulus; return 'm % n'. (Assume that C '%' with |
742 | | ** negative operands follows C99 behavior. See previous comment |
743 | | ** about luaV_idiv.) |
744 | | */ |
745 | 0 | lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { |
746 | 0 | if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ |
747 | 0 | if (n == 0) |
748 | 0 | luaG_runerror(L, "attempt to perform 'n%%0'"); |
749 | 0 | return 0; /* m % -1 == 0; avoid overflow with 0x80000...%-1 */ |
750 | 0 | } |
751 | 0 | else { |
752 | 0 | lua_Integer r = m % n; |
753 | 0 | if (r != 0 && (r ^ n) < 0) /* 'm/n' would be non-integer negative? */ |
754 | 0 | r += n; /* correct result for different rounding */ |
755 | 0 | return r; |
756 | 0 | } |
757 | 0 | } |
758 | | |
759 | | |
760 | | /* |
761 | | ** Float modulus |
762 | | */ |
763 | 0 | lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { |
764 | 0 | lua_Number r; |
765 | 0 | luai_nummod(L, m, n, r); |
766 | 0 | return r; |
767 | 0 | } |
768 | | |
769 | | |
770 | | /* number of bits in an integer */ |
771 | 0 | #define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) |
772 | | |
773 | | |
774 | | /* |
775 | | ** Shift left operation. (Shift right just negates 'y'.) |
776 | | */ |
777 | 0 | lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { |
778 | 0 | if (y < 0) { /* shift right? */ |
779 | 0 | if (y <= -NBITS) return 0; |
780 | 0 | else return intop(>>, x, -y); |
781 | 0 | } |
782 | 0 | else { /* shift left */ |
783 | 0 | if (y >= NBITS) return 0; |
784 | 0 | else return intop(<<, x, y); |
785 | 0 | } |
786 | 0 | } |
787 | | |
788 | | |
789 | | /* |
790 | | ** create a new Lua closure, push it in the stack, and initialize |
791 | | ** its upvalues. |
792 | | */ |
793 | | static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, |
794 | 0 | StkId ra) { |
795 | 0 | int nup = p->sizeupvalues; |
796 | 0 | Upvaldesc *uv = p->upvalues; |
797 | 0 | int i; |
798 | 0 | LClosure *ncl = luaF_newLclosure(L, nup); |
799 | 0 | ncl->p = p; |
800 | 0 | setclLvalue2s(L, ra, ncl); /* anchor new closure in stack */ |
801 | 0 | for (i = 0; i < nup; i++) { /* fill in its upvalues */ |
802 | 0 | if (uv[i].instack) /* upvalue refers to local variable? */ |
803 | 0 | ncl->upvals[i] = luaF_findupval(L, base + uv[i].idx); |
804 | 0 | else /* get upvalue from enclosing function */ |
805 | 0 | ncl->upvals[i] = encup[uv[i].idx]; |
806 | 0 | luaC_objbarrier(L, ncl, ncl->upvals[i]); |
807 | 0 | } |
808 | 0 | } |
809 | | |
810 | | |
811 | | /* |
812 | | ** finish execution of an opcode interrupted by a yield |
813 | | */ |
814 | 0 | void luaV_finishOp (lua_State *L) { |
815 | 0 | CallInfo *ci = L->ci; |
816 | 0 | StkId base = ci->func.p + 1; |
817 | 0 | Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */ |
818 | 0 | OpCode op = GET_OPCODE(inst); |
819 | 0 | switch (op) { /* finish its execution */ |
820 | 0 | case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { |
821 | 0 | setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top.p); |
822 | 0 | break; |
823 | 0 | } |
824 | 0 | case OP_UNM: case OP_BNOT: case OP_LEN: |
825 | 0 | case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: |
826 | 0 | case OP_GETFIELD: case OP_SELF: { |
827 | 0 | setobjs2s(L, base + GETARG_A(inst), --L->top.p); |
828 | 0 | break; |
829 | 0 | } |
830 | 0 | case OP_LT: case OP_LE: |
831 | 0 | case OP_LTI: case OP_LEI: |
832 | 0 | case OP_GTI: case OP_GEI: |
833 | 0 | case OP_EQ: { /* note that 'OP_EQI'/'OP_EQK' cannot yield */ |
834 | 0 | int res = !l_isfalse(s2v(L->top.p - 1)); |
835 | 0 | L->top.p--; |
836 | | #if defined(LUA_COMPAT_LT_LE) |
837 | | if (ci->callstatus & CIST_LEQ) { /* "<=" using "<" instead? */ |
838 | | ci->callstatus ^= CIST_LEQ; /* clear mark */ |
839 | | res = !res; /* negate result */ |
840 | | } |
841 | | #endif |
842 | 0 | lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); |
843 | 0 | if (res != GETARG_k(inst)) /* condition failed? */ |
844 | 0 | ci->u.l.savedpc++; /* skip jump instruction */ |
845 | 0 | break; |
846 | 0 | } |
847 | 0 | case OP_CONCAT: { |
848 | 0 | StkId top = L->top.p - 1; /* top when 'luaT_tryconcatTM' was called */ |
849 | 0 | int a = GETARG_A(inst); /* first element to concatenate */ |
850 | 0 | int total = cast_int(top - 1 - (base + a)); /* yet to concatenate */ |
851 | 0 | setobjs2s(L, top - 2, top); /* put TM result in proper position */ |
852 | 0 | L->top.p = top - 1; /* top is one after last element (at top-2) */ |
853 | 0 | luaV_concat(L, total); /* concat them (may yield again) */ |
854 | 0 | break; |
855 | 0 | } |
856 | 0 | case OP_CLOSE: { /* yielded closing variables */ |
857 | 0 | ci->u.l.savedpc--; /* repeat instruction to close other vars. */ |
858 | 0 | break; |
859 | 0 | } |
860 | 0 | case OP_RETURN: { /* yielded closing variables */ |
861 | 0 | StkId ra = base + GETARG_A(inst); |
862 | | /* adjust top to signal correct number of returns, in case the |
863 | | return is "up to top" ('isIT') */ |
864 | 0 | L->top.p = ra + ci->u2.nres; |
865 | | /* repeat instruction to close other vars. and complete the return */ |
866 | 0 | ci->u.l.savedpc--; |
867 | 0 | break; |
868 | 0 | } |
869 | 0 | default: { |
870 | | /* only these other opcodes can yield */ |
871 | 0 | lua_assert(op == OP_TFORCALL || op == OP_CALL || |
872 | 0 | op == OP_TAILCALL || op == OP_SETTABUP || op == OP_SETTABLE || |
873 | 0 | op == OP_SETI || op == OP_SETFIELD); |
874 | 0 | break; |
875 | 0 | } |
876 | 0 | } |
877 | 0 | } |
878 | | |
879 | | |
880 | | |
881 | | |
882 | | /* |
883 | | ** {================================================================== |
884 | | ** Macros for arithmetic/bitwise/comparison opcodes in 'luaV_execute' |
885 | | ** =================================================================== |
886 | | */ |
887 | | |
888 | | #define l_addi(L,a,b) intop(+, a, b) |
889 | | #define l_subi(L,a,b) intop(-, a, b) |
890 | | #define l_muli(L,a,b) intop(*, a, b) |
891 | | #define l_band(a,b) intop(&, a, b) |
892 | | #define l_bor(a,b) intop(|, a, b) |
893 | | #define l_bxor(a,b) intop(^, a, b) |
894 | | |
895 | 0 | #define l_lti(a,b) (a < b) |
896 | 0 | #define l_lei(a,b) (a <= b) |
897 | 0 | #define l_gti(a,b) (a > b) |
898 | 0 | #define l_gei(a,b) (a >= b) |
899 | | |
900 | | |
901 | | /* |
902 | | ** Arithmetic operations with immediate operands. 'iop' is the integer |
903 | | ** operation, 'fop' is the float operation. |
904 | | */ |
905 | 0 | #define op_arithI(L,iop,fop) { \ |
906 | 0 | StkId ra = RA(i); \ |
907 | 0 | TValue *v1 = vRB(i); \ |
908 | 0 | int imm = GETARG_sC(i); \ |
909 | 0 | if (ttisinteger(v1)) { \ |
910 | 0 | lua_Integer iv1 = ivalue(v1); \ |
911 | 0 | pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ |
912 | 0 | } \ |
913 | 0 | else if (ttisfloat(v1)) { \ |
914 | 0 | lua_Number nb = fltvalue(v1); \ |
915 | 0 | lua_Number fimm = cast_num(imm); \ |
916 | 0 | pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ |
917 | 0 | }} |
918 | | |
919 | | |
920 | | /* |
921 | | ** Auxiliary function for arithmetic operations over floats and others |
922 | | ** with two register operands. |
923 | | */ |
924 | 0 | #define op_arithf_aux(L,v1,v2,fop) { \ |
925 | 0 | lua_Number n1; lua_Number n2; \ |
926 | 0 | if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ |
927 | 0 | pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ |
928 | 0 | }} |
929 | | |
930 | | |
931 | | /* |
932 | | ** Arithmetic operations over floats and others with register operands. |
933 | | */ |
934 | 0 | #define op_arithf(L,fop) { \ |
935 | 0 | StkId ra = RA(i); \ |
936 | 0 | TValue *v1 = vRB(i); \ |
937 | 0 | TValue *v2 = vRC(i); \ |
938 | 0 | op_arithf_aux(L, v1, v2, fop); } |
939 | | |
940 | | |
941 | | /* |
942 | | ** Arithmetic operations with K operands for floats. |
943 | | */ |
944 | 0 | #define op_arithfK(L,fop) { \ |
945 | 0 | StkId ra = RA(i); \ |
946 | 0 | TValue *v1 = vRB(i); \ |
947 | 0 | TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ |
948 | 0 | op_arithf_aux(L, v1, v2, fop); } |
949 | | |
950 | | |
951 | | /* |
952 | | ** Arithmetic operations over integers and floats. |
953 | | */ |
954 | 0 | #define op_arith_aux(L,v1,v2,iop,fop) { \ |
955 | 0 | StkId ra = RA(i); \ |
956 | 0 | if (ttisinteger(v1) && ttisinteger(v2)) { \ |
957 | 0 | lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ |
958 | 0 | pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ |
959 | 0 | } \ |
960 | 0 | else op_arithf_aux(L, v1, v2, fop); } |
961 | | |
962 | | |
963 | | /* |
964 | | ** Arithmetic operations with register operands. |
965 | | */ |
966 | 0 | #define op_arith(L,iop,fop) { \ |
967 | 0 | TValue *v1 = vRB(i); \ |
968 | 0 | TValue *v2 = vRC(i); \ |
969 | 0 | op_arith_aux(L, v1, v2, iop, fop); } |
970 | | |
971 | | |
972 | | /* |
973 | | ** Arithmetic operations with K operands. |
974 | | */ |
975 | 0 | #define op_arithK(L,iop,fop) { \ |
976 | 0 | TValue *v1 = vRB(i); \ |
977 | 0 | TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ |
978 | 0 | op_arith_aux(L, v1, v2, iop, fop); } |
979 | | |
980 | | |
981 | | /* |
982 | | ** Bitwise operations with constant operand. |
983 | | */ |
984 | 0 | #define op_bitwiseK(L,op) { \ |
985 | 0 | StkId ra = RA(i); \ |
986 | 0 | TValue *v1 = vRB(i); \ |
987 | 0 | TValue *v2 = KC(i); \ |
988 | 0 | lua_Integer i1; \ |
989 | 0 | lua_Integer i2 = ivalue(v2); \ |
990 | 0 | if (tointegerns(v1, &i1)) { \ |
991 | 0 | pc++; setivalue(s2v(ra), op(i1, i2)); \ |
992 | 0 | }} |
993 | | |
994 | | |
995 | | /* |
996 | | ** Bitwise operations with register operands. |
997 | | */ |
998 | 0 | #define op_bitwise(L,op) { \ |
999 | 0 | StkId ra = RA(i); \ |
1000 | 0 | TValue *v1 = vRB(i); \ |
1001 | 0 | TValue *v2 = vRC(i); \ |
1002 | 0 | lua_Integer i1; lua_Integer i2; \ |
1003 | 0 | if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ |
1004 | 0 | pc++; setivalue(s2v(ra), op(i1, i2)); \ |
1005 | 0 | }} |
1006 | | |
1007 | | |
1008 | | /* |
1009 | | ** Order operations with register operands. 'opn' actually works |
1010 | | ** for all numbers, but the fast track improves performance for |
1011 | | ** integers. |
1012 | | */ |
1013 | 0 | #define op_order(L,opi,opn,other) { \ |
1014 | 0 | StkId ra = RA(i); \ |
1015 | 0 | int cond; \ |
1016 | 0 | TValue *rb = vRB(i); \ |
1017 | 0 | if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ |
1018 | 0 | lua_Integer ia = ivalue(s2v(ra)); \ |
1019 | 0 | lua_Integer ib = ivalue(rb); \ |
1020 | 0 | cond = opi(ia, ib); \ |
1021 | 0 | } \ |
1022 | 0 | else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ |
1023 | 0 | cond = opn(s2v(ra), rb); \ |
1024 | 0 | else \ |
1025 | 0 | Protect(cond = other(L, s2v(ra), rb)); \ |
1026 | 0 | docondjump(); } |
1027 | | |
1028 | | |
1029 | | /* |
1030 | | ** Order operations with immediate operand. (Immediate operand is |
1031 | | ** always small enough to have an exact representation as a float.) |
1032 | | */ |
1033 | 0 | #define op_orderI(L,opi,opf,inv,tm) { \ |
1034 | 0 | StkId ra = RA(i); \ |
1035 | 0 | int cond; \ |
1036 | 0 | int im = GETARG_sB(i); \ |
1037 | 0 | if (ttisinteger(s2v(ra))) \ |
1038 | 0 | cond = opi(ivalue(s2v(ra)), im); \ |
1039 | 0 | else if (ttisfloat(s2v(ra))) { \ |
1040 | 0 | lua_Number fa = fltvalue(s2v(ra)); \ |
1041 | 0 | lua_Number fim = cast_num(im); \ |
1042 | 0 | cond = opf(fa, fim); \ |
1043 | 0 | } \ |
1044 | 0 | else { \ |
1045 | 0 | int isf = GETARG_C(i); \ |
1046 | 0 | Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ |
1047 | 0 | } \ |
1048 | 0 | docondjump(); } |
1049 | | |
1050 | | /* }================================================================== */ |
1051 | | |
1052 | | |
1053 | | /* |
1054 | | ** {================================================================== |
1055 | | ** Function 'luaV_execute': main interpreter loop |
1056 | | ** =================================================================== |
1057 | | */ |
1058 | | |
1059 | | /* |
1060 | | ** some macros for common tasks in 'luaV_execute' |
1061 | | */ |
1062 | | |
1063 | | |
1064 | 0 | #define RA(i) (base+GETARG_A(i)) |
1065 | | #define RB(i) (base+GETARG_B(i)) |
1066 | 0 | #define vRB(i) s2v(RB(i)) |
1067 | 0 | #define KB(i) (k+GETARG_B(i)) |
1068 | | #define RC(i) (base+GETARG_C(i)) |
1069 | 0 | #define vRC(i) s2v(RC(i)) |
1070 | 0 | #define KC(i) (k+GETARG_C(i)) |
1071 | 0 | #define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) |
1072 | | |
1073 | | |
1074 | | |
1075 | 0 | #define updatetrap(ci) (trap = ci->u.l.trap) |
1076 | | |
1077 | 0 | #define updatebase(ci) (base = ci->func.p + 1) |
1078 | | |
1079 | | |
1080 | | #define updatestack(ci) \ |
1081 | 0 | { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } |
1082 | | |
1083 | | |
1084 | | /* |
1085 | | ** Execute a jump instruction. The 'updatetrap' allows signals to stop |
1086 | | ** tight loops. (Without it, the local copy of 'trap' could never change.) |
1087 | | */ |
1088 | 0 | #define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } |
1089 | | |
1090 | | |
1091 | | /* for test instructions, execute the jump instruction that follows it */ |
1092 | 0 | #define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } |
1093 | | |
1094 | | /* |
1095 | | ** do a conditional jump: skip next instruction if 'cond' is not what |
1096 | | ** was expected (parameter 'k'), else do next instruction, which must |
1097 | | ** be a jump. |
1098 | | */ |
1099 | 0 | #define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); |
1100 | | |
1101 | | |
1102 | | /* |
1103 | | ** Correct global 'pc'. |
1104 | | */ |
1105 | 0 | #define savepc(L) (ci->u.l.savedpc = pc) |
1106 | | |
1107 | | |
1108 | | /* |
1109 | | ** Whenever code can raise errors, the global 'pc' and the global |
1110 | | ** 'top' must be correct to report occasional errors. |
1111 | | */ |
1112 | 0 | #define savestate(L,ci) (savepc(L), L->top.p = ci->top.p) |
1113 | | |
1114 | | |
1115 | | /* |
1116 | | ** Protect code that, in general, can raise errors, reallocate the |
1117 | | ** stack, and change the hooks. |
1118 | | */ |
1119 | 0 | #define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) |
1120 | | |
1121 | | /* special version that does not change the top */ |
1122 | 0 | #define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) |
1123 | | |
1124 | | /* |
1125 | | ** Protect code that can only raise errors. (That is, it cannot change |
1126 | | ** the stack or hooks.) |
1127 | | */ |
1128 | 0 | #define halfProtect(exp) (savestate(L,ci), (exp)) |
1129 | | |
1130 | | /* 'c' is the limit of live values in the stack */ |
1131 | | #define checkGC(L,c) \ |
1132 | 0 | { luaC_condGC(L, (savepc(L), L->top.p = (c)), \ |
1133 | 0 | updatetrap(ci)); \ |
1134 | 0 | luai_threadyield(L); } |
1135 | | |
1136 | | |
1137 | | /* fetch an instruction and prepare its execution */ |
1138 | 0 | #define vmfetch() { \ |
1139 | 0 | if (l_unlikely(trap)) { /* stack reallocation or hooks? */ \ |
1140 | 0 | trap = luaG_traceexec(L, pc); /* handle hooks */ \ |
1141 | 0 | updatebase(ci); /* correct stack */ \ |
1142 | 0 | } \ |
1143 | 0 | i = *(pc++); \ |
1144 | 0 | } |
1145 | | |
1146 | | #define vmdispatch(o) switch(o) |
1147 | | #define vmcase(l) case l: |
1148 | | #define vmbreak break |
1149 | | |
1150 | | |
1151 | 0 | void luaV_execute (lua_State *L, CallInfo *ci) { |
1152 | 0 | LClosure *cl; |
1153 | 0 | TValue *k; |
1154 | 0 | StkId base; |
1155 | 0 | const Instruction *pc; |
1156 | 0 | int trap; |
1157 | 0 | #if LUA_USE_JUMPTABLE |
1158 | 0 | #include "ljumptab.h" |
1159 | 0 | #endif |
1160 | 0 | startfunc: |
1161 | 0 | trap = L->hookmask; |
1162 | 0 | returning: /* trap already set */ |
1163 | 0 | cl = ci_func(ci); |
1164 | 0 | k = cl->p->k; |
1165 | 0 | pc = ci->u.l.savedpc; |
1166 | 0 | if (l_unlikely(trap)) |
1167 | 0 | trap = luaG_tracecall(L); |
1168 | 0 | base = ci->func.p + 1; |
1169 | | /* main loop of interpreter */ |
1170 | 0 | for (;;) { |
1171 | 0 | Instruction i; /* instruction being executed */ |
1172 | 0 | vmfetch(); |
1173 | | #if 0 |
1174 | | /* low-level line tracing for debugging Lua */ |
1175 | | printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); |
1176 | | #endif |
1177 | 0 | lua_assert(base == ci->func.p + 1); |
1178 | 0 | lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); |
1179 | | /* invalidate top for instructions not expecting it */ |
1180 | 0 | lua_assert(isIT(i) || (cast_void(L->top.p = base), 1)); |
1181 | 0 | vmdispatch (GET_OPCODE(i)) { |
1182 | 0 | vmcase(OP_MOVE) { |
1183 | 0 | StkId ra = RA(i); |
1184 | 0 | setobjs2s(L, ra, RB(i)); |
1185 | 0 | vmbreak; |
1186 | 0 | } |
1187 | 0 | vmcase(OP_LOADI) { |
1188 | 0 | StkId ra = RA(i); |
1189 | 0 | lua_Integer b = GETARG_sBx(i); |
1190 | 0 | setivalue(s2v(ra), b); |
1191 | 0 | vmbreak; |
1192 | 0 | } |
1193 | 0 | vmcase(OP_LOADF) { |
1194 | 0 | StkId ra = RA(i); |
1195 | 0 | int b = GETARG_sBx(i); |
1196 | 0 | setfltvalue(s2v(ra), cast_num(b)); |
1197 | 0 | vmbreak; |
1198 | 0 | } |
1199 | 0 | vmcase(OP_LOADK) { |
1200 | 0 | StkId ra = RA(i); |
1201 | 0 | TValue *rb = k + GETARG_Bx(i); |
1202 | 0 | setobj2s(L, ra, rb); |
1203 | 0 | vmbreak; |
1204 | 0 | } |
1205 | 0 | vmcase(OP_LOADKX) { |
1206 | 0 | StkId ra = RA(i); |
1207 | 0 | TValue *rb; |
1208 | 0 | rb = k + GETARG_Ax(*pc); pc++; |
1209 | 0 | setobj2s(L, ra, rb); |
1210 | 0 | vmbreak; |
1211 | 0 | } |
1212 | 0 | vmcase(OP_LOADFALSE) { |
1213 | 0 | StkId ra = RA(i); |
1214 | 0 | setbfvalue(s2v(ra)); |
1215 | 0 | vmbreak; |
1216 | 0 | } |
1217 | 0 | vmcase(OP_LFALSESKIP) { |
1218 | 0 | StkId ra = RA(i); |
1219 | 0 | setbfvalue(s2v(ra)); |
1220 | 0 | pc++; /* skip next instruction */ |
1221 | 0 | vmbreak; |
1222 | 0 | } |
1223 | 0 | vmcase(OP_LOADTRUE) { |
1224 | 0 | StkId ra = RA(i); |
1225 | 0 | setbtvalue(s2v(ra)); |
1226 | 0 | vmbreak; |
1227 | 0 | } |
1228 | 0 | vmcase(OP_LOADNIL) { |
1229 | 0 | StkId ra = RA(i); |
1230 | 0 | int b = GETARG_B(i); |
1231 | 0 | do { |
1232 | 0 | setnilvalue(s2v(ra++)); |
1233 | 0 | } while (b--); |
1234 | 0 | vmbreak; |
1235 | 0 | } |
1236 | 0 | vmcase(OP_GETUPVAL) { |
1237 | 0 | StkId ra = RA(i); |
1238 | 0 | int b = GETARG_B(i); |
1239 | 0 | setobj2s(L, ra, cl->upvals[b]->v.p); |
1240 | 0 | vmbreak; |
1241 | 0 | } |
1242 | 0 | vmcase(OP_SETUPVAL) { |
1243 | 0 | StkId ra = RA(i); |
1244 | 0 | UpVal *uv = cl->upvals[GETARG_B(i)]; |
1245 | 0 | setobj(L, uv->v.p, s2v(ra)); |
1246 | 0 | luaC_barrier(L, uv, s2v(ra)); |
1247 | 0 | vmbreak; |
1248 | 0 | } |
1249 | 0 | vmcase(OP_GETTABUP) { |
1250 | 0 | StkId ra = RA(i); |
1251 | 0 | const TValue *slot; |
1252 | 0 | TValue *upval = cl->upvals[GETARG_B(i)]->v.p; |
1253 | 0 | TValue *rc = KC(i); |
1254 | 0 | TString *key = tsvalue(rc); /* key must be a short string */ |
1255 | 0 | if (luaV_fastget(L, upval, key, slot, luaH_getshortstr)) { |
1256 | 0 | setobj2s(L, ra, slot); |
1257 | 0 | } |
1258 | 0 | else |
1259 | 0 | Protect(luaV_finishget(L, upval, rc, ra, slot)); |
1260 | 0 | vmbreak; |
1261 | 0 | } |
1262 | 0 | vmcase(OP_GETTABLE) { |
1263 | 0 | StkId ra = RA(i); |
1264 | 0 | const TValue *slot; |
1265 | 0 | TValue *rb = vRB(i); |
1266 | 0 | TValue *rc = vRC(i); |
1267 | 0 | lua_Unsigned n; |
1268 | | if (ttisinteger(rc) /* fast track for integers? */ |
1269 | 0 | ? (cast_void(n = ivalue(rc)), luaV_fastgeti(L, rb, n, slot)) |
1270 | 0 | : luaV_fastget(L, rb, rc, slot, luaH_get)) { |
1271 | 0 | setobj2s(L, ra, slot); |
1272 | 0 | } |
1273 | 0 | else |
1274 | 0 | Protect(luaV_finishget(L, rb, rc, ra, slot)); |
1275 | 0 | vmbreak; |
1276 | 0 | } |
1277 | 0 | vmcase(OP_GETI) { |
1278 | 0 | StkId ra = RA(i); |
1279 | 0 | const TValue *slot; |
1280 | 0 | TValue *rb = vRB(i); |
1281 | 0 | int c = GETARG_C(i); |
1282 | 0 | if (luaV_fastgeti(L, rb, c, slot)) { |
1283 | 0 | setobj2s(L, ra, slot); |
1284 | 0 | } |
1285 | 0 | else { |
1286 | 0 | TValue key; |
1287 | 0 | setivalue(&key, c); |
1288 | 0 | Protect(luaV_finishget(L, rb, &key, ra, slot)); |
1289 | 0 | } |
1290 | 0 | vmbreak; |
1291 | 0 | } |
1292 | 0 | vmcase(OP_GETFIELD) { |
1293 | 0 | StkId ra = RA(i); |
1294 | 0 | const TValue *slot; |
1295 | 0 | TValue *rb = vRB(i); |
1296 | 0 | TValue *rc = KC(i); |
1297 | 0 | TString *key = tsvalue(rc); /* key must be a short string */ |
1298 | 0 | if (luaV_fastget(L, rb, key, slot, luaH_getshortstr)) { |
1299 | 0 | setobj2s(L, ra, slot); |
1300 | 0 | } |
1301 | 0 | else |
1302 | 0 | Protect(luaV_finishget(L, rb, rc, ra, slot)); |
1303 | 0 | vmbreak; |
1304 | 0 | } |
1305 | 0 | vmcase(OP_SETTABUP) { |
1306 | 0 | const TValue *slot; |
1307 | 0 | TValue *upval = cl->upvals[GETARG_A(i)]->v.p; |
1308 | 0 | TValue *rb = KB(i); |
1309 | 0 | TValue *rc = RKC(i); |
1310 | 0 | TString *key = tsvalue(rb); /* key must be a short string */ |
1311 | 0 | if (luaV_fastget(L, upval, key, slot, luaH_getshortstr)) { |
1312 | 0 | luaV_finishfastset(L, upval, slot, rc); |
1313 | 0 | } |
1314 | 0 | else |
1315 | 0 | Protect(luaV_finishset(L, upval, rb, rc, slot)); |
1316 | 0 | vmbreak; |
1317 | 0 | } |
1318 | 0 | vmcase(OP_SETTABLE) { |
1319 | 0 | StkId ra = RA(i); |
1320 | 0 | const TValue *slot; |
1321 | 0 | TValue *rb = vRB(i); /* key (table is in 'ra') */ |
1322 | 0 | TValue *rc = RKC(i); /* value */ |
1323 | 0 | lua_Unsigned n; |
1324 | | if (ttisinteger(rb) /* fast track for integers? */ |
1325 | 0 | ? (cast_void(n = ivalue(rb)), luaV_fastgeti(L, s2v(ra), n, slot)) |
1326 | 0 | : luaV_fastget(L, s2v(ra), rb, slot, luaH_get)) { |
1327 | 0 | luaV_finishfastset(L, s2v(ra), slot, rc); |
1328 | 0 | } |
1329 | 0 | else |
1330 | 0 | Protect(luaV_finishset(L, s2v(ra), rb, rc, slot)); |
1331 | 0 | vmbreak; |
1332 | 0 | } |
1333 | 0 | vmcase(OP_SETI) { |
1334 | 0 | StkId ra = RA(i); |
1335 | 0 | const TValue *slot; |
1336 | 0 | int c = GETARG_B(i); |
1337 | 0 | TValue *rc = RKC(i); |
1338 | 0 | if (luaV_fastgeti(L, s2v(ra), c, slot)) { |
1339 | 0 | luaV_finishfastset(L, s2v(ra), slot, rc); |
1340 | 0 | } |
1341 | 0 | else { |
1342 | 0 | TValue key; |
1343 | 0 | setivalue(&key, c); |
1344 | 0 | Protect(luaV_finishset(L, s2v(ra), &key, rc, slot)); |
1345 | 0 | } |
1346 | 0 | vmbreak; |
1347 | 0 | } |
1348 | 0 | vmcase(OP_SETFIELD) { |
1349 | 0 | StkId ra = RA(i); |
1350 | 0 | const TValue *slot; |
1351 | 0 | TValue *rb = KB(i); |
1352 | 0 | TValue *rc = RKC(i); |
1353 | 0 | TString *key = tsvalue(rb); /* key must be a short string */ |
1354 | 0 | if (luaV_fastget(L, s2v(ra), key, slot, luaH_getshortstr)) { |
1355 | 0 | luaV_finishfastset(L, s2v(ra), slot, rc); |
1356 | 0 | } |
1357 | 0 | else |
1358 | 0 | Protect(luaV_finishset(L, s2v(ra), rb, rc, slot)); |
1359 | 0 | vmbreak; |
1360 | 0 | } |
1361 | 0 | vmcase(OP_NEWTABLE) { |
1362 | 0 | StkId ra = RA(i); |
1363 | 0 | int b = GETARG_B(i); /* log2(hash size) + 1 */ |
1364 | 0 | int c = GETARG_C(i); /* array size */ |
1365 | 0 | Table *t; |
1366 | 0 | if (b > 0) |
1367 | 0 | b = 1 << (b - 1); /* size is 2^(b - 1) */ |
1368 | 0 | lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); |
1369 | 0 | if (TESTARG_k(i)) /* non-zero extra argument? */ |
1370 | 0 | c += GETARG_Ax(*pc) * (MAXARG_C + 1); /* add it to size */ |
1371 | 0 | pc++; /* skip extra argument */ |
1372 | 0 | L->top.p = ra + 1; /* correct top in case of emergency GC */ |
1373 | 0 | t = luaH_new(L); /* memory allocation */ |
1374 | 0 | sethvalue2s(L, ra, t); |
1375 | 0 | if (b != 0 || c != 0) |
1376 | 0 | luaH_resize(L, t, c, b); /* idem */ |
1377 | 0 | checkGC(L, ra + 1); |
1378 | 0 | vmbreak; |
1379 | 0 | } |
1380 | 0 | vmcase(OP_SELF) { |
1381 | 0 | StkId ra = RA(i); |
1382 | 0 | const TValue *slot; |
1383 | 0 | TValue *rb = vRB(i); |
1384 | 0 | TValue *rc = RKC(i); |
1385 | 0 | TString *key = tsvalue(rc); /* key must be a string */ |
1386 | 0 | setobj2s(L, ra + 1, rb); |
1387 | 0 | if (luaV_fastget(L, rb, key, slot, luaH_getstr)) { |
1388 | 0 | setobj2s(L, ra, slot); |
1389 | 0 | } |
1390 | 0 | else |
1391 | 0 | Protect(luaV_finishget(L, rb, rc, ra, slot)); |
1392 | 0 | vmbreak; |
1393 | 0 | } |
1394 | 0 | vmcase(OP_ADDI) { |
1395 | 0 | op_arithI(L, l_addi, luai_numadd); |
1396 | 0 | vmbreak; |
1397 | 0 | } |
1398 | 0 | vmcase(OP_ADDK) { |
1399 | 0 | op_arithK(L, l_addi, luai_numadd); |
1400 | 0 | vmbreak; |
1401 | 0 | } |
1402 | 0 | vmcase(OP_SUBK) { |
1403 | 0 | op_arithK(L, l_subi, luai_numsub); |
1404 | 0 | vmbreak; |
1405 | 0 | } |
1406 | 0 | vmcase(OP_MULK) { |
1407 | 0 | op_arithK(L, l_muli, luai_nummul); |
1408 | 0 | vmbreak; |
1409 | 0 | } |
1410 | 0 | vmcase(OP_MODK) { |
1411 | 0 | savestate(L, ci); /* in case of division by 0 */ |
1412 | 0 | op_arithK(L, luaV_mod, luaV_modf); |
1413 | 0 | vmbreak; |
1414 | 0 | } |
1415 | 0 | vmcase(OP_POWK) { |
1416 | 0 | op_arithfK(L, luai_numpow); |
1417 | 0 | vmbreak; |
1418 | 0 | } |
1419 | 0 | vmcase(OP_DIVK) { |
1420 | 0 | op_arithfK(L, luai_numdiv); |
1421 | 0 | vmbreak; |
1422 | 0 | } |
1423 | 0 | vmcase(OP_IDIVK) { |
1424 | 0 | savestate(L, ci); /* in case of division by 0 */ |
1425 | 0 | op_arithK(L, luaV_idiv, luai_numidiv); |
1426 | 0 | vmbreak; |
1427 | 0 | } |
1428 | 0 | vmcase(OP_BANDK) { |
1429 | 0 | op_bitwiseK(L, l_band); |
1430 | 0 | vmbreak; |
1431 | 0 | } |
1432 | 0 | vmcase(OP_BORK) { |
1433 | 0 | op_bitwiseK(L, l_bor); |
1434 | 0 | vmbreak; |
1435 | 0 | } |
1436 | 0 | vmcase(OP_BXORK) { |
1437 | 0 | op_bitwiseK(L, l_bxor); |
1438 | 0 | vmbreak; |
1439 | 0 | } |
1440 | 0 | vmcase(OP_SHRI) { |
1441 | 0 | StkId ra = RA(i); |
1442 | 0 | TValue *rb = vRB(i); |
1443 | 0 | int ic = GETARG_sC(i); |
1444 | 0 | lua_Integer ib; |
1445 | 0 | if (tointegerns(rb, &ib)) { |
1446 | 0 | pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); |
1447 | 0 | } |
1448 | 0 | vmbreak; |
1449 | 0 | } |
1450 | 0 | vmcase(OP_SHLI) { |
1451 | 0 | StkId ra = RA(i); |
1452 | 0 | TValue *rb = vRB(i); |
1453 | 0 | int ic = GETARG_sC(i); |
1454 | 0 | lua_Integer ib; |
1455 | 0 | if (tointegerns(rb, &ib)) { |
1456 | 0 | pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); |
1457 | 0 | } |
1458 | 0 | vmbreak; |
1459 | 0 | } |
1460 | 0 | vmcase(OP_ADD) { |
1461 | 0 | op_arith(L, l_addi, luai_numadd); |
1462 | 0 | vmbreak; |
1463 | 0 | } |
1464 | 0 | vmcase(OP_SUB) { |
1465 | 0 | op_arith(L, l_subi, luai_numsub); |
1466 | 0 | vmbreak; |
1467 | 0 | } |
1468 | 0 | vmcase(OP_MUL) { |
1469 | 0 | op_arith(L, l_muli, luai_nummul); |
1470 | 0 | vmbreak; |
1471 | 0 | } |
1472 | 0 | vmcase(OP_MOD) { |
1473 | 0 | savestate(L, ci); /* in case of division by 0 */ |
1474 | 0 | op_arith(L, luaV_mod, luaV_modf); |
1475 | 0 | vmbreak; |
1476 | 0 | } |
1477 | 0 | vmcase(OP_POW) { |
1478 | 0 | op_arithf(L, luai_numpow); |
1479 | 0 | vmbreak; |
1480 | 0 | } |
1481 | 0 | vmcase(OP_DIV) { /* float division (always with floats) */ |
1482 | 0 | op_arithf(L, luai_numdiv); |
1483 | 0 | vmbreak; |
1484 | 0 | } |
1485 | 0 | vmcase(OP_IDIV) { /* floor division */ |
1486 | 0 | savestate(L, ci); /* in case of division by 0 */ |
1487 | 0 | op_arith(L, luaV_idiv, luai_numidiv); |
1488 | 0 | vmbreak; |
1489 | 0 | } |
1490 | 0 | vmcase(OP_BAND) { |
1491 | 0 | op_bitwise(L, l_band); |
1492 | 0 | vmbreak; |
1493 | 0 | } |
1494 | 0 | vmcase(OP_BOR) { |
1495 | 0 | op_bitwise(L, l_bor); |
1496 | 0 | vmbreak; |
1497 | 0 | } |
1498 | 0 | vmcase(OP_BXOR) { |
1499 | 0 | op_bitwise(L, l_bxor); |
1500 | 0 | vmbreak; |
1501 | 0 | } |
1502 | 0 | vmcase(OP_SHR) { |
1503 | 0 | op_bitwise(L, luaV_shiftr); |
1504 | 0 | vmbreak; |
1505 | 0 | } |
1506 | 0 | vmcase(OP_SHL) { |
1507 | 0 | op_bitwise(L, luaV_shiftl); |
1508 | 0 | vmbreak; |
1509 | 0 | } |
1510 | 0 | vmcase(OP_MMBIN) { |
1511 | 0 | StkId ra = RA(i); |
1512 | 0 | Instruction pi = *(pc - 2); /* original arith. expression */ |
1513 | 0 | TValue *rb = vRB(i); |
1514 | 0 | TMS tm = (TMS)GETARG_C(i); |
1515 | 0 | StkId result = RA(pi); |
1516 | 0 | lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); |
1517 | 0 | Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); |
1518 | 0 | vmbreak; |
1519 | 0 | } |
1520 | 0 | vmcase(OP_MMBINI) { |
1521 | 0 | StkId ra = RA(i); |
1522 | 0 | Instruction pi = *(pc - 2); /* original arith. expression */ |
1523 | 0 | int imm = GETARG_sB(i); |
1524 | 0 | TMS tm = (TMS)GETARG_C(i); |
1525 | 0 | int flip = GETARG_k(i); |
1526 | 0 | StkId result = RA(pi); |
1527 | 0 | Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); |
1528 | 0 | vmbreak; |
1529 | 0 | } |
1530 | 0 | vmcase(OP_MMBINK) { |
1531 | 0 | StkId ra = RA(i); |
1532 | 0 | Instruction pi = *(pc - 2); /* original arith. expression */ |
1533 | 0 | TValue *imm = KB(i); |
1534 | 0 | TMS tm = (TMS)GETARG_C(i); |
1535 | 0 | int flip = GETARG_k(i); |
1536 | 0 | StkId result = RA(pi); |
1537 | 0 | Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); |
1538 | 0 | vmbreak; |
1539 | 0 | } |
1540 | 0 | vmcase(OP_UNM) { |
1541 | 0 | StkId ra = RA(i); |
1542 | 0 | TValue *rb = vRB(i); |
1543 | 0 | lua_Number nb; |
1544 | 0 | if (ttisinteger(rb)) { |
1545 | 0 | lua_Integer ib = ivalue(rb); |
1546 | 0 | setivalue(s2v(ra), intop(-, 0, ib)); |
1547 | 0 | } |
1548 | 0 | else if (tonumberns(rb, nb)) { |
1549 | 0 | setfltvalue(s2v(ra), luai_numunm(L, nb)); |
1550 | 0 | } |
1551 | 0 | else |
1552 | 0 | Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); |
1553 | 0 | vmbreak; |
1554 | 0 | } |
1555 | 0 | vmcase(OP_BNOT) { |
1556 | 0 | StkId ra = RA(i); |
1557 | 0 | TValue *rb = vRB(i); |
1558 | 0 | lua_Integer ib; |
1559 | 0 | if (tointegerns(rb, &ib)) { |
1560 | 0 | setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); |
1561 | 0 | } |
1562 | 0 | else |
1563 | 0 | Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); |
1564 | 0 | vmbreak; |
1565 | 0 | } |
1566 | 0 | vmcase(OP_NOT) { |
1567 | 0 | StkId ra = RA(i); |
1568 | 0 | TValue *rb = vRB(i); |
1569 | 0 | if (l_isfalse(rb)) |
1570 | 0 | setbtvalue(s2v(ra)); |
1571 | 0 | else |
1572 | 0 | setbfvalue(s2v(ra)); |
1573 | 0 | vmbreak; |
1574 | 0 | } |
1575 | 0 | vmcase(OP_LEN) { |
1576 | 0 | StkId ra = RA(i); |
1577 | 0 | Protect(luaV_objlen(L, ra, vRB(i))); |
1578 | 0 | vmbreak; |
1579 | 0 | } |
1580 | 0 | vmcase(OP_CONCAT) { |
1581 | 0 | StkId ra = RA(i); |
1582 | 0 | int n = GETARG_B(i); /* number of elements to concatenate */ |
1583 | 0 | L->top.p = ra + n; /* mark the end of concat operands */ |
1584 | 0 | ProtectNT(luaV_concat(L, n)); |
1585 | 0 | checkGC(L, L->top.p); /* 'luaV_concat' ensures correct top */ |
1586 | 0 | vmbreak; |
1587 | 0 | } |
1588 | 0 | vmcase(OP_CLOSE) { |
1589 | 0 | StkId ra = RA(i); |
1590 | 0 | Protect(luaF_close(L, ra, LUA_OK, 1)); |
1591 | 0 | vmbreak; |
1592 | 0 | } |
1593 | 0 | vmcase(OP_TBC) { |
1594 | 0 | StkId ra = RA(i); |
1595 | | /* create new to-be-closed upvalue */ |
1596 | 0 | halfProtect(luaF_newtbcupval(L, ra)); |
1597 | 0 | vmbreak; |
1598 | 0 | } |
1599 | 0 | vmcase(OP_JMP) { |
1600 | 0 | dojump(ci, i, 0); |
1601 | 0 | vmbreak; |
1602 | 0 | } |
1603 | 0 | vmcase(OP_EQ) { |
1604 | 0 | StkId ra = RA(i); |
1605 | 0 | int cond; |
1606 | 0 | TValue *rb = vRB(i); |
1607 | 0 | Protect(cond = luaV_equalobj(L, s2v(ra), rb)); |
1608 | 0 | docondjump(); |
1609 | 0 | vmbreak; |
1610 | 0 | } |
1611 | 0 | vmcase(OP_LT) { |
1612 | 0 | op_order(L, l_lti, LTnum, lessthanothers); |
1613 | 0 | vmbreak; |
1614 | 0 | } |
1615 | 0 | vmcase(OP_LE) { |
1616 | 0 | op_order(L, l_lei, LEnum, lessequalothers); |
1617 | 0 | vmbreak; |
1618 | 0 | } |
1619 | 0 | vmcase(OP_EQK) { |
1620 | 0 | StkId ra = RA(i); |
1621 | 0 | TValue *rb = KB(i); |
1622 | | /* basic types do not use '__eq'; we can use raw equality */ |
1623 | 0 | int cond = luaV_rawequalobj(s2v(ra), rb); |
1624 | 0 | docondjump(); |
1625 | 0 | vmbreak; |
1626 | 0 | } |
1627 | 0 | vmcase(OP_EQI) { |
1628 | 0 | StkId ra = RA(i); |
1629 | 0 | int cond; |
1630 | 0 | int im = GETARG_sB(i); |
1631 | 0 | if (ttisinteger(s2v(ra))) |
1632 | 0 | cond = (ivalue(s2v(ra)) == im); |
1633 | 0 | else if (ttisfloat(s2v(ra))) |
1634 | 0 | cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); |
1635 | 0 | else |
1636 | 0 | cond = 0; /* other types cannot be equal to a number */ |
1637 | 0 | docondjump(); |
1638 | 0 | vmbreak; |
1639 | 0 | } |
1640 | 0 | vmcase(OP_LTI) { |
1641 | 0 | op_orderI(L, l_lti, luai_numlt, 0, TM_LT); |
1642 | 0 | vmbreak; |
1643 | 0 | } |
1644 | 0 | vmcase(OP_LEI) { |
1645 | 0 | op_orderI(L, l_lei, luai_numle, 0, TM_LE); |
1646 | 0 | vmbreak; |
1647 | 0 | } |
1648 | 0 | vmcase(OP_GTI) { |
1649 | 0 | op_orderI(L, l_gti, luai_numgt, 1, TM_LT); |
1650 | 0 | vmbreak; |
1651 | 0 | } |
1652 | 0 | vmcase(OP_GEI) { |
1653 | 0 | op_orderI(L, l_gei, luai_numge, 1, TM_LE); |
1654 | 0 | vmbreak; |
1655 | 0 | } |
1656 | 0 | vmcase(OP_TEST) { |
1657 | 0 | StkId ra = RA(i); |
1658 | 0 | int cond = !l_isfalse(s2v(ra)); |
1659 | 0 | docondjump(); |
1660 | 0 | vmbreak; |
1661 | 0 | } |
1662 | 0 | vmcase(OP_TESTSET) { |
1663 | 0 | StkId ra = RA(i); |
1664 | 0 | TValue *rb = vRB(i); |
1665 | 0 | if (l_isfalse(rb) == GETARG_k(i)) |
1666 | 0 | pc++; |
1667 | 0 | else { |
1668 | 0 | setobj2s(L, ra, rb); |
1669 | 0 | donextjump(ci); |
1670 | 0 | } |
1671 | 0 | vmbreak; |
1672 | 0 | } |
1673 | 0 | vmcase(OP_CALL) { |
1674 | 0 | StkId ra = RA(i); |
1675 | 0 | CallInfo *newci; |
1676 | 0 | int b = GETARG_B(i); |
1677 | 0 | int nresults = GETARG_C(i) - 1; |
1678 | 0 | if (b != 0) /* fixed number of arguments? */ |
1679 | 0 | L->top.p = ra + b; /* top signals number of arguments */ |
1680 | | /* else previous instruction set top */ |
1681 | 0 | savepc(L); /* in case of errors */ |
1682 | 0 | if ((newci = luaD_precall(L, ra, nresults)) == NULL) |
1683 | 0 | updatetrap(ci); /* C call; nothing else to be done */ |
1684 | 0 | else { /* Lua call: run function in this same C frame */ |
1685 | 0 | ci = newci; |
1686 | 0 | goto startfunc; |
1687 | 0 | } |
1688 | 0 | vmbreak; |
1689 | 0 | } |
1690 | 0 | vmcase(OP_TAILCALL) { |
1691 | 0 | StkId ra = RA(i); |
1692 | 0 | int b = GETARG_B(i); /* number of arguments + 1 (function) */ |
1693 | 0 | int n; /* number of results when calling a C function */ |
1694 | 0 | int nparams1 = GETARG_C(i); |
1695 | | /* delta is virtual 'func' - real 'func' (vararg functions) */ |
1696 | 0 | int delta = (nparams1) ? ci->u.l.nextraargs + nparams1 : 0; |
1697 | 0 | if (b != 0) |
1698 | 0 | L->top.p = ra + b; |
1699 | 0 | else /* previous instruction set top */ |
1700 | 0 | b = cast_int(L->top.p - ra); |
1701 | 0 | savepc(ci); /* several calls here can raise errors */ |
1702 | 0 | if (TESTARG_k(i)) { |
1703 | 0 | luaF_closeupval(L, base); /* close upvalues from current call */ |
1704 | 0 | lua_assert(L->tbclist.p < base); /* no pending tbc variables */ |
1705 | 0 | lua_assert(base == ci->func.p + 1); |
1706 | 0 | } |
1707 | 0 | if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) /* Lua function? */ |
1708 | 0 | goto startfunc; /* execute the callee */ |
1709 | 0 | else { /* C function? */ |
1710 | 0 | ci->func.p -= delta; /* restore 'func' (if vararg) */ |
1711 | 0 | luaD_poscall(L, ci, n); /* finish caller */ |
1712 | 0 | updatetrap(ci); /* 'luaD_poscall' can change hooks */ |
1713 | 0 | goto ret; /* caller returns after the tail call */ |
1714 | 0 | } |
1715 | 0 | } |
1716 | 0 | vmcase(OP_RETURN) { |
1717 | 0 | StkId ra = RA(i); |
1718 | 0 | int n = GETARG_B(i) - 1; /* number of results */ |
1719 | 0 | int nparams1 = GETARG_C(i); |
1720 | 0 | if (n < 0) /* not fixed? */ |
1721 | 0 | n = cast_int(L->top.p - ra); /* get what is available */ |
1722 | 0 | savepc(ci); |
1723 | 0 | if (TESTARG_k(i)) { /* may there be open upvalues? */ |
1724 | 0 | ci->u2.nres = n; /* save number of returns */ |
1725 | 0 | if (L->top.p < ci->top.p) |
1726 | 0 | L->top.p = ci->top.p; |
1727 | 0 | luaF_close(L, base, CLOSEKTOP, 1); |
1728 | 0 | updatetrap(ci); |
1729 | 0 | updatestack(ci); |
1730 | 0 | } |
1731 | 0 | if (nparams1) /* vararg function? */ |
1732 | 0 | ci->func.p -= ci->u.l.nextraargs + nparams1; |
1733 | 0 | L->top.p = ra + n; /* set call for 'luaD_poscall' */ |
1734 | 0 | luaD_poscall(L, ci, n); |
1735 | 0 | updatetrap(ci); /* 'luaD_poscall' can change hooks */ |
1736 | 0 | goto ret; |
1737 | 0 | } |
1738 | 0 | vmcase(OP_RETURN0) { |
1739 | 0 | if (l_unlikely(L->hookmask)) { |
1740 | 0 | StkId ra = RA(i); |
1741 | 0 | L->top.p = ra; |
1742 | 0 | savepc(ci); |
1743 | 0 | luaD_poscall(L, ci, 0); /* no hurry... */ |
1744 | 0 | trap = 1; |
1745 | 0 | } |
1746 | 0 | else { /* do the 'poscall' here */ |
1747 | 0 | int nres; |
1748 | 0 | L->ci = ci->previous; /* back to caller */ |
1749 | 0 | L->top.p = base - 1; |
1750 | 0 | for (nres = ci->nresults; l_unlikely(nres > 0); nres--) |
1751 | 0 | setnilvalue(s2v(L->top.p++)); /* all results are nil */ |
1752 | 0 | } |
1753 | 0 | goto ret; |
1754 | 0 | } |
1755 | 0 | vmcase(OP_RETURN1) { |
1756 | 0 | if (l_unlikely(L->hookmask)) { |
1757 | 0 | StkId ra = RA(i); |
1758 | 0 | L->top.p = ra + 1; |
1759 | 0 | savepc(ci); |
1760 | 0 | luaD_poscall(L, ci, 1); /* no hurry... */ |
1761 | 0 | trap = 1; |
1762 | 0 | } |
1763 | 0 | else { /* do the 'poscall' here */ |
1764 | 0 | int nres = ci->nresults; |
1765 | 0 | L->ci = ci->previous; /* back to caller */ |
1766 | 0 | if (nres == 0) |
1767 | 0 | L->top.p = base - 1; /* asked for no results */ |
1768 | 0 | else { |
1769 | 0 | StkId ra = RA(i); |
1770 | 0 | setobjs2s(L, base - 1, ra); /* at least this result */ |
1771 | 0 | L->top.p = base; |
1772 | 0 | for (; l_unlikely(nres > 1); nres--) |
1773 | 0 | setnilvalue(s2v(L->top.p++)); /* complete missing results */ |
1774 | 0 | } |
1775 | 0 | } |
1776 | 0 | ret: /* return from a Lua function */ |
1777 | 0 | if (ci->callstatus & CIST_FRESH) |
1778 | 0 | return; /* end this frame */ |
1779 | 0 | else { |
1780 | 0 | ci = ci->previous; |
1781 | 0 | goto returning; /* continue running caller in this frame */ |
1782 | 0 | } |
1783 | 0 | } |
1784 | 0 | vmcase(OP_FORLOOP) { |
1785 | 0 | StkId ra = RA(i); |
1786 | 0 | if (ttisinteger(s2v(ra + 2))) { /* integer loop? */ |
1787 | 0 | lua_Unsigned count = l_castS2U(ivalue(s2v(ra + 1))); |
1788 | 0 | if (count > 0) { /* still more iterations? */ |
1789 | 0 | lua_Integer step = ivalue(s2v(ra + 2)); |
1790 | 0 | lua_Integer idx = ivalue(s2v(ra)); /* internal index */ |
1791 | 0 | chgivalue(s2v(ra + 1), count - 1); /* update counter */ |
1792 | 0 | idx = intop(+, idx, step); /* add step to index */ |
1793 | 0 | chgivalue(s2v(ra), idx); /* update internal index */ |
1794 | 0 | setivalue(s2v(ra + 3), idx); /* and control variable */ |
1795 | 0 | pc -= GETARG_Bx(i); /* jump back */ |
1796 | 0 | } |
1797 | 0 | } |
1798 | 0 | else if (floatforloop(ra)) /* float loop */ |
1799 | 0 | pc -= GETARG_Bx(i); /* jump back */ |
1800 | 0 | updatetrap(ci); /* allows a signal to break the loop */ |
1801 | 0 | vmbreak; |
1802 | 0 | } |
1803 | 0 | vmcase(OP_FORPREP) { |
1804 | 0 | StkId ra = RA(i); |
1805 | 0 | savestate(L, ci); /* in case of errors */ |
1806 | 0 | if (forprep(L, ra)) |
1807 | 0 | pc += GETARG_Bx(i) + 1; /* skip the loop */ |
1808 | 0 | vmbreak; |
1809 | 0 | } |
1810 | 0 | vmcase(OP_TFORPREP) { |
1811 | 0 | StkId ra = RA(i); |
1812 | | /* create to-be-closed upvalue (if needed) */ |
1813 | 0 | halfProtect(luaF_newtbcupval(L, ra + 3)); |
1814 | 0 | pc += GETARG_Bx(i); |
1815 | 0 | i = *(pc++); /* go to next instruction */ |
1816 | 0 | lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); |
1817 | 0 | goto l_tforcall; |
1818 | 0 | } |
1819 | 0 | vmcase(OP_TFORCALL) { |
1820 | 0 | l_tforcall: { |
1821 | 0 | StkId ra = RA(i); |
1822 | | /* 'ra' has the iterator function, 'ra + 1' has the state, |
1823 | | 'ra + 2' has the control variable, and 'ra + 3' has the |
1824 | | to-be-closed variable. The call will use the stack after |
1825 | | these values (starting at 'ra + 4') |
1826 | | */ |
1827 | | /* push function, state, and control variable */ |
1828 | 0 | memcpy(ra + 4, ra, 3 * sizeof(*ra)); |
1829 | 0 | L->top.p = ra + 4 + 3; |
1830 | 0 | ProtectNT(luaD_call(L, ra + 4, GETARG_C(i))); /* do the call */ |
1831 | 0 | updatestack(ci); /* stack may have changed */ |
1832 | 0 | i = *(pc++); /* go to next instruction */ |
1833 | 0 | lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); |
1834 | 0 | goto l_tforloop; |
1835 | 0 | }} |
1836 | 0 | vmcase(OP_TFORLOOP) { |
1837 | 0 | l_tforloop: { |
1838 | 0 | StkId ra = RA(i); |
1839 | 0 | if (!ttisnil(s2v(ra + 4))) { /* continue loop? */ |
1840 | 0 | setobjs2s(L, ra + 2, ra + 4); /* save control variable */ |
1841 | 0 | pc -= GETARG_Bx(i); /* jump back */ |
1842 | 0 | } |
1843 | 0 | vmbreak; |
1844 | 0 | }} |
1845 | 0 | vmcase(OP_SETLIST) { |
1846 | 0 | StkId ra = RA(i); |
1847 | 0 | int n = GETARG_B(i); |
1848 | 0 | unsigned int last = GETARG_C(i); |
1849 | 0 | Table *h = hvalue(s2v(ra)); |
1850 | 0 | if (n == 0) |
1851 | 0 | n = cast_int(L->top.p - ra) - 1; /* get up to the top */ |
1852 | 0 | else |
1853 | 0 | L->top.p = ci->top.p; /* correct top in case of emergency GC */ |
1854 | 0 | last += n; |
1855 | 0 | if (TESTARG_k(i)) { |
1856 | 0 | last += GETARG_Ax(*pc) * (MAXARG_C + 1); |
1857 | 0 | pc++; |
1858 | 0 | } |
1859 | 0 | if (last > luaH_realasize(h)) /* needs more space? */ |
1860 | 0 | luaH_resizearray(L, h, last); /* preallocate it at once */ |
1861 | 0 | for (; n > 0; n--) { |
1862 | 0 | TValue *val = s2v(ra + n); |
1863 | 0 | setobj2t(L, &h->array[last - 1], val); |
1864 | 0 | last--; |
1865 | 0 | luaC_barrierback(L, obj2gco(h), val); |
1866 | 0 | } |
1867 | 0 | vmbreak; |
1868 | 0 | } |
1869 | 0 | vmcase(OP_CLOSURE) { |
1870 | 0 | StkId ra = RA(i); |
1871 | 0 | Proto *p = cl->p->p[GETARG_Bx(i)]; |
1872 | 0 | halfProtect(pushclosure(L, p, cl->upvals, base, ra)); |
1873 | 0 | checkGC(L, ra + 1); |
1874 | 0 | vmbreak; |
1875 | 0 | } |
1876 | 0 | vmcase(OP_VARARG) { |
1877 | 0 | StkId ra = RA(i); |
1878 | 0 | int n = GETARG_C(i) - 1; /* required results */ |
1879 | 0 | Protect(luaT_getvarargs(L, ci, ra, n)); |
1880 | 0 | vmbreak; |
1881 | 0 | } |
1882 | 0 | vmcase(OP_VARARGPREP) { |
1883 | 0 | ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); |
1884 | 0 | if (l_unlikely(trap)) { /* previous "Protect" updated trap */ |
1885 | 0 | luaD_hookcall(L, ci); |
1886 | 0 | L->oldpc = 1; /* next opcode will be seen as a "new" line */ |
1887 | 0 | } |
1888 | 0 | updatebase(ci); /* function has new base after adjustment */ |
1889 | 0 | vmbreak; |
1890 | 0 | } |
1891 | 0 | vmcase(OP_EXTRAARG) { |
1892 | 0 | lua_assert(0); |
1893 | 0 | vmbreak; |
1894 | 0 | } |
1895 | 0 | } |
1896 | 0 | } |
1897 | 0 | } |
1898 | | |
1899 | | /* }================================================================== */ |