lparser.c 37 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374
  1. /*
  2. ** $Id: lparser.c,v 2.42.1.3 2007/12/28 15:32:23 roberto Exp $
  3. ** Lua Parser
  4. ** See Copyright Notice in lua.h
  5. */
  6. #define lparser_c
  7. #define LUA_CORE
  8. #define LUAC_CROSS_FILE
  9. #include "lua.h"
  10. #include C_HEADER_STRING
  11. #include "lcode.h"
  12. #include "ldebug.h"
  13. #include "ldo.h"
  14. #include "lfunc.h"
  15. #include "llex.h"
  16. #include "lmem.h"
  17. #include "lobject.h"
  18. #include "lopcodes.h"
  19. #include "lparser.h"
  20. #include "lstate.h"
  21. #include "lstring.h"
  22. #include "ltable.h"
  23. #define hasmultret(k) ((k) == VCALL || (k) == VVARARG)
  24. #define getlocvar(fs, i) ((fs)->f->locvars[(fs)->actvar[i]])
  25. #define luaY_checklimit(fs,v,l,m) if ((v)>(l)) errorlimit(fs,l,m)
  26. /*
  27. ** nodes for block list (list of active blocks)
  28. */
  29. typedef struct BlockCnt {
  30. struct BlockCnt *previous; /* chain */
  31. int breaklist; /* list of jumps out of this loop */
  32. lu_byte nactvar; /* # active locals outside the breakable structure */
  33. lu_byte upval; /* true if some variable in the block is an upvalue */
  34. lu_byte isbreakable; /* true if `block' is a loop */
  35. } BlockCnt;
  36. /*
  37. ** prototypes for recursive non-terminal functions
  38. */
  39. static void chunk (LexState *ls);
  40. static void expr (LexState *ls, expdesc *v);
  41. static void anchor_token (LexState *ls) {
  42. if (ls->t.token == TK_NAME || ls->t.token == TK_STRING) {
  43. TString *ts = ls->t.seminfo.ts;
  44. luaX_newstring(ls, getstr(ts), ts->tsv.len);
  45. }
  46. }
  47. static void error_expected (LexState *ls, int token) {
  48. luaX_syntaxerror(ls,
  49. luaO_pushfstring(ls->L, LUA_QS " expected", luaX_token2str(ls, token)));
  50. }
  51. static void errorlimit (FuncState *fs, int limit, const char *what) {
  52. const char *msg = (fs->f->linedefined == 0) ?
  53. luaO_pushfstring(fs->L, "main function has more than %d %s", limit, what) :
  54. luaO_pushfstring(fs->L, "function at line %d has more than %d %s",
  55. fs->f->linedefined, limit, what);
  56. luaX_lexerror(fs->ls, msg, 0);
  57. }
  58. static int testnext (LexState *ls, int c) {
  59. if (ls->t.token == c) {
  60. luaX_next(ls);
  61. return 1;
  62. }
  63. else return 0;
  64. }
  65. static void check (LexState *ls, int c) {
  66. if (ls->t.token != c)
  67. error_expected(ls, c);
  68. }
  69. static void checknext (LexState *ls, int c) {
  70. check(ls, c);
  71. luaX_next(ls);
  72. }
  73. #define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); }
  74. static void check_match (LexState *ls, int what, int who, int where) {
  75. if (!testnext(ls, what)) {
  76. if (where == ls->linenumber)
  77. error_expected(ls, what);
  78. else {
  79. luaX_syntaxerror(ls, luaO_pushfstring(ls->L,
  80. LUA_QS " expected (to close " LUA_QS " at line %d)",
  81. luaX_token2str(ls, what), luaX_token2str(ls, who), where));
  82. }
  83. }
  84. }
  85. static TString *str_checkname (LexState *ls) {
  86. TString *ts;
  87. check(ls, TK_NAME);
  88. ts = ls->t.seminfo.ts;
  89. luaX_next(ls);
  90. return ts;
  91. }
  92. static void init_exp (expdesc *e, expkind k, int i) {
  93. e->f = e->t = NO_JUMP;
  94. e->k = k;
  95. e->u.s.info = i;
  96. }
  97. static void codestring (LexState *ls, expdesc *e, TString *s) {
  98. init_exp(e, VK, luaK_stringK(ls->fs, s));
  99. }
  100. static void checkname(LexState *ls, expdesc *e) {
  101. codestring(ls, e, str_checkname(ls));
  102. }
  103. static int registerlocalvar (LexState *ls, TString *varname) {
  104. FuncState *fs = ls->fs;
  105. Proto *f = fs->f;
  106. int oldsize = f->sizelocvars;
  107. luaM_growvector(ls->L, f->locvars, fs->nlocvars, f->sizelocvars,
  108. LocVar, SHRT_MAX, "too many local variables");
  109. while (oldsize < f->sizelocvars) f->locvars[oldsize++].varname = NULL;
  110. f->locvars[fs->nlocvars].varname = varname;
  111. luaC_objbarrier(ls->L, f, varname);
  112. return fs->nlocvars++;
  113. }
  114. #define new_localvarliteral(ls,v,n) \
  115. new_localvar(ls, luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char))-1), n)
  116. static void new_localvar (LexState *ls, TString *name, int n) {
  117. FuncState *fs = ls->fs;
  118. luaY_checklimit(fs, fs->nactvar+n+1, LUAI_MAXVARS, "local variables");
  119. fs->actvar[fs->nactvar+n] = cast(unsigned short, registerlocalvar(ls, name));
  120. }
  121. static void adjustlocalvars (LexState *ls, int nvars) {
  122. FuncState *fs = ls->fs;
  123. fs->nactvar = cast_byte(fs->nactvar + nvars);
  124. for (; nvars; nvars--) {
  125. getlocvar(fs, fs->nactvar - nvars).startpc = fs->pc;
  126. }
  127. }
  128. static void removevars (LexState *ls, int tolevel) {
  129. FuncState *fs = ls->fs;
  130. while (fs->nactvar > tolevel)
  131. getlocvar(fs, --fs->nactvar).endpc = fs->pc;
  132. }
  133. static int indexupvalue (FuncState *fs, TString *name, expdesc *v) {
  134. int i;
  135. Proto *f = fs->f;
  136. int oldsize = f->sizeupvalues;
  137. for (i=0; i<f->nups; i++) {
  138. if (fs->upvalues[i].k == v->k && fs->upvalues[i].info == v->u.s.info) {
  139. lua_assert(f->upvalues[i] == name);
  140. return i;
  141. }
  142. }
  143. /* new one */
  144. luaY_checklimit(fs, f->nups + 1, LUAI_MAXUPVALUES, "upvalues");
  145. luaM_growvector(fs->L, f->upvalues, f->nups, f->sizeupvalues,
  146. TString *, MAX_INT, "");
  147. while (oldsize < f->sizeupvalues) f->upvalues[oldsize++] = NULL;
  148. f->upvalues[f->nups] = name;
  149. luaC_objbarrier(fs->L, f, name);
  150. lua_assert(v->k == VLOCAL || v->k == VUPVAL);
  151. fs->upvalues[f->nups].k = cast_byte(v->k);
  152. fs->upvalues[f->nups].info = cast_byte(v->u.s.info);
  153. return f->nups++;
  154. }
  155. static int searchvar (FuncState *fs, TString *n) {
  156. int i;
  157. for (i=fs->nactvar-1; i >= 0; i--) {
  158. if (n == getlocvar(fs, i).varname)
  159. return i;
  160. }
  161. return -1; /* not found */
  162. }
  163. static void markupval (FuncState *fs, int level) {
  164. BlockCnt *bl = fs->bl;
  165. while (bl && bl->nactvar > level) bl = bl->previous;
  166. if (bl) bl->upval = 1;
  167. }
  168. static int singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) {
  169. if (fs == NULL) { /* no more levels? */
  170. init_exp(var, VGLOBAL, NO_REG); /* default is global variable */
  171. return VGLOBAL;
  172. }
  173. else {
  174. int v = searchvar(fs, n); /* look up at current level */
  175. if (v >= 0) {
  176. init_exp(var, VLOCAL, v);
  177. if (!base)
  178. markupval(fs, v); /* local will be used as an upval */
  179. return VLOCAL;
  180. }
  181. else { /* not found at current level; try upper one */
  182. if (singlevaraux(fs->prev, n, var, 0) == VGLOBAL)
  183. return VGLOBAL;
  184. var->u.s.info = indexupvalue(fs, n, var); /* else was LOCAL or UPVAL */
  185. var->k = VUPVAL; /* upvalue in this level */
  186. return VUPVAL;
  187. }
  188. }
  189. }
  190. static void singlevar (LexState *ls, expdesc *var) {
  191. TString *varname = str_checkname(ls);
  192. FuncState *fs = ls->fs;
  193. if (singlevaraux(fs, varname, var, 1) == VGLOBAL)
  194. var->u.s.info = luaK_stringK(fs, varname); /* info points to global name */
  195. }
  196. static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) {
  197. FuncState *fs = ls->fs;
  198. int extra = nvars - nexps;
  199. if (hasmultret(e->k)) {
  200. extra++; /* includes call itself */
  201. if (extra < 0) extra = 0;
  202. luaK_setreturns(fs, e, extra); /* last exp. provides the difference */
  203. if (extra > 1) luaK_reserveregs(fs, extra-1);
  204. }
  205. else {
  206. if (e->k != VVOID) luaK_exp2nextreg(fs, e); /* close last expression */
  207. if (extra > 0) {
  208. int reg = fs->freereg;
  209. luaK_reserveregs(fs, extra);
  210. luaK_nil(fs, reg, extra);
  211. }
  212. }
  213. }
  214. static void enterlevel (LexState *ls) {
  215. if (++ls->L->nCcalls > LUAI_MAXCCALLS)
  216. luaX_lexerror(ls, "chunk has too many syntax levels", 0);
  217. }
  218. #define leavelevel(ls) ((ls)->L->nCcalls--)
  219. static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isbreakable) {
  220. bl->breaklist = NO_JUMP;
  221. bl->isbreakable = isbreakable;
  222. bl->nactvar = fs->nactvar;
  223. bl->upval = 0;
  224. bl->previous = fs->bl;
  225. fs->bl = bl;
  226. lua_assert(fs->freereg == fs->nactvar);
  227. }
  228. static void leaveblock (FuncState *fs) {
  229. BlockCnt *bl = fs->bl;
  230. fs->bl = bl->previous;
  231. removevars(fs->ls, bl->nactvar);
  232. if (bl->upval)
  233. luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);
  234. /* a block either controls scope or breaks (never both) */
  235. lua_assert(!bl->isbreakable || !bl->upval);
  236. lua_assert(bl->nactvar == fs->nactvar);
  237. fs->freereg = fs->nactvar; /* free registers */
  238. luaK_patchtohere(fs, bl->breaklist);
  239. }
  240. static void pushclosure (LexState *ls, FuncState *func, expdesc *v) {
  241. FuncState *fs = ls->fs;
  242. Proto *f = fs->f;
  243. int oldsize = f->sizep;
  244. int i;
  245. luaM_growvector(ls->L, f->p, fs->np, f->sizep, Proto *,
  246. MAXARG_Bx, "constant table overflow");
  247. while (oldsize < f->sizep) f->p[oldsize++] = NULL;
  248. f->p[fs->np++] = func->f;
  249. luaC_objbarrier(ls->L, f, func->f);
  250. init_exp(v, VRELOCABLE, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np-1));
  251. for (i=0; i<func->f->nups; i++) {
  252. OpCode o = (func->upvalues[i].k == VLOCAL) ? OP_MOVE : OP_GETUPVAL;
  253. luaK_codeABC(fs, o, 0, func->upvalues[i].info, 0);
  254. }
  255. }
  256. static void open_func (LexState *ls, FuncState *fs) {
  257. lua_State *L = ls->L;
  258. Proto *f = luaF_newproto(L);
  259. fs->f = f;
  260. fs->prev = ls->fs; /* linked list of funcstates */
  261. fs->ls = ls;
  262. fs->L = L;
  263. ls->fs = fs;
  264. fs->pc = 0;
  265. fs->lasttarget = -1;
  266. fs->jpc = NO_JUMP;
  267. fs->freereg = 0;
  268. fs->nk = 0;
  269. fs->np = 0;
  270. fs->nlocvars = 0;
  271. fs->nactvar = 0;
  272. fs->bl = NULL;
  273. f->source = ls->source;
  274. f->maxstacksize = 2; /* registers 0/1 are always valid */
  275. #ifdef LUA_OPTIMIZE_DEBUG
  276. fs->packedlineinfoSize = 0;
  277. fs->lastline = 0;
  278. fs->lastlineOffset = 0;
  279. fs->lineinfoLastPC = -1;
  280. #endif
  281. fs->h = luaH_new(L, 0, 0);
  282. /* anchor table of constants and prototype (to avoid being collected) */
  283. sethvalue2s(L, L->top, fs->h);
  284. incr_top(L);
  285. setptvalue2s(L, L->top, f);
  286. incr_top(L);
  287. }
  288. static void close_func (LexState *ls) {
  289. lua_State *L = ls->L;
  290. FuncState *fs = ls->fs;
  291. Proto *f = fs->f;
  292. removevars(ls, 0);
  293. luaK_ret(fs, 0, 0); /* final return */
  294. luaM_reallocvector(L, f->code, f->sizecode, fs->pc, Instruction);
  295. f->sizecode = fs->pc;
  296. #ifdef LUA_OPTIMIZE_DEBUG
  297. f->packedlineinfo[fs->lastlineOffset+1]=0;
  298. luaM_reallocvector(L, f->packedlineinfo, fs->packedlineinfoSize,
  299. fs->lastlineOffset+2, unsigned char);
  300. #else
  301. luaM_reallocvector(L, f->lineinfo, f->sizelineinfo, fs->pc, int);
  302. f->sizelineinfo = fs->pc;
  303. #endif
  304. luaM_reallocvector(L, f->k, f->sizek, fs->nk, TValue);
  305. f->sizek = fs->nk;
  306. luaM_reallocvector(L, f->p, f->sizep, fs->np, Proto *);
  307. f->sizep = fs->np;
  308. luaM_reallocvector(L, f->locvars, f->sizelocvars, fs->nlocvars, LocVar);
  309. f->sizelocvars = fs->nlocvars;
  310. luaM_reallocvector(L, f->upvalues, f->sizeupvalues, f->nups, TString *);
  311. f->sizeupvalues = f->nups;
  312. lua_assert(luaG_checkcode(f));
  313. lua_assert(fs->bl == NULL);
  314. ls->fs = fs->prev;
  315. /* last token read was anchored in defunct function; must reanchor it */
  316. if (fs) anchor_token(ls);
  317. L->top -= 2; /* remove table and prototype from the stack */
  318. }
  319. #ifdef LUA_OPTIMIZE_DEBUG
  320. static void compile_stripdebug(lua_State *L, Proto *f) {
  321. int level;
  322. lua_pushlightuserdata(L, &luaG_stripdebug );
  323. lua_gettable(L, LUA_REGISTRYINDEX);
  324. level = lua_isnil(L, -1) ? LUA_OPTIMIZE_DEBUG : lua_tointeger(L, -1);
  325. lua_pop(L, 1);
  326. if (level > 1) {
  327. int len = luaG_stripdebug(L, f, level, 1);
  328. UNUSED(len);
  329. }
  330. }
  331. #endif
  332. Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) {
  333. struct LexState lexstate;
  334. struct FuncState funcstate;
  335. TString *tname = luaS_new(L, name);
  336. setsvalue2s(L, L->top, tname); /* protect name */
  337. incr_top(L);
  338. lexstate.buff = buff;
  339. luaX_setinput(L, &lexstate, z, tname);
  340. open_func(&lexstate, &funcstate);
  341. funcstate.f->is_vararg = VARARG_ISVARARG; /* main func. is always vararg */
  342. luaX_next(&lexstate); /* read first token */
  343. chunk(&lexstate);
  344. check(&lexstate, TK_EOS);
  345. close_func(&lexstate);
  346. #ifdef LUA_OPTIMIZE_DEBUG
  347. compile_stripdebug(L, funcstate.f);
  348. #endif
  349. L->top--; /* remove 'name' from stack */
  350. lua_assert(funcstate.prev == NULL);
  351. lua_assert(funcstate.f->nups == 0);
  352. lua_assert(lexstate.fs == NULL);
  353. return funcstate.f;
  354. }
  355. /*============================================================*/
  356. /* GRAMMAR RULES */
  357. /*============================================================*/
  358. static void field (LexState *ls, expdesc *v) {
  359. /* field -> ['.' | ':'] NAME */
  360. FuncState *fs = ls->fs;
  361. expdesc key;
  362. luaK_exp2anyreg(fs, v);
  363. luaX_next(ls); /* skip the dot or colon */
  364. checkname(ls, &key);
  365. luaK_indexed(fs, v, &key);
  366. }
  367. static void yindex (LexState *ls, expdesc *v) {
  368. /* index -> '[' expr ']' */
  369. luaX_next(ls); /* skip the '[' */
  370. expr(ls, v);
  371. luaK_exp2val(ls->fs, v);
  372. checknext(ls, ']');
  373. }
  374. /*
  375. ** {======================================================================
  376. ** Rules for Constructors
  377. ** =======================================================================
  378. */
  379. struct ConsControl {
  380. expdesc v; /* last list item read */
  381. expdesc *t; /* table descriptor */
  382. int nh; /* total number of `record' elements */
  383. int na; /* total number of array elements */
  384. int tostore; /* number of array elements pending to be stored */
  385. };
  386. static void recfield (LexState *ls, struct ConsControl *cc) {
  387. /* recfield -> (NAME | `['exp1`]') = exp1 */
  388. FuncState *fs = ls->fs;
  389. int reg = ls->fs->freereg;
  390. expdesc key, val;
  391. int rkkey;
  392. if (ls->t.token == TK_NAME) {
  393. luaY_checklimit(fs, cc->nh, MAX_INT, "items in a constructor");
  394. checkname(ls, &key);
  395. }
  396. else /* ls->t.token == '[' */
  397. yindex(ls, &key);
  398. cc->nh++;
  399. checknext(ls, '=');
  400. rkkey = luaK_exp2RK(fs, &key);
  401. expr(ls, &val);
  402. luaK_codeABC(fs, OP_SETTABLE, cc->t->u.s.info, rkkey, luaK_exp2RK(fs, &val));
  403. fs->freereg = reg; /* free registers */
  404. }
  405. static void closelistfield (FuncState *fs, struct ConsControl *cc) {
  406. if (cc->v.k == VVOID) return; /* there is no list item */
  407. luaK_exp2nextreg(fs, &cc->v);
  408. cc->v.k = VVOID;
  409. if (cc->tostore == LFIELDS_PER_FLUSH) {
  410. luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore); /* flush */
  411. cc->tostore = 0; /* no more items pending */
  412. }
  413. }
  414. static void lastlistfield (FuncState *fs, struct ConsControl *cc) {
  415. if (cc->tostore == 0) return;
  416. if (hasmultret(cc->v.k)) {
  417. luaK_setmultret(fs, &cc->v);
  418. luaK_setlist(fs, cc->t->u.s.info, cc->na, LUA_MULTRET);
  419. cc->na--; /* do not count last expression (unknown number of elements) */
  420. }
  421. else {
  422. if (cc->v.k != VVOID)
  423. luaK_exp2nextreg(fs, &cc->v);
  424. luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore);
  425. }
  426. }
  427. static void listfield (LexState *ls, struct ConsControl *cc) {
  428. expr(ls, &cc->v);
  429. luaY_checklimit(ls->fs, cc->na, MAX_INT, "items in a constructor");
  430. cc->na++;
  431. cc->tostore++;
  432. }
  433. static void constructor (LexState *ls, expdesc *t) {
  434. /* constructor -> ?? */
  435. FuncState *fs = ls->fs;
  436. int line = ls->linenumber;
  437. int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0);
  438. struct ConsControl cc;
  439. cc.na = cc.nh = cc.tostore = 0;
  440. cc.t = t;
  441. init_exp(t, VRELOCABLE, pc);
  442. init_exp(&cc.v, VVOID, 0); /* no value (yet) */
  443. luaK_exp2nextreg(ls->fs, t); /* fix it at stack top (for gc) */
  444. checknext(ls, '{');
  445. do {
  446. lua_assert(cc.v.k == VVOID || cc.tostore > 0);
  447. if (ls->t.token == '}') break;
  448. closelistfield(fs, &cc);
  449. switch(ls->t.token) {
  450. case TK_NAME: { /* may be listfields or recfields */
  451. luaX_lookahead(ls);
  452. if (ls->lookahead.token != '=') /* expression? */
  453. listfield(ls, &cc);
  454. else
  455. recfield(ls, &cc);
  456. break;
  457. }
  458. case '[': { /* constructor_item -> recfield */
  459. recfield(ls, &cc);
  460. break;
  461. }
  462. default: { /* constructor_part -> listfield */
  463. listfield(ls, &cc);
  464. break;
  465. }
  466. }
  467. } while (testnext(ls, ',') || testnext(ls, ';'));
  468. check_match(ls, '}', '{', line);
  469. lastlistfield(fs, &cc);
  470. SETARG_B(fs->f->code[pc], luaO_int2fb(cc.na)); /* set initial array size */
  471. SETARG_C(fs->f->code[pc], luaO_int2fb(cc.nh)); /* set initial table size */
  472. }
  473. /* }====================================================================== */
  474. static void parlist (LexState *ls) {
  475. /* parlist -> [ param { `,' param } ] */
  476. FuncState *fs = ls->fs;
  477. Proto *f = fs->f;
  478. int nparams = 0;
  479. f->is_vararg = 0;
  480. if (ls->t.token != ')') { /* is `parlist' not empty? */
  481. do {
  482. switch (ls->t.token) {
  483. case TK_NAME: { /* param -> NAME */
  484. new_localvar(ls, str_checkname(ls), nparams++);
  485. break;
  486. }
  487. case TK_DOTS: { /* param -> `...' */
  488. luaX_next(ls);
  489. #if defined(LUA_COMPAT_VARARG)
  490. /* use `arg' as default name */
  491. new_localvarliteral(ls, "arg", nparams++);
  492. f->is_vararg = VARARG_HASARG | VARARG_NEEDSARG;
  493. #endif
  494. f->is_vararg |= VARARG_ISVARARG;
  495. break;
  496. }
  497. default: luaX_syntaxerror(ls, "<name> or " LUA_QL("...") " expected");
  498. }
  499. } while (!f->is_vararg && testnext(ls, ','));
  500. }
  501. adjustlocalvars(ls, nparams);
  502. f->numparams = cast_byte(fs->nactvar - (f->is_vararg & VARARG_HASARG));
  503. luaK_reserveregs(fs, fs->nactvar); /* reserve register for parameters */
  504. }
  505. static void body (LexState *ls, expdesc *e, int needself, int line) {
  506. /* body -> `(' parlist `)' chunk END */
  507. FuncState new_fs;
  508. open_func(ls, &new_fs);
  509. new_fs.f->linedefined = line;
  510. checknext(ls, '(');
  511. if (needself) {
  512. new_localvarliteral(ls, "self", 0);
  513. adjustlocalvars(ls, 1);
  514. }
  515. parlist(ls);
  516. checknext(ls, ')');
  517. chunk(ls);
  518. new_fs.f->lastlinedefined = ls->linenumber;
  519. check_match(ls, TK_END, TK_FUNCTION, line);
  520. close_func(ls);
  521. pushclosure(ls, &new_fs, e);
  522. }
  523. static int explist1 (LexState *ls, expdesc *v) {
  524. /* explist1 -> expr { `,' expr } */
  525. int n = 1; /* at least one expression */
  526. expr(ls, v);
  527. while (testnext(ls, ',')) {
  528. luaK_exp2nextreg(ls->fs, v);
  529. expr(ls, v);
  530. n++;
  531. }
  532. return n;
  533. }
  534. static void funcargs (LexState *ls, expdesc *f) {
  535. FuncState *fs = ls->fs;
  536. expdesc args;
  537. int base, nparams;
  538. int line = ls->linenumber;
  539. switch (ls->t.token) {
  540. case '(': { /* funcargs -> `(' [ explist1 ] `)' */
  541. if (line != ls->lastline)
  542. luaX_syntaxerror(ls,"ambiguous syntax (function call x new statement)");
  543. luaX_next(ls);
  544. if (ls->t.token == ')') /* arg list is empty? */
  545. args.k = VVOID;
  546. else {
  547. explist1(ls, &args);
  548. luaK_setmultret(fs, &args);
  549. }
  550. check_match(ls, ')', '(', line);
  551. break;
  552. }
  553. case '{': { /* funcargs -> constructor */
  554. constructor(ls, &args);
  555. break;
  556. }
  557. case TK_STRING: { /* funcargs -> STRING */
  558. codestring(ls, &args, ls->t.seminfo.ts);
  559. luaX_next(ls); /* must use `seminfo' before `next' */
  560. break;
  561. }
  562. default: {
  563. luaX_syntaxerror(ls, "function arguments expected");
  564. return;
  565. }
  566. }
  567. lua_assert(f->k == VNONRELOC);
  568. base = f->u.s.info; /* base register for call */
  569. if (hasmultret(args.k))
  570. nparams = LUA_MULTRET; /* open call */
  571. else {
  572. if (args.k != VVOID)
  573. luaK_exp2nextreg(fs, &args); /* close last argument */
  574. nparams = fs->freereg - (base+1);
  575. }
  576. init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2));
  577. luaK_fixline(fs, line);
  578. fs->freereg = base+1; /* call remove function and arguments and leaves
  579. (unless changed) one result */
  580. }
  581. /*
  582. ** {======================================================================
  583. ** Expression parsing
  584. ** =======================================================================
  585. */
  586. static void prefixexp (LexState *ls, expdesc *v) {
  587. /* prefixexp -> NAME | '(' expr ')' */
  588. switch (ls->t.token) {
  589. case '(': {
  590. int line = ls->linenumber;
  591. luaX_next(ls);
  592. expr(ls, v);
  593. check_match(ls, ')', '(', line);
  594. luaK_dischargevars(ls->fs, v);
  595. return;
  596. }
  597. case TK_NAME: {
  598. singlevar(ls, v);
  599. return;
  600. }
  601. default: {
  602. luaX_syntaxerror(ls, "unexpected symbol");
  603. return;
  604. }
  605. }
  606. }
  607. static void primaryexp (LexState *ls, expdesc *v) {
  608. /* primaryexp ->
  609. prefixexp { `.' NAME | `[' exp `]' | `:' NAME funcargs | funcargs } */
  610. FuncState *fs = ls->fs;
  611. prefixexp(ls, v);
  612. for (;;) {
  613. switch (ls->t.token) {
  614. case '.': { /* field */
  615. field(ls, v);
  616. break;
  617. }
  618. case '[': { /* `[' exp1 `]' */
  619. expdesc key;
  620. luaK_exp2anyreg(fs, v);
  621. yindex(ls, &key);
  622. luaK_indexed(fs, v, &key);
  623. break;
  624. }
  625. case ':': { /* `:' NAME funcargs */
  626. expdesc key;
  627. luaX_next(ls);
  628. checkname(ls, &key);
  629. luaK_self(fs, v, &key);
  630. funcargs(ls, v);
  631. break;
  632. }
  633. case '(': case TK_STRING: case '{': { /* funcargs */
  634. luaK_exp2nextreg(fs, v);
  635. funcargs(ls, v);
  636. break;
  637. }
  638. default: return;
  639. }
  640. }
  641. }
  642. static void simpleexp (LexState *ls, expdesc *v) {
  643. /* simpleexp -> NUMBER | STRING | NIL | true | false | ... |
  644. constructor | FUNCTION body | primaryexp */
  645. switch (ls->t.token) {
  646. case TK_NUMBER: {
  647. init_exp(v, VKNUM, 0);
  648. v->u.nval = ls->t.seminfo.r;
  649. break;
  650. }
  651. case TK_STRING: {
  652. codestring(ls, v, ls->t.seminfo.ts);
  653. break;
  654. }
  655. case TK_NIL: {
  656. init_exp(v, VNIL, 0);
  657. break;
  658. }
  659. case TK_TRUE: {
  660. init_exp(v, VTRUE, 0);
  661. break;
  662. }
  663. case TK_FALSE: {
  664. init_exp(v, VFALSE, 0);
  665. break;
  666. }
  667. case TK_DOTS: { /* vararg */
  668. FuncState *fs = ls->fs;
  669. check_condition(ls, fs->f->is_vararg,
  670. "cannot use " LUA_QL("...") " outside a vararg function");
  671. fs->f->is_vararg &= ~VARARG_NEEDSARG; /* don't need 'arg' */
  672. init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 1, 0));
  673. break;
  674. }
  675. case '{': { /* constructor */
  676. constructor(ls, v);
  677. return;
  678. }
  679. case TK_FUNCTION: {
  680. luaX_next(ls);
  681. body(ls, v, 0, ls->linenumber);
  682. return;
  683. }
  684. default: {
  685. primaryexp(ls, v);
  686. return;
  687. }
  688. }
  689. luaX_next(ls);
  690. }
  691. static UnOpr getunopr (int op) {
  692. switch (op) {
  693. case TK_NOT: return OPR_NOT;
  694. case '-': return OPR_MINUS;
  695. case '#': return OPR_LEN;
  696. default: return OPR_NOUNOPR;
  697. }
  698. }
  699. static BinOpr getbinopr (int op) {
  700. switch (op) {
  701. case '+': return OPR_ADD;
  702. case '-': return OPR_SUB;
  703. case '*': return OPR_MUL;
  704. case '/': return OPR_DIV;
  705. case '%': return OPR_MOD;
  706. case '^': return OPR_POW;
  707. case TK_CONCAT: return OPR_CONCAT;
  708. case TK_NE: return OPR_NE;
  709. case TK_EQ: return OPR_EQ;
  710. case '<': return OPR_LT;
  711. case TK_LE: return OPR_LE;
  712. case '>': return OPR_GT;
  713. case TK_GE: return OPR_GE;
  714. case TK_AND: return OPR_AND;
  715. case TK_OR: return OPR_OR;
  716. default: return OPR_NOBINOPR;
  717. }
  718. }
  719. static const struct {
  720. lu_byte left; /* left priority for each binary operator */
  721. lu_byte right; /* right priority */
  722. } priority[] = { /* ORDER OPR */
  723. {6, 6}, {6, 6}, {7, 7}, {7, 7}, {7, 7}, /* `+' `-' `/' `%' */
  724. {10, 9}, {5, 4}, /* power and concat (right associative) */
  725. {3, 3}, {3, 3}, /* equality and inequality */
  726. {3, 3}, {3, 3}, {3, 3}, {3, 3}, /* order */
  727. {2, 2}, {1, 1} /* logical (and/or) */
  728. };
  729. #define UNARY_PRIORITY 8 /* priority for unary operators */
  730. /*
  731. ** subexpr -> (simpleexp | unop subexpr) { binop subexpr }
  732. ** where `binop' is any binary operator with a priority higher than `limit'
  733. */
  734. static BinOpr subexpr (LexState *ls, expdesc *v, unsigned int limit) {
  735. BinOpr op;
  736. UnOpr uop;
  737. enterlevel(ls);
  738. uop = getunopr(ls->t.token);
  739. if (uop != OPR_NOUNOPR) {
  740. luaX_next(ls);
  741. subexpr(ls, v, UNARY_PRIORITY);
  742. luaK_prefix(ls->fs, uop, v);
  743. }
  744. else simpleexp(ls, v);
  745. /* expand while operators have priorities higher than `limit' */
  746. op = getbinopr(ls->t.token);
  747. while (op != OPR_NOBINOPR && priority[op].left > limit) {
  748. expdesc v2;
  749. BinOpr nextop;
  750. luaX_next(ls);
  751. luaK_infix(ls->fs, op, v);
  752. /* read sub-expression with higher priority */
  753. nextop = subexpr(ls, &v2, priority[op].right);
  754. luaK_posfix(ls->fs, op, v, &v2);
  755. op = nextop;
  756. }
  757. leavelevel(ls);
  758. return op; /* return first untreated operator */
  759. }
  760. static void expr (LexState *ls, expdesc *v) {
  761. subexpr(ls, v, 0);
  762. }
  763. /* }==================================================================== */
  764. /*
  765. ** {======================================================================
  766. ** Rules for Statements
  767. ** =======================================================================
  768. */
  769. static int block_follow (int token) {
  770. switch (token) {
  771. case TK_ELSE: case TK_ELSEIF: case TK_END:
  772. case TK_UNTIL: case TK_EOS:
  773. return 1;
  774. default: return 0;
  775. }
  776. }
  777. static void block (LexState *ls) {
  778. /* block -> chunk */
  779. FuncState *fs = ls->fs;
  780. BlockCnt bl;
  781. enterblock(fs, &bl, 0);
  782. chunk(ls);
  783. lua_assert(bl.breaklist == NO_JUMP);
  784. leaveblock(fs);
  785. }
  786. /*
  787. ** structure to chain all variables in the left-hand side of an
  788. ** assignment
  789. */
  790. struct LHS_assign {
  791. struct LHS_assign *prev;
  792. expdesc v; /* variable (global, local, upvalue, or indexed) */
  793. };
  794. /*
  795. ** check whether, in an assignment to a local variable, the local variable
  796. ** is needed in a previous assignment (to a table). If so, save original
  797. ** local value in a safe place and use this safe copy in the previous
  798. ** assignment.
  799. */
  800. static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) {
  801. FuncState *fs = ls->fs;
  802. int extra = fs->freereg; /* eventual position to save local variable */
  803. int conflict = 0;
  804. for (; lh; lh = lh->prev) {
  805. if (lh->v.k == VINDEXED) {
  806. if (lh->v.u.s.info == v->u.s.info) { /* conflict? */
  807. conflict = 1;
  808. lh->v.u.s.info = extra; /* previous assignment will use safe copy */
  809. }
  810. if (lh->v.u.s.aux == v->u.s.info) { /* conflict? */
  811. conflict = 1;
  812. lh->v.u.s.aux = extra; /* previous assignment will use safe copy */
  813. }
  814. }
  815. }
  816. if (conflict) {
  817. luaK_codeABC(fs, OP_MOVE, fs->freereg, v->u.s.info, 0); /* make copy */
  818. luaK_reserveregs(fs, 1);
  819. }
  820. }
  821. static void assignment (LexState *ls, struct LHS_assign *lh, int nvars) {
  822. expdesc e;
  823. check_condition(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED,
  824. "syntax error");
  825. if (testnext(ls, ',')) { /* assignment -> `,' primaryexp assignment */
  826. struct LHS_assign nv;
  827. nv.prev = lh;
  828. primaryexp(ls, &nv.v);
  829. if (nv.v.k == VLOCAL)
  830. check_conflict(ls, lh, &nv.v);
  831. luaY_checklimit(ls->fs, nvars, LUAI_MAXCCALLS - ls->L->nCcalls,
  832. "variables in assignment");
  833. assignment(ls, &nv, nvars+1);
  834. }
  835. else { /* assignment -> `=' explist1 */
  836. int nexps;
  837. checknext(ls, '=');
  838. nexps = explist1(ls, &e);
  839. if (nexps != nvars) {
  840. adjust_assign(ls, nvars, nexps, &e);
  841. if (nexps > nvars)
  842. ls->fs->freereg -= nexps - nvars; /* remove extra values */
  843. }
  844. else {
  845. luaK_setoneret(ls->fs, &e); /* close last expression */
  846. luaK_storevar(ls->fs, &lh->v, &e);
  847. return; /* avoid default */
  848. }
  849. }
  850. init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */
  851. luaK_storevar(ls->fs, &lh->v, &e);
  852. }
  853. static int cond (LexState *ls) {
  854. /* cond -> exp */
  855. expdesc v;
  856. expr(ls, &v); /* read condition */
  857. if (v.k == VNIL) v.k = VFALSE; /* `falses' are all equal here */
  858. luaK_goiftrue(ls->fs, &v);
  859. return v.f;
  860. }
  861. static void breakstat (LexState *ls) {
  862. FuncState *fs = ls->fs;
  863. BlockCnt *bl = fs->bl;
  864. int upval = 0;
  865. while (bl && !bl->isbreakable) {
  866. upval |= bl->upval;
  867. bl = bl->previous;
  868. }
  869. if (!bl)
  870. luaX_syntaxerror(ls, "no loop to break");
  871. if (upval)
  872. luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);
  873. luaK_concat(fs, &bl->breaklist, luaK_jump(fs));
  874. }
  875. static void whilestat (LexState *ls, int line) {
  876. /* whilestat -> WHILE cond DO block END */
  877. FuncState *fs = ls->fs;
  878. int whileinit;
  879. int condexit;
  880. BlockCnt bl;
  881. luaX_next(ls); /* skip WHILE */
  882. whileinit = luaK_getlabel(fs);
  883. condexit = cond(ls);
  884. enterblock(fs, &bl, 1);
  885. checknext(ls, TK_DO);
  886. block(ls);
  887. luaK_patchlist(fs, luaK_jump(fs), whileinit);
  888. check_match(ls, TK_END, TK_WHILE, line);
  889. leaveblock(fs);
  890. luaK_patchtohere(fs, condexit); /* false conditions finish the loop */
  891. }
  892. static void repeatstat (LexState *ls, int line) {
  893. /* repeatstat -> REPEAT block UNTIL cond */
  894. int condexit;
  895. FuncState *fs = ls->fs;
  896. int repeat_init = luaK_getlabel(fs);
  897. BlockCnt bl1, bl2;
  898. enterblock(fs, &bl1, 1); /* loop block */
  899. enterblock(fs, &bl2, 0); /* scope block */
  900. luaX_next(ls); /* skip REPEAT */
  901. chunk(ls);
  902. check_match(ls, TK_UNTIL, TK_REPEAT, line);
  903. condexit = cond(ls); /* read condition (inside scope block) */
  904. if (!bl2.upval) { /* no upvalues? */
  905. leaveblock(fs); /* finish scope */
  906. luaK_patchlist(ls->fs, condexit, repeat_init); /* close the loop */
  907. }
  908. else { /* complete semantics when there are upvalues */
  909. breakstat(ls); /* if condition then break */
  910. luaK_patchtohere(ls->fs, condexit); /* else... */
  911. leaveblock(fs); /* finish scope... */
  912. luaK_patchlist(ls->fs, luaK_jump(fs), repeat_init); /* and repeat */
  913. }
  914. leaveblock(fs); /* finish loop */
  915. }
  916. static int exp1 (LexState *ls) {
  917. expdesc e;
  918. int k;
  919. expr(ls, &e);
  920. k = e.k;
  921. luaK_exp2nextreg(ls->fs, &e);
  922. return k;
  923. }
  924. static void forbody (LexState *ls, int base, int line, int nvars, int isnum) {
  925. /* forbody -> DO block */
  926. BlockCnt bl;
  927. FuncState *fs = ls->fs;
  928. int prep, endfor;
  929. adjustlocalvars(ls, 3); /* control variables */
  930. checknext(ls, TK_DO);
  931. prep = isnum ? luaK_codeAsBx(fs, OP_FORPREP, base, NO_JUMP) : luaK_jump(fs);
  932. enterblock(fs, &bl, 0); /* scope for declared variables */
  933. adjustlocalvars(ls, nvars);
  934. luaK_reserveregs(fs, nvars);
  935. block(ls);
  936. leaveblock(fs); /* end of scope for declared variables */
  937. luaK_patchtohere(fs, prep);
  938. endfor = (isnum) ? luaK_codeAsBx(fs, OP_FORLOOP, base, NO_JUMP) :
  939. luaK_codeABC(fs, OP_TFORLOOP, base, 0, nvars);
  940. luaK_fixline(fs, line); /* pretend that `OP_FOR' starts the loop */
  941. luaK_patchlist(fs, (isnum ? endfor : luaK_jump(fs)), prep + 1);
  942. }
  943. static void fornum (LexState *ls, TString *varname, int line) {
  944. /* fornum -> NAME = exp1,exp1[,exp1] forbody */
  945. FuncState *fs = ls->fs;
  946. int base = fs->freereg;
  947. new_localvarliteral(ls, "(for index)", 0);
  948. new_localvarliteral(ls, "(for limit)", 1);
  949. new_localvarliteral(ls, "(for step)", 2);
  950. new_localvar(ls, varname, 3);
  951. checknext(ls, '=');
  952. exp1(ls); /* initial value */
  953. checknext(ls, ',');
  954. exp1(ls); /* limit */
  955. if (testnext(ls, ','))
  956. exp1(ls); /* optional step */
  957. else { /* default step = 1 */
  958. luaK_codeABx(fs, OP_LOADK, fs->freereg, luaK_numberK(fs, 1));
  959. luaK_reserveregs(fs, 1);
  960. }
  961. forbody(ls, base, line, 1, 1);
  962. }
  963. static void forlist (LexState *ls, TString *indexname) {
  964. /* forlist -> NAME {,NAME} IN explist1 forbody */
  965. FuncState *fs = ls->fs;
  966. expdesc e;
  967. int nvars = 0;
  968. int line;
  969. int base = fs->freereg;
  970. /* create control variables */
  971. new_localvarliteral(ls, "(for generator)", nvars++);
  972. new_localvarliteral(ls, "(for state)", nvars++);
  973. new_localvarliteral(ls, "(for control)", nvars++);
  974. /* create declared variables */
  975. new_localvar(ls, indexname, nvars++);
  976. while (testnext(ls, ','))
  977. new_localvar(ls, str_checkname(ls), nvars++);
  978. checknext(ls, TK_IN);
  979. line = ls->linenumber;
  980. adjust_assign(ls, 3, explist1(ls, &e), &e);
  981. luaK_checkstack(fs, 3); /* extra space to call generator */
  982. forbody(ls, base, line, nvars - 3, 0);
  983. }
  984. static void forstat (LexState *ls, int line) {
  985. /* forstat -> FOR (fornum | forlist) END */
  986. FuncState *fs = ls->fs;
  987. TString *varname;
  988. BlockCnt bl;
  989. enterblock(fs, &bl, 1); /* scope for loop and control variables */
  990. luaX_next(ls); /* skip `for' */
  991. varname = str_checkname(ls); /* first variable name */
  992. switch (ls->t.token) {
  993. case '=': fornum(ls, varname, line); break;
  994. case ',': case TK_IN: forlist(ls, varname); break;
  995. default: luaX_syntaxerror(ls, LUA_QL("=") " or " LUA_QL("in") " expected");
  996. }
  997. check_match(ls, TK_END, TK_FOR, line);
  998. leaveblock(fs); /* loop scope (`break' jumps to this point) */
  999. }
  1000. static int test_then_block (LexState *ls) {
  1001. /* test_then_block -> [IF | ELSEIF] cond THEN block */
  1002. int condexit;
  1003. luaX_next(ls); /* skip IF or ELSEIF */
  1004. condexit = cond(ls);
  1005. checknext(ls, TK_THEN);
  1006. block(ls); /* `then' part */
  1007. return condexit;
  1008. }
  1009. static void ifstat (LexState *ls, int line) {
  1010. /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */
  1011. FuncState *fs = ls->fs;
  1012. int flist;
  1013. int escapelist = NO_JUMP;
  1014. flist = test_then_block(ls); /* IF cond THEN block */
  1015. while (ls->t.token == TK_ELSEIF) {
  1016. luaK_concat(fs, &escapelist, luaK_jump(fs));
  1017. luaK_patchtohere(fs, flist);
  1018. flist = test_then_block(ls); /* ELSEIF cond THEN block */
  1019. }
  1020. if (ls->t.token == TK_ELSE) {
  1021. luaK_concat(fs, &escapelist, luaK_jump(fs));
  1022. luaK_patchtohere(fs, flist);
  1023. luaX_next(ls); /* skip ELSE (after patch, for correct line info) */
  1024. block(ls); /* `else' part */
  1025. }
  1026. else
  1027. luaK_concat(fs, &escapelist, flist);
  1028. luaK_patchtohere(fs, escapelist);
  1029. check_match(ls, TK_END, TK_IF, line);
  1030. }
  1031. static void localfunc (LexState *ls) {
  1032. expdesc v, b;
  1033. FuncState *fs = ls->fs;
  1034. new_localvar(ls, str_checkname(ls), 0);
  1035. init_exp(&v, VLOCAL, fs->freereg);
  1036. luaK_reserveregs(fs, 1);
  1037. adjustlocalvars(ls, 1);
  1038. body(ls, &b, 0, ls->linenumber);
  1039. luaK_storevar(fs, &v, &b);
  1040. /* debug information will only see the variable after this point! */
  1041. getlocvar(fs, fs->nactvar - 1).startpc = fs->pc;
  1042. }
  1043. static void localstat (LexState *ls) {
  1044. /* stat -> LOCAL NAME {`,' NAME} [`=' explist1] */
  1045. int nvars = 0;
  1046. int nexps;
  1047. expdesc e;
  1048. do {
  1049. new_localvar(ls, str_checkname(ls), nvars++);
  1050. } while (testnext(ls, ','));
  1051. if (testnext(ls, '='))
  1052. nexps = explist1(ls, &e);
  1053. else {
  1054. e.k = VVOID;
  1055. nexps = 0;
  1056. }
  1057. adjust_assign(ls, nvars, nexps, &e);
  1058. adjustlocalvars(ls, nvars);
  1059. }
  1060. static int funcname (LexState *ls, expdesc *v) {
  1061. /* funcname -> NAME {field} [`:' NAME] */
  1062. int needself = 0;
  1063. singlevar(ls, v);
  1064. while (ls->t.token == '.')
  1065. field(ls, v);
  1066. if (ls->t.token == ':') {
  1067. needself = 1;
  1068. field(ls, v);
  1069. }
  1070. return needself;
  1071. }
  1072. static void funcstat (LexState *ls, int line) {
  1073. /* funcstat -> FUNCTION funcname body */
  1074. int needself;
  1075. expdesc v, b;
  1076. luaX_next(ls); /* skip FUNCTION */
  1077. needself = funcname(ls, &v);
  1078. body(ls, &b, needself, line);
  1079. luaK_storevar(ls->fs, &v, &b);
  1080. luaK_fixline(ls->fs, line); /* definition `happens' in the first line */
  1081. }
  1082. static void exprstat (LexState *ls) {
  1083. /* stat -> func | assignment */
  1084. FuncState *fs = ls->fs;
  1085. struct LHS_assign v;
  1086. primaryexp(ls, &v.v);
  1087. if (v.v.k == VCALL) /* stat -> func */
  1088. SETARG_C(getcode(fs, &v.v), 1); /* call statement uses no results */
  1089. else { /* stat -> assignment */
  1090. v.prev = NULL;
  1091. assignment(ls, &v, 1);
  1092. }
  1093. }
  1094. static void retstat (LexState *ls) {
  1095. /* stat -> RETURN explist */
  1096. FuncState *fs = ls->fs;
  1097. expdesc e;
  1098. int first, nret; /* registers with returned values */
  1099. luaX_next(ls); /* skip RETURN */
  1100. if (block_follow(ls->t.token) || ls->t.token == ';')
  1101. first = nret = 0; /* return no values */
  1102. else {
  1103. nret = explist1(ls, &e); /* optional return values */
  1104. if (hasmultret(e.k)) {
  1105. luaK_setmultret(fs, &e);
  1106. if (e.k == VCALL && nret == 1) { /* tail call? */
  1107. SET_OPCODE(getcode(fs,&e), OP_TAILCALL);
  1108. lua_assert(GETARG_A(getcode(fs,&e)) == fs->nactvar);
  1109. }
  1110. first = fs->nactvar;
  1111. nret = LUA_MULTRET; /* return all values */
  1112. }
  1113. else {
  1114. if (nret == 1) /* only one single value? */
  1115. first = luaK_exp2anyreg(fs, &e);
  1116. else {
  1117. luaK_exp2nextreg(fs, &e); /* values must go to the `stack' */
  1118. first = fs->nactvar; /* return all `active' values */
  1119. lua_assert(nret == fs->freereg - first);
  1120. }
  1121. }
  1122. }
  1123. luaK_ret(fs, first, nret);
  1124. }
  1125. static int statement (LexState *ls) {
  1126. int line = ls->linenumber; /* may be needed for error messages */
  1127. switch (ls->t.token) {
  1128. case TK_IF: { /* stat -> ifstat */
  1129. ifstat(ls, line);
  1130. return 0;
  1131. }
  1132. case TK_WHILE: { /* stat -> whilestat */
  1133. whilestat(ls, line);
  1134. return 0;
  1135. }
  1136. case TK_DO: { /* stat -> DO block END */
  1137. luaX_next(ls); /* skip DO */
  1138. block(ls);
  1139. check_match(ls, TK_END, TK_DO, line);
  1140. return 0;
  1141. }
  1142. case TK_FOR: { /* stat -> forstat */
  1143. forstat(ls, line);
  1144. return 0;
  1145. }
  1146. case TK_REPEAT: { /* stat -> repeatstat */
  1147. repeatstat(ls, line);
  1148. return 0;
  1149. }
  1150. case TK_FUNCTION: {
  1151. funcstat(ls, line); /* stat -> funcstat */
  1152. return 0;
  1153. }
  1154. case TK_LOCAL: { /* stat -> localstat */
  1155. luaX_next(ls); /* skip LOCAL */
  1156. if (testnext(ls, TK_FUNCTION)) /* local function? */
  1157. localfunc(ls);
  1158. else
  1159. localstat(ls);
  1160. return 0;
  1161. }
  1162. case TK_RETURN: { /* stat -> retstat */
  1163. retstat(ls);
  1164. return 1; /* must be last statement */
  1165. }
  1166. case TK_BREAK: { /* stat -> breakstat */
  1167. luaX_next(ls); /* skip BREAK */
  1168. breakstat(ls);
  1169. return 1; /* must be last statement */
  1170. }
  1171. default: {
  1172. exprstat(ls);
  1173. return 0; /* to avoid warnings */
  1174. }
  1175. }
  1176. }
  1177. static void chunk (LexState *ls) {
  1178. /* chunk -> { stat [`;'] } */
  1179. int islast = 0;
  1180. enterlevel(ls);
  1181. while (!islast && !block_follow(ls->t.token)) {
  1182. islast = statement(ls);
  1183. testnext(ls, ';');
  1184. lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg &&
  1185. ls->fs->freereg >= ls->fs->nactvar);
  1186. ls->fs->freereg = ls->fs->nactvar; /* free registers */
  1187. }
  1188. leavelevel(ls);
  1189. }
  1190. /* }====================================================================== */