Enum rustc_middle::mir::BinOp
source · [−]pub enum BinOp {
Show 17 variants
Add,
Sub,
Mul,
Div,
Rem,
BitXor,
BitAnd,
BitOr,
Shl,
Shr,
Eq,
Lt,
Le,
Ne,
Ge,
Gt,
Offset,
}Variants
Add
The + operator (addition)
Sub
The - operator (subtraction)
Mul
The * operator (multiplication)
Div
The / operator (division)
Division by zero is UB.
Rem
The % operator (modulus)
Using zero as the modulus (second operand) is UB.
BitXor
The ^ operator (bitwise xor)
BitAnd
The & operator (bitwise and)
BitOr
The | operator (bitwise or)
Shl
The << operator (shift left)
The offset is truncated to the size of the first operand before shifting.
Shr
The >> operator (shift right)
The offset is truncated to the size of the first operand before shifting.
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)
Offset
The ptr.offset operator
Implementations
sourceimpl BinOp
impl BinOp
pub fn to_hir_binop(self) -> BinOpKind
sourceimpl BinOp
impl BinOp
pub fn is_checkable(self) -> bool
Trait Implementations
sourceimpl<'__ctx> HashStable<StableHashingContext<'__ctx>> for BinOp
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for BinOp
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
sourceimpl PartialOrd<BinOp> for BinOp
impl PartialOrd<BinOp> for BinOp
sourcefn partial_cmp(&self, other: &BinOp) -> Option<Ordering>
fn partial_cmp(&self, other: &BinOp) -> Option<Ordering>
This method returns an ordering between self and other values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
impl Copy for BinOp
impl Eq for BinOp
impl StructuralEq for BinOp
impl StructuralPartialEq for BinOp
Auto Trait Implementations
impl RefUnwindSafe for BinOp
impl Send for BinOp
impl Sync for BinOp
impl Unpin for BinOp
impl UnwindSafe for BinOp
Blanket Implementations
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T where
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T where
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
pub default fn fingerprint_style() -> FingerprintStyle
sourcepub default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
pub default fn to_fingerprint(&self, tcx: Ctxt) -> 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). Read more
pub default fn to_debug_str(&self, Ctxt) -> String
sourcepub default fn recover(
Ctxt,
&DepNode<<Ctxt as DepContext>::DepKind>
) -> Option<T>
pub default fn recover(
Ctxt,
&DepNode<<Ctxt as DepContext>::DepKind>
) -> 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. Read more
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into)Uses borrowed data to replace owned data, usually by cloning. Read more
impl<'a, T> Captures<'a> for T where
T: ?Sized,
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 bytesSub: 0 bytesMul: 0 bytesDiv: 0 bytesRem: 0 bytesBitXor: 0 bytesBitAnd: 0 bytesBitOr: 0 bytesShl: 0 bytesShr: 0 bytesEq: 0 bytesLt: 0 bytesLe: 0 bytesNe: 0 bytesGe: 0 bytesGt: 0 bytesOffset: 0 bytes