various vm things

This commit is contained in:
Judah Caruso 2025-07-13 08:56:58 -06:00
parent c143b4d789
commit 7333b32418
3 changed files with 49 additions and 39 deletions

View file

@ -36,19 +36,9 @@ Interp_Value :: struct {
} }
} }
init :: (i: *Interp, allocator: Allocator) {
value_nil = make_interp_value(i, .nil);
value_true = make_interp_value(i, .bool);
value_true.b = true;
value_false = make_interp_value(i, .bool);
value_false.b = false;
i.global = make_scope(null,, allocator = allocator);
}
interp_program :: (i: *Interp) { interp_program :: (i: *Interp) {
try_lazy_init(i);
for i.toplevel { for i.toplevel {
interp_statement(i, it, i.global); interp_statement(i, it, i.global);
} }
@ -309,7 +299,6 @@ find_symbol :: (scope: *Interp_Scope, symbol: string, all_the_way_up := true) ->
make_scope :: (parent: *Interp_Scope) -> *Interp_Scope { make_scope :: (parent: *Interp_Scope) -> *Interp_Scope {
scope := mem.request_memory(Interp_Scope); scope := mem.request_memory(Interp_Scope);
scope.parent = parent; scope.parent = parent;
kv.init(*scope.bindings, context.allocator);
return scope; return scope;
} }
@ -318,3 +307,15 @@ make_interp_value :: (i: *Interp, kind: Interp_Value.Kind) -> *Interp_Value {
value.kind = kind; value.kind = kind;
return value; return value;
} }
try_lazy_init :: (i: *Interp) {
value_nil = make_interp_value(i, .nil);
value_true = make_interp_value(i, .bool);
value_true.b = true;
value_false = make_interp_value(i, .bool);
value_false.b = false;
i.global = make_scope(null);
}

View file

@ -18,8 +18,6 @@ strings :: #import "String"; // @future
#run { #run {
parser: Parser; parser: Parser;
init(*parser, context.allocator);
ok := parse_string(*parser, #string END ok := parse_string(*parser, #string END
fn add(l, r) do return l + r end fn add(l, r) do return l + r end
fn sub(l, r) do return l - r end fn sub(l, r) do return l - r end
@ -87,7 +85,6 @@ strings :: #import "String"; // @future
interp: Interp; interp: Interp;
interp.toplevel = parser.toplevel; interp.toplevel = parser.toplevel;
init(*interp, context.allocator);
interp_program(*interp); interp_program(*interp);
} }

View file

@ -208,6 +208,14 @@ Node_Type :: struct {
array; array;
procedure; procedure;
} }
init :: (n: *Node_Type, allocator: Allocator) {
if n.type_kind == {
case .procedure;
mem.lazy_set_allocator(*n.procedure_arguments, allocator);
mem.lazy_set_allocator(*n.procedure_returns, allocator);
}
}
} }
Node_Procedure :: struct { Node_Procedure :: struct {
@ -225,6 +233,11 @@ Node_Procedure :: struct {
Flag :: enum_flags { Flag :: enum_flags {
must_inline; must_inline;
} }
init :: (n: *Node_Procedure, allocator: Allocator) {
mem.lazy_set_allocator(*n.arguments, allocator);
mem.lazy_set_allocator(*n.returns, allocator);
}
} }
Parameter :: struct { Parameter :: struct {
@ -254,6 +267,11 @@ Node_Procedure_Call :: struct {
call_expr: *Node; call_expr: *Node;
named_arguments: kv.Kv(*Node, *Node); named_arguments: kv.Kv(*Node, *Node);
all_arguments: [..]*Node; all_arguments: [..]*Node;
init :: (n: *Node_Procedure_Call, allocator: Allocator) {
mem.lazy_set_allocator(*n.all_arguments, allocator);
mem.lazy_set_allocator(*n.named_arguments, allocator);
}
} }
Node_Block :: struct { Node_Block :: struct {
@ -261,6 +279,10 @@ Node_Block :: struct {
n.kind = .block; n.kind = .block;
body: [..]*Node; body: [..]*Node;
init :: (n: *Node_Block, allocator: Allocator) {
mem.lazy_set_allocator(*n.body, allocator);
}
} }
Node_Return :: struct { Node_Return :: struct {
@ -268,6 +290,10 @@ Node_Return :: struct {
n.kind = .return_; n.kind = .return_;
values: [..]*Node; values: [..]*Node;
init :: (n: *Node_Return, allocator: Allocator) {
mem.lazy_set_allocator(*n.values, allocator);
}
} }
Parser :: struct { Parser :: struct {
@ -280,12 +306,9 @@ Parser :: struct {
offset: int; offset: int;
} }
init :: (p: *Parser, allocator: Allocator) {
p.allocator = allocator;
p.toplevel.allocator = allocator;
}
parse_string :: (p: *Parser, source: string) -> bool { parse_string :: (p: *Parser, source: string) -> bool {
try_lazy_init(p);
p.source = source; p.source = source;
p.offset = 0; p.offset = 0;
@ -753,17 +776,8 @@ parse_expression_base :: (p: *Parser) -> *Node {
make_node :: (p: *Parser, $T: Type) -> *T { make_node :: (p: *Parser, $T: Type) -> *T {
node := mem.request_memory(T,, allocator = p.allocator); node := mem.request_memory(T,, allocator = p.allocator);
#if T == { // nodes that require initialization #if #exists(T.init) {
case Node_Block; T.init(node, p.allocator);
array.init(*node.body, p.allocator);
case Node_Return;
array.init(*node.values, p.allocator);
case Node_Procedure_Call;
array.init(*node.all_arguments, p.allocator);
kv.init(*node.named_arguments, p.allocator);
case Node_Procedure;
array.init(*node.arguments, p.allocator);
array.init(*node.returns, p.allocator);
} }
return node; return node;
@ -772,13 +786,7 @@ make_node :: (p: *Parser, $T: Type) -> *T {
make_node :: (p: *Parser, $type_kind: Node_Type.Type_Kind) -> *Node_Type { make_node :: (p: *Parser, $type_kind: Node_Type.Type_Kind) -> *Node_Type {
type := mem.request_memory(Node_Type,, allocator = p.allocator); type := mem.request_memory(Node_Type,, allocator = p.allocator);
type.type_kind = type_kind; type.type_kind = type_kind;
Node_Type.init(type, p.allocator);
#if type_kind == {
case .procedure;
array.init(*type.procedure_arguments, p.allocator);
array.init(*type.procedure_returns, p.allocator);
}
return type; return type;
} }
@ -948,3 +956,7 @@ expect_token :: (p: *Parser, kinds: ..Token.Kind) -> Token, bool {
return t, false; return t, false;
} }
try_lazy_init :: (p: *Parser) {
mem.lazy_set_allocator(p);
mem.lazy_set_allocator(*p.toplevel);
}