};
/* Helpers */
-#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 ASSERT_OU_AVAIL(co) assert((co)->units.next && "Representation as optimization-units not built")
+#define ASSERT_GS_AVAIL(co) assert((co)->nodes && "Representation as graph not built")
static inline unsigned get_irn_col(const ir_node *node)
{
#define list_entry_units(lh) list_entry(lh, unit_t, units)
-#define is_Reg_Phi(irn) (is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
-
#define get_Perm_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
#define is_Perm_Proj(irn) (is_Proj(irn) && be_is_Perm(get_Proj_pred(irn)))
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 */
ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
int *costs; /**< costs[i] are incurred, if nodes[i] has a different color */
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 */
- void *data; /** stuff that is attachable. */
};