static void assignment (LexState *ls, struct LHS_assign *lh, int nvars) {
expdesc e;
check_condition(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED,
"syntax error");
if (testnext(ls, ',')) { /* assignment -> `,' primaryexp assignment */
struct LHS_assign nv;
nv.prev = lh;
primaryexp(ls, &nv.v);
if (nv.v.k == VLOCAL)
check_conflict(ls, lh, &nv.v);
luaY_checklimit(ls->fs, nvars, LUAI_MAXCCALLS - ls->L->nCcalls,
"variables in assignment");
assignment(ls, &nv, nvars+1);
}
else { /* assignment -> `=' explist1 */
int nexps;
checknext(ls, '=');
nexps = explist1(ls, &e);
if (nexps != nvars) {
adjust_assign(ls, nvars, nexps, &e);
if (nexps > nvars)
ls->fs->freereg -= nexps - nvars; /* remove extra values */
}
else {
luaK_setoneret(ls->fs, &e); /* close last expression */
luaK_storevar(ls->fs, &lh->v, &e);
return; /* avoid default */
}
}
init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */
luaK_storevar(ls->fs, &lh->v, &e);
}
static void listfield(LexState* ls, struct ConsControl* cc)
{
expr(ls, &cc->v);
luaY_checklimit(ls->fs, cc->na, MAX_INT, "items in a constructor");
cc->na++;
cc->tostore++;
}
static int indexupvalue(FuncState* fs, TString* name, expdesc* v)
{
int i;
Proto* f = fs->f;
int oldsize = f->sizeupvalues;
for (i = 0; i < f->nups; i++)
{
if (fs->upvalues[i].k == v->k && fs->upvalues[i].info == v->u.s.info)
{
lua_assert(f->upvalues[i] == name);
return i;
}
}
/* new one */
luaY_checklimit(fs, f->nups + 1, LUAI_MAXUPVALUES, "upvalues");
luaM_growvector(fs->L, f->upvalues, f->nups, f->sizeupvalues,
TString*, MAX_INT, "");
while (oldsize < f->sizeupvalues) f->upvalues[oldsize++] = NULL;
f->upvalues[f->nups] = name;
luaC_objbarrier(fs->L, f, name);
lua_assert(v->k == VLOCAL || v->k == VUPVAL);
fs->upvalues[f->nups].k = cast_byte(v->k);
fs->upvalues[f->nups].info = cast_byte(v->u.s.info);
return f->nups++;
}
static void recfield (LexState *ls, struct ConsControl *cc)
{
/* recfield -> (NAME | `['exp1`]') = exp1 */
FuncState *fs = GetCurrentFuncState( ls );
int reg = fs->freereg;
expdesc key, val;
if (ls->t.token == TK_NAME)
{
luaY_checklimit(fs, cc->nh, MAX_INT, "items in a constructor");
checkname(ls, &key);
}
else /* ls->t.token == '[' */
{
yindex(ls, &key);
}
cc->nh++;
checknext(ls, '=');
int rkkey = luaK_exp2RK(fs, &key);
expr(ls, &val);
luaK_codeABC(fs, OP_SETTABLE, cc->t->u.s.info, rkkey, luaK_exp2RK(fs, &val));
fs->freereg = reg; /* free registers */
}
static int assignment (LexState *ls, struct LHS_assign *lh, int nvars,
lu_byte *from_var)
{
expdesc e;
int from = 0;
check_condition(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED,
"syntax error");
if (testnext(ls, ',')) { /* assignment -> `,' primaryexp assignment */
struct LHS_assign nv;
nv.prev = lh;
primaryexp(ls, &nv.v);
if (nv.v.k == VLOCAL)
check_conflict(ls, lh, &nv.v);
luaY_checklimit(ls->fs, nvars, LUAI_MAXCCALLS - ls->L->nCcalls,
"variables in assignment");
from = assignment(ls, &nv, nvars+1, from_var);
}
else { /* assignment -> IN primaryexp | `=' explist1 */
int nexps;
if (testnext(ls, TK_IN)) {
new_localvarliteral(ls, "(from)", 0);
primaryexp(ls, &e);
luaK_exp2nextreg(ls->fs, &e);
*from_var = ls->fs->nactvar;
adjustlocalvars(ls, 1);
luaK_setoneret(ls->fs, &e); /* close last expression */
getfrom(ls, &e, &lh->v);
luaK_storevar(ls->fs, &lh->v, &e);
return 1; /* avoid default */
}
else {
checknext(ls, '=');
nexps = explist1(ls, &e);
}
if (nexps == nvars) {
luaK_setoneret(ls->fs, &e); /* close last expression */
luaK_storevar(ls->fs, &lh->v, &e);
return 0; /* avoid default */
}
else {
adjust_assign(ls, nvars, nexps, &e);
if (nexps > nvars)
ls->fs->freereg -= nexps - nvars; /* remove extra values */
}
}
init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */
if (from) getfrom(ls, &e, &lh->v);
luaK_storevar(ls->fs, &lh->v, &e);
return from;
}
static void new_localvar (LexState *ls, TString *name, int n) {
FuncState *fs = ls->fs;
luaY_checklimit(fs, fs->nactvar+n+1, LUAI_MAXVARS, "local variables");
fs->actvar[fs->nactvar+n] = cast(unsigned short, registerlocalvar(ls, name));
}