backend: put ignore regs into beirg

[libfirm] / ir / ir / iropt_t.h

diff --git a/ir/ir/iropt_t.h b/ir/ir/iropt_t.h
index 1aee93b..ee3c72c 100644 (file)
--- a/ir/ir/iropt_t.h
+++ b/ir/ir/iropt_t.h
@@ -52,21 +52,20 @@ 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
@@ -79,7 +78,7 @@ 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);
@@ -102,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;
 
@@ -116,7 +115,7 @@ 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);
 }