fix(tvix/eval): instantiate *new* closures from blueprints each time
The previous closure refactoring introduced a bug in which the same closure object would get mutated constantly for each instance of a closure, which is incorrect behaviour. This commit instead introduces an explicit new Value variant for the internal "blueprint" that the compiler generates (essentially just the lambda) and uses this variant to construct the closure at runtime. If the blueprint ever leaks out to a user somehow that is a critical bug and tvix-eval will panic. As a ~treat~ test for this, the fibonacci function is being used as it is a self-recursive closure (i.e. different instantiations of the same "blueprint") getting called with different values and it's good to have it around. Change-Id: I485de675e9bb0c599ed7d5dc0f001eb34ab4c15f Reviewed-on: https://cl.tvl.fyi/c/depot/+/6323 Tested-by: BuildkiteCI Reviewed-by: sterni <sternenseemann@systemli.org>
This commit is contained in:
parent
ccfb971dc5
commit
776120de05
6 changed files with 33 additions and 17 deletions
|
@ -805,16 +805,17 @@ impl Compiler {
|
||||||
// If the function is not a closure, just emit it directly and
|
// If the function is not a closure, just emit it directly and
|
||||||
// move on.
|
// move on.
|
||||||
if compiled.lambda.upvalue_count == 0 {
|
if compiled.lambda.upvalue_count == 0 {
|
||||||
self.emit_constant(Value::Closure(Closure::new(compiled.lambda)));
|
self.emit_constant(Value::Closure(Closure::new(Rc::new(compiled.lambda))));
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
// If the function is a closure, we need to emit the variable
|
// If the function is a closure, we need to emit the variable
|
||||||
// number of operands that allow the runtime to close over the
|
// number of operands that allow the runtime to close over the
|
||||||
// upvalues.
|
// upvalues and leave a blueprint in the constant index from
|
||||||
|
// which the runtime closure can be constructed.
|
||||||
let closure_idx = self
|
let closure_idx = self
|
||||||
.chunk()
|
.chunk()
|
||||||
.push_constant(Value::Closure(Closure::new(compiled.lambda)));
|
.push_constant(Value::Blueprint(Rc::new(compiled.lambda)));
|
||||||
|
|
||||||
self.chunk().push_op(OpCode::OpClosure(closure_idx));
|
self.chunk().push_op(OpCode::OpClosure(closure_idx));
|
||||||
for upvalue in compiled.scope.upvalues {
|
for upvalue in compiled.scope.upvalues {
|
||||||
|
|
1
tvix/eval/src/tests/tvix_tests/eval-okay-fib.exp
Normal file
1
tvix/eval/src/tests/tvix_tests/eval-okay-fib.exp
Normal file
|
@ -0,0 +1 @@
|
||||||
|
89
|
7
tvix/eval/src/tests/tvix_tests/eval-okay-fib.nix
Normal file
7
tvix/eval/src/tests/tvix_tests/eval-okay-fib.nix
Normal file
|
@ -0,0 +1,7 @@
|
||||||
|
let
|
||||||
|
fib' = i: n: m: if i == 0
|
||||||
|
then n
|
||||||
|
else fib' (i - 1) m (n + m);
|
||||||
|
|
||||||
|
fib = n: fib' n 1 1;
|
||||||
|
in fib 10
|
|
@ -29,7 +29,7 @@ impl Lambda {
|
||||||
|
|
||||||
#[derive(Clone, Debug)]
|
#[derive(Clone, Debug)]
|
||||||
pub struct InnerClosure {
|
pub struct InnerClosure {
|
||||||
pub lambda: Lambda,
|
pub lambda: Rc<Lambda>,
|
||||||
pub upvalues: Vec<Value>,
|
pub upvalues: Vec<Value>,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -38,7 +38,7 @@ pub struct InnerClosure {
|
||||||
pub struct Closure(Rc<RefCell<InnerClosure>>);
|
pub struct Closure(Rc<RefCell<InnerClosure>>);
|
||||||
|
|
||||||
impl Closure {
|
impl Closure {
|
||||||
pub fn new(lambda: Lambda) -> Self {
|
pub fn new(lambda: Rc<Lambda>) -> Self {
|
||||||
Closure(Rc::new(RefCell::new(InnerClosure {
|
Closure(Rc::new(RefCell::new(InnerClosure {
|
||||||
upvalues: Vec::with_capacity(lambda.upvalue_count),
|
upvalues: Vec::with_capacity(lambda.upvalue_count),
|
||||||
lambda,
|
lambda,
|
||||||
|
|
|
@ -35,6 +35,7 @@ pub enum Value {
|
||||||
AttrPath(Vec<NixString>),
|
AttrPath(Vec<NixString>),
|
||||||
AttrNotFound,
|
AttrNotFound,
|
||||||
DynamicUpvalueMissing(NixString),
|
DynamicUpvalueMissing(NixString),
|
||||||
|
Blueprint(Rc<Lambda>),
|
||||||
}
|
}
|
||||||
|
|
||||||
impl Value {
|
impl Value {
|
||||||
|
@ -55,9 +56,10 @@ impl Value {
|
||||||
Value::Closure(_) | Value::Builtin(_) => "lambda",
|
Value::Closure(_) | Value::Builtin(_) => "lambda",
|
||||||
|
|
||||||
// Internal types
|
// Internal types
|
||||||
Value::AttrPath(_) | Value::AttrNotFound | Value::DynamicUpvalueMissing(_) => {
|
Value::AttrPath(_)
|
||||||
"internal"
|
| Value::AttrNotFound
|
||||||
}
|
| Value::DynamicUpvalueMissing(_)
|
||||||
|
| Value::Blueprint(_) => "internal",
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -166,6 +168,7 @@ impl Display for Value {
|
||||||
// internal types
|
// internal types
|
||||||
Value::AttrPath(path) => write!(f, "internal[attrpath({})]", path.len()),
|
Value::AttrPath(path) => write!(f, "internal[attrpath({})]", path.len()),
|
||||||
Value::AttrNotFound => f.write_str("internal[not found]"),
|
Value::AttrNotFound => f.write_str("internal[not found]"),
|
||||||
|
Value::Blueprint(_) => f.write_str("internal[blueprint]"),
|
||||||
Value::DynamicUpvalueMissing(name) => {
|
Value::DynamicUpvalueMissing(name) => {
|
||||||
write!(f, "internal[no_dyn_upvalue({name})]")
|
write!(f, "internal[no_dyn_upvalue({name})]")
|
||||||
}
|
}
|
||||||
|
|
|
@ -385,15 +385,19 @@ impl VM {
|
||||||
}
|
}
|
||||||
|
|
||||||
OpCode::OpClosure(idx) => {
|
OpCode::OpClosure(idx) => {
|
||||||
let value = self.chunk().constant(idx).clone();
|
let blueprint = match self.chunk().constant(idx) {
|
||||||
self.push(value.clone());
|
Value::Blueprint(lambda) => lambda.clone(),
|
||||||
|
_ => panic!("compiler bug: non-blueprint in blueprint slot"),
|
||||||
|
};
|
||||||
|
|
||||||
// This refers to the same Rc, and from this point
|
let closure = Closure::new(blueprint);
|
||||||
// on internally mutates the closure objects
|
self.push(Value::Closure(closure.clone()));
|
||||||
// upvalues. The closure is already in its stack
|
|
||||||
// slot, which means that it can capture itself as
|
// From this point on we internally mutate the
|
||||||
// an upvalue for self-recursion.
|
// closure object's upvalues. The closure is
|
||||||
let closure = value.to_closure()?;
|
// already in its stack slot, which means that it
|
||||||
|
// can capture itself as an upvalue for
|
||||||
|
// self-recursion.
|
||||||
|
|
||||||
debug_assert!(
|
debug_assert!(
|
||||||
closure.upvalue_count() > 0,
|
closure.upvalue_count() > 0,
|
||||||
|
@ -536,6 +540,6 @@ pub fn run_lambda(lambda: Lambda) -> EvalResult<Value> {
|
||||||
with_stack: vec![],
|
with_stack: vec![],
|
||||||
};
|
};
|
||||||
|
|
||||||
vm.call(Closure::new(lambda), 0);
|
vm.call(Closure::new(Rc::new(lambda)), 0);
|
||||||
vm.run()
|
vm.run()
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in a new issue