Struct libfirm_rs::nodes::Shr

pub struct Shr(_);

Returns its first operands bits shifted right by the amount of the 2nd operand. No special handling for the sign bit is performed (zero extension). The right input (shift amount) must be an unsigned integer value. If the result mode has modulo_shift!=0, then the effective shift amount is the right input modulo this modulo_shift amount.

Methods

impl Shr

pub fn left(self) -> Node

Gets first operand.

pub fn set_left(     self,     val: impl NodeTrait )

Sets first operand.

pub fn right(self) -> Node

Gets second operand.

pub fn set_right(     self,     val: impl NodeTrait )

Sets second operand.

Trait Implementations

impl NodeTrait for Shr

fn internal_ir_node(&self) -> *mut ir_node

fn as_node(&self) -> Node

fn keep_alive(&self)

fn mode(&self) -> Mode

fn block(&self) -> Block

fn set_block(&self, block: Block)

Important traits for OutNodeIterator

impl Iterator for OutNodeIterator type Item = Node;

fn out_nodes(&self) -> OutNodeIterator

Important traits for OutNodeExIterator

impl Iterator for OutNodeExIterator type Item = (Node, i32);

fn out_nodes_ex(&self) -> OutNodeExIterator

fn all_out_projs(&self) -> Vec<Proj>

fn collect_all_out_projs(&self, projs: &mut Vec<Proj>)

Important traits for InNodeIterator

impl Iterator for InNodeIterator type Item = Node;

fn in_nodes(&self) -> InNodeIterator

fn set_input_at(&self, idx: i32, pred: Node)

fn set_in_nodes(&self, nodes: &[Node])

fn node_id(&self) -> i64

fn is_pinned(&self) -> bool

fn is_commutative(&self) -> bool

fn is_only_valid_in_start_block(&self) -> bool

fn graph(&self) -> Graph

fn walk<F>(&self, walker: F) where     F: FnMut(VisitTime, Node),     Self: Sized,

libifrm irg_walk wrapper

fn walk_dfs_in_block_stop_at_phi_node<Callback>(     &self,     block: Block,     callback: &mut Callback ) where     Callback: FnMut(Node),     Self: Sized,

Perform a DFS over all nodes within block starting at self. As soon as a Phi node is reached, that branch of the DFS is canceled. There is no callback for a Phi node. The primary use case for this API is in codegen.

impl NodeDebug for Shr

fn fmt(&self, f: &mut Formatter, _opts: NodeDebugOpts) -> Result

fn debug_fmt(self) -> NodeDebugFmt<Self> where     Self: Sized + Copy,

impl ValueNode for Shr

fn value_nodes(&self) -> Vec<Box<dyn ValueNode>>

fn compute(&self, values: Vec<Tarval>) -> Tarval

impl PartialEq<Shr> for Shr

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl From<Shr> for Node

fn from(node: Shr) -> Node

Performs the conversion.

impl Clone for Shr

fn clone(&self) -> Shr

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for Shr

impl Eq for Shr

impl Debug for Shr

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

Formats the value using the given formatter.

impl Hash for Shr

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,

Feeds a slice of this type into the given [Hasher].