Enum rustc_middle::mir::syntax::AggregateKind

pub enum AggregateKind<'tcx> {
    Array(Ty<'tcx>),
    Tuple,
    Adt(DefId, VariantIdx, GenericArgsRef<'tcx>, Option<UserTypeAnnotationIndex>, Option<FieldIdx>),
    Closure(DefId, GenericArgsRef<'tcx>),
    Coroutine(DefId, GenericArgsRef<'tcx>),
    CoroutineClosure(DefId, GenericArgsRef<'tcx>),
    RawPtr(Ty<'tcx>, Mutability),
}

Variants

Array(Ty<'tcx>)

The type is of the element

Tuple

Adt(DefId, VariantIdx, GenericArgsRef<'tcx>, Option<UserTypeAnnotationIndex>, Option<FieldIdx>)

The second field is the variant index. It’s equal to 0 for struct and union expressions. The last field is the 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(DefId, GenericArgsRef<'tcx>)

Coroutine(DefId, GenericArgsRef<'tcx>)

CoroutineClosure(DefId, GenericArgsRef<'tcx>)

RawPtr(Ty<'tcx>, Mutability)

Construct a raw pointer from the data pointer and metadata.

The Ty here is the type of the pointee, not the pointer itself. The Mutability indicates whether this produces a *const or *mut.

The Rvalue::Aggregate operands for thus must be

0. A raw pointer of matching mutability with any core::ptr::Thin pointee
1. A value of the appropriate core::ptr::Pointee::Metadata type

Both operands must always be included, even the unit value if this is creating a thin pointer. If you’re just converting between thin pointers, you may want an Rvalue::Cast with CastKind::PtrToPtr instead.

Trait Implementations

impl<'tcx> Clone for AggregateKind<'tcx>

fn clone(&self) -> AggregateKind<'tcx>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'tcx> Debug for AggregateKind<'tcx>

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

Formats the value using the given formatter.

impl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for AggregateKind<'tcx>

fn decode(__decoder: &mut __D) -> Self

impl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for AggregateKind<'tcx>

fn encode(&self, __encoder: &mut __E)

impl<'tcx> Hash for AggregateKind<'tcx>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AggregateKind<'tcx>

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )

impl<'tcx> PartialEq for AggregateKind<'tcx>

fn eq(&self, other: &AggregateKind<'tcx>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AggregateKind<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AggregateKind<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> Eq for AggregateKind<'tcx>

impl<'tcx> StructuralPartialEq for AggregateKind<'tcx>

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: 32 bytes

Size for each variant:

• Array: 15 bytes
• Tuple: 0 bytes
• Adt: 31 bytes
• Closure: 23 bytes
• Coroutine: 23 bytes
• CoroutineClosure: 23 bytes
• RawPtr: 15 bytes