Struct libfirm_rs::nodes::Phi

pub struct Phi(_);

Choose a value based on control flow. A phi node has 1 input for each predecessor of its block. If a block is entered from its nth predecessor all phi nodes produce their nth input as result.

Methods

impl Phi

Important traits for PhiPredsIterator

impl Iterator for PhiPredsIterator type Item = Node;

pub fn phi_preds(self) -> PhiPredsIterator

pub fn preds(     self ) -> impl Iterator<Item = (Block, Node)>

Node is the result of the phi node when entering this phi's block via Block

impl Phi

pub fn loop_(self) -> i32

Gets whether Phi represents the observable effect of a (possibly) nonterminating loop.

pub fn set_loop_(self, val: i32)

Sets whether Phi represents the observable effect of a (possibly) nonterminating loop.

Trait Implementations

impl NodeTrait for Phi

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 Phi

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

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

impl ValueNode for Phi

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

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

impl PartialEq<Phi> for Phi

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

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

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

This method tests for !=.

impl From<Phi> for Node

fn from(node: Phi) -> Node

Performs the conversion.

impl Clone for Phi

fn clone(&self) -> Phi

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for Phi

impl Eq for Phi

impl Debug for Phi

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

Formats the value using the given formatter.

impl Hash for Phi

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