+/***********************************************************************
+ * VM code
+ */
+
+char* prog_getstring(qc_program *prog, qcint str)
+{
+ if (str < 0 || str >= prog->strings_count)
+ return "<<<invalid string>>>";
+ return prog->strings + str;
+}
+
+prog_section_def* prog_entfield(qc_program *prog, qcint off)
+{
+ size_t i;
+ for (i = 0; i < prog->fields_count; ++i) {
+ if (prog->fields[i].offset == off)
+ return (prog->fields + i);
+ }
+ return NULL;
+}
+
+prog_section_def* prog_getdef(qc_program *prog, qcint off)
+{
+ size_t i;
+ for (i = 0; i < prog->defs_count; ++i) {
+ if (prog->defs[i].offset == off)
+ return (prog->defs + i);
+ }
+ return NULL;
+}
+
+qcany* prog_getedict(qc_program *prog, qcint e)
+{
+ if (e >= prog->entitypool_count) {
+ prog->vmerror++;
+ printf("Accessing out of bounds edict %i\n", (int)e);
+ e = 0;
+ }
+ return (qcany*)(prog->entitydata + (prog->entityfields * e));
+}
+
+qcint prog_spawn_entity(qc_program *prog)
+{
+ char *data;
+ size_t i;
+ qcint e;
+ for (e = 0; e < (qcint)prog->entitypool_count; ++e) {
+ if (!prog->entitypool[e]) {
+ data = (char*)(prog->entitydata + (prog->entityfields * e));
+ memset(data, 0, prog->entityfields * sizeof(qcint));
+ return e;
+ }
+ }
+ if (!qc_program_entitypool_add(prog, true)) {
+ prog->vmerror++;
+ printf("Failed to allocate entity\n");
+ return 0;
+ }
+ prog->entities++;
+ for (i = 0; i < prog->entityfields; ++i) {
+ if (!qc_program_entitydata_add(prog, 0)) {
+ printf("Failed to allocate entity\n");
+ return 0;
+ }
+ }
+ data = (char*)(prog->entitydata + (prog->entityfields * e));
+ memset(data, 0, prog->entityfields * sizeof(qcint));
+ return e;
+}
+
+void prog_free_entity(qc_program *prog, qcint e)
+{
+ if (!e) {
+ prog->vmerror++;
+ printf("Trying to free world entity\n");
+ return;
+ }
+ if (e >= prog->entitypool_count) {
+ prog->vmerror++;
+ printf("Trying to free out of bounds entity\n");
+ return;
+ }
+ if (!prog->entitypool[e]) {
+ prog->vmerror++;
+ printf("Double free on entity\n");
+ return;
+ }
+ prog->entitypool[e] = false;
+}
+
+qcint prog_tempstring(qc_program *prog, const char *_str)
+{
+ /* we don't access it, but the macro-generated functions don't use
+ * const
+ */
+ char *str = (char*)_str;
+
+ size_t len = strlen(str);
+ size_t at = prog->tempstring_at;
+
+ /* when we reach the end we start over */
+ if (at + len >= prog->strings_count)
+ at = prog->tempstring_start;
+
+ /* when it doesn't fit, reallocate */
+ if (at + len >= prog->strings_count)
+ {
+ prog->strings_count = at;
+ if (!qc_program_strings_append(prog, str, len+1)) {
+ prog->vmerror = VMERR_TEMPSTRING_ALLOC;
+ return 0;
+ }
+ return at;
+ }
+
+ /* when it fits, just copy */
+ memcpy(prog->strings + at, str, len+1);
+ prog->tempstring_at += len+1;
+ return at;
+}
+
+static int print_escaped_string(const char *str, size_t maxlen)
+{
+ int len = 2;
+ putchar('"');
+ --maxlen; /* because we're lazy and have escape sequences */
+ while (*str) {
+ if (len >= maxlen) {
+ putchar('.');
+ putchar('.');
+ putchar('.');
+ len += 3;
+ break;
+ }
+ switch (*str) {
+ case '\a': len += 2; putchar('\\'); putchar('a'); break;
+ case '\b': len += 2; putchar('\\'); putchar('b'); break;
+ case '\r': len += 2; putchar('\\'); putchar('r'); break;
+ case '\n': len += 2; putchar('\\'); putchar('n'); break;
+ case '\t': len += 2; putchar('\\'); putchar('t'); break;
+ case '\f': len += 2; putchar('\\'); putchar('f'); break;
+ case '\v': len += 2; putchar('\\'); putchar('v'); break;
+ case '\\': len += 2; putchar('\\'); putchar('\\'); break;
+ case '"': len += 2; putchar('\\'); putchar('"'); break;
+ default:
+ ++len;
+ putchar(*str);
+ break;
+ }
+ ++str;
+ }
+ putchar('"');
+ return len;
+}
+
+static void trace_print_global(qc_program *prog, unsigned int glob, int vtype)
+{
+ static char spaces[28+1] = " ";
+ prog_section_def *def;
+ qcany *value;
+ int len;
+
+ if (!glob) {
+ len = printf("<null>,");
+ goto done;
+ }
+
+ def = prog_getdef(prog, glob);
+ value = (qcany*)(&prog->globals[glob]);
+
+ if (def) {
+ const char *name = prog_getstring(prog, def->name);
+ if (name[0] == '#')
+ len = printf("$");
+ else
+ len = printf("%s ", name);
+ vtype = def->type;
+ }
+ else
+ len = printf("[@%u] ", glob);
+
+ switch (vtype) {
+ case TYPE_VOID:
+ case TYPE_ENTITY:
+ case TYPE_FIELD:
+ case TYPE_FUNCTION:
+ case TYPE_POINTER:
+ len += printf("(%i),", value->_int);
+ break;
+ case TYPE_VECTOR:
+ len += printf("'%g %g %g',", value->vector[0],
+ value->vector[1],
+ value->vector[2]);
+ break;
+ case TYPE_STRING:
+ len += print_escaped_string(prog_getstring(prog, value->string), sizeof(spaces)-len-5);
+ len += printf(",");
+ /* len += printf("\"%s\",", prog_getstring(prog, value->string)); */
+ break;
+ case TYPE_FLOAT:
+ default:
+ len += printf("%g,", value->_float);
+ break;
+ }
+done:
+ if (len < sizeof(spaces)-1) {
+ spaces[sizeof(spaces)-1-len] = 0;
+ printf(spaces);
+ spaces[sizeof(spaces)-1-len] = ' ';
+ }
+}
+
+static void prog_print_statement(qc_program *prog, prog_section_statement *st)
+{
+ if (st->opcode >= (sizeof(asm_instr)/sizeof(asm_instr[0]))) {
+ printf("<illegal instruction %d>\n", st->opcode);
+ return;
+ }
+ printf(" <> %-12s", asm_instr[st->opcode].m);
+ if (st->opcode >= INSTR_IF &&
+ st->opcode <= INSTR_IFNOT)
+ {
+ trace_print_global(prog, st->o1.u1, TYPE_FLOAT);
+ printf("%d\n", st->o2.s1);
+ }
+ else if (st->opcode >= INSTR_CALL0 &&
+ st->opcode <= INSTR_CALL8)
+ {
+ printf("\n");
+ }
+ else if (st->opcode == INSTR_GOTO)
+ {
+ printf("%i\n", st->o1.s1);
+ }
+ else
+ {
+ int t[3] = { TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT };
+ switch (st->opcode)
+ {
+ case INSTR_MUL_FV:
+ t[1] = t[2] = TYPE_VECTOR;
+ break;
+ case INSTR_MUL_VF:
+ t[0] = t[2] = TYPE_VECTOR;
+ break;
+ case INSTR_MUL_V:
+ t[0] = t[1] = TYPE_VECTOR;
+ break;
+ case INSTR_ADD_V:
+ case INSTR_SUB_V:
+ case INSTR_EQ_V:
+ case INSTR_NE_V:
+ t[0] = t[1] = t[2] = TYPE_VECTOR;
+ break;
+ case INSTR_EQ_S:
+ case INSTR_NE_S:
+ t[0] = t[1] = TYPE_STRING;
+ break;
+ case INSTR_STORE_F:
+ case INSTR_STOREP_F:
+ t[2] = -1;
+ break;
+ case INSTR_STORE_V:
+ t[0] = t[1] = TYPE_VECTOR; t[2] = -1;
+ break;
+ case INSTR_STORE_S:
+ t[0] = t[1] = TYPE_STRING; t[2] = -1;
+ break;
+ case INSTR_STORE_ENT:
+ t[0] = t[1] = TYPE_ENTITY; t[2] = -1;
+ break;
+ case INSTR_STORE_FLD:
+ t[0] = t[1] = TYPE_FIELD; t[2] = -1;
+ break;
+ case INSTR_STORE_FNC:
+ t[0] = t[1] = TYPE_FUNCTION; t[2] = -1;
+ break;
+ case INSTR_STOREP_V:
+ t[0] = TYPE_VECTOR; t[1] = TYPE_ENTITY; t[2] = -1;
+ break;
+ case INSTR_STOREP_S:
+ t[0] = TYPE_STRING; t[1] = TYPE_ENTITY; t[2] = -1;
+ break;
+ case INSTR_STOREP_ENT:
+ t[0] = TYPE_ENTITY; t[1] = TYPE_ENTITY; t[2] = -1;
+ break;
+ case INSTR_STOREP_FLD:
+ t[0] = TYPE_FIELD; t[1] = TYPE_ENTITY; t[2] = -1;
+ break;
+ case INSTR_STOREP_FNC:
+ t[0] = TYPE_FUNCTION; t[1] = TYPE_ENTITY; t[2] = -1;
+ break;
+ }
+ if (t[0] >= 0) trace_print_global(prog, st->o1.u1, t[0]);
+ else printf("(none), ");
+ if (t[1] >= 0) trace_print_global(prog, st->o2.u1, t[1]);
+ else printf("(none), ");
+ if (t[2] >= 0) trace_print_global(prog, st->o3.u1, t[2]);
+ else printf("(none)");
+ printf("\n");
+ }
+ fflush(stdout);
+}
+
+static qcint prog_enterfunction(qc_program *prog, prog_section_function *func)
+{
+ qc_exec_stack st;
+ size_t p, parampos;
+
+ /* back up locals */
+ st.localsp = prog->localstack_count;
+ st.stmt = prog->statement;
+ st.function = func;
+
+#ifdef QCVM_BACKUP_STRATEGY_CALLER_VARS
+ if (prog->stack_count)
+ {
+ prog_section_function *cur;
+ cur = prog->stack[prog->stack_count-1].function;
+ if (cur)
+ {
+ qcint *globals = prog->globals + cur->firstlocal;
+ if (!qc_program_localstack_append(prog, globals, cur->locals))
+ {
+ printf("out of memory\n");
+ exit(1);
+ }
+ }
+ }
+#else
+ {
+ qcint *globals = prog->globals + func->firstlocal;
+ if (!qc_program_localstack_append(prog, globals, func->locals))
+ {
+ printf("out of memory\n");
+ exit(1);
+ }
+ }
+#endif
+
+ /* copy parameters */
+ parampos = func->firstlocal;
+ for (p = 0; p < func->nargs; ++p)
+ {
+ size_t s;
+ for (s = 0; s < func->argsize[p]; ++s) {
+ prog->globals[parampos] = prog->globals[OFS_PARM0 + 3*p + s];
+ ++parampos;
+ }
+ }
+
+ if (!qc_program_stack_add(prog, st)) {
+ printf("out of memory\n");
+ exit(1);
+ }
+
+ return func->entry;
+}
+
+static qcint prog_leavefunction(qc_program *prog)
+{
+ prog_section_function *prev = NULL;
+ size_t oldsp;
+
+ qc_exec_stack st = prog->stack[prog->stack_count-1];
+
+#ifdef QCVM_BACKUP_STRATEGY_CALLER_VARS
+ if (prog->stack_count > 1) {
+ prev = prog->stack[prog->stack_count-2].function;
+ oldsp = prog->stack[prog->stack_count-2].localsp;
+ }
+#else
+ prev = prog->stack[prog->stack_count-1].function;
+ oldsp = prog->stack[prog->stack_count-1].localsp;
+#endif
+ if (prev) {
+ qcint *globals = prog->globals + prev->firstlocal;
+ memcpy(globals, prog->localstack + oldsp, prev->locals);
+ if (!qc_program_localstack_resize(prog, oldsp)) {
+ printf("out of memory\n");
+ exit(1);
+ }
+ }
+
+ if (!qc_program_stack_remove(prog, prog->stack_count-1)) {
+ printf("out of memory\n");
+ exit(1);
+ }
+
+ return st.stmt - 1; /* offset the ++st */
+}
+
+bool prog_exec(qc_program *prog, prog_section_function *func, size_t flags, long maxjumps)
+{
+ long jumpcount = 0;
+ size_t oldxflags = prog->xflags;
+ prog_section_statement *st;
+
+ prog->vmerror = 0;
+ prog->xflags = flags;
+
+ st = prog->code + prog_enterfunction(prog, func);
+ --st;
+ switch (flags)
+ {
+ default:
+ case 0:
+ {
+#define QCVM_PROFILE 0
+#define QCVM_TRACE 0
+# include "execloop.h"
+ break;
+ }
+ case (VMXF_TRACE):
+ {
+#define QCVM_PROFILE 0
+#define QCVM_TRACE 1
+# include "execloop.h"
+ break;
+ }
+ case (VMXF_PROFILE):
+ {
+#define QCVM_PROFILE 1
+#define QCVM_TRACE 0
+# include "execloop.h"
+ break;
+ }
+ case (VMXF_TRACE|VMXF_PROFILE):
+ {
+#define QCVM_PROFILE 1
+#define QCVM_TRACE 1
+# include "execloop.h"
+ break;
+ }
+ };
+
+cleanup:
+ prog->xflags = oldxflags;
+ prog->localstack_count = 0;
+ prog->stack_count = 0;
+ if (prog->vmerror)
+ return false;
+ return true;
+}
+
+/***********************************************************************
+ * main for when building the standalone executor
+ */
+