cleanup, simplify hungarian algorithm implementation

[libfirm] / ir / stat / firmstat_t.h

diff --git a/ir/stat/firmstat_t.h b/ir/stat/firmstat_t.h
index a344186..e096aa2 100644 (file)
--- a/ir/stat/firmstat_t.h
+++ b/ir/stat/firmstat_t.h
@@ -38,9 +38,6 @@
 #include "counter.h"
 #include "irhooks.h"
 
-/* some useful macro. */
-#define ARR_SIZE(a)   (sizeof(a)/sizeof((a)[0]))
-
 /*
  * just be make some things clear :-), the
  * poor man "generics"
@@ -103,6 +100,7 @@ typedef struct _node_entry_t {
        counter_t   cnt_alive;    /**< amount of nodes in this entry */
        counter_t   new_node;     /**< amount of new nodes for this entry */
        counter_t   into_Id;      /**< amount of nodes that turned into Id's for this entry */
+       counter_t   normalized;   /**< amount of nodes that normalized for this entry */
        const ir_op *op;          /**< the op for this entry */
 } node_entry_t;