Enum rustc_middle::mir::ProjectionElem
source · pub enum ProjectionElem<V, T1, T2> {
Deref,
Field(Field, T1),
Index(V),
ConstantIndex {
offset: u64,
min_length: u64,
from_end: bool,
},
Subslice {
from: u64,
to: u64,
from_end: bool,
},
Downcast(Option<Symbol>, VariantIdx),
OpaqueCast(T2),
}
Expand description
The different kinds of projections that can be used in the projection of a Place
.
T1
is the generic type for a field projection. For an actual projection on a Place
this parameter will always be Ty
, but the field type can be unavailable when
building (by using PlaceBuilder
) places that correspond to upvars.
T2
is the generic type for an OpaqueCast
(is generic since it’s abstracted over
in dataflow analysis, see AbstractElem
).
Variants§
Deref
Field(Field, T1)
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
Fields
These indices are generated by slice patterns. Easiest to explain by example:
[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 },
Subslice
Fields
These indices are generated by slice patterns.
If from_end
is true slice[from..slice.len() - to]
.
Otherwise array[from..to]
.
Downcast(Option<Symbol>, VariantIdx)
“Downcast” to a variant of an enum or a generator.
The included Symbol is the name of the variant, used for printing MIR.
OpaqueCast(T2)
Like an explicit cast from an opaque type to a concrete type, but without requiring an intermediate variable.
Implementations§
source§impl<V, T, U> ProjectionElem<V, T, U>
impl<V, T, U> ProjectionElem<V, T, U>
sourcefn is_indirect(&self) -> bool
fn is_indirect(&self) -> bool
Returns true
if the target of this projection may refer to a different region of memory
than the base.
sourcepub fn is_downcast_to(&self, v: VariantIdx) -> bool
pub fn is_downcast_to(&self, v: VariantIdx) -> bool
Returns true
if this is a Downcast
projection with the given VariantIdx
.
sourcepub fn is_field_to(&self, f: Field) -> bool
pub fn is_field_to(&self, f: Field) -> bool
Returns true
if this is a Field
projection with the given index.
Trait Implementations§
source§impl<V: Clone, T1: Clone, T2: Clone> Clone for ProjectionElem<V, T1, T2>
impl<V: Clone, T1: Clone, T2: Clone> Clone for ProjectionElem<V, T1, T2>
source§fn clone(&self) -> ProjectionElem<V, T1, T2>
fn clone(&self) -> ProjectionElem<V, T1, T2>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx, V, T1, T2, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for ProjectionElem<V, T1, T2>where
T1: Decodable<__D>,
V: Decodable<__D>,
T2: Decodable<__D>,
impl<'tcx, V, T1, T2, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for ProjectionElem<V, T1, T2>where
T1: Decodable<__D>,
V: Decodable<__D>,
T2: Decodable<__D>,
source§impl<'tcx, V, T1, T2, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for ProjectionElem<V, T1, T2>where
T1: Encodable<__E>,
V: Encodable<__E>,
T2: Encodable<__E>,
impl<'tcx, V, T1, T2, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for ProjectionElem<V, T1, T2>where
T1: Encodable<__E>,
V: Encodable<__E>,
T2: Encodable<__E>,
source§impl<'tcx> From<ProjectionElem<Local, Ty<'tcx>, Ty<'tcx>>> for UpvarProjectionElem<'tcx>
impl<'tcx> From<ProjectionElem<Local, Ty<'tcx>, Ty<'tcx>>> for UpvarProjectionElem<'tcx>
source§impl<'__ctx, V, T1, T2> HashStable<StableHashingContext<'__ctx>> for ProjectionElem<V, T1, T2>where
T1: HashStable<StableHashingContext<'__ctx>>,
V: HashStable<StableHashingContext<'__ctx>>,
T2: HashStable<StableHashingContext<'__ctx>>,
impl<'__ctx, V, T1, T2> HashStable<StableHashingContext<'__ctx>> for ProjectionElem<V, T1, T2>where
T1: HashStable<StableHashingContext<'__ctx>>,
V: HashStable<StableHashingContext<'__ctx>>,
T2: HashStable<StableHashingContext<'__ctx>>,
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl<V: Ord, T1: Ord, T2: Ord> Ord for ProjectionElem<V, T1, T2>
impl<V: Ord, T1: Ord, T2: Ord> Ord for ProjectionElem<V, T1, T2>
source§fn cmp(&self, other: &ProjectionElem<V, T1, T2>) -> Ordering
fn cmp(&self, other: &ProjectionElem<V, T1, T2>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
source§impl<V: PartialEq, T1: PartialEq, T2: PartialEq> PartialEq<ProjectionElem<V, T1, T2>> for ProjectionElem<V, T1, T2>
impl<V: PartialEq, T1: PartialEq, T2: PartialEq> PartialEq<ProjectionElem<V, T1, T2>> for ProjectionElem<V, T1, T2>
source§fn eq(&self, other: &ProjectionElem<V, T1, T2>) -> bool
fn eq(&self, other: &ProjectionElem<V, T1, T2>) -> bool
source§impl<V: PartialOrd, T1: PartialOrd, T2: PartialOrd> PartialOrd<ProjectionElem<V, T1, T2>> for ProjectionElem<V, T1, T2>
impl<V: PartialOrd, T1: PartialOrd, T2: PartialOrd> PartialOrd<ProjectionElem<V, T1, T2>> for ProjectionElem<V, T1, T2>
source§fn partial_cmp(&self, other: &ProjectionElem<V, T1, T2>) -> Option<Ordering>
fn partial_cmp(&self, other: &ProjectionElem<V, T1, T2>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moresource§impl<'tcx, V, T1, T2> TypeFoldable<'tcx> for ProjectionElem<V, T1, T2>where
T1: TypeFoldable<'tcx>,
V: TypeFoldable<'tcx>,
T2: TypeFoldable<'tcx>,
impl<'tcx, V, T1, T2> TypeFoldable<'tcx> for ProjectionElem<V, T1, T2>where
T1: TypeFoldable<'tcx>,
V: TypeFoldable<'tcx>,
T2: TypeFoldable<'tcx>,
source§fn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
source§impl<'tcx, V, T1, T2> TypeVisitable<'tcx> for ProjectionElem<V, T1, T2>where
T1: TypeVisitable<'tcx>,
V: TypeVisitable<'tcx>,
T2: TypeVisitable<'tcx>,
impl<'tcx, V, T1, T2> TypeVisitable<'tcx> for ProjectionElem<V, T1, T2>where
T1: TypeVisitable<'tcx>,
V: TypeVisitable<'tcx>,
T2: TypeVisitable<'tcx>,
source§fn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free. Read moresource§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this type has any regions that escape binder
(and
hence are not bound by it). Read moresource§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
true
if this type has regions that are not a part of the type.
For example, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return true
. The latter can occur when traversing through the
former. Read morefn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Result<(), ErrorGuaranteed>
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization. Read moreimpl<V: Copy, T1: Copy, T2: Copy> Copy for ProjectionElem<V, T1, T2>
impl<V: Eq, T1: Eq, T2: Eq> Eq for ProjectionElem<V, T1, T2>
impl<V, T1, T2> StructuralEq for ProjectionElem<V, T1, T2>
impl<V, T1, T2> StructuralPartialEq for ProjectionElem<V, T1, T2>
Auto Trait Implementations§
impl<V, T1, T2> RefUnwindSafe for ProjectionElem<V, T1, T2>where
T1: RefUnwindSafe,
T2: RefUnwindSafe,
V: RefUnwindSafe,
impl<V, T1, T2> Send for ProjectionElem<V, T1, T2>where
T1: Send,
T2: Send,
V: Send,
impl<V, T1, T2> Sync for ProjectionElem<V, T1, T2>where
T1: Sync,
T2: Sync,
V: Sync,
impl<V, T1, T2> Unpin for ProjectionElem<V, T1, T2>where
T1: Unpin,
T2: Unpin,
V: Unpin,
impl<V, T1, T2> UnwindSafe for ProjectionElem<V, T1, T2>where
T1: UnwindSafe,
T2: UnwindSafe,
V: UnwindSafe,
Blanket Implementations§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T] ⓘ
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it. Read moresource§impl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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, _: &[QueryInfo]) -> 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.