pub struct QueryCtxt<'tcx> {
pub tcx: TyCtxt<'tcx>,
}Expand description
Implements QueryContext for use by rustc_query_system, since that
crate does not have direct access to [TyCtxt].
Fields§
§tcx: TyCtxt<'tcx>Implementations§
Source§impl<'tcx> QueryCtxt<'tcx>
impl<'tcx> QueryCtxt<'tcx>
pub fn new(tcx: TyCtxt<'tcx>) -> Self
fn depth_limit_error(self, job: QueryJobId)
Trait Implementations§
Source§impl<'tcx> HasDepContext for QueryCtxt<'tcx>
impl<'tcx> HasDepContext for QueryCtxt<'tcx>
type Deps = DepsType
type DepContext = TyCtxt<'tcx>
fn dep_context(&self) -> &Self::DepContext
Source§impl<'tcx> QueryContext<'tcx> for QueryCtxt<'tcx>
impl<'tcx> QueryContext<'tcx> for QueryCtxt<'tcx>
Source§fn collect_active_jobs_from_all_queries(
self,
require_complete: bool,
) -> Result<QueryMap<'tcx>, QueryMap<'tcx>>
fn collect_active_jobs_from_all_queries( self, require_complete: bool, ) -> Result<QueryMap<'tcx>, QueryMap<'tcx>>
Returns a map of currently active query jobs, collected from all queries.
If require_complete is true, this function locks all shards of the
query results to produce a complete map, which always returns Ok.
Otherwise, it may return an incomplete map as an error if any shard
lock cannot be acquired.
Prefer passing false to require_complete to avoid potential deadlocks,
especially when called from within a deadlock handler, unless a
complete map is needed and no deadlock is possible at this call site.
Source§fn start_query<R>(
self,
token: QueryJobId,
depth_limit: bool,
compute: impl FnOnce() -> R,
) -> R
fn start_query<R>( self, token: QueryJobId, depth_limit: bool, compute: impl FnOnce() -> R, ) -> R
Executes a job by changing the ImplicitCtxt to point to the
new query job while it executes.
Source§fn jobserver_proxy(&self) -> &Proxy
fn jobserver_proxy(&self) -> &Proxy
fn next_job_id(self) -> QueryJobId
Source§fn current_query_job(self) -> Option<QueryJobId>
fn current_query_job(self) -> Option<QueryJobId>
Source§fn load_side_effect(
self,
prev_dep_node_index: SerializedDepNodeIndex,
) -> Option<QuerySideEffect>
fn load_side_effect( self, prev_dep_node_index: SerializedDepNodeIndex, ) -> Option<QuerySideEffect>
Source§fn store_side_effect(
self,
dep_node_index: DepNodeIndex,
side_effect: QuerySideEffect,
)
fn store_side_effect( self, dep_node_index: DepNodeIndex, side_effect: QuerySideEffect, )
impl<'tcx> Copy for QueryCtxt<'tcx>
Auto Trait Implementations§
impl<'tcx> DynSend for QueryCtxt<'tcx>
impl<'tcx> DynSync for QueryCtxt<'tcx>
impl<'tcx> Freeze for QueryCtxt<'tcx>
impl<'tcx> !RefUnwindSafe for QueryCtxt<'tcx>
impl<'tcx> !Send for QueryCtxt<'tcx>
impl<'tcx> !Sync for QueryCtxt<'tcx>
impl<'tcx> Unpin for QueryCtxt<'tcx>
impl<'tcx> !UnwindSafe for QueryCtxt<'tcx>
Blanket Implementations§
§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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 more§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
§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: 8 bytes