difftreelog
refactor only keep used spans in IR
in: master
12 files changed
Cargo.lockdiffbeforeafterboth--- a/Cargo.lock
+++ b/Cargo.lock
@@ -730,6 +730,7 @@
version = "0.5.0-pre97"
dependencies = [
"insta",
+ "jrsonnet-gcmodule",
"jrsonnet-ir",
"peg",
]
crates/jrsonnet-evaluator/src/arr/mod.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/arr/mod.rs
+++ b/crates/jrsonnet-evaluator/src/arr/mod.rs
@@ -38,7 +38,7 @@
Self::new(RangeArray::empty())
}
- pub fn expr(ctx: Context, exprs: Rc<Vec<Spanned<Expr>>>) -> Self {
+ pub fn expr(ctx: Context, exprs: Rc<Vec<Expr>>) -> Self {
Self::new(ExprArray::new(ctx, exprs))
}
crates/jrsonnet-evaluator/src/arr/spec.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/arr/spec.rs
+++ b/crates/jrsonnet-evaluator/src/arr/spec.rs
@@ -118,11 +118,11 @@
#[derive(Debug, Trace, Clone)]
pub struct ExprArray {
ctx: Context,
- src: Rc<Vec<Spanned<Expr>>>,
+ src: Rc<Vec<Expr>>,
cached: Cc<RefCell<Vec<ArrayThunk>>>,
}
impl ExprArray {
- pub fn new(ctx: Context, src: Rc<Vec<Spanned<Expr>>>) -> Self {
+ pub fn new(ctx: Context, src: Rc<Vec<Expr>>) -> Self {
Self {
ctx,
cached: Cc::new(RefCell::new(vec![ArrayThunk::Waiting; src.len()])),
crates/jrsonnet-evaluator/src/async_import.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/async_import.rs
+++ b/crates/jrsonnet-evaluator/src/async_import.rs
@@ -139,7 +139,7 @@
if let Expr::Str(s) = &***v {
out.0.push(Import {
path: ResolvePathOwned::Str(s.to_string()),
- expression: matches!(&**expr, Expr::Import(ImportKind::Normal, _)),
+ expression: todo!(),
});
}
// Non-string import will fail in runtime
crates/jrsonnet-evaluator/src/evaluate/mod.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/evaluate/mod.rs
+++ b/crates/jrsonnet-evaluator/src/evaluate/mod.rs
@@ -53,7 +53,7 @@
Expr::Str(_)
| Expr::Num(_)
| Expr::Literal(LiteralType::False | LiteralType::True | LiteralType::Null) => true,
- Expr::Arr(a) => a.iter().all(|e| is_trivial(&**e)),
+ Expr::Arr(a) => a.iter().all(|e| is_trivial(&*e)),
_ => false,
}
}
@@ -71,7 +71,7 @@
}
Val::Arr(ArrValue::eager(
n.iter()
- .map(|e| evaluate_trivial(&**e))
+ .map(|e| evaluate_trivial(&*e))
.map(|e| e.expect("checked trivial"))
.collect(),
))
@@ -80,12 +80,7 @@
})
}
-pub fn evaluate_method(
- ctx: Context,
- name: IStr,
- params: ExprParams,
- body: Rc<Spanned<Expr>>,
-) -> Val {
+pub fn evaluate_method(ctx: Context, name: IStr, params: ExprParams, body: Rc<Expr>) -> Val {
Val::Func(FuncVal::Normal(Cc::new(FuncDesc {
name,
ctx,
@@ -97,18 +92,21 @@
pub fn evaluate_field_name(ctx: Context, field_name: &FieldName) -> Result<Option<IStr>> {
Ok(match field_name {
FieldName::Fixed(n) => Some(n.clone()),
- FieldName::Dyn(expr) => in_frame(
- CallLocation::new(&expr.span()),
- || "evaluating field name".to_string(),
- || {
- let value = evaluate(ctx, expr)?;
- if matches!(value, Val::Null) {
- Ok(None)
- } else {
- Ok(Some(IStr::from_untyped(value)?))
- }
- },
- )?,
+ FieldName::Dyn(expr) => {
+ // FIXME: Span
+ let value = evaluate(ctx, expr)?;
+ if matches!(value, Val::Null) {
+ None
+ } else {
+ Some(IStr::from_untyped(value)?)
+ }
+ } //
+ // in_frame(
+ // CallLocation::new(&expr.span()),
+ // || "evaluating field name".to_string(),
+ // || {
+ // },
+ // )?,
})
}
@@ -119,46 +117,48 @@
) -> Result<()> {
match specs.first() {
None => callback(ctx)?,
- Some(CompSpec::IfSpec(IfSpecData(cond))) => {
+ Some(CompSpec::IfSpec(Spanned(IfSpecData(cond), _))) => {
if bool::from_untyped(evaluate(ctx.clone(), cond)?)? {
evaluate_comp(ctx, &specs[1..], callback)?;
}
}
- Some(CompSpec::ForSpec(ForSpecData(var, expr))) => match evaluate(ctx.clone(), expr)? {
- Val::Arr(list) => {
- for item in list.iter_lazy() {
- let fctx = Pending::new();
- let mut new_bindings = FxHashMap::with_capacity(var.binds_len());
- destruct(var, item, fctx.clone(), &mut new_bindings)?;
- let ctx = ctx.clone().extend_bindings(new_bindings).into_future(fctx);
+ Some(CompSpec::ForSpec(Spanned(ForSpecData(var, expr), _))) => {
+ match evaluate(ctx.clone(), expr)? {
+ Val::Arr(list) => {
+ for item in list.iter_lazy() {
+ let fctx = Pending::new();
+ let mut new_bindings = FxHashMap::with_capacity(var.binds_len());
+ destruct(var, item, fctx.clone(), &mut new_bindings)?;
+ let ctx = ctx.clone().extend_bindings(new_bindings).into_future(fctx);
- evaluate_comp(ctx, &specs[1..], callback)?;
+ evaluate_comp(ctx, &specs[1..], callback)?;
+ }
}
- }
- #[cfg(feature = "exp-object-iteration")]
- Val::Obj(obj) => {
- for field in obj.fields(
- // TODO: Should there be ability to preserve iteration order?
- #[cfg(feature = "exp-preserve-order")]
- false,
- ) {
- let fctx = Pending::new();
- let mut new_bindings = FxHashMap::with_capacity(var.binds_len());
- let obj = obj.clone();
- let value = Thunk::evaluated(Val::Arr(ArrValue::lazy(vec![
- Thunk::evaluated(Val::string(field.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.clone().extend_bindings(new_bindings).into_future(fctx);
+ #[cfg(feature = "exp-object-iteration")]
+ Val::Obj(obj) => {
+ for field in obj.fields(
+ // TODO: Should there be ability to preserve iteration order?
+ #[cfg(feature = "exp-preserve-order")]
+ false,
+ ) {
+ let fctx = Pending::new();
+ let mut new_bindings = FxHashMap::with_capacity(var.binds_len());
+ let obj = obj.clone();
+ let value = Thunk::evaluated(Val::Arr(ArrValue::lazy(vec![
+ Thunk::evaluated(Val::string(field.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.clone().extend_bindings(new_bindings).into_future(fctx);
- evaluate_comp(ctx, &specs[1..], callback)?;
+ evaluate_comp(ctx, &specs[1..], callback)?;
+ }
}
+ _ => bail!(InComprehensionCanOnlyIterateOverArray),
}
- _ => bail!(InComprehensionCanOnlyIterateOverArray),
- },
+ }
}
Ok(())
}
@@ -221,7 +221,7 @@
#[derive(Trace)]
struct UnboundValue<B: Trace> {
uctx: B,
- value: Rc<Spanned<Expr>>,
+ value: Rc<Expr>,
name: IStr,
}
impl<B: Unbound<Bound = Context>> Unbound for UnboundValue<B> {
@@ -235,7 +235,8 @@
.field(name.clone())
.with_add(*plus)
.with_visibility(*visibility)
- .with_location(value.span())
+ // FIXME
+ // .with_location(value.span())
.bindable(UnboundValue {
uctx,
value: value.clone(),
@@ -251,7 +252,7 @@
#[derive(Trace)]
struct UnboundMethod<B: Trace> {
uctx: B,
- value: Rc<Spanned<Expr>>,
+ value: Rc<Expr>,
params: ExprParams,
name: IStr,
}
@@ -270,7 +271,7 @@
builder
.field(name.clone())
.with_visibility(*visibility)
- .with_location(value.span())
+ // .with_location(value.span())
.bindable(UnboundMethod {
uctx,
value: value.clone(),
@@ -337,7 +338,7 @@
pub fn evaluate_apply(
ctx: Context,
- value: &Spanned<Expr>,
+ value: &Expr,
args: &ArgsDesc,
loc: CallLocation<'_>,
tailstrict: bool,
@@ -379,16 +380,16 @@
Ok(())
}
-pub fn evaluate_named_param(ctx: Context, expr: &Spanned<Expr>, name: ParamName) -> Result<Val> {
+pub fn evaluate_named_param(ctx: Context, expr: &Expr, name: ParamName) -> Result<Val> {
match name {
ParamName::Named(name) => evaluate_named(ctx, expr, name),
ParamName::Unnamed => evaluate(ctx, expr),
}
}
-pub fn evaluate_named(ctx: Context, expr: &Spanned<Expr>, name: IStr) -> Result<Val> {
+pub fn evaluate_named(ctx: Context, expr: &Expr, name: IStr) -> Result<Val> {
use Expr::*;
- Ok(match &**expr {
+ Ok(match &*expr {
Function(params, body) => evaluate_method(ctx, name, params.clone(), body.clone()),
_ => evaluate(ctx, expr)?,
})
@@ -417,7 +418,7 @@
// because the standalone super literal is not supported, that is because in other
// implementations `in super` treated differently from `in smth_else`.
BinaryOp(bin)
- if matches!(&*bin.rhs, Expr::Literal(LiteralType::Super))
+ if matches!(&bin.rhs, Expr::Literal(LiteralType::Super))
&& bin.op == BinaryOpType::In =>
{
let sup_this = ctx.try_sup_this()?;
@@ -433,12 +434,12 @@
UnaryOp(o, v) => evaluate_unary_op(*o, &evaluate(ctx, v)?)?,
Var(name) => in_frame(
CallLocation::new(&name.span()),
- || format!("local <{name}> access"),
+ || format!("local <{}> access", &**name),
|| ctx.binding((**name).clone())?.evaluate(),
)?,
Index { indexable, parts } => ensure_sufficient_stack(|| {
let mut parts = parts.iter();
- let mut indexable = if matches!(&***indexable, Expr::Literal(LiteralType::Super)) {
+ let mut indexable = if matches!(&**indexable, Expr::Literal(LiteralType::Super)) {
let part = parts.next().expect("at least part should exist");
// sup_this existence check might also be skipped here for null-coalesce...
// But I believe this might cause errors.
@@ -463,7 +464,7 @@
let name = name.into_flat();
match sup_this
.get_super(name.clone())
- .with_description_src(&part.value, || format!("field <{name}> access"))?
+ .with_description_src(&part.span, || format!("field <{name}> access"))?
{
Some(v) => v,
#[cfg(feature = "exp-null-coaelse")]
@@ -485,7 +486,7 @@
indexable = match (indexable, evaluate(ctx.clone(), &part.value)?) {
(Val::Obj(v), Val::Str(key)) => match v
.get(key.clone().into_flat())
- .with_description_src(&part.value, || format!("field <{key}> access"))?
+ .with_description_src(&part.span, || format!("field <{key}> access"))?
{
Some(v) => v,
#[cfg(feature = "exp-null-coaelse")]
@@ -497,7 +498,7 @@
key.clone().into_flat(),
suggestions,
)))
- .with_description_src(&part.value, || format!("field <{key}> access"));
+ .with_description_src(&part.span, || format!("field <{key}> access"));
}
},
(Val::Obj(_), n) => bail!(ValueIndexMustBeTypeGot(
@@ -605,17 +606,21 @@
evaluate_assert(ctx.clone(), &assert.assert)?;
evaluate(ctx, &assert.rest)?
}
- ErrorStmt(e) => in_frame(
- CallLocation::new(&e.span()),
+ ErrorStmt(s, e) => in_frame(
+ CallLocation::new(&s),
|| "error statement".to_owned(),
|| bail!(RuntimeError(evaluate(ctx, e)?.to_string()?,)),
)?,
IfElse(if_else) => {
- if in_frame(
- CallLocation::new(&if_else.cond.0.span()),
- || "if condition".to_owned(),
- || bool::from_untyped(evaluate(ctx.clone(), &if_else.cond.0)?),
- )? {
+ if
+ // FIXME
+ //in_frame(
+ // CallLocation::new(&if_else.cond.0.span()),
+ // || "if condition".to_owned(),
+ // ||
+ bool::from_untyped(evaluate(ctx.clone(), &if_else.cond.0)?)?
+ // )?
+ {
evaluate(ctx, &if_else.cond_then)?
} else {
match &if_else.cond_else {
@@ -626,14 +631,13 @@
}
Slice(slice) => {
fn parse_idx<T: Typed + FromUntyped>(
- loc: CallLocation<'_>,
ctx: Context,
expr: Option<&Spanned<Expr>>,
desc: &'static str,
) -> Result<Option<T>> {
if let Some(value) = expr {
Ok(in_frame(
- loc,
+ CallLocation::new(&value.span()),
|| format!("slice {desc}"),
|| <Option<T>>::from_untyped(evaluate(ctx, value)?),
)?)
@@ -643,24 +647,23 @@
}
let indexable = evaluate(ctx.clone(), &slice.value)?;
- let loc = CallLocation::new(&loc);
- let start = parse_idx(loc, ctx.clone(), slice.slice.start.as_ref(), "start")?;
- let end = parse_idx(loc, ctx.clone(), slice.slice.end.as_ref(), "end")?;
- let step = parse_idx(loc, ctx, slice.slice.step.as_ref(), "step")?;
+ let start = parse_idx(ctx.clone(), slice.slice.start.as_ref(), "start")?;
+ let end = parse_idx(ctx.clone(), slice.slice.end.as_ref(), "end")?;
+ let step = parse_idx(ctx, slice.slice.step.as_ref(), "step")?;
IndexableVal::into_untyped(indexable.into_indexable()?.slice(start, end, step)?)?
}
Import(kind, path) => {
- let Expr::Str(path) = &***path else {
+ let Expr::Str(path) = &**path else {
bail!("computed imports are not supported")
};
- let tmp = loc.clone().0;
with_state(|s| {
- let resolved_path = s.resolve_from(tmp.source_path(), path)?;
- Ok(match kind {
+ let span = kind.span();
+ let resolved_path = s.resolve_from(span.0.source_path(), path)?;
+ Ok(match &**kind {
ImportKind::Normal => in_frame(
- CallLocation::new(&loc),
+ CallLocation::new(&span),
|| format!("import {:?}", path.clone()),
|| s.import_resolved(resolved_path),
)?,
crates/jrsonnet-evaluator/src/evaluate/operator.rsdiffbeforeafterboth1use std::cmp::Ordering;23use jrsonnet_ir::{BinaryOpType, Expr, Spanned, UnaryOpType};45use crate::{6 arr::ArrValue,7 bail,8 error::ErrorKind::*,9 evaluate,10 stdlib::std_format,11 typed::IntoUntyped as _,12 val::{equals, StrValue},13 Context, Result, Val,14};1516pub fn evaluate_unary_op(op: UnaryOpType, b: &Val) -> Result<Val> {17 use UnaryOpType::*;18 use Val::*;19 Ok(match (op, b) {20 (Plus, Num(n)) => Val::Num(*n),21 (Minus, Num(n)) => Val::try_num(-n.get())?,22 (Not, Bool(v)) => Bool(!v),23 (BitNot, Num(n)) => Val::try_num(!(n.get() as i64) as f64)?,24 (op, o) => bail!(UnaryOperatorDoesNotOperateOnType(op, o.value_type())),25 })26}2728pub fn evaluate_add_op(a: &Val, b: &Val) -> Result<Val> {29 use Val::*;30 Ok(match (a, b) {31 (Str(v1), Str(v2)) => Str(StrValue::concat(v1.clone(), v2.clone())),3233 (Num(a), Str(b)) => Val::string(format!("{a}{b}")),34 (Str(a), Num(b)) => Val::string(format!("{a}{b}")),3536 (Str(a), o) | (o, Str(a)) if a.is_empty() => Val::string(o.clone().to_string()?),37 (Str(a), o) => Val::string(format!("{a}{}", o.clone().to_string()?)),38 (o, Str(a)) => Val::string(format!("{}{a}", o.clone().to_string()?)),3940 (Obj(v1), Obj(v2)) => Obj(v2.extend_from(v1.clone())),41 (Arr(a), Arr(b)) => Val::Arr(ArrValue::extended(a.clone(), b.clone())),4243 (Num(v1), Num(v2)) => Val::try_num(v1.get() + v2.get())?,4445 #[cfg(feature = "exp-bigint")]46 (BigInt(a), BigInt(b)) => BigInt(Box::new(&**a + &**b)),4748 _ => bail!(BinaryOperatorDoesNotOperateOnValues(49 BinaryOpType::Add,50 a.value_type(),51 b.value_type(),52 )),53 })54}5556pub fn evaluate_sub_op(a: &Val, b: &Val) -> Result<Val> {57 use Val::*;58 Ok(match (a, b) {59 (Num(v1), Num(v2)) => Val::try_num(v1.get() - v2.get())?,6061 #[cfg(feature = "exp-bigint")]62 (BigInt(a), BigInt(b)) => BigInt(Box::new(&**a - &**b)),6364 // TODO: Support objects and arrays65 _ => bail!(BinaryOperatorDoesNotOperateOnValues(66 BinaryOpType::Sub,67 a.value_type(),68 b.value_type(),69 )),70 })71}7273pub fn evaluate_mul_op(a: &Val, b: &Val) -> Result<Val> {74 use Val::*;75 Ok(match (a, b) {76 (Str(s), Num(c)) => Val::string(s.to_string().repeat(c.get() as usize)),77 (Num(c), Str(s)) => Val::string(s.to_string().repeat(c.get() as usize)),7879 (Num(v1), Num(v2)) => Val::try_num(v1.get() * v2.get())?,8081 #[cfg(feature = "exp-bigint")]82 (BigInt(a), BigInt(b)) => BigInt(Box::new(&**a * &**b)),8384 _ => bail!(BinaryOperatorDoesNotOperateOnValues(85 BinaryOpType::Mul,86 a.value_type(),87 b.value_type(),88 )),89 })90}9192fn is_attempt_to_divide_by_zero(a: &Val, b: &Val) -> bool {93 use Val::*;94 match (a, b) {95 // string format96 (Str(_), _) => false,9798 (_, Num(b)) => **b == 0.,99 #[cfg(feature = "exp-bigint")]100 (_, BigInt(b)) => **b == num_bigint::BigInt::ZERO,101102 // something else103 _ => false,104 }105}106107pub fn evaluate_div_op(a: &Val, b: &Val) -> Result<Val> {108 use Val::*;109110 if is_attempt_to_divide_by_zero(a, b) {111 bail!(DivisionByZero);112 }113114 Ok(match (a, b) {115 (Num(a), Num(b)) => Val::try_num(a.get() / b.get())?,116 #[cfg(feature = "exp-bigint")]117 (BigInt(a), BigInt(b)) => BigInt(Box::new(&**a / &**b)),118 (a, b) => bail!(BinaryOperatorDoesNotOperateOnValues(119 BinaryOpType::Div,120 a.value_type(),121 b.value_type()122 )),123 })124}125126pub fn evaluate_mod_op(a: &Val, b: &Val) -> Result<Val> {127 use Val::*;128129 if is_attempt_to_divide_by_zero(a, b) {130 bail!(DivisionByZero);131 }132133 Ok(match (a, b) {134 (Num(a), Num(b)) => Val::try_num(a.get() % b.get())?,135 #[cfg(feature = "exp-bigint")]136 (BigInt(a), BigInt(b)) => BigInt(Box::new(&**a % &**b)),137 (Str(str), vals) => {138 String::into_untyped(std_format(&str.clone().into_flat(), vals.clone())?)?139 }140 (a, b) => bail!(BinaryOperatorDoesNotOperateOnValues(141 BinaryOpType::Mod,142 a.value_type(),143 b.value_type()144 )),145 })146}147148pub fn evaluate_binary_op_special(149 ctx: Context,150 a: &Spanned<Expr>,151 op: BinaryOpType,152 b: &Spanned<Expr>,153) -> Result<Val> {154 use BinaryOpType::*;155 use Val::*;156 Ok(match (evaluate(ctx.clone(), a)?, op, b) {157 (Bool(true), Or, _o) => Val::Bool(true),158 (Bool(false), And, _o) => Val::Bool(false),159 #[cfg(feature = "exp-null-coaelse")]160 (Null, NullCoaelse, eb) => evaluate(ctx, eb)?,161 #[cfg(feature = "exp-null-coaelse")]162 (a, NullCoaelse, _o) => a,163 (a, op, eb) => evaluate_binary_op_normal(&a, op, &evaluate(ctx, eb)?)?,164 })165}166167pub fn evaluate_compare_op(a: &Val, b: &Val, op: BinaryOpType) -> Result<Ordering> {168 use Val::*;169 Ok(match (a, b) {170 (Str(a), Str(b)) => a.cmp(b),171172 (Num(a), Num(b)) => a.cmp(b),173174 #[cfg(feature = "exp-bigint")]175 (BigInt(a), BigInt(b)) => a.cmp(b),176177 (Arr(a), Arr(b)) => {178 let ai = a.iter();179 let bi = b.iter();180181 for (a, b) in ai.zip(bi) {182 let ord = evaluate_compare_op(&a?, &b?, op)?;183 if !ord.is_eq() {184 return Ok(ord);185 }186 }187 a.len().cmp(&b.len())188 }189 (_, _) => bail!(BinaryOperatorDoesNotOperateOnValues(190 op,191 a.value_type(),192 b.value_type()193 )),194 })195}196197pub fn evaluate_binary_op_normal(a: &Val, op: BinaryOpType, b: &Val) -> Result<Val> {198 use BinaryOpType::*;199 use Val::*;200 Ok(match (a, op, b) {201 (a, Eq, b) => Bool(equals(a, b)?),202 (a, Neq, b) => Bool(!equals(a, b)?),203204 (a, Lt, b) => Bool(evaluate_compare_op(a, b, Lt)?.is_lt()),205 (a, Gt, b) => Bool(evaluate_compare_op(a, b, Gt)?.is_gt()),206 (a, Lte, b) => Bool(evaluate_compare_op(a, b, Lte)?.is_le()),207 (a, Gte, b) => Bool(evaluate_compare_op(a, b, Gte)?.is_ge()),208209 (Str(a), In, Obj(obj)) => Bool(obj.has_field_ex(a.clone().into_flat(), true)),210211 // Bool X Bool212 (Bool(a), And, Bool(b)) => Bool(*a && *b),213 (Bool(a), Or, Bool(b)) => Bool(*a || *b),214215 (a, Add, b) => evaluate_add_op(a, b)?,216 (a, Sub, b) => evaluate_sub_op(a, b)?,217 (a, Mul, b) => evaluate_mul_op(a, b)?,218 (a, Div, b) => evaluate_div_op(a, b)?,219 (a, Mod, b) => evaluate_mod_op(a, b)?,220221 (Num(v1), BitAnd, Num(v2)) => {222 Val::try_num((v1.truncate_for_bitwise()? & v2.truncate_for_bitwise()?) as f64)?223 }224 (Num(v1), BitOr, Num(v2)) => {225 Val::try_num((v1.truncate_for_bitwise()? | v2.truncate_for_bitwise()?) as f64)?226 }227 (Num(v1), BitXor, Num(v2)) => {228 Val::try_num((v1.truncate_for_bitwise()? ^ v2.truncate_for_bitwise()?) as f64)?229 }230 (Num(v1), Lhs, Num(v2)) => {231 if v2.get() < 0.0 {232 bail!("shift by negative exponent")233 }234 let base = v1.truncate_for_bitwise()?;235 let exp = v2.truncate_for_bitwise()? % 64;236237 if exp >= 1 && base >= (1i64 << (63 - exp as u32)) {238 bail!("left shift would overflow")239 }240 Val::try_num(base.wrapping_shl(exp as u32) as f64)?241 }242 (Num(v1), Rhs, Num(v2)) => {243 if v2.get() < 0.0 {244 bail!("shift by negative exponent")245 }246 let exp = ((v2.get() as i64) & 63) as u32;247 Val::try_num(v1.truncate_for_bitwise()?.wrapping_shr(exp) as f64)?248 }249250 // Bigint X Bigint251 _ => bail!(BinaryOperatorDoesNotOperateOnValues(252 op,253 a.value_type(),254 b.value_type(),255 )),256 })257}crates/jrsonnet-evaluator/src/function/mod.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/function/mod.rs
+++ b/crates/jrsonnet-evaluator/src/function/mod.rs
@@ -3,8 +3,8 @@
use educe::Educe;
use jrsonnet_gcmodule::{Cc, Trace};
use jrsonnet_interner::IStr;
+use jrsonnet_ir::{ArgsDesc, Destruct, Expr, ExprParams, Span, Spanned};
pub use jrsonnet_macros::builtin;
-use jrsonnet_ir::{ArgsDesc, Destruct, Expr, ExprParams, Span, Spanned};
use self::{
builtin::{Builtin, StaticBuiltin},
@@ -71,7 +71,7 @@
/// Function parameter definition
pub params: ExprParams,
/// Function body
- pub body: Rc<Spanned<Expr>>,
+ pub body: Rc<Expr>,
}
impl FuncDesc {
/// Create body context, but fill arguments without defaults with lazy error
@@ -256,7 +256,7 @@
#[cfg(feature = "exp-destruct")]
_ => return false,
};
- **desc.body == Expr::Var(id.clone())
+ matches!(&*desc.body, Expr::Var(v) if &**v == id)
}
_ => false,
}
crates/jrsonnet-evaluator/src/function/parse.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/function/parse.rs
+++ b/crates/jrsonnet-evaluator/src/function/parse.rs
@@ -2,7 +2,7 @@
use jrsonnet_ir::{
function::{FunctionSignature, ParamName},
- ArgsDesc, Expr, ExprParams, Spanned,
+ ArgsDesc, Expr, ExprParams,
};
use rustc_hash::FxHashMap;
@@ -15,7 +15,7 @@
Context, Pending, Thunk, Val,
};
-fn eval_arg(ctx: Context, arg: &Rc<Spanned<Expr>>, tailstrict: bool) -> Result<Thunk<Val>> {
+fn eval_arg(ctx: Context, arg: &Rc<Expr>, tailstrict: bool) -> Result<Thunk<Val>> {
if tailstrict {
Ok(Thunk::evaluated(evaluate(ctx, arg)?))
} else {
crates/jrsonnet-evaluator/src/lib.rsdiffbeforeafterboth--- a/crates/jrsonnet-evaluator/src/lib.rs
+++ b/crates/jrsonnet-evaluator/src/lib.rs
@@ -5,7 +5,7 @@
extern crate self as jrsonnet_evaluator;
mod arr;
-pub mod async_import;
+// pub mod async_import;
mod ctx;
mod dynamic;
pub mod error;
@@ -187,7 +187,7 @@
struct FileData {
string: Option<IStr>,
bytes: Option<IBytes>,
- parsed: Option<Rc<Spanned<Expr>>>,
+ parsed: Option<Rc<Expr>>,
evaluated: Option<Val>,
evaluating: bool,
crates/jrsonnet-ir/src/expr.rsdiffbeforeafterboth--- a/crates/jrsonnet-ir/src/expr.rs
+++ b/crates/jrsonnet-ir/src/expr.rs
@@ -17,7 +17,7 @@
/// {fixed: 2}
Fixed(IStr),
/// {["dyn"+"amic"]: 3}
- Dyn(Spanned<Expr>),
+ Dyn(Expr),
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, Acyclic)]
@@ -46,7 +46,7 @@
pub plus: bool,
pub params: Option<ExprParams>,
pub visibility: Visibility,
- pub value: Rc<Spanned<Expr>>,
+ pub value: Rc<Expr>,
}
#[derive(Debug, PartialEq, Acyclic)]
@@ -152,7 +152,7 @@
#[derive(Debug, PartialEq, Acyclic)]
pub struct ExprParam {
pub destruct: Destruct,
- pub default: Option<Rc<Spanned<Expr>>>,
+ pub default: Option<Rc<Expr>>,
}
/// Defined function parameters
@@ -194,11 +194,11 @@
#[derive(Debug, PartialEq, Acyclic)]
pub struct ArgsDesc {
- pub unnamed: Vec<Rc<Spanned<Expr>>>,
- pub named: Vec<(IStr, Rc<Spanned<Expr>>)>,
+ pub unnamed: Vec<Rc<Expr>>,
+ pub named: Vec<(IStr, Rc<Expr>)>,
}
impl ArgsDesc {
- pub fn new(unnamed: Vec<Rc<Spanned<Expr>>>, named: Vec<(IStr, Rc<Spanned<Expr>>)>) -> Self {
+ pub fn new(unnamed: Vec<Rc<Expr>>, named: Vec<(IStr, Rc<Expr>)>) -> Self {
Self { unnamed, named }
}
}
@@ -277,12 +277,12 @@
pub enum BindSpec {
Field {
into: Destruct,
- value: Rc<Spanned<Expr>>,
+ value: Rc<Expr>,
},
Function {
name: IStr,
params: ExprParams,
- value: Rc<Spanned<Expr>>,
+ value: Rc<Expr>,
},
}
impl BindSpec {
@@ -295,15 +295,15 @@
}
#[derive(Debug, PartialEq, Acyclic)]
-pub struct IfSpecData(pub Spanned<Expr>);
+pub struct IfSpecData(pub Expr);
#[derive(Debug, PartialEq, Acyclic)]
-pub struct ForSpecData(pub Destruct, pub Spanned<Expr>);
+pub struct ForSpecData(pub Destruct, pub Expr);
#[derive(Debug, PartialEq, Acyclic)]
pub enum CompSpec {
- IfSpec(IfSpecData),
- ForSpec(ForSpecData),
+ IfSpec(Spanned<IfSpecData>),
+ ForSpec(Spanned<ForSpecData>),
}
#[derive(Debug, PartialEq, Acyclic)]
@@ -346,14 +346,14 @@
#[derive(Debug, PartialEq, Acyclic)]
pub struct AssertExpr {
pub assert: AssertStmt,
- pub rest: Spanned<Expr>,
+ pub rest: Expr,
}
#[derive(Debug, PartialEq, Acyclic)]
pub struct BinaryOp {
- pub lhs: Spanned<Expr>,
+ pub lhs: Expr,
pub op: BinaryOpType,
- pub rhs: Spanned<Expr>,
+ pub rhs: Expr,
}
#[derive(Debug, PartialEq, Acyclic)]
@@ -366,13 +366,13 @@
#[derive(Debug, PartialEq, Acyclic)]
pub struct IfElse {
pub cond: IfSpecData,
- pub cond_then: Spanned<Expr>,
- pub cond_else: Option<Spanned<Expr>>,
+ pub cond_then: Expr,
+ pub cond_else: Option<Expr>,
}
#[derive(Debug, PartialEq, Acyclic)]
pub struct Slice {
- pub value: Spanned<Expr>,
+ pub value: Expr,
pub slice: SliceDesc,
}
@@ -389,7 +389,7 @@
Var(Spanned<IStr>),
/// Array of expressions: [1, 2, "Hello"]
- Arr(Rc<Vec<Spanned<Expr>>>),
+ Arr(Rc<Vec<Expr>>),
/// Array comprehension:
/// ```jsonnet
/// ingredients: [
@@ -401,35 +401,35 @@
/// ]
/// ],
/// ```
- ArrComp(Rc<Spanned<Expr>>, Vec<CompSpec>),
+ ArrComp(Rc<Expr>, Vec<CompSpec>),
/// Object: {a: 2}
Obj(ObjBody),
/// Object extension: var1 {b: 2}
- ObjExtend(Rc<Spanned<Expr>>, ObjBody),
+ ObjExtend(Rc<Expr>, ObjBody),
/// -2
- UnaryOp(UnaryOpType, Box<Spanned<Expr>>),
+ UnaryOp(UnaryOpType, Box<Expr>),
/// 2 - 2
BinaryOp(Box<BinaryOp>),
/// assert 2 == 2 : "Math is broken"
AssertExpr(Rc<AssertExpr>),
/// local a = 2; { b: a }
- LocalExpr(Vec<BindSpec>, Box<Spanned<Expr>>),
+ LocalExpr(Vec<BindSpec>, Box<Expr>),
/// import* "hello"
- Import(ImportKind, Box<Spanned<Expr>>),
+ Import(Spanned<ImportKind>, Box<Expr>),
/// error "I'm broken"
- ErrorStmt(Box<Spanned<Expr>>),
+ ErrorStmt(Span, Box<Expr>),
/// a(b, c)
- Apply(Box<Spanned<Expr>>, Spanned<ArgsDesc>, bool),
+ Apply(Box<Expr>, Spanned<ArgsDesc>, bool),
/// a[b], a.b, a?.b
Index {
- indexable: Box<Spanned<Expr>>,
+ indexable: Box<Expr>,
parts: Vec<IndexPart>,
},
/// function(x) x
- Function(ExprParams, Rc<Spanned<Expr>>),
+ Function(ExprParams, Rc<Expr>),
/// if true == false then 1 else 2
IfElse(Box<IfElse>),
Slice(Box<Slice>),
@@ -437,7 +437,8 @@
#[derive(Debug, PartialEq, Acyclic)]
pub struct IndexPart {
- pub value: Spanned<Expr>,
+ pub span: Span,
+ pub value: Expr,
#[cfg(feature = "exp-null-coaelse")]
pub null_coaelse: bool,
}
@@ -461,7 +462,7 @@
}
#[derive(Clone, PartialEq, Acyclic)]
-pub struct Spanned<T: Acyclic>(T, Span);
+pub struct Spanned<T: Acyclic>(pub T, pub Span);
impl<T: Acyclic> Deref for Spanned<T> {
type Target = T;
fn deref(&self) -> &Self::Target {
crates/jrsonnet-peg-parser/Cargo.tomldiffbeforeafterboth--- a/crates/jrsonnet-peg-parser/Cargo.toml
+++ b/crates/jrsonnet-peg-parser/Cargo.toml
@@ -7,6 +7,7 @@
version.workspace = true
[dependencies]
+jrsonnet-gcmodule.workspace = true
jrsonnet-ir.workspace = true
peg.workspace = true
crates/jrsonnet-peg-parser/src/lib.rsdiffbeforeafterboth--- a/crates/jrsonnet-peg-parser/src/lib.rs
+++ b/crates/jrsonnet-peg-parser/src/lib.rs
@@ -1,7 +1,9 @@
+use jrsonnet_gcmodule::Acyclic;
use jrsonnet_ir::{
- BinaryOp, Expr, ExprParams, IStr, IndexPart, Member, Slice, SliceDesc, Source, Span, Spanned,
- ExprParam, ArgsDesc, AssertExpr, ImportKind, LiteralType, IfElse, CompSpec, ForSpecData, IfSpecData, ObjMembers, ObjBody,
- ObjComp, FieldMember, Visibility, FieldName, unescape, AssertStmt, BindSpec, Destruct, DestructRest,
+ unescape, ArgsDesc, AssertExpr, AssertStmt, BinaryOp, BindSpec, CompSpec, Destruct,
+ DestructRest, Expr, ExprParam, ExprParams, FieldMember, FieldName, ForSpecData, IStr, IfElse,
+ IfSpecData, ImportKind, IndexPart, LiteralType, Member, ObjBody, ObjComp, ObjMembers, Slice,
+ SliceDesc, Source, Span, Spanned, Visibility,
};
use peg::parser;
use std::rc::Rc;
@@ -63,7 +65,7 @@
= params:param(s) ** comma() comma()? { ExprParams::new(params) }
/ { ExprParams::new(Vec::new()) }
- pub rule arg(s: &ParserSettings) -> (Option<IStr>, Rc<Spanned<Expr>>)
+ pub rule arg(s: &ParserSettings) -> (Option<IStr>, Rc<Expr>)
= name:(quiet! { (s:id() _ "=" !['='] _ {s})? } / expected!("<argument name>")) expr:expr(s) {(name, Rc::new(expr))}
pub rule args(s: &ParserSettings) -> ArgsDesc
@@ -133,7 +135,7 @@
/ name:id() _ "(" _ params:params(s) _ ")" _ "=" _ value:expr(s) {BindSpec::Function{name, params, value: Rc::new(value)}}
pub rule assertion(s: &ParserSettings) -> AssertStmt
- = keyword("assert") _ cond:expr(s) msg:(_ ":" _ e:expr(s) {e})? { AssertStmt(cond, msg) }
+ = keyword("assert") _ cond:spanned(<expr(s)>, s) msg:(_ ":" _ e:spanned(<expr(s)>, s) {e})? { AssertStmt(cond, msg) }
pub rule whole_line() -> &'input str
= str:$((!['\n'][_])* "\n") {str}
@@ -241,7 +243,7 @@
pub rule forspec(s: &ParserSettings) -> ForSpecData
= keyword("for") _ id:destruct(s) _ keyword("in") _ cond:expr(s) {ForSpecData(id, cond)}
rule compspec(s: &ParserSettings) -> CompSpec
- = i:ifspec(s) { CompSpec::IfSpec(i) } / f:forspec(s) {CompSpec::ForSpec(f)}
+ = i:spanned(<ifspec(s)>, s) { CompSpec::IfSpec(i) } / f:spanned(<forspec(s)>, s) {CompSpec::ForSpec(f)}
pub rule compspecs(s: &ParserSettings) -> Vec<CompSpec>
= specs:compspec(s) ++ _ {?
if !matches!(specs[0], CompSpec::ForSpec(_)) {
@@ -267,8 +269,12 @@
} else {
Err("!!!numbers are finite")
}}
+
+ rule spanned<T: Acyclic>(x: rule<T>, s: &ParserSettings) -> Spanned<T>
+ = a:position!() n:x() b:position!() { Spanned::new(n, Span(s.source.clone(), a as u32, b as u32)) }
+
pub rule var_expr(s: &ParserSettings) -> Expr
- = n:id() { Expr::Var(n) }
+ = n:spanned(<id()>, s) { Expr::Var(n) }
pub rule id_loc(s: &ParserSettings) -> Spanned<Expr>
= a:position!() n:id() b:position!() { Spanned::new(Expr::Str(n), Span(s.source.clone(), a as u32,b as u32)) }
pub rule if_then_else_expr(s: &ParserSettings) -> Expr
@@ -302,7 +308,7 @@
/ array_expr(s)
/ array_comp_expr(s)
- / kind:import_kind() _ path:expr(s) {Expr::Import(kind, Box::new(path))}
+ / kind:spanned(<import_kind()>, s) _ path:expr(s) {Expr::Import(kind, Box::new(path))}
/ var_expr(s)
/ local_expr(s)
@@ -313,10 +319,10 @@
assert, rest
})) }
- / keyword("error") _ expr:expr(s) { Expr::ErrorStmt(Box::new(expr)) }
+ / err_kw:spanned(<keyword("error")>, s) _ expr:expr(s) { Expr::ErrorStmt(err_kw.1, Box::new(expr)) }
rule slice_part(s: &ParserSettings) -> Option<Spanned<Expr>>
- = _ e:(e:expr(s) _{e})? {e}
+ = _ e:(e:spanned(<expr(s)>, s) _{e})? {e}
pub rule slice_desc(s: &ParserSettings) -> SliceDesc
= start:slice_part(s) ":" pair:(end:slice_part(s) step:(":" e:slice_part(s){e})? {(end, step.flatten())})? {
let (end, step) = if let Some((end, step)) = pair {
@@ -340,11 +346,8 @@
}
use jrsonnet_ir::BinaryOpType::*;
use jrsonnet_ir::UnaryOpType::*;
- rule expr(s: &ParserSettings) -> Spanned<Expr>
+ rule expr(s: &ParserSettings) -> Expr
= precedence! {
- "(" _ e:expr(s) _ ")" {e}
- start:position!() v:@ end:position!() { Spanned::new(v, Span(s.source.clone(), start as u32, end as u32)) }
- --
a:(@) _ binop(<"||">) _ b:@ {expr_bin!(a Or b)}
a:(@) _ binop(<"??">) _ ensure_null_coaelse() b:@ {
#[cfg(feature = "exp-null-coaelse")] return expr_bin!(a NullCoaelse b);
@@ -385,29 +388,32 @@
--
value:(@) _ "[" _ slice:slice_desc(s) _ "]" {Expr::Slice(Box::new(Slice{value, slice}))}
indexable:(@) _ parts:index_part(s)+ {Expr::Index{indexable: Box::new(indexable), parts}}
- a:(@) _ "(" _ args:args(s) _ ")" ts:(_ keyword("tailstrict"))? {Expr::Apply(Box::new(a), args, ts.is_some())}
+ a:(@) _ args:spanned(<"(" _ a:args(s) _ ")" {a}>, s) ts:(_ keyword("tailstrict"))? {Expr::Apply(Box::new(a), args, ts.is_some())}
a:(@) _ "{" _ body:objinside(s) _ "}" {Expr::ObjExtend(Rc::new(a), body)}
--
e:expr_basic(s) {e}
+ "(" _ e:expr(s) _ ")" {e}
}
pub rule index_part(s: &ParserSettings) -> IndexPart
= n:("?" _ ensure_null_coaelse())? "." _ value:id_loc(s) {IndexPart {
- value,
+ span: value.1,
+ value: value.0,
#[cfg(feature = "exp-null-coaelse")]
null_coaelse: n.is_some(),
}}
- / n:("?" _ "." _ ensure_null_coaelse())? "[" _ value:expr(s) _ "]" {IndexPart {
- value,
+ / n:("?" _ "." _ ensure_null_coaelse())? value:spanned(<"[" _ v:expr(s) _ "]" {v}>, s) {IndexPart {
+ span: value.1,
+ value: value.0,
#[cfg(feature = "exp-null-coaelse")]
null_coaelse: n.is_some(),
}}
- pub rule jsonnet(s: &ParserSettings) -> Spanned<Expr> = _ e:expr(s) _ {e}
+ pub rule jsonnet(s: &ParserSettings) -> Expr = _ e:expr(s) _ {e}
}
}
pub type ParseError = peg::error::ParseError<peg::str::LineCol>;
-pub fn parse(str: &str, settings: &ParserSettings) -> Result<Spanned<Expr>, ParseError> {
+pub fn parse(str: &str, settings: &ParserSettings) -> Result<Expr, ParseError> {
jsonnet_parser::jsonnet(str, settings)
}
/// Used for importstr values