X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=df2ba3c506874993b73a8cd4cab1b63501235963;hb=205396c4f4f5abe7abd6dc2350c8c398a7623afc;hp=ffdd4238d293ba6d3e5793852530ea746e5e50c2;hpb=0e18e8ad134a0db05ba6b602db497e6e70bbdd87;p=libfirm diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h index ffdd4238d..df2ba3c50 100644 --- a/ir/be/bechordal_t.h +++ b/ir/be/bechordal_t.h @@ -1,6 +1,6 @@ /** - * Internal datastructures for the chordal register allocator. + * Internal data structures for the chordal register allocator. * @author Sebastian Hack * @date 25.1.2005 */ @@ -8,6 +8,9 @@ #ifndef _BECHORDAL_T_H #define _BECHORDAL_T_H +#include "firm_types.h" +#include "firm_config.h" + #include #include "bitset.h" @@ -17,52 +20,51 @@ #include "pmap.h" #include "set.h" -#include "irnode.h" -#include "irgraph.h" +#include "execfreq.h" #include "be_t.h" #include "beifg.h" #include "bera.h" -#include "bearch.h" +#include "bearch_t.h" #include "bechordal.h" -#include "beirgmod.h" +#include "belive.h" +#include "beirg_t.h" + +typedef struct be_ra_chordal_opts_t be_ra_chordal_opts_t; +typedef struct border_t border_t; /** 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. */ -} border_t; +struct border_t { + DEBUG_ONLY(unsigned magic;) /**< A magic number for checking. */ + struct list_head list; /**< list head for queuing. */ + 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. */ +}; /** * Environment for each of the chordal register allocator phases */ -struct _be_chordal_env_t { - struct obstack obst; /**< An obstack for temporary storage. */ - firm_dbg_module_t *dbg; /**< Debug module for the chordal register allocator. */ - const be_main_env_t *main_env; /**< Environment with back-end data. */ - dom_front_info_t *dom_front; /**< Dominance frontiers. */ - ir_graph *irg; /**< The graph under examination. */ +struct be_chordal_env_t { + struct obstack obst; /**< An obstack for temporary storage. */ + be_ra_chordal_opts_t *opts; /**< A pointer to the chordal ra options. */ + be_irg_t *birg; /**< Back-end IRG session. */ + ir_graph *irg; /**< The graph under examination. */ const arch_register_class_t *cls; /**< The current register class. */ - pmap *border_heads; /**< Maps blocks to border heads. */ - be_ifg_t *ifg; /**< The interference graph. */ - void *data; /**< Some pointer, to which different - phases can attach data to. */ + pmap *border_heads; /**< Maps blocks to border heads. */ + be_ifg_t *ifg; /**< The interference graph. */ + bitset_t *ignore_colors;/**< A set of colors which shall be ignored in register allocation. */ }; static INLINE struct list_head *_get_block_border_head(const be_chordal_env_t *inf, ir_node *bl) { @@ -72,50 +74,48 @@ 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) - -int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b); + arch_irn_consider_in_reg_alloc(chordal_env->birg->main_env->arch_env, chordal_env->cls, irn) void be_ra_chordal_color(be_chordal_env_t *chordal_env); enum { - /* spill method */ - BE_CH_SPILL_BELADY = 1, - BE_CH_SPILL_ILP = 2, - /* 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, - - /* copymin method */ - BE_CH_COPYMIN_HEUR = 1, - BE_CH_COPYMIN_ILP = 2, - - /* ifg flavor */ - BE_CH_IFG_STD = 1, - BE_CH_IFG_FAST = 2, - - /* lower perm method */ - BE_CH_LOWER_PERM_SWAP = 1, - BE_CH_LOWER_PERM_COPY = 2 + BE_CH_DUMP_LIVE = (1 << 2), + BE_CH_DUMP_COLOR = (1 << 3), + BE_CH_DUMP_COPYMIN = (1 << 4), + BE_CH_DUMP_SSADESTR = (1 << 5), + BE_CH_DUMP_TREE_INTV = (1 << 6), + BE_CH_DUMP_CONSTR = (1 << 7), + BE_CH_DUMP_SPILLSLOTS = (1 << 8), + BE_CH_DUMP_LOWER = (1 << 9), + BE_CH_DUMP_APPEL = (1 << 10), + BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_APPEL - 1, + + /* lower perm options */ + BE_CH_LOWER_PERM_SWAP = 1, + BE_CH_LOWER_PERM_COPY = 2, + + /* verify options */ + BE_CH_VRFY_OFF = 1, + BE_CH_VRFY_WARN = 2, + BE_CH_VRFY_ASSERT = 3, }; -typedef struct { +struct be_ra_chordal_opts_t { int dump_flags; - int spill_method; - int copymin_method; - int ifg_flavor; - int lower_perm_method; + int lower_perm_opt; + int vrfy_option; char ilp_server[128]; char ilp_solver[128]; -} be_ra_chordal_opts_t; +}; +void be_pre_spill_prepare_constr(be_chordal_env_t *cenv); #endif /* _BECHORDAL_T_H */