#include "master.hpp"
-namespace factor
-{
-
-void factor_vm::check_frame(stack_frame *frame)
-{
-#ifdef FACTOR_DEBUG
- check_code_pointer((cell)frame->entry_point);
- assert(frame->size != 0);
-#endif
-}
-
-callstack *factor_vm::allot_callstack(cell size)
-{
- callstack *stack = allot<callstack>(callstack_object_size(size));
- stack->length = tag_fixnum(size);
- return stack;
-}
-
-/* If 'stack' points into the middle of the frame, find the nearest valid stack
-pointer where we can resume execution and hope to capture the call trace without
-crashing. Also, make sure we have at least 'stack_reserved' bytes available so
-that we don't run out of callstack space while handling the error. */
-stack_frame *factor_vm::fix_callstack_top(stack_frame *stack)
-{
- stack_frame *frame = ctx->callstack_bottom - 1;
-
- while(frame >= stack
- && frame >= ctx->callstack_top
- && (cell)frame >= ctx->callstack_seg->start + stack_reserved)
- frame = frame_successor(frame);
-
- return frame + 1;
-}
-
-/* We ignore the two topmost frames, the 'callstack' primitive
-frame itself, and the frame calling the 'callstack' primitive,
-so that set-callstack doesn't get stuck in an infinite loop.
-
-This means that if 'callstack' is called in tail position, we
-will have popped a necessary frame... however this word is only
-called by continuation implementation, and user code shouldn't
-be calling it at all, so we leave it as it is for now. */
-stack_frame *factor_vm::second_from_top_stack_frame(context *ctx)
-{
- stack_frame *frame = ctx->callstack_bottom - 1;
- while(frame >= ctx->callstack_top
- && frame_successor(frame) >= ctx->callstack_top
- && frame_successor(frame_successor(frame)) >= ctx->callstack_top)
- {
- frame = frame_successor(frame);
- }
- return frame + 1;
-}
-
-cell factor_vm::capture_callstack(context *ctx)
-{
- stack_frame *top = second_from_top_stack_frame(ctx);
- stack_frame *bottom = ctx->callstack_bottom;
-
- fixnum size = std::max((fixnum)0,(fixnum)bottom - (fixnum)top);
-
- callstack *stack = allot_callstack(size);
- memcpy(stack->top(),top,size);
- return tag<callstack>(stack);
-}
+namespace factor {
-void factor_vm::primitive_callstack()
-{
- ctx->push(capture_callstack(ctx));
+// Allocates memory (allot)
+callstack* factor_vm::allot_callstack(cell size) {
+ callstack* stack = allot<callstack>(callstack_object_size(size));
+ stack->length = tag_fixnum(size);
+ return stack;
}
-void factor_vm::primitive_callstack_for()
-{
- context *other_ctx = (context *)pinned_alien_offset(ctx->pop());
- ctx->push(capture_callstack(other_ctx));
-}
-
-code_block *factor_vm::frame_code(stack_frame *frame)
-{
- check_frame(frame);
- return (code_block *)frame->entry_point - 1;
-}
+// We ignore the two topmost frames, the 'callstack' primitive
+// frame itself, and the frame calling the 'callstack' primitive,
+// so that set-callstack doesn't get stuck in an infinite loop.
-code_block_type factor_vm::frame_type(stack_frame *frame)
-{
- return frame_code(frame)->type();
+// This means that if 'callstack' is called in tail position, we
+// will have popped a necessary frame... however this word is only
+// called by continuation implementation, and user code shouldn't
+// be calling it at all, so we leave it as it is for now.
+cell factor_vm::second_from_top_stack_frame(context* ctx) {
+ cell frame_top = ctx->callstack_top;
+ for (cell i = 0; i < 2; ++i) {
+ cell pred = code->frame_predecessor(frame_top);
+ if (pred >= ctx->callstack_bottom)
+ return frame_top;
+ frame_top = pred;
+ }
+ return frame_top;
}
-cell factor_vm::frame_executing(stack_frame *frame)
-{
- return frame_code(frame)->owner;
-}
+// Allocates memory (allot_callstack)
+cell factor_vm::capture_callstack(context* ctx) {
+ cell top = second_from_top_stack_frame(ctx);
+ cell bottom = ctx->callstack_bottom;
-cell factor_vm::frame_executing_quot(stack_frame *frame)
-{
- tagged<object> executing(frame_executing(frame));
- code_block *compiled = frame_code(frame);
- if(!compiled->optimized_p() && executing->type() == WORD_TYPE)
- executing = executing.as<word>()->def;
- return executing.value();
-}
-
-stack_frame *factor_vm::frame_successor(stack_frame *frame)
-{
- check_frame(frame);
- return (stack_frame *)((cell)frame - frame->size);
-}
+ fixnum size = std::max((cell)0, bottom - top);
-/* Allocates memory */
-cell factor_vm::frame_scan(stack_frame *frame)
-{
- switch(frame_type(frame))
- {
- case code_block_unoptimized:
- {
- tagged<object> obj(frame_executing(frame));
- if(obj.type_p(WORD_TYPE))
- obj = obj.as<word>()->def;
-
- if(obj.type_p(QUOTATION_TYPE))
- {
- char *return_addr = (char *)FRAME_RETURN_ADDRESS(frame,this);
- char *quot_entry_point = (char *)frame_code(frame)->entry_point();
-
- return tag_fixnum(quot_code_offset_to_scan(
- obj.value(),(cell)(return_addr - quot_entry_point)));
- }
- else
- return false_object;
- }
- case code_block_optimized:
- return false_object;
- default:
- critical_error("Bad frame type",frame_type(frame));
- return false_object;
- }
+ callstack* stack = allot_callstack(size);
+ memcpy(stack->top(), (void *)top, size);
+ return tag<callstack>(stack);
}
-cell factor_vm::frame_offset(stack_frame *frame)
-{
- return (cell)FRAME_RETURN_ADDRESS(frame,this) - (cell)frame_code(frame)->entry_point();
+// Allocates memory (capture_callstack)
+void factor_vm::primitive_callstack_for() {
+ context* other_ctx = (context*)pinned_alien_offset(ctx->peek());
+ ctx->replace(capture_callstack(other_ctx));
}
-struct stack_frame_accumulator {
- factor_vm *parent;
- growable_array frames;
+// Allocates memory (frames.trim()), iterate_callstack_object()
+void factor_vm::primitive_callstack_to_array() {
+ data_root<callstack> callstack(ctx->peek(), this);
+ // Allocates memory here.
+ growable_array frames(this);
- explicit stack_frame_accumulator(factor_vm *parent_) : parent(parent_), frames(parent_) {}
-
- void operator()(stack_frame *frame)
- {
- data_root<object> executing_quot(parent->frame_executing_quot(frame),parent);
- data_root<object> executing(parent->frame_executing(frame),parent);
- data_root<object> scan(parent->frame_scan(frame),parent);
-
- frames.add(executing.value());
- frames.add(executing_quot.value());
- frames.add(scan.value());
- }
-};
-
-void factor_vm::primitive_callstack_to_array()
-{
- data_root<callstack> callstack(ctx->pop(),this);
-
- stack_frame_accumulator accum(this);
- iterate_callstack_object(callstack.untagged(),accum);
- accum.frames.trim();
-
- ctx->push(accum.frames.elements.value());
-}
+ auto stack_frame_accumulator = [&](cell frame_top,
+ cell size,
+ code_block* owner,
+ cell addr) {
+ (void)frame_top;
+ (void)size;
+ data_root<object> executing_quot(owner->owner_quot(), this);
+ data_root<object> executing(owner->owner, this);
+ data_root<object> scan(owner->scan(this, addr), this);
-stack_frame *factor_vm::innermost_stack_frame(callstack *stack)
-{
- stack_frame *top = stack->top();
- stack_frame *bottom = stack->bottom();
- stack_frame *frame = bottom - 1;
+ frames.add(executing.value());
+ frames.add(executing_quot.value());
+ frames.add(scan.value());
+ };
+ iterate_callstack_object(callstack.untagged(), stack_frame_accumulator);
- while(frame >= top && frame_successor(frame) >= top)
- frame = frame_successor(frame);
+ frames.trim();
- return frame;
+ ctx->replace(frames.elements.value());
}
-/* Some primitives implementing a limited form of callstack mutation.
-Used by the single stepper. */
-void factor_vm::primitive_innermost_stack_frame_executing()
-{
- stack_frame *frame = innermost_stack_frame(untag_check<callstack>(ctx->pop()));
- ctx->push(frame_executing_quot(frame));
+// Some primitives implementing a limited form of callstack mutation.
+// Used by the single stepper.
+void factor_vm::primitive_innermost_stack_frame_executing() {
+ callstack* stack = untag_check<callstack>(ctx->peek());
+ void* frame = stack->top();
+ cell addr = *(cell*)frame;
+ ctx->replace(code->code_block_for_address(addr)->owner_quot());
}
-void factor_vm::primitive_innermost_stack_frame_scan()
-{
- stack_frame *frame = innermost_stack_frame(untag_check<callstack>(ctx->pop()));
- ctx->push(frame_scan(frame));
+void factor_vm::primitive_innermost_stack_frame_scan() {
+ callstack* stack = untag_check<callstack>(ctx->peek());
+ void* frame = stack->top();
+ cell addr = *(cell*)frame;
+ ctx->replace(code->code_block_for_address(addr)->scan(this, addr));
}
-void factor_vm::primitive_set_innermost_stack_frame_quot()
-{
- data_root<callstack> callstack(ctx->pop(),this);
- data_root<quotation> quot(ctx->pop(),this);
+// Allocates memory (jit_compile_quotation)
+void factor_vm::primitive_set_innermost_stack_frame_quotation() {
+ data_root<callstack> stack(ctx->pop(), this);
+ data_root<quotation> quot(ctx->pop(), this);
- callstack.untag_check(this);
- quot.untag_check(this);
+ check_tagged(stack);
+ check_tagged(quot);
- jit_compile_quot(quot.value(),true);
+ jit_compile_quotation(quot.value(), true);
- stack_frame *inner = innermost_stack_frame(callstack.untagged());
- cell offset = (char *)FRAME_RETURN_ADDRESS(inner,this) - (char *)inner->entry_point;
- inner->entry_point = quot->entry_point;
- FRAME_RETURN_ADDRESS(inner,this) = (char *)quot->entry_point + offset;
+ void* inner = stack->top();
+ cell addr = *(cell*)inner;
+ code_block* block = code->code_block_for_address(addr);
+ cell offset = block->offset(addr);
+ *(cell*)inner = quot->entry_point + offset;
}
-void factor_vm::primitive_callstack_bounds()
-{
- ctx->push(allot_alien((void*)ctx->callstack_seg->start));
- ctx->push(allot_alien((void*)ctx->callstack_seg->end));
+// Allocates memory (allot_alien)
+void factor_vm::primitive_callstack_bounds() {
+ ctx->push(allot_alien(ctx->callstack_seg->start));
+ ctx->push(allot_alien(ctx->callstack_seg->end));
}
}
projects / factor.git / blobdiff