Enum rustc_middle::dep_graph::TaskDepsRef

source ·

pub enum TaskDepsRef<'a> {
    Allow(&'a Lock<TaskDeps>),
    EvalAlways,
    Ignore,
    Forbid,
}

Variants§

§

Allow(&'a Lock<TaskDeps>)

New dependencies can be added to the TaskDeps. This is used when executing a ‘normal’ query (no eval_always modifier)

§

EvalAlways

This is used when executing an eval_always query. We don’t need to track dependencies for a query that’s always re-executed – but we need to know that this is an eval_always query in order to emit dependencies to DepNodeIndex::FOREVER_RED_NODE when directly feeding other queries.

§

Ignore

New dependencies are ignored. This is also used for dep_graph.with_ignore.

§

Forbid

Any attempt to add new dependencies will cause a panic. This is used when decoding a query result from disk, to ensure that the decoding process doesn’t itself require the execution of any queries.

Auto Trait Implementations§

§

Enum rustc_middle::dep_graph::TaskDepsRef

Variants§

Allow(&'a Lock<TaskDeps>)

EvalAlways

Ignore

Forbid

Auto Trait Implementations§

impl<'a> !RefUnwindSafe for TaskDepsRef<'a>

impl<'a> !Send for TaskDepsRef<'a>

impl<'a> !Sync for TaskDepsRef<'a>

impl<'a> Unpin for TaskDepsRef<'a>

impl<'a> !UnwindSafe for TaskDepsRef<'a>

Blanket Implementations§

impl<T> Aligned for T

const ALIGN: Alignment = _

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

fn type_id(&self) -> TypeId

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere T: Copy,

fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a mut [T]

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

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

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

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

type Output = R

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<P> IntoQueryParam<P> for P

fn into_query_param(self) -> P

impl<T> MaybeResult<T> for T

type Error = !

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

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

impl<T> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<'tcx, T> ToPredicate<'tcx, T> for T

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

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

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

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

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

impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,

default fn from_cycle_error( tcx: Tcx, cycle: &[QueryInfo], _guar: ErrorGuaranteed ) -> T

Layout§