Use backtracking in find_original_value() for the flags emitter.

[libfirm] / ir / be / becopyopt_t.h

diff --git a/ir/be/becopyopt_t.h b/ir/be/becopyopt_t.h
index a448100..d631b92 100644 (file)
--- a/ir/be/becopyopt_t.h
+++ b/ir/be/becopyopt_t.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -30,11 +30,11 @@
 #include "obst.h"
 #include "list.h"
 #include "set.h"
+#include "irnode_t.h"
 
 #include "bearch_t.h"
 #include "bechordal_t.h"
 #include "becopyopt.h"
-#include "benodesets.h"
 
 /**
  * Data representing the problem of copy minimization.
@@ -122,25 +122,25 @@ typedef struct _affinity_node_t affinity_node_t;
 
 struct _neighb_t {
        neighb_t *next;   /** the next neighbour entry*/
-       ir_node  *irn;    /** the neighbour itself */
+       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 {
-       ir_node  *irn;          /** a node with affinity edges */
+       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 */
        void     *data;         /** stuff that is attachable. */
 };
 
 
-static INLINE affinity_node_t *get_affinity_info(const copy_opt_t *co, ir_node *irn) {
+static INLINE affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn) {
        affinity_node_t find;
 
        ASSERT_GS_AVAIL(co);
 
        find.irn = irn;
-       return set_find(co->nodes, &find, sizeof(find), nodeset_hash(irn));
+       return set_find(co->nodes, &find, sizeof(find), hash_irn(irn));
 }
 
 #define co_gs_nodes_begin(co)                  set_first((co)->nodes)