struct ValidityVisitor<'rt, 'mir, 'tcx, M: Machine<'mir, 'tcx>> {
    path: Vec<PathElem>,
    ref_tracking: Option<&'rt mut RefTracking<MPlaceTy<'tcx, M::Provenance>, Vec<PathElem>>>,
    ctfe_mode: Option<CtfeValidationMode>,
    ecx: &'rt InterpCx<'mir, 'tcx, M>,
}

Fields§

§path: Vec<PathElem>

The path may be pushed to, but the part that is present when a function starts must not be changed! visit_fields and visit_array rely on this stack discipline.

§ref_tracking: Option<&'rt mut RefTracking<MPlaceTy<'tcx, M::Provenance>, Vec<PathElem>>>§ctfe_mode: Option<CtfeValidationMode>

None indicates this is not validating for CTFE (but for runtime).

§ecx: &'rt InterpCx<'mir, 'tcx, M>

Implementations§

source§

impl<'rt, 'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> ValidityVisitor<'rt, 'mir, 'tcx, M>

source

fn aggregate_field_path_elem( &mut self, layout: TyAndLayout<'tcx>, field: usize ) -> PathElem

source

fn with_elem<R>( &mut self, elem: PathElem, f: impl FnOnce(&mut Self) -> InterpResult<'tcx, R> ) -> InterpResult<'tcx, R>

source

fn read_immediate( &self, op: &OpTy<'tcx, M::Provenance>, expected: impl Display ) -> InterpResult<'tcx, ImmTy<'tcx, M::Provenance>>

source

fn read_scalar( &self, op: &OpTy<'tcx, M::Provenance>, expected: impl Display ) -> InterpResult<'tcx, Scalar<M::Provenance>>

source

fn check_wide_ptr_meta( &mut self, meta: MemPlaceMeta<M::Provenance>, pointee: TyAndLayout<'tcx> ) -> InterpResult<'tcx>

source

fn check_safe_pointer( &mut self, value: &OpTy<'tcx, M::Provenance>, kind: &str ) -> InterpResult<'tcx>

Check a reference or Box.

source

fn try_visit_primitive( &mut self, value: &OpTy<'tcx, M::Provenance> ) -> InterpResult<'tcx, bool>

Check if this is a value of primitive type, and if yes check the validity of the value at that type. Return true if the type is indeed primitive.

source

fn visit_scalar( &mut self, scalar: Scalar<M::Provenance>, scalar_layout: ScalarAbi ) -> InterpResult<'tcx>

Trait Implementations§

source§

impl<'rt, 'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> ValueVisitor<'mir, 'tcx, M> for ValidityVisitor<'rt, 'mir, 'tcx, M>

§

type V = OpTy<'tcx, <M as Machine<'mir, 'tcx>>::Provenance>

source§

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

The visitor must have an InterpCx in it.
source§

fn read_discriminant( &mut self, op: &OpTy<'tcx, M::Provenance> ) -> InterpResult<'tcx, VariantIdx>

read_discriminant can be hooked for better error messages.
source§

fn visit_field( &mut self, old_op: &OpTy<'tcx, M::Provenance>, field: usize, new_op: &OpTy<'tcx, M::Provenance> ) -> InterpResult<'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.
source§

fn visit_variant( &mut self, old_op: &OpTy<'tcx, M::Provenance>, variant_id: VariantIdx, new_op: &OpTy<'tcx, M::Provenance> ) -> InterpResult<'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.
source§

fn visit_union( &mut self, op: &OpTy<'tcx, M::Provenance>, _fields: NonZeroUsize ) -> InterpResult<'tcx>

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

fn visit_box(&mut self, op: &OpTy<'tcx, M::Provenance>) -> InterpResult<'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.
source§

fn visit_value(&mut self, op: &OpTy<'tcx, M::Provenance>) -> InterpResult<'tcx>

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

fn visit_aggregate( &mut self, op: &OpTy<'tcx, M::Provenance>, fields: impl Iterator<Item = InterpResult<'tcx, Self::V>> ) -> 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.
source§

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

source§

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

Auto Trait Implementations§

§

impl<'rt, 'mir, 'tcx, M> !RefUnwindSafe for ValidityVisitor<'rt, 'mir, 'tcx, M>

§

impl<'rt, 'mir, 'tcx, M> !Send for ValidityVisitor<'rt, 'mir, 'tcx, M>

§

impl<'rt, 'mir, 'tcx, M> !Sync for ValidityVisitor<'rt, 'mir, 'tcx, M>

§

impl<'rt, 'mir, 'tcx, M> Unpin for ValidityVisitor<'rt, 'mir, 'tcx, M>

§

impl<'rt, 'mir, 'tcx, M> !UnwindSafe for ValidityVisitor<'rt, 'mir, 'tcx, M>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. 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 Twhere 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, U> TryFrom<U> for Twhere 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 Twhere 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.

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