/* * code.c - compiled code builder/handler * * Copyright (c) 2005-2024 Shiro Kawai * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * 3. Neither the name of the authors nor the names of its contributors * may be used to endorse or promote products derived from this * software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #define LIBGAUCHE_BODY #include "gauche.h" #include "gauche/priv/configP.h" #include "gauche/code.h" #include "gauche/vminsn.h" #include "gauche/priv/codeP.h" #include "gauche/priv/mmapP.h" #include "gauche/priv/identifierP.h" #include "gauche/priv/builtin-syms.h" /*=============================================================== * NVM related stuff */ /* Debug information: * * debug info is kept as an assoc-list with insn offset * as a key. */ ScmObj Scm_CompiledCodeFullName(ScmCompiledCode *cc) { if (SCM_COMPILED_CODE_P(cc->parent) && !SCM_EQ(SCM_COMPILED_CODE(cc->parent)->name, SCM_SYM_TOPLEVEL)) { ScmObj h = SCM_NIL, t = SCM_NIL; for (;;) { SCM_APPEND1(h, t, cc->name); if (!SCM_COMPILED_CODE_P(cc->parent)) break; cc = SCM_COMPILED_CODE(cc->parent); if (SCM_EQ(cc->name, SCM_SYM_TOPLEVEL)) break; } return Scm_ReverseX(h); } else { return cc->name; } } static ScmCompiledCode *make_compiled_code(void) { ScmCompiledCode *cc = SCM_NEW(ScmCompiledCode); SCM_SET_CLASS(cc, SCM_CLASS_COMPILED_CODE); cc->code = NULL; cc->constants = NULL; cc->maxstack = -1; cc->debugInfo = SCM_NIL; cc->signatureInfo = SCM_FALSE; cc->name = SCM_FALSE; cc->parent = SCM_FALSE; cc->builder = NULL; return cc; } /* Copy the source compiled-code into the destination. This is used in the external optimizer to 'edit' code vector---such routines can create a new compiled-code, then copy it to the original so that the identity of compiled-code is kept. */ void Scm_CompiledCodeCopyX(ScmCompiledCode *dest, const ScmCompiledCode *src) { SCM_ASSERT(dest->builder == NULL); SCM_ASSERT(src->builder == NULL); memcpy(dest, src, sizeof(ScmCompiledCode)); } /*---------------------------------------------------------------------- * An API to execute statically compiled toplevel code. *PROVISIONAL* */ static ScmSubrProc execute_toplevels; void Scm_VMExecuteToplevels(ScmCompiledCode *cs[]) { ScmObj proc = Scm_MakeSubr(execute_toplevels, cs, 0, 0, SCM_FALSE); Scm_ApplyRec(proc, SCM_NIL); } static ScmObj execute_toplevels_cc(ScmObj result SCM_UNUSED, void **data) { ScmCompiledCode **cs = (ScmCompiledCode **)data[0]; if (cs[0] == NULL) return SCM_UNDEFINED; data[0] = cs+1; ScmVM *vm = Scm_VM(); Scm_VMPushCC(execute_toplevels_cc, data, 1); vm->base = cs[0]; vm->pc = vm->base->code; return SCM_UNDEFINED; } static ScmObj execute_toplevels(ScmObj *args SCM_UNUSED, int nargs SCM_UNUSED, void *cv) { Scm_VMPushCC(execute_toplevels_cc, &cv, 1); return SCM_UNDEFINED; } /*---------------------------------------------------------------------- * Disassembler */ static ScmObj check_lifted_closure(ScmWord *p, ScmObj lifted); static void print_header(const char *prefix, ScmObj name, ScmCompiledCode *cc); void Scm_CompiledCodeDump(ScmCompiledCode *cc) { ScmObj closures = SCM_NIL, lifted = SCM_NIL, shown_lifted = SCM_NIL; int clonum = 0, more = FALSE; print_header("main_code", SCM_MAKE_STR(""), cc); do { ScmWord *p = cc->code; Scm_Printf(SCM_CUROUT, "signatureInfo: %S\n", cc->signatureInfo); for (int i=0; i < cc->codeSize; i++) { ScmWord insn = p[i]; ScmPort *out = SCM_PORT(Scm_MakeOutputStringPort(TRUE)); ScmObj info = Scm_Assq(SCM_MAKE_INT(i), Scm_CodeDebugInfo(cc)); u_int code = SCM_VM_INSN_CODE(insn); const char *insn_name = Scm_VMInsnName(code); switch (Scm_VMInsnNumParams(code)) { case 0: Scm_Printf(out, " %4d %s ", i, insn_name); break; case 1: Scm_Printf(out, " %4d %s(%d) ", i, insn_name, SCM_VM_INSN_ARG(insn)); break; case 2: Scm_Printf(out, " %4d %s(%d,%d) ", i, insn_name, SCM_VM_INSN_ARG0(insn),SCM_VM_INSN_ARG1(insn)); break; } switch (Scm_VMInsnOperandType(code)) { case SCM_VM_OPERAND_LABEL: Scm_Printf(out, "%d", (ScmWord*)p[i+1] - cc->code); i++; break; case SCM_VM_OPERAND_OBJ: /* Check if we're referring to a lifted closure. */ lifted = check_lifted_closure(p+i, lifted); Scm_Printf(out, "%S", p[i+1]); i++; break; case SCM_VM_OPERAND_OBJ_LABEL: Scm_Printf(out, "%S, %d", p[i+1], (ScmWord*)p[i+2] - cc->code); i += 2; break; case SCM_VM_OPERAND_OBJ_NATIVE: Scm_Printf(out, "%S, %p", p[i+1], (void*)p[i+2]); i += 2; break; case SCM_VM_OPERAND_CODE: Scm_Printf(out, "#", clonum); closures = Scm_Acons(SCM_OBJ(p[i+1]), SCM_MAKE_INT(clonum), closures); clonum++; i++; break; case SCM_VM_OPERAND_CODES: { Scm_Printf(out, "("); ScmObj cp; SCM_FOR_EACH(cp, SCM_OBJ(p[i+1])) { if (SCM_COMPILED_CODE_P(SCM_CAR(cp))) { closures = Scm_Acons(SCM_CAR(cp), SCM_MAKE_INT(clonum), closures); Scm_Printf(out, "#", clonum); clonum++; } } Scm_Printf(out, ")"); i++; break; } default: /*nothing*/; } /* Show info */ ScmObj s = Scm_GetOutputStringUnsafe(out, 0); if (!SCM_PAIRP(info)) { Scm_Puts(SCM_STRING(s), SCM_CUROUT); Scm_Putc('\n', SCM_CUROUT); } else { int len = SCM_STRING_BODY_SIZE(SCM_STRING_BODY(s)); ScmObj srcinfo = Scm_Assq(SCM_SYM_SOURCE_INFO, info); ScmObj bindinfo = Scm_Assq(SCM_SYM_BIND_INFO, info); Scm_Puts(SCM_STRING(s), SCM_CUROUT); Scm_Flush(SCM_CUROUT); for (; len<32; len++) { Scm_Putc(' ', SCM_CUROUT); } if (SCM_FALSEP(srcinfo)) { Scm_Printf(SCM_CUROUT, "; lambda %40.1S\n", SCM_CDR(bindinfo)); } else { Scm_Printf(SCM_CUROUT, "; %40.1S\n", Scm_UnwrapSyntax2(SCM_CDR(srcinfo), FALSE)); } } } more = FALSE; if (!SCM_NULLP(closures)) { cc = SCM_COMPILED_CODE(SCM_CAAR(closures)); print_header("closure:", SCM_CDAR(closures), cc); closures = SCM_CDR(closures); more = TRUE; } else if (!SCM_NULLP(lifted)) { while (!SCM_NULLP(lifted)) { if (SCM_FALSEP(Scm_Memq(SCM_CAAR(lifted), shown_lifted))) { cc = SCM_COMPILED_CODE(SCM_CAAR(lifted)); print_header("lifted:", SCM_CDAR(lifted), cc); shown_lifted = Scm_Cons(SCM_CAAR(lifted), shown_lifted); lifted = SCM_CDR(lifted); more = TRUE; break; } else { lifted = SCM_CDR(lifted); continue; } } } } while (more); } static void print_header(const char *prefix, ScmObj name, ScmCompiledCode *cc) { Scm_Printf(SCM_CUROUT, "=== %s%A (name=%S, cc=%p, codevec=%p, size=%d, const=%d stack=%d):\n", prefix, name, cc->name, cc, cc->code, cc->codeSize, cc->constantSize, cc->maxstack); } /* The compiler may have lifted an internal closure to a global procedure. We can tell so if the opcode is GREF_x, and the operand is an identifier, whose name is an uninterned symbol and it is globally bound to a procedure. If we indeed have a lifted closure, we chain the closure's code and the identifier into the lifted list, returns the updated list. Otherwise, we return lifted list as is. */ static ScmObj check_lifted_closure(ScmWord *p, ScmObj lifted) { ScmWord code = SCM_VM_INSN_CODE(p[0]); static ScmWord gref_insns[] = { SCM_VM_GREF, SCM_VM_GREF_PUSH, SCM_VM_GREF_CALL, SCM_VM_GREF_TAIL_CALL, SCM_VM_PUSH_GREF, SCM_VM_PUSH_GREF_CALL, SCM_VM_PUSH_GREF_TAIL_CALL }; if (!SCM_IDENTIFIERP(p[1])) return lifted; ScmIdentifier *id = Scm_OutermostIdentifier(SCM_IDENTIFIER(p[1])); if (SCM_SYMBOL_INTERNED(id->name)) return lifted; for (u_int i=0; i < sizeof(gref_insns)/sizeof(ScmWord); i++) { if (code == gref_insns[i]) { ScmObj g = Scm_GlobalVariableRef(id->module, SCM_SYMBOL(id->name), SCM_BINDING_STAY_IN_MODULE); if (SCM_CLOSUREP(g)) { if (SCM_FALSEP(Scm_Assq(SCM_CLOSURE(g)->code, lifted))) { return Scm_Acons(SCM_CLOSURE(g)->code, SCM_OBJ(id->name), lifted); } else { return lifted; } } } } return lifted; } /*------------------------------------------------------------------ * Builder - used by the new compiler */ #define CC_BUILDER_CHUNK_BITS 5 #define CC_BUILDER_CHUNK_SIZE (1L<builder == NULL) { \ Scm_Error("[internal error] CompiledCode is already frozen"); \ } \ (b) = (cc_builder*)cc->builder; \ } while (0) static cc_builder *make_cc_builder(void) { cc_builder *b = SCM_NEW(cc_builder); b->chunks = NULL; b->numChunks = 0; b->constants = SCM_NIL; b->currentIndex = 0; b->currentInsn = CC_BUILDER_BUFFER_EMPTY; b->currentOpcode = b->prevOpcode = -1; b->currentOperand = b->currentInfo = SCM_FALSE; b->currentState = -1; b->labelDefs = b->labelRefs = SCM_NIL; b->labelCount = 0; b->debugInfo = SCM_NIL; return b; } static void cc_builder_add_word(cc_builder *b, ScmWord w) { int ni = b->currentIndex & CC_BUILDER_CHUNK_MASK; if (ni == 0) { cc_builder_chunk *newchunk = SCM_NEW(cc_builder_chunk); newchunk->prev = b->chunks; b->chunks = newchunk; b->numChunks++; } b->chunks->code[ni] = w; b->currentIndex++; } static void cc_builder_add_constant(cc_builder *b, ScmObj obj) { if (!SCM_PTRP(obj)) return; if (!SCM_FALSEP(Scm_Memq(obj, b->constants))) return; b->constants = Scm_Cons(obj, b->constants); } static void cc_builder_add_info(cc_builder *b) { if (SCM_FALSEP(b->currentInfo)) return; b->debugInfo = Scm_Acons(SCM_MAKE_INT(b->currentIndex), SCM_LIST1(Scm_Cons(SCM_SYM_SOURCE_INFO, b->currentInfo)), b->debugInfo); b->currentInfo = SCM_FALSE; } /* Returns label offset of the given label, if the label is already defined. Otherwise, returns -1. */ static int cc_builder_label_def(cc_builder *b, ScmObj label) { ScmObj p = Scm_Assq(label, b->labelDefs); if (SCM_PAIRP(p)) { return SCM_INT_VALUE(SCM_CDR(p)); } else { return -1; } } static void finish_transition(cc_builder *b); /* Flush the currentInsn buffer. */ static void cc_builder_flush(cc_builder *b) { if ((b)->currentInsn == CC_BUILDER_BUFFER_EMPTY) return; if ((b)->currentInsn == CC_BUILDER_BUFFER_TRANS) { finish_transition(b); } cc_builder_add_info(b); cc_builder_add_word(b, b->currentInsn); u_int code = SCM_VM_INSN_CODE(b->currentInsn); switch (Scm_VMInsnOperandType(code)) { case SCM_VM_OPERAND_LABEL: /* We just push the label reference into labelRefs, and emit a dummy address for the time being. (we can't emit the actual number even if we're referring to the label that has already appeared, since the number should be calculated after the code vector is allocated.) */ b->labelRefs = Scm_Acons(b->currentOperand, SCM_MAKE_INT(b->currentIndex), b->labelRefs); cc_builder_add_word(b, SCM_WORD(0)); /* dummy */ break; case SCM_VM_OPERAND_OBJ:; case SCM_VM_OPERAND_CODES: cc_builder_add_word(b, SCM_WORD(b->currentOperand)); cc_builder_add_constant(b, b->currentOperand); break; case SCM_VM_OPERAND_OBJ_LABEL: /* operand would be given as a list of (OBJ LABEL). */ SCM_ASSERT(SCM_PAIRP(b->currentOperand) && SCM_PAIRP(SCM_CDR(b->currentOperand))); cc_builder_add_word(b, SCM_WORD(SCM_CAR(b->currentOperand))); cc_builder_add_constant(b, SCM_CAR(b->currentOperand)); b->labelRefs = Scm_Acons(SCM_CADR(b->currentOperand), SCM_MAKE_INT(b->currentIndex), b->labelRefs); cc_builder_add_word(b, SCM_WORD(0)); /* dummy */ break; case SCM_VM_OPERAND_OBJ_NATIVE: /* operand would be given as a list of (MEM-REGION OFFSET). */ SCM_ASSERT(SCM_PAIRP(b->currentOperand) && SCM_MEMORY_REGION_P(SCM_CAR(b->currentOperand)) && SCM_PAIRP(SCM_CDR(b->currentOperand)) && SCM_INTP(SCM_CADR(b->currentOperand))); ScmMemoryRegion *mem = SCM_MEMORY_REGION(SCM_CAR(b->currentOperand)); cc_builder_add_word(b, SCM_WORD(mem)); cc_builder_add_constant(b, SCM_OBJ(mem)); u_long offset = Scm_GetIntegerU(SCM_CADR(b->currentOperand)); cc_builder_add_word(b, SCM_WORD(mem->ptr + offset)); break; case SCM_VM_OPERAND_CODE: if (!SCM_COMPILED_CODE_P(b->currentOperand)) goto badoperand; cc_builder_add_word(b, SCM_WORD(b->currentOperand)); cc_builder_add_constant(b, b->currentOperand); default: break; } b->currentInsn = CC_BUILDER_BUFFER_EMPTY; b->currentState = -1; b->currentOpcode = -1; return; badoperand: b->currentInsn = CC_BUILDER_BUFFER_EMPTY; b->currentState = -1; Scm_Error("[internal error] bad operand: %S", b->currentOperand); return; } /* a peephole optimization; rewrite jump destination for cascaded jump * * - if the destination of JUMP-like insn (including conditional jump * and PRE-CALL) is another JUMP, rewrite the destination. * - if the destination of BF is another BF (this pattern appears frequently, * e.g. 'or' is used in the test clause of 'cond'), rewrite the destination. */ static void cc_builder_jumpopt(ScmCompiledCode *cc) { ScmWord *cp = cc->code; for (u_int i=0; i<(u_int)cc->codeSize; i++) { u_int code = SCM_VM_INSN_CODE(*cp); cp++; switch (Scm_VMInsnOperandType(code)) { case SCM_VM_OPERAND_OBJ:; case SCM_VM_OPERAND_CODE:; case SCM_VM_OPERAND_CODES:; i++; cp++; break; case SCM_VM_OPERAND_OBJ_LABEL:; case SCM_VM_OPERAND_OBJ_NATIVE: i++; cp++; /*FALLTHROUGH*/ case SCM_VM_OPERAND_LABEL: { ScmWord *target = (ScmWord*)*cp; while (SCM_VM_INSN_CODE(*target) == SCM_VM_JUMP || (code == SCM_VM_BF && SCM_VM_INSN_CODE(*target) == SCM_VM_BF)) { target = (ScmWord*)target[1]; } if (target != (ScmWord*)*cp) { *cp = SCM_WORD(target); } i++; cp++; break; } default: break; } } } /* Creates and returns a new empty compiled-code object for building new code chunk. */ ScmObj Scm_MakeCompiledCodeBuilder(int reqargs, int optargs, ScmObj name, ScmObj parent, ScmObj intForm) { ScmCompiledCode *cc = make_compiled_code(); cc->builder = make_cc_builder(); cc->requiredArgs = reqargs; cc->optionalArgs = optargs; cc->name = name; cc->parent = parent; cc->intermediateForm = intForm; return SCM_OBJ(cc); } /* Returns a label identifier (integer) unique to this code block */ ScmObj Scm_CompiledCodeNewLabel(ScmCompiledCode *cc) { cc_builder *b; CC_BUILDER_GET(b, cc); ScmObj label = SCM_MAKE_INT(b->labelCount); b->labelCount++; return label; } /* Set label to the current instruction position. */ void Scm_CompiledCodeSetLabel(ScmCompiledCode *cc, ScmObj label) { cc_builder *b; CC_BUILDER_GET(b, cc); /* Flush buffered insn first. */ cc_builder_flush(b); /* NB: should check duplicate labels */ b->labelDefs = Scm_Acons(label, SCM_MAKE_INT(b->currentIndex), b->labelDefs); } /* Push arbitrary debug-info into the builder. : ( ...) : or 'definition Currently supported item: : ( . source) */ void Scm_CompiledCodePushInfo(ScmCompiledCode *cc, ScmObj info) { cc_builder *b; CC_BUILDER_GET(b, cc); b->debugInfo = Scm_Cons(info, b->debugInfo); } /* Pack the code accumulated in the builder into a code vector. Perform label resolution and jump optimization. */ void Scm_CompiledCodeFinishBuilder(ScmCompiledCode *cc, int maxstack) { cc_builder *b; CC_BUILDER_GET(b, cc); cc_builder_flush(b); cc->code = SCM_NEW_ATOMIC2(ScmWord *, b->currentIndex * sizeof(ScmWord)); cc->codeSize = b->currentIndex; /* reverse chunks, leaving the first chunk in bcprev. */ cc_builder_chunk *bc, *bcprev = NULL; for (bc = b->chunks; bc;) { cc_builder_chunk *next = bc->prev; bc->prev = bcprev; bcprev = bc; bc = next; } /* pack words */ bc = bcprev; for (int i=0, j=0; icurrentIndex; i++, j++) { if (j >= CC_BUILDER_CHUNK_SIZE) { bc = bc->prev; j = 0; } cc->code[i] = bc->code[j]; } /* pack constants */ int numConstants = Scm_Length(b->constants); if (numConstants > 0) { cc->constants = SCM_NEW_ARRAY(ScmObj, numConstants); ScmObj cp = b->constants; for (int i=0; iconstants[i] = SCM_CAR(cp); } } cc->constantSize = numConstants; /* resolve labels */ ScmObj cp; SCM_FOR_EACH(cp, b->labelRefs) { int destAddr = cc_builder_label_def(b, SCM_CAAR(cp)); int operandAddr; if (destAddr < 0) { Scm_Error("[internal error] undefined label in compiled code: %S", SCM_CAAR(cp)); } operandAddr = SCM_INT_VALUE(SCM_CDAR(cp)); SCM_ASSERT(operandAddr >= 0 && operandAddr < cc->codeSize); cc->code[operandAddr] = SCM_WORD(cc->code + destAddr); } /* jump destination optimization */ cc_builder_jumpopt(cc); /* record debug info */ if (!SCM_VM_COMPILER_FLAG_IS_SET(Scm_VM(), SCM_COMPILE_NOSOURCE)) { cc->debugInfo = b->debugInfo; } /* set max stack depth */ cc->maxstack = maxstack; /* make sure this code is 'fixed'---no more building */ cc->builder = NULL; } /*---------------------------------------------------------------- * Emitting instruction and operand, performing instruction combination */ /* This is originally implemented in Scheme, but moved here for efficiency, * since this routine is the most frequently called one during compilation. */ /* The state transition table */ struct stn_arc { int input; /* input insn, or -1 for wildcard */ int action; /* EMIT, KEEP, NEXT */ int next; /* emitting insn / next state */ }; /* State transition actions */ enum { NEXT, EMIT, KEEP }; /* Include STN generated from vminsn.scm */ static struct stn_arc stn[] = { #define STATE_TABLE #include "vminsn.c" #undef STATE_TABLE }; /* Save the args/operand if necessary */ static inline void save_params(cc_builder *b, int code, int arg0, int arg1, ScmObj operand, ScmObj info) { b->prevOpcode = b->currentOpcode; b->currentOpcode = code; switch (Scm_VMInsnNumParams(code)) { case 2: b->currentArg1 = arg1; /* FALLTHROUGH */ case 1: b->currentArg0 = arg0; /* FALLTHROUGH */ case 0:; } if (Scm_VMInsnOperandType(code) != SCM_VM_OPERAND_NONE) { b->currentOperand = operand; } if (!SCM_FALSEP(info)) { b->currentInfo = info; } } static int vm_insn_flags(u_int code); /* Fill the current insn word */ static inline void fill_current_insn(cc_builder *b, int code) { /* A special handling of fold-lref insn. Fold-lref insn is a combined insn LREF-XXXX(depth,offset). What's special about it is that we 'fold' specialized LREF insn (e.g. LREF10) into generic LREF. */ #define SET_LREF_ARGS(dep, off) \ b->currentArg0 = (dep); b->currentArg1 = (off); break if (vm_insn_flags(code) & SCM_VM_INSN_FOLD_LREF) { switch (b->prevOpcode) { case SCM_VM_LREF0: SET_LREF_ARGS(0, 0); case SCM_VM_LREF1: SET_LREF_ARGS(0, 1); case SCM_VM_LREF2: SET_LREF_ARGS(0, 2); case SCM_VM_LREF3: SET_LREF_ARGS(0, 3); case SCM_VM_LREF10: SET_LREF_ARGS(1, 0); case SCM_VM_LREF11: SET_LREF_ARGS(1, 1); case SCM_VM_LREF12: SET_LREF_ARGS(1, 2); case SCM_VM_LREF20: SET_LREF_ARGS(2, 0); case SCM_VM_LREF21: SET_LREF_ARGS(2, 1); case SCM_VM_LREF30: SET_LREF_ARGS(3, 0); case SCM_VM_LREF: /* args are already set */ break; default: Scm_Error("[internal] Compiler internal error: FOLD_LREF insn needs to be combined with LREF*, but prevOpcode = %d", b->prevOpcode); } } #undef SET_LREF_ARGS /* Compose insn word */ switch (Scm_VMInsnNumParams(code)) { case 0: b->currentInsn = SCM_VM_INSN(code); break; case 1: b->currentInsn = SCM_VM_INSN1(code, b->currentArg0); break; case 2: b->currentInsn = SCM_VM_INSN2(code, b->currentArg0, b->currentArg1); break; } } /* Called by cc_builder_flush to finish the current transition forcibly. We look for the default arc (-1) of the current state and use that insn to represent the current state. We can assume parameters and operands are set properly in the cc_builder. */ static void finish_transition(cc_builder *b) { int i = b->currentState; SCM_ASSERT(i >= 0 && i < (int)(sizeof(stn)/sizeof(struct stn_arc[1]))); for (;; i++) { if (stn[i].input < 0) { fill_current_insn(b, stn[i].next); break; } SCM_ASSERT(i < (int)(sizeof(stn)/sizeof(struct stn_arc[1]))); } } void Scm_CompiledCodeEmit(ScmCompiledCode *cc, int code, /* instruction code number */ int arg0, /* instruction code parameter 0 */ int arg1, /* instruction code parameter 1 */ ScmObj operand, ScmObj info) /* debug info */ { cc_builder *b; struct stn_arc *arc; CC_BUILDER_GET(b, cc); if (SCM_VM_COMPILER_FLAG_IS_SET(Scm_VM(), SCM_COMPILE_NOCOMBINE)) { save_params(b, code, arg0, arg1, operand, info); fill_current_insn(b, code); cc_builder_flush(b); return; } restart: /* Some insn needs special treatment. */ if (code == SCM_VM_LREF) { static const int lrefs[4][4] = { { SCM_VM_LREF0, SCM_VM_LREF1, SCM_VM_LREF2, SCM_VM_LREF3 }, { SCM_VM_LREF10, SCM_VM_LREF11, SCM_VM_LREF12, -1 }, { SCM_VM_LREF20, SCM_VM_LREF21, -1, -1 }, { SCM_VM_LREF30, -1, -1, -1 } }; if (arg0 < 4 && arg1 < 4) { int insn = lrefs[arg0][arg1]; if (insn >= 0) code = insn; } } else if (code == SCM_VM_CONST) { if (SCM_NULLP(operand)) { code = SCM_VM_CONSTN; } else if (SCM_FALSEP(operand)) { code = SCM_VM_CONSTF; } else if (SCM_UNDEFINEDP(operand)) { code = SCM_VM_CONSTU; } else if (SCM_INTP(operand)) { long v = SCM_INT_VALUE(operand); if (SCM_VM_INSN_ARG_FITS(v)) { code = SCM_VM_CONSTI; arg0 = v; } } } /* Look up the state */ if (b->currentState < 0) { arc = stn + code; } else { int i = b->currentState; for (;;i++) { if (stn[i].input == code || stn[i].input == -1) { arc = stn + i; break; } } } switch (arc->action) { case EMIT: save_params(b, code, arg0, arg1, operand, info); fill_current_insn(b, arc->next); cc_builder_flush(b); b->currentState = -1; break; case KEEP: fill_current_insn(b, arc->next); cc_builder_flush(b); b->currentState = -1; goto restart; case NEXT: save_params(b, code, arg0, arg1, operand, info); b->currentState = arc->next; b->currentInsn = CC_BUILDER_BUFFER_TRANS; break; } } /*---------------------------------------------------------------- * CompiledCode - introspection */ /* Converts the code vector into a list. Instruction -> ( [ ]) Obj/Code operand -> as is Addr operand -> integer offset from the beginning of the code */ ScmObj Scm_CompiledCodeToList(ScmCompiledCode *cc) { ScmObj h = SCM_NIL, t = SCM_NIL; for (u_int i=0; i<(u_int)cc->codeSize; i++) { ScmWord insn = cc->code[i]; u_int code = SCM_VM_INSN_CODE(insn); const char *name = Scm_VMInsnName(code); switch (Scm_VMInsnNumParams(code)) { case 0: SCM_APPEND1(h, t, SCM_LIST1(SCM_INTERN(name))); break; case 1: SCM_APPEND1(h, t, SCM_LIST2(SCM_INTERN(name), SCM_MAKE_INT(SCM_VM_INSN_ARG(insn)))); break; case 2: SCM_APPEND1(h, t, SCM_LIST3(SCM_INTERN(name), SCM_MAKE_INT(SCM_VM_INSN_ARG0(insn)), SCM_MAKE_INT(SCM_VM_INSN_ARG1(insn)))); break; } switch (Scm_VMInsnOperandType(code)) { case SCM_VM_OPERAND_OBJ:; case SCM_VM_OPERAND_CODE:; case SCM_VM_OPERAND_CODES:; SCM_APPEND1(h, t, SCM_OBJ(cc->code[++i])); break; case SCM_VM_OPERAND_LABEL: { u_int off = (u_int)((ScmWord*)cc->code[++i] - cc->code); SCM_APPEND1(h, t, SCM_MAKE_INT(off)); break; } case SCM_VM_OPERAND_OBJ_LABEL: { u_int off = (u_int)((ScmWord*)cc->code[i+2] - cc->code); SCM_APPEND(h, t, SCM_LIST2(SCM_OBJ(cc->code[i+1]), SCM_MAKE_INT(off))); i += 2; break; } case SCM_VM_OPERAND_OBJ_NATIVE: { ScmObj addr = Scm_IntptrToInteger((intptr_t)cc->code[i+2]); SCM_APPEND(h, t, SCM_LIST2(SCM_OBJ(cc->code[i+1]), addr)); i += 2; break; } } } return h; } /*=========================================================== * VM Instruction introspection */ static struct { const char *name; /* name */ int nparams; /* # of parameters */ int operandType; /* operand type */ int flags; /* flags */ } insn_table[] = { #define DEFINSN(sym, nam, np, type, flags) \ [sym] = { nam, np, SCM_CPP_CAT(SCM_VM_OPERAND_, type), flags }, #include "vminsn.c" #undef DEFINSN }; #define CHECK_CODE(code) \ do { \ if (code >= SCM_VM_NUM_INSNS) { \ Scm_Error("invalid VM instruction code: %d", code); \ } \ } while (0) const char *Scm_VMInsnName(u_int code) { CHECK_CODE(code); return insn_table[code].name; } int Scm_VMInsnNumParams(u_int code) { CHECK_CODE(code); return insn_table[code].nparams; } int vm_insn_flags(u_int code) /* private for the time being */ { CHECK_CODE(code); return insn_table[code].flags; } int Scm_VMInsnOperandType(u_int code) { CHECK_CODE(code); return insn_table[code].operandType; } int Scm_VMInsnNameToCode(ScmObj name) { if (SCM_SYMBOLP(name)) name = SCM_OBJ(SCM_SYMBOL_NAME(name)); else if (!SCM_STRINGP(name)) { Scm_Error("vm-insn-name->code: requires a symbol or a string, but got %S", name); } const char *n = Scm_GetStringConst(SCM_STRING(name)); for (int i=0; icode: no such instruction: %A", name); return -1; /* dummy */ } /* (kind of) inversion of VMInsnInspect. */ ScmWord Scm_VMInsnBuild(ScmObj obj) { int len = Scm_Length(obj); if (len < 1 || len > 3 || !SCM_SYMBOLP(SCM_CAR(obj))) goto badspec; int code = Scm_VMInsnNameToCode(SCM_CAR(obj)); switch (Scm_VMInsnNumParams(code)) { case 0: if (len != 1) { Scm_Error("VM instruction %S takes no parameters, but got %S", SCM_CAR(obj), obj); } return SCM_VM_INSN(code); case 1: { if (len != 2) { Scm_Error("VM instruction %S takes one parameter, but got %S", SCM_CAR(obj), obj); } if (!SCM_INTP(SCM_CADR(obj))) goto badspec; int arg0 = SCM_INT_VALUE(SCM_CADR(obj)); return SCM_VM_INSN1(code, arg0); } case 2: { if (len != 3) { Scm_Error("VM instruction %S takes two parameters, but got %S", SCM_CAR(obj), obj); } if (!SCM_INTP(SCM_CADR(obj))) goto badspec; if (!SCM_INTP(SCM_CAR(SCM_CDDR(obj)))) goto badspec; int arg0 = SCM_INT_VALUE(SCM_CADR(obj)); int arg1 = SCM_INT_VALUE(SCM_CAR(SCM_CDDR(obj))); return SCM_VM_INSN2(code, arg0, arg1); } } /*FALLTHROUGH*/ badspec: Scm_Error("Bad VM insn spec: %S", obj); return 0; /* dummy */ } /*=========================================================== * Packed debug info */ ScmObj Scm_MakePackedDebugInfo(ScmUVector *packedVector, ScmObj (*getConstVector)(void)) { ScmPackedDebugInfo *z = SCM_NEW(ScmPackedDebugInfo); SCM_SET_CLASS(z, SCM_CLASS_PACKED_DEBUG_INFO); z->codeSize = SCM_UVECTOR_SIZE(packedVector); z->codeVector = SCM_U8VECTOR_ELEMENTS(packedVector); z->constVector = SCM_FALSE; z->getConstVector = getConstVector; z->decoded = SCM_FALSE; return SCM_OBJ(z); } /* * The decoder is implemented in C, since this can be called during examining * VM state, thus the decoder should not change VM state. * See lib/gauche/vm/debug-info.scm for the details of packed debug info. */ typedef struct debug_info_decoder { const uint8_t *packed; const ScmObj *consts; int pos; /* bit position (excluding version octet) */ int len; ScmHashCore table; /* bit position -> pair */ } debug_info_decoder; #define DEBUG_INFO_VERSION 0 /* must match the encoder */ static ScmObj decode_list(debug_info_decoder *decoder); static void init_decoder(debug_info_decoder *decoder, const uint8_t *packed, int packed_len, const ScmVector *const_vector) { decoder->packed = packed; decoder->len = packed_len; decoder->consts = SCM_VECTOR_ELEMENTS(const_vector); decoder->pos = 0; Scm_HashCoreInitSimple(&decoder->table, SCM_HASH_WORD, 0, NULL); SCM_ASSERT(decoder->len > 0); if (packed[0] != DEBUG_INFO_VERSION) { Scm_Panic("Invalid debug-info"); } decoder->packed++; decoder->len--; } static int next_bit(debug_info_decoder *decoder) { int bytepos = decoder->pos >> 3; int bitpos = decoder->pos & 0x07; if (bytepos >= decoder->len) return -1; decoder->pos++; return (decoder->packed[bytepos] & (1<<(7-bitpos)))? 1 : 0; } static u_long next_nbits(debug_info_decoder *decoder, int nbits) { u_long r = 0; for (; nbits > 0; nbits--) { int b = next_bit(decoder); SCM_ASSERT(b >= 0); r = (r << 1) + b; } return r; } static u_long peek_nbits(debug_info_decoder *decoder, int nbits) { int oldpos = decoder->pos; u_long r = 0; for (; nbits > 0; nbits--) { int b = next_bit(decoder); if (b < 0) return (u_long)-1; r = (r << 1) + b; } decoder->pos = oldpos; return r; } static void skip_nbits(debug_info_decoder *decoder, int nbits) { decoder->pos += nbits; } static void save_pair(debug_info_decoder *decoder, ScmObj pair) { ScmDictEntry *e = Scm_HashCoreSearch(&decoder->table, decoder->pos, SCM_DICT_CREATE); (void)SCM_DICT_SET_VALUE(e, pair); } static int decode_index(debug_info_decoder *decoder, int leading_bits) { _Bool cont; u_long r = 0; int nbits = leading_bits; do { cont = next_bit(decoder); r = (r << nbits) + next_nbits(decoder, nbits); nbits = 5; /* following bits comes in 5 */ } while (cont); return r; } static ScmObj decode_integer(debug_info_decoder *decoder, int leading_bits) { _Bool cont; ScmObj v = SCM_MAKE_INT(0); int nbits = leading_bits; do { cont = next_bit(decoder); u_long r = next_nbits(decoder, nbits); v = Scm_LogIor(Scm_Ash(v, nbits), SCM_MAKE_INT(r)); nbits = 5; /* following bits comes in 5 */ } while (cont); return v; } static ScmObj decode_item(debug_info_decoder *decoder) { if (!next_bit(decoder)) { if (!next_bit(decoder)) { if (!next_bit(decoder)) { /* 000 */ return decode_list(decoder); } else { /* 001 */ Scm_Error("Stray end-of-list marker"); } } else { if (!next_bit(decoder)) { if (!next_bit(decoder)) { /* 0100 */ Scm_Error("Stray dot-list marker"); } else { /* 0101 */ return SCM_NIL; } } else { /* 011, predefined value The following must be in sync with *predefined-values* in debug-info.scm. It can be generated by gosh -mgauche.vm.debug-info gauche/vm/debug-info */ switch (next_nbits(decoder, 5)) { case 0: return SCM_SYM_SOURCE_INFO; case 1: return SCM_SYM_QUOTE; case 2: return SCM_SYM_DEFINITION; case 3: return SCM_SYM_LAMBDA; case 4: return SCM_SYM_LET; case 5: return SCM_SYM_IF; case 6: return SCM_SYM_DEFINE; case 7: return SCM_SYM_ERROR; case 8: return SCM_SYM_CAR; case 9: return SCM_SYM_ELSE; case 10: return SCM_SYM_CDR; case 11: return SCM_SYM_NULLP; case 12: return SCM_SYM_COND; case 13: return SCM_SYM_LET1; case 14: return SCM_FALSE; case 15: return SCM_SYM_UNLESS; case 16: return SCM_SYM_AND; case 17: return SCM_SYM_LOOP; case 18: return SCM_SYM_CARET; case 19: return SCM_SYM_CONS; case 20: return SCM_SYM_PLUS; case 21: return SCM_SYM_APPLY; case 22: return SCM_SYM_OR; case 23: return SCM_SYM_CADR; case 24: return SCM_SYM_WHEN; case 25: return SCM_SYM_NOT; case 26: return SCM_SYM_BEGIN; case 27: return SCM_SYM_EQP; case 28: return SCM_SYM_CDDR; case 29: return SCM_SYM_LIST; case 30: return SCM_TRUE; case 31: return SCM_SYM_WITH_MODULE; } } } } else { if (!next_bit(decoder)) { /* 10 */ u_long index = decode_index(decoder, 7); return decoder->consts[index]; } else { if (!next_bit(decoder)) { /* 110 */ u_long ind = decode_index(decoder, 10); ScmDictEntry *e = Scm_HashCoreSearch(&decoder->table, ind, SCM_DICT_GET); return SCM_OBJ(SCM_DICT_VALUE(e)); } else { /* 111 */ return decode_integer(decoder, 7); } } } return SCM_UNDEFINED; /* dummy */ } static ScmObj decode_list(debug_info_decoder *decoder) { if (peek_nbits(decoder, 3) == 1) { /* EOL */ skip_nbits(decoder, 3); return SCM_NIL; } if (peek_nbits(decoder, 4) == 4) { /* dot */ skip_nbits(decoder, 4); return decode_item(decoder); } else { ScmObj pair = Scm_Cons(SCM_FALSE, SCM_FALSE); save_pair(decoder, pair); SCM_SET_CAR(pair, decode_item(decoder)); SCM_SET_CDR(pair, decode_list(decoder)); return pair; } } ScmObj Scm_DecodePackedDebugInfo(const uint8_t *codeVector, ScmSmallInt codeSize, ScmVector *constVector) { debug_info_decoder decoder; init_decoder(&decoder, codeVector, codeSize, constVector); return decode_item(&decoder); } ScmObj Scm_CodeDebugInfo(ScmCompiledCode *cc) { if (SCM_PACKED_DEBUG_INFO_P(cc->debugInfo)) { ScmPackedDebugInfo *di = SCM_PACKED_DEBUG_INFO(cc->debugInfo); if (SCM_FALSEP(di->constVector)) { /* This is idempotent. No need to mutex. */ di->constVector = di->getConstVector(); } cc->debugInfo = Scm_DecodePackedDebugInfo(di->codeVector, di->codeSize, SCM_VECTOR(di->constVector)); } return cc->debugInfo; }