Struct rustc_middle::middle::region::ScopeTree

source ·
pub struct ScopeTree {
    pub root_body: Option<HirId>,
    pub parent_map: FxIndexMap<Scope, (Scope, ScopeDepth)>,
    var_map: FxIndexMap<ItemLocalId, Scope>,
    pub rvalue_candidates: HirIdMap<RvalueCandidateType>,
    pub yield_in_scope: UnordMap<Scope, Vec<YieldData>>,
}
Expand description

The region scope tree encodes information about region relationships.

Fields§

§root_body: Option<HirId>

If not empty, this body is the root of this region hierarchy.

§parent_map: FxIndexMap<Scope, (Scope, ScopeDepth)>

Maps from a scope ID to the enclosing scope id; this is usually corresponding to the lexical nesting, though in the case of closures the parent scope is the innermost conditional expression or repeating block. (Note that the enclosing scope ID for the block associated with a closure is the closure itself.)

§var_map: FxIndexMap<ItemLocalId, Scope>

Maps from a variable or binding ID to the block in which that variable is declared.

§rvalue_candidates: HirIdMap<RvalueCandidateType>

Identifies expressions which, if captured into a temporary, ought to have a temporary whose lifetime extends to the end of the enclosing block, and not the enclosing statement. Expressions that are not present in this table are not rvalue candidates. The set of rvalue candidates is computed during type check based on a traversal of the AST.

§yield_in_scope: UnordMap<Scope, Vec<YieldData>>

If there are any yield nested within a scope, this map stores the Span of the last one and its index in the postorder of the Visitor traversal on the HIR.

HIR Visitor postorder indexes might seem like a peculiar thing to care about. but it turns out that HIR bindings and the temporary results of HIR expressions are never storage-live at the end of HIR nodes with postorder indexes lower than theirs, and therefore don’t need to be suspended at yield-points at these indexes.

For an example, suppose we have some code such as:

    foo(f(), yield y, bar(g()))

With the HIR tree (calls numbered for expository purposes)

    Call#0(foo, [Call#1(f), Yield(y), Call#2(bar, Call#3(g))])

Obviously, the result of f() was created before the yield (and therefore needs to be kept valid over the yield) while the result of g() occurs after the yield (and therefore doesn’t). If we want to infer that, we can look at the postorder traversal:

    `foo` `f` Call#1 `y` Yield `bar` `g` Call#3 Call#2 Call#0

In which we can easily see that Call#1 occurs before the yield, and Call#3 after it.

To see that this method works, consider:

Let D be our binding/temporary and U be our other HIR node, with HIR-postorder(U) < HIR-postorder(D). Suppose, as in our example, U is the yield and D is one of the calls. Let’s show that D is storage-dead at U.

Remember that storage-live/storage-dead refers to the state of the storage, and does not consider moves/drop flags.

Then:

  1. From the ordering guarantee of HIR visitors (see rustc_hir::intravisit), D does not dominate U.

  2. Therefore, D is potentially storage-dead at U (because we might visit U without ever getting to D).

  3. However, we guarantee that at each HIR point, each binding/temporary is always either always storage-live or always storage-dead. This is what is being guaranteed by terminating_scopes including all blocks where the count of executions is not guaranteed.

  4. By 2. and 3., D is statically storage-dead at U, QED.

This property ought to not on (3) in an essential way – it is probably still correct even if we have “unrestricted” terminating scopes. However, why use the complicated proof when a simple one works?

A subtle thing: box expressions, such as box (&x, yield 2, &y). It might seem that a box expression creates a Box<T> temporary when it starts executing, at HIR-preorder(BOX-EXPR). That might be true in the MIR desugaring, but it is not important in the semantics.

The reason is that semantically, until the box expression returns, the values are still owned by their containing expressions. So we’ll see that &x.

Implementations§

source§

impl ScopeTree

source

pub fn record_scope_parent( &mut self, child: Scope, parent: Option<(Scope, ScopeDepth)> )

source

pub fn record_var_scope(&mut self, var: ItemLocalId, lifetime: Scope)

source

pub fn record_rvalue_candidate( &mut self, var: HirId, candidate_type: RvalueCandidateType )

source

pub fn opt_encl_scope(&self, id: Scope) -> Option<Scope>

Returns the narrowest scope that encloses id, if any.

source

pub fn var_scope(&self, var_id: ItemLocalId) -> Option<Scope>

Returns the lifetime of the local variable var_id, if any.

source

pub fn is_subscope_of(&self, subscope: Scope, superscope: Scope) -> bool

Returns true if subscope is equal to or is lexically nested inside superscope, and false otherwise.

Used by clippy.

source

pub fn yield_in_scope(&self, scope: Scope) -> Option<&[YieldData]>

Checks whether the given scope contains a yield. If so, returns Some(YieldData). If not, returns None.

Trait Implementations§

source§

impl<'tcx> ArenaAllocatable<'tcx> for ScopeTree

source§

fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Self> ) -> &'a mut [Self]

source§

impl Debug for ScopeTree

source§

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

Formats the value using the given formatter. Read more
source§

impl Default for ScopeTree

source§

fn default() -> ScopeTree

Returns the “default value” for a type. Read more
source§

impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for ScopeTree

source§

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
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, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

§

type Output = R

source§

impl<Tcx, T> DepNodeParams<Tcx> for T
where Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

source§

default fn fingerprint_style() -> FingerprintStyle

source§

default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).
source§

default fn to_debug_str(&self, _: Tcx) -> String

source§

default fn recover(_: Tcx, _: &DepNode) -> Option<T>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes 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.
source§

impl<T> Filterable for T

source§

fn filterable( self, filter_name: &'static str ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
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<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<'tcx, T> ToPredicate<'tcx, T> for T

source§

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

source§

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

§

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>,

§

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.
source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> T

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for 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: 208 bytes