Enum NonDivergingIntrinsic

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

impl<'tcx> Clone for NonDivergingIntrinsic<'tcx>

fn clone(&self) -> NonDivergingIntrinsic<'tcx>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'tcx> Debug for NonDivergingIntrinsic<'tcx>

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

Formats the value using the given formatter.

impl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for NonDivergingIntrinsic<'tcx>

fn decode(__decoder: &mut __D) -> Self

impl Display for NonDivergingIntrinsic<'_>

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

Formats the value using the given formatter.

impl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for NonDivergingIntrinsic<'tcx>

fn encode(&self, __encoder: &mut __E)

impl<'tcx> Hash for NonDivergingIntrinsic<'tcx>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for NonDivergingIntrinsic<'tcx>

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )

impl<'tcx> PartialEq for NonDivergingIntrinsic<'tcx>

fn eq(&self, other: &NonDivergingIntrinsic<'tcx>) -> 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<'tcx> TypeFoldable<TyCtxt<'tcx>> for NonDivergingIntrinsic<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for NonDivergingIntrinsic<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> StructuralPartialEq for NonDivergingIntrinsic<'tcx>

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 bytes
• CopyNonOverlapping: 72 bytes