rustc_middle::mir::syntax

Enum BinOp

Source
pub enum BinOp {
Show 26 variants Add, AddUnchecked, AddWithOverflow, Sub, SubUnchecked, SubWithOverflow, Mul, MulUnchecked, MulWithOverflow, Div, Rem, BitXor, BitAnd, BitOr, Shl, ShlUnchecked, Shr, ShrUnchecked, Eq, Lt, Le, Ne, Ge, Gt, Cmp, Offset,
}

Variants§

§

Add

The + operator (addition)

§

AddUnchecked

Like Add, but with UB on overflow. (Integers only.)

§

AddWithOverflow

Like Add, but returns (T, bool) of both the wrapped result and a bool indicating whether it overflowed.

§

Sub

The - operator (subtraction)

§

SubUnchecked

Like Sub, but with UB on overflow. (Integers only.)

§

SubWithOverflow

Like Sub, but returns (T, bool) of both the wrapped result and a bool indicating whether it overflowed.

§

Mul

The * operator (multiplication)

§

MulUnchecked

Like Mul, but with UB on overflow. (Integers only.)

§

MulWithOverflow

Like Mul, but returns (T, bool) of both the wrapped result and a bool indicating whether it overflowed.

§

Div

The / operator (division)

For integer types, division by zero is UB, as is MIN / -1 for signed. The compiler should have inserted checks prior to this.

Floating-point division by zero is safe, and does not need guards.

§

Rem

The % operator (modulus)

For integer types, using zero as the modulus (second operand) is UB, as is MIN % -1 for signed. The compiler should have inserted checks prior to this.

Floating-point remainder by zero is safe, and does not need guards.

§

BitXor

The ^ operator (bitwise xor)

§

BitAnd

The & operator (bitwise and)

§

BitOr

The | operator (bitwise or)

§

Shl

The << operator (shift left)

The offset is given by RHS.rem_euclid(LHS::BITS). In other words, it is (uniquely) determined as follows:

  • it is “equal modulo LHS::BITS” to the RHS
  • it is in the range 0..LHS::BITS
§

ShlUnchecked

Like Shl, but is UB if the RHS >= LHS::BITS or RHS < 0

§

Shr

The >> operator (shift right)

The offset is given by RHS.rem_euclid(LHS::BITS). In other words, it is (uniquely) determined as follows:

  • it is “equal modulo LHS::BITS” to the RHS
  • it is in the range 0..LHS::BITS

This is an arithmetic shift if the LHS is signed and a logical shift if the LHS is unsigned.

§

ShrUnchecked

Like Shl, but is UB if the RHS >= LHS::BITS or RHS < 0

§

Eq

The == operator (equality)

§

Lt

The < operator (less than)

§

Le

The <= operator (less than or equal to)

§

Ne

The != operator (not equal to)

§

Ge

The >= operator (greater than or equal to)

§

Gt

The > operator (greater than)

§

Cmp

The <=> operator (three-way comparison, like Ord::cmp)

This is supported only on the integer types and char, always returning rustc_hir::LangItem::OrderingEnum (aka std::cmp::Ordering).

Rvalue::BinaryOp(BinOp::Cmp, A, B) returns

  • Ordering::Less (-1_i8, as a Scalar) if A < B
  • Ordering::Equal (0_i8, as a Scalar) if A == B
  • Ordering::Greater (+1_i8, as a Scalar) if A > B
§

Offset

The ptr.offset operator

Implementations§

Source§

impl<'tcx> BinOp

Source

pub fn ty( &self, tcx: TyCtxt<'tcx>, lhs_ty: Ty<'tcx>, rhs_ty: Ty<'tcx>, ) -> Ty<'tcx>

Source§

impl BinOp

Source

pub(crate) fn to_hir_binop(self) -> BinOpKind

Source

pub fn overflowing_to_wrapping(self) -> Option<BinOp>

If this is a FooWithOverflow, return Some(Foo).

Source

pub fn is_overflowing(self) -> bool

Returns whether this is a FooWithOverflow

Source

pub fn wrapping_to_overflowing(self) -> Option<BinOp>

If this is a Foo, return Some(FooWithOverflow).

Trait Implementations§

Source§

impl Clone for BinOp

Source§

fn clone(&self) -> BinOp

Returns a copy of the value. Read more
Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for BinOp

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<__D: TyDecoder> Decodable<__D> for BinOp

Source§

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

Source§

impl<__E: TyEncoder> Encodable<__E> for BinOp

Source§

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

Source§

impl Hash for BinOp

Source§

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

Feeds this value into the given Hasher. Read more
Source§

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

Feeds a slice of this type into the given Hasher. Read more
Source§

impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for BinOp

Source§

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

Source§

impl PartialEq for BinOp

Source§

fn eq(&self, other: &BinOp) -> bool

Tests for self and other values to be equal, and is used by ==.
Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BinOp

Source§

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). Read more
Source§

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.
Source§

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

Source§

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). Read more
Source§

impl Copy for BinOp

Source§

impl Eq for BinOp

Source§

impl StructuralPartialEq for BinOp

Auto Trait Implementations§

§

impl DynSend for BinOp

§

impl DynSync for BinOp

§

impl Freeze for BinOp

§

impl RefUnwindSafe for BinOp

§

impl Send for BinOp

§

impl Sync for BinOp

§

impl Unpin for BinOp

§

impl UnwindSafe for BinOp

Blanket Implementations§

Source§

impl<T> Aligned for T

Source§

const ALIGN: Alignment = _

Alignment of Self.
Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> AnyEq for T
where T: Any + PartialEq,

Source§

fn equals(&self, other: &(dyn Any + 'static)) -> bool

Source§

fn as_any(&self) -> &(dyn Any + 'static)

Source§

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

Source§

fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T

Source§

fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]

Source§

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

Source§

fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T

Source§

fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]

Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
Source§

impl<T, R> CollectAndApply<T, R> for T

Source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

Source§

type Output = R

Source§

impl<Tcx, T> DepNodeParams<Tcx> for T
where Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

Source§

default fn fingerprint_style() -> FingerprintStyle

Source§

default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).
Source§

default fn to_debug_str(&self, _: Tcx) -> String

Source§

default fn recover(_: Tcx, _: &DepNode) -> Option<T>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes 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.
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> Filterable for T

Source§

fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where 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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<P> IntoQueryParam<P> for P

Source§

impl<'tcx, T> IsSuggestable<'tcx> for T
where T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,

Source§

fn is_suggestable(self, tcx: TyCtxt<'tcx>, infer_suggestable: bool) -> bool

Whether this makes sense to suggest in a diagnostic. Read more
Source§

fn make_suggestable( self, tcx: TyCtxt<'tcx>, infer_suggestable: bool, placeholder: Option<Ty<'tcx>>, ) -> Option<T>

Source§

impl<T> MaybeResult<T> for T

Source§

type Error = !

Source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

Source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

Source§

impl<T> Pointable for T

Source§

const ALIGN: usize = _

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

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 T
where U: TryFrom<T>,

Source§

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.
Source§

impl<I, T> TypeVisitableExt<I> for T
where I: Interner, T: TypeVisitable<I>,

Source§

fn has_type_flags(&self, flags: TypeFlags) -> bool

Source§

fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool

Returns 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.
Source§

fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>

Source§

fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool

Returns true if this type has any regions that escape binder (and hence are not bound by it).
Source§

fn has_escaping_bound_vars(&self) -> bool

Return 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 more
Source§

fn has_aliases(&self) -> bool

Source§

fn has_opaque_types(&self) -> bool

Source§

fn has_coroutines(&self) -> bool

Source§

fn references_error(&self) -> bool

Source§

fn has_non_region_param(&self) -> bool

Source§

fn has_infer_regions(&self) -> bool

Source§

fn has_infer_types(&self) -> bool

Source§

fn has_non_region_infer(&self) -> bool

Source§

fn has_infer(&self) -> bool

Source§

fn has_placeholders(&self) -> bool

Source§

fn has_non_region_placeholders(&self) -> bool

Source§

fn has_param(&self) -> bool

Source§

fn has_free_regions(&self) -> bool

“Free” regions in this context means that it has any region that is not (a) erased or (b) late-bound.
Source§

fn has_erased_regions(&self) -> bool

Source§

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.
Source§

fn is_global(&self) -> bool

Indicates whether this value references only ‘global’ generic parameters that are the same regardless of what fn we are in. This is used for caching.
Source§

fn has_bound_regions(&self) -> bool

True if there are any late-bound regions
Source§

fn has_non_region_bound_vars(&self) -> bool

True if there are any late-bound non-region variables
Source§

fn has_bound_vars(&self) -> bool

True if there are any bound variables
Source§

fn still_further_specializable(&self) -> bool

Indicates whether this value still has parameters/placeholders/inference variables which could be replaced later, in a way that would change the results of impl specialization.
Source§

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

Source§

fn upcast(self, interner: I) -> U

Source§

impl<I, T> UpcastFrom<I, T> for T

Source§

fn upcast_from(from: T, _tcx: I) -> T

Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

Source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

Source§

impl<T> ErasedDestructor for T
where T: 'static,

Source§

impl<T> MaybeSendSync for T
where T: Send + Sync,

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: 1 byte

Size for each variant:

  • Add: 0 bytes
  • AddUnchecked: 0 bytes
  • AddWithOverflow: 0 bytes
  • Sub: 0 bytes
  • SubUnchecked: 0 bytes
  • SubWithOverflow: 0 bytes
  • Mul: 0 bytes
  • MulUnchecked: 0 bytes
  • MulWithOverflow: 0 bytes
  • Div: 0 bytes
  • Rem: 0 bytes
  • BitXor: 0 bytes
  • BitAnd: 0 bytes
  • BitOr: 0 bytes
  • Shl: 0 bytes
  • ShlUnchecked: 0 bytes
  • Shr: 0 bytes
  • ShrUnchecked: 0 bytes
  • Eq: 0 bytes
  • Lt: 0 bytes
  • Le: 0 bytes
  • Ne: 0 bytes
  • Ge: 0 bytes
  • Gt: 0 bytes
  • Cmp: 0 bytes
  • Offset: 0 bytes