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) return defArg(p, RIGHT(t));
151 if(t->type == TOK_MINUS && RIGHT(t) &&
152 RIGHT(t)->type == TOK_LITERAL && !RIGHT(t)->str)
154 /* default arguments are constants, but "-1" parses as two
155 * tokens, so we have to subset the expression generator for that
158 return defArg(p, RIGHT(t));
160 return findConstantIndex(p, t);
163 static void genArgList(struct Parser* p, struct naCode* c, struct Token* t)
166 if(t->type == TOK_EMPTY) return;
167 if(!IDENTICAL(p->cg->restArgSym, globals->argRef))
168 naParseError(p, "remainder must be last", t->line);
169 if(t->type == TOK_ELLIPSIS) {
170 if(LEFT(t)->type != TOK_SYMBOL)
171 naParseError(p, "bad function argument expression", t->line);
172 sym = naStr_fromdata(naNewString(p->context),
173 LEFT(t)->str, LEFT(t)->strlen);
174 p->cg->restArgSym = naInternSymbol(sym);
175 c->needArgVector = 1;
176 } else if(t->type == TOK_ASSIGN) {
177 if(LEFT(t)->type != TOK_SYMBOL)
178 naParseError(p, "bad function argument expression", t->line);
179 p->cg->optArgSyms[c->nOptArgs] = findConstantIndex(p, LEFT(t));
180 p->cg->optArgVals[c->nOptArgs++] = defArg(p, RIGHT(t));
181 } else if(t->type == TOK_SYMBOL) {
183 naParseError(p, "optional arguments must be last", t->line);
184 if(c->nArgs >= MAX_FUNARGS)
185 naParseError(p, "too many named function arguments", t->line);
186 p->cg->argSyms[c->nArgs++] = findConstantIndex(p, t);
187 } else if(t->type == TOK_COMMA) {
188 if(!LEFT(t) || !RIGHT(t))
189 naParseError(p, "empty function argument", t->line);
190 genArgList(p, c, LEFT(t));
191 genArgList(p, c, RIGHT(t));
193 naParseError(p, "bad function argument expression", t->line);
196 static naRef newLambda(struct Parser* p, struct Token* t)
198 struct CodeGenerator* cgSave;
200 struct Token* arglist;
201 if(RIGHT(t)->type != TOK_LCURL)
202 naParseError(p, "bad function definition", t->line);
204 // Save off the generator state while we do the new one
206 arglist = LEFT(t)->type == TOK_LPAR ? LEFT(LEFT(t)) : 0;
207 codeObj = naCodeGen(p, LEFT(RIGHT(t)), arglist);
212 static void genLambda(struct Parser* p, struct Token* t)
214 emitImmediate(p, OP_PUSHCONST, newConstant(p, newLambda(p, t)));
217 static int genList(struct Parser* p, struct Token* t, int doAppend)
219 if(!t || t->type == TOK_EMPTY) {
221 } else if(t->type == TOK_COMMA) {
223 if(doAppend) emit(p, OP_VAPPEND);
224 return 1 + genList(p, RIGHT(t), doAppend);
227 if(doAppend) emit(p, OP_VAPPEND);
232 static void genHashElem(struct Parser* p, struct Token* t)
234 if(!t || t->type == TOK_EMPTY)
236 if(t->type != TOK_COLON || !LEFT(t))
237 naParseError(p, "bad hash/object initializer", t->line);
238 if(LEFT(t)->type == TOK_SYMBOL) genScalarConstant(p, LEFT(t));
239 else if(LEFT(t)->type == TOK_LITERAL) genExpr(p, LEFT(t));
240 else naParseError(p, "bad hash/object initializer", t->line);
241 genExpr(p, RIGHT(t));
245 static void genHash(struct Parser* p, struct Token* t)
247 if(t && t->type == TOK_COMMA) {
248 genHashElem(p, LEFT(t));
249 genHash(p, RIGHT(t));
250 } else if(t && t->type != TOK_EMPTY) {
255 static int isHashcall(struct Parser* p, struct Token* t)
258 int sep = LEFT(t) && t->type == TOK_COMMA ? t->children->type : t->type;
259 return sep == TOK_COLON;
264 static void genFuncall(struct Parser* p, struct Token* t)
267 if(LEFT(t)->type == TOK_DOT) {
269 genExpr(p, LEFT(LEFT(t)));
271 emitImmediate(p, OP_MEMBER, findConstantIndex(p, RIGHT(LEFT(t))));
275 if(isHashcall(p, RIGHT(t))) {
277 genHash(p, RIGHT(t));
278 emit(p, method ? OP_MCALLH : OP_FCALLH);
280 int nargs = genList(p, RIGHT(t), 0);
281 emitImmediate(p, method ? OP_MCALL : OP_FCALL, nargs);
285 static int startLoop(struct Parser* p, struct Token* label)
287 int i = p->cg->loopTop;
288 p->cg->loops[i].breakIP = 0xffffff;
289 p->cg->loops[i].contIP = 0xffffff;
290 p->cg->loops[i].label = label;
293 return p->cg->codesz;
296 // Emit a jump operation, and return the location of the address in
297 // the bytecode for future fixup in fixJumpTarget
298 static int emitJump(struct Parser* p, int op)
303 emit(p, 0xffff); // dummy address
307 // Points a previous jump instruction at the current "end-of-bytecode"
308 static void fixJumpTarget(struct Parser* p, int spot)
310 p->cg->byteCode[spot] = p->cg->codesz;
313 static void genShortCircuit(struct Parser* p, struct Token* t)
317 end = emitJump(p, t->type == TOK_AND ? OP_JIFNOT : OP_JIFTRUE);
319 genExpr(p, RIGHT(t));
320 fixJumpTarget(p, end);
324 static void genIf(struct Parser* p, struct Token* tif, struct Token* telse)
326 int jumpNext, jumpEnd;
327 genExpr(p, tif->children); // the test
328 jumpNext = emitJump(p, OP_JIFNOTPOP);
329 genExprList(p, tif->children->next->children); // the body
330 jumpEnd = emitJump(p, OP_JMP);
331 fixJumpTarget(p, jumpNext);
333 if(telse->type == TOK_ELSIF) genIf(p, telse, telse->next);
334 else genExprList(p, telse->children->children);
338 fixJumpTarget(p, jumpEnd);
341 static void genIfElse(struct Parser* p, struct Token* t)
343 genIf(p, t, t->children->next->next);
346 static void genQuestion(struct Parser* p, struct Token* t)
348 int jumpNext, jumpEnd;
349 if(!RIGHT(t) || RIGHT(t)->type != TOK_COLON)
350 naParseError(p, "invalid ?: expression", t->line);
351 genExpr(p, LEFT(t)); // the test
352 jumpNext = emitJump(p, OP_JIFNOTPOP);
353 genExpr(p, LEFT(RIGHT(t))); // the "if true" expr
354 jumpEnd = emitJump(p, OP_JMP);
355 fixJumpTarget(p, jumpNext);
356 genExpr(p, RIGHT(RIGHT(t))); // the "else" expr
357 fixJumpTarget(p, jumpEnd);
360 static int countList(struct Token* t, int type)
363 for(n = 1; t && t->type == type; t = RIGHT(t)) n++;
367 static void genLoop(struct Parser* p, struct Token* body,
368 struct Token* update, struct Token* label,
369 int loopTop, int jumpEnd)
371 int cont, jumpOverContinue;
373 p->cg->loops[p->cg->loopTop-1].breakIP = jumpEnd-1;
375 jumpOverContinue = emitJump(p, OP_JMP);
376 p->cg->loops[p->cg->loopTop-1].contIP = p->cg->codesz;
377 cont = emitJump(p, OP_JMP);
378 fixJumpTarget(p, jumpOverContinue);
380 genExprList(p, body);
382 fixJumpTarget(p, cont);
383 if(update) { genExpr(p, update); emit(p, OP_POP); }
384 emitImmediate(p, OP_JMPLOOP, loopTop);
385 fixJumpTarget(p, jumpEnd);
388 emit(p, OP_PUSHNIL); // Leave something on the stack
391 static void genForWhile(struct Parser* p, struct Token* init,
392 struct Token* test, struct Token* update,
393 struct Token* body, struct Token* label)
395 int loopTop, jumpEnd;
396 if(init) { genExpr(p, init); emit(p, OP_POP); }
397 loopTop = startLoop(p, label);
399 jumpEnd = emitJump(p, OP_JIFNOTPOP);
400 genLoop(p, body, update, label, loopTop, jumpEnd);
403 static void genWhile(struct Parser* p, struct Token* t)
405 struct Token *test=LEFT(t)->children, *body, *label=0;
406 int len = countList(test, TOK_SEMI);
409 if(!label || label->type != TOK_SYMBOL)
410 naParseError(p, "bad loop label", t->line);
413 naParseError(p, "too many semicolons in while test", t->line);
414 body = LEFT(RIGHT(t));
415 genForWhile(p, 0, test, 0, body, label);
418 static void genFor(struct Parser* p, struct Token* t)
420 struct Token *init, *test, *body, *update, *label=0;
421 struct Token *h = LEFT(t)->children;
422 int len = countList(h, TOK_SEMI);
424 if(!LEFT(h) || LEFT(h)->type != TOK_SYMBOL)
425 naParseError(p, "bad loop label", h->line);
429 naParseError(p, "wrong number of terms in for header", t->line);
431 test = LEFT(RIGHT(h));
432 update = RIGHT(RIGHT(h));
433 body = RIGHT(t)->children;
434 genForWhile(p, init, test, update, body, label);
437 static void genForEach(struct Parser* p, struct Token* t)
439 int loopTop, jumpEnd, assignOp, dummy;
440 struct Token *elem, *body, *vec, *label=0;
441 struct Token *h = LEFT(LEFT(t));
442 int len = countList(h, TOK_SEMI);
444 if(!LEFT(h) || LEFT(h)->type != TOK_SYMBOL)
445 naParseError(p, "bad loop label", h->line);
448 } else if (len != 2) {
449 naParseError(p, "wrong number of terms in foreach header", t->line);
453 body = RIGHT(t)->children;
456 emit(p, OP_PUSHZERO);
457 loopTop = startLoop(p, label);
458 emit(p, t->type == TOK_FOREACH ? OP_EACH : OP_INDEX);
459 jumpEnd = emitJump(p, OP_JIFEND);
460 assignOp = genLValue(p, elem, &dummy);
463 genLoop(p, body, 0, label, loopTop, jumpEnd);
464 emit(p, OP_POP); // Pull off the vector and index
468 static int tokMatch(struct Token* a, struct Token* b)
470 int i, l = a->strlen;
471 if(!a || !b) return 0;
472 if(l != b->strlen) return 0;
473 for(i=0; i<l; i++) if(a->str[i] != b->str[i]) return 0;
477 static void genBreakContinue(struct Parser* p, struct Token* t)
479 int levels = 1, loop = -1, bp, cp, i;
481 if(RIGHT(t)->type != TOK_SYMBOL)
482 naParseError(p, "bad break/continue label", t->line);
483 for(i=0; i<p->cg->loopTop; i++)
484 if(tokMatch(RIGHT(t), p->cg->loops[i].label))
487 naParseError(p, "no match for break/continue label", t->line);
488 levels = p->cg->loopTop - loop;
490 bp = p->cg->loops[p->cg->loopTop - levels].breakIP;
491 cp = p->cg->loops[p->cg->loopTop - levels].contIP;
492 for(i=0; i<levels; i++)
493 emit(p, (i<levels-1) ? OP_BREAK2 : OP_BREAK);
494 if(t->type == TOK_BREAK)
495 emit(p, OP_PUSHEND); // breakIP is always a JIFNOTPOP/JIFEND!
496 emitImmediate(p, OP_JMP, t->type == TOK_BREAK ? bp : cp);
499 static void newLineEntry(struct Parser* p, int line)
502 if(p->cg->nextLineIp >= p->cg->nLineIps) {
503 int nsz = p->cg->nLineIps*2 + 1;
504 unsigned short* n = naParseAlloc(p, sizeof(unsigned short)*2*nsz);
505 for(i=0; i<(p->cg->nextLineIp*2); i++)
506 n[i] = p->cg->lineIps[i];
508 p->cg->nLineIps = nsz;
510 p->cg->lineIps[p->cg->nextLineIp++] = (unsigned short) p->cg->codesz;
511 p->cg->lineIps[p->cg->nextLineIp++] = (unsigned short) line;
514 static int parListLen(struct Token* t)
516 if(t->type != TOK_LPAR || !LEFT(t) || LEFT(t)->type != TOK_COMMA) return 0;
517 return countList(LEFT(t), TOK_COMMA);
520 static void genCommaList(struct Parser* p, struct Token* t)
522 if(t->type != TOK_COMMA) { genExpr(p, t); return; }
523 genCommaList(p, RIGHT(t));
527 static void genMultiLV(struct Parser* p, struct Token* t, int var)
529 if(!var) { emit(p, genLValue(p, t, &var)); return; }
530 if(t->type != TOK_SYMBOL) naParseError(p, "bad lvalue", t->line);
531 genScalarConstant(p, t);
532 emit(p, OP_SETLOCAL);
535 static void genAssign(struct Parser* p, struct Token* t)
537 struct Token *lv = LEFT(t), *rv = RIGHT(t);
538 int len, dummy, var=0;
540 naParseError(p, "bad assignment, missing variable", t->line);
542 if(parListLen(lv) || (lv->type == TOK_VAR && parListLen(RIGHT(lv)))) {
543 if(lv->type == TOK_VAR) { lv = RIGHT(lv); var = 1; }
544 len = parListLen(lv);
545 if(rv->type == TOK_LPAR) {
546 if(len != parListLen(rv))
547 naParseError(p, "bad assignment count", rv->line);
548 genCommaList(p, LEFT(rv));
551 emitImmediate(p, OP_UNPACK, len);
553 for(t = LEFT(lv); t && t->type == TOK_COMMA; t = RIGHT(t)) {
554 genMultiLV(p, LEFT(t), var);
557 genMultiLV(p, t, var);
560 emit(p, genLValue(p, lv, &dummy));
564 static void genSlice(struct Parser* p, struct Token* t)
566 if(!t || t->type==TOK_EMPTY) naParseError(p, "empty slice expression", -1);
567 if(t->type == TOK_COLON) {
568 if(LEFT(t)) genExpr(p, LEFT(t)); else emit(p, OP_PUSHNIL);
569 if(RIGHT(t)) genExpr(p, RIGHT(t)); else emit(p, OP_PUSHNIL);
577 static void genExtract(struct Parser* p, struct Token* t)
580 if(countList(RIGHT(t), TOK_COMMA) == 1 && RIGHT(t)->type != TOK_COLON) {
581 genExpr(p, RIGHT(t));
585 for(t = RIGHT(t); t->type == TOK_COMMA; t = RIGHT(t))
586 genSlice(p, LEFT(t));
593 static void genExpr(struct Parser* p, struct Token* t)
596 if(!t) naParseError(p, "parse error", -1); // throw line -1...
597 p->errLine = t->line; // ...to use this one instead
598 if(t->line != p->cg->lastLine)
599 newLineEntry(p, t->line);
600 p->cg->lastLine = t->line;
602 case TOK_TOP: genExprList(p, LEFT(t)); break;
603 case TOK_IF: genIfElse(p, t); break;
604 case TOK_QUESTION: genQuestion(p, t); break;
605 case TOK_WHILE: genWhile(p, t); break;
606 case TOK_FOR: genFor(p, t); break;
607 case TOK_FUNC: genLambda(p, t); break;
608 case TOK_ASSIGN: genAssign(p, t); break;
609 case TOK_LITERAL: genScalarConstant(p, t); break;
610 case TOK_FOREACH: case TOK_FORINDEX:
613 case TOK_BREAK: case TOK_CONTINUE:
614 genBreakContinue(p, t);
617 if(BINARY(t) || !RIGHT(t)) genFuncall(p, t);
618 else genExpr(p, LEFT(t));
625 genList(p, LEFT(t), 1);
633 if(RIGHT(t)) genExpr(p, RIGHT(t));
634 else emit(p, OP_PUSHNIL);
635 for(i=0; i<p->cg->loopTop; i++) emit(p, OP_UNMARK);
639 genExpr(p, RIGHT(t));
643 emitImmediate(p, OP_LOCAL, findConstantIndex(p, t));
647 genBinOp(OP_MINUS, p, t); // binary subtraction
648 } else if(RIGHT(t) && RIGHT(t)->type == TOK_LITERAL && !RIGHT(t)->str) {
649 RIGHT(t)->num *= -1; // Pre-negate constants
650 genScalarConstant(p, RIGHT(t));
652 genExpr(p, RIGHT(t)); // unary negation
657 genExpr(p, RIGHT(t)); // unary negation (see also TOK_MINUS!)
662 if(!RIGHT(t) || RIGHT(t)->type != TOK_SYMBOL)
663 naParseError(p, "object field not symbol", RIGHT(t)->line);
664 emitImmediate(p, OP_MEMBER, findConstantIndex(p, RIGHT(t)));
666 case TOK_EMPTY: case TOK_NIL:
669 case TOK_AND: case TOK_OR:
670 genShortCircuit(p, t);
672 case TOK_MUL: genBinOp(OP_MUL, p, t); break;
673 case TOK_PLUS: genBinOp(OP_PLUS, p, t); break;
674 case TOK_DIV: genBinOp(OP_DIV, p, t); break;
675 case TOK_CAT: genBinOp(OP_CAT, p, t); break;
676 case TOK_LT: genBinOp(OP_LT, p, t); break;
677 case TOK_LTE: genBinOp(OP_LTE, p, t); break;
678 case TOK_EQ: genBinOp(OP_EQ, p, t); break;
679 case TOK_NEQ: genBinOp(OP_NEQ, p, t); break;
680 case TOK_GT: genBinOp(OP_GT, p, t); break;
681 case TOK_GTE: genBinOp(OP_GTE, p, t); break;
682 case TOK_PLUSEQ: genEqOp(OP_PLUS, p, t); break;
683 case TOK_MINUSEQ: genEqOp(OP_MINUS, p, t); break;
684 case TOK_MULEQ: genEqOp(OP_MUL, p, t); break;
685 case TOK_DIVEQ: genEqOp(OP_DIV, p, t); break;
686 case TOK_CATEQ: genEqOp(OP_CAT, p, t); break;
688 naParseError(p, "parse error", t->line);
692 static void genExprList(struct Parser* p, struct Token* t)
694 if(t && t->type == TOK_SEMI) {
696 if(RIGHT(t) && RIGHT(t)->type != TOK_EMPTY) {
698 genExprList(p, RIGHT(t));
705 naRef naCodeGen(struct Parser* p, struct Token* block, struct Token* arglist)
710 struct CodeGenerator cg;
713 cg.codeAlloced = 1024; // Start fairly big, this is a cheap allocation
714 cg.byteCode = naParseAlloc(p, cg.codeAlloced *sizeof(unsigned short));
716 cg.consts = naNewVector(p->context);
723 genExprList(p, block);
726 // Now make a code object
727 codeObj = naNewCode(p->context);
728 code = PTR(codeObj).code;
730 // Parse the argument list, if any
731 p->cg->restArgSym = globals->argRef;
732 code->nArgs = code->nOptArgs = 0;
733 p->cg->argSyms = p->cg->optArgSyms = p->cg->optArgVals = 0;
734 code->needArgVector = 1;
736 p->cg->argSyms = naParseAlloc(p, sizeof(int) * MAX_FUNARGS);
737 p->cg->optArgSyms = naParseAlloc(p, sizeof(int) * MAX_FUNARGS);
738 p->cg->optArgVals = naParseAlloc(p, sizeof(int) * MAX_FUNARGS);
739 code->needArgVector = 0;
740 genArgList(p, code, arglist);
743 code->restArgSym = internConstant(p, p->cg->restArgSym);
745 /* Set the size fields and allocate the combined array buffer.
746 * Note cute trick with null pointer to get the array size. */
747 code->nConstants = naVec_size(cg.consts);
748 code->codesz = cg.codesz;
749 code->nLines = cg.nextLineIp;
750 code->srcFile = p->srcFile;
752 code->constants = naAlloc((int)(size_t)(LINEIPS(code)+code->nLines));
753 for(i=0; i<code->nConstants; i++)
754 code->constants[i] = naVec_get(p->cg->consts, i);
756 for(i=0; i<code->nArgs; i++) ARGSYMS(code)[i] = cg.argSyms[i];
757 for(i=0; i<code->nOptArgs; i++) OPTARGSYMS(code)[i] = cg.optArgSyms[i];
758 for(i=0; i<code->nOptArgs; i++) OPTARGVALS(code)[i] = cg.optArgVals[i];
759 for(i=0; i<code->codesz; i++) BYTECODE(code)[i] = cg.byteCode[i];
760 for(i=0; i<code->nLines; i++) LINEIPS(code)[i] = cg.lineIps[i];