Struct rustc_middle::ty::adt::AdtDefData

pub struct AdtDefData {
    pub did: DefId,
    variants: IndexVec<VariantIdx, VariantDef>,
    flags: AdtFlags,
    repr: ReprOptions,
}

The definition of a user-defined type, e.g., a struct, enum, or union.

These are all interned (by mk_adt_def) into the global arena.

The initialism ADT stands for an algebraic data type (ADT). This is slightly wrong because unions are not ADTs. Moreover, Rust only allows recursive data types through indirection.

Recursive types

It may seem impossible to represent recursive types using Ty, since TyKind::Adt includes AdtDef, which includes its fields, creating a cycle. However, AdtDef does not actually include the types of its fields; it includes just their DefIds.

For example, the following type:

struct S { x: Box<S> }

is essentially represented with Ty as the following pseudocode:

struct S { x }

where x here represents the DefId of S.x. Then, the DefId can be used with TyCtxt::type_of() to get the type of the field.

Fields

did: DefId

The DefId of the struct, enum or union item.

variants: IndexVec<VariantIdx, VariantDef>

Variants of the ADT. If this is a struct or union, then there will be a single variant.

flags: AdtFlags

Flags of the ADT (e.g., is this a struct? is this non-exhaustive?).

repr: ReprOptions

Repr options provided by the user.

Implementations

impl AdtDefData

pub(super) fn new( tcx: TyCtxt<'_>, did: DefId, kind: AdtKind, variants: IndexVec<VariantIdx, VariantDef>, repr: ReprOptions, is_anonymous: bool, ) -> Self

Creates a new AdtDefData.

Trait Implementations

impl<'tcx> ArenaAllocatable<'tcx> for AdtDefData

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

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

impl<'tcx> Borrow<AdtDefData> for InternedInSet<'tcx, AdtDefData>

fn borrow<'a>(&'a self) -> &'a AdtDefData

Immutably borrows from an owned value.

impl<__D: TyDecoder> Decodable<__D> for AdtDefData

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

impl<__E: TyEncoder> Encodable<__E> for AdtDefData

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

impl Hash for AdtDefData

There should be only one AdtDef for each did, therefore it is fine to implement Hash only based on did.

fn hash<H: Hasher>(&self, s: &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<'a> HashStable<StableHashingContext<'a>> for AdtDefData

fn hash_stable( &self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher, )

impl PartialEq for AdtDefData

fn eq(&self, other: &Self) -> 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, D: TyDecoder<I = TyCtxt<'tcx>>> RefDecodable<'tcx, D> for AdtDefData

fn decode(decoder: &mut D) -> &'tcx Self

impl Eq for AdtDefData

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