lvm.c 25 KB

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