lvm.c 23 KB

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