difftreelog
feat breakpoints
in: master
9 files changed
crates/jrsonnet-evaluator/src/builtin/manifest.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/builtin/manifest.rs
+++ b/crates/jrsonnet-evaluator/src/builtin/manifest.rs
@@ -1,5 +1,6 @@
use crate::error::Error::*;
use crate::error::Result;
+use crate::push_frame;
use crate::{throw, Val};
#[derive(PartialEq, Clone, Copy)]
@@ -102,12 +103,13 @@
buf.push_str(cur_padding);
escape_string_json_buf(&field, buf);
buf.push_str(": ");
- crate::push(
+ push_frame(
None,
|| format!("field <{}> manifestification", field.clone()),
|| {
let value = obj.get(field.clone())?.unwrap();
- manifest_json_ex_buf(&value, buf, cur_padding, options)
+ manifest_json_ex_buf(&value, buf, cur_padding, options)?;
+ Ok(Val::Null)
},
)?;
}
crates/jrsonnet-evaluator/src/builtin/mod.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/builtin/mod.rs
+++ b/crates/jrsonnet-evaluator/src/builtin/mod.rs
@@ -3,8 +3,8 @@
equals,
error::{Error::*, Result},
operator::evaluate_mod_op,
- parse_args, primitive_equals, push, throw, with_state, ArrValue, Context, EvaluationState,
- FuncVal, IndexableVal, LazyVal, Val,
+ parse_args, primitive_equals, push_frame, throw, with_state, ArrValue, Context,
+ EvaluationState, FuncVal, IndexableVal, LazyVal, Val,
};
use format::{format_arr, format_obj};
use jrsonnet_gc::Gc;
@@ -23,7 +23,7 @@
pub mod sort;
pub fn std_format(str: IStr, vals: Val) -> Result<Val> {
- push(
+ push_frame(
Some(&ExprLocation(Rc::from(PathBuf::from("std.jsonnet")), 0, 0)),
|| format!("std.format of {}", str),
|| {
crates/jrsonnet-evaluator/src/error.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/error.rs
+++ b/crates/jrsonnet-evaluator/src/error.rs
@@ -1,7 +1,4 @@
-use crate::{
- builtin::{format::FormatError, sort::SortError},
- typed::TypeLocError,
-};
+use crate::{Val, builtin::{format::FormatError, sort::SortError}, typed::TypeLocError};
use jrsonnet_gc::Trace;
use jrsonnet_interner::IStr;
use jrsonnet_parser::{BinaryOpType, ExprLocation, UnaryOpType};
crates/jrsonnet-evaluator/src/evaluate/mod.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/evaluate/mod.rs
+++ b/crates/jrsonnet-evaluator/src/evaluate/mod.rs
@@ -2,7 +2,7 @@
builtin::std_slice,
error::Error::*,
evaluate::operator::{evaluate_add_op, evaluate_binary_op_special, evaluate_unary_op},
- push, throw, with_state, ArrValue, Bindable, Context, ContextCreator, FuncDesc, FuncVal,
+ push_frame, throw, with_state, ArrValue, Bindable, Context, ContextCreator, FuncDesc, FuncVal,
FutureWrapper, LazyBinding, LazyVal, LazyValValue, ObjValue, ObjValueBuilder, ObjectAssertion,
Result, Val,
};
@@ -464,7 +464,7 @@
if tailstrict {
body()?
} else {
- push(loc, || format!("function <{}> call", f.name()), body)?
+ push_frame(loc, || format!("function <{}> call", f.name()), body)?
}
}
v => throw!(OnlyFunctionsCanBeCalledGot(v.value_type())),
@@ -474,7 +474,7 @@
pub fn evaluate_assert(context: Context, assertion: &AssertStmt) -> Result<()> {
let value = &assertion.0;
let msg = &assertion.1;
- let assertion_result = push(
+ let assertion_result = push_frame(
value.1.as_ref(),
|| "assertion condition".to_owned(),
|| {
@@ -483,7 +483,7 @@
},
)?;
if !assertion_result {
- push(
+ push_frame(
value.1.as_ref(),
|| "assertion failure".to_owned(),
|| {
@@ -510,6 +510,7 @@
pub fn evaluate(context: Context, expr: &LocExpr) -> Result<Val> {
use Expr::*;
let LocExpr(expr, loc) = expr;
+ // let bp = with_state(|s| s.0.stop_at.borrow().clone());
Ok(match &**expr {
Literal(LiteralType::This) => {
Val::Obj(context.this().clone().ok_or(CantUseSelfOutsideOfObject)?)
@@ -532,7 +533,7 @@
Num(v) => Val::new_checked_num(*v)?,
BinaryOp(v1, o, v2) => evaluate_binary_op_special(context, v1, *o, v2)?,
UnaryOp(o, v) => evaluate_unary_op(*o, &evaluate(context, v)?)?,
- Var(name) => push(
+ Var(name) => push_frame(
loc.as_ref(),
|| format!("variable <{}>", name),
|| context.binding(name.clone())?.evaluate(),
@@ -541,7 +542,7 @@
match (evaluate(context.clone(), value)?, evaluate(context, index)?) {
(Val::Obj(v), Val::Str(s)) => {
let sn = s.clone();
- push(
+ push_frame(
loc.as_ref(),
|| format!("field <{}> access", sn),
|| {
@@ -652,7 +653,7 @@
evaluate_assert(context.clone(), assert)?;
evaluate(context, returned)?
}
- ErrorStmt(e) => push(
+ ErrorStmt(e) => push_frame(
loc.as_ref(),
|| "error statement".to_owned(),
|| {
@@ -666,7 +667,7 @@
cond_then,
cond_else,
} => {
- if push(
+ if push_frame(
loc.as_ref(),
|| "if condition".to_owned(),
|| evaluate(context.clone(), &cond.0)?.try_cast_bool("in if condition"),
@@ -708,7 +709,7 @@
.0;
let mut import_location = tmp.to_path_buf();
import_location.pop();
- push(
+ push_frame(
loc.as_ref(),
|| format!("import {:?}", path),
|| with_state(|s| s.import_file(&import_location, path)),
crates/jrsonnet-evaluator/src/function.rsdiffbeforeafterboth1use crate::{2 error::Error::*, evaluate, evaluate_named, throw, Context, FutureWrapper, LazyVal,3 LazyValValue, Result, Val,4};5use jrsonnet_gc::Trace;6use jrsonnet_interner::IStr;7use jrsonnet_parser::{ArgsDesc, LocExpr, ParamsDesc};8use rustc_hash::FxHashMap;9use std::{collections::HashMap, hash::BuildHasherDefault};1011const NO_DEFAULT_CONTEXT: &str =12 "no default context set for call with defined default parameter value";1314#[derive(Trace)]15#[trivially_drop]16struct EvaluateLazyVal {17 context: Context,18 expr: LocExpr,19}20impl LazyValValue for EvaluateLazyVal {21 fn get(self: Box<Self>) -> Result<Val> {22 evaluate(self.context, &self.expr)23 }24}2526/// Creates correct [context](Context) for function body evaluation returning error on invalid call.27///28/// ## Parameters29/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)30/// * `body_ctx`: used for default parameter values' execution and for body execution (if set)31/// * `params`: function parameters' definition32/// * `args`: passed function arguments33/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily34pub fn parse_function_call(35 ctx: Context,36 body_ctx: Context,37 params: &ParamsDesc,38 args: &ArgsDesc,39 tailstrict: bool,40) -> Result<Context> {41 let mut passed_args =42 HashMap::with_capacity_and_hasher(params.len(), BuildHasherDefault::default());43 if args.unnamed.len() > params.len() {44 throw!(TooManyArgsFunctionHas(params.len()))45 }4647 let mut filled_args = 0;4849 for (id, arg) in args.unnamed.iter().enumerate() {50 let name = params[id].0.clone();51 passed_args.insert(52 name,53 if tailstrict {54 LazyVal::new_resolved(evaluate(ctx.clone(), arg)?)55 } else {56 LazyVal::new(Box::new(EvaluateLazyVal {57 context: ctx.clone(),58 expr: arg.clone(),59 }))60 },61 );62 filled_args += 1;63 }6465 for (name, value) in args.named.iter() {66 // FIXME: O(n) for arg existence check67 if !params.iter().any(|p| &p.0 == name) {68 throw!(UnknownFunctionParameter((name as &str).to_owned()));69 }70 if passed_args71 .insert(72 name.clone(),73 if tailstrict {74 LazyVal::new_resolved(evaluate(ctx.clone(), value)?)75 } else {76 LazyVal::new(Box::new(EvaluateLazyVal {77 context: ctx.clone(),78 expr: value.clone(),79 }))80 },81 )82 .is_some()83 {84 throw!(BindingParameterASecondTime(name.clone()));85 }86 filled_args += 1;87 }8889 if filled_args < params.len() {90 // Some args are unset, but maybe we have defaults for them91 // Default values should be created in newly created context92 let future_context = FutureWrapper::<Context>::new();93 let mut defaults = HashMap::with_capacity_and_hasher(94 params.len() - filled_args,95 BuildHasherDefault::default(),96 );9798 for param in params.iter().filter(|p| p.1.is_some()) {99 if passed_args.contains_key(¶m.0.clone()) {100 continue;101 }102 #[derive(Trace)]103 #[trivially_drop]104 struct LazyNamedBinding {105 future_context: FutureWrapper<Context>,106 name: IStr,107 value: LocExpr,108 }109 impl LazyValValue for LazyNamedBinding {110 fn get(self: Box<Self>) -> Result<Val> {111 evaluate_named(self.future_context.unwrap(), &self.value, self.name)112 }113 }114 LazyVal::new(Box::new(LazyNamedBinding {115 future_context: future_context.clone(),116 name: param.0.clone(),117 value: param.1.clone().unwrap(),118 }));119120 defaults.insert(121 param.0.clone(),122 LazyVal::new(Box::new(LazyNamedBinding {123 future_context: future_context.clone(),124 name: param.0.clone(),125 value: param.1.clone().unwrap(),126 })),127 );128 filled_args += 1;129 }130131 // Some args still wasn't filled132 if filled_args != params.len() {133 for param in params.iter().skip(args.unnamed.len()) {134 if !args.named.iter().any(|a| a.0 == param.0) {135 throw!(FunctionParameterNotBoundInCall(param.0.clone()));136 }137 }138 unreachable!();139 }140141 Ok(body_ctx142 .extend(passed_args, None, None, None)143 .extend_bound(defaults)144 .into_future(future_context))145 } else {146 let body_ctx = body_ctx.extend(passed_args, None, None, None);147 Ok(body_ctx)148 }149}150151pub fn parse_function_call_map(152 ctx: Context,153 body_ctx: Option<Context>,154 params: &ParamsDesc,155 args: &HashMap<IStr, Val>,156 tailstrict: bool,157) -> Result<Context> {158 let mut out = FxHashMap::with_capacity_and_hasher(params.len(), BuildHasherDefault::default());159 let mut positioned_args = vec![None; params.0.len()];160 for (name, val) in args.iter() {161 let idx = params162 .iter()163 .position(|p| *p.0 == **name)164 .ok_or_else(|| UnknownFunctionParameter((name as &str).to_owned()))?;165166 if idx >= params.len() {167 throw!(TooManyArgsFunctionHas(params.len()));168 }169 if positioned_args[idx].is_some() {170 throw!(BindingParameterASecondTime(params[idx].0.clone()));171 }172 positioned_args[idx] = Some(val.clone());173 }174 // Fill defaults175 for (id, p) in params.iter().enumerate() {176 let val = if let Some(arg) = positioned_args[id].take() {177 LazyVal::new_resolved(arg)178 } else if let Some(default) = &p.1 {179 if tailstrict {180 LazyVal::new_resolved(evaluate(181 body_ctx.clone().expect(NO_DEFAULT_CONTEXT),182 default,183 )?)184 } else {185 let body_ctx = body_ctx.clone();186 let default = default.clone();187 #[derive(Trace)]188 #[trivially_drop]189 struct EvaluateLazyVal {190 body_ctx: Option<Context>,191 default: LocExpr,192 }193 impl LazyValValue for EvaluateLazyVal {194 fn get(self: Box<Self>) -> Result<Val> {195 evaluate(196 self.body_ctx.clone().expect(NO_DEFAULT_CONTEXT),197 &self.default,198 )199 }200 }201 LazyVal::new(Box::new(EvaluateLazyVal { body_ctx, default }))202 }203 } else {204 throw!(FunctionParameterNotBoundInCall(p.0.clone()));205 };206 out.insert(p.0.clone(), val);207 }208209 Ok(body_ctx.unwrap_or(ctx).extend(out, None, None, None))210}211212pub fn place_args(213 ctx: Context,214 body_ctx: Option<Context>,215 params: &ParamsDesc,216 args: &[Val],217) -> Result<Context> {218 let mut out = FxHashMap::with_capacity_and_hasher(params.len(), BuildHasherDefault::default());219 let mut positioned_args = vec![None; params.0.len()];220 for (id, arg) in args.iter().enumerate() {221 if id >= params.len() {222 throw!(TooManyArgsFunctionHas(params.len()));223 }224 positioned_args[id] = Some(arg);225 }226 // Fill defaults227 for (id, p) in params.iter().enumerate() {228 let val = if let Some(arg) = &positioned_args[id] {229 (*arg).clone()230 } else if let Some(default) = &p.1 {231 evaluate(ctx.clone(), default)?232 } else {233 throw!(FunctionParameterNotBoundInCall(p.0.clone()));234 };235 out.insert(p.0.clone(), LazyVal::new_resolved(val));236 }237238 Ok(body_ctx.unwrap_or(ctx).extend(out, None, None, None))239}240241#[macro_export]242macro_rules! parse_args {243 ($ctx: expr, $fn_name: expr, $args: expr, $total_args: expr, [244 $($id: expr, $name: ident: $ty: expr $(=>$match: path)?);+ $(;)?245 ], $handler:block) => {{246 use $crate::{error::Error::*, throw, evaluate, push_stack_frame, typed::CheckType};247248 let args = $args;249 if args.unnamed.len() + args.named.len() > $total_args {250 throw!(TooManyArgsFunctionHas($total_args));251 }252 $(253 if args.unnamed.len() + args.named.len() <= $id {254 throw!(FunctionParameterNotBoundInCall(stringify!($name).into()));255 }256 // Is named257 let $name = if $id >= $args.unnamed.len() {258 let named = &args.named[$id - $args.unnamed.len()];259 if &named.0 != stringify!($name) {260 throw!(IntrinsicArgumentReorderingIsNotSupportedYet);261 }262 &named.1263 } else {264 &$args.unnamed[$id]265 };266 let $name = push_stack_frame(None, || format!("evaluating argument"), || {267 let value = evaluate($ctx.clone(), &$name)?;268 $ty.check(&value)?;269 Ok(value)270 })?;271 $(272 let $name = if let $match(v) = $name {273 v274 } else {275 unreachable!();276 };277 )?278 )+279 ($handler as crate::Result<_>)280 }};281}1use crate::{2 error::Error::*, evaluate, evaluate_named, throw, Context, FutureWrapper, LazyVal,3 LazyValValue, Result, Val,4};5use jrsonnet_gc::Trace;6use jrsonnet_interner::IStr;7use jrsonnet_parser::{ArgsDesc, LocExpr, ParamsDesc};8use rustc_hash::FxHashMap;9use std::{collections::HashMap, hash::BuildHasherDefault};1011const NO_DEFAULT_CONTEXT: &str =12 "no default context set for call with defined default parameter value";1314#[derive(Trace)]15#[trivially_drop]16struct EvaluateLazyVal {17 context: Context,18 expr: LocExpr,19}20impl LazyValValue for EvaluateLazyVal {21 fn get(self: Box<Self>) -> Result<Val> {22 evaluate(self.context, &self.expr)23 }24}2526/// Creates correct [context](Context) for function body evaluation returning error on invalid call.27///28/// ## Parameters29/// * `ctx`: used for passed argument expressions' execution and for body execution (if `body_ctx` is not set)30/// * `body_ctx`: used for default parameter values' execution and for body execution (if set)31/// * `params`: function parameters' definition32/// * `args`: passed function arguments33/// * `tailstrict`: if set to `true` function arguments are eagerly executed, otherwise - lazily34pub fn parse_function_call(35 ctx: Context,36 body_ctx: Context,37 params: &ParamsDesc,38 args: &ArgsDesc,39 tailstrict: bool,40) -> Result<Context> {41 let mut passed_args =42 HashMap::with_capacity_and_hasher(params.len(), BuildHasherDefault::default());43 if args.unnamed.len() > params.len() {44 throw!(TooManyArgsFunctionHas(params.len()))45 }4647 let mut filled_args = 0;4849 for (id, arg) in args.unnamed.iter().enumerate() {50 let name = params[id].0.clone();51 passed_args.insert(52 name,53 if tailstrict {54 LazyVal::new_resolved(evaluate(ctx.clone(), arg)?)55 } else {56 LazyVal::new(Box::new(EvaluateLazyVal {57 context: ctx.clone(),58 expr: arg.clone(),59 }))60 },61 );62 filled_args += 1;63 }6465 for (name, value) in args.named.iter() {66 // FIXME: O(n) for arg existence check67 if !params.iter().any(|p| &p.0 == name) {68 throw!(UnknownFunctionParameter((name as &str).to_owned()));69 }70 if passed_args71 .insert(72 name.clone(),73 if tailstrict {74 LazyVal::new_resolved(evaluate(ctx.clone(), value)?)75 } else {76 LazyVal::new(Box::new(EvaluateLazyVal {77 context: ctx.clone(),78 expr: value.clone(),79 }))80 },81 )82 .is_some()83 {84 throw!(BindingParameterASecondTime(name.clone()));85 }86 filled_args += 1;87 }8889 if filled_args < params.len() {90 // Some args are unset, but maybe we have defaults for them91 // Default values should be created in newly created context92 let future_context = FutureWrapper::<Context>::new();93 let mut defaults = HashMap::with_capacity_and_hasher(94 params.len() - filled_args,95 BuildHasherDefault::default(),96 );9798 for param in params.iter().filter(|p| p.1.is_some()) {99 if passed_args.contains_key(¶m.0.clone()) {100 continue;101 }102 #[derive(Trace)]103 #[trivially_drop]104 struct LazyNamedBinding {105 future_context: FutureWrapper<Context>,106 name: IStr,107 value: LocExpr,108 }109 impl LazyValValue for LazyNamedBinding {110 fn get(self: Box<Self>) -> Result<Val> {111 evaluate_named(self.future_context.unwrap(), &self.value, self.name)112 }113 }114 LazyVal::new(Box::new(LazyNamedBinding {115 future_context: future_context.clone(),116 name: param.0.clone(),117 value: param.1.clone().unwrap(),118 }));119120 defaults.insert(121 param.0.clone(),122 LazyVal::new(Box::new(LazyNamedBinding {123 future_context: future_context.clone(),124 name: param.0.clone(),125 value: param.1.clone().unwrap(),126 })),127 );128 filled_args += 1;129 }130131 // Some args still wasn't filled132 if filled_args != params.len() {133 for param in params.iter().skip(args.unnamed.len()) {134 if !args.named.iter().any(|a| a.0 == param.0) {135 throw!(FunctionParameterNotBoundInCall(param.0.clone()));136 }137 }138 unreachable!();139 }140141 Ok(body_ctx142 .extend(passed_args, None, None, None)143 .extend_bound(defaults)144 .into_future(future_context))145 } else {146 let body_ctx = body_ctx.extend(passed_args, None, None, None);147 Ok(body_ctx)148 }149}150151pub fn parse_function_call_map(152 ctx: Context,153 body_ctx: Option<Context>,154 params: &ParamsDesc,155 args: &HashMap<IStr, Val>,156 tailstrict: bool,157) -> Result<Context> {158 let mut out = FxHashMap::with_capacity_and_hasher(params.len(), BuildHasherDefault::default());159 let mut positioned_args = vec![None; params.0.len()];160 for (name, val) in args.iter() {161 let idx = params162 .iter()163 .position(|p| *p.0 == **name)164 .ok_or_else(|| UnknownFunctionParameter((name as &str).to_owned()))?;165166 if idx >= params.len() {167 throw!(TooManyArgsFunctionHas(params.len()));168 }169 if positioned_args[idx].is_some() {170 throw!(BindingParameterASecondTime(params[idx].0.clone()));171 }172 positioned_args[idx] = Some(val.clone());173 }174 // Fill defaults175 for (id, p) in params.iter().enumerate() {176 let val = if let Some(arg) = positioned_args[id].take() {177 LazyVal::new_resolved(arg)178 } else if let Some(default) = &p.1 {179 if tailstrict {180 LazyVal::new_resolved(evaluate(181 body_ctx.clone().expect(NO_DEFAULT_CONTEXT),182 default,183 )?)184 } else {185 let body_ctx = body_ctx.clone();186 let default = default.clone();187 #[derive(Trace)]188 #[trivially_drop]189 struct EvaluateLazyVal {190 body_ctx: Option<Context>,191 default: LocExpr,192 }193 impl LazyValValue for EvaluateLazyVal {194 fn get(self: Box<Self>) -> Result<Val> {195 evaluate(196 self.body_ctx.clone().expect(NO_DEFAULT_CONTEXT),197 &self.default,198 )199 }200 }201 LazyVal::new(Box::new(EvaluateLazyVal { body_ctx, default }))202 }203 } else {204 throw!(FunctionParameterNotBoundInCall(p.0.clone()));205 };206 out.insert(p.0.clone(), val);207 }208209 Ok(body_ctx.unwrap_or(ctx).extend(out, None, None, None))210}211212pub fn place_args(213 ctx: Context,214 body_ctx: Option<Context>,215 params: &ParamsDesc,216 args: &[Val],217) -> Result<Context> {218 let mut out = FxHashMap::with_capacity_and_hasher(params.len(), BuildHasherDefault::default());219 let mut positioned_args = vec![None; params.0.len()];220 for (id, arg) in args.iter().enumerate() {221 if id >= params.len() {222 throw!(TooManyArgsFunctionHas(params.len()));223 }224 positioned_args[id] = Some(arg);225 }226 // Fill defaults227 for (id, p) in params.iter().enumerate() {228 let val = if let Some(arg) = &positioned_args[id] {229 (*arg).clone()230 } else if let Some(default) = &p.1 {231 evaluate(ctx.clone(), default)?232 } else {233 throw!(FunctionParameterNotBoundInCall(p.0.clone()));234 };235 out.insert(p.0.clone(), LazyVal::new_resolved(val));236 }237238 Ok(body_ctx.unwrap_or(ctx).extend(out, None, None, None))239}240241#[macro_export]242macro_rules! parse_args {243 ($ctx: expr, $fn_name: expr, $args: expr, $total_args: expr, [244 $($id: expr, $name: ident: $ty: expr $(=>$match: path)?);+ $(;)?245 ], $handler:block) => {{246 use $crate::{error::Error::*, throw, evaluate, push_frame, typed::CheckType};247248 let args = $args;249 if args.unnamed.len() + args.named.len() > $total_args {250 throw!(TooManyArgsFunctionHas($total_args));251 }252 $(253 if args.unnamed.len() + args.named.len() <= $id {254 throw!(FunctionParameterNotBoundInCall(stringify!($name).into()));255 }256 // Is named257 let $name = if $id >= $args.unnamed.len() {258 let named = &args.named[$id - $args.unnamed.len()];259 if &named.0 != stringify!($name) {260 throw!(IntrinsicArgumentReorderingIsNotSupportedYet);261 }262 &named.1263 } else {264 &$args.unnamed[$id]265 };266 let $name = push_frame(None, || format!("evaluating argument"), || {267 let value = evaluate($ctx.clone(), &$name)?;268 $ty.check(&value)?;269 Ok(value)270 })?;271 $(272 let $name = if let $match(v) = $name {273 v274 } else {275 unreachable!();276 };277 )?278 )+279 ($handler as crate::Result<_>)280 }};281}crates/jrsonnet-evaluator/src/lib.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/lib.rs
+++ b/crates/jrsonnet-evaluator/src/lib.rs
@@ -40,7 +40,7 @@
path::{Path, PathBuf},
rc::Rc,
};
-use trace::{offset_to_location, CodeLocation, CompactFormat, TraceFormat};
+use trace::{location_to_offset, offset_to_location, CodeLocation, CompactFormat, TraceFormat};
pub use val::*;
pub trait Bindable: Trace {
@@ -109,6 +109,10 @@
struct EvaluationData {
/// Used for stack overflow detection, stacktrace is populated on unwind
stack_depth: usize,
+ /// Updated every time stack entry is popt
+ stack_generation: usize,
+
+ breakpoints: Breakpoints,
/// Contains file source codes and evaluation results for imports and pretty-printed stacktraces
files: HashMap<Rc<Path>, FileData>,
str_files: HashMap<Rc<Path>, IStr>,
@@ -119,6 +123,38 @@
parsed: LocExpr,
evaluated: Option<Val>,
}
+
+pub struct Breakpoint {
+ loc: ExprLocation,
+ collected: RefCell<HashMap<usize, (usize, Vec<Result<Val>>)>>,
+}
+#[derive(Default)]
+struct Breakpoints(Vec<Rc<Breakpoint>>);
+impl Breakpoints {
+ fn insert(
+ &self,
+ stack_depth: usize,
+ stack_generation: usize,
+ loc: &ExprLocation,
+ result: Result<Val>,
+ ) -> Result<Val> {
+ if self.0.is_empty() {
+ return result;
+ }
+ for item in self.0.iter() {
+ if item.loc.belongs_to(loc) {
+ let mut collected = item.collected.borrow_mut();
+ let (depth, vals) = collected.entry(stack_generation).or_default();
+ if stack_depth > *depth {
+ vals.clear();
+ }
+ vals.push(result.clone());
+ }
+ }
+ result
+ }
+}
+
#[derive(Default)]
pub struct EvaluationStateInternals {
/// Internal state
@@ -135,7 +171,7 @@
pub(crate) fn with_state<T>(f: impl FnOnce(&EvaluationState) -> T) -> T {
EVAL_STATE.with(|s| f(s.borrow().as_ref().unwrap()))
}
-pub(crate) fn push<T>(
+pub(crate) fn push_frame<T>(
e: Option<&ExprLocation>,
frame_desc: impl FnOnce() -> String,
f: impl FnOnce() -> Result<T>,
@@ -143,12 +179,12 @@
with_state(|s| s.push(e, frame_desc, f))
}
-pub fn push_stack_frame<T>(
+pub(crate) fn push_val_frame(
e: Option<&ExprLocation>,
frame_desc: impl FnOnce() -> String,
- f: impl FnOnce() -> Result<T>,
-) -> Result<T> {
- push(e, frame_desc, f)
+ f: impl FnOnce() -> Result<Val>,
+) -> Result<Val> {
+ with_state(|s| s.push(e, frame_desc, f))
}
/// Maintains stack trace and import resolution
@@ -178,6 +214,15 @@
Ok(())
}
+ pub fn reset_evaluation_state(&self, name: &Path) {
+ self.data_mut()
+ .files
+ .get_mut(name)
+ .unwrap()
+ .evaluated
+ .take();
+ }
+
/// Adds file by source code and parsed expr
pub fn add_parsed_file(
&self,
@@ -203,8 +248,15 @@
pub fn map_source_locations(&self, file: &Path, locs: &[usize]) -> Vec<CodeLocation> {
offset_to_location(&self.get_source(file).unwrap(), locs)
}
-
- pub(crate) fn import_file(&self, from: &Path, path: &Path) -> Result<Val> {
+ pub fn map_from_source_location(
+ &self,
+ file: &Path,
+ line: usize,
+ column: usize,
+ ) -> Option<usize> {
+ location_to_offset(&self.get_source(file).unwrap(), line, column)
+ }
+ pub fn import_file(&self, from: &Path, path: &Path) -> Result<Val> {
let file_path = self.resolve_file(from, path)?;
{
let data = self.data();
@@ -297,7 +349,54 @@
}
}
let result = f();
- self.data_mut().stack_depth -= 1;
+ {
+ let mut data = self.data_mut();
+ data.stack_depth -= 1;
+ data.stack_generation += 1;
+ // if let Some(e) = e {
+ // result =
+ // data.breakpoints
+ // .insert(data.stack_depth, data.stack_generation, &e, result)
+ // }
+ }
+ if let Err(mut err) = result {
+ err.trace_mut().0.push(StackTraceElement {
+ location: e.cloned(),
+ desc: frame_desc(),
+ });
+ return Err(err);
+ }
+ result
+ }
+ /// Executes code creating a new stack frame
+ pub fn push_val(
+ &self,
+ e: Option<&ExprLocation>,
+ frame_desc: impl FnOnce() -> String,
+ f: impl FnOnce() -> Result<Val>,
+ ) -> Result<Val> {
+ {
+ let mut data = self.data_mut();
+ let stack_depth = &mut data.stack_depth;
+ if *stack_depth > self.max_stack() {
+ // Error creation uses data, so i drop guard here
+ drop(data);
+ throw!(StackOverflow);
+ } else {
+ *stack_depth += 1;
+ }
+ }
+ let mut result = f();
+ {
+ let mut data = self.data_mut();
+ data.stack_depth -= 1;
+ data.stack_generation += 1;
+ if let Some(e) = e {
+ result =
+ data.breakpoints
+ .insert(data.stack_depth, data.stack_generation, &e, result)
+ }
+ }
if let Err(mut err) = result {
err.trace_mut().0.push(StackTraceElement {
location: e.cloned(),
@@ -322,7 +421,26 @@
result
})
}
+ pub fn run_in_state_with_breakpoint(
+ &self,
+ bp: Rc<Breakpoint>,
+ f: impl FnOnce() -> Result<()>,
+ ) -> Result<()> {
+ {
+ let mut data = self.data_mut();
+ data.breakpoints.0.push(bp);
+ }
+
+ let result = self.run_in_state(f);
+ {
+ let mut data = self.data_mut();
+ data.breakpoints.0.pop();
+ }
+
+ result
+ }
+
pub fn stringify_err(&self, e: &LocError) -> String {
let mut out = String::new();
self.settings()
@@ -346,7 +464,7 @@
pub fn with_tla(&self, val: Val) -> Result<Val> {
self.run_in_state(|| {
Ok(match val {
- Val::Func(func) => push(
+ Val::Func(func) => push_frame(
None,
|| "during TLA call".to_owned(),
|| {
@@ -514,7 +632,7 @@
|| "inner".to_owned(),
|| Err(RuntimeError("".into()).into()),
)?;
- Ok(())
+ Ok(Val::Null)
},
)
.unwrap();
crates/jrsonnet-evaluator/src/trace/location.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/trace/location.rs
+++ b/crates/jrsonnet-evaluator/src/trace/location.rs
@@ -9,6 +9,18 @@
pub line_end_offset: usize,
}
+pub fn location_to_offset(mut file: &str, mut line: usize, column: usize) -> Option<usize> {
+ let mut offset = 0;
+ while line > 1 {
+ let pos = file.find('\n')?;
+ offset += pos + 1;
+ file = &file[pos + 1..];
+ line -= 1;
+ }
+ offset += column - 1;
+ Some(offset)
+}
+
pub fn offset_to_location(file: &str, offsets: &[usize]) -> Vec<CodeLocation> {
if offsets.is_empty() {
return vec![];
crates/jrsonnet-evaluator/src/typed.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/typed.rs
+++ b/crates/jrsonnet-evaluator/src/typed.rs
@@ -2,7 +2,7 @@
use crate::{
error::{Error, LocError, Result},
- push, Val,
+ push_frame, Val,
};
use jrsonnet_gc::Trace;
use jrsonnet_parser::ExprLocation;
@@ -103,7 +103,7 @@
path: impl Fn() -> ValuePathItem,
item: impl Fn() -> Result<()>,
) -> Result<()> {
- push(location, error_reason, || match item() {
+ push_frame(location, error_reason, || match item() {
Ok(_) => Ok(()),
Err(mut e) => {
if let Error::TypeError(e) = &mut e.error_mut() {
crates/jrsonnet-parser/src/expr.rsdiffbeforeafterboth--- a/crates/jrsonnet-parser/src/expr.rs
+++ b/crates/jrsonnet-parser/src/expr.rs
@@ -356,6 +356,11 @@
#[derive(Clone, PartialEq, Trace)]
#[trivially_drop]
pub struct ExprLocation(pub Rc<Path>, pub usize, pub usize);
+impl ExprLocation {
+ pub fn belongs_to(&self, other: &ExprLocation) -> bool {
+ other.0 == self.0 && other.1 <= self.1 && other.2 >= self.2
+ }
+}
impl Debug for ExprLocation {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {