Enum rustc_middle::mir::AggregateKind
source · pub enum AggregateKind<'tcx> {
Array(Ty<'tcx>),
Tuple,
Adt(DefId, VariantIdx, SubstsRef<'tcx>, Option<UserTypeAnnotationIndex>, Option<usize>),
Closure(LocalDefId, SubstsRef<'tcx>),
Generator(LocalDefId, SubstsRef<'tcx>, Movability),
}
Variants
Array(Ty<'tcx>)
The type is of the element
Tuple
Adt(DefId, VariantIdx, SubstsRef<'tcx>, Option<UserTypeAnnotationIndex>, Option<usize>)
The second field is the variant index. It’s equal to 0 for struct
and union expressions. The fourth field is
active field number and is present only for union expressions
– e.g., for a union expression SomeUnion { c: .. }
, the
active field index would identity the field c
Closure(LocalDefId, SubstsRef<'tcx>)
Generator(LocalDefId, SubstsRef<'tcx>, Movability)
Trait Implementations
sourceimpl<'tcx> Clone for AggregateKind<'tcx>
impl<'tcx> Clone for AggregateKind<'tcx>
sourcefn clone(&self) -> AggregateKind<'tcx>
fn clone(&self) -> AggregateKind<'tcx>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresourceimpl<'tcx> Debug for AggregateKind<'tcx>
impl<'tcx> Debug for AggregateKind<'tcx>
sourceimpl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for AggregateKind<'tcx>
impl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for AggregateKind<'tcx>
sourceimpl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for AggregateKind<'tcx>
impl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for AggregateKind<'tcx>
sourceimpl<'tcx> Hash for AggregateKind<'tcx>
impl<'tcx> Hash for AggregateKind<'tcx>
sourceimpl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AggregateKind<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AggregateKind<'tcx>
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
sourceimpl<'tcx> PartialEq<AggregateKind<'tcx>> for AggregateKind<'tcx>
impl<'tcx> PartialEq<AggregateKind<'tcx>> for AggregateKind<'tcx>
sourcefn eq(&self, other: &AggregateKind<'tcx>) -> bool
fn eq(&self, other: &AggregateKind<'tcx>) -> bool
sourceimpl<'tcx> TypeFoldable<'tcx> for AggregateKind<'tcx>
impl<'tcx> TypeFoldable<'tcx> for AggregateKind<'tcx>
sourcefn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
sourcefn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
A convenient alternative to
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read moresourceimpl<'tcx> TypeVisitable<'tcx> for AggregateKind<'tcx>
impl<'tcx> TypeVisitable<'tcx> for AggregateKind<'tcx>
sourcefn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
sourcefn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
Returns
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free. Read moresourcefn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
Returns
true
if this self
has any regions that escape binder
(and
hence are not bound by it). Read morefn has_escaping_bound_vars(&self) -> bool
fn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Option<ErrorGuaranteed>
fn has_param_types_or_consts(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_infer_types_or_consts(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
sourcefn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
“Free” regions in this context means that it has any region
that is not (a) erased or (b) late-bound. Read more
fn has_erased_regions(&self) -> bool
sourcefn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
True if there are any un-erased free regions.
sourcefn is_global(&self) -> bool
fn is_global(&self) -> bool
Indicates whether this value references only ‘global’
generic parameters that are the same regardless of what fn we are
in. This is used for caching. Read more
sourcefn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
True if there are any late-bound regions
sourcefn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
Indicates whether this value still has parameters/placeholders/inference variables
which could be replaced later, in a way that would change the results of
impl
specialization. Read moreimpl<'tcx> Eq for AggregateKind<'tcx>
impl<'tcx> StructuralEq for AggregateKind<'tcx>
impl<'tcx> StructuralPartialEq for AggregateKind<'tcx>
Auto Trait Implementations
impl<'tcx> !RefUnwindSafe for AggregateKind<'tcx>
impl<'tcx> Send for AggregateKind<'tcx>
impl<'tcx> Sync for AggregateKind<'tcx>
impl<'tcx> Unpin for AggregateKind<'tcx>
impl<'tcx> !UnwindSafe for AggregateKind<'tcx>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> 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). Read more
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> 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. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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: 40 bytes
Size for each variant:
Array
: 8 bytesTuple
: 0 bytesAdt
: 40 bytesClosure
: 32 bytesGenerator
: 32 bytes