/** Defines an invalid register index. */
#define NO_COLOR (-1)
-#define DBG_CHORDAL "firm.be.ra.chordal"
-
/**
* A liveness interval border.
*/
typedef struct _border_t {
- unsigned magic; /**< A magic number for checking. */
- struct list_head list; /**< list head for queuing. */
- struct _border_t *other_end; /**< The other end of the border. */
- ir_node *irn; /**< The node. */
- unsigned step; /**< The number equal to the interval border. */
- unsigned pressure; /**< The pressure at this interval border.
- (The border itself is counting). */
- unsigned is_def : 1; /**< Does this border denote a use or a def. */
- unsigned is_real : 1; /**< Is the def/use real? Or is it just inserted
- at block beginnings or ends to ensure that inside
- a block, each value has one begin and one end. */
+ unsigned magic; /**< A magic number for checking. */
+ struct list_head list; /**< list head for queuing. */
+ struct _border_t *other_end; /**< The other end of the border. */
+ ir_node *irn; /**< The node. */
+ unsigned step; /**< The number equal to the interval border. */
+ unsigned pressure; /**< The pressure at this interval border. (The border itself is counting). */
+ unsigned is_def : 1; /**< Does this border denote a use or a def. */
+ unsigned is_real : 1; /**< Is the def/use real? Or is it just inserted
+ at block beginnings or ends to ensure that inside
+ a block, each value has one begin and one end. */
} border_t;
/**
#define get_block_border_head(info, bl) _get_block_border_head(info, bl)
#define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list)
+#define border_next(b) (list_entry((b)->list.next, border_t, list))
+#define border_prev(b) (list_entry((b)->list.prev, border_t, list))
#define chordal_has_class(chordal_env, irn) \
arch_irn_has_reg_class(chordal_env->main_env->arch_env, irn, -1, chordal_env->cls)
/* Dump flags */
BE_CH_DUMP_NONE = (1 << 0),
BE_CH_DUMP_SPILL = (1 << 1),
- BE_CH_DUMP_COPYMIN = (1 << 2),
- BE_CH_DUMP_SSADESTR = (1 << 3),
- BE_CH_DUMP_TREE_INTV = (1 << 4),
- BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_TREE_INTV - 1,
+ BE_CH_DUMP_COLOR = (1 << 2),
+ BE_CH_DUMP_COPYMIN = (1 << 3),
+ BE_CH_DUMP_SSADESTR = (1 << 4),
+ BE_CH_DUMP_TREE_INTV = (1 << 5),
+ BE_CH_DUMP_CONSTR = (1 << 6),
+ BE_CH_DUMP_LOWER = (1 << 7),
+ BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_LOWER - 1,
/* copymin method */
BE_CH_COPYMIN_HEUR = 1,
};
typedef struct {
- int dump_flags;
+ unsigned dump_flags;
int spill_method;
int copymin_method;
int ifg_flavor;