Enum rustc_transmute::layout::tree::Tree

source ·
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>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>

source

fn from_tuple( (ty, layout): (Ty<'tcx>, Layout<'tcx>), members: &'tcx List<Ty<'tcx>>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>

Constructs a Tree from a tuple.

source

fn from_struct( (ty, layout): (Ty<'tcx>, Layout<'tcx>), def: AdtDef<'tcx>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>

Constructs a Tree from a struct.

§Panics

Panics if def is not a struct definition.

source

fn from_enum( (ty, layout): (Ty<'tcx>, Layout<'tcx>), def: AdtDef<'tcx>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>

Constructs a Tree from an enum.

§Panics

Panics if def is not an enum definition.

source

fn from_variant( def: Def<'tcx>, tag: Option<ScalarInt>, (ty, layout): (Ty<'tcx>, Layout<'tcx>), total_size: Size, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>

Constructs a Tree from a ‘variant-like’ layout.

A ‘variant-like’ layout includes those of structs and, of course, enum variants. Pragmatically speaking, this method supports anything with FieldsShape::Arbitrary.

Note: This routine assumes that the optional tag is the first field, and enum callers should check that tag_field is, in fact, 0.

source

fn from_tag(tag: ScalarInt, tcx: TyCtxt<'tcx>) -> Self

Constructs a Tree representing the value of a enum tag.

source

fn from_union( (ty, layout): (Ty<'tcx>, Layout<'tcx>), def: AdtDef<'tcx>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>

Constructs a Tree from a union.

§Panics

Panics if def is not a union definition.

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 true.

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 for Tree<D, R>
where D: Def + PartialEq, R: Ref + PartialEq,

source§

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

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

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

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> StructuralPartialEq for Tree<D, R>
where D: Def, R: Ref,

Auto Trait Implementations§

§

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

§

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

§

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> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> AnyEq for T
where T: Any + PartialEq,

source§

fn equals(&self, other: &(dyn Any + 'static)) -> bool

source§

fn as_any(&self) -> &(dyn Any + 'static)

source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

source§

type Output = R

source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> Filterable for T

source§

fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where 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> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

source§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<T> Same for T

source§

type Output = T

Should always be Self
source§

impl<T> ToOwned for T
where T: Clone,

source§

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 T
where U: Into<T>,

source§

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 T
where U: TryFrom<T>,

source§

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

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

source§

fn upcast(self, interner: I) -> U

source§

impl<I, T> UpcastFrom<I, T> for T

source§

fn upcast_from(from: T, _tcx: I) -> T

source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for T

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.