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