Added is_Const

[libfirm] / ir / ir / irop_t.h

diff --git a/ir/ir/irop_t.h b/ir/ir/irop_t.h
index b5e5c70..edc17dc 100644 (file)
--- a/ir/ir/irop_t.h
+++ b/ir/ir/irop_t.h
@@ -16,6 +16,7 @@
 
 # include "irop.h"
 # include "tv.h"
+# include "irnode.h"
 
 /** The allowed parities */
 typedef enum {
@@ -50,17 +51,17 @@ typedef enum {
  * This operation evaluates an IR node into a tarval if possible,
  * returning tarval_bad otherwise.
  */
-typedef tarval *(*computed_value_func)(ir_node *n);
+typedef tarval *(*computed_value_func)(ir_node *self);
 
 /**
  * The equivalent node operation.
  * This operation returns an equivalent node for the input node.
- * It does not create new nodes.  It is therefore safe to free n
- * if the node returned is not n.
+ * It does not create new nodes.  It is therefore safe to free self
+ * if the node returned is not self.
  * 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., possible for Div).
  */
-typedef ir_node *(*equivalent_node_func)(ir_node *n);
+typedef ir_node *(*equivalent_node_func)(ir_node *self);
 
 /**
  * The transform node operation.
@@ -70,7 +71,7 @@ typedef ir_node *(*equivalent_node_func)(ir_node *n);
  * transformations _do_ generate new nodes, and thus the old node must
  * not be freed even if the equivalent node isn't the old one.
  */
-typedef ir_node *(*transform_node_func)(ir_node *n);
+typedef ir_node *(*transform_node_func)(ir_node *self);
 
 /**
  * The node attribute compare operation.
@@ -79,6 +80,27 @@ typedef ir_node *(*transform_node_func)(ir_node *n);
  */
 typedef int (*node_cmp_attr_func)(ir_node *a, ir_node *b);
 
+/**
+ * The reassociation operation.
+ * Called from a walker.  Returns non-zero if
+ * a reassociation rule was applied.
+ * The pointer n is set to the newly created node, if some reassociation
+ * was applied.
+ */
+typedef int (*reassociate_func)(ir_node **n);
+
+/**
+ * The copy attribute operation.
+ * Copy the node attributes from a 'old' node to a 'new' one.
+ */
+typedef void (*copy_attr_func)(const ir_node *old_node, ir_node *new_node);
+
+/**
+ * The get_type operation.
+ * Return the type of the node self.
+ */
+typedef type *(*get_type_func)(ir_node *self);
+
 /** The type of an ir_op. */
 struct ir_op {
   opcode code;            /**< the unique opcode of the op */
@@ -94,6 +116,9 @@ struct ir_op {
   equivalent_node_func  equivalent_node;       /**< optimizes the node by returning an equivalent one. */
   transform_node_func   transform_node;                /**< optimizes the node by transforming it. */
   node_cmp_attr_func    node_cmp_attr;         /**< compares two node attributes. */
+  reassociate_func      reassociate;            /**< reassociate a tree */
+  copy_attr_func        copy_attr;              /**< copy node attributes */
+  get_type_func         get_type;               /**< return the type of a node */
 };
 
 /**
@@ -124,6 +149,12 @@ void init_op(void);
 /** Free memory used by irop module. */
 void finish_op(void);
 
+/**
+ * Copies simply all attributes stored in the old node to the new node.
+ * Assumes both have the same opcode and sufficient size.
+ */
+void default_copy_attr(const ir_node *old_node, ir_node *new_node);
+
 /** Returns the attribute size of nodes of this opcode.
    @note Use not encouraged, internal feature. */
 static INLINE int get_op_attr_size (const ir_op *op) {
@@ -160,7 +191,7 @@ static INLINE opcode __get_op_code(const ir_op *op) {
   return op->code;
 }
 
-static INLINE ident *__get_op_ident(ir_op *op){
+static INLINE ident *__get_op_ident(const ir_op *op){
   return op->name;
 }