lvm.c 25 KB

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