#include <obstack.h>
#include "list.h"
-#include "bearch.h"
+#include "bearch_t.h"
#include "bechordal_t.h"
#include "becopyopt.h"
+#include "benodesets.h"
/**
* Data representing the problem of copy minimization.
#define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm)
#define is_Perm_Proj(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn)))
-#define is_2addr_code(arch_env, irn, req) (arch_get_register_req(arch_env, req, irn, -1)->type == arch_register_req_type_should_be_same)
-
+static INLINE int is_2addr_code(const arch_register_req_t *req)
+{
+ return req->type == arch_register_req_type_should_be_same;
+}
/******************************************************************************
____ _ _ _ _ _ _____ _
typedef struct _neighb_t neighb_t;
typedef struct _affinity_node_t affinity_node_t;
-
struct _neighb_t {
neighb_t *next; /** the next neighbour entry*/
ir_node *irn; /** the neighbour itself */
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. */
};
ASSERT_GS_AVAIL(co);
find.irn = irn;
- return set_find(co->nodes, &find, sizeof(find), HASH_PTR(irn));
+ return set_find(co->nodes, &find, sizeof(find), nodeset_hash(irn));
}
#define co_gs_nodes_begin(co) set_first((co)->nodes)
#define co_gs_nodes_next(co) set_next((co)->nodes)
#define co_gs_nodes_break(co) set_break((co)->nodes)
-#define co_gs_foreach_aff_node(co, aff_node) for (aff_node = co_gs_nodes_begin(co); aff_node; aff_node = co_gs_nodes_next(co))
+#define co_gs_foreach_aff_node(co, aff_node) for (aff_node = co_gs_nodes_begin(co); aff_node; aff_node = co_gs_nodes_next(co))
#define co_gs_foreach_neighb(aff_node, neighb) for (neighb = aff_node->neighbours; neighb; neighb = neighb->next)
-
#endif