Enum rustc_middle::middle::region::ScopeData
source · pub enum ScopeData {
Node,
CallSite,
Arguments,
Destruction,
IfThen,
Remainder(FirstStatementIndex),
}
Variants§
Node
CallSite
Scope of the call-site for a function or closure (outlives the arguments as well as the body).
Arguments
Scope of arguments passed to a function or closure (they outlive its body).
Destruction
Scope of destructors for temporaries of node-id.
IfThen
Scope of the condition and then block of an if expression Used for variables introduced in an if-let expression.
Remainder(FirstStatementIndex)
Scope following a let id = expr;
binding in a block.
Trait Implementations§
source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for ScopeData
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for ScopeData
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl Ord for ScopeData
impl Ord for ScopeData
source§impl PartialEq<ScopeData> for ScopeData
impl PartialEq<ScopeData> for ScopeData
source§impl PartialOrd<ScopeData> for ScopeData
impl PartialOrd<ScopeData> for ScopeData
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl Copy for ScopeData
impl Eq for ScopeData
impl StructuralEq for ScopeData
impl StructuralPartialEq for ScopeData
Auto Trait Implementations§
impl RefUnwindSafe for ScopeData
impl Send for ScopeData
impl Sync for ScopeData
impl Unpin for ScopeData
impl UnwindSafe for ScopeData
Blanket Implementations§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
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]
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
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
This method turns the parameters of a DepNodeConstructor into an opaque
Fingerprint to be used in DepNode.
Not all DepNodeParams support being turned into a Fingerprint (they
don’t need to if the corresponding DepNode is anonymous).
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
This method tries to recover the query key from the given
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it.source§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<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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: &[QueryInfo], _guar: ErrorGuaranteed ) -> 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: 4 bytes
Size for each variant:
Node
: 0 bytesCallSite
: 0 bytesArguments
: 0 bytesDestruction
: 0 bytesIfThen
: 0 bytesRemainder
: 4 bytes