1use std::{2 cell::RefCell,3 fmt::Debug,4 hash::{Hash, Hasher},5 ptr::addr_of,6};78use jrsonnet_gcmodule::{Cc, Trace, Weak};9use jrsonnet_interner::IStr;10use jrsonnet_parser::{ExprLocation, Visibility};11use rustc_hash::FxHashMap;1213use crate::{14 error::{Error::*, LocError},15 function::CallLocation,16 gc::{GcHashMap, GcHashSet, TraceBox},17 operator::evaluate_add_op,18 throw, MaybeUnbound, Result, State, Thunk, Unbound, Val,19};2021#[cfg(not(feature = "exp-preserve-order"))]22mod ordering {23 #![allow(24 25 clippy::unused_self,26 )]2728 use jrsonnet_gcmodule::Trace;2930 #[derive(Clone, Copy, Default, Debug, Trace)]31 pub struct FieldIndex;32 impl FieldIndex {33 pub const fn next(self) -> Self {34 Self35 }36 }3738 #[derive(Clone, Copy, Default, Debug, Trace)]39 pub struct SuperDepth;40 impl SuperDepth {41 pub const fn deeper(self) -> Self {42 Self43 }44 }4546 #[derive(Clone, Copy)]47 pub struct FieldSortKey;48 impl FieldSortKey {49 pub const fn new(_: SuperDepth, _: FieldIndex) -> Self {50 Self51 }52 }53}5455#[cfg(feature = "exp-preserve-order")]56mod ordering {57 use std::cmp::Reverse;5859 use jrsonnet_gcmodule::Trace;6061 #[derive(Clone, Copy, Default, Debug, Trace, PartialEq, Eq, PartialOrd, Ord)]62 pub struct FieldIndex(u32);63 impl FieldIndex {64 pub fn next(self) -> Self {65 Self(self.0 + 1)66 }67 }6869 #[derive(Clone, Copy, Default, PartialEq, Eq, PartialOrd, Ord, Debug)]70 pub struct SuperDepth(u32);71 impl SuperDepth {72 pub fn deeper(self) -> Self {73 Self(self.0 + 1)74 }75 }7677 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Debug)]78 pub struct FieldSortKey(Reverse<SuperDepth>, FieldIndex);79 impl FieldSortKey {80 pub fn new(depth: SuperDepth, index: FieldIndex) -> Self {81 Self(Reverse(depth), index)82 }83 pub fn collide(self, other: Self) -> Self {84 if self.0 .0 > other.0 .0 {85 self86 } else if self.0 .0 < other.0 .0 {87 other88 } else {89 unreachable!("object can't have two fields with same name")90 }91 }92 }93}9495use ordering::*;9697#[allow(clippy::module_name_repetitions)]98#[derive(Debug, Trace)]99pub struct ObjMember {100 pub add: bool,101 pub visibility: Visibility,102 original_index: FieldIndex,103 pub invoke: MaybeUnbound,104 pub location: Option<ExprLocation>,105}106107pub trait ObjectAssertion: Trace {108 fn run(&self, super_obj: Option<ObjValue>, this: Option<ObjValue>) -> Result<()>;109}110111112113#[derive(Trace)]114enum CacheValue {115 Cached(Val),116 NotFound,117 Pending,118 Errored(LocError),119}120121#[allow(clippy::module_name_repetitions)]122#[derive(Trace)]123#[trace(tracking(force))]124pub struct ObjValueInternals {125 sup: Option<ObjValue>,126 this: Option<ObjValue>,127128 assertions: Cc<Vec<TraceBox<dyn ObjectAssertion>>>,129 assertions_ran: RefCell<GcHashSet<ObjValue>>,130 this_entries: Cc<GcHashMap<IStr, ObjMember>>,131 value_cache: RefCell<GcHashMap<IStr, CacheValue>>,132}133134#[derive(Clone, Trace)]135pub struct WeakObjValue(#[trace(skip)] pub(crate) Weak<ObjValueInternals>);136137impl PartialEq for WeakObjValue {138 fn eq(&self, other: &Self) -> bool {139 Weak::ptr_eq(&self.0, &other.0)140 }141}142143impl Eq for WeakObjValue {}144impl Hash for WeakObjValue {145 fn hash<H: Hasher>(&self, hasher: &mut H) {146 147 let addr = unsafe { *std::ptr::addr_of!(self.0).cast() };148 hasher.write_usize(addr);149 }150}151152#[allow(clippy::module_name_repetitions)]153#[derive(Clone, Trace)]154pub struct ObjValue(pub(crate) Cc<ObjValueInternals>);155impl Debug for ObjValue {156 fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {157 if let Some(super_obj) = self.0.sup.as_ref() {158 if f.alternate() {159 write!(f, "{super_obj:#?}")?;160 } else {161 write!(f, "{super_obj:?}")?;162 }163 write!(f, " + ")?;164 }165 let mut debug = f.debug_struct("ObjValue");166 for (name, member) in self.0.this_entries.iter() {167 debug.field(name, member);168 }169 debug.finish_non_exhaustive()170 }171}172173impl ObjValue {174 pub fn new(175 sup: Option<Self>,176 this_entries: Cc<GcHashMap<IStr, ObjMember>>,177 assertions: Cc<Vec<TraceBox<dyn ObjectAssertion>>>,178 ) -> Self {179 Self(Cc::new(ObjValueInternals {180 sup,181 this: None,182 assertions,183 assertions_ran: RefCell::new(GcHashSet::new()),184 this_entries,185 value_cache: RefCell::new(GcHashMap::new()),186 }))187 }188 pub fn new_empty() -> Self {189 Self::new(None, Cc::new(GcHashMap::new()), Cc::new(Vec::new()))190 }191 #[must_use]192 pub fn extend_from(&self, sup: Self) -> Self {193 match &self.0.sup {194 None => Self::new(195 Some(sup),196 self.0.this_entries.clone(),197 self.0.assertions.clone(),198 ),199 Some(v) => Self::new(200 Some(v.extend_from(sup)),201 self.0.this_entries.clone(),202 self.0.assertions.clone(),203 ),204 }205 }206 pub(crate) fn extend_with_raw_member(self, key: IStr, value: ObjMember) -> Self {207 let mut new = GcHashMap::with_capacity(1);208 new.insert(key, value);209 Self::new(Some(self), Cc::new(new), Cc::new(Vec::new()))210 }211 pub fn extend_field(&mut self, name: IStr) -> ObjMemberBuilder<ExtendBuilder<'_>> {212 ObjMemberBuilder::new(ExtendBuilder(self), name, FieldIndex::default())213 }214215 #[must_use]216 pub fn with_this(&self, this: Self) -> Self {217 Self(Cc::new(ObjValueInternals {218 sup: self.0.sup.clone(),219 assertions: self.0.assertions.clone(),220 assertions_ran: RefCell::new(GcHashSet::new()),221 this: Some(this),222 this_entries: self.0.this_entries.clone(),223 value_cache: RefCell::new(GcHashMap::new()),224 }))225 }226227 pub fn len(&self) -> usize {228 self.fields_visibility()229 .into_iter()230 .filter(|(_, (visible, _))| *visible)231 .count()232 }233234 pub fn is_empty(&self) -> bool {235 if !self.0.this_entries.is_empty() {236 return false;237 }238 self.0.sup.as_ref().map_or(true, Self::is_empty)239 }240241 242 243 244 pub(crate) fn enum_fields(245 &self,246 depth: SuperDepth,247 handler: &mut impl FnMut(SuperDepth, &IStr, &ObjMember) -> bool,248 ) -> bool {249 if let Some(s) = &self.0.sup {250 if s.enum_fields(depth.deeper(), handler) {251 return true;252 }253 }254 for (name, member) in self.0.this_entries.iter() {255 if handler(depth, name, member) {256 return true;257 }258 }259 false260 }261262 pub fn fields_visibility(&self) -> FxHashMap<IStr, (bool, FieldSortKey)> {263 let mut out = FxHashMap::default();264 self.enum_fields(SuperDepth::default(), &mut |depth, name, member| {265 let new_sort_key = FieldSortKey::new(depth, member.original_index);266 let entry = out.entry(name.clone());267 let (visible, _) = entry.or_insert((true, new_sort_key));268 match member.visibility {269 Visibility::Normal => {}270 Visibility::Hidden => {271 *visible = false;272 }273 Visibility::Unhide => {274 *visible = true;275 }276 };277 false278 });279 out280 }281 pub fn fields_ex(282 &self,283 include_hidden: bool,284 #[cfg(feature = "exp-preserve-order")] preserve_order: bool,285 ) -> Vec<IStr> {286 #[cfg(feature = "exp-preserve-order")]287 if preserve_order {288 let (mut fields, mut keys): (Vec<_>, Vec<_>) = self289 .fields_visibility()290 .into_iter()291 .filter(|(_, (visible, _))| include_hidden || *visible)292 .enumerate()293 .map(|(idx, (k, (_, sk)))| (k, (sk, idx)))294 .unzip();295 keys.sort_unstable_by_key(|v| v.0);296 297 for i in 0..fields.len() {298 let x = fields[i].clone();299 let mut j = i;300 loop {301 let k = keys[j].1;302 keys[j].1 = j;303 if k == i {304 break;305 }306 fields[j] = fields[k].clone();307 j = k308 }309 fields[j] = x;310 }311 return fields;312 }313314 let mut fields: Vec<_> = self315 .fields_visibility()316 .into_iter()317 .filter(|(_, (visible, _))| include_hidden || *visible)318 .map(|(k, _)| k)319 .collect();320 fields.sort_unstable();321 fields322 }323 pub fn fields(&self, #[cfg(feature = "exp-preserve-order")] preserve_order: bool) -> Vec<IStr> {324 self.fields_ex(325 false,326 #[cfg(feature = "exp-preserve-order")]327 preserve_order,328 )329 }330331 pub fn field_visibility(&self, name: IStr) -> Option<Visibility> {332 if let Some(m) = self.0.this_entries.get(&name) {333 Some(match &m.visibility {334 Visibility::Normal => self335 .0336 .sup337 .as_ref()338 .and_then(|super_obj| super_obj.field_visibility(name))339 .unwrap_or(Visibility::Normal),340 v => *v,341 })342 } else if let Some(super_obj) = &self.0.sup {343 super_obj.field_visibility(name)344 } else {345 None346 }347 }348349 fn has_field_include_hidden(&self, name: IStr) -> bool {350 if self.0.this_entries.contains_key(&name) {351 true352 } else if let Some(super_obj) = &self.0.sup {353 super_obj.has_field_include_hidden(name)354 } else {355 false356 }357 }358359 pub fn has_field_ex(&self, name: IStr, include_hidden: bool) -> bool {360 if include_hidden {361 self.has_field_include_hidden(name)362 } else {363 self.has_field(name)364 }365 }366 pub fn has_field(&self, name: IStr) -> bool {367 self.field_visibility(name)368 .map_or(false, |v| v.is_visible())369 }370371 pub fn iter(&self) -> impl Iterator<Item = (IStr, Result<Val>)> + '_ {372 let fields = self.fields();373 fields.into_iter().map(|field| {374 (375 field.clone(),376 self.get(field)377 .map(|opt| opt.expect("iterating over keys, field exists")),378 )379 })380 }381382 pub fn get(&self, key: IStr) -> Result<Option<Val>> {383 self.run_assertions()?;384 if let Some(v) = self.0.value_cache.borrow().get(&key) {385 return Ok(match v {386 CacheValue::Cached(v) => Some(v.clone()),387 CacheValue::NotFound => None,388 CacheValue::Pending => throw!(InfiniteRecursionDetected),389 CacheValue::Errored(e) => return Err(e.clone()),390 });391 }392 self.0393 .value_cache394 .borrow_mut()395 .insert(key.clone(), CacheValue::Pending);396 let value = self397 .get_raw(398 key.clone(),399 self.0.this.clone().unwrap_or_else(|| self.clone()),400 )401 .map_err(|e| {402 self.0403 .value_cache404 .borrow_mut()405 .insert(key.clone(), CacheValue::Errored(e.clone()));406 e407 })?;408 self.0.value_cache.borrow_mut().insert(409 key,410 value411 .as_ref()412 .map_or(CacheValue::NotFound, |v| CacheValue::Cached(v.clone())),413 );414 Ok(value)415 }416417 fn get_raw(&self, key: IStr, real_this: Self) -> Result<Option<Val>> {418 match (self.0.this_entries.get(&key), &self.0.sup) {419 (Some(k), None) => Ok(Some(self.evaluate_this(k, real_this)?)),420 (Some(k), Some(super_obj)) => {421 let our = self.evaluate_this(k, real_this.clone())?;422 if k.add {423 super_obj424 .get_raw(key, real_this)?425 .map_or(Ok(Some(our.clone())), |v| {426 Ok(Some(evaluate_add_op(&v, &our)?))427 })428 } else {429 Ok(Some(our))430 }431 }432 (None, Some(super_obj)) => super_obj.get_raw(key, real_this),433 (None, None) => Ok(None),434 }435 }436 fn evaluate_this(&self, v: &ObjMember, real_this: Self) -> Result<Val> {437 v.invoke438 .evaluate(self.0.sup.clone(), Some(real_this))?439 .evaluate()440 }441442 fn run_assertions_raw(&self, real_this: &Self) -> Result<()> {443 if self.0.assertions_ran.borrow_mut().insert(real_this.clone()) {444 for assertion in self.0.assertions.iter() {445 if let Err(e) = assertion.run(self.0.sup.clone(), Some(real_this.clone())) {446 self.0.assertions_ran.borrow_mut().remove(real_this);447 return Err(e);448 }449 }450 if let Some(super_obj) = &self.0.sup {451 super_obj.run_assertions_raw(real_this)?;452 }453 }454 Ok(())455 }456 pub fn run_assertions(&self) -> Result<()> {457 self.run_assertions_raw(self)458 }459460 pub fn ptr_eq(a: &Self, b: &Self) -> bool {461 Cc::ptr_eq(&a.0, &b.0)462 }463 pub fn downgrade(self) -> WeakObjValue {464 WeakObjValue(self.0.downgrade())465 }466}467468impl PartialEq for ObjValue {469 fn eq(&self, other: &Self) -> bool {470 Cc::ptr_eq(&self.0, &other.0)471 }472}473474impl Eq for ObjValue {}475impl Hash for ObjValue {476 fn hash<H: Hasher>(&self, hasher: &mut H) {477 hasher.write_usize(addr_of!(*self.0) as usize);478 }479}480481#[allow(clippy::module_name_repetitions)]482pub struct ObjValueBuilder {483 sup: Option<ObjValue>,484 map: GcHashMap<IStr, ObjMember>,485 assertions: Vec<TraceBox<dyn ObjectAssertion>>,486 next_field_index: FieldIndex,487}488impl ObjValueBuilder {489 pub fn new() -> Self {490 Self::with_capacity(0)491 }492 pub fn with_capacity(capacity: usize) -> Self {493 Self {494 sup: None,495 map: GcHashMap::with_capacity(capacity),496 assertions: Vec::new(),497 next_field_index: FieldIndex::default(),498 }499 }500 pub fn reserve_asserts(&mut self, capacity: usize) -> &mut Self {501 self.assertions.reserve_exact(capacity);502 self503 }504 pub fn with_super(&mut self, super_obj: ObjValue) -> &mut Self {505 self.sup = Some(super_obj);506 self507 }508509 pub fn assert(&mut self, assertion: TraceBox<dyn ObjectAssertion>) -> &mut Self {510 self.assertions.push(assertion);511 self512 }513 pub fn member(&mut self, name: IStr) -> ObjMemberBuilder<ValueBuilder<'_>> {514 let field_index = self.next_field_index;515 self.next_field_index = self.next_field_index.next();516 ObjMemberBuilder::new(ValueBuilder(self), name, field_index)517 }518519 pub fn build(self) -> ObjValue {520 ObjValue::new(self.sup, Cc::new(self.map), Cc::new(self.assertions))521 }522}523impl Default for ObjValueBuilder {524 fn default() -> Self {525 Self::with_capacity(0)526 }527}528529#[allow(clippy::module_name_repetitions)]530#[must_use = "value not added unless binding() was called"]531pub struct ObjMemberBuilder<Kind> {532 kind: Kind,533 name: IStr,534 add: bool,535 visibility: Visibility,536 original_index: FieldIndex,537 location: Option<ExprLocation>,538}539540#[allow(clippy::missing_const_for_fn)]541impl<Kind> ObjMemberBuilder<Kind> {542 pub(crate) fn new(kind: Kind, name: IStr, original_index: FieldIndex) -> Self {543 Self {544 kind,545 name,546 original_index,547 add: false,548 visibility: Visibility::Normal,549 location: None,550 }551 }552553 pub const fn with_add(mut self, add: bool) -> Self {554 self.add = add;555 self556 }557 pub fn add(self) -> Self {558 self.with_add(true)559 }560 pub fn with_visibility(mut self, visibility: Visibility) -> Self {561 self.visibility = visibility;562 self563 }564 pub fn hide(self) -> Self {565 self.with_visibility(Visibility::Hidden)566 }567 pub fn with_location(mut self, location: ExprLocation) -> Self {568 self.location = Some(location);569 self570 }571 fn build_member(self, binding: MaybeUnbound) -> (Kind, IStr, ObjMember) {572 (573 self.kind,574 self.name,575 ObjMember {576 add: self.add,577 visibility: self.visibility,578 original_index: self.original_index,579 invoke: binding,580 location: self.location,581 },582 )583 }584}585586pub struct ValueBuilder<'v>(&'v mut ObjValueBuilder);587impl ObjMemberBuilder<ValueBuilder<'_>> {588 589 pub fn value_unchecked(self, value: Val) {590 let (receiver, name, member) =591 self.build_member(MaybeUnbound::Bound(Thunk::evaluated(value)));592 let entry = receiver.0.map.entry(name);593 entry.insert(member);594 }595596 pub fn value(self, value: Val) -> Result<()> {597 self.thunk(Thunk::evaluated(value))598 }599 pub fn thunk(self, value: Thunk<Val>) -> Result<()> {600 self.binding(MaybeUnbound::Bound(value))601 }602 pub fn bindable(self, bindable: TraceBox<dyn Unbound<Bound = Thunk<Val>>>) -> Result<()> {603 self.binding(MaybeUnbound::Unbound(Cc::new(bindable)))604 }605 pub fn binding(self, binding: MaybeUnbound) -> Result<()> {606 let (receiver, name, member) = self.build_member(binding);607 let location = member.location.clone();608 let old = receiver.0.map.insert(name.clone(), member);609 if old.is_some() {610 State::push(611 CallLocation(location.as_ref()),612 || format!("field <{}> initializtion", name.clone()),613 || throw!(DuplicateFieldName(name.clone())),614 )?;615 }616 Ok(())617 }618}619620pub struct ExtendBuilder<'v>(&'v mut ObjValue);621impl ObjMemberBuilder<ExtendBuilder<'_>> {622 pub fn value(self, value: Val) {623 self.binding(MaybeUnbound::Bound(Thunk::evaluated(value)));624 }625 pub fn bindable(self, bindable: TraceBox<dyn Unbound<Bound = Thunk<Val>>>) {626 self.binding(MaybeUnbound::Unbound(Cc::new(bindable)));627 }628 pub fn binding(self, binding: MaybeUnbound) {629 let (receiver, name, member) = self.build_member(binding);630 let new = receiver.0.clone();631 *receiver.0 = new.extend_with_raw_member(name, member);632 }633}