pub struct OnDiskCache {
    serialized_data: RwLock<Option<Mmap>>,
    current_side_effects: Lock<FxIndexMap<DepNodeIndex, QuerySideEffect>>,
    file_index_to_stable_id: FxHashMap<SourceFileIndex, EncodedSourceFileId>,
    file_index_to_file: Lock<FxHashMap<SourceFileIndex, Arc<SourceFile>>>,
    query_result_index: FxHashMap<SerializedDepNodeIndex, AbsoluteBytePos>,
    prev_side_effects_index: FxHashMap<SerializedDepNodeIndex, AbsoluteBytePos>,
    alloc_decoding_state: AllocDecodingState,
    syntax_contexts: FxHashMap<u32, AbsoluteBytePos>,
    expn_data: UnhashMap<ExpnHash, AbsoluteBytePos>,
    hygiene_context: HygieneDecodeContext,
    foreign_expn_data: UnhashMap<ExpnHash, u32>,
}Expand description
Provides an interface to incremental compilation data cached from the
previous compilation session. This data will eventually include the results
of a few selected queries (like typeck and mir_optimized) and
any side effects that have been emitted during a query.
Fields§
§serialized_data: RwLock<Option<Mmap>>§current_side_effects: Lock<FxIndexMap<DepNodeIndex, QuerySideEffect>>§file_index_to_stable_id: FxHashMap<SourceFileIndex, EncodedSourceFileId>§file_index_to_file: Lock<FxHashMap<SourceFileIndex, Arc<SourceFile>>>§query_result_index: FxHashMap<SerializedDepNodeIndex, AbsoluteBytePos>§prev_side_effects_index: FxHashMap<SerializedDepNodeIndex, AbsoluteBytePos>§alloc_decoding_state: AllocDecodingState§syntax_contexts: FxHashMap<u32, AbsoluteBytePos>§expn_data: UnhashMap<ExpnHash, AbsoluteBytePos>§hygiene_context: HygieneDecodeContext§foreign_expn_data: UnhashMap<ExpnHash, u32>Implementations§
Source§impl OnDiskCache
 
impl OnDiskCache
Sourcepub fn new(sess: &Session, data: Mmap, start_pos: usize) -> Result<Self, ()>
 
pub fn new(sess: &Session, data: Mmap, start_pos: usize) -> Result<Self, ()>
Creates a new OnDiskCache instance from the serialized data in data.
The serialized cache has some basic integrity checks, if those checks indicate that the on-disk data is corrupt, an error is returned.
pub fn new_empty() -> Self
Sourcepub fn drop_serialized_data(&self, tcx: TyCtxt<'_>)
 
pub fn drop_serialized_data(&self, tcx: TyCtxt<'_>)
Execute all cache promotions and release the serialized backing Mmap.
Cache promotions require invoking queries, which needs to read the serialized data. In order to serialize the new on-disk cache, the former on-disk cache file needs to be deleted, hence we won’t be able to refer to its memmapped data.
pub fn serialize( &self, tcx: TyCtxt<'_>, encoder: FileEncoder, ) -> FileEncodeResult
Sourcepub fn load_side_effect(
    &self,
    tcx: TyCtxt<'_>,
    dep_node_index: SerializedDepNodeIndex,
) -> Option<QuerySideEffect>
 
pub fn load_side_effect( &self, tcx: TyCtxt<'_>, dep_node_index: SerializedDepNodeIndex, ) -> Option<QuerySideEffect>
Loads a QuerySideEffect created during the previous compilation session.
Sourcepub fn store_side_effect(
    &self,
    dep_node_index: DepNodeIndex,
    side_effect: QuerySideEffect,
)
 
pub fn store_side_effect( &self, dep_node_index: DepNodeIndex, side_effect: QuerySideEffect, )
Stores a QuerySideEffect emitted during the current compilation session.
Anything stored like this will be available via load_side_effect in
the next compilation session.
Sourcepub fn loadable_from_disk(&self, dep_node_index: SerializedDepNodeIndex) -> bool
 
pub fn loadable_from_disk(&self, dep_node_index: SerializedDepNodeIndex) -> bool
Return whether the cached query result can be decoded.
Sourcepub fn try_load_query_result<'tcx, T>(
    &self,
    tcx: TyCtxt<'tcx>,
    dep_node_index: SerializedDepNodeIndex,
) -> Option<T>where
    T: for<'a> Decodable<CacheDecoder<'a, 'tcx>>,
 
pub fn try_load_query_result<'tcx, T>(
    &self,
    tcx: TyCtxt<'tcx>,
    dep_node_index: SerializedDepNodeIndex,
) -> Option<T>where
    T: for<'a> Decodable<CacheDecoder<'a, 'tcx>>,
Returns the cached query result if there is something in the cache for
the given SerializedDepNodeIndex; otherwise returns None.
fn load_indexed<'tcx, T>(
    &self,
    tcx: TyCtxt<'tcx>,
    dep_node_index: SerializedDepNodeIndex,
    index: &FxHashMap<SerializedDepNodeIndex, AbsoluteBytePos>,
) -> Option<T>where
    T: for<'a> Decodable<CacheDecoder<'a, 'tcx>>,
fn with_decoder<'a, 'tcx, T, F: for<'s> FnOnce(&mut CacheDecoder<'s, 'tcx>) -> T>(
    &self,
    tcx: TyCtxt<'tcx>,
    pos: AbsoluteBytePos,
    f: F,
) -> Twhere
    T: Decodable<CacheDecoder<'a, 'tcx>>,
Auto Trait Implementations§
impl DynSend for OnDiskCache
impl DynSync for OnDiskCache
impl !Freeze for OnDiskCache
impl !RefUnwindSafe for OnDiskCache
impl !Send for OnDiskCache
impl !Sync for OnDiskCache
impl Unpin for OnDiskCache
impl !UnwindSafe for OnDiskCache
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
 
impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
 
fn borrow_mut(&mut self) -> &mut T
Source§impl<T, R> CollectAndApply<T, R> for T
 
impl<T, R> CollectAndApply<T, R> for T
Source§impl<T> Instrument for T
 
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
 
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
 
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
 
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
 
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
 
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<P> IntoQueryParam<P> for P
 
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
Source§impl<T> MaybeResult<T> for T
 
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
 
impl<T> Pointable for T
Source§impl<I, T, U> Upcast<I, U> for Twhere
    U: UpcastFrom<I, T>,
 
impl<I, T, U> Upcast<I, U> for Twhere
    U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
 
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
Source§impl<Tcx, T> Value<Tcx> for Twhere
    Tcx: DepContext,
 
impl<Tcx, T> Value<Tcx> for Twhere
    Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
 
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
 
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
 
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<T> ErasedDestructor for Twhere
    T: 'static,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 408 bytes