3 * Internal data structures for the chordal register allocator.
4 * @author Sebastian Hack
11 #include "firm_types.h"
12 #include "firm_config.h"
29 #include "bechordal.h"
34 typedef struct _be_ra_chordal_opts_t be_ra_chordal_opts_t;
36 /** Defines an invalid register index. */
40 * A liveness interval border.
42 typedef struct _border_t {
43 DEBUG_ONLY(unsigned magic;) /**< A magic number for checking. */
44 struct list_head list; /**< list head for queuing. */
45 struct _border_t *other_end; /**< The other end of the border. */
46 ir_node *irn; /**< The node. */
47 unsigned step; /**< The number equal to the interval border. */
48 unsigned pressure; /**< The pressure at this interval border. (The border itself is counting). */
49 unsigned is_def : 1; /**< Does this border denote a use or a def. */
50 unsigned is_real : 1; /**< Is the def/use real? Or is it just inserted
51 at block beginnings or ends to ensure that inside
52 a block, each value has one begin and one end. */
56 * Environment for each of the chordal register allocator phases
58 struct _be_chordal_env_t {
59 struct obstack obst; /**< An obstack for temporary storage. */
60 be_ra_chordal_opts_t *opts; /**< A pointer to the chordal ra options. */
61 be_irg_t *birg; /**< Back-end IRG session. */
62 ir_graph *irg; /**< The graph under examination. */
63 const arch_register_class_t *cls; /**< The current register class. */
64 pmap *border_heads; /**< Maps blocks to border heads. */
65 be_ifg_t *ifg; /**< The interference graph. */
66 bitset_t *ignore_colors; /**< A set of colors which shall be ignored in register allocation. */
67 DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< Debug module for the chordal register allocator. */
70 static INLINE struct list_head *_get_block_border_head(const be_chordal_env_t *inf, ir_node *bl) {
71 return pmap_get(inf->border_heads, bl);
74 #define get_block_border_head(info, bl) _get_block_border_head(info, bl)
76 #define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list)
77 #define border_next(b) (list_entry((b)->list.next, border_t, list))
78 #define border_prev(b) (list_entry((b)->list.prev, border_t, list))
80 #define chordal_has_class(chordal_env, irn) \
81 arch_irn_consider_in_reg_alloc(chordal_env->birg->main_env->arch_env, chordal_env->cls, irn)
83 void be_ra_chordal_color(be_chordal_env_t *chordal_env);
87 BE_CH_DUMP_NONE = (1 << 0),
88 BE_CH_DUMP_SPILL = (1 << 1),
89 BE_CH_DUMP_LIVE = (1 << 2),
90 BE_CH_DUMP_COLOR = (1 << 3),
91 BE_CH_DUMP_COPYMIN = (1 << 4),
92 BE_CH_DUMP_SSADESTR = (1 << 5),
93 BE_CH_DUMP_TREE_INTV = (1 << 6),
94 BE_CH_DUMP_CONSTR = (1 << 7),
95 BE_CH_DUMP_SPILLSLOTS = (1 << 8),
96 BE_CH_DUMP_LOWER = (1 << 9),
97 BE_CH_DUMP_APPEL = (1 << 10),
98 BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_APPEL - 1,
100 /* lower perm options */
101 BE_CH_LOWER_PERM_SWAP = 1,
102 BE_CH_LOWER_PERM_COPY = 2,
107 BE_CH_VRFY_ASSERT = 3,
110 struct _be_ra_chordal_opts_t {
115 char ilp_server[128];
116 char ilp_solver[128];
119 void be_pre_spill_prepare_constr(be_chordal_env_t *cenv);
121 #endif /* _BECHORDAL_T_H */