X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=4c02ed398d33d4ea9a3eb864e9a6665f131e4ede;hb=bdf3df765e0e63a604e9ec8b91f997c8c98b2959;hp=38ccf74e0484ca3edce1cfbcb16b4503421e4b3a;hpb=1779f8a4e0ee93544e4e89bbe91f22c7be4bb568;p=libfirm diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h index 38ccf74e0..4c02ed398 100644 --- a/ir/be/bechordal_t.h +++ b/ir/be/bechordal_t.h @@ -30,23 +30,20 @@ /** 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; /** @@ -72,6 +69,8 @@ static INLINE struct list_head *_get_block_border_head(const be_chordal_env_t *i #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) @@ -89,10 +88,11 @@ enum { 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_SSADESTR = (1 << 3), BE_CH_DUMP_TREE_INTV = (1 << 4), BE_CH_DUMP_CONSTR = (1 << 5), - BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_CONSTR - 1, + BE_CH_DUMP_LOWER = (1 << 6), + BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_LOWER - 1, /* copymin method */ BE_CH_COPYMIN_HEUR = 1, @@ -108,7 +108,7 @@ enum { }; typedef struct { - int dump_flags; + unsigned dump_flags; int spill_method; int copymin_method; int ifg_flavor;