nunuhara_xsystem4/vm.c

/* Copyright (C) 2019 Nunuhara Cabbage <nunuhara@haniwa.technology>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, see <http://gnu.org/licenses/>.
 */

#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>

#include "system4.h"
#include "vm.h"
#include "vm_string.h"
#include "page.h"
#include "ain.h"
#include "instructions.h"
#include "little_endian.h"
#include "utfsjis.h"

#define INITIAL_STACK_SIZE 1024
#define INITIAL_HEAP_SIZE  4096
#define INITIAL_PAGES_SIZE 4096
#define HLL_MAX_ARGS 64

// When the IP is set to VM_RETURN, the VM halts
#define VM_RETURN 0xFFFFFFFF

/*
 * NOTE: The current implementation is a simple bytecode interpreter.
 *       System40.exe uses a JIT compiler, and we should too.
 */

struct function_call {
	int32_t fno;
	uint32_t return_address;
	int32_t page_slot;
	int32_t struct_page;
};

// The stack
union vm_value *stack = NULL; // the stack
int32_t stack_ptr = 0;        // pointer to the top of the stack
static size_t stack_size;     // current size of the stack

// The heap
// An array of pointers to heap-allocated objects, plus reference counts.
struct vm_pointer *heap;
static size_t heap_size;

// Heap free list
// This is a list of unused indices into the 'heap' array.
static int32_t *heap_free_stack;
static int32_t heap_free_ptr = 0;

// Stack of function call frames
static struct function_call call_stack[4096];
static int32_t call_stack_ptr = 0; // 0 = imaginary frame before main()

struct ain *ain;
static size_t instr_ptr = 0;

// Read the opcode at ADDR.
static int16_t get_opcode(size_t addr)
{
	return LittleEndian_getW(ain->code, addr);
}

// Read argument N for the current instruction.
static int32_t get_argument(int n)
{
	return LittleEndian_getDW(ain->code, instr_ptr + 2 + n*4);
}

// XXX: not strictly portable
static float get_argument_float(int n)
{
	union vm_value v;
	v.i = LittleEndian_getDW(ain->code, instr_ptr + 2 + n*4);
	return v.f;
}

static const char *current_instruction_name(void)
{
	int16_t opcode = get_opcode(instr_ptr);
	if (opcode >= 0 && opcode < NR_OPCODES)
		return instructions[opcode].name;
	return "UNKNOWN OPCODE";
}

int32_t heap_alloc_slot(enum vm_pointer_type type)
{
	int32_t slot = heap_free_stack[heap_free_ptr++];
	heap[slot].ref = 1;
	heap[slot].type = type;
	return slot;
}

static void heap_free_slot(int32_t slot)
{
	heap_free_stack[--heap_free_ptr] = slot;
}

void heap_ref(int32_t slot)
{
	heap[slot].ref++;
}

static const char *vm_ptrtype_strtab[] = {
	[VM_PAGE] = "VM_PAGE",
	[VM_STRING] = "VM_STRING",
};

static const char *vm_ptrtype_string(enum vm_pointer_type type) {
	if (type < NR_VM_POINTER_TYPES)
		return vm_ptrtype_strtab[type];
	return "INVALID POINTER TYPE";
}

void heap_unref(int slot)
{
	if (heap[slot].ref <= 0) {
		VM_ERROR("double free of slot %d (%s)", slot, vm_ptrtype_string(heap[slot].type));
	}
	if (--heap[slot].ref <= 0) {
		switch (heap[slot].type) {
		case VM_PAGE:
			if (heap[slot].page) {
				delete_page(heap[slot].page);
				free_page(heap[slot].page);
			}
			break;
		case VM_STRING:
			free_string(heap[slot].s);
			break;
		}
		heap_free_slot(slot);
	}
}

static int local_page_slot(void)
{
	return call_stack[call_stack_ptr-1].page_slot;
}

static union vm_value *local_page(void)
{
	return heap[local_page_slot()].page->values;
}

static union vm_value local_get(int varno)
{
	return local_page()[varno];
}

static void local_set(int varno, int32_t value)
{
	local_page()[varno].i = value;
}

static union vm_value *local_ptr(int varno)
{
	return local_page() + varno;
}

static union vm_value global_get(int varno)
{
	return heap[0].page->values[varno];
}

static int32_t struct_page_slot(void)
{
	return call_stack[call_stack_ptr-1].struct_page;
}

static union vm_value *struct_page(void)
{
	return heap[struct_page_slot()].page->values;
}

static union vm_value stack_peek(int n)
{
	return stack[stack_ptr - (1 + n)];
}

union vm_value stack_pop(void)
{
	stack_ptr--;
	return stack[stack_ptr];
}

static union vm_value *stack_peek_ptr(int n)
{
	return &stack[stack_ptr - (1 + n)];
}

// Pop a reference off the stack, returning the address of the referenced object.
static union vm_value *stack_pop_var(void)
{
	int32_t page_index = stack_pop().i;
	int32_t heap_index = stack_pop().i;
	if (!heap[heap_index].page || page_index >= heap[heap_index].page->nr_vars)
		VM_ERROR("Out of bounds page index: %d/%d", heap_index, page_index);
	return &heap[heap_index].page->values[page_index];
}

static void stack_push_string(struct string *s)
{
	int32_t heap_slot = heap_alloc_slot(VM_STRING);
	heap[heap_slot].s = s;
	stack[stack_ptr++].i = heap_slot;
}

static struct string *stack_peek_string(int n)
{
	return heap[stack_peek(n).i].s;
}

int vm_string_ref(struct string *s)
{
	int slot = heap_alloc_slot(VM_STRING);
	heap[slot].s = string_ref(s);
	return slot;
}

int vm_copy_page(struct page *page)
{
	int slot = heap_alloc_slot(VM_PAGE);
	heap[slot].page = copy_page(page);
	return slot;
}

union vm_value vm_copy(union vm_value v, enum ain_data_type type)
{
	switch (type) {
	case AIN_STRING:
		return (union vm_value) { .i = vm_string_ref(heap[v.i].s) };
	case AIN_STRUCT:
	case AIN_ARRAY_TYPE:
		return (union vm_value) { .i = vm_copy_page(heap[v.i].page) };
	default:
		return v;
	}
}

/*
 * System 4 calling convention:
 *   - caller pushes arguments, in order
 *   - CALLFUNC creates stack frame, pops arguments into local page
 *   - callee pushes return value on the stack
 *   - RETURN jumps to return address (saved in stack frame)
 */
static void function_call(int fno, int return_address)
{
	struct ain_function *f = &ain->functions[fno];
	int slot = heap_alloc_slot(VM_PAGE);
	heap[slot].page = alloc_page(LOCAL_PAGE, fno, f->nr_vars);

	call_stack[call_stack_ptr++] = (struct function_call) {
		.fno = fno,
		.return_address = return_address,
		.page_slot = slot,
		.struct_page = -1
	};
	// pop arguments, store in local page
	for (int i = f->nr_args - 1; i >= 0; i--) {
		heap[slot].page->values[i] = stack_pop();
	}
	// initialize local variables
	for (int i = f->nr_args; i < f->nr_vars; i++) {
		heap[slot].page->values[i] = variable_initval(f->vars[i].data_type);
	}
	// jump to function start
	instr_ptr = ain->functions[fno].address;
}

static void method_call(int fno, int return_address)
{
	function_call(fno, return_address);
	call_stack[call_stack_ptr-1].struct_page = stack_pop().i;
}

static void vm_execute(void);

void vm_call(int fno, int struct_page)
{
	size_t saved_ip = instr_ptr;
	if (struct_page < 0) {
		function_call(fno, VM_RETURN);
	} else {
		stack_push(struct_page);
		method_call(fno, VM_RETURN);
	}
	vm_execute();
	instr_ptr = saved_ip;
}

static void hll_call(int libno, int fno)
{
	struct ain_hll_function *f = &ain->libraries[libno].functions[fno];
	if (!f->fun)
		VM_ERROR("Unimplemented HLL function: %s.%s", ain->libraries[libno].name, f->name);

	union vm_value args[HLL_MAX_ARGS];
	for (int i = f->nr_arguments - 1; i >= 0; i--) {
		int pageno, varno;
		switch(f->arguments[i].data_type) {
		case AIN_REF_INT:
		case AIN_REF_BOOL:
		case AIN_REF_FLOAT:
			stack_ptr -= 2;
			pageno = stack[stack_ptr].i;
			varno = stack[stack_ptr+1].i;
			args[i].ref = &heap[pageno].page->values[varno];
			break;
		default:
			stack_ptr--;
			args[i] = stack[stack_ptr];
		}
	}
	union vm_value r = f->fun(args);
	for (int i = 0; i < f->nr_arguments; i++) {
		variable_fini(stack[stack_ptr + i], f->arguments[i].data_type);
	}
	if (f->data_type != AIN_VOID)
		stack_push(r);
}

static void function_return(void)
{
	call_stack_ptr--;
	heap_unref(call_stack[call_stack_ptr].page_slot);
	instr_ptr = call_stack[call_stack_ptr].return_address;
}

static void system_call(int32_t code)
{
	char *utf;
	struct string *str;
	switch (code) {
	case 0x0: // system.Exit(int nResult)
		sys_exit(stack_pop().i);
		break;
	case 0x3: // system.LockPeek()
	case 0x4: // system.UnlockPeek()
		stack_push(1);
		break;
	case 0x6: // system.Output(string szText)
		str = stack_peek_string(0);
		utf = sjis2utf(str->text, str->size);
		sys_message("%s", utf);
		free(utf);
		// XXX: caller S_POPs
		break;
	case 0xC:
		if (config.save_dir)
			stack_push_string(make_string(config.save_dir, strlen(config.save_dir)));
		else
			stack_push_string(string_ref(&EMPTY_STRING));
		break;
	case 0xD:
		stack_push(vm_time());
		break;
	case 0x14: // system.Peek()
		break;
	case 0x15: // system.Sleep(int nSleep)
		stack_pop();
		break;
	default:
		WARNING("Unimplemented syscall: 0x%X", code);
		vm_stack_trace();
	}
}

void exec_switch(int no, int val)
{
	struct ain_switch *s = &ain->switches[no];
	for (int i = 0; i < s->nr_cases; i++) {
		if (s->cases[i].value == val) {
			instr_ptr = s->cases[i].address;
			return;
		}
	}
	if (s->default_address > 0)
		instr_ptr = s->default_address;
	else
		instr_ptr += instruction_width(SWITCH);
}

void exec_strswitch(int no, struct string *str)
{
	struct ain_switch *s = &ain->switches[no];
	for (int i = 0; i < s->nr_cases; i++) {
		if (!strcmp(str->text, ain->strings[s->cases[i].value]->text)) {
			instr_ptr = s->cases[i].address;
			return;
		}
	}
	if (s->default_address > 0)
		instr_ptr = s->default_address;
	else
		instr_ptr += instruction_width(STRSWITCH);
}

static void execute_instruction(int16_t opcode)
{
	int32_t a, b, c, v, pageno, varno, slot;
	int32_t src, src_i, dst, dst_i, i, n;
	enum ain_data_type data_type, struct_type;
	float f;
	struct string *s;
	union vm_value val;
	union vm_value *ref;
	switch (opcode) {
	//
	// --- Stack Management ---
	//
	case PUSH:
		stack_push(get_argument(0));
		break;
	case POP:
		stack_pop();
		break;
	case F_PUSH:
		stack_push(get_argument_float(0));
		break;
	case REF:
		// Dereference a reference to a value.
		v = stack_pop_var()[0].i;
		stack_push(v);
		break;
	case REFREF:
		// Dereference a reference to a reference.
		ref = stack_pop_var();
		stack_push(ref[0].i);
		stack_push(ref[1].i);
		break;
	case DUP:
		// A -> AA
		stack_push(stack_peek(0).i);
		break;
	case DUP2:
		// AB -> ABAB
		a = stack_peek(1).i;
		b = stack_peek(0).i;
		stack_push(a);
		stack_push(b);
		break;
	case DUP_X2:
		// ABC -> CABC
		a = stack_peek(2).i;
		b = stack_peek(1).i;
		c = stack_peek(0).i;
		stack_set(2, c);
		stack_set(1, a);
		stack_set(0, b);
		stack_push(c);
		break;
	case DUP2_X1:
		// ABC -> BCABC
		a = stack_peek(2).i;
		b = stack_peek(1).i;
		c = stack_peek(0).i;
		stack_set(2, b);
		stack_set(1, c);
		stack_set(0, a);
		stack_push(b);
		stack_push(c);
		break;
	case DUP_U2:
		// AB -> ABA
		stack_push(stack_peek(1).i);
		break;
	case SWAP:
		a = stack_peek(1).i;
		stack_set(1, stack_peek(0));
		stack_set(0, a);
		break;
	//
	// --- Variables ---
	//
	case PUSHGLOBALPAGE:
		stack_push(0);
		break;
	case PUSHLOCALPAGE:
		stack_push(local_page_slot());
		break;
	case PUSHSTRUCTPAGE:
		stack_push(struct_page_slot());
		break;
	case ASSIGN:
	case F_ASSIGN:
		val = stack_pop();
		stack_pop_var()[0] = val;
		stack_push(val);
		break;
	case SH_GLOBALREF: // VARNO
		stack_push(global_get(get_argument(0)).i);
		break;
	case SH_LOCALREF: // VARNO
		stack_push(local_get(get_argument(0)).i);
		break;
	case SH_STRUCTREF: // VARNO
		stack_push(struct_page()[get_argument(0)]);
		break;
	case SH_LOCALASSIGN: // VARNO, VALUE
		local_set(get_argument(0), get_argument(1));
		break;
	case SH_LOCALINC: // VARNO
		varno = get_argument(0);
		local_set(varno, local_get(varno).i+1);
		break;
	case SH_LOCALDEC: // VARNO
		varno = get_argument(0);
		local_set(varno, local_get(varno).i-1);
		break;
	case SH_LOCALDELETE:
		if ((slot = local_get(get_argument(0)).i) != -1) {
			heap_unref(slot);
			local_set(get_argument(0), -1);
		}
		break;
	case SH_LOCALCREATE: // VARNO, STRUCTNO
		create_struct(get_argument(1), local_ptr(get_argument(0)));
		break;
	case R_ASSIGN:
		varno = stack_pop().i;
		pageno = stack_pop().i;
		dst_i = stack_pop().i;
		dst = stack_pop().i;
		heap[dst].page->values[dst_i].i = pageno;
		heap[dst].page->values[dst_i+1].i = varno;
		stack_push(pageno);
		stack_push(varno);
		break;
	case DELETE:
		if ((slot = stack_pop().i) != -1)
			heap_unref(slot);
		break;
	case SP_INC:
		heap_ref(stack_pop().i);
		break;
	//
	// --- Control Flow ---
	//
	case CALLFUNC:
		function_call(get_argument(0), instr_ptr + instruction_width(CALLFUNC));
		break;
	case CALLFUNC2:
		stack_pop(); // function-type index (only needed for compilation)
		function_call(stack_pop().i, instr_ptr + instruction_width(CALLFUNC2));
		break;
	case CALLMETHOD:
		method_call(get_argument(0), instr_ptr + instruction_width(CALLMETHOD));
		break;
	case CALLHLL:
		hll_call(get_argument(0), get_argument(1));
		break;
	case RETURN:
		function_return();
		break;
	case CALLSYS:
		system_call(get_argument(0));
		break;
	case JUMP: // ADDR
		instr_ptr = get_argument(0);
		break;
	case IFZ: // ADDR
		if (!stack_pop().i)
			instr_ptr = get_argument(0);
		else
			instr_ptr += instruction_width(IFZ);
		break;
	case IFNZ: // ADDR
		if (stack_pop().i)
			instr_ptr = get_argument(0);
		else
			instr_ptr += instruction_width(IFNZ);
		break;
	case SWITCH:
		exec_switch(get_argument(0), stack_pop().i);
		break;
	case STRSWITCH:
		slot = stack_pop().i;
		exec_strswitch(get_argument(0), heap[slot].s);
		heap_unref(slot);
		break;
	case ASSERT:
		i = stack_pop().i; // line number
		a = stack_pop().i; // filename
		b = stack_pop().i; // expression
		v = stack_pop().i; // value
		if (!v) {
			sys_message("Assertion failed at %s:%d: %s\n", heap[a].s->text, i, heap[b].s->text);
			sys_exit(1);
		}
		heap_unref(a);
		heap_unref(b);
		break;
	//
	// --- Arithmetic ---
	//
	case INV:
		stack[stack_ptr-1].i = -stack[stack_ptr-1].i;
		break;
	case NOT:
		stack[stack_ptr-1].i = !stack[stack_ptr-1].i;
		break;
	case COMPL:
		stack[stack_ptr-1].i = ~stack[stack_ptr-1].i;
		break;
	case ADD:
		stack[stack_ptr-2].i += stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	case SUB:
		stack[stack_ptr-2].i -= stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	case MUL:
		stack[stack_ptr-2].i *= stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	case DIV:
		stack[stack_ptr-2].i /= stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	case MOD:
		stack[stack_ptr-2].i %= stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	case AND:
		stack[stack_ptr-2].i &= stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	case OR:
		stack[stack_ptr-2].i |= stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	case XOR:
		stack[stack_ptr-2].i ^= stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	case LSHIFT:
		stack[stack_ptr-2].i <<= stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	case RSHIFT:
		stack[stack_ptr-2].i >>= stack[stack_ptr-1].i;
		stack_ptr--;
		break;
	// Numeric Comparisons
	case LT:
		b = stack_pop().i;
		a = stack_pop().i;
		stack_push(a < b ? 1 : 0);
		break;
	case GT:
		b = stack_pop().i;
		a = stack_pop().i;
		stack_push(a > b ? 1 : 0);
		break;
	case LTE:
		b = stack_pop().i;
		a = stack_pop().i;
		stack_push(a <= b ? 1 : 0);
		break;
	case GTE:
		b = stack_pop().i;
		a = stack_pop().i;
		stack_push(a >= b ? 1 : 0);
		break;
	case NOTE:
		b = stack_pop().i;
		a = stack_pop().i;
		stack_push(a != b ? 1 : 0);
		break;
	case EQUALE:
		b = stack_pop().i;
		a = stack_pop().i;
		stack_push(a == b ? 1 : 0);
		break;
	// +=, -=, etc.
	case PLUSA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i += v);
		break;
	case MINUSA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i -= v);
		break;
	case MULA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i *= v);
		break;
	case DIVA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i /= v);
		break;
	case MODA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i %= v);
		break;
	case ANDA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i &= v);
		break;
	case ORA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i |= v);
		break;
	case XORA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i ^= v);
		break;
	case LSHIFTA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i <<= v);
		break;
	case RSHIFTA:
		v = stack_pop().i;
		stack_push(stack_pop_var()[0].i >>= v);
		break;
	case INC:
		stack_pop_var()[0].i++;
		break;
	case DEC:
		stack_pop_var()[0].i--;
		break;
	case ITOB:
		stack_set(0, !!stack_peek(0).i);
		break;
	//
	// --- Floating Point Arithmetic ---
	//
	case FTOI:
		stack_set(0, (int32_t)stack_peek(0).f);
		break;
	case ITOF:
		stack_set(0, (float)stack_peek(0).i);
		break;
	case F_INV:
		stack_set(0, -stack_peek(0).f);
		break;
	case F_ADD:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f + f);
		break;
	case F_SUB:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f - f);
		break;
	case F_MUL:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f * f);
		break;
	case F_DIV:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f / f);
		break;
	// floating point comparison
	case F_LT:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f < f ? 1 : 0);
		break;
	case F_GT:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f > f ? 1 : 0);
		break;
	case F_LTE:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f <= f ? 1 : 0);
		break;
	case F_GTE:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f >= f ? 1 : 0);
		break;
	case F_NOTE:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f != f ? 1 : 0);
		break;
	case F_EQUALE:
		f = stack_pop().f;
		stack_set(0, stack_peek(0).f == f ? 1 : 0);
		break;
	//
	// --- Strings ---
	//
	case S_PUSH:
		stack_push_string(string_ref(ain->strings[get_argument(0)]));
		break;
	case S_POP:
		slot = stack_pop().i;
		heap_unref(slot);
		break;
	case S_REF:
		// Dereference a reference to a string
		slot = stack_pop_var()->i;
		stack_push_string(string_ref(heap[slot].s));
		break;
	//case S_REFREF: // ???: why/how is this different from regular REFREF?
	case S_ASSIGN: // A = B
		b = stack_peek(0).i;
		a = stack_peek(1).i;
		if (heap[a].s) {
			free_string(heap[a].s);
		}
		heap[a].s = string_ref(heap[b].s);
		// remove A from the stack, but leave B
		stack_set(1, b);
		stack_pop();
		break;
	case S_PLUSA2:
		a = stack_peek(1).i;
		b = stack_peek(0).i;
		string_append(&heap[a].s, heap[b].s);
		heap_unref(b);
		stack_pop();
		stack_pop();
		stack_push_string(string_ref(heap[a].s));
		break;
	case S_ADD:
		b = stack_pop().i;
		a = stack_pop().i;
		// TODO: can use string_append here?
		stack_push_string(string_concatenate(heap[a].s, heap[b].s));
		heap_unref(a);
		heap_unref(b);
		break;
	case S_LT:
		v = strcmp(stack_peek_string(1)->text, stack_peek_string(0)->text) < 0;
		heap_unref(stack_pop().i);
		heap_unref(stack_pop().i);
		stack_push(v);
		break;
	case S_GT:
		v = strcmp(stack_peek_string(1)->text, stack_peek_string(0)->text) > 0;
		heap_unref(stack_pop().i);
		heap_unref(stack_pop().i);
		stack_push(v);
		break;
	case S_LTE:
		v = strcmp(stack_peek_string(1)->text, stack_peek_string(0)->text) <= 0;
		heap_unref(stack_pop().i);
		heap_unref(stack_pop().i);
		stack_push(v);
		break;
	case S_GTE:
		v = strcmp(stack_peek_string(1)->text, stack_peek_string(0)->text) >= 0;
		heap_unref(stack_pop().i);
		heap_unref(stack_pop().i);
		stack_push(v);
		break;
	case S_NOTE:
		v = !!strcmp(stack_peek_string(1)->text, stack_peek_string(0)->text);
		heap_unref(stack_pop().i);
		heap_unref(stack_pop().i);
		stack_push(v);
		break;
	case S_EQUALE:
		v = !strcmp(stack_peek_string(1)->text, stack_peek_string(0)->text);
		heap_unref(stack_pop().i);
		heap_unref(stack_pop().i);
		stack_push(v);
		break;
	case S_LENGTH:
		a = stack_pop_var()->i;
		stack_push(sjis_count_char(heap[a].s->text));
		break;
	case S_LENGTHBYTE:
		a = stack_pop_var()->i;
		stack_push(heap[a].s->size);
		break;
	case S_EMPTY:
		v = !stack_peek_string(0)->size;
		heap_unref(stack_pop().i);
		stack_push(v);
		break;
	case S_FIND:
		v = string_find(stack_peek_string(1), stack_peek_string(0));
		heap_unref(stack_pop().i);
		heap_unref(stack_pop().i);
		stack_push(v);
		break;
	case S_GETPART:
		b = stack_pop().i; // length
		a = stack_pop().i; // index
		s = string_copy(stack_peek_string(0), a, b);
		heap_unref(stack_pop().i);
		stack_push_string(s);
		break;
	//case S_PUSHBACK: // ???
	case S_PUSHBACK2:
		v = stack_pop().i;
		string_push_back(&heap[stack_pop().i].s, v);
		break;
	//case S_POPBACK: // ???
	case S_POPBACK2:
		slot = stack_pop().i;
		string_pop_back(&heap[slot].s);
		break;
	//case S_ERASE: // ???
	case S_ERASE2:
		b = stack_pop().i; // ???
		a = stack_pop().i; // index
		slot = stack_pop().i;
		string_erase(&heap[slot].s, a);
		break;
	case S_MOD:
		stack_pop(); // ???
		val = stack_pop();
		slot = stack_pop().i;
		dst = heap_alloc_slot(VM_STRING);
		heap[dst].s = string_format(heap[slot].s, val);
		heap_unref(slot);
		stack_push(dst);
		break;
	case I_STRING:
		stack_push_string(integer_to_string(stack_pop().i));
		break;
	case FTOS:
		v = stack_pop().i; // precision
		stack_push_string(float_to_string(stack_pop().f, v));
		break;
	// --- Characters ---
	case C_REF:
		v = stack_pop().i;
		slot = stack_pop().i;
		stack_push(string_get_char(heap[slot].s, v));
		break;
	case C_ASSIGN:
		v = stack_pop().i;
		i = stack_pop().i;
		slot = stack_pop().i;
		string_set_char(&heap[slot].s, i, v);
		stack_push(v);
		break;
	//
	// --- Structs/Classes ---
	//
	case SR_REF:
		stack_push(vm_copy_page(heap[stack_pop_var()->i].page));
		break;
	case SR_POP:
		heap_unref(stack_pop().i);
		break;
	case SR_ASSIGN:
		stack_pop(); // struct type
		b = stack_pop().i;
		a = stack_pop().i;
		if (a == -1)
			VM_ERROR("Assignment to null-pointer");
		if (heap[a].page)
			delete_page(heap[a].page);
		heap[a].page = copy_page(heap[b].page);
		stack_push(b);
		break;
	//
	// -- Arrays --
	//
	case A_ALLOC:
		a = stack_pop().i; // rank
		varno = stack_peek(a).i;
		pageno = stack_peek(a+1).i;
		slot = heap[pageno].page->values[varno].i;
		data_type = variable_type(heap[pageno].page, varno, &struct_type);
		heap[slot].page = alloc_array(a, stack_peek_ptr(a-1), data_type, struct_type);
		stack_ptr -= a + 2;
		break;
	case A_REALLOC:
		a = stack_pop().i; // rank
		varno = stack_peek(a).i;
		pageno = stack_peek(a+1).i;
		slot = heap[pageno].page->values[varno].i;
		data_type = variable_type(heap[pageno].page, varno, &struct_type);
		heap[slot].page = realloc_array(heap[slot].page, a, stack_peek_ptr(a-1), data_type, struct_type);
		stack_ptr -= a + 2;
		break;
	case A_FREE:
		slot = stack_pop_var()->i;
		if (heap[slot].page) {
			delete_page(heap[slot].page);
			free_page(heap[slot].page);
			heap[slot].page = NULL;
		}
		break;
	case A_REF:
		a = stack_pop().i;
		slot = heap_alloc_slot(VM_PAGE);
		heap[slot].page = copy_page(heap[a].page);
		stack_push(slot);
		break;
	case A_NUMOF:
		a = stack_pop().i; // rank
		slot = stack_pop_var()->i;
		stack_push(array_numof(heap[slot].page, a));
		break;
	case A_COPY:
		n = stack_pop().i;
		src_i = stack_pop().i;
		src = stack_pop().i;
		dst_i = stack_pop().i;
		dst = stack_pop_var()->i;
		array_copy(heap[dst].page, dst_i, heap[src].page, src_i, n);
		stack_push(n);
		break;
	case A_FILL:
		val = stack_pop();
		n = stack_pop().i;
		dst_i = stack_pop().i;
		dst = stack_pop_var()->i;
		stack_push(array_fill(heap[dst].page, dst_i, n, val));
		break;
	case A_PUSHBACK:
		val = stack_pop();
		varno = stack_pop().i;
		pageno = stack_pop().i;
		slot = heap[pageno].page->values[varno].i;
		data_type = variable_type(heap[pageno].page, varno, &struct_type);
		array_pushback(&heap[slot].page, val, data_type, struct_type);
		break;
	case A_POPBACK:
		array_popback(&heap[stack_pop_var()->i].page);
		break;
	case A_EMPTY:
		slot = stack_pop_var()->i;
		stack_push(!heap[slot].page);
		break;
	case A_ERASE:
		i = stack_pop().i;
		slot = stack_pop_var()->i;
		stack_push(array_erase(&heap[slot].page, i));
		break;
	case A_INSERT:
		val = stack_pop();
		i = stack_pop().i;
		varno = stack_pop().i;
		pageno = stack_pop().i;
		slot = heap[pageno].page->values[varno].i;
		data_type = variable_type(heap[pageno].page, varno, &struct_type);
		array_insert(&heap[slot].page, i, val, data_type, struct_type);
		break;
	case A_SORT:
		a = stack_pop().i;
		slot = stack_pop_var()->i;
		array_sort(heap[slot].page, a);
		break;
	// -- NOOPs ---
	case FUNC:
		break;
	default:
		VM_ERROR("Unimplemented instruction");
	}
}

static void vm_execute(void)
{
	for (;;) {
		uint16_t opcode;
		if (instr_ptr == VM_RETURN)
			return;
		if (instr_ptr >= ain->code_size) {
			VM_ERROR("Illegal instruction pointer: 0x%08lX", instr_ptr);
		}
		opcode = get_opcode(instr_ptr);
		if (opcode >= NR_OPCODES) {
			VM_ERROR("Illegal opcode: 0x%04X", opcode);
		}
		execute_instruction(opcode);
		instr_ptr += instructions[opcode].ip_inc;
	}
}

extern struct library lib_DrawPluginManager;
extern struct library lib_Math;
extern struct library lib_MsgLogManager;
extern struct library lib_MsgSkip;
extern struct library lib_OutputLog;
extern struct library lib_SACT2;

struct library *libraries[] = {
	&lib_DrawPluginManager,
	&lib_Math,
	&lib_MsgLogManager,
	&lib_MsgSkip,
	&lib_OutputLog,
	&lib_SACT2,
	NULL
};

static void link_library(struct ain_library *ainlib, struct library *lib)
{
	for (int i = 0; i < ainlib->nr_functions; i++) {
		bool linked = false;
		for (int j = 0; lib->functions[j]; j++) {
			if (!strcmp(ainlib->functions[i].name, lib->functions[j]->name)) {
				ainlib->functions[i].fun = lib->functions[j]->fun;
				linked = true;
				break;
			}
		}
		if (!linked)
			WARNING("Unimplemented library function: %s", ainlib->functions[i].name);
		else if (ainlib->functions[i].nr_arguments >= HLL_MAX_ARGS)
			ERROR("Too many arguments to library function: %s", ainlib->functions[i].name);
	}
}

static void link_libraries(void)
{
	for (int i = 0; i < ain->nr_libraries; i++) {
		bool linked = false;
		for (int j = 0; libraries[j]; j++) {
			if (!strcmp(ain->libraries[i].name, libraries[j]->name)) {
				link_library(&ain->libraries[i], libraries[j]);
				linked = true;
				break;
			}
		}
		if (!linked)
			WARNING("Unimplemented library: %s", ain->libraries[i].name);
	}
}

void vm_execute_ain(struct ain *program)
{
	// initialize VM state
	stack_size = INITIAL_STACK_SIZE;
	stack = xmalloc(INITIAL_STACK_SIZE * sizeof(union vm_value));
	stack_ptr = 0;

	heap_size = INITIAL_HEAP_SIZE;
	heap = xmalloc(INITIAL_HEAP_SIZE * sizeof(struct vm_pointer));

	heap_free_stack = xmalloc(INITIAL_HEAP_SIZE * sizeof(int32_t));
	for (size_t i = 0; i < INITIAL_HEAP_SIZE; i++) {
		heap_free_stack[i] = i;
	}
	heap_free_ptr = 1; // global page at index 0

	ain = program;

	link_libraries();

	// Initialize globals
	heap[0].page = alloc_page(GLOBAL_PAGE, 0, ain->nr_globals);
	for (int i = 0; i < ain->nr_globals; i++) {
		int slot;
		switch (ain->globals[i].data_type) {
		case AIN_STRING:
			heap[0].page->values[i].i = heap_alloc_slot(VM_STRING);
			break;
		case AIN_REF_TYPE:
			heap[0].page->values[i].i = -1;
			break;
		case AIN_ARRAY_TYPE:
			slot = heap_alloc_slot(VM_PAGE);
			heap[0].page->values[i].i = slot;
			heap[slot].page = NULL;
			break;
		case AIN_STRUCT:
			create_struct(ain->globals[i].struct_type, &heap[0].page->values[i]);
			break;
		default:
			break;
		}
	}
	for (int i = 0; i < ain->nr_initvals; i++) {
		int32_t index;
		struct ain_initval *v = &ain->global_initvals[i];
		switch (v->data_type) {
		case AIN_STRING:
			index = heap_alloc_slot(VM_STRING);
			heap[0].page->values[v->global_index].i = index;
			heap[index].s = make_string(v->string_value, strlen(v->string_value));
			break;
		default:
			heap[0].page->values[v->global_index].i = v->int_value;
			break;
		}
	}

	vm_call(ain->main, -1);
}

void vm_stack_trace(void)
{
	for (int i = call_stack_ptr - 1; i >= 0; i--) {
		sys_warning("\t%s\n", ain->functions[call_stack[i].fno].name);
	}
}

noreturn void _vm_error(const char *fmt, ...)
{
	va_list ap;
	va_start(ap, fmt);
	sys_vwarning(fmt, ap);
	va_end(ap);
	sys_warning("at %s (0x%X) in:\n", current_instruction_name(), instr_ptr);
	vm_stack_trace();
	sys_exit(1);
}

int vm_time(void)
{
	int ms;
	time_t s;
	struct timespec spec;

	clock_gettime(CLOCK_MONOTONIC, &spec);

	s = spec.tv_sec;
	ms = lround(spec.tv_nsec / 1.0e6);
	if (ms > 999) {
		s++;
		ms = 0;
	}
	return ms;
}