Enum ProjectionElem 

pub enum ProjectionElem<V, T> {
    Deref,
    Field(FieldIdx, T),
    Index(V),
    ConstantIndex {
        offset: u64,
        min_length: u64,
        from_end: bool,
    },
    Subslice {
        from: u64,
        to: u64,
        from_end: bool,
    },
    Downcast(Option<Symbol>, VariantIdx),
    OpaqueCast(T),
    UnwrapUnsafeBinder(T),
    PhantomDeref,
}

Variants

Deref

Field(FieldIdx, T)

A field (e.g., f in _1.f) is one variant of ProjectionElem. Conceptually, rustc can identify that a field projection refers to either two different regions of memory or the same one between the base and the ‘projection element’. Read more about projections in the rustc-dev-guide

Index(V)

Index into a slice/array.

Note that this does not also dereference, and so it does not exactly correspond to slice indexing in Rust. In other words, in the below Rust code:

let x = &[1, 2, 3, 4];
let i = 2;
x[i];

The x[i] is turned into a Deref followed by an Index, not just an Index. The same thing is true of the ConstantIndex and Subslice projections below.

ConstantIndex

These endpoint-relative indices are generated by slice/array patterns.

For array types, offset is always relative to the start of the array. For slice types, from_end determines whether offset is relative to the start or the end of the slice being inspected.

Slice-pattern indices are easiest to explain by the position of X in these examples:

[X, _, .., _, _] => { offset: 0, min_length: 4, from_end: false },
[_, X, .., _, _] => { offset: 1, min_length: 4, from_end: false },
[_, _, .., X, _] => { offset: 2, min_length: 4, from_end: true },
[_, _, .., _, X] => { offset: 1, min_length: 4, from_end: true },

Fields

offset: u64

• If from_end == false, this is a 0-based offset from the start of the array/slice.
• If from_end == true, this is a 1-based offset from the end of the slice.

min_length: u64

The thing being indexed must be at least this long – otherwise, the projection is UB.

For arrays this is always the exact length.

from_end: bool

If true, offset is a 1-based offset from the end of the slice. Always false when indexing an array.

Subslice

These indices are generated by slice patterns.

If from_end is true slice[from..slice.len() - to]. Otherwise array[from..to].

This projection cannot have ConstantIndex or additional Subslice projections after it before runtime MIR.

Fields

from: u64

to: u64

from_end: bool

Whether to counts from the start or end of the array/slice. For PlaceElems this is true if and only if the base is a slice. For ProjectionKind, this can also be true for arrays.

Downcast(Option<Symbol>, VariantIdx)

“Downcast” to a variant of an enum or a coroutine.

The included Symbol is the name of the variant, used for printing MIR.

This operation itself is never UB, all it does is change the type of the place.

OpaqueCast(T)

Like an explicit cast from an opaque type to a concrete type, but without requiring an intermediate variable.

This is unused with -Znext-solver.

UnwrapUnsafeBinder(T)

A transmute from an unsafe binder to the type that it wraps. This is a projection of a place, so it doesn’t necessarily constitute a move out of the binder.

PhantomDeref

A symbolic dereference of a Reborrow type that does not contain any &mut T fields.

If a type is Reborrow and contains a &mut T field then reborrowing it reborrows the T, producing a borrow on an indirect place, producing a value that can be returned from the function since it does not capture any local place. If no such field exists, then reborrowing the type must dereference the type itself to find an indirect place, but generally such types will not implement Deref. Therefore, in borrow checking we instead perform a “phantom dereference” (named so because the type will usually contain some PhantomData<&'a ()> or equivalent that captures the lifetime) to access an indeterminate indirect place.

FIXME(reborrow): currently this variant is not considered an indirect place for whatever reason. This variant makes no sense if that cannot be fixed.

FIXME(reborrow): if the Reborrow traits experiment is rejected, this variant can be removed: see the PR.

Implementations

impl<V, T> ProjectionElem<V, T>

pub fn is_indirect(&self) -> bool

Returns true if the target of this projection may refer to a different region of memory than the base.

pub fn is_stable_offset(&self) -> bool

Returns true if the target of this projection always refers to the same memory region whatever the state of the program.

pub fn is_downcast_to(&self, v: VariantIdx) -> bool

Returns true if this is a Downcast projection with the given VariantIdx.

pub fn is_field_to(&self, f: FieldIdx) -> bool

Returns true if this is a Field projection with the given index.

pub fn can_use_in_debuginfo(&self) -> bool

Returns true if this is accepted inside VarDebugInfoContents::Place.

pub fn kind(self) -> ProjectionKind

Returns the ProjectionKind associated to this projection.

pub fn try_map<V2, T2>( self, v: impl FnOnce(V) -> Option<V2>, t: impl FnOnce(T) -> T2, ) -> Option<ProjectionElem<V2, T2>>

Apply functions to types and values in this projection and return the result.

Trait Implementations

impl<V: Clone, T: Clone> Clone for ProjectionElem<V, T>

fn clone(&self) -> ProjectionElem<V, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Copy, T: Copy> Copy for ProjectionElem<V, T>

impl<V: Debug, T: Debug> Debug for ProjectionElem<V, T>

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

Formats the value using the given formatter.

impl<'tcx, V, T, __D: TyDecoder<'tcx>> Decodable<__D> for ProjectionElem<V, T>

where T: Decodable<__D>, V: Decodable<__D>,

fn decode(__decoder: &mut __D) -> Self

impl<'tcx, V, T, __E: TyEncoder<'tcx>> Encodable<__E> for ProjectionElem<V, T>

where T: Encodable<__E>, V: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<V: Eq, T: Eq> Eq for ProjectionElem<V, T>

impl<V: Hash, T: Hash> Hash for ProjectionElem<V, T>

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<V: PartialEq, T: PartialEq> PartialEq for ProjectionElem<V, T>

fn eq(&self, other: &ProjectionElem<V, T>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<V, T> StableHash for ProjectionElem<V, T>

where T: StableHash, V: StableHash,

fn stable_hash<__Hcx: StableHashCtxt>( &self, __hcx: &mut __Hcx, __hasher: &mut StableHasher, )

impl<V: PartialEq, T: PartialEq> StructuralPartialEq for ProjectionElem<V, T>

impl<'tcx, V, T> TypeFoldable<TyCtxt<'tcx>> for ProjectionElem<V, T>

where T: TypeFoldable<TyCtxt<'tcx>>, V: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<__F: TypeFolder<TyCtxt<'tcx>>>(self, __folder: &mut __F) -> Self

The entry point for folding. To fold a value t with a folder f call: t.fold_with(f).

impl<'tcx, V, T> TypeVisitable<TyCtxt<'tcx>> for ProjectionElem<V, T>

where T: TypeVisitable<TyCtxt<'tcx>>, V: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

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.