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:
- 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: Ty<'tcx>, tcx: TyCtxt<'tcx>) -> Result<Self, Err>
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>
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,
impl<D, R> Tree<D, R>where D: Def, R: Ref,
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>where
F: Fn(D) -> bool,
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.
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<Tree<D, R>> for Tree<D, R>where
D: Def + PartialEq,
R: Ref + PartialEq,
impl<D, R> PartialEq<Tree<D, R>> for Tree<D, R>where D: Def + PartialEq, R: Ref + PartialEq,
impl<D, R> Eq for Tree<D, R>where D: Def + Eq, R: Ref + Eq,
impl<D, R> StructuralEq for Tree<D, R>where D: Def, R: Ref,
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> 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
Mutably borrows from an owned value. Read more
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.