Struct rustc_const_eval::interpret::MPlaceTy

pub struct MPlaceTy<'tcx, Prov: Provenance = AllocId> {
    mplace: MemPlace<Prov>,
    pub layout: TyAndLayout<'tcx>,
    pub align: Align,
}

A MemPlace with its layout. Constructing it is only possible in this module.

Fields

mplace: MemPlace<Prov>

layout: TyAndLayout<'tcx>

align: Align

rustc does not have a proper way to represent the type of a field of a repr(packed) struct: it needs to have a different alignment than the field type would usually have. So we represent this here with a separate field that “overwrites” layout.align. This means layout.align should never be used for a MPlaceTy!

Implementations

impl<'tcx, Prov: Provenance> MPlaceTy<'tcx, Prov>

pub fn fake_alloc_zst(layout: TyAndLayout<'tcx>) -> Self

Produces a MemPlace that works for ZST but nothing else. Conceptually this is a new allocation, but it doesn’t actually create an allocation so you don’t need to worry about memory leaks.

pub fn offset_with_meta(
    &self,
    offset: Size,
    meta: MemPlaceMeta<Prov>,
    layout: TyAndLayout<'tcx>,
    cx: &impl HasDataLayout
) -> InterpResult<'tcx, Self>

pub fn offset(
    &self,
    offset: Size,
    layout: TyAndLayout<'tcx>,
    cx: &impl HasDataLayout
) -> InterpResult<'tcx, Self>

pub fn from_aligned_ptr(
    ptr: Pointer<Option<Prov>>,
    layout: TyAndLayout<'tcx>
) -> Self

pub fn from_aligned_ptr_with_meta(
    ptr: Pointer<Option<Prov>>,
    layout: TyAndLayout<'tcx>,
    meta: MemPlaceMeta<Prov>
) -> Self

pub(crate) fn len(&self, cx: &impl HasDataLayout) -> InterpResult<'tcx, u64>

pub(super) fn vtable(&self) -> Scalar<Prov>

Trait Implementations

impl<'tcx, Prov: Clone + Provenance> Clone for MPlaceTy<'tcx, Prov>

fn clone(&self) -> MPlaceTy<'tcx, Prov>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'tcx, Prov: Debug + Provenance> Debug for MPlaceTy<'tcx, Prov>

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

Formats the value using the given formatter.

impl<'tcx, Prov: Provenance> Deref for MPlaceTy<'tcx, Prov>

type Target = MemPlace<Prov>

The resulting type after dereferencing.

fn deref(&self) -> &MemPlace<Prov>

Dereferences the value.

impl<'tcx, Prov: Provenance> From<&MPlaceTy<'tcx, Prov>> for OpTy<'tcx, Prov>

fn from(mplace: &MPlaceTy<'tcx, Prov>) -> Self

Converts to this type from the input type.

impl<'tcx, Prov: Provenance> From<&MPlaceTy<'tcx, Prov>> for PlaceTy<'tcx, Prov>

fn from(mplace: &MPlaceTy<'tcx, Prov>) -> Self

Converts to this type from the input type.

impl<'tcx, Prov: Provenance> From<&mut MPlaceTy<'tcx, Prov>> for OpTy<'tcx, Prov>

fn from(mplace: &mut MPlaceTy<'tcx, Prov>) -> Self

Converts to this type from the input type.

impl<'tcx, Prov: Provenance> From<&mut MPlaceTy<'tcx, Prov>> for PlaceTy<'tcx, Prov>

fn from(mplace: &mut MPlaceTy<'tcx, Prov>) -> Self

Converts to this type from the input type.

impl<'tcx, Prov: Provenance> From<MPlaceTy<'tcx, Prov>> for OpTy<'tcx, Prov>

fn from(mplace: MPlaceTy<'tcx, Prov>) -> Self

Converts to this type from the input type.

impl<'tcx, Prov: Provenance> From<MPlaceTy<'tcx, Prov>> for PlaceTy<'tcx, Prov>

fn from(mplace: MPlaceTy<'tcx, Prov>) -> Self

Converts to this type from the input type.

impl<'tcx, Prov: Hash + Provenance> Hash for MPlaceTy<'tcx, Prov>

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<'tcx, Prov: PartialEq + Provenance> PartialEq<MPlaceTy<'tcx, Prov>> for MPlaceTy<'tcx, Prov>

fn eq(&self, other: &MPlaceTy<'tcx, Prov>) -> 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<'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> Value<'mir, 'tcx, M> for MPlaceTy<'tcx, M::Provenance>

fn layout(&self) -> TyAndLayout<'tcx>

Gets this value’s layout.

fn to_op_for_read(
    &self,
    _ecx: &InterpCx<'mir, 'tcx, M>
) -> InterpResult<'tcx, OpTy<'tcx, M::Provenance>>

Makes this into an OpTy, in a cheap way that is good for reading.

fn from_op(op: &OpTy<'tcx, M::Provenance>) -> Self

Creates this from an OpTy.

fn project_downcast(
    &self,
    ecx: &InterpCx<'mir, 'tcx, M>,
    variant: VariantIdx
) -> InterpResult<'tcx, Self>

Projects to the given enum variant.

fn project_field(
    &self,
    ecx: &InterpCx<'mir, 'tcx, M>,
    field: usize
) -> InterpResult<'tcx, Self>

Projects to the n-th field.

fn to_op_for_proj(
    &self,
    ecx: &InterpCx<'mir, 'tcx, M>
) -> InterpResult<'tcx, OpTy<'tcx, M::Provenance>>

Makes this into an OpTy, in a potentially more expensive way that is good for projections.

impl<'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> ValueMut<'mir, 'tcx, M> for MPlaceTy<'tcx, M::Provenance>

fn layout(&self) -> TyAndLayout<'tcx>

Gets this value’s layout.

fn to_op_for_read(
    &self,
    _ecx: &InterpCx<'mir, 'tcx, M>
) -> InterpResult<'tcx, OpTy<'tcx, M::Provenance>>

Makes this into an OpTy, in a cheap way that is good for reading.

fn to_op_for_proj(
    &self,
    _ecx: &mut InterpCx<'mir, 'tcx, M>
) -> InterpResult<'tcx, OpTy<'tcx, M::Provenance>>

Makes this into an OpTy, in a potentially more expensive way that is good for projections.

fn from_op(op: &OpTy<'tcx, M::Provenance>) -> Self

Creates this from an OpTy.

fn project_downcast(
    &self,
    ecx: &mut InterpCx<'mir, 'tcx, M>,
    variant: VariantIdx
) -> InterpResult<'tcx, Self>

Projects to the given enum variant.

fn project_field(
    &self,
    ecx: &mut InterpCx<'mir, 'tcx, M>,
    field: usize
) -> InterpResult<'tcx, Self>

Projects to the n-th field.

impl<'tcx, Prov: Copy + Provenance> Copy for MPlaceTy<'tcx, Prov>

impl<'tcx, Prov: Eq + Provenance> Eq for MPlaceTy<'tcx, Prov>

impl<'tcx, Prov: Provenance> StructuralEq for MPlaceTy<'tcx, Prov>

impl<'tcx, Prov: Provenance> StructuralPartialEq for MPlaceTy<'tcx, Prov>

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.