difftreelog
feat simplify Thunk creation with closure syntax
in: master
9 files changed
crates/jrsonnet-evaluator/src/arr/spec.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/arr/spec.rs
+++ b/crates/jrsonnet-evaluator/src/arr/spec.rs
@@ -7,7 +7,7 @@
use super::ArrValue;
use crate::{
error::ErrorKind::InfiniteRecursionDetected, evaluate, function::FuncVal, typed::Typed,
- val::ThunkValue, Context, Error, ObjValue, Result, Thunk, Val,
+ Context, Error, ObjValue, Result, Thunk, Val,
};
pub trait ArrayLike: Any + Trace + Debug {
@@ -182,23 +182,6 @@
Ok(Some(new_value))
}
fn get_lazy(&self, index: usize) -> Option<Thunk<Val>> {
- #[derive(Trace)]
- struct ArrayElement {
- arr_thunk: ExprArray,
- index: usize,
- }
-
- impl ThunkValue for ArrayElement {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- self.arr_thunk
- .get(self.index)
- .transpose()
- .expect("index checked")
- }
- }
-
if index >= self.len() {
return None;
}
@@ -208,9 +191,9 @@
ArrayThunk::Waiting(_) | ArrayThunk::Pending => {}
};
- Some(Thunk::new(ArrayElement {
- arr_thunk: self.clone(),
- index,
+ let arr_thunk = self.clone();
+ Some(Thunk!(move || {
+ arr_thunk.get(index).transpose().expect("index checked")
}))
}
fn get_cheap(&self, _index: usize) -> Option<Val> {
@@ -492,23 +475,6 @@
Ok(Some(new_value))
}
fn get_lazy(&self, index: usize) -> Option<Thunk<Val>> {
- #[derive(Trace)]
- struct ArrayElement<const WITH_INDEX: bool> {
- arr_thunk: MappedArray<WITH_INDEX>,
- index: usize,
- }
-
- impl<const WITH_INDEX: bool> ThunkValue for ArrayElement<WITH_INDEX> {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- self.arr_thunk
- .get(self.index)
- .transpose()
- .expect("index checked")
- }
- }
-
if index >= self.len() {
return None;
}
@@ -518,9 +484,9 @@
ArrayThunk::Waiting(()) | ArrayThunk::Pending => {}
};
- Some(Thunk::new(ArrayElement {
- arr_thunk: self.clone(),
- index,
+ let arr_thunk = self.clone();
+ Some(Thunk!(move || {
+ arr_thunk.get(index).transpose().expect("index checked")
}))
}
crates/jrsonnet-evaluator/src/evaluate/destructure.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/evaluate/destructure.rs
+++ b/crates/jrsonnet-evaluator/src/evaluate/destructure.rs
@@ -1,13 +1,11 @@
-use jrsonnet_gcmodule::Trace;
use jrsonnet_interner::IStr;
-use jrsonnet_parser::{BindSpec, Destruct, LocExpr, ParamsDesc};
+use jrsonnet_parser::{BindSpec, Destruct};
use crate::{
bail,
error::{ErrorKind::*, Result},
evaluate, evaluate_method, evaluate_named,
gc::GcHashMap,
- val::ThunkValue,
Context, Pending, Thunk, Val,
};
@@ -31,65 +29,34 @@
#[cfg(feature = "exp-destruct")]
Destruct::Array { start, rest, end } => {
use jrsonnet_parser::DestructRest;
-
- use crate::arr::ArrValue;
-
- #[derive(Trace)]
- struct DataThunk {
- parent: Thunk<Val>,
- min_len: usize,
- has_rest: bool,
- }
- impl ThunkValue for DataThunk {
- type Output = ArrValue;
- fn get(self: Box<Self>) -> Result<Self::Output> {
- let v = self.parent.evaluate()?;
- let Val::Arr(arr) = v else {
- bail!("expected array");
- };
- if !self.has_rest {
- if arr.len() != self.min_len {
- bail!("expected {} elements, got {}", self.min_len, arr.len())
- }
- } else if arr.len() < self.min_len {
- bail!(
- "expected at least {} elements, but array was only {}",
- self.min_len,
- arr.len()
- )
+ let min_len = start.len() + end.len();
+ let has_rest = rest.is_some();
+ let full = Thunk!(move || {
+ let v = parent.evaluate()?;
+ let Val::Arr(arr) = v else {
+ bail!("expected array");
+ };
+ if !has_rest {
+ if arr.len() != min_len {
+ bail!("expected {} elements, got {}", min_len, arr.len())
}
- Ok(arr)
+ } else if arr.len() < min_len {
+ bail!(
+ "expected at least {} elements, but array was only {}",
+ min_len,
+ arr.len()
+ )
}
- }
-
- let full = Thunk::new(DataThunk {
- min_len: start.len() + end.len(),
- has_rest: rest.is_some(),
- parent,
+ Ok(arr)
});
{
- #[derive(Trace)]
- struct BaseThunk {
- full: Thunk<ArrValue>,
- index: usize,
- }
- impl ThunkValue for BaseThunk {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- let full = self.full.evaluate()?;
- Ok(full.get(self.index)?.expect("length is checked"))
- }
- }
for (i, d) in start.iter().enumerate() {
+ let full = full.clone();
destruct(
d,
- Thunk::new(BaseThunk {
- full: full.clone(),
- index: i,
- }),
+ Thunk!(move || Ok(full.evaluate()?.get(i)?.expect("length is checked"))),
fctx.clone(),
new_bindings,
)?;
@@ -98,32 +65,19 @@
match rest {
Some(DestructRest::Keep(v)) => {
- #[derive(Trace)]
- struct RestThunk {
- full: Thunk<ArrValue>,
- start: usize,
- end: usize,
- }
- impl ThunkValue for RestThunk {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- let full = self.full.evaluate()?;
- let to = full.len() - self.end;
+ let start = start.len();
+ let end = end.len();
+ let full = full.clone();
+ destruct(
+ &Destruct::Full(v.clone()),
+ Thunk!(move || {
+ let full = full.evaluate()?;
+ let to = full.len() - end;
Ok(Val::Arr(full.slice(
- Some(self.start as i32),
+ Some(start as i32),
Some(to as i32),
None,
)))
- }
- }
-
- destruct(
- &Destruct::Full(v.clone()),
- Thunk::new(RestThunk {
- full: full.clone(),
- start: start.len(),
- end: end.len(),
}),
fctx.clone(),
new_bindings,
@@ -133,29 +87,14 @@
}
{
- #[derive(Trace)]
- struct EndThunk {
- full: Thunk<ArrValue>,
- index: usize,
- end: usize,
- }
- impl ThunkValue for EndThunk {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- let full = self.full.evaluate()?;
- Ok(full
- .get(full.len() - self.end + self.index)?
- .expect("length is checked"))
- }
- }
for (i, d) in end.iter().enumerate() {
+ let full = full.clone();
+ let end = end.len();
destruct(
d,
- Thunk::new(EndThunk {
- full: full.clone(),
- index: i,
- end: end.len(),
+ Thunk!(move || {
+ let full = full.evaluate()?;
+ Ok(full.get(full.len() - end + i)?.expect("length is checked"))
}),
fctx.clone(),
new_bindings,
@@ -165,71 +104,46 @@
}
#[cfg(feature = "exp-destruct")]
Destruct::Object { fields, rest } => {
- use crate::obj::ObjValue;
-
- #[derive(Trace)]
- struct DataThunk {
- parent: Thunk<Val>,
- field_names: Vec<(IStr, bool)>,
- has_rest: bool,
- }
- impl ThunkValue for DataThunk {
- type Output = ObjValue;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- let v = self.parent.evaluate()?;
- let Val::Obj(obj) = v else {
- bail!("expected object");
- };
- for (field, has_default) in &self.field_names {
- if !has_default && !obj.has_field_ex(field.clone(), true) {
- bail!("missing field: {field}");
- }
- }
- if !self.has_rest {
- let len = obj.len();
- if len > self.field_names.len() {
- bail!("too many fields, and rest not found");
- }
- }
- Ok(obj)
- }
- }
let field_names: Vec<_> = fields
.iter()
.map(|f| (f.0.clone(), f.2.is_some()))
.collect();
- let full = Thunk::new(DataThunk {
- parent,
- field_names,
- has_rest: rest.is_some(),
+ let has_rest = rest.is_some();
+ let full = Thunk!(move || {
+ let v = parent.evaluate()?;
+ let Val::Obj(obj) = v else {
+ bail!("expected object");
+ };
+ for (field, has_default) in &field_names {
+ if !has_default && !obj.has_field_ex(field.clone(), true) {
+ bail!("missing field: {field}");
+ }
+ }
+ if !has_rest {
+ let len = obj.len();
+ if len > field_names.len() {
+ bail!("too many fields, and rest not found");
+ }
+ }
+ Ok(obj)
});
for (field, d, default) in fields {
- #[derive(Trace)]
- struct FieldThunk {
- full: Thunk<ObjValue>,
- field: IStr,
- default: Option<(Pending<Context>, LocExpr)>,
- }
- impl ThunkValue for FieldThunk {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- let full = self.full.evaluate()?;
- if let Some(field) = full.get(self.field)? {
+ let default = default.clone().map(|e| (fctx.clone(), e));
+ let value = {
+ let field = field.clone();
+ let full = full.clone();
+ Thunk!(move || {
+ let full = full.evaluate()?;
+ if let Some(field) = full.get(field)? {
Ok(field)
} else {
- let (fctx, expr) = self.default.as_ref().expect("shape is checked");
+ let (fctx, expr) = default.as_ref().expect("shape is checked");
Ok(evaluate(fctx.clone().unwrap(), expr)?)
}
- }
- }
- let value = Thunk::new(FieldThunk {
- full: full.clone(),
- field: field.clone(),
- default: default.clone().map(|e| (fctx.clone(), e)),
- });
+ })
+ };
+
if let Some(d) = d {
destruct(d, value, fctx.clone(), new_bindings)?;
} else {
@@ -253,26 +167,15 @@
) -> Result<()> {
match d {
BindSpec::Field { into, value } => {
- #[derive(Trace)]
- struct EvaluateThunkValue {
- name: Option<IStr>,
- fctx: Pending<Context>,
- expr: LocExpr,
- }
- impl ThunkValue for EvaluateThunkValue {
- type Output = Val;
- fn get(self: Box<Self>) -> Result<Self::Output> {
- self.name.map_or_else(
- || evaluate(self.fctx.unwrap(), &self.expr),
- |name| evaluate_named(self.fctx.unwrap(), &self.expr, name),
- )
- }
- }
- let data = Thunk::new(EvaluateThunkValue {
- name: into.name(),
- fctx: fctx.clone(),
- expr: value.clone(),
- });
+ let name = into.name();
+ let value = value.clone();
+ let data = {
+ let fctx = fctx.clone();
+ Thunk!(move || name.map_or_else(
+ || evaluate(fctx.unwrap(), &value),
+ |name| evaluate_named(fctx.unwrap(), &value, name),
+ ))
+ };
destruct(into, data, fctx, new_bindings)?;
}
BindSpec::Function {
@@ -280,37 +183,15 @@
params,
value,
} => {
- #[derive(Trace)]
- struct MethodThunk {
- fctx: Pending<Context>,
- name: IStr,
- params: ParamsDesc,
- value: LocExpr,
- }
- impl ThunkValue for MethodThunk {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- Ok(evaluate_method(
- self.fctx.unwrap(),
- self.name,
- self.params,
- self.value,
- ))
- }
- }
-
- let old = new_bindings.insert(
- name.clone(),
- Thunk::new(MethodThunk {
- fctx,
- name: name.clone(),
- params: params.clone(),
- value: value.clone(),
- }),
- );
+ let params = params.clone();
+ let name = name.clone();
+ let value = value.clone();
+ let old = new_bindings.insert(name.clone(), {
+ let name = name.clone();
+ Thunk!(move || Ok(evaluate_method(fctx.unwrap(), name, params, value)))
+ });
if old.is_some() {
- bail!(DuplicateLocalVar(name.clone()))
+ bail!(DuplicateLocalVar(name))
}
}
}
crates/jrsonnet-evaluator/src/evaluate/mod.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/evaluate/mod.rs
+++ b/crates/jrsonnet-evaluator/src/evaluate/mod.rs
@@ -18,7 +18,7 @@
function::{CallLocation, FuncDesc, FuncVal},
in_frame,
typed::Typed,
- val::{CachedUnbound, IndexableVal, NumValue, StrValue, Thunk, ThunkValue},
+ val::{CachedUnbound, IndexableVal, NumValue, StrValue, Thunk},
Context, Error, GcHashMap, ObjValue, ObjValueBuilder, ObjectAssertion, Pending, Result,
ResultExt, Unbound, Val,
};
@@ -139,29 +139,14 @@
#[cfg(feature = "exp-preserve-order")]
false,
) {
- #[derive(Trace)]
- struct ObjectFieldThunk {
- obj: ObjValue,
- field: IStr,
- }
- impl ThunkValue for ObjectFieldThunk {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- self.obj.get(self.field).transpose().expect(
- "field exists, as field name was obtained from object.fields()",
- )
- }
- }
-
let fctx = Pending::new();
let mut new_bindings = GcHashMap::with_capacity(var.capacity_hint());
+ let obj = obj.clone();
let value = Thunk::evaluated(Val::Arr(ArrValue::lazy(vec![
Thunk::evaluated(Val::string(field.clone())),
- Thunk::new(ObjectFieldThunk {
- field: field.clone(),
- obj: obj.clone(),
- }),
+ Thunk!(move || obj.get(field).transpose().expect(
+ "field exists, as field name was obtained from object.fields()",
+ )),
])));
destruct(var, value, fctx.clone(), &mut new_bindings)?;
let ctx = ctx
@@ -609,21 +594,8 @@
if items.is_empty() {
Val::Arr(ArrValue::empty())
} else if items.len() == 1 {
- #[derive(Trace)]
- struct ArrayElement {
- ctx: Context,
- item: LocExpr,
- }
- impl ThunkValue for ArrayElement {
- type Output = Val;
- fn get(self: Box<Self>) -> Result<Val> {
- evaluate(self.ctx, &self.item)
- }
- }
- Val::Arr(ArrValue::lazy(vec![Thunk::new(ArrayElement {
- ctx,
- item: items[0].clone(),
- })]))
+ let item = items[0].clone();
+ Val::Arr(ArrValue::lazy(vec![Thunk!(move || evaluate(ctx, &item))]))
} else {
Val::Arr(ArrValue::expr(ctx, items.iter().cloned()))
}
@@ -631,21 +603,8 @@
ArrComp(expr, comp_specs) => {
let mut out = Vec::new();
evaluate_comp(ctx, comp_specs, &mut |ctx| {
- #[derive(Trace)]
- struct EvaluateThunk {
- ctx: Context,
- expr: LocExpr,
- }
- impl ThunkValue for EvaluateThunk {
- type Output = Val;
- fn get(self: Box<Self>) -> Result<Val> {
- evaluate(self.ctx, &self.expr)
- }
- }
- out.push(Thunk::new(EvaluateThunk {
- ctx,
- expr: expr.clone(),
- }));
+ let expr = expr.clone();
+ out.push(Thunk!(move || evaluate(ctx, &expr)));
Ok(())
})?;
Val::Arr(ArrValue::lazy(out))
crates/jrsonnet-evaluator/src/function/parse.rsdiffbeforeafterboth1use std::mem::replace;23use jrsonnet_gcmodule::Trace;4use jrsonnet_interner::IStr;5use jrsonnet_parser::{LocExpr, ParamsDesc};67use super::{arglike::ArgsLike, builtin::BuiltinParam};8use crate::{9 bail,10 destructure::destruct,11 error::{ErrorKind::*, Result},12 evaluate_named,13 function::builtin::ParamDefault,14 gc::GcHashMap,15 val::ThunkValue,16 Context, Pending, Thunk, Val,17};1819#[derive(Trace)]20struct EvaluateNamedThunk {21 ctx: Pending<Context>,22 name: IStr,23 value: LocExpr,24}2526impl ThunkValue for EvaluateNamedThunk {27 type Output = Val;28 fn get(self: Box<Self>) -> Result<Val> {29 evaluate_named(self.ctx.unwrap(), &self.value, self.name)30 }31}3233/// Creates correct [context](Context) for function body evaluation returning error on invalid call.34///35/// ## Parameters36/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)37/// * `body_ctx`: used for default parameter values' execution and for body execution (if set)38/// * `params`: function parameters' definition39/// * `args`: passed function arguments40/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily41pub fn parse_function_call(42 ctx: Context,43 body_ctx: Context,44 params: &ParamsDesc,45 args: &dyn ArgsLike,46 tailstrict: bool,47) -> Result<Context> {48 let mut passed_args =49 GcHashMap::with_capacity(params.iter().map(|p| p.0.capacity_hint()).sum());50 if args.unnamed_len() > params.len() {51 bail!(TooManyArgsFunctionHas(52 params.len(),53 params54 .iter()55 .map(|p| (p.0.name(), ParamDefault::exists(p.1.is_some())))56 .collect()57 ))58 }5960 let mut filled_named = 0;61 let mut filled_positionals = 0;6263 args.unnamed_iter(ctx.clone(), tailstrict, &mut |id, arg| {64 let name = params[id].0.clone();65 destruct(66 &name,67 arg,68 Pending::new_filled(ctx.clone()),69 &mut passed_args,70 )?;71 filled_positionals += 1;72 Ok(())73 })?;7475 args.named_iter(ctx, tailstrict, &mut |name, value| {76 // FIXME: O(n) for arg existence check77 if !params.iter().any(|p| p.0.name().as_ref() == Some(name)) {78 bail!(UnknownFunctionParameter((name as &str).to_owned()));79 }80 if passed_args.insert(name.clone(), value).is_some() {81 bail!(BindingParameterASecondTime(name.clone()));82 }83 filled_named += 1;84 Ok(())85 })?;8687 if filled_named + filled_positionals < params.len() {88 // Some args are unset, but maybe we have defaults for them89 // Default values should be created in newly created context90 let fctx = Context::new_future();91 let mut defaults = GcHashMap::with_capacity(92 params.iter().map(|p| p.0.capacity_hint()).sum::<usize>()93 - filled_named - filled_positionals,94 );9596 for (idx, param) in params.iter().enumerate().filter(|p| p.1 .1.is_some()) {97 if let Some(name) = param.0.name() {98 if passed_args.contains_key(&name) {99 continue;100 }101 } else if idx < filled_positionals {102 continue;103 }104105 destruct(106 ¶m.0,107 Thunk::new(EvaluateNamedThunk {108 ctx: fctx.clone(),109 name: param.0.name().unwrap_or_else(|| "<destruct>".into()),110 value: param.1.clone().expect("default exists"),111 }),112 fctx.clone(),113 &mut defaults,114 )?;115 if param.0.name().is_some() {116 filled_named += 1;117 } else {118 filled_positionals += 1;119 }120 }121122 // Some args still weren't filled123 if filled_named + filled_positionals != params.len() {124 for param in params.iter().skip(args.unnamed_len()) {125 let mut found = false;126 args.named_names(&mut |name| {127 if Some(name) == param.0.name().as_ref() {128 found = true;129 }130 });131 if !found {132 bail!(FunctionParameterNotBoundInCall(133 param.0.clone().name(),134 params135 .iter()136 .map(|p| (p.0.name(), ParamDefault::exists(p.1.is_some())))137 .collect()138 ));139 }140 }141 unreachable!();142 }143144 Ok(body_ctx145 .extend(passed_args, None, None, None)146 .extend(defaults, None, None, None)147 .into_future(fctx))148 } else {149 let body_ctx = body_ctx.extend(passed_args, None, None, None);150 Ok(body_ctx)151 }152}153154/// You shouldn't probally use this function, use `jrsonnet_macros::builtin` instead155///156/// ## Parameters157/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)158/// * `params`: function parameters' definition159/// * `args`: passed function arguments160/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily161pub fn parse_builtin_call(162 ctx: Context,163 params: &[BuiltinParam],164 args: &dyn ArgsLike,165 tailstrict: bool,166) -> Result<Vec<Option<Thunk<Val>>>> {167 let mut passed_args: Vec<Option<Thunk<Val>>> = vec![None; params.len()];168 if args.unnamed_len() > params.len() {169 bail!(TooManyArgsFunctionHas(170 params.len(),171 params172 .iter()173 .map(|p| (p.name().as_str().map(IStr::from), p.default()))174 .collect()175 ))176 }177178 let mut filled_args = 0;179180 args.unnamed_iter(ctx.clone(), tailstrict, &mut |id, arg| {181 passed_args[id] = Some(arg);182 filled_args += 1;183 Ok(())184 })?;185186 args.named_iter(ctx, tailstrict, &mut |name, arg| {187 // FIXME: O(n) for arg existence check188 let id = params189 .iter()190 .position(|p| p.name() == name)191 .ok_or_else(|| UnknownFunctionParameter((name as &str).to_owned()))?;192 if replace(&mut passed_args[id], Some(arg)).is_some() {193 bail!(BindingParameterASecondTime(name.clone()));194 }195 filled_args += 1;196 Ok(())197 })?;198199 if filled_args < params.len() {200 for (id, _) in params.iter().enumerate().filter(|(_, p)| p.has_default()) {201 if passed_args[id].is_some() {202 continue;203 }204 filled_args += 1;205 }206207 // Some args still wasn't filled208 if filled_args != params.len() {209 for param in params.iter().skip(args.unnamed_len()) {210 let mut found = false;211 args.named_names(&mut |name| {212 if param.name() == name {213 found = true;214 }215 });216 if !found {217 bail!(FunctionParameterNotBoundInCall(218 param.name().as_str().map(IStr::from),219 params220 .iter()221 .map(|p| (p.name().as_str().map(IStr::from), p.default()))222 .collect()223 ));224 }225 }226 unreachable!();227 }228 }229 Ok(passed_args)230}231232/// Creates Context, which has all argument default values applied233/// and with unbound values causing error to be returned234pub fn parse_default_function_call(body_ctx: Context, params: &ParamsDesc) -> Result<Context> {235 #[derive(Trace)]236 struct DependsOnUnbound(IStr, ParamsDesc);237 impl ThunkValue for DependsOnUnbound {238 type Output = Val;239 fn get(self: Box<Self>) -> Result<Val> {240 Err(FunctionParameterNotBoundInCall(241 Some(self.0.clone()),242 self.1243 .iter()244 .map(|p| (p.0.name(), ParamDefault::exists(p.1.is_some())))245 .collect(),246 )247 .into())248 }249 }250251 let fctx = Context::new_future();252253 let mut bindings = GcHashMap::with_capacity(params.iter().map(|p| p.0.capacity_hint()).sum());254255 for param in params.iter() {256 if let Some(v) = ¶m.1 {257 destruct(258 ¶m.0.clone(),259 Thunk::new(EvaluateNamedThunk {260 ctx: fctx.clone(),261 name: param.0.name().unwrap_or_else(|| "<destruct>".into()),262 value: v.clone(),263 }),264 fctx.clone(),265 &mut bindings,266 )?;267 } else {268 destruct(269 ¶m.0,270 Thunk::new(DependsOnUnbound(271 param.0.name().unwrap_or_else(|| "<destruct>".into()),272 params.clone(),273 )),274 fctx.clone(),275 &mut bindings,276 )?;277 }278 }279280 Ok(body_ctx281 .extend(bindings, None, None, None)282 .into_future(fctx))283}1use std::mem::replace;23use jrsonnet_gcmodule::Trace;4use jrsonnet_interner::IStr;5use jrsonnet_parser::{LocExpr, ParamsDesc};67use super::{arglike::ArgsLike, builtin::BuiltinParam};8use crate::{9 bail,10 destructure::destruct,11 error::{ErrorKind::*, Result},12 evaluate_named,13 function::builtin::ParamDefault,14 gc::GcHashMap,15 val::ThunkValue,16 Context, Pending, Thunk, Val,17};1819#[derive(Trace)]20struct EvaluateNamedThunk {21 ctx: Pending<Context>,22 name: IStr,23 value: LocExpr,24}2526impl ThunkValue for EvaluateNamedThunk {27 type Output = Val;28 fn get(self: Box<Self>) -> Result<Val> {29 evaluate_named(self.ctx.unwrap(), &self.value, self.name)30 }31}3233/// Creates correct [context](Context) for function body evaluation returning error on invalid call.34///35/// ## Parameters36/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)37/// * `body_ctx`: used for default parameter values' execution and for body execution (if set)38/// * `params`: function parameters' definition39/// * `args`: passed function arguments40/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily41pub fn parse_function_call(42 ctx: Context,43 body_ctx: Context,44 params: &ParamsDesc,45 args: &dyn ArgsLike,46 tailstrict: bool,47) -> Result<Context> {48 let mut passed_args =49 GcHashMap::with_capacity(params.iter().map(|p| p.0.capacity_hint()).sum());50 if args.unnamed_len() > params.len() {51 bail!(TooManyArgsFunctionHas(52 params.len(),53 params54 .iter()55 .map(|p| (p.0.name(), ParamDefault::exists(p.1.is_some())))56 .collect()57 ))58 }5960 let mut filled_named = 0;61 let mut filled_positionals = 0;6263 args.unnamed_iter(ctx.clone(), tailstrict, &mut |id, arg| {64 let name = params[id].0.clone();65 destruct(66 &name,67 arg,68 Pending::new_filled(ctx.clone()),69 &mut passed_args,70 )?;71 filled_positionals += 1;72 Ok(())73 })?;7475 args.named_iter(ctx, tailstrict, &mut |name, value| {76 // FIXME: O(n) for arg existence check77 if !params.iter().any(|p| p.0.name().as_ref() == Some(name)) {78 bail!(UnknownFunctionParameter((name as &str).to_owned()));79 }80 if passed_args.insert(name.clone(), value).is_some() {81 bail!(BindingParameterASecondTime(name.clone()));82 }83 filled_named += 1;84 Ok(())85 })?;8687 if filled_named + filled_positionals < params.len() {88 // Some args are unset, but maybe we have defaults for them89 // Default values should be created in newly created context90 let fctx = Context::new_future();91 let mut defaults = GcHashMap::with_capacity(92 params.iter().map(|p| p.0.capacity_hint()).sum::<usize>()93 - filled_named94 - filled_positionals,95 );9697 for (idx, param) in params.iter().enumerate().filter(|p| p.1 .1.is_some()) {98 if let Some(name) = param.0.name() {99 if passed_args.contains_key(&name) {100 continue;101 }102 } else if idx < filled_positionals {103 continue;104 }105106 destruct(107 ¶m.0,108 Thunk::new(EvaluateNamedThunk {109 ctx: fctx.clone(),110 name: param.0.name().unwrap_or_else(|| "<destruct>".into()),111 value: param.1.clone().expect("default exists"),112 }),113 fctx.clone(),114 &mut defaults,115 )?;116 if param.0.name().is_some() {117 filled_named += 1;118 } else {119 filled_positionals += 1;120 }121 }122123 // Some args still weren't filled124 if filled_named + filled_positionals != params.len() {125 for param in params.iter().skip(args.unnamed_len()) {126 let mut found = false;127 args.named_names(&mut |name| {128 if Some(name) == param.0.name().as_ref() {129 found = true;130 }131 });132 if !found {133 bail!(FunctionParameterNotBoundInCall(134 param.0.clone().name(),135 params136 .iter()137 .map(|p| (p.0.name(), ParamDefault::exists(p.1.is_some())))138 .collect()139 ));140 }141 }142 unreachable!();143 }144145 Ok(body_ctx146 .extend(passed_args, None, None, None)147 .extend(defaults, None, None, None)148 .into_future(fctx))149 } else {150 let body_ctx = body_ctx.extend(passed_args, None, None, None);151 Ok(body_ctx)152 }153}154155/// You shouldn't probally use this function, use `jrsonnet_macros::builtin` instead156///157/// ## Parameters158/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)159/// * `params`: function parameters' definition160/// * `args`: passed function arguments161/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily162pub fn parse_builtin_call(163 ctx: Context,164 params: &[BuiltinParam],165 args: &dyn ArgsLike,166 tailstrict: bool,167) -> Result<Vec<Option<Thunk<Val>>>> {168 let mut passed_args: Vec<Option<Thunk<Val>>> = vec![None; params.len()];169 if args.unnamed_len() > params.len() {170 bail!(TooManyArgsFunctionHas(171 params.len(),172 params173 .iter()174 .map(|p| (p.name().as_str().map(IStr::from), p.default()))175 .collect()176 ))177 }178179 let mut filled_args = 0;180181 args.unnamed_iter(ctx.clone(), tailstrict, &mut |id, arg| {182 passed_args[id] = Some(arg);183 filled_args += 1;184 Ok(())185 })?;186187 args.named_iter(ctx, tailstrict, &mut |name, arg| {188 // FIXME: O(n) for arg existence check189 let id = params190 .iter()191 .position(|p| p.name() == name)192 .ok_or_else(|| UnknownFunctionParameter((name as &str).to_owned()))?;193 if replace(&mut passed_args[id], Some(arg)).is_some() {194 bail!(BindingParameterASecondTime(name.clone()));195 }196 filled_args += 1;197 Ok(())198 })?;199200 if filled_args < params.len() {201 for (id, _) in params.iter().enumerate().filter(|(_, p)| p.has_default()) {202 if passed_args[id].is_some() {203 continue;204 }205 filled_args += 1;206 }207208 // Some args still wasn't filled209 if filled_args != params.len() {210 for param in params.iter().skip(args.unnamed_len()) {211 let mut found = false;212 args.named_names(&mut |name| {213 if param.name() == name {214 found = true;215 }216 });217 if !found {218 bail!(FunctionParameterNotBoundInCall(219 param.name().as_str().map(IStr::from),220 params221 .iter()222 .map(|p| (p.name().as_str().map(IStr::from), p.default()))223 .collect()224 ));225 }226 }227 unreachable!();228 }229 }230 Ok(passed_args)231}232233/// Creates Context, which has all argument default values applied234/// and with unbound values causing error to be returned235pub fn parse_default_function_call(body_ctx: Context, params: &ParamsDesc) -> Result<Context> {236 let fctx = Context::new_future();237238 let mut bindings = GcHashMap::with_capacity(params.iter().map(|p| p.0.capacity_hint()).sum());239240 for param in params.iter() {241 if let Some(v) = ¶m.1 {242 destruct(243 ¶m.0.clone(),244 Thunk::new(EvaluateNamedThunk {245 ctx: fctx.clone(),246 name: param.0.name().unwrap_or_else(|| "<destruct>".into()),247 value: v.clone(),248 }),249 fctx.clone(),250 &mut bindings,251 )?;252 } else {253 destruct(254 ¶m.0,255 {256 let param_name = param.0.name().unwrap_or_else(|| "<destruct>".into());257 let params = params.clone();258 Thunk!(move || Err(FunctionParameterNotBoundInCall(259 Some(param_name),260 params261 .iter()262 .map(|p| (p.0.name(), ParamDefault::exists(p.1.is_some())))263 .collect(),264 )265 .into()))266 },267 fctx.clone(),268 &mut bindings,269 )?;270 }271 }272273 Ok(body_ctx274 .extend(bindings, None, None, None)275 .into_future(fctx))276}crates/jrsonnet-evaluator/src/gc.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/gc.rs
+++ b/crates/jrsonnet-evaluator/src/gc.rs
@@ -158,3 +158,5 @@
Self::new()
}
}
+
+pub fn assert_trace<T: Trace>(_v: &T) {}
crates/jrsonnet-evaluator/src/obj.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/obj.rs
+++ b/crates/jrsonnet-evaluator/src/obj.rs
@@ -20,7 +20,7 @@
in_frame,
operator::evaluate_add_op,
tb,
- val::{ArrValue, ThunkValue},
+ val::ArrValue,
MaybeUnbound, Result, Thunk, Unbound, Val,
};
@@ -444,45 +444,16 @@
})
}
pub fn get_lazy(&self, key: IStr) -> Option<Thunk<Val>> {
- #[derive(Trace)]
- struct ThunkGet {
- obj: ObjValue,
- key: IStr,
- }
- impl ThunkValue for ThunkGet {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- Ok(self.obj.get(self.key)?.expect("field exists"))
- }
- }
-
if !self.has_field_ex(key.clone(), true) {
return None;
}
- Some(Thunk::new(ThunkGet {
- obj: self.clone(),
- key,
- }))
+ let obj = self.clone();
+
+ Some(Thunk!(move || Ok(obj.get(key)?.expect("field exists"))))
}
pub fn get_lazy_or_bail(&self, key: IStr) -> Thunk<Val> {
- #[derive(Trace)]
- struct ThunkGet {
- obj: ObjValue,
- key: IStr,
- }
- impl ThunkValue for ThunkGet {
- type Output = Val;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- self.obj.get_or_bail(self.key)
- }
- }
-
- Thunk::new(ThunkGet {
- obj: self.clone(),
- key,
- })
+ let obj = self.clone();
+ Thunk!(move || obj.get_or_bail(key))
}
pub fn ptr_eq(a: &Self, b: &Self) -> bool {
Cc::ptr_eq(&a.0, &b.0)
@@ -733,11 +704,10 @@
self.value_cache
.borrow_mut()
.insert(cache_key.clone(), CacheValue::Pending);
- let value = self.get_for_uncached(key, this).map_err(|e| {
+ let value = self.get_for_uncached(key, this).inspect_err(|e| {
self.value_cache
.borrow_mut()
.insert(cache_key.clone(), CacheValue::Errored(e.clone()));
- e
})?;
self.value_cache.borrow_mut().insert(
cache_key,
crates/jrsonnet-evaluator/src/val.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/val.rs
+++ b/crates/jrsonnet-evaluator/src/val.rs
@@ -11,6 +11,7 @@
use derivative::Derivative;
use jrsonnet_gcmodule::{Cc, Trace};
use jrsonnet_interner::IStr;
+pub use jrsonnet_macros::Thunk;
use jrsonnet_types::ValType;
use thiserror::Error;
@@ -32,6 +33,27 @@
}
#[derive(Trace)]
+pub struct ThunkValueClosure<D: Trace, O: 'static> {
+ env: D,
+ // Carries no data, as it is not a real closure, all the
+ // captured environment is stored in `env` field.
+ #[trace(skip)]
+ closure: fn(D) -> Result<O>,
+}
+impl<D: Trace, O: 'static> ThunkValueClosure<D, O> {
+ pub fn new(env: D, closure: fn(D) -> Result<O>) -> Self {
+ Self { env, closure }
+ }
+}
+impl<D: Trace, O: 'static> ThunkValue for ThunkValueClosure<D, O> {
+ type Output = O;
+
+ fn get(self: Box<Self>) -> Result<Self::Output> {
+ (self.closure)(self.env)
+ }
+}
+
+#[derive(Trace)]
enum ThunkInner<T: Trace> {
Computed(T),
Errored(Error),
@@ -113,28 +135,11 @@
M: ThunkMapper<Input>,
M::Output: Trace,
{
- #[derive(Trace)]
- struct Mapped<Input: Trace, Mapper: Trace> {
- inner: Thunk<Input>,
- mapper: Mapper,
- }
- impl<Input, Mapper> ThunkValue for Mapped<Input, Mapper>
- where
- Input: Trace + Clone,
- Mapper: ThunkMapper<Input>,
- {
- type Output = Mapper::Output;
-
- fn get(self: Box<Self>) -> Result<Self::Output> {
- let value = self.inner.evaluate()?;
- let mapped = self.mapper.map(value)?;
- Ok(mapped)
- }
- }
-
- Thunk::new(Mapped::<Input, M> {
- inner: self,
- mapper,
+ let inner = self;
+ Thunk!(move || {
+ let value = inner.evaluate()?;
+ let mapped = mapper.map(value)?;
+ Ok(mapped)
})
}
}
crates/jrsonnet-macros/Cargo.tomldiffbeforeafterboth--- a/crates/jrsonnet-macros/Cargo.toml
+++ b/crates/jrsonnet-macros/Cargo.toml
@@ -17,3 +17,4 @@
proc-macro2.workspace = true
quote.workspace = true
syn = { workspace = true, features = ["full"] }
+syn-dissect-closure.workspace = true
crates/jrsonnet-macros/src/lib.rsdiffbeforeafterboth--- a/crates/jrsonnet-macros/src/lib.rs
+++ b/crates/jrsonnet-macros/src/lib.rs
@@ -1,7 +1,7 @@
use std::string::String;
use proc_macro2::TokenStream;
-use quote::quote;
+use quote::{quote, quote_spanned};
use syn::{
parenthesized,
parse::{Parse, ParseStream},
@@ -9,8 +9,8 @@
punctuated::Punctuated,
spanned::Spanned,
token::{self, Comma},
- Attribute, DeriveInput, Error, Expr, FnArg, GenericArgument, Ident, ItemFn, LitStr, Pat, Path,
- PathArguments, Result, ReturnType, Token, Type,
+ Attribute, DeriveInput, Error, Expr, ExprClosure, FnArg, GenericArgument, Ident, ItemFn,
+ LitStr, Pat, Path, PathArguments, Result, ReturnType, Token, Type,
};
fn parse_attr<A: Parse, I>(attrs: &[Attribute], ident: I) -> Result<Option<A>>
@@ -815,3 +815,30 @@
let input = parse_macro_input!(input as FormatInput);
input.expand().into()
}
+
+/// Create Thunk using closure syntax
+#[proc_macro]
+#[allow(non_snake_case)]
+pub fn Thunk(input: proc_macro::TokenStream) -> proc_macro::TokenStream {
+ let input = parse_macro_input!(input as ExprClosure);
+
+ let span = input.inputs.span();
+ let move_check = input.capture.is_none().then(|| {
+ quote_spanned! {span => {
+ compile_error!("Thunk! needs to be called with move closure");
+ }}
+ });
+
+ let (env, closure, args) = syn_dissect_closure::split_env(input);
+
+ let trace_check = args.iter().map(|el| {
+ let span = el.span();
+ quote_spanned! {span => ::jrsonnet_evaluator::gc::assert_trace(&#el);}
+ });
+
+ quote! {{
+ #move_check
+ #(#trace_check)*
+ ::jrsonnet_evaluator::Thunk::new(::jrsonnet_evaluator::val::ThunkValueClosure::new(#env, #closure))
+ }}.into()
+}