pub(crate) enum Tree<D, R>where
    D: Def,
    R: Ref,{
    Seq(Vec<Self>),
    Alt(Vec<Self>),
    Def(D),
    Ref(R),
    Byte(Byte),
}
Expand description

A tree-based representation of a type layout.

Invariants:

  1. All paths through the layout have the same length (in bytes).

Nice-to-haves:

  1. An Alt is never directly nested beneath another Alt.
  2. A Seq is never directly nested beneath another Seq.
  3. Seqs and Alts with a single member do not exist.

Variants§

§

Seq(Vec<Self>)

A sequence of successive layouts.

§

Alt(Vec<Self>)

A choice between alternative layouts.

§

Def(D)

A definition node.

§

Ref(R)

A reference node.

§

Byte(Byte)

A byte node.

Implementations§

source§

impl<'tcx> Tree<Def<'tcx>, Ref<'tcx>>

source

pub fn from_ty(ty: Ty<'tcx>, tcx: TyCtxt<'tcx>) -> Result<Self, Err>

source

fn from_repr_c_variant( ty: Ty<'tcx>, adt_def: AdtDef<'tcx>, args_ref: GenericArgsRef<'tcx>, layout_summary: &LayoutSummary, discr: Option<Discr<'tcx>>, variant_def: &'tcx VariantDef, tcx: TyCtxt<'tcx> ) -> Result<Self, Err>

source

pub fn from_discr(discr: Discr<'tcx>, tcx: TyCtxt<'tcx>, size: usize) -> Self

source§

impl<D, R> Tree<D, R>where D: Def, R: Ref,

source

pub(crate) fn def(def: D) -> Self

A Tree consisting only of a definition node.

source

pub(crate) fn uninhabited() -> Self

A Tree representing an uninhabited type.

source

pub(crate) fn unit() -> Self

A Tree representing a zero-sized type.

source

pub(crate) fn uninit() -> Self

A Tree containing a single, uninitialized byte.

source

pub(crate) fn bool() -> Self

A Tree representing the layout of bool.

source

pub(crate) fn u8() -> Self

A Tree whose layout matches that of a u8.

source

pub(crate) fn from_bits(bits: u8) -> Self

A Tree whose layout accepts exactly the given bit pattern.

source

pub(crate) fn number(width_in_bytes: usize) -> Self

A Tree whose layout is a number of the given width.

source

pub(crate) fn padding(width_in_bytes: usize) -> Self

A Tree whose layout is entirely padding of the given width.

source

pub(crate) fn prune<F>(self, f: &F) -> Tree<!, R>where F: Fn(D) -> bool,

Remove all Def nodes, and all branches of the layout for which f produces false.

source

pub(crate) fn is_inhabited(&self) -> bool

Produces true if Tree is an inhabited type; otherwise false.

source§

impl<D, R> Tree<D, R>where D: Def, R: Ref,

source

pub(crate) fn then(self, other: Self) -> Self

Produces a new Tree where other is sequenced after self.

source

pub(crate) fn or(self, other: Self) -> Self

Produces a new Tree accepting either self or other as alternative layouts.

Trait Implementations§

source§

impl<D, R> Clone for Tree<D, R>where D: Def + Clone, R: Ref + Clone,

source§

fn clone(&self) -> Tree<D, R>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<D, R> Debug for Tree<D, R>where D: Def + Debug, R: Ref + Debug,

source§

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

Formats the value using the given formatter. Read more
source§

impl<D, R> Hash for Tree<D, R>where D: Def + Hash, R: Ref + Hash,

source§

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

Feeds this value into the given Hasher. Read more
1.3.0 · source§

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

Feeds a slice of this type into the given Hasher. Read more
source§

impl<D, R> PartialEq<Tree<D, R>> for Tree<D, R>where D: Def + PartialEq, R: Ref + PartialEq,

source§

fn eq(&self, other: &Tree<D, R>) -> bool

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

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.
source§

impl<D, R> Eq for Tree<D, R>where D: Def + Eq, R: Ref + Eq,

source§

impl<D, R> StructuralEq for Tree<D, R>where D: Def, R: Ref,

source§

impl<D, R> StructuralPartialEq for Tree<D, R>where D: Def, R: Ref,

Auto Trait Implementations§

§

impl<D, R> RefUnwindSafe for Tree<D, R>where D: RefUnwindSafe, R: RefUnwindSafe,

§

impl<D, R> Send for Tree<D, R>where D: Send, R: Send,

§

impl<D, R> Sync for Tree<D, R>where D: Sync, R: Sync,

§

impl<D, R> Unpin for Tree<D, R>where D: Unpin, R: Unpin,

§

impl<D, R> UnwindSafe for Tree<D, R>where D: UnwindSafe, R: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

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

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

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

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

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

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

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

§

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

The type returned in the event of a conversion error.
source§

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

Performs the conversion.

Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.