fixed precedence constraint

[libfirm] / ir / be / beutil.h

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index 6e676de..402ad9e 100644 (file)
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -10,6 +10,9 @@
 #include "irnode.h"
 #include "bearch.h"
 
+/* iterate over a list of ir_nodes linked by link field */
+#define foreach_linked_irns(head, iter) for ((iter) = (head); (iter); (iter) = get_irn_link((iter)))
+
 /**
  * Get an empty set.
  * This function always returns the same set.
@@ -116,6 +119,12 @@ void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const
  */
 unsigned get_num_reachable_nodes(ir_graph *irg);
 
+/**
+ * Sets all node inputs to BAD node.
+ * @param irn  The node to be killed.
+ */
+void be_kill_node(ir_node *irn);
+
 /**
  * Search for an irn in @p accept.
  * The search is started at @p start_point_exclusive and continues upwards the dom-tree
@@ -123,4 +132,9 @@ unsigned get_num_reachable_nodes(ir_graph *irg);
  */
 ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive);
 
+/**
+ * Gets the Proj with number pn from irn.
+ */
+ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn);
+
 #endif /* _BEUTIL_H */