Struct libfirm_rs::nodes::Store

pub struct Store(_);

Stores a value into memory (heap or stack).

Methods

impl Store

pub fn mem(self) -> Node

Gets memory dependency.

pub fn set_mem(     self,     val: impl NodeTrait )

Sets memory dependency.

pub fn ptr(self) -> Node

Gets address to store to.

pub fn set_ptr(     self,     val: impl NodeTrait )

Sets address to store to.

pub fn value(self) -> Node

Gets value to store.

pub fn set_value(     self,     val: impl NodeTrait )

Sets value to store.

pub fn ty(self) -> Ty

Gets The type of the object which is stored at ptr (need not match with value's type).

pub fn set_ty(self, val: Ty)

Sets The type of the object which is stored at ptr (need not match with value's type).

pub fn volatility(self) -> Type

Gets volatile stores are a visible side-effect and may not be optimized.

pub fn set_volatility(self, val: Type)

Sets volatile stores are a visible side-effect and may not be optimized.

pub fn unaligned(self) -> Type

Gets pointers to unaligned stores don't need to respect the load-mode/type alignments.

pub fn set_unaligned(self, val: Type)

Sets pointers to unaligned stores don't need to respect the load-mode/type alignments.

pub fn new_proj_m(self) -> Proj

memory result.

pub fn new_proj_x_regular(self) -> Proj

control flow when no exception occurs.

pub fn new_proj_x_except(self) -> Proj

control flow when exception occurred.

pub fn out_proj_m(self) -> Option<Proj>

memory result.

pub fn out_proj_x_regular(self) -> Option<Proj>

control flow when no exception occurs.

pub fn out_proj_x_except(self) -> Option<Proj>

control flow when exception occurred.

Trait Implementations

impl NodeTrait for Store

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 Store

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

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

impl PartialEq<Store> for Store

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

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

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

This method tests for !=.

impl From<Store> for Node

fn from(node: Store) -> Node

Performs the conversion.

impl Clone for Store

fn clone(&self) -> Store

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for Store

impl Eq for Store

impl Debug for Store

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

Formats the value using the given formatter.

impl Hash for Store

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].