QueryVTable in rustc_middle::query - Rust
Description: Stores data and metadata (e.g. function pointers) for a particular query.

Skip to main content

## QueryVTable

# Struct QueryVTable

Source

    pub struct QueryVTable<'tcx, C: QueryCache> {Show 15 fields
        pub name: &'static str,
        pub eval_always: bool,
        pub depth_limit: bool,
        pub feedable: bool,
        pub dep_kind: DepKind,
        pub state: QueryState<'tcx, C::Key>,
        pub cache: C,
        pub invoke_provider_fn: fn(tcx: TyCtxt<'tcx>, key: C::Key) -> C::Value,
        pub will_cache_on_disk_for_key_fn: fn(key: C::Key) -> bool,
        pub try_load_from_disk_fn: fn(tcx: TyCtxt<'tcx>, prev_index: SerializedDepNodeIndex) -> Option<C::Value>,
        pub hash_value_fn: Option<fn(&mut StableHashingContext<'_>, &C::Value) -> Fingerprint>,
        pub handle_cycle_error_fn: fn(tcx: TyCtxt<'tcx>, key: C::Key, cycle: Cycle<'tcx>, error: Diag<'_>) -> C::Value,
        pub format_value: fn(&C::Value) -> String,
        pub create_tagged_key: fn(C::Key) -> TaggedQueryKey<'tcx>,
        pub execute_query_fn: fn(TyCtxt<'tcx>, Span, C::Key, QueryMode) -> Option<C::Value>,
    }

Expand description

Stores data and metadata (e.g. function pointers) for a particular query.

## Fields§

§`name: &'static str`§`eval_always: bool`

True if this query has the `eval_always` modifier.

§`depth_limit: bool`

True if this query has the `depth_limit` modifier.

§`feedable: bool`

True if this query has the `feedable` modifier.

§`dep_kind: DepKind`§`state: QueryState<'tcx, C::Key>`§`cache: C`§`invoke_provider_fn: fn(tcx: TyCtxt<'tcx>, key: C::Key) -> C::Value`

Function pointer that actually calls this query’s provider. Also performs some associated secondary tasks; see the macro-defined implementation in `mod invoke_provider_fn` for more details.

This should be the only code that calls the provider function.

§`will_cache_on_disk_for_key_fn: fn(key: C::Key) -> bool`§`try_load_from_disk_fn: fn(tcx: TyCtxt<'tcx>, prev_index: SerializedDepNodeIndex) -> Option<C::Value>`

Function pointer that tries to load a query value from disk.

This should only be called after a successful check of `will_cache_on_disk_for_key_fn`.

§`hash_value_fn: Option<fn(&mut StableHashingContext<'_>, &C::Value) -> Fingerprint>`

Function pointer that hashes this query’s result values.

For `no_hash` queries, this function pointer is None.

§`handle_cycle_error_fn: fn(tcx: TyCtxt<'tcx>, key: C::Key, cycle: Cycle<'tcx>, error: Diag<'_>) -> C::Value`

Function pointer that handles a cycle error. `error` must be consumed, e.g. with `emit` (if it should be emitted) or `delay_as_bug` (if it need not be emitted because an alternative error is created and emitted). A value may be returned, or (more commonly) the function may just abort after emitting the error.

§`format_value: fn(&C::Value) -> String`§`create_tagged_key: fn(C::Key) -> TaggedQueryKey<'tcx>`§`execute_query_fn: fn(TyCtxt<'tcx>, Span, C::Key, QueryMode) -> Option<C::Value>`

Function pointer that is called by the query methods on `TyCtxt` and friends1, after they have checked the in-memory cache and found no existing value for this key.

Transitive responsibilities include trying to load a disk-cached value if possible (incremental only), invoking the query provider if necessary, and putting the obtained value into the in-memory cache.

1. `TyCtxt`, `TyCtxtAt`, `TyCtxtEnsureOk`, `TyCtxtEnsureDone` ↩

## Trait Implementations§

Source§

### impl<'tcx, C: QueryCache> Debug for QueryVTable<'tcx, C>

Source§

#### fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

## Auto Trait Implementations§

§

### impl<'tcx, C> DynSend for QueryVTable<'tcx, C>
where C: DynSend, <C as QueryCache>::Key: DynSend,

§

### impl<'tcx, C> DynSync for QueryVTable<'tcx, C>
where C: DynSync, <C as QueryCache>::Key: DynSend,

§

### impl<'tcx, C> !Freeze for QueryVTable<'tcx, C>

§

### impl<'tcx, C> !RefUnwindSafe for QueryVTable<'tcx, C>

§

### impl<'tcx, C> Send for QueryVTable<'tcx, C>
where C: Send, <C as QueryCache>::Key: Send,

§

### impl<'tcx, C> !Sync for QueryVTable<'tcx, C>

§

### impl<'tcx, C> Unpin for QueryVTable<'tcx, C>
where C: Unpin, <C as QueryCache>::Key: Unpin,

§

### impl<'tcx, C> UnsafeUnpin for QueryVTable<'tcx, C>
where C: UnsafeUnpin,

§

### impl<'tcx, C> !UnwindSafe for QueryVTable<'tcx, C>

## Blanket Implementations§

Source§

### impl<T> Aligned for T

Source§

#### const ALIGN: Alignment

Alignment of `Self`.
Source§

### impl<T> Any for T
where T: 'static + ?Sized,

Source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
Source§

### impl<T> Borrow<T> for T
where T: ?Sized,

Source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

### impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

### impl<T, R> CollectAndApply<T, R> for T

Source§

#### fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to `f(&iter.collect::<Vec<_>>())`.

Source§

#### type Output = R

Source§

### impl<T> From<T> for T

Source§

#### fn from(t: T) -> T

Returns the argument unchanged.

Source§

### impl<T> Instrument for T

Source§

#### fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided `Span`, returning an `Instrumented` wrapper. Read more
Source§

#### fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current `Span`, returning an `Instrumented` wrapper. Read more
Source§

### impl<T, U> Into<U> for T
where U: From<T>,

Source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

Source§

### impl<T> IntoEither for T

Source§

#### fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts `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 more
Source§

#### fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts `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 more
Source§

### impl<K> IntoQueryKey<K> for K

Source§

#### fn into_query_key(self) -> K

Argument conversion from `Self` to `K`. This should always be a very cheap conversion, e.g. `LocalDefId::to_def_id`.
Source§

### impl<T> MaybeResult<T> for T

Source§

#### type Error = !

Source§

#### fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

Source§

#### fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

Source§

### impl<T> Pointable for T

Source§

#### const ALIGN: usize

The alignment of pointer.
Source§

#### type Init = T

The type for initializers.
Source§

#### unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

#### unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

#### unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

#### unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

### impl<T> Same for T

Source§

#### type Output = T

Should always be `Self`
Source§

### impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

#### type Error = Infallible

The type returned in the event of a conversion error.
Source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

### impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

### impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

Source§

#### fn upcast(self, interner: I) -> U

Source§

### impl<I, T> UpcastFrom<I, T> for T

Source§

#### fn upcast_from(from: T, _tcx: I) -> T

Source§

### impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

#### fn vzip(self) -> V

Source§

### impl<T> WithSubscriber for T

Source§

#### fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

#### fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

### impl<T> ErasedDestructor for T
where T: 'static,

## Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.