use crate::stable_hasher::{HashStable, StableHasher}; use crate::sync::{MappedReadGuard, ReadGuard, RwLock}; /// The `Steal` struct is intended to used as the value for a query. /// Specifically, we sometimes have queries (*cough* MIR *cough*) /// where we create a large, complex value that we want to iteratively /// update (e.g., optimize). We could clone the value for each /// optimization, but that'd be expensive. And yet we don't just want /// to mutate it in place, because that would spoil the idea that /// queries are these pure functions that produce an immutable value /// (since if you did the query twice, you could observe the mutations). /// So instead we have the query produce a `&'tcx Steal>` /// (to be very specific). Now we can read from this /// as much as we want (using `borrow()`), but you can also /// `steal()`. Once you steal, any further attempt to read will panic. /// Therefore, we know that -- assuming no ICE -- nobody is observing /// the fact that the MIR was updated. /// /// Obviously, whenever you have a query that yields a `Steal` value, /// you must treat it with caution, and make sure that you know that /// -- once the value is stolen -- it will never be read from again. // // FIXME(#41710): what is the best way to model linear queries? #[derive(Debug)] pub struct Steal { value: RwLock>, } impl Steal { pub fn new(value: T) -> Self { Steal { value: RwLock::new(Some(value)) } } #[track_caller] pub fn borrow(&self) -> MappedReadGuard<'_, T> { let borrow = self.value.borrow(); if borrow.is_none() { panic!("attempted to read from stolen value: {}", std::any::type_name::()); } ReadGuard::map(borrow, |opt| opt.as_ref().unwrap()) } #[track_caller] pub fn steal(&self) -> T { let value_ref = &mut *self.value.try_write().expect("stealing value which is locked"); let value = value_ref.take(); value.expect("attempt to steal from stolen value") } } impl> HashStable for Steal { fn hash_stable(&self, hcx: &mut CTX, hasher: &mut StableHasher) { self.borrow().hash_stable(hcx, hasher); } }