2022-07-04 07:48:05 -05:00
|
|
|
//! This file implements "place projections"; basically a symmetric API for 3 types: MPlaceTy, OpTy, PlaceTy.
|
|
|
|
//!
|
2022-08-17 21:13:37 -05:00
|
|
|
//! OpTy and PlaceTy generally work by "let's see if we are actually an MPlaceTy, and do something custom if not".
|
2022-07-04 07:48:05 -05:00
|
|
|
//! For PlaceTy, the custom thing is basically always to call `force_allocation` and then use the MPlaceTy logic anyway.
|
|
|
|
//! For OpTy, the custom thing on field pojections has to be pretty clever (since `Operand::Immediate` can have fields),
|
|
|
|
//! but for array/slice operations it only has to worry about `Operand::Uninit`. That makes the value part trivial,
|
|
|
|
//! but we still need to do bounds checking and adjust the layout. To not duplicate that with MPlaceTy, we actually
|
|
|
|
//! implement the logic on OpTy, and MPlaceTy calls that.
|
|
|
|
|
2023-08-04 14:42:35 -05:00
|
|
|
use std::marker::PhantomData;
|
|
|
|
use std::ops::Range;
|
|
|
|
|
2022-07-04 07:48:05 -05:00
|
|
|
use rustc_middle::mir;
|
|
|
|
use rustc_middle::ty;
|
2023-07-23 14:35:54 -05:00
|
|
|
use rustc_middle::ty::layout::{LayoutOf, TyAndLayout};
|
2023-07-05 14:13:26 -05:00
|
|
|
use rustc_middle::ty::Ty;
|
2023-07-23 14:35:54 -05:00
|
|
|
use rustc_target::abi::Size;
|
|
|
|
use rustc_target::abi::{self, VariantIdx};
|
2022-07-04 07:48:05 -05:00
|
|
|
|
2023-07-25 15:04:02 -05:00
|
|
|
use super::{InterpCx, InterpResult, MPlaceTy, Machine, MemPlaceMeta, OpTy, Provenance, Scalar};
|
2023-07-24 04:44:58 -05:00
|
|
|
|
|
|
|
/// A thing that we can project into, and that has a layout.
|
2023-07-25 15:04:02 -05:00
|
|
|
pub trait Projectable<'tcx, Prov: Provenance>: Sized + std::fmt::Debug {
|
2023-07-24 04:44:58 -05:00
|
|
|
/// Get the layout.
|
|
|
|
fn layout(&self) -> TyAndLayout<'tcx>;
|
|
|
|
|
|
|
|
/// Get the metadata of a wide value.
|
2023-08-17 11:58:56 -05:00
|
|
|
fn meta(&self) -> MemPlaceMeta<Prov>;
|
2023-07-24 04:44:58 -05:00
|
|
|
|
2023-08-17 11:58:56 -05:00
|
|
|
/// Get the length of a slice/string/array stored here.
|
2023-07-25 15:04:02 -05:00
|
|
|
fn len<'mir, M: Machine<'mir, 'tcx, Provenance = Prov>>(
|
2023-07-24 04:44:58 -05:00
|
|
|
&self,
|
|
|
|
ecx: &InterpCx<'mir, 'tcx, M>,
|
|
|
|
) -> InterpResult<'tcx, u64> {
|
2023-08-17 11:58:56 -05:00
|
|
|
let layout = self.layout();
|
|
|
|
if layout.is_unsized() {
|
|
|
|
// We need to consult `meta` metadata
|
|
|
|
match layout.ty.kind() {
|
|
|
|
ty::Slice(..) | ty::Str => self.meta().unwrap_meta().to_target_usize(ecx),
|
|
|
|
_ => bug!("len not supported on unsized type {:?}", layout.ty),
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Go through the layout. There are lots of types that support a length,
|
|
|
|
// e.g., SIMD types. (But not all repr(simd) types even have FieldsShape::Array!)
|
|
|
|
match layout.fields {
|
|
|
|
abi::FieldsShape::Array { count, .. } => Ok(count),
|
|
|
|
_ => bug!("len not supported on sized type {:?}", layout.ty),
|
|
|
|
}
|
|
|
|
}
|
2023-07-24 04:44:58 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Offset the value by the given amount, replacing the layout and metadata.
|
2023-08-04 14:42:35 -05:00
|
|
|
fn offset_with_meta<'mir, M: Machine<'mir, 'tcx, Provenance = Prov>>(
|
2023-07-24 04:44:58 -05:00
|
|
|
&self,
|
|
|
|
offset: Size,
|
|
|
|
meta: MemPlaceMeta<Prov>,
|
|
|
|
layout: TyAndLayout<'tcx>,
|
2023-08-04 14:42:35 -05:00
|
|
|
ecx: &InterpCx<'mir, 'tcx, M>,
|
2023-07-24 04:44:58 -05:00
|
|
|
) -> InterpResult<'tcx, Self>;
|
|
|
|
|
2023-08-17 11:58:56 -05:00
|
|
|
#[inline]
|
2023-08-04 14:42:35 -05:00
|
|
|
fn offset<'mir, M: Machine<'mir, 'tcx, Provenance = Prov>>(
|
2023-07-24 04:44:58 -05:00
|
|
|
&self,
|
|
|
|
offset: Size,
|
|
|
|
layout: TyAndLayout<'tcx>,
|
2023-08-04 14:42:35 -05:00
|
|
|
ecx: &InterpCx<'mir, 'tcx, M>,
|
2023-07-24 04:44:58 -05:00
|
|
|
) -> InterpResult<'tcx, Self> {
|
|
|
|
assert!(layout.is_sized());
|
2023-08-04 14:42:35 -05:00
|
|
|
self.offset_with_meta(offset, MemPlaceMeta::None, layout, ecx)
|
2023-07-24 04:44:58 -05:00
|
|
|
}
|
|
|
|
|
2023-08-17 11:58:56 -05:00
|
|
|
#[inline]
|
2023-08-04 14:42:35 -05:00
|
|
|
fn transmute<'mir, M: Machine<'mir, 'tcx, Provenance = Prov>>(
|
2023-07-24 04:44:58 -05:00
|
|
|
&self,
|
|
|
|
layout: TyAndLayout<'tcx>,
|
2023-08-04 14:42:35 -05:00
|
|
|
ecx: &InterpCx<'mir, 'tcx, M>,
|
2023-07-24 04:44:58 -05:00
|
|
|
) -> InterpResult<'tcx, Self> {
|
2023-08-04 14:42:35 -05:00
|
|
|
assert!(self.layout().is_sized() && layout.is_sized());
|
2023-07-24 04:44:58 -05:00
|
|
|
assert_eq!(self.layout().size, layout.size);
|
2023-08-04 14:42:35 -05:00
|
|
|
self.offset_with_meta(Size::ZERO, MemPlaceMeta::None, layout, ecx)
|
2023-07-24 04:44:58 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Convert this to an `OpTy`. This might be an irreversible transformation, but is useful for
|
|
|
|
/// reading from this thing.
|
2023-07-25 15:04:02 -05:00
|
|
|
fn to_op<'mir, M: Machine<'mir, 'tcx, Provenance = Prov>>(
|
2023-07-24 04:44:58 -05:00
|
|
|
&self,
|
|
|
|
ecx: &InterpCx<'mir, 'tcx, M>,
|
|
|
|
) -> InterpResult<'tcx, OpTy<'tcx, M::Provenance>>;
|
|
|
|
}
|
2022-07-04 07:48:05 -05:00
|
|
|
|
2023-08-04 14:42:35 -05:00
|
|
|
/// A type representing iteration over the elements of an array.
|
2023-09-04 10:53:38 -05:00
|
|
|
pub struct ArrayIterator<'tcx, 'a, Prov: Provenance, P: Projectable<'tcx, Prov>> {
|
2023-08-04 14:42:35 -05:00
|
|
|
base: &'a P,
|
|
|
|
range: Range<u64>,
|
|
|
|
stride: Size,
|
|
|
|
field_layout: TyAndLayout<'tcx>,
|
|
|
|
_phantom: PhantomData<Prov>, // otherwise it says `Prov` is never used...
|
|
|
|
}
|
|
|
|
|
2023-09-04 10:53:38 -05:00
|
|
|
impl<'tcx, 'a, Prov: Provenance, P: Projectable<'tcx, Prov>> ArrayIterator<'tcx, 'a, Prov, P> {
|
2023-08-04 14:42:35 -05:00
|
|
|
/// Should be the same `ecx` on each call, and match the one used to create the iterator.
|
|
|
|
pub fn next<'mir, M: Machine<'mir, 'tcx, Provenance = Prov>>(
|
|
|
|
&mut self,
|
|
|
|
ecx: &InterpCx<'mir, 'tcx, M>,
|
|
|
|
) -> InterpResult<'tcx, Option<(u64, P)>> {
|
|
|
|
let Some(idx) = self.range.next() else { return Ok(None) };
|
|
|
|
Ok(Some((idx, self.base.offset(self.stride * idx, self.field_layout, ecx)?)))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-07-04 07:48:05 -05:00
|
|
|
// FIXME: Working around https://github.com/rust-lang/rust/issues/54385
|
2022-07-18 17:47:31 -05:00
|
|
|
impl<'mir, 'tcx: 'mir, Prov, M> InterpCx<'mir, 'tcx, M>
|
2022-07-04 07:48:05 -05:00
|
|
|
where
|
2023-09-04 10:53:38 -05:00
|
|
|
Prov: Provenance,
|
2022-07-18 17:47:31 -05:00
|
|
|
M: Machine<'mir, 'tcx, Provenance = Prov>,
|
2022-07-04 07:48:05 -05:00
|
|
|
{
|
2023-07-24 04:44:58 -05:00
|
|
|
/// Offset a pointer to project to a field of a struct/union. Unlike `place_field`, this is
|
|
|
|
/// always possible without allocating, so it can take `&self`. Also return the field's layout.
|
|
|
|
/// This supports both struct and array fields, but not slices!
|
|
|
|
///
|
|
|
|
/// This also works for arrays, but then the `usize` index type is restricting.
|
|
|
|
/// For indexing into arrays, use `mplace_index`.
|
2023-07-25 15:04:02 -05:00
|
|
|
pub fn project_field<P: Projectable<'tcx, M::Provenance>>(
|
2022-07-04 07:48:05 -05:00
|
|
|
&self,
|
2023-07-24 04:44:58 -05:00
|
|
|
base: &P,
|
2022-07-04 07:48:05 -05:00
|
|
|
field: usize,
|
2023-07-24 04:44:58 -05:00
|
|
|
) -> InterpResult<'tcx, P> {
|
|
|
|
// Slices nominally have length 0, so they will panic somewhere in `fields.offset`.
|
|
|
|
debug_assert!(
|
|
|
|
!matches!(base.layout().ty.kind(), ty::Slice(..)),
|
|
|
|
"`field` projection called on a slice -- call `index` projection instead"
|
|
|
|
);
|
|
|
|
let offset = base.layout().fields.offset(field);
|
|
|
|
let field_layout = base.layout().field(self, field);
|
2022-07-04 07:48:05 -05:00
|
|
|
|
|
|
|
// Offset may need adjustment for unsized fields.
|
|
|
|
let (meta, offset) = if field_layout.is_unsized() {
|
2023-07-24 04:44:58 -05:00
|
|
|
if base.layout().is_sized() {
|
2023-07-23 14:35:54 -05:00
|
|
|
// An unsized field of a sized type? Sure...
|
2023-08-06 07:29:58 -05:00
|
|
|
// But const-prop actually feeds us such nonsense MIR! (see test `const_prop/issue-86351.rs`)
|
2023-07-23 14:35:54 -05:00
|
|
|
throw_inval!(ConstPropNonsense);
|
|
|
|
}
|
2023-08-17 11:58:56 -05:00
|
|
|
let base_meta = base.meta();
|
2022-07-04 07:48:05 -05:00
|
|
|
// Re-use parent metadata to determine dynamic field layout.
|
|
|
|
// With custom DSTS, this *will* execute user-defined code, but the same
|
|
|
|
// happens at run-time so that's okay.
|
2023-07-23 14:35:54 -05:00
|
|
|
match self.size_and_align_of(&base_meta, &field_layout)? {
|
|
|
|
Some((_, align)) => (base_meta, offset.align_to(align)),
|
2022-07-04 07:48:05 -05:00
|
|
|
None => {
|
|
|
|
// For unsized types with an extern type tail we perform no adjustments.
|
|
|
|
// NOTE: keep this in sync with `PlaceRef::project_field` in the codegen backend.
|
2023-07-23 14:35:54 -05:00
|
|
|
assert!(matches!(base_meta, MemPlaceMeta::None));
|
|
|
|
(base_meta, offset)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
2023-07-23 14:35:54 -05:00
|
|
|
// base_meta could be present; we might be accessing a sized field of an unsized
|
2022-07-04 07:48:05 -05:00
|
|
|
// struct.
|
|
|
|
(MemPlaceMeta::None, offset)
|
|
|
|
};
|
|
|
|
|
2022-07-14 19:32:45 -05:00
|
|
|
base.offset_with_meta(offset, meta, field_layout, self)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
|
2023-07-24 04:44:58 -05:00
|
|
|
/// Downcasting to an enum variant.
|
2023-07-25 15:04:02 -05:00
|
|
|
pub fn project_downcast<P: Projectable<'tcx, M::Provenance>>(
|
2023-07-23 14:35:54 -05:00
|
|
|
&self,
|
2023-07-24 04:44:58 -05:00
|
|
|
base: &P,
|
2022-07-04 07:48:05 -05:00
|
|
|
variant: VariantIdx,
|
2023-07-24 04:44:58 -05:00
|
|
|
) -> InterpResult<'tcx, P> {
|
2023-08-17 11:58:56 -05:00
|
|
|
assert!(!base.meta().has_meta());
|
2022-07-04 07:48:05 -05:00
|
|
|
// Downcasts only change the layout.
|
|
|
|
// (In particular, no check about whether this is even the active variant -- that's by design,
|
|
|
|
// see https://github.com/rust-lang/rust/issues/93688#issuecomment-1032929496.)
|
2023-07-24 04:44:58 -05:00
|
|
|
// So we just "offset" by 0.
|
|
|
|
let layout = base.layout().for_variant(self, variant);
|
|
|
|
if layout.abi.is_uninhabited() {
|
|
|
|
// `read_discriminant` should have excluded uninhabited variants... but ConstProp calls
|
|
|
|
// us on dead code.
|
|
|
|
throw_inval!(ConstPropNonsense)
|
|
|
|
}
|
|
|
|
// This cannot be `transmute` as variants *can* have a smaller size than the entire enum.
|
|
|
|
base.offset(Size::ZERO, layout, self)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
|
2023-07-23 14:35:54 -05:00
|
|
|
/// Compute the offset and field layout for accessing the given index.
|
2023-07-25 15:04:02 -05:00
|
|
|
pub fn project_index<P: Projectable<'tcx, M::Provenance>>(
|
2022-07-04 07:48:05 -05:00
|
|
|
&self,
|
2023-07-24 04:44:58 -05:00
|
|
|
base: &P,
|
2022-07-04 07:48:05 -05:00
|
|
|
index: u64,
|
2023-07-24 04:44:58 -05:00
|
|
|
) -> InterpResult<'tcx, P> {
|
2022-07-04 07:48:05 -05:00
|
|
|
// Not using the layout method because we want to compute on u64
|
2023-07-24 04:44:58 -05:00
|
|
|
let (offset, field_layout) = match base.layout().fields {
|
2022-07-04 07:48:05 -05:00
|
|
|
abi::FieldsShape::Array { stride, count: _ } => {
|
|
|
|
// `count` is nonsense for slices, use the dynamic length instead.
|
2023-07-24 04:44:58 -05:00
|
|
|
let len = base.len(self)?;
|
2022-07-04 07:48:05 -05:00
|
|
|
if index >= len {
|
|
|
|
// This can only be reached in ConstProp and non-rustc-MIR.
|
|
|
|
throw_ub!(BoundsCheckFailed { len, index });
|
|
|
|
}
|
|
|
|
let offset = stride * index; // `Size` multiplication
|
|
|
|
// All fields have the same layout.
|
2023-07-24 04:44:58 -05:00
|
|
|
let field_layout = base.layout().field(self, 0);
|
|
|
|
(offset, field_layout)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
_ => span_bug!(
|
|
|
|
self.cur_span(),
|
|
|
|
"`mplace_index` called on non-array type {:?}",
|
2023-07-24 04:44:58 -05:00
|
|
|
base.layout().ty
|
2022-07-04 07:48:05 -05:00
|
|
|
),
|
|
|
|
};
|
|
|
|
|
2023-07-24 04:44:58 -05:00
|
|
|
base.offset(offset, field_layout, self)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
|
2023-07-25 15:04:02 -05:00
|
|
|
fn project_constant_index<P: Projectable<'tcx, M::Provenance>>(
|
2022-07-04 07:48:05 -05:00
|
|
|
&self,
|
2023-07-24 04:44:58 -05:00
|
|
|
base: &P,
|
2022-07-04 07:48:05 -05:00
|
|
|
offset: u64,
|
|
|
|
min_length: u64,
|
|
|
|
from_end: bool,
|
2023-07-24 04:44:58 -05:00
|
|
|
) -> InterpResult<'tcx, P> {
|
|
|
|
let n = base.len(self)?;
|
2022-07-04 07:48:05 -05:00
|
|
|
if n < min_length {
|
|
|
|
// This can only be reached in ConstProp and non-rustc-MIR.
|
|
|
|
throw_ub!(BoundsCheckFailed { len: min_length, index: n });
|
|
|
|
}
|
|
|
|
|
|
|
|
let index = if from_end {
|
|
|
|
assert!(0 < offset && offset <= min_length);
|
|
|
|
n.checked_sub(offset).unwrap()
|
|
|
|
} else {
|
|
|
|
assert!(offset < min_length);
|
|
|
|
offset
|
|
|
|
};
|
|
|
|
|
2023-07-24 04:44:58 -05:00
|
|
|
self.project_index(base, index)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
|
2023-07-24 04:44:58 -05:00
|
|
|
/// Iterates over all fields of an array. Much more efficient than doing the
|
|
|
|
/// same by repeatedly calling `operand_index`.
|
2023-07-25 15:04:02 -05:00
|
|
|
pub fn project_array_fields<'a, P: Projectable<'tcx, M::Provenance>>(
|
2023-07-23 14:35:54 -05:00
|
|
|
&self,
|
2023-07-24 04:44:58 -05:00
|
|
|
base: &'a P,
|
2023-08-04 14:42:35 -05:00
|
|
|
) -> InterpResult<'tcx, ArrayIterator<'tcx, 'a, M::Provenance, P>> {
|
2023-07-24 04:44:58 -05:00
|
|
|
let abi::FieldsShape::Array { stride, .. } = base.layout().fields else {
|
|
|
|
span_bug!(self.cur_span(), "operand_array_fields: expected an array layout");
|
|
|
|
};
|
|
|
|
let len = base.len(self)?;
|
|
|
|
let field_layout = base.layout().field(self, 0);
|
2023-08-04 14:42:35 -05:00
|
|
|
Ok(ArrayIterator { base, range: 0..len, stride, field_layout, _phantom: PhantomData })
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
|
2023-07-24 04:44:58 -05:00
|
|
|
/// Subslicing
|
2023-07-25 15:04:02 -05:00
|
|
|
fn project_subslice<P: Projectable<'tcx, M::Provenance>>(
|
2022-07-04 07:48:05 -05:00
|
|
|
&self,
|
2023-07-24 04:44:58 -05:00
|
|
|
base: &P,
|
2022-07-04 07:48:05 -05:00
|
|
|
from: u64,
|
|
|
|
to: u64,
|
|
|
|
from_end: bool,
|
2023-07-24 04:44:58 -05:00
|
|
|
) -> InterpResult<'tcx, P> {
|
|
|
|
let len = base.len(self)?; // also asserts that we have a type where this makes sense
|
2022-07-04 07:48:05 -05:00
|
|
|
let actual_to = if from_end {
|
|
|
|
if from.checked_add(to).map_or(true, |to| to > len) {
|
|
|
|
// This can only be reached in ConstProp and non-rustc-MIR.
|
|
|
|
throw_ub!(BoundsCheckFailed { len: len, index: from.saturating_add(to) });
|
|
|
|
}
|
|
|
|
len.checked_sub(to).unwrap()
|
|
|
|
} else {
|
|
|
|
to
|
|
|
|
};
|
|
|
|
|
|
|
|
// Not using layout method because that works with usize, and does not work with slices
|
|
|
|
// (that have count 0 in their layout).
|
2023-07-24 04:44:58 -05:00
|
|
|
let from_offset = match base.layout().fields {
|
2022-07-04 07:48:05 -05:00
|
|
|
abi::FieldsShape::Array { stride, .. } => stride * from, // `Size` multiplication is checked
|
|
|
|
_ => {
|
2023-07-24 04:44:58 -05:00
|
|
|
span_bug!(
|
|
|
|
self.cur_span(),
|
|
|
|
"unexpected layout of index access: {:#?}",
|
|
|
|
base.layout()
|
|
|
|
)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// Compute meta and new layout
|
|
|
|
let inner_len = actual_to.checked_sub(from).unwrap();
|
2023-07-24 04:44:58 -05:00
|
|
|
let (meta, ty) = match base.layout().ty.kind() {
|
2022-07-04 07:48:05 -05:00
|
|
|
// It is not nice to match on the type, but that seems to be the only way to
|
|
|
|
// implement this.
|
2023-07-05 14:13:26 -05:00
|
|
|
ty::Array(inner, _) => {
|
|
|
|
(MemPlaceMeta::None, Ty::new_array(self.tcx.tcx, *inner, inner_len))
|
|
|
|
}
|
2022-07-04 07:48:05 -05:00
|
|
|
ty::Slice(..) => {
|
2023-02-14 08:31:26 -06:00
|
|
|
let len = Scalar::from_target_usize(inner_len, self);
|
2023-07-24 04:44:58 -05:00
|
|
|
(MemPlaceMeta::Meta(len), base.layout().ty)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
_ => {
|
2023-07-24 04:44:58 -05:00
|
|
|
span_bug!(
|
|
|
|
self.cur_span(),
|
|
|
|
"cannot subslice non-array type: `{:?}`",
|
|
|
|
base.layout().ty
|
|
|
|
)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
};
|
|
|
|
let layout = self.layout_of(ty)?;
|
|
|
|
|
2023-07-23 14:35:54 -05:00
|
|
|
base.offset_with_meta(from_offset, meta, layout, self)
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
|
2023-07-24 04:44:58 -05:00
|
|
|
/// Applying a general projection
|
2022-07-04 07:48:05 -05:00
|
|
|
#[instrument(skip(self), level = "trace")]
|
2023-07-24 04:44:58 -05:00
|
|
|
pub fn project<P>(&self, base: &P, proj_elem: mir::PlaceElem<'tcx>) -> InterpResult<'tcx, P>
|
|
|
|
where
|
2023-07-25 15:04:02 -05:00
|
|
|
P: Projectable<'tcx, M::Provenance> + From<MPlaceTy<'tcx, M::Provenance>> + std::fmt::Debug,
|
2023-07-24 04:44:58 -05:00
|
|
|
{
|
2022-07-04 07:48:05 -05:00
|
|
|
use rustc_middle::mir::ProjectionElem::*;
|
|
|
|
Ok(match proj_elem {
|
2023-09-27 06:23:39 -05:00
|
|
|
OpaqueCast(ty) => {
|
|
|
|
span_bug!(self.cur_span(), "OpaqueCast({ty}) encountered after borrowck")
|
|
|
|
}
|
2023-07-24 04:44:58 -05:00
|
|
|
Field(field, _) => self.project_field(base, field.index())?,
|
|
|
|
Downcast(_, variant) => self.project_downcast(base, variant)?,
|
2023-08-01 06:32:18 -05:00
|
|
|
Deref => self.deref_pointer(&base.to_op(self)?)?.into(),
|
2022-07-04 07:48:05 -05:00
|
|
|
Index(local) => {
|
|
|
|
let layout = self.layout_of(self.tcx.types.usize)?;
|
|
|
|
let n = self.local_to_op(self.frame(), local, Some(layout))?;
|
2023-02-14 08:31:26 -06:00
|
|
|
let n = self.read_target_usize(&n)?;
|
2023-07-24 04:44:58 -05:00
|
|
|
self.project_index(base, n)?
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
|
|
|
ConstantIndex { offset, min_length, from_end } => {
|
2023-07-24 04:44:58 -05:00
|
|
|
self.project_constant_index(base, offset, min_length, from_end)?
|
2022-07-04 07:48:05 -05:00
|
|
|
}
|
2023-07-24 04:44:58 -05:00
|
|
|
Subslice { from, to, from_end } => self.project_subslice(base, from, to, from_end)?,
|
2023-08-16 00:43:30 -05:00
|
|
|
Subtype(ty) => base.transmute(self.layout_of(ty)?, self)?,
|
2022-07-04 07:48:05 -05:00
|
|
|
})
|
|
|
|
}
|
|
|
|
}
|