lvm.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772
  1. /*
  2. ** $Id: lvm.c,v 2.119 2010/05/12 20:40:35 roberto Exp roberto $
  3. ** Lua virtual machine
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <stdio.h>
  7. #include <stdlib.h>
  8. #include <string.h>
  9. #define lvm_c
  10. #define LUA_CORE
  11. #include "lua.h"
  12. #include "ldebug.h"
  13. #include "ldo.h"
  14. #include "lfunc.h"
  15. #include "lgc.h"
  16. #include "lobject.h"
  17. #include "lopcodes.h"
  18. #include "lstate.h"
  19. #include "lstring.h"
  20. #include "ltable.h"
  21. #include "ltm.h"
  22. #include "lvm.h"
  23. /* limit for table tag-method chains (to avoid loops) */
  24. #define MAXTAGLOOP 100
  25. const TValue *luaV_tonumber (const TValue *obj, TValue *n) {
  26. lua_Number num;
  27. if (ttisnumber(obj)) return obj;
  28. if (ttisstring(obj) && luaO_str2d(svalue(obj), &num)) {
  29. setnvalue(n, num);
  30. return n;
  31. }
  32. else
  33. return NULL;
  34. }
  35. int luaV_tostring (lua_State *L, StkId obj) {
  36. if (!ttisnumber(obj))
  37. return 0;
  38. else {
  39. char s[LUAI_MAXNUMBER2STR];
  40. lua_Number n = nvalue(obj);
  41. int l = lua_number2str(s, n);
  42. setsvalue2s(L, obj, luaS_newlstr(L, s, l));
  43. return 1;
  44. }
  45. }
  46. static void traceexec (lua_State *L) {
  47. CallInfo *ci = L->ci;
  48. lu_byte mask = L->hookmask;
  49. if ((mask & LUA_MASKCOUNT) && L->hookcount == 0) {
  50. resethookcount(L);
  51. luaD_hook(L, LUA_HOOKCOUNT, -1);
  52. }
  53. if (mask & LUA_MASKLINE) {
  54. Proto *p = ci_func(ci)->l.p;
  55. int npc = pcRel(ci->u.l.savedpc, p);
  56. int newline = getfuncline(p, npc);
  57. if (npc == 0 || /* call linehook when enter a new function, */
  58. ci->u.l.savedpc <= L->oldpc || /* when jump back (loop), or when */
  59. newline != getfuncline(p, pcRel(L->oldpc, p))) /* enter a new line */
  60. luaD_hook(L, LUA_HOOKLINE, newline);
  61. }
  62. L->oldpc = ci->u.l.savedpc;
  63. if (L->status == LUA_YIELD) { /* did hook yield? */
  64. ci->u.l.savedpc--; /* undo increment (resume will increment it again) */
  65. luaD_throw(L, LUA_YIELD);
  66. }
  67. }
  68. static void callTM (lua_State *L, const TValue *f, const TValue *p1,
  69. const TValue *p2, TValue *p3, int hasres) {
  70. ptrdiff_t result = savestack(L, p3);
  71. setobj2s(L, L->top++, f); /* push function */
  72. setobj2s(L, L->top++, p1); /* 1st argument */
  73. setobj2s(L, L->top++, p2); /* 2nd argument */
  74. if (!hasres) /* no result? 'p3' is third argument */
  75. setobj2s(L, L->top++, p3); /* 3th argument */
  76. luaD_checkstack(L, 0);
  77. /* metamethod may yield only when called from Lua code */
  78. luaD_call(L, L->top - (4 - hasres), hasres, isLua(L->ci));
  79. if (hasres) { /* if has result, move it to its place */
  80. p3 = restorestack(L, result);
  81. setobjs2s(L, p3, --L->top);
  82. }
  83. }
  84. void luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) {
  85. int loop;
  86. for (loop = 0; loop < MAXTAGLOOP; loop++) {
  87. const TValue *tm;
  88. if (ttistable(t)) { /* `t' is a table? */
  89. Table *h = hvalue(t);
  90. const TValue *res = luaH_get(h, key); /* do a primitive get */
  91. if (!ttisnil(res) || /* result is not nil? */
  92. (tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */
  93. setobj2s(L, val, res);
  94. return;
  95. }
  96. /* else will try the tag method */
  97. }
  98. else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX)))
  99. luaG_typeerror(L, t, "index");
  100. if (ttisfunction(tm)) {
  101. callTM(L, tm, t, key, val, 1);
  102. return;
  103. }
  104. t = tm; /* else repeat with 'tm' */
  105. }
  106. luaG_runerror(L, "loop in gettable");
  107. }
  108. void luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) {
  109. int loop;
  110. TValue temp;
  111. for (loop = 0; loop < MAXTAGLOOP; loop++) {
  112. const TValue *tm;
  113. if (ttistable(t)) { /* `t' is a table? */
  114. Table *h = hvalue(t);
  115. TValue *oldval = luaH_set(L, h, key); /* do a primitive set */
  116. if (!ttisnil(oldval) || /* result is not nil? */
  117. (tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL) { /* or no TM? */
  118. setobj2t(L, oldval, val);
  119. luaC_barriert(L, h, val);
  120. return;
  121. }
  122. /* else will try the tag method */
  123. }
  124. else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX)))
  125. luaG_typeerror(L, t, "index");
  126. if (ttisfunction(tm)) {
  127. callTM(L, tm, t, key, val, 0);
  128. return;
  129. }
  130. /* else repeat with 'tm' */
  131. setobj(L, &temp, tm); /* avoid pointing inside table (may rehash) */
  132. t = &temp;
  133. }
  134. luaG_runerror(L, "loop in settable");
  135. }
  136. static int call_binTM (lua_State *L, const TValue *p1, const TValue *p2,
  137. StkId res, TMS event) {
  138. const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */
  139. if (ttisnil(tm))
  140. tm = luaT_gettmbyobj(L, p2, event); /* try second operand */
  141. if (ttisnil(tm)) return 0;
  142. if (event == TM_UNM) p2 = luaO_nilobject;
  143. callTM(L, tm, p1, p2, res, 1);
  144. return 1;
  145. }
  146. static const TValue *get_equalTM (lua_State *L, Table *mt1, Table *mt2,
  147. TMS event) {
  148. const TValue *tm1 = fasttm(L, mt1, event);
  149. const TValue *tm2;
  150. if (tm1 == NULL) return NULL; /* no metamethod */
  151. if (mt1 == mt2) return tm1; /* same metatables => same metamethods */
  152. tm2 = fasttm(L, mt2, event);
  153. if (tm2 == NULL) return NULL; /* no metamethod */
  154. if (luaO_rawequalObj(tm1, tm2)) /* same metamethods? */
  155. return tm1;
  156. return NULL;
  157. }
  158. static int call_orderTM (lua_State *L, const TValue *p1, const TValue *p2,
  159. TMS event) {
  160. if (!call_binTM(L, p1, p2, L->top, event))
  161. return -1; /* no metamethod */
  162. else
  163. return !l_isfalse(L->top);
  164. }
  165. static int l_strcmp (const TString *ls, const TString *rs) {
  166. const char *l = getstr(ls);
  167. size_t ll = ls->tsv.len;
  168. const char *r = getstr(rs);
  169. size_t lr = rs->tsv.len;
  170. for (;;) {
  171. int temp = strcoll(l, r);
  172. if (temp != 0) return temp;
  173. else { /* strings are equal up to a `\0' */
  174. size_t len = strlen(l); /* index of first `\0' in both strings */
  175. if (len == lr) /* r is finished? */
  176. return (len == ll) ? 0 : 1;
  177. else if (len == ll) /* l is finished? */
  178. return -1; /* l is smaller than r (because r is not finished) */
  179. /* both strings longer than `len'; go on comparing (after the `\0') */
  180. len++;
  181. l += len; ll -= len; r += len; lr -= len;
  182. }
  183. }
  184. }
  185. int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) {
  186. int res;
  187. if (ttisnumber(l) && ttisnumber(r))
  188. return luai_numlt(L, nvalue(l), nvalue(r));
  189. else if (ttisstring(l) && ttisstring(r))
  190. return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0;
  191. else if ((res = call_orderTM(L, l, r, TM_LT)) != -1)
  192. return res;
  193. return luaG_ordererror(L, l, r);
  194. }
  195. int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) {
  196. int res;
  197. if (ttisnumber(l) && ttisnumber(r))
  198. return luai_numle(L, nvalue(l), nvalue(r));
  199. else if (ttisstring(l) && ttisstring(r))
  200. return l_strcmp(rawtsvalue(l), rawtsvalue(r)) <= 0;
  201. else if ((res = call_orderTM(L, l, r, TM_LE)) != -1) /* first try `le' */
  202. return res;
  203. else if ((res = call_orderTM(L, r, l, TM_LT)) != -1) /* else try `lt' */
  204. return !res;
  205. return luaG_ordererror(L, l, r);
  206. }
  207. int luaV_equalval_ (lua_State *L, const TValue *t1, const TValue *t2) {
  208. const TValue *tm;
  209. lua_assert(ttype(t1) == ttype(t2));
  210. switch (ttype(t1)) {
  211. case LUA_TNIL: return 1;
  212. case LUA_TNUMBER: return luai_numeq(nvalue(t1), nvalue(t2));
  213. case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2); /* true must be 1 !! */
  214. case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2);
  215. case LUA_TLCF: return fvalue(t1) == fvalue(t2);
  216. case LUA_TSTRING: return eqstr(rawtsvalue(t1), rawtsvalue(t2));
  217. case LUA_TUSERDATA: {
  218. if (uvalue(t1) == uvalue(t2)) return 1;
  219. tm = get_equalTM(L, uvalue(t1)->metatable, uvalue(t2)->metatable, TM_EQ);
  220. break; /* will try TM */
  221. }
  222. case LUA_TTABLE: {
  223. if (hvalue(t1) == hvalue(t2)) return 1;
  224. tm = get_equalTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ);
  225. break; /* will try TM */
  226. }
  227. default: return gcvalue(t1) == gcvalue(t2);
  228. }
  229. if (tm == NULL) return 0; /* no TM? */
  230. callTM(L, tm, t1, t2, L->top, 1); /* call TM */
  231. return !l_isfalse(L->top);
  232. }
  233. void luaV_concat (lua_State *L, int total) {
  234. lua_assert(total >= 2);
  235. do {
  236. StkId top = L->top;
  237. int n = 2; /* number of elements handled in this pass (at least 2) */
  238. if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {
  239. if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
  240. luaG_concaterror(L, top-2, top-1);
  241. }
  242. else if (tsvalue(top-1)->len == 0) /* second operand is empty? */
  243. (void)tostring(L, top - 2); /* result is first operand */
  244. else if (ttisstring(top-2) && tsvalue(top-2)->len == 0) {
  245. setsvalue2s(L, top-2, rawtsvalue(top-1)); /* result is second op. */
  246. }
  247. else {
  248. /* at least two non-empty string values; get as many as possible */
  249. size_t tl = tsvalue(top-1)->len;
  250. char *buffer;
  251. int i;
  252. /* collect total length */
  253. for (n = 1; n < total && tostring(L, top-n-1); n++) {
  254. size_t l = tsvalue(top-n-1)->len;
  255. if (l >= MAX_SIZET - tl) luaG_runerror(L, "string length overflow");
  256. tl += l;
  257. }
  258. buffer = luaZ_openspace(L, &G(L)->buff, tl);
  259. tl = 0;
  260. for (i=n; i>0; i--) { /* concat all strings */
  261. size_t l = tsvalue(top-i)->len;
  262. memcpy(buffer+tl, svalue(top-i), l);
  263. tl += l;
  264. }
  265. setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));
  266. }
  267. total -= n-1; /* got 'n' strings to create 1 new */
  268. L->top -= n-1; /* poped 'n' strings and pushed one */
  269. } while (total > 1); /* repeat until only 1 result left */
  270. }
  271. void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) {
  272. const TValue *tm;
  273. switch (ttype(rb)) {
  274. case LUA_TTABLE: {
  275. Table *h = hvalue(rb);
  276. tm = fasttm(L, h->metatable, TM_LEN);
  277. if (tm) break; /* metamethod? break switch to call it */
  278. setnvalue(ra, cast_num(luaH_getn(h))); /* else primitive len */
  279. return;
  280. }
  281. case LUA_TSTRING: {
  282. setnvalue(ra, cast_num(tsvalue(rb)->len));
  283. return;
  284. }
  285. default: { /* try metamethod */
  286. tm = luaT_gettmbyobj(L, rb, TM_LEN);
  287. if (ttisnil(tm)) /* no metamethod? */
  288. luaG_typeerror(L, rb, "get length of");
  289. break;
  290. }
  291. }
  292. callTM(L, tm, rb, luaO_nilobject, ra, 1);
  293. }
  294. void luaV_arith (lua_State *L, StkId ra, const TValue *rb,
  295. const TValue *rc, TMS op) {
  296. TValue tempb, tempc;
  297. const TValue *b, *c;
  298. if ((b = luaV_tonumber(rb, &tempb)) != NULL &&
  299. (c = luaV_tonumber(rc, &tempc)) != NULL) {
  300. lua_Number res = luaO_arith(op - TM_ADD + LUA_OPADD, nvalue(b), nvalue(c));
  301. setnvalue(ra, res);
  302. }
  303. else if (!call_binTM(L, rb, rc, ra, op))
  304. luaG_aritherror(L, rb, rc);
  305. }
  306. /*
  307. ** finish execution of an opcode interrupted by an yield
  308. */
  309. void luaV_finishOp (lua_State *L) {
  310. CallInfo *ci = L->ci;
  311. StkId base = ci->u.l.base;
  312. Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */
  313. OpCode op = GET_OPCODE(inst);
  314. switch (op) { /* finish its execution */
  315. case OP_ADD: case OP_SUB: case OP_MUL: case OP_DIV:
  316. case OP_MOD: case OP_POW: case OP_UNM: case OP_LEN:
  317. case OP_GETTABUP: case OP_GETTABLE: case OP_SELF: {
  318. setobjs2s(L, base + GETARG_A(inst), --L->top);
  319. break;
  320. }
  321. case OP_LE: case OP_LT: case OP_EQ: {
  322. int res = !l_isfalse(L->top - 1);
  323. L->top--;
  324. /* metamethod should not be called when operand is K */
  325. lua_assert(!ISK(GETARG_B(inst)));
  326. if (op == OP_LE && /* "<=" using "<" instead? */
  327. ttisnil(luaT_gettmbyobj(L, base + GETARG_B(inst), TM_LE)))
  328. res = !res; /* invert result */
  329. lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP);
  330. if (res != GETARG_A(inst)) /* condition failed? */
  331. ci->u.l.savedpc++; /* skip jump instruction */
  332. break;
  333. }
  334. case OP_CONCAT: {
  335. StkId top = L->top - 1; /* top when 'call_binTM' was called */
  336. int b = GETARG_B(inst); /* first element to concatenate */
  337. int total = top - 1 - (base + b); /* elements yet to concatenate */
  338. setobj2s(L, top - 2, top); /* put TM result in proper position */
  339. if (total > 1) { /* are there elements to concat? */
  340. L->top = top - 1; /* top is one after last element (at top-2) */
  341. luaV_concat(L, total); /* concat them (may yield again) */
  342. }
  343. /* move final result to final position */
  344. setobj2s(L, ci->u.l.base + GETARG_A(inst), L->top - 1);
  345. L->top = ci->top; /* restore top */
  346. break;
  347. }
  348. case OP_TFORCALL: {
  349. lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_TFORLOOP);
  350. L->top = ci->top; /* correct top */
  351. break;
  352. }
  353. case OP_CALL: {
  354. if (GETARG_C(inst) - 1 >= 0) /* nresults >= 0? */
  355. L->top = ci->top; /* adjust results */
  356. break;
  357. }
  358. case OP_TAILCALL: case OP_SETTABUP: case OP_SETTABLE:
  359. break;
  360. default: lua_assert(0);
  361. }
  362. }
  363. /*
  364. ** some macros for common tasks in `luaV_execute'
  365. */
  366. #define RA(i) (base+GETARG_A(i))
  367. /* to be used after possible stack reallocation */
  368. #define RB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i))
  369. #define RC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i))
  370. #define RKB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgK, \
  371. ISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i))
  372. #define RKC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgK, \
  373. ISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i))
  374. #define KBx(i) \
  375. (k + (GETARG_Bx(i) != 0 ? GETARG_Bx(i) - 1 : GETARG_Ax(*ci->u.l.savedpc++)))
  376. #define dojump(i) (ci->u.l.savedpc += (i))
  377. #define Protect(x) { {x;}; base = ci->u.l.base; }
  378. #define checkGC(L) Protect(luaC_checkGC(L); luai_threadyield(L);)
  379. #define arith_op(op,tm) { \
  380. TValue *rb = RKB(i); \
  381. TValue *rc = RKC(i); \
  382. if (ttisnumber(rb) && ttisnumber(rc)) { \
  383. lua_Number nb = nvalue(rb), nc = nvalue(rc); \
  384. setnvalue(ra, op(L, nb, nc)); \
  385. } \
  386. else { Protect(luaV_arith(L, ra, rb, rc, tm)); } }
  387. #define vmdispatch(o) switch(o)
  388. #define vmcase(l,b) case l: {b} break;
  389. void luaV_execute (lua_State *L) {
  390. CallInfo *ci = L->ci;
  391. LClosure *cl;
  392. TValue *k;
  393. StkId base;
  394. newframe: /* reentry point when frame changes (call/return) */
  395. lua_assert(isLua(ci));
  396. lua_assert(ci == L->ci);
  397. cl = &clvalue(ci->func)->l;
  398. k = cl->p->k;
  399. base = ci->u.l.base;
  400. /* main loop of interpreter */
  401. for (;;) {
  402. Instruction i = *(ci->u.l.savedpc++);
  403. StkId ra;
  404. if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) &&
  405. (--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) {
  406. Protect(traceexec(L));
  407. }
  408. /* warning!! several calls may realloc the stack and invalidate `ra' */
  409. ra = RA(i);
  410. lua_assert(base == ci->u.l.base);
  411. lua_assert(base <= L->top && L->top < L->stack + L->stacksize);
  412. vmdispatch (GET_OPCODE(i)) {
  413. vmcase(OP_MOVE,
  414. setobjs2s(L, ra, RB(i));
  415. )
  416. vmcase(OP_LOADK,
  417. TValue *rb = KBx(i);
  418. setobj2s(L, ra, rb);
  419. )
  420. vmcase(OP_LOADBOOL,
  421. setbvalue(ra, GETARG_B(i));
  422. if (GETARG_C(i)) ci->u.l.savedpc++; /* skip next instruction (if C) */
  423. )
  424. vmcase(OP_LOADNIL,
  425. TValue *rb = RB(i);
  426. do {
  427. setnilvalue(rb--);
  428. } while (rb >= ra);
  429. )
  430. vmcase(OP_GETUPVAL,
  431. int b = GETARG_B(i);
  432. setobj2s(L, ra, cl->upvals[b]->v);
  433. )
  434. vmcase(OP_GETTABUP,
  435. int b = GETARG_B(i);
  436. Protect(luaV_gettable(L, cl->upvals[b]->v, RKC(i), ra));
  437. )
  438. vmcase(OP_GETTABLE,
  439. Protect(luaV_gettable(L, RB(i), RKC(i), ra));
  440. )
  441. vmcase(OP_SETTABUP,
  442. int a = GETARG_A(i);
  443. Protect(luaV_settable(L, cl->upvals[a]->v, RKB(i), RKC(i)));
  444. )
  445. vmcase(OP_SETUPVAL,
  446. UpVal *uv = cl->upvals[GETARG_B(i)];
  447. setobj(L, uv->v, ra);
  448. luaC_barrier(L, uv, ra);
  449. )
  450. vmcase(OP_SETTABLE,
  451. Protect(luaV_settable(L, ra, RKB(i), RKC(i)));
  452. )
  453. vmcase(OP_NEWTABLE,
  454. int b = GETARG_B(i);
  455. int c = GETARG_C(i);
  456. Table *t = luaH_new(L);
  457. sethvalue(L, ra, t);
  458. if (b != 0 || c != 0)
  459. luaH_resize(L, t, luaO_fb2int(b), luaO_fb2int(c));
  460. checkGC(L);
  461. )
  462. vmcase(OP_SELF,
  463. StkId rb = RB(i);
  464. setobjs2s(L, ra+1, rb);
  465. Protect(luaV_gettable(L, rb, RKC(i), ra));
  466. )
  467. vmcase(OP_ADD,
  468. arith_op(luai_numadd, TM_ADD);
  469. )
  470. vmcase(OP_SUB,
  471. arith_op(luai_numsub, TM_SUB);
  472. )
  473. vmcase(OP_MUL,
  474. arith_op(luai_nummul, TM_MUL);
  475. )
  476. vmcase(OP_DIV,
  477. arith_op(luai_numdiv, TM_DIV);
  478. )
  479. vmcase(OP_MOD,
  480. arith_op(luai_nummod, TM_MOD);
  481. )
  482. vmcase(OP_POW,
  483. arith_op(luai_numpow, TM_POW);
  484. )
  485. vmcase(OP_UNM,
  486. TValue *rb = RB(i);
  487. if (ttisnumber(rb)) {
  488. lua_Number nb = nvalue(rb);
  489. setnvalue(ra, luai_numunm(L, nb));
  490. }
  491. else {
  492. Protect(luaV_arith(L, ra, rb, rb, TM_UNM));
  493. }
  494. )
  495. vmcase(OP_NOT,
  496. int res = l_isfalse(RB(i)); /* next assignment may change this value */
  497. setbvalue(ra, res);
  498. )
  499. vmcase(OP_LEN,
  500. Protect(luaV_objlen(L, ra, RB(i)));
  501. )
  502. vmcase(OP_CONCAT,
  503. int b = GETARG_B(i);
  504. int c = GETARG_C(i);
  505. L->top = base + c + 1; /* mark the end of concat operands */
  506. Protect(luaV_concat(L, c-b+1); checkGC(L);)
  507. L->top = ci->top; /* restore top */
  508. setobjs2s(L, RA(i), base+b);
  509. )
  510. vmcase(OP_JMP,
  511. dojump(GETARG_sBx(i));
  512. )
  513. vmcase(OP_EQ,
  514. TValue *rb = RKB(i);
  515. TValue *rc = RKC(i);
  516. Protect(
  517. if (equalobj(L, rb, rc) == GETARG_A(i))
  518. dojump(GETARG_sBx(*ci->u.l.savedpc));
  519. )
  520. ci->u.l.savedpc++;
  521. )
  522. vmcase(OP_LT,
  523. Protect(
  524. if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))
  525. dojump(GETARG_sBx(*ci->u.l.savedpc));
  526. )
  527. ci->u.l.savedpc++;
  528. )
  529. vmcase(OP_LE,
  530. Protect(
  531. if (luaV_lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))
  532. dojump(GETARG_sBx(*ci->u.l.savedpc));
  533. )
  534. ci->u.l.savedpc++;
  535. )
  536. vmcase(OP_TEST,
  537. if (GETARG_C(i) ? !l_isfalse(ra) : l_isfalse(ra))
  538. dojump(GETARG_sBx(*ci->u.l.savedpc));
  539. ci->u.l.savedpc++;
  540. )
  541. vmcase(OP_TESTSET,
  542. TValue *rb = RB(i);
  543. if (GETARG_C(i) ? !l_isfalse(rb) : l_isfalse(rb)) {
  544. setobjs2s(L, ra, rb);
  545. dojump(GETARG_sBx(*ci->u.l.savedpc));
  546. }
  547. ci->u.l.savedpc++;
  548. )
  549. vmcase(OP_CALL,
  550. int b = GETARG_B(i);
  551. int nresults = GETARG_C(i) - 1;
  552. if (b != 0) L->top = ra+b; /* else previous instruction set top */
  553. if (luaD_precall(L, ra, nresults)) { /* C function? */
  554. if (nresults >= 0) L->top = ci->top; /* adjust results */
  555. base = ci->u.l.base;
  556. }
  557. else { /* Lua function */
  558. ci = L->ci;
  559. ci->callstatus |= CIST_REENTRY;
  560. goto newframe; /* restart luaV_execute over new Lua function */
  561. }
  562. )
  563. vmcase(OP_TAILCALL,
  564. int b = GETARG_B(i);
  565. if (b != 0) L->top = ra+b; /* else previous instruction set top */
  566. lua_assert(GETARG_C(i) - 1 == LUA_MULTRET);
  567. if (luaD_precall(L, ra, LUA_MULTRET)) /* C function? */
  568. base = ci->u.l.base;
  569. else {
  570. /* tail call: put called frame (n) in place of caller one (o) */
  571. CallInfo *nci = L->ci; /* called frame */
  572. CallInfo *oci = nci->previous; /* caller frame */
  573. StkId nfunc = nci->func; /* called function */
  574. StkId ofunc = oci->func; /* caller function */
  575. /* last stack slot filled by 'precall' */
  576. StkId lim = nci->u.l.base + getproto(nfunc)->numparams;
  577. int aux;
  578. /* close all upvalues from previous call */
  579. if (cl->p->sizep > 0) luaF_close(L, oci->u.l.base);
  580. /* move new frame into old one */
  581. for (aux = 0; nfunc + aux < lim; aux++)
  582. setobjs2s(L, ofunc + aux, nfunc + aux);
  583. oci->u.l.base = ofunc + (nci->u.l.base - nfunc); /* correct base */
  584. oci->top = L->top = ofunc + (L->top - nfunc); /* correct top */
  585. oci->u.l.savedpc = nci->u.l.savedpc;
  586. oci->callstatus |= CIST_TAIL; /* function was tail called */
  587. ci = L->ci = oci; /* remove new frame */
  588. lua_assert(L->top == oci->u.l.base + getproto(ofunc)->maxstacksize);
  589. goto newframe; /* restart luaV_execute over new Lua function */
  590. }
  591. )
  592. vmcase(OP_RETURN,
  593. int b = GETARG_B(i);
  594. if (b != 0) L->top = ra+b-1;
  595. if (cl->p->sizep > 0) luaF_close(L, base);
  596. b = luaD_poscall(L, ra);
  597. if (!(ci->callstatus & CIST_REENTRY)) /* 'ci' still the called one */
  598. return; /* external invocation: return */
  599. else { /* invocation via reentry: continue execution */
  600. ci = L->ci;
  601. if (b) L->top = ci->top;
  602. lua_assert(isLua(ci));
  603. lua_assert(GET_OPCODE(*((ci)->u.l.savedpc - 1)) == OP_CALL);
  604. goto newframe; /* restart luaV_execute over new Lua function */
  605. }
  606. )
  607. vmcase(OP_FORLOOP,
  608. lua_Number step = nvalue(ra+2);
  609. lua_Number idx = luai_numadd(L, nvalue(ra), step); /* increment index */
  610. lua_Number limit = nvalue(ra+1);
  611. if (luai_numlt(L, 0, step) ? luai_numle(L, idx, limit)
  612. : luai_numle(L, limit, idx)) {
  613. dojump(GETARG_sBx(i)); /* jump back */
  614. setnvalue(ra, idx); /* update internal index... */
  615. setnvalue(ra+3, idx); /* ...and external index */
  616. }
  617. )
  618. vmcase(OP_FORPREP,
  619. const TValue *init = ra;
  620. const TValue *plimit = ra+1;
  621. const TValue *pstep = ra+2;
  622. if (!tonumber(init, ra))
  623. luaG_runerror(L, LUA_QL("for") " initial value must be a number");
  624. else if (!tonumber(plimit, ra+1))
  625. luaG_runerror(L, LUA_QL("for") " limit must be a number");
  626. else if (!tonumber(pstep, ra+2))
  627. luaG_runerror(L, LUA_QL("for") " step must be a number");
  628. setnvalue(ra, luai_numsub(L, nvalue(ra), nvalue(pstep)));
  629. dojump(GETARG_sBx(i));
  630. )
  631. vmcase(OP_TFORCALL,
  632. StkId cb = ra + 3; /* call base */
  633. setobjs2s(L, cb+2, ra+2);
  634. setobjs2s(L, cb+1, ra+1);
  635. setobjs2s(L, cb, ra);
  636. L->top = cb + 3; /* func. + 2 args (state and index) */
  637. Protect(luaD_call(L, cb, GETARG_C(i), 1));
  638. L->top = ci->top;
  639. i = *(ci->u.l.savedpc++); /* go to next instruction */
  640. ra = RA(i);
  641. lua_assert(GET_OPCODE(i) == OP_TFORLOOP);
  642. goto l_tforloop;
  643. )
  644. vmcase(OP_TFORLOOP,
  645. l_tforloop:
  646. if (!ttisnil(ra + 1)) { /* continue loop? */
  647. setobjs2s(L, ra, ra + 1); /* save control variable */
  648. dojump(GETARG_sBx(i)); /* jump back */
  649. }
  650. )
  651. vmcase(OP_SETLIST,
  652. int n = GETARG_B(i);
  653. int c = GETARG_C(i);
  654. int last;
  655. Table *h;
  656. if (n == 0) n = cast_int(L->top - ra) - 1;
  657. if (c == 0) {
  658. lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_EXTRAARG);
  659. c = GETARG_Ax(*ci->u.l.savedpc++);
  660. }
  661. h = hvalue(ra);
  662. last = ((c-1)*LFIELDS_PER_FLUSH) + n;
  663. if (last > h->sizearray) /* needs more space? */
  664. luaH_resizearray(L, h, last); /* pre-allocate it at once */
  665. for (; n > 0; n--) {
  666. TValue *val = ra+n;
  667. setobj2t(L, luaH_setint(L, h, last--), val);
  668. luaC_barriert(L, h, val);
  669. }
  670. L->top = ci->top; /* correct top (in case of previous open call) */
  671. )
  672. vmcase(OP_CLOSE,
  673. luaF_close(L, ra);
  674. )
  675. vmcase(OP_CLOSURE,
  676. Proto *p = cl->p->p[GETARG_Bx(i)]; /* prototype for new closure */
  677. int nup = p->sizeupvalues;
  678. Closure *ncl = luaF_newLclosure(L, nup);
  679. Upvaldesc *uv = p->upvalues;
  680. int j;
  681. ncl->l.p = p;
  682. setclvalue(L, ra, ncl); /* anchor new closure in stack */
  683. for (j = 0; j < nup; j++) { /* fill in upvalues */
  684. if (uv[j].instack) /* upvalue refers to local variable? */
  685. ncl->l.upvals[j] = luaF_findupval(L, base + uv[j].idx);
  686. else /* get upvalue from enclosing function */
  687. ncl->l.upvals[j] = cl->upvals[uv[j].idx];
  688. }
  689. checkGC(L);
  690. )
  691. vmcase(OP_VARARG,
  692. int b = GETARG_B(i) - 1;
  693. int j;
  694. int n = cast_int(base - ci->func) - cl->p->numparams - 1;
  695. if (b < 0) { /* B == 0? */
  696. b = n; /* get all var. arguments */
  697. Protect(luaD_checkstack(L, n));
  698. ra = RA(i); /* previous call may change the stack */
  699. L->top = ra + n;
  700. }
  701. for (j = 0; j < b; j++) {
  702. if (j < n) {
  703. setobjs2s(L, ra + j, base - n + j);
  704. }
  705. else {
  706. setnilvalue(ra + j);
  707. }
  708. }
  709. )
  710. vmcase(OP_EXTRAARG,
  711. lua_assert(0);
  712. )
  713. }
  714. }
  715. }