factor/vm/quotations.cpp

#include "master.hpp"

namespace factor
{

/* Simple non-optimizing compiler.

This is one of the two compilers implementing Factor; the second one is written
in Factor and performs advanced optimizations. See core/compiler/compiler.factor.

The non-optimizing compiler compiles a quotation at a time by concatenating
machine code chunks; prolog, epilog, call word, jump to word, etc. These machine
code chunks are generated from Factor code in core/cpu/.../bootstrap.factor.

Calls to words and constant quotations (referenced by conditionals and dips)
are direct jumps to machine code blocks. Literals are also referenced directly
without going through the literal table.

It actually does do a little bit of very simple optimization:

1) Tail call optimization.

2) If a quotation is determined to not call any other words (except for a few
special words which are open-coded, see below), then no prolog/epilog is
generated.

3) When in tail position and immediately preceded by literal arguments, the
'if' is generated inline, instead of as a call to the 'if' word.

4) When preceded by a quotation, calls to 'dip', '2dip' and '3dip' are
open-coded as retain stack manipulation surrounding a subroutine call.

5) Sub-primitives are primitive words which are implemented in assembly and not
in the VM. They are open-coded and no subroutine call is generated. This
includes stack shufflers, some fixnum arithmetic words, and words such as tag,
slot and eq?. A primitive call is relatively expensive (two subroutine calls)
so this results in a big speedup for relatively little effort. */

bool quotation_jit::primitive_call_p(cell i, cell length)
{
	return (i + 2) == length && array_nth(elements.untagged(),i + 1) == parent->userenv[JIT_PRIMITIVE_WORD];
}

bool quotation_jit::fast_if_p(cell i, cell length)
{
	return (i + 3) == length
		&& tagged<object>(array_nth(elements.untagged(),i + 1)).type_p(QUOTATION_TYPE)
		&& array_nth(elements.untagged(),i + 2) == parent->userenv[JIT_IF_WORD];
}

bool quotation_jit::fast_dip_p(cell i, cell length)
{
	return (i + 2) <= length && array_nth(elements.untagged(),i + 1) == parent->userenv[JIT_DIP_WORD];
}

bool quotation_jit::fast_2dip_p(cell i, cell length)
{
	return (i + 2) <= length && array_nth(elements.untagged(),i + 1) == parent->userenv[JIT_2DIP_WORD];
}

bool quotation_jit::fast_3dip_p(cell i, cell length)
{
	return (i + 2) <= length && array_nth(elements.untagged(),i + 1) == parent->userenv[JIT_3DIP_WORD];
}

bool quotation_jit::mega_lookup_p(cell i, cell length)
{
	return (i + 4) <= length
		&& tagged<object>(array_nth(elements.untagged(),i + 1)).type_p(FIXNUM_TYPE)
		&& tagged<object>(array_nth(elements.untagged(),i + 2)).type_p(ARRAY_TYPE)
		&& array_nth(elements.untagged(),i + 3) == parent->userenv[MEGA_LOOKUP_WORD];
}

bool quotation_jit::declare_p(cell i, cell length)
{
	return (i + 2) <= length
		&& array_nth(elements.untagged(),i + 1) == parent->userenv[JIT_DECLARE_WORD];
}

bool quotation_jit::stack_frame_p()
{
	fixnum length = array_capacity(elements.untagged());
	fixnum i;

	for(i = 0; i < length - 1; i++)
	{
		cell obj = array_nth(elements.untagged(),i);
		switch(tagged<object>(obj).type())
		{
		case WORD_TYPE:
			if(!parent->to_boolean(parent->untag<word>(obj)->subprimitive))
				return true;
			break;
		case QUOTATION_TYPE:
			if(fast_dip_p(i,length) || fast_2dip_p(i,length) || fast_3dip_p(i,length))
				return true;
			break;
		default:
			break;
		}
	}

	return false;
}

bool quotation_jit::trivial_quotation_p(array *elements)
{
	return array_capacity(elements) == 1 && tagged<object>(array_nth(elements,0)).type_p(WORD_TYPE);
}

void quotation_jit::emit_quot(cell quot_)
{
	gc_root<quotation> quot(quot_,parent);

	array *elements = parent->untag<array>(quot->array);

	/* If the quotation consists of a single word, compile a direct call
	to the word. */
	if(trivial_quotation_p(elements))
		literal(array_nth(elements,0));
	else
	{
		if(compiling) parent->jit_compile(quot.value(),relocate);
		literal(quot.value());
	}
}

/* Allocates memory */
void quotation_jit::iterate_quotation()
{
	bool stack_frame = stack_frame_p();

	set_position(0);

	if(stack_frame)
		emit(parent->userenv[JIT_PROLOG]);

	cell i;
	cell length = array_capacity(elements.untagged());
	bool tail_call = false;

	for(i = 0; i < length; i++)
	{
		set_position(i);

		gc_root<object> obj(array_nth(elements.untagged(),i),parent);

		switch(obj.type())
		{
		case WORD_TYPE:
			/* Intrinsics */
			if(parent->to_boolean(obj.as<word>()->subprimitive))
				emit_subprimitive(obj.value());
			/* The (execute) primitive is special-cased */
			else if(obj.value() == parent->userenv[JIT_EXECUTE_WORD])
			{
				if(i == length - 1)
				{
					if(stack_frame) emit(parent->userenv[JIT_EPILOG]);
					tail_call = true;
					emit(parent->userenv[JIT_EXECUTE_JUMP]);
				}
				else
					emit(parent->userenv[JIT_EXECUTE_CALL]);
			}
			/* Everything else */
			else
			{
				if(i == length - 1)
				{
					if(stack_frame) emit(parent->userenv[JIT_EPILOG]);
					tail_call = true;
					/* Inline cache misses are special-cased.
					   The calling convention for tail
					   calls stores the address of the next
					   instruction in a register. However,
					   PIC miss stubs themselves tail-call
					   the inline cache miss primitive, and
					   we don't want to clobber the saved
					   address. */
					if(obj.value() == parent->userenv[PIC_MISS_WORD]
					   || obj.value() == parent->userenv[PIC_MISS_TAIL_WORD])
					{
						word_special(obj.value());
					}
					else
					{
						word_jump(obj.value());
					}
				}
				else
					word_call(obj.value());
			}
			break;
		case WRAPPER_TYPE:
			push(obj.as<wrapper>()->object);
			break;
		case FIXNUM_TYPE:
			/* Primitive calls */
			if(primitive_call_p(i,length))
			{
				literal(tag_fixnum(0));
				literal(obj.value());
				emit(parent->userenv[JIT_PRIMITIVE]);

				i++;

				tail_call = true;
			}
			else
				push(obj.value());
			break;
		case QUOTATION_TYPE:
			/* 'if' preceeded by two literal quotations (this is why if and ? are
			   mutually recursive in the library, but both still work) */
			if(fast_if_p(i,length))
			{
				if(stack_frame) emit(parent->userenv[JIT_EPILOG]);
				tail_call = true;

				emit_quot(array_nth(elements.untagged(),i));
				emit_quot(array_nth(elements.untagged(),i + 1));
				emit(parent->userenv[JIT_IF]);

				i += 2;
			}
			/* dip */
			else if(fast_dip_p(i,length))
			{
				emit_quot(obj.value());
				emit(parent->userenv[JIT_DIP]);
				i++;
			}
			/* 2dip */
			else if(fast_2dip_p(i,length))
			{
				emit_quot(obj.value());
				emit(parent->userenv[JIT_2DIP]);
				i++;
			}
			/* 3dip */
			else if(fast_3dip_p(i,length))
			{
				emit_quot(obj.value());
				emit(parent->userenv[JIT_3DIP]);
				i++;
			}
			else
				push(obj.value());
			break;
		case ARRAY_TYPE:
			/* Method dispatch */
			if(mega_lookup_p(i,length))
			{
				emit_mega_cache_lookup(
					array_nth(elements.untagged(),i),
					untag_fixnum(array_nth(elements.untagged(),i + 1)),
					array_nth(elements.untagged(),i + 2));
				i += 3;
				tail_call = true;
			}
			/* Non-optimizing compiler ignores declarations */
			else if(declare_p(i,length))
				i++;
			else
				push(obj.value());
			break;
		default:
			push(obj.value());
			break;
		}
	}

	if(!tail_call)
	{
		set_position(length);

		if(stack_frame)
			emit(parent->userenv[JIT_EPILOG]);
		emit(parent->userenv[JIT_RETURN]);
	}
}

void factor_vm::set_quot_xt(quotation *quot, code_block *code)
{
	quot->code = code;
	quot->xt = code->xt();
}

/* Allocates memory */
void factor_vm::jit_compile(cell quot_, bool relocating)
{
	gc_root<quotation> quot(quot_,this);
	if(quot->code) return;

	quotation_jit compiler(quot.value(),true,relocating,this);
	compiler.iterate_quotation();

	code_block *compiled = compiler.to_code_block();
	set_quot_xt(quot.untagged(),compiled);

	if(relocating) relocate_code_block(compiled);
}

void factor_vm::primitive_jit_compile()
{
	jit_compile(dpop(),true);
}

/* push a new quotation on the stack */
void factor_vm::primitive_array_to_quotation()
{
	quotation *quot = allot<quotation>(sizeof(quotation));
	quot->array = dpeek();
	quot->cached_effect = false_object;
	quot->cache_counter = false_object;
	quot->xt = (void *)lazy_jit_compile;
	quot->code = NULL;
	drepl(tag<quotation>(quot));
}

void factor_vm::primitive_quotation_xt()
{
	quotation *quot = untag_check<quotation>(dpeek());
	drepl(allot_cell((cell)quot->xt));
}

void factor_vm::compile_all_words()
{
	gc_root<array> words(find_all_words(),this);

	cell i;
	cell length = array_capacity(words.untagged());
	for(i = 0; i < length; i++)
	{
		gc_root<word> word(array_nth(words.untagged(),i),this);

		if(!word->code || !word_optimized_p(word.untagged()))
			jit_compile_word(word.value(),word->def,false);

		update_word_xt(word.value());

	}

	update_code_heap_words();
}

/* Allocates memory */
fixnum factor_vm::quot_code_offset_to_scan(cell quot_, cell offset)
{
	gc_root<quotation> quot(quot_,this);
	gc_root<array> array(quot->array,this);

	quotation_jit compiler(quot.value(),false,false,this);
	compiler.compute_position(offset);
	compiler.iterate_quotation();

	return compiler.get_position();
}

cell factor_vm::lazy_jit_compile_impl(cell quot_, stack_frame *stack)
{
	gc_root<quotation> quot(quot_,this);
	ctx->callstack_top = stack;
	jit_compile(quot.value(),true);
	return quot.value();
}

VM_ASM_API cell lazy_jit_compile_impl(cell quot_, stack_frame *stack, factor_vm *parent)
{
	return parent->lazy_jit_compile_impl(quot_,stack);
}

void factor_vm::primitive_quot_compiled_p()
{
	tagged<quotation> quot(dpop());
	quot.untag_check(this);
	dpush(tag_boolean(quot->code != NULL));
}

}