Struct miri::helpers::UnsafeCellVisitor

struct UnsafeCellVisitor<'ecx, 'mir, 'tcx, F>where
    F: FnMut(&MPlaceTy<'tcx, Provenance>) -> InterpResult<'tcx>,{
    ecx: &'ecx MiriInterpCx<'mir, 'tcx>,
    unsafe_cell_action: F,
}

Visiting the memory covered by a MemPlace, being aware of whether we are inside an UnsafeCell or not.

Fields

ecx: &'ecx MiriInterpCx<'mir, 'tcx>

unsafe_cell_action: F

Trait Implementations

impl<'ecx, 'mir, 'tcx: 'mir, F> ValueVisitor<'mir, 'tcx, MiriMachine<'mir, 'tcx>> for UnsafeCellVisitor<'ecx, 'mir, 'tcx, F>where F: FnMut(&MPlaceTy<'tcx, Provenance>) -> InterpResult<'tcx>,

type V = MPlaceTy<'tcx, Provenance>

fn ecx(&self) -> &MiriInterpCx<'mir, 'tcx>

The visitor must have an InterpCx in it.

fn visit_value(&mut self, v: &MPlaceTy<'tcx, Provenance>) -> InterpResult<'tcx>

Visits the given value, dispatching as appropriate to more specialized visitors.

fn visit_aggregate( &mut self, place: &MPlaceTy<'tcx, Provenance>, fields: impl Iterator<Item = InterpResult<'tcx, MPlaceTy<'tcx, Provenance>>> ) -> InterpResult<'tcx>

Visits this value as an aggregate, you are getting an iterator yielding all the fields (still in an InterpResult, you have to do error handling yourself). Recurses into the fields.

fn visit_union( &mut self, _v: &MPlaceTy<'tcx, Provenance>, _fields: NonZeroUsize ) -> InterpResult<'tcx>

Visits the given value as a union. No automatic recursion can happen here.

fn read_discriminant( &mut self, op: &OpTy<'tcx, <M as Machine<'mir, 'tcx>>::Provenance> ) -> Result<VariantIdx, InterpErrorInfo<'tcx>>

read_discriminant can be hooked for better error messages.

fn visit_box(&mut self, _v: &Self::V) -> Result<(), InterpErrorInfo<'tcx>>

Visits the given value as the pointer of a Box. There is nothing to recurse into. The type of v will be a raw pointer, but this is a field of Box<T> and the pointee type is the actual T.

fn visit_field( &mut self, _old_val: &Self::V, _field: usize, new_val: &Self::V ) -> Result<(), InterpErrorInfo<'tcx>>

Called each time we recurse down to a field of a “product-like” aggregate (structs, tuples, arrays and the like, but not enums), passing in old (outer) and new (inner) value. This gives the visitor the chance to track the stack of nested fields that we are descending through.

fn visit_variant( &mut self, _old_val: &Self::V, _variant: VariantIdx, new_val: &Self::V ) -> Result<(), InterpErrorInfo<'tcx>>

Called when recursing into an enum variant. This gives the visitor the chance to track the stack of nested fields that we are descending through.

fn walk_aggregate( &mut self, v: &Self::V, fields: impl Iterator<Item = Result<Self::V, InterpErrorInfo<'tcx>>> ) -> Result<(), InterpErrorInfo<'tcx>>

fn walk_value(&mut self, v: &Self::V) -> Result<(), InterpErrorInfo<'tcx>>

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.