Struct OnDiskCache

pub struct OnDiskCache {
    serialized_data: RwLock<Option<Mmap>>,
    current_side_effects: Lock<FxHashMap<DepNodeIndex, QuerySideEffects>>,
    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>,
}

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>>

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

impl OnDiskCache

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

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

pub fn load_side_effects( &self, tcx: TyCtxt<'_>, dep_node_index: SerializedDepNodeIndex, ) -> QuerySideEffects

Loads a QuerySideEffects created during the previous compilation session.

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.

pub fn loadable_from_disk(&self, dep_node_index: SerializedDepNodeIndex) -> bool

Return whether the cached query result can be decoded.

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.

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>( &self, tcx: TyCtxt<'tcx>, pos: AbsoluteBytePos, f: F, ) -> T

where T: Decodable<CacheDecoder<'a, 'tcx>>,

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: 440 bytes