7 // These are more sensical predicate names in most contexts in this file
8 #define LEFT(tok) ((tok)->children)
9 #define RIGHT(tok) ((tok)->lastChild)
10 #define BINARY(tok) (LEFT(tok) && RIGHT(tok) && LEFT(tok)->next == RIGHT(tok))
12 // Forward references for recursion
13 static void genExpr(struct Parser* p, struct Token* t);
14 static void genExprList(struct Parser* p, struct Token* t);
15 static naRef newLambda(struct Parser* p, struct Token* t);
17 static void emit(struct Parser* p, int val)
19 if(p->cg->codesz >= p->cg->codeAlloced) {
20 int i, sz = p->cg->codeAlloced * 2;
21 unsigned short* buf = naParseAlloc(p, sz*sizeof(unsigned short));
22 for(i=0; i<p->cg->codeAlloced; i++) buf[i] = p->cg->byteCode[i];
23 p->cg->byteCode = buf;
24 p->cg->codeAlloced = sz;
26 p->cg->byteCode[p->cg->codesz++] = (unsigned short)val;
29 static void emitImmediate(struct Parser* p, int val, int arg)
35 static void genBinOp(int op, struct Parser* p, struct Token* t)
37 if(!LEFT(t) || !RIGHT(t))
38 naParseError(p, "empty subexpression", t->line);
44 static int newConstant(struct Parser* p, naRef c)
47 naVec_append(p->cg->consts, c);
48 i = naVec_size(p->cg->consts) - 1;
49 if(i > 0xffff) naParseError(p, "too many constants in code block", 0);
53 // Interns a scalar (!) constant and returns its index
54 static int internConstant(struct Parser* p, naRef c)
56 int i, n = naVec_size(p->cg->consts);
57 if(IS_CODE(c)) return newConstant(p, c);
59 naRef b = naVec_get(p->cg->consts, i);
60 if(IS_NUM(b) && IS_NUM(c) && b.num == c.num) return i;
61 else if(IS_NIL(b) && IS_NIL(c)) return i;
62 else if(naStrEqual(b, c)) return i;
64 return newConstant(p, c);
67 /* FIXME: this API is fundamentally a resource leak, because symbols
68 * can't be deregistered. The "proper" way to do this would be to
69 * keep a reference count for each symbol, and decrement it when a
70 * code object referencing it is deleted. */
71 naRef naInternSymbol(naRef sym)
74 if(naHash_get(globals->symbols, sym, &result))
76 naHash_set(globals->symbols, sym, sym);
80 static int findConstantIndex(struct Parser* p, struct Token* t)
83 if(t->type == TOK_NIL) c = naNil();
85 c = naStr_fromdata(naNewString(p->context), t->str, t->strlen);
86 naHash_get(globals->symbols, c, &dummy); // noop, make c immutable
87 if(t->type == TOK_SYMBOL) c = naInternSymbol(c);
88 } else if(t->type == TOK_FUNC) c = newLambda(p, t);
89 else if(t->type == TOK_LITERAL) c = naNum(t->num);
90 else naParseError(p, "invalid/non-constant constant", t->line);
91 return internConstant(p, c);
94 static int genScalarConstant(struct Parser* p, struct Token* t)
97 if(t->str == 0 && t->num == 1) { emit(p, OP_PUSHONE); return 0; }
98 if(t->str == 0 && t->num == 0) { emit(p, OP_PUSHZERO); return 0; }
99 emitImmediate(p, OP_PUSHCONST, idx = findConstantIndex(p, t));
103 static int genLValue(struct Parser* p, struct Token* t, int* cidx)
105 if(!t) naParseError(p, "bad lvalue", -1);
106 if(t->type == TOK_LPAR && t->rule != PREC_SUFFIX) {
107 return genLValue(p, LEFT(t), cidx); // Handle stuff like "(a) = 1"
108 } else if(t->type == TOK_SYMBOL) {
109 *cidx = genScalarConstant(p, t);
111 } else if(t->type == TOK_DOT && RIGHT(t) && RIGHT(t)->type == TOK_SYMBOL) {
113 *cidx = genScalarConstant(p, RIGHT(t));
115 } else if(t->type == TOK_LBRA) {
117 genExpr(p, RIGHT(t));
119 } else if(t->type == TOK_VAR && RIGHT(t) && RIGHT(t)->type == TOK_SYMBOL) {
120 *cidx = genScalarConstant(p, RIGHT(t));
123 naParseError(p, "bad lvalue", t->line);
128 static void genEqOp(int op, struct Parser* p, struct Token* t)
130 int cidx, n = 2, setop = genLValue(p, LEFT(t), &cidx);
131 if(setop == OP_SETMEMBER) {
134 emitImmediate(p, OP_MEMBER, cidx);
135 } else if(setop == OP_INSERT) {
139 emitImmediate(p, OP_LOCAL, cidx);
142 genExpr(p, RIGHT(t));
144 emit(p, n == 1 ? OP_XCHG : OP_XCHG2);
148 static int defArg(struct Parser* p, struct Token* t)
150 if(t->type == TOK_LPAR) {
151 // http://code.google.com/p/flightgear-bugs/issues/detail?id=737
152 // TOK_LPAR can mean multi-value assignment or function call,
153 // disambigaute by checking the rule of the token
154 if (t->rule == PREC_SUFFIX)
155 naParseError(p, "default arguments cannot be function calls", t->line);
156 return defArg(p, RIGHT(t));
159 if(t->type == TOK_MINUS && RIGHT(t) &&
160 RIGHT(t)->type == TOK_LITERAL && !RIGHT(t)->str)
162 /* default arguments are constants, but "-1" parses as two
163 * tokens, so we have to subset the expression generator for that
166 return defArg(p, RIGHT(t));
168 return findConstantIndex(p, t);
171 static void genArgList(struct Parser* p, struct naCode* c, struct Token* t)
174 if(t->type == TOK_EMPTY) return;
175 if(!IDENTICAL(p->cg->restArgSym, globals->argRef))
176 naParseError(p, "remainder must be last", t->line);
177 if(t->type == TOK_ELLIPSIS) {
178 if(LEFT(t)->type != TOK_SYMBOL)
179 naParseError(p, "bad function argument expression", t->line);
180 sym = naStr_fromdata(naNewString(p->context),
181 LEFT(t)->str, LEFT(t)->strlen);
182 p->cg->restArgSym = naInternSymbol(sym);
183 c->needArgVector = 1;
184 } else if(t->type == TOK_ASSIGN) {
185 if(LEFT(t)->type != TOK_SYMBOL)
186 naParseError(p, "bad function argument expression", t->line);
187 p->cg->optArgSyms[c->nOptArgs] = findConstantIndex(p, LEFT(t));
188 p->cg->optArgVals[c->nOptArgs++] = defArg(p, RIGHT(t));
189 } else if(t->type == TOK_SYMBOL) {
191 naParseError(p, "optional arguments must be last", t->line);
192 if(c->nArgs >= MAX_FUNARGS)
193 naParseError(p, "too many named function arguments", t->line);
194 p->cg->argSyms[c->nArgs++] = findConstantIndex(p, t);
195 } else if(t->type == TOK_COMMA) {
196 if(!LEFT(t) || !RIGHT(t))
197 naParseError(p, "empty function argument", t->line);
198 genArgList(p, c, LEFT(t));
199 genArgList(p, c, RIGHT(t));
201 naParseError(p, "bad function argument expression", t->line);
204 static naRef newLambda(struct Parser* p, struct Token* t)
206 struct CodeGenerator* cgSave;
208 struct Token* arglist;
209 if(RIGHT(t)->type != TOK_LCURL)
210 naParseError(p, "bad function definition", t->line);
212 // Save off the generator state while we do the new one
214 arglist = LEFT(t)->type == TOK_LPAR ? LEFT(LEFT(t)) : 0;
215 codeObj = naCodeGen(p, LEFT(RIGHT(t)), arglist);
220 static void genLambda(struct Parser* p, struct Token* t)
222 emitImmediate(p, OP_PUSHCONST, newConstant(p, newLambda(p, t)));
225 static int genList(struct Parser* p, struct Token* t, int doAppend)
227 if(!t || t->type == TOK_EMPTY) {
229 } else if(t->type == TOK_COMMA) {
231 if(doAppend) emit(p, OP_VAPPEND);
232 return 1 + genList(p, RIGHT(t), doAppend);
235 if(doAppend) emit(p, OP_VAPPEND);
240 static void genHashElem(struct Parser* p, struct Token* t)
242 if(!t || t->type == TOK_EMPTY)
244 if(t->type != TOK_COLON || !LEFT(t))
245 naParseError(p, "bad hash/object initializer", t->line);
246 if(LEFT(t)->type == TOK_SYMBOL) genScalarConstant(p, LEFT(t));
247 else if(LEFT(t)->type == TOK_LITERAL) genExpr(p, LEFT(t));
248 else naParseError(p, "bad hash/object initializer", t->line);
249 genExpr(p, RIGHT(t));
253 static void genHash(struct Parser* p, struct Token* t)
255 if(t && t->type == TOK_COMMA) {
256 genHashElem(p, LEFT(t));
257 genHash(p, RIGHT(t));
258 } else if(t && t->type != TOK_EMPTY) {
263 static int isHashcall(struct Parser* p, struct Token* t)
266 int sep = LEFT(t) && t->type == TOK_COMMA ? t->children->type : t->type;
267 return sep == TOK_COLON;
272 static void genFuncall(struct Parser* p, struct Token* t)
275 if(LEFT(t)->type == TOK_DOT) {
277 genExpr(p, LEFT(LEFT(t)));
279 emitImmediate(p, OP_MEMBER, findConstantIndex(p, RIGHT(LEFT(t))));
283 if(isHashcall(p, RIGHT(t))) {
285 genHash(p, RIGHT(t));
286 emit(p, method ? OP_MCALLH : OP_FCALLH);
288 int nargs = genList(p, RIGHT(t), 0);
289 emitImmediate(p, method ? OP_MCALL : OP_FCALL, nargs);
293 static int startLoop(struct Parser* p, struct Token* label)
295 int i = p->cg->loopTop;
296 p->cg->loops[i].breakIP = 0xffffff;
297 p->cg->loops[i].contIP = 0xffffff;
298 p->cg->loops[i].label = label;
301 return p->cg->codesz;
304 // Emit a jump operation, and return the location of the address in
305 // the bytecode for future fixup in fixJumpTarget
306 static int emitJump(struct Parser* p, int op)
311 emit(p, 0xffff); // dummy address
315 // Points a previous jump instruction at the current "end-of-bytecode"
316 static void fixJumpTarget(struct Parser* p, int spot)
318 p->cg->byteCode[spot] = p->cg->codesz;
321 static void genShortCircuit(struct Parser* p, struct Token* t)
325 end = emitJump(p, t->type == TOK_AND ? OP_JIFNOT : OP_JIFTRUE);
327 genExpr(p, RIGHT(t));
328 fixJumpTarget(p, end);
332 static void genIf(struct Parser* p, struct Token* tif, struct Token* telse)
334 int jumpNext, jumpEnd;
335 genExpr(p, tif->children); // the test
336 jumpNext = emitJump(p, OP_JIFNOTPOP);
337 genExprList(p, tif->children->next->children); // the body
338 jumpEnd = emitJump(p, OP_JMP);
339 fixJumpTarget(p, jumpNext);
341 if(telse->type == TOK_ELSIF) genIf(p, telse, telse->next);
342 else genExprList(p, telse->children->children);
346 fixJumpTarget(p, jumpEnd);
349 static void genIfElse(struct Parser* p, struct Token* t)
351 genIf(p, t, t->children->next->next);
354 static void genQuestion(struct Parser* p, struct Token* t)
356 int jumpNext, jumpEnd;
357 if(!RIGHT(t) || RIGHT(t)->type != TOK_COLON)
358 naParseError(p, "invalid ?: expression", t->line);
359 genExpr(p, LEFT(t)); // the test
360 jumpNext = emitJump(p, OP_JIFNOTPOP);
361 genExpr(p, LEFT(RIGHT(t))); // the "if true" expr
362 jumpEnd = emitJump(p, OP_JMP);
363 fixJumpTarget(p, jumpNext);
364 genExpr(p, RIGHT(RIGHT(t))); // the "else" expr
365 fixJumpTarget(p, jumpEnd);
368 static int countList(struct Token* t, int type)
371 for(n = 1; t && t->type == type; t = RIGHT(t)) n++;
375 static void genLoop(struct Parser* p, struct Token* body,
376 struct Token* update, struct Token* label,
377 int loopTop, int jumpEnd)
379 int cont, jumpOverContinue;
381 p->cg->loops[p->cg->loopTop-1].breakIP = jumpEnd-1;
383 jumpOverContinue = emitJump(p, OP_JMP);
384 p->cg->loops[p->cg->loopTop-1].contIP = p->cg->codesz;
385 cont = emitJump(p, OP_JMP);
386 fixJumpTarget(p, jumpOverContinue);
388 genExprList(p, body);
390 fixJumpTarget(p, cont);
391 if(update) { genExpr(p, update); emit(p, OP_POP); }
392 emitImmediate(p, OP_JMPLOOP, loopTop);
393 fixJumpTarget(p, jumpEnd);
396 emit(p, OP_PUSHNIL); // Leave something on the stack
399 static void genForWhile(struct Parser* p, struct Token* init,
400 struct Token* test, struct Token* update,
401 struct Token* body, struct Token* label)
403 int loopTop, jumpEnd;
404 if(init) { genExpr(p, init); emit(p, OP_POP); }
405 loopTop = startLoop(p, label);
407 jumpEnd = emitJump(p, OP_JIFNOTPOP);
408 genLoop(p, body, update, label, loopTop, jumpEnd);
411 static void genWhile(struct Parser* p, struct Token* t)
413 struct Token *test=LEFT(t)->children, *body, *label=0;
414 int len = countList(test, TOK_SEMI);
417 if(!label || label->type != TOK_SYMBOL)
418 naParseError(p, "bad loop label", t->line);
421 naParseError(p, "too many semicolons in while test", t->line);
422 body = LEFT(RIGHT(t));
423 genForWhile(p, 0, test, 0, body, label);
426 static void genFor(struct Parser* p, struct Token* t)
428 struct Token *init, *test, *body, *update, *label=0;
429 struct Token *h = LEFT(t)->children;
430 int len = countList(h, TOK_SEMI);
432 if(!LEFT(h) || LEFT(h)->type != TOK_SYMBOL)
433 naParseError(p, "bad loop label", h->line);
437 naParseError(p, "wrong number of terms in for header", t->line);
439 test = LEFT(RIGHT(h));
440 update = RIGHT(RIGHT(h));
441 body = RIGHT(t)->children;
442 genForWhile(p, init, test, update, body, label);
445 static void genForEach(struct Parser* p, struct Token* t)
447 int loopTop, jumpEnd, assignOp, dummy;
448 struct Token *elem, *body, *vec, *label=0;
449 struct Token *h = LEFT(LEFT(t));
450 int len = countList(h, TOK_SEMI);
452 if(!LEFT(h) || LEFT(h)->type != TOK_SYMBOL)
453 naParseError(p, "bad loop label", h->line);
456 } else if (len != 2) {
457 naParseError(p, "wrong number of terms in foreach header", t->line);
461 body = RIGHT(t)->children;
464 emit(p, OP_PUSHZERO);
465 loopTop = startLoop(p, label);
466 emit(p, t->type == TOK_FOREACH ? OP_EACH : OP_INDEX);
467 jumpEnd = emitJump(p, OP_JIFEND);
468 assignOp = genLValue(p, elem, &dummy);
471 genLoop(p, body, 0, label, loopTop, jumpEnd);
472 emit(p, OP_POP); // Pull off the vector and index
476 static int tokMatch(struct Token* a, struct Token* b)
478 int i, l = a->strlen;
479 if(!a || !b) return 0;
480 if(l != b->strlen) return 0;
481 for(i=0; i<l; i++) if(a->str[i] != b->str[i]) return 0;
485 static void genBreakContinue(struct Parser* p, struct Token* t)
487 int levels = 1, loop = -1, bp, cp, i;
488 // http://code.google.com/p/flightgear-bugs/issues/detail?id=587
489 // Make sure we are inside of a loop
490 if(p->cg->loopTop <= 0)
491 naParseError(p, "break/continue outside of a valid loop", t->line);
494 if(RIGHT(t)->type != TOK_SYMBOL)
495 naParseError(p, "bad break/continue label", t->line);
496 for(i=0; i<p->cg->loopTop; i++)
497 if(tokMatch(RIGHT(t), p->cg->loops[i].label))
500 naParseError(p, "no match for break/continue label", t->line);
501 levels = p->cg->loopTop - loop;
503 bp = p->cg->loops[p->cg->loopTop - levels].breakIP;
504 cp = p->cg->loops[p->cg->loopTop - levels].contIP;
505 for(i=0; i<levels; i++)
506 emit(p, (i<levels-1) ? OP_BREAK2 : OP_BREAK);
507 if(t->type == TOK_BREAK)
508 emit(p, OP_PUSHEND); // breakIP is always a JIFNOTPOP/JIFEND!
509 emitImmediate(p, OP_JMP, t->type == TOK_BREAK ? bp : cp);
512 static void newLineEntry(struct Parser* p, int line)
515 if(p->cg->nextLineIp >= p->cg->nLineIps) {
516 int nsz = p->cg->nLineIps*2 + 1;
517 unsigned short* n = naParseAlloc(p, sizeof(unsigned short)*2*nsz);
518 for(i=0; i<(p->cg->nextLineIp*2); i++)
519 n[i] = p->cg->lineIps[i];
521 p->cg->nLineIps = nsz;
523 p->cg->lineIps[p->cg->nextLineIp++] = (unsigned short) p->cg->codesz;
524 p->cg->lineIps[p->cg->nextLineIp++] = (unsigned short) line;
527 static int parListLen(struct Token* t)
529 if(t->type != TOK_LPAR || !LEFT(t) || LEFT(t)->type != TOK_COMMA) return 0;
530 return countList(LEFT(t), TOK_COMMA);
533 static void genCommaList(struct Parser* p, struct Token* t)
535 if(t->type != TOK_COMMA) { genExpr(p, t); return; }
536 genCommaList(p, RIGHT(t));
540 static void genMultiLV(struct Parser* p, struct Token* t, int var)
542 if(!var) { emit(p, genLValue(p, t, &var)); return; }
543 if(t->type != TOK_SYMBOL) naParseError(p, "bad lvalue", t->line);
544 genScalarConstant(p, t);
545 emit(p, OP_SETLOCAL);
548 static void genAssign(struct Parser* p, struct Token* t)
550 struct Token *lv = LEFT(t), *rv = RIGHT(t);
551 int len, dummy, var=0;
553 naParseError(p, "bad assignment, missing variable", t->line);
555 if(parListLen(lv) || (lv->type == TOK_VAR && parListLen(RIGHT(lv)))) {
556 if(lv->type == TOK_VAR) { lv = RIGHT(lv); var = 1; }
557 len = parListLen(lv);
558 // http://code.google.com/p/flightgear-bugs/issues/detail?id=585
559 // TOK_LPAR can mean multi-value assignment or function call,
560 // disambigaute by checking the rule of the token
561 if(rv->type == TOK_LPAR && rv->rule != PREC_SUFFIX) {
562 if(len != parListLen(rv))
563 naParseError(p, "bad assignment count", rv->line);
564 genCommaList(p, LEFT(rv));
567 emitImmediate(p, OP_UNPACK, len);
569 for(t = LEFT(lv); t && t->type == TOK_COMMA; t = RIGHT(t)) {
570 genMultiLV(p, LEFT(t), var);
573 genMultiLV(p, t, var);
576 emit(p, genLValue(p, lv, &dummy));
580 static void genSlice(struct Parser* p, struct Token* t)
582 if(!t || t->type==TOK_EMPTY) naParseError(p, "empty slice expression", -1);
583 if(t->type == TOK_COLON) {
584 if(LEFT(t)) genExpr(p, LEFT(t)); else emit(p, OP_PUSHNIL);
585 if(RIGHT(t)) genExpr(p, RIGHT(t)); else emit(p, OP_PUSHNIL);
593 static void genExtract(struct Parser* p, struct Token* t)
596 if(countList(RIGHT(t), TOK_COMMA) == 1 && RIGHT(t)->type != TOK_COLON) {
597 genExpr(p, RIGHT(t));
601 for(t = RIGHT(t); t->type == TOK_COMMA; t = RIGHT(t))
602 genSlice(p, LEFT(t));
609 static void genExpr(struct Parser* p, struct Token* t)
612 if(!t) naParseError(p, "parse error", -1); // throw line -1...
613 p->errLine = t->line; // ...to use this one instead
614 if(t->line != p->cg->lastLine)
615 newLineEntry(p, t->line);
616 p->cg->lastLine = t->line;
618 case TOK_TOP: genExprList(p, LEFT(t)); break;
619 case TOK_IF: genIfElse(p, t); break;
620 case TOK_QUESTION: genQuestion(p, t); break;
621 case TOK_WHILE: genWhile(p, t); break;
622 case TOK_FOR: genFor(p, t); break;
623 case TOK_FUNC: genLambda(p, t); break;
624 case TOK_ASSIGN: genAssign(p, t); break;
625 case TOK_LITERAL: genScalarConstant(p, t); break;
626 case TOK_FOREACH: case TOK_FORINDEX:
629 case TOK_BREAK: case TOK_CONTINUE:
630 genBreakContinue(p, t);
633 if(BINARY(t) || !RIGHT(t)) genFuncall(p, t);
634 else genExpr(p, LEFT(t));
641 genList(p, LEFT(t), 1);
649 if(RIGHT(t)) genExpr(p, RIGHT(t));
650 else emit(p, OP_PUSHNIL);
651 for(i=0; i<p->cg->loopTop; i++) emit(p, OP_UNMARK);
655 genExpr(p, RIGHT(t));
659 emitImmediate(p, OP_LOCAL, findConstantIndex(p, t));
663 genBinOp(OP_MINUS, p, t); // binary subtraction
664 } else if(RIGHT(t) && RIGHT(t)->type == TOK_LITERAL && !RIGHT(t)->str) {
665 RIGHT(t)->num *= -1; // Pre-negate constants
666 genScalarConstant(p, RIGHT(t));
668 genExpr(p, RIGHT(t)); // unary negation
673 genExpr(p, RIGHT(t)); // unary negation (see also TOK_MINUS!)
678 if(!RIGHT(t) || RIGHT(t)->type != TOK_SYMBOL)
679 naParseError(p, "object field not symbol", RIGHT(t)->line);
680 emitImmediate(p, OP_MEMBER, findConstantIndex(p, RIGHT(t)));
682 case TOK_EMPTY: case TOK_NIL:
685 case TOK_AND: case TOK_OR:
686 genShortCircuit(p, t);
688 case TOK_MUL: genBinOp(OP_MUL, p, t); break;
689 case TOK_PLUS: genBinOp(OP_PLUS, p, t); break;
690 case TOK_DIV: genBinOp(OP_DIV, p, t); break;
691 case TOK_CAT: genBinOp(OP_CAT, p, t); break;
692 case TOK_LT: genBinOp(OP_LT, p, t); break;
693 case TOK_LTE: genBinOp(OP_LTE, p, t); break;
694 case TOK_EQ: genBinOp(OP_EQ, p, t); break;
695 case TOK_NEQ: genBinOp(OP_NEQ, p, t); break;
696 case TOK_GT: genBinOp(OP_GT, p, t); break;
697 case TOK_GTE: genBinOp(OP_GTE, p, t); break;
698 case TOK_PLUSEQ: genEqOp(OP_PLUS, p, t); break;
699 case TOK_MINUSEQ: genEqOp(OP_MINUS, p, t); break;
700 case TOK_MULEQ: genEqOp(OP_MUL, p, t); break;
701 case TOK_DIVEQ: genEqOp(OP_DIV, p, t); break;
702 case TOK_CATEQ: genEqOp(OP_CAT, p, t); break;
704 naParseError(p, "parse error", t->line);
708 static void genExprList(struct Parser* p, struct Token* t)
710 if(t && t->type == TOK_SEMI) {
712 if(RIGHT(t) && RIGHT(t)->type != TOK_EMPTY) {
714 genExprList(p, RIGHT(t));
721 naRef naCodeGen(struct Parser* p, struct Token* block, struct Token* arglist)
726 struct CodeGenerator cg;
729 cg.codeAlloced = 1024; // Start fairly big, this is a cheap allocation
730 cg.byteCode = naParseAlloc(p, cg.codeAlloced *sizeof(unsigned short));
732 cg.consts = naNewVector(p->context);
739 genExprList(p, block);
742 // Now make a code object
743 codeObj = naNewCode(p->context);
744 code = PTR(codeObj).code;
746 // Parse the argument list, if any
747 p->cg->restArgSym = globals->argRef;
748 code->nArgs = code->nOptArgs = 0;
749 p->cg->argSyms = p->cg->optArgSyms = p->cg->optArgVals = 0;
750 code->needArgVector = 1;
752 p->cg->argSyms = naParseAlloc(p, sizeof(int) * MAX_FUNARGS);
753 p->cg->optArgSyms = naParseAlloc(p, sizeof(int) * MAX_FUNARGS);
754 p->cg->optArgVals = naParseAlloc(p, sizeof(int) * MAX_FUNARGS);
755 code->needArgVector = 0;
756 genArgList(p, code, arglist);
759 code->restArgSym = internConstant(p, p->cg->restArgSym);
761 /* Set the size fields and allocate the combined array buffer.
762 * Note cute trick with null pointer to get the array size. */
763 code->nConstants = naVec_size(cg.consts);
764 code->codesz = cg.codesz;
765 code->nLines = cg.nextLineIp;
766 code->srcFile = p->srcFile;
768 code->constants = naAlloc((int)(size_t)(LINEIPS(code)+code->nLines));
769 for(i=0; i<code->nConstants; i++)
770 code->constants[i] = naVec_get(p->cg->consts, i);
772 for(i=0; i<code->nArgs; i++) ARGSYMS(code)[i] = cg.argSyms[i];
773 for(i=0; i<code->nOptArgs; i++) OPTARGSYMS(code)[i] = cg.optArgSyms[i];
774 for(i=0; i<code->nOptArgs; i++) OPTARGVALS(code)[i] = cg.optArgVals[i];
775 for(i=0; i<code->codesz; i++) BYTECODE(code)[i] = cg.byteCode[i];
776 for(i=0; i<code->nLines; i++) LINEIPS(code)[i] = cg.lineIps[i];