move get_irn_edge_kind to internal API

[libfirm] / ir / ir / irtypes.h

diff --git a/ir/ir/irtypes.h b/ir/ir/irtypes.h
index d4dddf8..5c747a8 100644 (file)
--- a/ir/ir/irtypes.h
+++ b/ir/ir/irtypes.h
@@ -413,6 +413,11 @@ typedef struct ir_def_use_edge {
        int     pos;             /** The position of this edge in use's input array. */
 } ir_def_use_edge;
 
+typedef struct ir_def_use_edges {
+       unsigned        n_edges;
+       ir_def_use_edge edges[];
+} ir_def_use_edges;
+
 /**
  * The common structure of an irnode.
  * If the node has some attributes, they are stored in the attr field.
@@ -430,13 +435,12 @@ struct ir_node {
                                      shall replace a node. */
        long node_nr;            /**< A globally unique node number for each node. */
        /* ------- Fields for optimizations / analysis information ------- */
-       ir_def_use_edge *out;    /**< array of def-use edges. */
-       struct dbg_info *dbi;    /**< A pointer to information for debug support. */
-       /* ------- For debugging ------- */
-#ifdef DEBUG_libfirm
-       unsigned out_valid : 1;
-       unsigned flags     : 31;
-#endif
+       union {
+               ir_def_use_edges *out;    /**< array of def-use edges. */
+               unsigned          n_outs; /**< number of def-use edges (temporarily used
+                                              during construction of datastructure ) */
+       } o;
+       struct dbg_info  *dbi;   /**< A pointer to information for debug support. */
        /* ------- For analyses -------- */
        ir_loop *loop;           /**< the loop the node is in. Access routines in irloop.h */
        struct ir_node **deps;   /**< Additional dependencies induced by state. */
@@ -510,10 +514,6 @@ struct ir_graph {
        struct obstack *obst;          /**< The obstack where all of the ir_nodes live. */
        ir_node *current_block;        /**< Current block for newly gen_*()-erated ir_nodes. */
 
-       /* -- Fields for graph properties -- */
-       irg_inline_property        inline_property;       /**< How to handle inlineing. */
-       mtp_additional_properties  additional_properties; /**< Additional graph properties. */
-
        /* -- Fields indicating different states of irgraph -- */
        ir_graph_properties_t  properties;
        ir_graph_constraints_t constraints;
@@ -533,7 +533,8 @@ struct ir_graph {
        /* -- Fields for optimizations / analysis information -- */
        pset *value_table;                 /**< Hash table for global value numbering (cse)
                                                for optimizing use in iropt.c */
-       ir_def_use_edge *outs;             /**< Space for the Def-Use arrays. */
+       struct obstack   out_obst;         /**< Space for the Def-Use arrays. */
+       bool             out_obst_allocated;
        ir_vrp_info      vrp;              /**< vrp info */
 
        ir_loop *loop;                     /**< The outermost loop for this graph. */
@@ -571,7 +572,6 @@ struct ir_graph {
 
        unsigned  dump_nr;                 /**< number of graph dumps */
 #ifdef DEBUG_libfirm
-       int   n_outs;                      /**< Size wasted for outs */
        long graph_nr;                     /**< a unique graph number for each
                                                graph to make output readable. */
 #endif