Struct rustc_const_eval::interpret::validity::ValidityVisitor
source · 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
sourceimpl<'rt, 'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> ValidityVisitor<'rt, 'mir, 'tcx, M>
impl<'rt, 'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> ValidityVisitor<'rt, 'mir, 'tcx, M>
fn aggregate_field_path_elem(
&mut self,
layout: TyAndLayout<'tcx>,
field: usize
) -> PathElem
fn with_elem<R>(
&mut self,
elem: PathElem,
f: impl FnOnce(&mut Self) -> InterpResult<'tcx, R>
) -> InterpResult<'tcx, R>
fn read_immediate(
&self,
op: &OpTy<'tcx, M::Provenance>,
expected: impl Display
) -> InterpResult<'tcx, ImmTy<'tcx, M::Provenance>>
fn read_scalar(
&self,
op: &OpTy<'tcx, M::Provenance>,
expected: impl Display
) -> InterpResult<'tcx, Scalar<M::Provenance>>
fn check_wide_ptr_meta(
&mut self,
meta: MemPlaceMeta<M::Provenance>,
pointee: TyAndLayout<'tcx>
) -> InterpResult<'tcx>
sourcefn check_safe_pointer(
&mut self,
value: &OpTy<'tcx, M::Provenance>,
kind: &str
) -> InterpResult<'tcx>
fn check_safe_pointer(
&mut self,
value: &OpTy<'tcx, M::Provenance>,
kind: &str
) -> InterpResult<'tcx>
Check a reference or Box
.
sourcefn try_visit_primitive(
&mut self,
value: &OpTy<'tcx, M::Provenance>
) -> InterpResult<'tcx, bool>
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.
fn visit_scalar(
&mut self,
scalar: Scalar<M::Provenance>,
scalar_layout: ScalarAbi
) -> InterpResult<'tcx>
Trait Implementations
sourceimpl<'rt, 'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> ValueVisitor<'mir, 'tcx, M> for ValidityVisitor<'rt, 'mir, 'tcx, M>
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>
sourcefn read_discriminant(
&mut self,
op: &OpTy<'tcx, M::Provenance>
) -> InterpResult<'tcx, VariantIdx>
fn read_discriminant(
&mut self,
op: &OpTy<'tcx, M::Provenance>
) -> InterpResult<'tcx, VariantIdx>
read_discriminant
can be hooked for better error messages.sourcefn visit_field(
&mut self,
old_op: &OpTy<'tcx, M::Provenance>,
field: usize,
new_op: &OpTy<'tcx, M::Provenance>
) -> InterpResult<'tcx>
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. Read more
sourcefn visit_variant(
&mut self,
old_op: &OpTy<'tcx, M::Provenance>,
variant_id: VariantIdx,
new_op: &OpTy<'tcx, M::Provenance>
) -> InterpResult<'tcx>
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. Read more
sourcefn visit_union(
&mut self,
op: &OpTy<'tcx, M::Provenance>,
_fields: NonZeroUsize
) -> InterpResult<'tcx>
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.
sourcefn visit_box(&mut self, op: &OpTy<'tcx, M::Provenance>) -> InterpResult<'tcx>
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
. Read moresourcefn visit_value(&mut self, op: &OpTy<'tcx, M::Provenance>) -> InterpResult<'tcx>
fn visit_value(&mut self, op: &OpTy<'tcx, M::Provenance>) -> InterpResult<'tcx>
Visits the given value, dispatching as appropriate to more specialized visitors.
sourcefn visit_aggregate(
&mut self,
op: &OpTy<'tcx, M::Provenance>,
fields: impl Iterator<Item = InterpResult<'tcx, Self::V>>
) -> InterpResult<'tcx>
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. Read morefn walk_aggregate(
&mut self,
v: &Self::V,
fields: impl Iterator<Item = InterpResult<'tcx, Self::V>>
) -> InterpResult<'tcx>
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>where
'mir: 'rt,
'tcx: 'rt,
impl<'rt, 'mir, 'tcx, M> !UnwindSafe for ValidityVisitor<'rt, 'mir, 'tcx, M>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
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