Enum rustc_transmute::layout::tree::Tree
source · pub(crate) enum Tree<D, R>{
Seq(Vec<Self>),
Alt(Vec<Self>),
Def(D),
Ref(R),
Byte(Byte),
}
Expand description
A tree-based representation of a type layout.
Invariants:
- All paths through the layout have the same length (in bytes).
Nice-to-haves:
- An
Alt
is never directly nested beneath anotherAlt
. - A
Seq
is never directly nested beneath anotherSeq
. Seq
s andAlt
s 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>>
impl<'tcx> Tree<Def<'tcx>, Ref<'tcx>>
pub fn from_ty( ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>
sourcefn from_tuple(
ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>,
members: &'tcx List<Ty<'tcx>>,
cx: LayoutCx<'tcx, TyCtxt<'tcx>>,
) -> Result<Self, Err>
fn from_tuple( ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>, members: &'tcx List<Ty<'tcx>>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>
Constructs a Tree
from a tuple.
sourcefn from_struct(
ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>,
def: AdtDef<'tcx>,
cx: LayoutCx<'tcx, TyCtxt<'tcx>>,
) -> Result<Self, Err>
fn from_struct( ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>, def: AdtDef<'tcx>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>
sourcefn from_enum(
ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>,
def: AdtDef<'tcx>,
cx: LayoutCx<'tcx, TyCtxt<'tcx>>,
) -> Result<Self, Err>
fn from_enum( ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>, def: AdtDef<'tcx>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>
sourcefn from_variant(
def: Def<'tcx>,
tag: Option<ScalarInt>,
ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>,
total_size: Size,
cx: LayoutCx<'tcx, TyCtxt<'tcx>>,
) -> Result<Self, Err>
fn from_variant( def: Def<'tcx>, tag: Option<ScalarInt>, ty_and_layout: TyAndLayout<'tcx, Ty<'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
.
sourcefn from_tag(tag: ScalarInt, tcx: TyCtxt<'tcx>) -> Self
fn from_tag(tag: ScalarInt, tcx: TyCtxt<'tcx>) -> Self
Constructs a Tree
representing the value of a enum tag.
sourcefn from_union(
ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>,
def: AdtDef<'tcx>,
cx: LayoutCx<'tcx, TyCtxt<'tcx>>,
) -> Result<Self, Err>
fn from_union( ty_and_layout: TyAndLayout<'tcx, Ty<'tcx>>, def: AdtDef<'tcx>, cx: LayoutCx<'tcx, TyCtxt<'tcx>>, ) -> Result<Self, Err>
source§impl<D, R> Tree<D, R>
impl<D, R> Tree<D, R>
sourcepub(crate) fn uninhabited() -> Self
pub(crate) fn uninhabited() -> Self
A Tree
representing an uninhabited type.
sourcepub(crate) fn from_bits(bits: u8) -> Self
pub(crate) fn from_bits(bits: u8) -> Self
A Tree
whose layout accepts exactly the given bit pattern.
sourcepub(crate) fn number(width_in_bytes: usize) -> Self
pub(crate) fn number(width_in_bytes: usize) -> Self
A Tree
whose layout is a number of the given width.
sourcepub(crate) fn padding(width_in_bytes: usize) -> Self
pub(crate) fn padding(width_in_bytes: usize) -> Self
A Tree
whose layout is entirely padding of the given width.
sourcepub(crate) fn prune<F>(self, f: &F) -> Tree<!, R>
pub(crate) fn prune<F>(self, f: &F) -> Tree<!, R>
Remove all Def
nodes, and all branches of the layout for which f
produces true
.
sourcepub(crate) fn is_inhabited(&self) -> bool
pub(crate) fn is_inhabited(&self) -> bool
Produces true
if Tree
is an inhabited type; otherwise false.
Trait Implementations§
source§impl<D, R> PartialEq for Tree<D, R>
impl<D, R> PartialEq for Tree<D, R>
impl<D, R> Eq for Tree<D, R>
impl<D, R> StructuralPartialEq for Tree<D, R>
Auto Trait Implementations§
impl<D, R> DynSend for Tree<D, R>
impl<D, R> DynSync for Tree<D, R>
impl<D, R> Freeze for Tree<D, R>
impl<D, R> RefUnwindSafe for Tree<D, R>where
D: RefUnwindSafe,
R: RefUnwindSafe,
impl<D, R> Send for Tree<D, R>
impl<D, R> Sync for Tree<D, R>
impl<D, R> Unpin for Tree<D, R>
impl<D, R> UnwindSafe for Tree<D, R>where
D: UnwindSafe,
R: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moresource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
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.