git.delta.rocks / jrsonnet / refs/commits / 4ec63264e784

difftreelog

refactor prefer builtins over natives

Yaroslav Bolyukin2022-03-06parent: #2d3e912.patch.diff
in: master

8 files changed

modifiedbindings/jsonnet/src/native.rsdiffbeforeafterboth
--- a/bindings/jsonnet/src/native.rs
+++ b/bindings/jsonnet/src/native.rs
@@ -1,11 +1,11 @@
 use gcmodule::Cc;
 use jrsonnet_evaluator::{
 	error::{Error, LocError},
+	function::BuiltinParam,
 	gc::TraceBox,
 	native::{NativeCallback, NativeCallbackHandler},
 	EvaluationState, IStr, Val,
 };
-use jrsonnet_parser::{Param, ParamsDesc};
 use std::{
 	convert::TryFrom,
 	ffi::{c_void, CStr},
@@ -28,7 +28,7 @@
 	cb: JsonnetNativeCallback,
 }
 impl NativeCallbackHandler for JsonnetNativeCallbackHandler {
-	fn call(&self, _from: Rc<Path>, args: &[Val]) -> Result<Val, LocError> {
+	fn call(&self, _from: Option<Rc<Path>>, args: &[Val]) -> Result<Val, LocError> {
 		let mut n_args = Vec::new();
 		for a in args {
 			n_args.push(Some(Box::new(a.clone())));
@@ -68,16 +68,19 @@
 			break;
 		}
 		let param = CStr::from_ptr(*raw_params).to_str().expect("not utf8");
-		params.push(Param(param.into(), None));
+		params.push(BuiltinParam {
+			name: param.into(),
+			has_default: false,
+		});
 		raw_params = raw_params.offset(1);
 	}
-	let params = ParamsDesc(Rc::new(params));
 
 	vm.add_native(
 		name,
-		Cc::new(NativeCallback::new(
+		#[allow(deprecated)]
+		Cc::new(TraceBox(Box::new(NativeCallback::new(
 			params,
 			TraceBox(Box::new(JsonnetNativeCallbackHandler { ctx, cb })),
-		)),
+		)))),
 	)
 }
modifiedcrates/jrsonnet-evaluator/src/builtin/mod.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/builtin/mod.rs
+++ b/crates/jrsonnet-evaluator/src/builtin/mod.rs
@@ -11,7 +11,6 @@
 };
 use crate::{Either, ObjValue};
 use format::{format_arr, format_obj};
-use gcmodule::Cc;
 use jrsonnet_interner::IStr;
 use jrsonnet_parser::ExprLocation;
 use serde::Deserialize;
@@ -142,7 +141,7 @@
 }
 
 #[jrsonnet_macros::builtin]
-fn builtin_length(x: Either![IStr, VecVal, ObjValue, Cc<FuncVal>]) -> Result<usize> {
+fn builtin_length(x: Either![IStr, VecVal, ObjValue, FuncVal]) -> Result<usize> {
 	use Either4::*;
 	Ok(match x {
 		A(x) => x.chars().count(),
@@ -162,7 +161,7 @@
 }
 
 #[jrsonnet_macros::builtin]
-fn builtin_make_array(sz: usize, func: Cc<FuncVal>) -> Result<VecVal> {
+fn builtin_make_array(sz: usize, func: FuncVal) -> Result<VecVal> {
 	let mut out = Vec::with_capacity(sz);
 	for i in 0..sz {
 		out.push(func.evaluate_simple(&[i as f64].as_slice())?)
@@ -345,24 +344,24 @@
 }
 
 #[jrsonnet_macros::builtin]
-fn builtin_native(name: IStr) -> Result<Cc<FuncVal>> {
+fn builtin_native(name: IStr) -> Result<FuncVal> {
 	Ok(with_state(|s| s.settings().ext_natives.get(&name).cloned())
-		.map(|v| Cc::new(FuncVal::NativeExt(name.clone(), v)))
+		.map(|v| FuncVal::Builtin(v.clone()))
 		.ok_or(UndefinedExternalFunction(name))?)
 }
 
 #[jrsonnet_macros::builtin]
-fn builtin_filter(func: Cc<FuncVal>, arr: ArrValue) -> Result<ArrValue> {
+fn builtin_filter(func: FuncVal, arr: ArrValue) -> Result<ArrValue> {
 	arr.filter(|val| bool::try_from(func.evaluate_simple(&[Any(val.clone())].as_slice())?))
 }
 
 #[jrsonnet_macros::builtin]
-fn builtin_map(func: Cc<FuncVal>, arr: ArrValue) -> Result<ArrValue> {
+fn builtin_map(func: FuncVal, arr: ArrValue) -> Result<ArrValue> {
 	arr.map(|val| func.evaluate_simple(&[Any(val)].as_slice()))
 }
 
 #[jrsonnet_macros::builtin]
-fn builtin_flatmap(func: Cc<FuncVal>, arr: IndexableVal) -> Result<IndexableVal> {
+fn builtin_flatmap(func: FuncVal, arr: IndexableVal) -> Result<IndexableVal> {
 	match arr {
 		IndexableVal::Str(s) => {
 			let mut out = String::new();
@@ -397,7 +396,7 @@
 }
 
 #[jrsonnet_macros::builtin]
-fn builtin_foldl(func: Cc<FuncVal>, arr: ArrValue, init: Any) -> Result<Any> {
+fn builtin_foldl(func: FuncVal, arr: ArrValue, init: Any) -> Result<Any> {
 	let mut acc = init.0;
 	for i in arr.iter() {
 		acc = func.evaluate_simple(&[Any(acc), Any(i?)].as_slice())?;
@@ -406,7 +405,7 @@
 }
 
 #[jrsonnet_macros::builtin]
-fn builtin_foldr(func: Cc<FuncVal>, arr: ArrValue, init: Any) -> Result<Any> {
+fn builtin_foldr(func: FuncVal, arr: ArrValue, init: Any) -> Result<Any> {
 	let mut acc = init.0;
 	for i in arr.iter().rev() {
 		acc = func.evaluate_simple(&[Any(i?), Any(acc)].as_slice())?;
@@ -416,13 +415,13 @@
 
 #[jrsonnet_macros::builtin]
 #[allow(non_snake_case)]
-fn builtin_sort(arr: ArrValue, keyF: Option<Cc<FuncVal>>) -> Result<ArrValue> {
+fn builtin_sort(arr: ArrValue, keyF: Option<FuncVal>) -> Result<ArrValue> {
 	if arr.len() <= 1 {
 		return Ok(arr);
 	}
 	Ok(ArrValue::Eager(sort::sort(
 		arr.evaluated()?,
-		keyF.as_deref(),
+		keyF.as_ref(),
 	)?))
 }
 
modifiedcrates/jrsonnet-evaluator/src/evaluate/mod.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/evaluate/mod.rs
+++ b/crates/jrsonnet-evaluator/src/evaluate/mod.rs
@@ -177,7 +177,7 @@
 }
 
 pub fn evaluate_method(ctx: Context, name: IStr, params: ParamsDesc, body: LocExpr) -> Val {
-	Val::Func(Cc::new(FuncVal::Normal(FuncDesc {
+	Val::Func(FuncVal::Normal(Cc::new(FuncDesc {
 		name,
 		ctx,
 		params,
@@ -630,11 +630,11 @@
 		Function(params, body) => {
 			evaluate_method(context, "anonymous".into(), params.clone(), body.clone())
 		}
-		Intrinsic(name) => Val::Func(Cc::new(FuncVal::StaticBuiltin(
+		Intrinsic(name) => Val::Func(FuncVal::StaticBuiltin(
 			BUILTINS
 				.with(|b| b.get(name).copied())
 				.ok_or_else(|| IntrinsicNotFound(name.clone()))?,
-		))),
+		)),
 		AssertExpr(assert, returned) => {
 			evaluate_assert(context.clone(), assert)?;
 			evaluate(context, returned)?
modifiedcrates/jrsonnet-evaluator/src/function.rsdiffbeforeafterboth
before · crates/jrsonnet-evaluator/src/function.rs
1use crate::{2	error::{Error::*, LocError},3	evaluate, evaluate_named,4	gc::TraceBox,5	throw,6	typed::Typed,7	Context, FutureWrapper, GcHashMap, LazyVal, LazyValValue, Result, Val,8};9use gcmodule::Trace;10use jrsonnet_interner::IStr;11use jrsonnet_parser::{ArgsDesc, ExprLocation, LocExpr, ParamsDesc};12use std::{borrow::Cow, collections::HashMap, convert::TryFrom};1314#[derive(Trace)]15struct EvaluateLazyVal {16	context: Context,17	expr: LocExpr,18}19impl LazyValValue for EvaluateLazyVal {20	fn get(self: Box<Self>) -> Result<Val> {21		evaluate(self.context, &self.expr)22	}23}2425pub trait ArgLike {26	fn evaluate_arg(&self, ctx: Context, tailstrict: bool) -> Result<LazyVal>;27}28impl ArgLike for &LocExpr {29	fn evaluate_arg(&self, ctx: Context, tailstrict: bool) -> Result<LazyVal> {30		Ok(if tailstrict {31			LazyVal::new_resolved(evaluate(ctx, self)?)32		} else {33			LazyVal::new(TraceBox(Box::new(EvaluateLazyVal {34				context: ctx,35				expr: (*self).clone(),36			})))37		})38	}39}40impl<T> ArgLike for T41where42	T: Typed + Clone,43	Val: TryFrom<T, Error = LocError>,44{45	fn evaluate_arg(&self, _ctx: Context, _tailstrict: bool) -> Result<LazyVal> {46		let val: Val = Val::try_from(self.clone())?;47		Ok(LazyVal::new_resolved(val))48	}49}50pub enum TlaArg {51	String(IStr),52	Code(LocExpr),53	Val(Val),54}55impl ArgLike for TlaArg {56	fn evaluate_arg(&self, ctx: Context, tailstrict: bool) -> Result<LazyVal> {57		match self {58			TlaArg::String(s) => Ok(LazyVal::new_resolved(Val::Str(s.clone()))),59			TlaArg::Code(code) => Ok(if tailstrict {60				LazyVal::new_resolved(evaluate(ctx, code)?)61			} else {62				LazyVal::new(TraceBox(Box::new(EvaluateLazyVal {63					context: ctx,64					expr: code.clone(),65				})))66			}),67			TlaArg::Val(val) => Ok(LazyVal::new_resolved(val.clone())),68		}69	}70}7172pub trait ArgsLike {73	fn unnamed_len(&self) -> usize;74	fn unnamed_iter(75		&self,76		ctx: Context,77		tailstrict: bool,78		handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,79	) -> Result<()>;80	fn named_iter(81		&self,82		ctx: Context,83		tailstrict: bool,84		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,85	) -> Result<()>;86	fn named_names(&self, handler: &mut dyn FnMut(&IStr));87}8889impl ArgsLike for ArgsDesc {90	fn unnamed_len(&self) -> usize {91		self.unnamed.len()92	}9394	fn unnamed_iter(95		&self,96		ctx: Context,97		tailstrict: bool,98		handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,99	) -> Result<()> {100		for (id, arg) in self.unnamed.iter().enumerate() {101			handler(102				id,103				if tailstrict {104					LazyVal::new_resolved(evaluate(ctx.clone(), arg)?)105				} else {106					LazyVal::new(TraceBox(Box::new(EvaluateLazyVal {107						context: ctx.clone(),108						expr: arg.clone(),109					})))110				},111			)?;112		}113		Ok(())114	}115116	fn named_iter(117		&self,118		ctx: Context,119		tailstrict: bool,120		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,121	) -> Result<()> {122		for (name, arg) in self.named.iter() {123			handler(124				name,125				if tailstrict {126					LazyVal::new_resolved(evaluate(ctx.clone(), arg)?)127				} else {128					LazyVal::new(TraceBox(Box::new(EvaluateLazyVal {129						context: ctx.clone(),130						expr: arg.clone(),131					})))132				},133			)?;134		}135		Ok(())136	}137138	fn named_names(&self, handler: &mut dyn FnMut(&IStr)) {139		for (name, _) in self.named.iter() {140			handler(name)141		}142	}143}144145impl<A: ArgLike> ArgsLike for [(IStr, A)] {146	fn unnamed_len(&self) -> usize {147		0148	}149150	fn unnamed_iter(151		&self,152		_ctx: Context,153		_tailstrict: bool,154		_handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,155	) -> Result<()> {156		Ok(())157	}158159	fn named_iter(160		&self,161		ctx: Context,162		tailstrict: bool,163		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,164	) -> Result<()> {165		for (name, val) in self.iter() {166			handler(name, val.evaluate_arg(ctx.clone(), tailstrict)?)?;167		}168		Ok(())169	}170171	fn named_names(&self, handler: &mut dyn FnMut(&IStr)) {172		for (name, _) in self.iter() {173			handler(name);174		}175	}176}177178impl<A: ArgLike> ArgsLike for HashMap<IStr, A> {179	fn unnamed_len(&self) -> usize {180		0181	}182183	fn unnamed_iter(184		&self,185		_ctx: Context,186		_tailstrict: bool,187		_handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,188	) -> Result<()> {189		Ok(())190	}191192	fn named_iter(193		&self,194		ctx: Context,195		tailstrict: bool,196		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,197	) -> Result<()> {198		for (name, value) in self.iter() {199			handler(name, value.evaluate_arg(ctx.clone(), tailstrict)?)?;200		}201		Ok(())202	}203204	fn named_names(&self, handler: &mut dyn FnMut(&IStr)) {205		for (name, _) in self.iter() {206			handler(name);207		}208	}209}210211impl<A: ArgLike> ArgsLike for [A] {212	fn unnamed_len(&self) -> usize {213		self.len()214	}215216	fn unnamed_iter(217		&self,218		ctx: Context,219		tailstrict: bool,220		handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,221	) -> Result<()> {222		for (i, arg) in self.iter().enumerate() {223			handler(i, arg.evaluate_arg(ctx.clone(), tailstrict)?)?;224		}225		Ok(())226	}227228	fn named_iter(229		&self,230		_ctx: Context,231		_tailstrict: bool,232		_handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,233	) -> Result<()> {234		Ok(())235	}236237	fn named_names(&self, _handler: &mut dyn FnMut(&IStr)) {}238}239impl<A: ArgLike> ArgsLike for &[A] {240	fn unnamed_len(&self) -> usize {241		(*self).unnamed_len()242	}243244	fn unnamed_iter(245		&self,246		ctx: Context,247		tailstrict: bool,248		handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,249	) -> Result<()> {250		(*self).unnamed_iter(ctx, tailstrict, handler)251	}252253	fn named_iter(254		&self,255		ctx: Context,256		tailstrict: bool,257		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,258	) -> Result<()> {259		(*self).named_iter(ctx, tailstrict, handler)260	}261262	fn named_names(&self, handler: &mut dyn FnMut(&IStr)) {263		(*self).named_names(handler)264	}265}266267/// Creates correct [context](Context) for function body evaluation returning error on invalid call.268///269/// ## Parameters270/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)271/// * `body_ctx`: used for default parameter values' execution and for body execution (if set)272/// * `params`: function parameters' definition273/// * `args`: passed function arguments274/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily275pub fn parse_function_call(276	ctx: Context,277	body_ctx: Context,278	params: &ParamsDesc,279	args: &dyn ArgsLike,280	tailstrict: bool,281) -> Result<Context> {282	let mut passed_args = GcHashMap::with_capacity(params.len());283	if args.unnamed_len() > params.len() {284		throw!(TooManyArgsFunctionHas(params.len()))285	}286287	let mut filled_args = 0;288289	args.unnamed_iter(ctx.clone(), tailstrict, &mut |id, arg| {290		let name = params[id].0.clone();291		passed_args.insert(name, arg);292		filled_args += 1;293		Ok(())294	})?;295296	args.named_iter(ctx, tailstrict, &mut |name, value| {297		// FIXME: O(n) for arg existence check298		if !params.iter().any(|p| &p.0 == name) {299			throw!(UnknownFunctionParameter((name as &str).to_owned()));300		}301		if passed_args.insert(name.clone(), value).is_some() {302			throw!(BindingParameterASecondTime(name.clone()));303		}304		filled_args += 1;305		Ok(())306	})?;307308	if filled_args < params.len() {309		// Some args are unset, but maybe we have defaults for them310		// Default values should be created in newly created context311		let future_context = FutureWrapper::<Context>::new();312		let mut defaults = GcHashMap::with_capacity(params.len() - filled_args);313314		for param in params.iter().filter(|p| p.1.is_some()) {315			if passed_args.contains_key(&param.0.clone()) {316				continue;317			}318			#[derive(Trace)]319			struct LazyNamedBinding {320				future_context: FutureWrapper<Context>,321				name: IStr,322				value: LocExpr,323			}324			impl LazyValValue for LazyNamedBinding {325				fn get(self: Box<Self>) -> Result<Val> {326					evaluate_named(self.future_context.unwrap(), &self.value, self.name)327				}328			}329			LazyVal::new(TraceBox(Box::new(LazyNamedBinding {330				future_context: future_context.clone(),331				name: param.0.clone(),332				value: param.1.clone().unwrap(),333			})));334335			defaults.insert(336				param.0.clone(),337				LazyVal::new(TraceBox(Box::new(LazyNamedBinding {338					future_context: future_context.clone(),339					name: param.0.clone(),340					value: param.1.clone().unwrap(),341				}))),342			);343			filled_args += 1;344		}345346		// Some args still wasn't filled347		if filled_args != params.len() {348			for param in params.iter().skip(args.unnamed_len()) {349				let mut found = false;350				args.named_names(&mut |name| {351					if name == &param.0 {352						found = true;353					}354				});355				if !found {356					throw!(FunctionParameterNotBoundInCall(param.0.clone()));357				}358			}359			unreachable!();360		}361362		Ok(body_ctx363			.extend(passed_args, None, None, None)364			.extend_bound(defaults)365			.into_future(future_context))366	} else {367		let body_ctx = body_ctx.extend(passed_args, None, None, None);368		Ok(body_ctx)369	}370}371372type BuiltinParamName = Cow<'static, str>;373374#[derive(Clone)]375pub struct BuiltinParam {376	pub name: BuiltinParamName,377	pub has_default: bool,378}379380pub trait Builtin: Trace {381	fn name(&self) -> &str;382	fn params(&self) -> &[BuiltinParam];383	fn call(384		&self,385		context: Context,386		loc: Option<&ExprLocation>,387		args: &dyn ArgsLike,388	) -> Result<Val>;389}390391pub trait StaticBuiltin: Builtin + Send + Sync392where393	Self: 'static,394{395	// In impl, to make it object safe:396	// const INST: &'static Self;397}398399/// You shouldn't probally use this function, use jrsonnet_macros::builtin instead400///401/// ## Parameters402/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)403/// * `params`: function parameters' definition404/// * `args`: passed function arguments405/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily406pub fn parse_builtin_call(407	ctx: Context,408	params: &[BuiltinParam],409	args: &dyn ArgsLike,410	tailstrict: bool,411) -> Result<GcHashMap<BuiltinParamName, LazyVal>> {412	let mut passed_args = GcHashMap::with_capacity(params.len());413	if args.unnamed_len() > params.len() {414		throw!(TooManyArgsFunctionHas(params.len()))415	}416417	let mut filled_args = 0;418419	args.unnamed_iter(ctx.clone(), tailstrict, &mut |id, arg| {420		let name = params[id].name.clone();421		passed_args.insert(name, arg);422		filled_args += 1;423		Ok(())424	})?;425426	args.named_iter(ctx, tailstrict, &mut |name, arg| {427		// FIXME: O(n) for arg existence check428		let p = params429			.iter()430			.find(|p| p.name == name as &str)431			.ok_or_else(|| UnknownFunctionParameter((name as &str).to_owned()))?;432		if passed_args.insert(p.name.clone(), arg).is_some() {433			throw!(BindingParameterASecondTime(name.clone()));434		}435		filled_args += 1;436		Ok(())437	})?;438439	if filled_args < params.len() {440		for param in params.iter().filter(|p| p.has_default) {441			if passed_args.contains_key(&param.name) {442				continue;443			}444			filled_args += 1;445		}446447		// Some args still wasn't filled448		if filled_args != params.len() {449			for param in params.iter().skip(args.unnamed_len()) {450				let mut found = false;451				args.named_names(&mut |name| {452					if name as &str == &param.name as &str {453						found = true;454					}455				});456				if !found {457					throw!(FunctionParameterNotBoundInCall(param.name.clone().into()));458				}459			}460			unreachable!();461		}462	}463	Ok(passed_args)464}
after · crates/jrsonnet-evaluator/src/function.rs
1use crate::{2	error::{Error::*, LocError},3	evaluate, evaluate_named,4	gc::TraceBox,5	throw,6	typed::Typed,7	Context, FutureWrapper, GcHashMap, LazyVal, LazyValValue, Result, Val,8};9use gcmodule::Trace;10use jrsonnet_interner::IStr;11use jrsonnet_parser::{ArgsDesc, ExprLocation, LocExpr, ParamsDesc};12use std::{borrow::Cow, collections::HashMap, convert::TryFrom};1314#[derive(Trace)]15struct EvaluateLazyVal {16	context: Context,17	expr: LocExpr,18}19impl LazyValValue for EvaluateLazyVal {20	fn get(self: Box<Self>) -> Result<Val> {21		evaluate(self.context, &self.expr)22	}23}2425pub trait ArgLike {26	fn evaluate_arg(&self, ctx: Context, tailstrict: bool) -> Result<LazyVal>;27}28impl ArgLike for &LocExpr {29	fn evaluate_arg(&self, ctx: Context, tailstrict: bool) -> Result<LazyVal> {30		Ok(if tailstrict {31			LazyVal::new_resolved(evaluate(ctx, self)?)32		} else {33			LazyVal::new(TraceBox(Box::new(EvaluateLazyVal {34				context: ctx,35				expr: (*self).clone(),36			})))37		})38	}39}40impl<T> ArgLike for T41where42	T: Typed + Clone,43	Val: TryFrom<T, Error = LocError>,44{45	fn evaluate_arg(&self, _ctx: Context, _tailstrict: bool) -> Result<LazyVal> {46		let val: Val = Val::try_from(self.clone())?;47		Ok(LazyVal::new_resolved(val))48	}49}50pub enum TlaArg {51	String(IStr),52	Code(LocExpr),53	Val(Val),54}55impl ArgLike for TlaArg {56	fn evaluate_arg(&self, ctx: Context, tailstrict: bool) -> Result<LazyVal> {57		match self {58			TlaArg::String(s) => Ok(LazyVal::new_resolved(Val::Str(s.clone()))),59			TlaArg::Code(code) => Ok(if tailstrict {60				LazyVal::new_resolved(evaluate(ctx, code)?)61			} else {62				LazyVal::new(TraceBox(Box::new(EvaluateLazyVal {63					context: ctx,64					expr: code.clone(),65				})))66			}),67			TlaArg::Val(val) => Ok(LazyVal::new_resolved(val.clone())),68		}69	}70}7172pub trait ArgsLike {73	fn unnamed_len(&self) -> usize;74	fn unnamed_iter(75		&self,76		ctx: Context,77		tailstrict: bool,78		handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,79	) -> Result<()>;80	fn named_iter(81		&self,82		ctx: Context,83		tailstrict: bool,84		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,85	) -> Result<()>;86	fn named_names(&self, handler: &mut dyn FnMut(&IStr));87}8889impl ArgsLike for ArgsDesc {90	fn unnamed_len(&self) -> usize {91		self.unnamed.len()92	}9394	fn unnamed_iter(95		&self,96		ctx: Context,97		tailstrict: bool,98		handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,99	) -> Result<()> {100		for (id, arg) in self.unnamed.iter().enumerate() {101			handler(102				id,103				if tailstrict {104					LazyVal::new_resolved(evaluate(ctx.clone(), arg)?)105				} else {106					LazyVal::new(TraceBox(Box::new(EvaluateLazyVal {107						context: ctx.clone(),108						expr: arg.clone(),109					})))110				},111			)?;112		}113		Ok(())114	}115116	fn named_iter(117		&self,118		ctx: Context,119		tailstrict: bool,120		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,121	) -> Result<()> {122		for (name, arg) in self.named.iter() {123			handler(124				name,125				if tailstrict {126					LazyVal::new_resolved(evaluate(ctx.clone(), arg)?)127				} else {128					LazyVal::new(TraceBox(Box::new(EvaluateLazyVal {129						context: ctx.clone(),130						expr: arg.clone(),131					})))132				},133			)?;134		}135		Ok(())136	}137138	fn named_names(&self, handler: &mut dyn FnMut(&IStr)) {139		for (name, _) in self.named.iter() {140			handler(name)141		}142	}143}144145impl<A: ArgLike> ArgsLike for [(IStr, A)] {146	fn unnamed_len(&self) -> usize {147		0148	}149150	fn unnamed_iter(151		&self,152		_ctx: Context,153		_tailstrict: bool,154		_handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,155	) -> Result<()> {156		Ok(())157	}158159	fn named_iter(160		&self,161		ctx: Context,162		tailstrict: bool,163		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,164	) -> Result<()> {165		for (name, val) in self.iter() {166			handler(name, val.evaluate_arg(ctx.clone(), tailstrict)?)?;167		}168		Ok(())169	}170171	fn named_names(&self, handler: &mut dyn FnMut(&IStr)) {172		for (name, _) in self.iter() {173			handler(name);174		}175	}176}177178impl<A: ArgLike> ArgsLike for HashMap<IStr, A> {179	fn unnamed_len(&self) -> usize {180		0181	}182183	fn unnamed_iter(184		&self,185		_ctx: Context,186		_tailstrict: bool,187		_handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,188	) -> Result<()> {189		Ok(())190	}191192	fn named_iter(193		&self,194		ctx: Context,195		tailstrict: bool,196		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,197	) -> Result<()> {198		for (name, value) in self.iter() {199			handler(name, value.evaluate_arg(ctx.clone(), tailstrict)?)?;200		}201		Ok(())202	}203204	fn named_names(&self, handler: &mut dyn FnMut(&IStr)) {205		for (name, _) in self.iter() {206			handler(name);207		}208	}209}210211impl<A: ArgLike> ArgsLike for [A] {212	fn unnamed_len(&self) -> usize {213		self.len()214	}215216	fn unnamed_iter(217		&self,218		ctx: Context,219		tailstrict: bool,220		handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,221	) -> Result<()> {222		for (i, arg) in self.iter().enumerate() {223			handler(i, arg.evaluate_arg(ctx.clone(), tailstrict)?)?;224		}225		Ok(())226	}227228	fn named_iter(229		&self,230		_ctx: Context,231		_tailstrict: bool,232		_handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,233	) -> Result<()> {234		Ok(())235	}236237	fn named_names(&self, _handler: &mut dyn FnMut(&IStr)) {}238}239impl<A: ArgLike> ArgsLike for &[A] {240	fn unnamed_len(&self) -> usize {241		(*self).unnamed_len()242	}243244	fn unnamed_iter(245		&self,246		ctx: Context,247		tailstrict: bool,248		handler: &mut dyn FnMut(usize, LazyVal) -> Result<()>,249	) -> Result<()> {250		(*self).unnamed_iter(ctx, tailstrict, handler)251	}252253	fn named_iter(254		&self,255		ctx: Context,256		tailstrict: bool,257		handler: &mut dyn FnMut(&IStr, LazyVal) -> Result<()>,258	) -> Result<()> {259		(*self).named_iter(ctx, tailstrict, handler)260	}261262	fn named_names(&self, handler: &mut dyn FnMut(&IStr)) {263		(*self).named_names(handler)264	}265}266267/// Creates correct [context](Context) for function body evaluation returning error on invalid call.268///269/// ## Parameters270/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)271/// * `body_ctx`: used for default parameter values' execution and for body execution (if set)272/// * `params`: function parameters' definition273/// * `args`: passed function arguments274/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily275pub fn parse_function_call(276	ctx: Context,277	body_ctx: Context,278	params: &ParamsDesc,279	args: &dyn ArgsLike,280	tailstrict: bool,281) -> Result<Context> {282	let mut passed_args = GcHashMap::with_capacity(params.len());283	if args.unnamed_len() > params.len() {284		throw!(TooManyArgsFunctionHas(params.len()))285	}286287	let mut filled_args = 0;288289	args.unnamed_iter(ctx.clone(), tailstrict, &mut |id, arg| {290		let name = params[id].0.clone();291		passed_args.insert(name, arg);292		filled_args += 1;293		Ok(())294	})?;295296	args.named_iter(ctx, tailstrict, &mut |name, value| {297		// FIXME: O(n) for arg existence check298		if !params.iter().any(|p| &p.0 == name) {299			throw!(UnknownFunctionParameter((name as &str).to_owned()));300		}301		if passed_args.insert(name.clone(), value).is_some() {302			throw!(BindingParameterASecondTime(name.clone()));303		}304		filled_args += 1;305		Ok(())306	})?;307308	if filled_args < params.len() {309		// Some args are unset, but maybe we have defaults for them310		// Default values should be created in newly created context311		let future_context = FutureWrapper::<Context>::new();312		let mut defaults = GcHashMap::with_capacity(params.len() - filled_args);313314		for param in params.iter().filter(|p| p.1.is_some()) {315			if passed_args.contains_key(&param.0.clone()) {316				continue;317			}318			#[derive(Trace)]319			struct LazyNamedBinding {320				future_context: FutureWrapper<Context>,321				name: IStr,322				value: LocExpr,323			}324			impl LazyValValue for LazyNamedBinding {325				fn get(self: Box<Self>) -> Result<Val> {326					evaluate_named(self.future_context.unwrap(), &self.value, self.name)327				}328			}329			LazyVal::new(TraceBox(Box::new(LazyNamedBinding {330				future_context: future_context.clone(),331				name: param.0.clone(),332				value: param.1.clone().unwrap(),333			})));334335			defaults.insert(336				param.0.clone(),337				LazyVal::new(TraceBox(Box::new(LazyNamedBinding {338					future_context: future_context.clone(),339					name: param.0.clone(),340					value: param.1.clone().unwrap(),341				}))),342			);343			filled_args += 1;344		}345346		// Some args still wasn't filled347		if filled_args != params.len() {348			for param in params.iter().skip(args.unnamed_len()) {349				let mut found = false;350				args.named_names(&mut |name| {351					if name == &param.0 {352						found = true;353					}354				});355				if !found {356					throw!(FunctionParameterNotBoundInCall(param.0.clone()));357				}358			}359			unreachable!();360		}361362		Ok(body_ctx363			.extend(passed_args, None, None, None)364			.extend_bound(defaults)365			.into_future(future_context))366	} else {367		let body_ctx = body_ctx.extend(passed_args, None, None, None);368		Ok(body_ctx)369	}370}371372type BuiltinParamName = Cow<'static, str>;373374#[derive(Clone, Trace)]375pub struct BuiltinParam {376	pub name: BuiltinParamName,377	pub has_default: bool,378}379380pub trait Builtin: Trace {381	fn name(&self) -> &str;382	fn params(&self) -> &[BuiltinParam];383	fn call(384		&self,385		context: Context,386		loc: Option<&ExprLocation>,387		args: &dyn ArgsLike,388	) -> Result<Val>;389}390391pub trait StaticBuiltin: Builtin + Send + Sync392where393	Self: 'static,394{395	// In impl, to make it object safe:396	// const INST: &'static Self;397}398399/// You shouldn't probally use this function, use jrsonnet_macros::builtin instead400///401/// ## Parameters402/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)403/// * `params`: function parameters' definition404/// * `args`: passed function arguments405/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily406pub fn parse_builtin_call(407	ctx: Context,408	params: &[BuiltinParam],409	args: &dyn ArgsLike,410	tailstrict: bool,411) -> Result<GcHashMap<BuiltinParamName, LazyVal>> {412	let mut passed_args = GcHashMap::with_capacity(params.len());413	if args.unnamed_len() > params.len() {414		throw!(TooManyArgsFunctionHas(params.len()))415	}416417	let mut filled_args = 0;418419	args.unnamed_iter(ctx.clone(), tailstrict, &mut |id, arg| {420		let name = params[id].name.clone();421		passed_args.insert(name, arg);422		filled_args += 1;423		Ok(())424	})?;425426	args.named_iter(ctx, tailstrict, &mut |name, arg| {427		// FIXME: O(n) for arg existence check428		let p = params429			.iter()430			.find(|p| p.name == name as &str)431			.ok_or_else(|| UnknownFunctionParameter((name as &str).to_owned()))?;432		if passed_args.insert(p.name.clone(), arg).is_some() {433			throw!(BindingParameterASecondTime(name.clone()));434		}435		filled_args += 1;436		Ok(())437	})?;438439	if filled_args < params.len() {440		for param in params.iter().filter(|p| p.has_default) {441			if passed_args.contains_key(&param.name) {442				continue;443			}444			filled_args += 1;445		}446447		// Some args still wasn't filled448		if filled_args != params.len() {449			for param in params.iter().skip(args.unnamed_len()) {450				let mut found = false;451				args.named_names(&mut |name| {452					if name as &str == &param.name as &str {453						found = true;454					}455				});456				if !found {457					throw!(FunctionParameterNotBoundInCall(param.name.clone().into()));458				}459			}460			unreachable!();461		}462	}463	Ok(passed_args)464}
modifiedcrates/jrsonnet-evaluator/src/lib.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/lib.rs
+++ b/crates/jrsonnet-evaluator/src/lib.rs
@@ -13,7 +13,7 @@
 mod dynamic;
 pub mod error;
 mod evaluate;
-mod function;
+pub mod function;
 mod import;
 mod integrations;
 mod map;
@@ -27,14 +27,12 @@
 pub use dynamic::*;
 use error::{Error::*, LocError, Result, StackTraceElement};
 pub use evaluate::*;
-pub use function::parse_function_call;
-use function::TlaArg;
+use function::{Builtin, TlaArg};
 use gc::{GcHashMap, TraceBox};
 use gcmodule::{Cc, Trace};
 pub use import::*;
 pub use jrsonnet_interner::IStr;
 use jrsonnet_parser::*;
-use native::NativeCallback;
 pub use obj::*;
 use std::{
 	cell::{Ref, RefCell, RefMut},
@@ -79,7 +77,7 @@
 	/// Used for s`td.extVar`
 	pub ext_vars: HashMap<IStr, Val>,
 	/// Used for ext.native
-	pub ext_natives: HashMap<IStr, Cc<NativeCallback>>,
+	pub ext_natives: HashMap<IStr, Cc<TraceBox<dyn Builtin>>>,
 	/// TLA vars
 	pub tla_vars: HashMap<IStr, TlaArg>,
 	/// Global variables are inserted in default context
@@ -614,7 +612,7 @@
 		self.settings_mut().import_resolver = resolver;
 	}
 
-	pub fn add_native(&self, name: IStr, cb: Cc<NativeCallback>) {
+	pub fn add_native(&self, name: IStr, cb: Cc<TraceBox<dyn Builtin>>) {
 		self.settings_mut().ext_natives.insert(name, cb);
 	}
 
@@ -657,8 +655,8 @@
 pub mod tests {
 	use super::Val;
 	use crate::{
-		error::Error::*, gc::TraceBox, native::NativeCallbackHandler, primitive_equals,
-		EvaluationState,
+		error::Error::*, function::BuiltinParam, gc::TraceBox, native::NativeCallbackHandler,
+		primitive_equals, EvaluationState,
 	};
 	use gcmodule::{Cc, Trace};
 	use jrsonnet_interner::IStr;
@@ -1096,8 +1094,11 @@
 		#[derive(Trace)]
 		struct NativeAdd;
 		impl NativeCallbackHandler for NativeAdd {
-			fn call(&self, from: Rc<Path>, args: &[Val]) -> crate::error::Result<Val> {
-				assert_eq!(&from as &Path, &PathBuf::from("native_caller.jsonnet"));
+			fn call(&self, from: Option<Rc<Path>>, args: &[Val]) -> crate::error::Result<Val> {
+				assert_eq!(
+					&from.unwrap() as &Path,
+					&PathBuf::from("native_caller.jsonnet")
+				);
 				match (&args[0], &args[1]) {
 					(Val::Num(a), Val::Num(b)) => Ok(Val::Num(a + b)),
 					(_, _) => unreachable!(),
@@ -1106,13 +1107,20 @@
 		}
 		evaluator.settings_mut().ext_natives.insert(
 			"native_add".into(),
-			Cc::new(NativeCallback::new(
-				ParamsDesc(Rc::new(vec![
-					Param("a".into(), None),
-					Param("b".into(), None),
-				])),
+			#[allow(deprecated)]
+			Cc::new(TraceBox(Box::new(NativeCallback::new(
+				vec![
+					BuiltinParam {
+						name: "a".into(),
+						has_default: false,
+					},
+					BuiltinParam {
+						name: "b".into(),
+						has_default: false,
+					},
+				],
 				TraceBox(Box::new(NativeAdd)),
-			)),
+			)))),
 		);
 		evaluator.evaluate_snippet_raw(
 			PathBuf::from("native_caller.jsonnet").into(),
modifiedcrates/jrsonnet-evaluator/src/native.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/native.rs
+++ b/crates/jrsonnet-evaluator/src/native.rs
@@ -1,33 +1,52 @@
 #![allow(clippy::type_complexity)]
 
+use crate::function::{parse_builtin_call, ArgsLike, Builtin, BuiltinParam};
 use crate::gc::TraceBox;
+use crate::Context;
 use crate::{error::Result, Val};
 use gcmodule::Trace;
-use jrsonnet_parser::ParamsDesc;
-use std::fmt::Debug;
+use jrsonnet_parser::ExprLocation;
 use std::path::Path;
 use std::rc::Rc;
 
-#[deprecated(note = "Use builtins instead")]
-pub trait NativeCallbackHandler: Trace {
-	fn call(&self, from: Rc<Path>, args: &[Val]) -> Result<Val>;
-}
-
 #[derive(Trace)]
 pub struct NativeCallback {
-	pub params: ParamsDesc,
+	pub(crate) params: Vec<BuiltinParam>,
 	handler: TraceBox<dyn NativeCallbackHandler>,
 }
 impl NativeCallback {
-	pub fn new(params: ParamsDesc, handler: TraceBox<dyn NativeCallbackHandler>) -> Self {
+	#[deprecated = "prefer using builtins directly, use this interface only for bindings"]
+	pub fn new(params: Vec<BuiltinParam>, handler: TraceBox<dyn NativeCallbackHandler>) -> Self {
 		Self { params, handler }
-	}
-	pub fn call(&self, caller: Rc<Path>, args: &[Val]) -> Result<Val> {
-		self.handler.call(caller, args)
 	}
 }
-impl Debug for NativeCallback {
-	fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
-		f.debug_struct("NativeCallback").finish()
+
+impl Builtin for NativeCallback {
+	fn name(&self) -> &str {
+		// TODO: standard natives gets their names from definition
+		// But builitins should already have them
+		"<native>"
+	}
+
+	fn params(&self) -> &[BuiltinParam] {
+		&self.params
+	}
+
+	fn call(
+		&self,
+		context: Context,
+		loc: Option<&ExprLocation>,
+		args: &dyn ArgsLike,
+	) -> Result<Val> {
+		let args = parse_builtin_call(context, &self.params, args, true)?;
+		let mut out_args = Vec::with_capacity(self.params.len());
+		for p in self.params.iter() {
+			out_args.push(args[&p.name].evaluate()?);
+		}
+		self.handler.call(loc.map(|l| l.0.clone()), &out_args)
 	}
 }
+
+pub trait NativeCallbackHandler: Trace {
+	fn call(&self, from: Option<Rc<Path>>, args: &[Val]) -> Result<Val>;
+}
modifiedcrates/jrsonnet-evaluator/src/typed/conversions.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/typed/conversions.rs
+++ b/crates/jrsonnet-evaluator/src/typed/conversions.rs
@@ -1,6 +1,5 @@
 use std::convert::{TryFrom, TryInto};
 
-use gcmodule::Cc;
 use jrsonnet_interner::IStr;
 use jrsonnet_types::{ComplexValType, ValType};
 
@@ -400,10 +399,10 @@
 	}
 }
 
-impl Typed for Cc<FuncVal> {
+impl Typed for FuncVal {
 	const TYPE: &'static ComplexValType = &ComplexValType::Simple(ValType::Func);
 }
-impl TryFrom<Val> for Cc<FuncVal> {
+impl TryFrom<Val> for FuncVal {
 	type Error = LocError;
 
 	fn try_from(value: Val) -> Result<Self> {
@@ -414,10 +413,10 @@
 		}
 	}
 }
-impl TryFrom<Cc<FuncVal>> for Val {
+impl TryFrom<FuncVal> for Val {
 	type Error = LocError;
 
-	fn try_from(value: Cc<FuncVal>) -> Result<Self> {
+	fn try_from(value: FuncVal) -> Result<Self> {
 		Ok(Self::Func(value))
 	}
 }
modifiedcrates/jrsonnet-evaluator/src/val.rsdiffbeforeafterboth
--- a/crates/jrsonnet-evaluator/src/val.rs
+++ b/crates/jrsonnet-evaluator/src/val.rs
@@ -7,7 +7,6 @@
 	evaluate,
 	function::{parse_function_call, ArgsLike, Builtin, StaticBuiltin},
 	gc::TraceBox,
-	native::NativeCallback,
 	throw, Context, ObjValue, Result,
 };
 use gcmodule::{Cc, Trace};
@@ -86,16 +85,14 @@
 	pub body: LocExpr,
 }
 
-#[derive(Trace)]
+#[derive(Trace, Clone)]
 pub enum FuncVal {
 	/// Plain function implemented in jsonnet
-	Normal(FuncDesc),
+	Normal(Cc<FuncDesc>),
 	/// Standard library function
 	StaticBuiltin(#[skip_trace] &'static dyn StaticBuiltin),
 
-	Builtin(TraceBox<dyn Builtin>),
-	/// Library functions implemented in native
-	NativeExt(IStr, Cc<NativeCallback>),
+	Builtin(Cc<TraceBox<dyn Builtin>>),
 }
 
 impl Debug for FuncVal {
@@ -104,9 +101,6 @@
 			Self::Normal(arg0) => f.debug_tuple("Normal").field(arg0).finish(),
 			Self::StaticBuiltin(arg0) => f.debug_tuple("Intrinsic").field(&arg0.name()).finish(),
 			Self::Builtin(arg0) => f.debug_tuple("Intrinsic").field(&arg0.name()).finish(),
-			Self::NativeExt(arg0, arg1) => {
-				f.debug_tuple("NativeExt").field(arg0).field(arg1).finish()
-			}
 		}
 	}
 }
@@ -116,7 +110,6 @@
 		match (self, other) {
 			(Self::Normal(a), Self::Normal(b)) => a == b,
 			(Self::StaticBuiltin(an), Self::StaticBuiltin(bn)) => std::ptr::eq(*an, *bn),
-			(Self::NativeExt(an, _), Self::NativeExt(bn, _)) => an == bn,
 			(..) => false,
 		}
 	}
@@ -127,7 +120,6 @@
 			Self::Normal(n) => n.params.iter().filter(|p| p.1.is_none()).count(),
 			Self::StaticBuiltin(i) => i.params().iter().filter(|p| !p.has_default).count(),
 			Self::Builtin(i) => i.params().iter().filter(|p| !p.has_default).count(),
-			Self::NativeExt(_, n) => n.params.iter().filter(|p| p.1.is_none()).count(),
 		}
 	}
 	pub fn name(&self) -> IStr {
@@ -135,7 +127,6 @@
 			Self::Normal(normal) => normal.name.clone(),
 			Self::StaticBuiltin(builtin) => builtin.name().into(),
 			Self::Builtin(builtin) => builtin.name().into(),
-			Self::NativeExt(n, _) => format!("native.{}", n).into(),
 		}
 	}
 	pub fn evaluate(
@@ -158,15 +149,6 @@
 			}
 			Self::StaticBuiltin(name) => name.call(call_ctx, loc, args),
 			Self::Builtin(b) => b.call(call_ctx, loc, args),
-			Self::NativeExt(_name, handler) => {
-				let args =
-					parse_function_call(call_ctx, Context::new(), &handler.params, args, true)?;
-				let mut out_args = Vec::with_capacity(handler.params.len());
-				for p in handler.params.0.iter() {
-					out_args.push(args.binding(p.0.clone())?.evaluate()?);
-				}
-				Ok(handler.call(loc.expect("todo").0.clone(), &out_args)?)
-			}
 		}
 	}
 	pub fn evaluate_simple(&self, args: &dyn ArgsLike) -> Result<Val> {
@@ -352,7 +334,7 @@
 	Num(f64),
 	Arr(ArrValue),
 	Obj(ObjValue),
-	Func(Cc<FuncVal>),
+	Func(FuncVal),
 }
 
 impl Val {