Struct LocationTree 

pub struct LocationTree {
    pub perms: UniValMap<LocationState>,
    pub wildcard_accesses: UniValMap<WildcardState>,
}

The state of the full tree for a particular location: for all nodes, the local permissions of that node, and the tracking for wildcard accesses.

Fields

perms: UniValMap<LocationState>

Maps a tag to a perm, with possible lazy initialization.

NOTE: not all tags registered in Tree::nodes are necessarily in all ranges of perms, because perms is in part lazily initialized. Just because nodes.get(key) is Some(_) does not mean you can safely unwrap any perm.get(key).

We do uphold the fact that keys(perms) is a subset of keys(nodes)

wildcard_accesses: UniValMap<WildcardState>

Maps a tag and a location to its wildcard access tracking information, with possible lazy initialization.

If this allocation doesn’t have any exposed nodes, then this map doesn’t get initialized. This way we only need to allocate the map if we need it.

NOTE: same guarantees on entry initialization as for perms.

Implementations

impl<'tcx> LocationTree

fn perform_access( &mut self, roots: impl Iterator<Item = UniIndex>, nodes: &mut UniValMap<Node>, access_source: Option<UniIndex>, loc_range: Range<u64>, access_range: Option<AllocRange>, access_kind: AccessKind, access_cause: AccessCause, global: &RefCell<GlobalStateInner>, alloc_id: AllocId, span: Span, visit_children: ChildrenVisitMode, ) -> InterpResult<'tcx>

Performs an access on this location.

• access_source: The index, if any, where the access came from.
• visit_children: Whether to skip updating the children of access_source.

fn perform_normal_access( &mut self, access_source: UniIndex, nodes: &mut UniValMap<Node>, loc_range: Range<u64>, access_range: Option<AllocRange>, access_kind: AccessKind, access_cause: AccessCause, global: &RefCell<GlobalStateInner>, alloc_id: AllocId, span: Span, visit_children: ChildrenVisitMode, ) -> InterpResult<'tcx, UniIndex>

Performs a normal access on the tree containing access_source.

Returns the root index of this tree.

• access_source: The index of the tag being accessed.
• visit_children: Whether to skip the children of access_source during the access. Used for protector end access.

fn perform_wildcard_access( &mut self, root: UniIndex, access_source: Option<UniIndex>, max_local_tag: Option<BorTag>, nodes: &mut UniValMap<Node>, loc_range: Range<u64>, access_range: Option<AllocRange>, access_kind: AccessKind, access_cause: AccessCause, global: &RefCell<GlobalStateInner>, alloc_id: AllocId, span: Span, ) -> InterpResult<'tcx>

Performs a wildcard access on the tree with root root. Takes the access_relatedness for each node from the WildcardState datastructure.

• root: Root of the tree being accessed.
• access_source: the index of the accessed tag, if any. This is only used for printing the correct tag on errors.
• max_local_tag: The access can only be local for nodes whose tag is at most max_local_tag.

Trait Implementations

impl Clone for LocationTree

fn clone(&self) -> LocationTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LocationTree

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

Formats the value using the given formatter.

impl PartialEq for LocationTree

fn eq(&self, other: &LocationTree) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for LocationTree

impl StructuralPartialEq for LocationTree

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: 48 bytes