Enum rustc_middle::mir::syntax::NonDivergingIntrinsic
source · pub enum NonDivergingIntrinsic<'tcx> {
Assume(Operand<'tcx>),
CopyNonOverlapping(CopyNonOverlapping<'tcx>),
}
Variants§
Assume(Operand<'tcx>)
Denotes a call to the intrinsic function assume
.
The operand must be a boolean. Optimizers may use the value of the boolean to backtrack its
computation to infer information about other variables. So if the boolean came from a
x < y
operation, subsequent operations on x
and y
could elide various bound checks.
If the argument is false
, this operation is equivalent to TerminatorKind::Unreachable
.
CopyNonOverlapping(CopyNonOverlapping<'tcx>)
Denotes a call to the intrinsic function copy_nonoverlapping
.
First, all three operands are evaluated. src
and dest
must each be a reference, pointer,
or Box
pointing to the same type T
. count
must evaluate to a usize
. Then, src
and
dest
are dereferenced, and count * size_of::<T>()
bytes beginning with the first byte of
the src
place are copied to the contiguous range of bytes beginning with the first byte
of dest
.
Needs clarification: In what order are operands computed and dereferenced? It should probably match the order for assignment, but that is also undecided.
Needs clarification: Is this typed or not, ie is there a typed load and store involved? I vaguely remember Ralf saying somewhere that he thought it should not be.
Trait Implementations§
source§impl<'tcx> Clone for NonDivergingIntrinsic<'tcx>
impl<'tcx> Clone for NonDivergingIntrinsic<'tcx>
source§fn clone(&self) -> NonDivergingIntrinsic<'tcx>
fn clone(&self) -> NonDivergingIntrinsic<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx> Debug for NonDivergingIntrinsic<'tcx>
impl<'tcx> Debug for NonDivergingIntrinsic<'tcx>
source§impl Display for NonDivergingIntrinsic<'_>
impl Display for NonDivergingIntrinsic<'_>
source§impl<'tcx> Hash for NonDivergingIntrinsic<'tcx>
impl<'tcx> Hash for NonDivergingIntrinsic<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for NonDivergingIntrinsic<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for NonDivergingIntrinsic<'tcx>
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl<'tcx> PartialEq<NonDivergingIntrinsic<'tcx>> for NonDivergingIntrinsic<'tcx>
impl<'tcx> PartialEq<NonDivergingIntrinsic<'tcx>> for NonDivergingIntrinsic<'tcx>
source§fn eq(&self, other: &NonDivergingIntrinsic<'tcx>) -> bool
fn eq(&self, other: &NonDivergingIntrinsic<'tcx>) -> bool
source§impl<'tcx> TypeFoldable<'tcx> for NonDivergingIntrinsic<'tcx>
impl<'tcx> TypeFoldable<'tcx> for NonDivergingIntrinsic<'tcx>
source§fn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
source§impl<'tcx> TypeVisitable<'tcx> for NonDivergingIntrinsic<'tcx>
impl<'tcx> TypeVisitable<'tcx> for NonDivergingIntrinsic<'tcx>
source§fn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free. Read moresource§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this type has any regions that escape binder
(and
hence are not bound by it). Read moresource§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
true
if this type has regions that are not a part of the type.
For example, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return true
. The latter can occur when traversing through the
former. Read morefn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Result<(), ErrorGuaranteed>
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization. Read moreimpl<'tcx> StructuralPartialEq for NonDivergingIntrinsic<'tcx>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for NonDivergingIntrinsic<'tcx>
impl<'tcx> !Send for NonDivergingIntrinsic<'tcx>
impl<'tcx> !Sync for NonDivergingIntrinsic<'tcx>
impl<'tcx> Unpin for NonDivergingIntrinsic<'tcx>
impl<'tcx> !UnwindSafe for NonDivergingIntrinsic<'tcx>
Blanket Implementations§
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s 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. Read moresource§impl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error(tcx: Tcx, _: &[QueryInfo]) -> 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: 72 bytes
Size for each variant:
Assume
: 32 bytesCopyNonOverlapping
: 72 bytes