pub struct OnDiskCache<'sess> {
serialized_data: RwLock<Option<Mmap>>,
current_side_effects: Lock<FxHashMap<DepNodeIndex, QuerySideEffects>>,
source_map: &'sess SourceMap,
file_index_to_stable_id: FxHashMap<SourceFileIndex, EncodedSourceFileId>,
file_index_to_file: Lock<FxHashMap<SourceFileIndex, Lrc<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<FxHashMap<DepNodeIndex, QuerySideEffects>>
§source_map: &'sess SourceMap
§file_index_to_stable_id: FxHashMap<SourceFileIndex, EncodedSourceFileId>
§file_index_to_file: Lock<FxHashMap<SourceFileIndex, Lrc<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<'sess> OnDiskCache<'sess>
impl<'sess> OnDiskCache<'sess>
sourcepub fn new(
sess: &'sess Session,
data: Mmap,
start_pos: usize,
) -> Result<Self, ()>
pub fn new( sess: &'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(source_map: &'sess SourceMap) -> 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_effects(
&self,
tcx: TyCtxt<'_>,
dep_node_index: SerializedDepNodeIndex,
) -> QuerySideEffects
pub fn load_side_effects( &self, tcx: TyCtxt<'_>, dep_node_index: SerializedDepNodeIndex, ) -> QuerySideEffects
Loads a QuerySideEffects
created during the previous compilation session.
sourcepub fn store_side_effects(
&self,
dep_node_index: DepNodeIndex,
side_effects: QuerySideEffects,
)
pub fn store_side_effects( &self, dep_node_index: DepNodeIndex, side_effects: QuerySideEffects, )
Stores a QuerySideEffects
emitted during the current compilation session.
Anything stored like this will be available via load_side_effects
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
.
sourcepub fn store_side_effects_for_anon_node(
&self,
dep_node_index: DepNodeIndex,
side_effects: QuerySideEffects,
)
pub fn store_side_effects_for_anon_node( &self, dep_node_index: DepNodeIndex, side_effects: QuerySideEffects, )
Stores side effect emitted during computation of an anonymous query.
Since many anonymous queries can share the same DepNode
, we aggregate
them – as opposed to regular queries where we assume that there is a
1:1 relationship between query-key and DepNode
.
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>(
&'sess self,
tcx: TyCtxt<'tcx>,
pos: AbsoluteBytePos,
f: F,
) -> Twhere
T: Decodable<CacheDecoder<'a, 'tcx>>,
Auto Trait Implementations§
impl<'sess> !Freeze for OnDiskCache<'sess>
impl<'sess> !RefUnwindSafe for OnDiskCache<'sess>
impl<'sess> !Send for OnDiskCache<'sess>
impl<'sess> !Sync for OnDiskCache<'sess>
impl<'sess> Unpin for OnDiskCache<'sess>
impl<'sess> !UnwindSafe for OnDiskCache<'sess>
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> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
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<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<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
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: 464 bytes