differentiate between Bad and Deleted (because of exchange) nodes, this avoid some...

[libfirm] / ir / be / becopyopt_t.h

diff --git a/ir/be/becopyopt_t.h b/ir/be/becopyopt_t.h
index 13a9f86..24f602f 100644 (file)
--- a/ir/be/becopyopt_t.h
+++ b/ir/be/becopyopt_t.h
@@ -32,14 +32,14 @@
 #include "set.h"
 #include "irnode_t.h"
 
-#include "bearch_t.h"
+#include "bearch.h"
 #include "bechordal_t.h"
 #include "becopyopt.h"
 
 /**
  * Data representing the problem of copy minimization.
  */
-struct _copy_opt_t {
+struct copy_opt_t {
        be_chordal_env_t            *cenv;
        const arch_register_class_t *cls;
        ir_graph                    *irg;
@@ -58,9 +58,8 @@ struct _copy_opt_t {
 #define ASSERT_OU_AVAIL(co)            assert((co)->units.next && "Representation as optimization-units not build")
 #define ASSERT_GS_AVAIL(co)            assert((co)->nodes && "Representation as graph not build")
 
-#define get_irn_col(irn)           arch_register_get_index(arch_get_irn_register(irn))
-#define set_irn_col(co, irn, col)  arch_set_irn_register(irn, arch_register_for_index((co)->cls, col))
-#define is_curr_reg_class(co, irn) (arch_get_irn_reg_class(irn, -1) == (co)->cls)
+#define get_irn_col(irn)          arch_register_get_index(arch_get_irn_register(irn))
+#define set_irn_col(co, irn, col) arch_set_irn_register(irn, arch_register_for_index((co)->cls, col))
 
 #define list_entry_units(lh) list_entry(lh, unit_t, units)
 
@@ -87,7 +86,7 @@ static inline int is_2addr_code(const arch_register_req_t *req)
 
 #define MIS_HEUR_TRIGGER 8
 
-typedef struct _unit_t {
+typedef struct unit_t {
        struct list_head units;              /**< chain for all units */
        copy_opt_t       *co;                /**< the copy opt this unit belongs to */
        int              node_count;         /**< size of the nodes array */
@@ -115,16 +114,16 @@ typedef struct _unit_t {
                   |_|                                      |___/
  ******************************************************************************/
 
-typedef struct _neighb_t neighb_t;
-typedef struct _affinity_node_t affinity_node_t;
+typedef struct neighb_t neighb_t;
+typedef struct affinity_node_t affinity_node_t;
 
-struct _neighb_t {
+struct neighb_t {
        neighb_t *next;   /** the next neighbour entry*/
        const ir_node  *irn;    /** the neighbour itself */
        int      costs;   /** the costs of the edge (affinity_node_t->irn, neighb_t->irn) */
 };
 
-struct _affinity_node_t {
+struct affinity_node_t {
        const ir_node  *irn;          /** a node with affinity edges */
        int      degree;        /** number of affinity edges in the linked list below */
        neighb_t *neighbours;   /** a linked list of all affinity neighbours */