- add an extra filed for the bit offset\n- renamed access functions\n- renamed entity...

[libfirm] / ir / ir / irgraph_t.h

diff --git a/ir/ir/irgraph_t.h b/ir/ir/irgraph_t.h
index a059a0b..9190df0 100644 (file)
--- a/ir/ir/irgraph_t.h
+++ b/ir/ir/irgraph_t.h
@@ -29,6 +29,7 @@
 #include "entity_t.h"
 #include "typegmod.h"
 #include "tr_inheritance.h"
+#include "iredgekinds.h"
 
 #include "irloop.h"
 #include "execution_frequency.h"
@@ -48,6 +49,8 @@ typedef struct _irg_edge_info_t {
   unsigned activated : 1;  /**< set if edges are activated for the graph. */
 } irg_edge_info_t;
 
+typedef irg_edge_info_t irg_edges_info_t[EDGE_KIND_LAST];
+
 /**
  * Index constants for nodes that can be accessed through the graph itself.
  */
@@ -104,6 +107,7 @@ struct ir_graph {
   irg_loopinfo_state loopinfo_state;       /**< State of loop information. */
   ir_class_cast_state class_cast_state;    /**< Kind of cast operations in code. */
   irg_extblk_info_state extblk_state;      /**< State of extended basic block info. */
+  exec_freq_state execfreq_state;          /**< Execution frequency state. */
   unsigned fp_model;                       /**< floating point model of the graph. */
 
   /* -- Fields for construction -- */
@@ -141,7 +145,7 @@ struct ir_graph {
   unsigned long block_visited;       /**< same as visited, for a complete block */
   unsigned estimated_node_count;     /**< estimated number of nodes in this graph,
                                           updated after every walk */
-  irg_edge_info_t edge_info;         /**< edge info for automatic outs */
+  irg_edges_info_t edge_info;        /**< edge info for automatic outs */
   ir_node **idx_irn_map;             /**< Array mapping node indexes to nodes. */
 
 #ifdef DEBUG_libfirm