Struct rustc_middle::mir::statement::PlaceRef
source · pub struct PlaceRef<'tcx> {
pub local: Local,
pub projection: &'tcx [PlaceElem<'tcx>],
}
Fields§
§local: Local
§projection: &'tcx [PlaceElem<'tcx>]
Implementations§
source§impl<'tcx> PlaceRef<'tcx>
impl<'tcx> PlaceRef<'tcx>
sourcepub fn local_or_deref_local(&self) -> Option<Local>
pub fn local_or_deref_local(&self) -> Option<Local>
Finds the innermost Local
from this Place
, if it is either a local itself or
a single deref of a local.
sourcepub fn is_indirect(&self) -> bool
pub fn is_indirect(&self) -> bool
Returns true
if this Place
contains a Deref
projection.
If Place::is_indirect
returns false, the caller knows that the Place
refers to the
same region of memory as its base.
sourcepub fn is_indirect_first_projection(&self) -> bool
pub fn is_indirect_first_projection(&self) -> bool
Returns true
if this Place
’s first projection is Deref
.
This is useful because for MIR phases AnalysisPhase::PostCleanup
and later,
Deref
projections can only occur as the first projection. In that case this method
is equivalent to is_indirect
, but faster.
sourcepub fn as_local(&self) -> Option<Local>
pub fn as_local(&self) -> Option<Local>
If this place represents a local variable like _X
with no
projections, return Some(_X)
.
pub fn last_projection(&self) -> Option<(PlaceRef<'tcx>, PlaceElem<'tcx>)>
sourcepub fn iter_projections(
self
) -> impl Iterator<Item = (PlaceRef<'tcx>, PlaceElem<'tcx>)> + DoubleEndedIterator
pub fn iter_projections( self ) -> impl Iterator<Item = (PlaceRef<'tcx>, PlaceElem<'tcx>)> + DoubleEndedIterator
Iterate over the projections in evaluation order, i.e., the first element is the base with its projection and then subsequently more projections are added. As a concrete example, given the place a.b.c, this would yield:
- (a, .b)
- (a.b, .c)
Given a place without projections, the iterator is empty.
sourcepub fn project_deeper(
self,
more_projections: &[PlaceElem<'tcx>],
tcx: TyCtxt<'tcx>
) -> Place<'tcx>
pub fn project_deeper( self, more_projections: &[PlaceElem<'tcx>], tcx: TyCtxt<'tcx> ) -> Place<'tcx>
Generates a new place by appending more_projections
to the existing ones
and interning the result.
Trait Implementations§
source§impl<'tcx> PartialEq<PlaceRef<'tcx>> for PlaceRef<'tcx>
impl<'tcx> PartialEq<PlaceRef<'tcx>> for PlaceRef<'tcx>
source§impl<'tcx> !PartialOrd<PlaceRef<'tcx>> for PlaceRef<'tcx>
impl<'tcx> !PartialOrd<PlaceRef<'tcx>> for PlaceRef<'tcx>
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 moreimpl<'tcx> Copy for PlaceRef<'tcx>
impl<'tcx> Eq for PlaceRef<'tcx>
impl<'tcx> StructuralEq for PlaceRef<'tcx>
impl<'tcx> StructuralPartialEq for PlaceRef<'tcx>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for PlaceRef<'tcx>
impl<'tcx> Send for PlaceRef<'tcx>
impl<'tcx> Sync for PlaceRef<'tcx>
impl<'tcx> Unpin for PlaceRef<'tcx>
impl<'tcx> !UnwindSafe for PlaceRef<'tcx>
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<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
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
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, cycle: &[QueryInfo], _guar: ErrorGuaranteed ) -> T
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 24 bytes