lvm.c 22 KB

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