flowistry_pdg::rustc::mir

Struct Place

Source
pub struct Place<'tcx> {
    pub local: Local,
    pub projection: &'tcx RawList<(), ProjectionElem<Local, Ty<'tcx>>>,
}
Expand description

Places roughly correspond to a “location in memory.” Places in MIR are the same mathematical object as places in Rust. This of course means that what exactly they are is undecided and part of the Rust memory model. However, they will likely contain at least the following pieces of information in some form:

  1. The address in memory that the place refers to.
  2. The provenance with which the place is being accessed.
  3. The type of the place and an optional variant index. See PlaceTy.
  4. Optionally, some metadata. This exists if and only if the type of the place is not Sized.

We’ll give a description below of how all pieces of the place except for the provenance are calculated. We cannot give a description of the provenance, because that is part of the undecided aliasing model - we only include it here at all to acknowledge its existence.

Each local naturally corresponds to the place Place { local, projection: [] }. This place has the address of the local’s allocation and the type of the local.

Needs clarification: Unsized locals seem to present a bit of an issue. Their allocation can’t actually be created on StorageLive, because it’s unclear how big to make the allocation. Furthermore, MIR produces assignments to unsized locals, although that is not permitted under #![feature(unsized_locals)] in Rust. Besides just putting “unsized locals are special and different” in a bunch of places, I (JakobDegen) don’t know how to incorporate this behavior into the current MIR semantics in a clean way - possibly this needs some design work first.

For places that are not locals, ie they have a non-empty list of projections, we define the values as a function of the parent place, that is the place with its last ProjectionElem stripped. The way this is computed of course depends on the kind of that last projection element:

  • Downcast: This projection sets the place’s variant index to the given one, and makes no other changes. A Downcast projection must always be followed immediately by a Field projection.

  • Field: Field projections take their parent place and create a place referring to one of the fields of the type. The resulting address is the parent address, plus the offset of the field. The type becomes the type of the field. If the parent was unsized and so had metadata associated with it, then the metadata is retained if the field is unsized and thrown out if it is sized.

    These projections are only legal for tuples, ADTs, closures, and coroutines. If the ADT or coroutine has more than one variant, the parent place’s variant index must be set, indicating which variant is being used. If it has just one variant, the variant index may or may not be included - the single possible variant is inferred if it is not included.

  • OpaqueCast: This projection changes the place’s type to the given one, and makes no other changes. A OpaqueCast projection on any type other than an opaque type from the current crate is not well-formed.

  • ConstantIndex: Computes an offset in units of T into the place as described in the documentation for the ProjectionElem. The resulting address is the parent’s address plus that offset, and the type is T. This is only legal if the parent place has type [T; N] or [T] (not &[T]). Since such a T is always sized, any resulting metadata is thrown out.

  • Subslice: This projection calculates an offset and a new address in a similar manner as ConstantIndex. It is also only legal on [T; N] and [T]. However, this yields a Place of type [T], and additionally sets the metadata to be the length of the subslice.

  • Index: Like ConstantIndex, only legal on [T; N] or [T]. However, Index additionally takes a local from which the value of the index is computed at runtime. Computing the value of the index involves interpreting the Local as a Place { local, projection: [] }, and then computing its value as if done via Operand::Copy. The array/slice is then indexed with the resulting value. The local must have type usize.

  • Deref: Derefs are the last type of projection, and the most complicated. They are only legal on parent places that are references, pointers, or Box. A Deref projection begins by loading a value from the parent place, as if by Operand::Copy. It then dereferences the resulting pointer, creating a place of the pointee’s type. The resulting address is the address that was stored in the pointer. If the pointee type is unsized, the pointer additionally stored the value of the metadata.

The “validity invariant” of places is the same as that of raw pointers, meaning that e.g. *ptr on a dangling or unaligned pointer is never UB. (Later doing a load/store on that place or turning it into a reference can be UB though!) The only ways for a place computation can cause UB are:

  • On a Deref projection, we do an actual load of the inner place, with all the usual consequences (the inner place must be based on an aligned pointer, it must point to allocated memory, the aliasig model must allow reads, this must not be a data race).
  • For the projections that perform pointer arithmetic, the offset must in-bounds of an allocation (i.e., the preconditions of ptr::offset must be met).

Fields§

§local: Local§projection: &'tcx RawList<(), ProjectionElem<Local, Ty<'tcx>>>

projection out of a place (access a field, deref a pointer, etc)

Auto Trait Implementations§

§

impl<'tcx> Freeze for Place<'tcx>

§

impl<'tcx> !RefUnwindSafe for Place<'tcx>

§

impl<'tcx> Send for Place<'tcx>

§

impl<'tcx> Sync for Place<'tcx>

§

impl<'tcx> Unpin for Place<'tcx>

§

impl<'tcx> !UnwindSafe for Place<'tcx>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dst: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.