X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firopt_t.h;h=dd7964888c4076357f6f88dc80ba0e892b13e35a;hb=af82344c3d1ede9a28e652302a8c2bac7bb1c743;hp=5e95c801dd4fb803412767dd1a8df6597a071bd5;hpb=0c8ec6efe050e425be99454315e4f58b0976a38a;p=libfirm

diff --git a/ir/ir/iropt_t.h b/ir/ir/iropt_t.h
index 5e95c801d..dd7964888 100644
--- a/ir/ir/iropt_t.h
+++ b/ir/ir/iropt_t.h
@@ -26,40 +26,46 @@
 #ifndef FIRM_IR_IROPT_T_H
 #define FIRM_IR_IROPT_T_H
 
+#include <stdbool.h>
+#include "irop_t.h"
 #include "iropt.h"
 #include "irnode_t.h"
 #include "pset.h"
 #include "tv.h"
 
-ir_node *equivalent_node(ir_node *n);
-
 /**
  * Calculate a hash value of a node.
- * The hash value is calculated from the nodes predecessors.
- * Special handling for Const and SymConst nodes (these don't have predecessors).
  *
  * @param node  The IR-node
  */
 unsigned ir_node_hash(const ir_node *node);
 
+/**
+ * equivalent_node() returns a node equivalent to input n. It skips all nodes that
+ * perform no actual computation, as, e.g., the Id nodes.  It does not create
+ * new nodes.  It is therefore safe to free n if the node returned is not n.
+ * If a node returns a Tuple we can not just skip it.  If the size of the
+ * in array fits, we transform n into a tuple (e.g., Div).
+ */
+ir_node *equivalent_node(ir_node *n);
+
 /**
  * Creates a new value table used for storing CSE identities.
  * The value table is used to identify common expressions.
- *
  */
-pset *new_identities(void);
+void new_identities(ir_graph *irg);
 
 /**
  * Deletes a identities value table.
  *
  * @param value_table  the identity set
  */
-void del_identities(pset *value_table);
+void del_identities(ir_graph *irg);
 
 /**
  * Add a node to the identities value table.
  */
-void add_identities(pset *value_table, ir_node *node);
+void add_identities(ir_node *node);
 
 /**
  * Compare function for two nodes in the hash table. Gets two
@@ -72,11 +78,19 @@ int identities_cmp(const void *elt, const void *key);
  * Looks up the node in a hash table, enters it in the table
  * if it isn't there yet.
  */
-ir_node *identify_remember(pset *value_table, ir_node *n);
+ir_node *identify_remember(ir_node *n);
 
 /** Visit each node in the value table of a graph. */
 void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env);
 
+/**
+ * Normalize a node by putting constants (and operands with larger
+ * node index) on the right (operator side).
+ *
+ * @param n   The node to normalize
+ */
+void ir_normalize_node(ir_node *n);
+
 ir_node *optimize_node(ir_node *n);
 
 ir_node *optimize_in_place_2(ir_node *n);
@@ -87,7 +101,7 @@ ir_node *optimize_in_place_2(ir_node *n);
  * returning tarval_bad otherwise.
  * No calculations are done here, just a lookup.
  */
-typedef tarval *(*value_of_func)(const ir_node *self);
+typedef ir_tarval *(*value_of_func)(const ir_node *self);
 
 extern value_of_func value_of_ptr;
 
@@ -101,11 +115,16 @@ void set_value_of_func(value_of_func func);
 /**
  * Returns the associated tarval of a node.
  */
-static INLINE tarval *
-value_of(const ir_node *n) {
+static inline ir_tarval *value_of(const ir_node *n)
+{
 	return value_of_ptr(n);
 }
 
+/**
+ * returns true if a value becomes zero when converted to mode @p mode
+ */
+bool ir_zero_when_converted(const ir_node *node, ir_mode *dest_mode);
+
 /**
  * Sets the default operations for an ir_op_ops.
  *
@@ -115,6 +134,12 @@ value_of(const ir_node *n) {
  * @return
  *    The operations.
  */
-ir_op_ops *firm_set_default_operations(ir_opcode code, ir_op_ops *ops);
+ir_op_ops *firm_set_default_operations(unsigned code, ir_op_ops *ops);
+
+int ir_mux_is_abs(const ir_node *sel, const ir_node *mux_true,
+                  const ir_node *mux_false);
+
+ir_node *ir_get_abs_op(const ir_node *sel, ir_node *mux_true,
+                       ir_node *mux_false);
 
 #endif