3 * Internal datastructures for the chordal register allocator.
4 * @author Sebastian Hack
27 #include "bechordal.h"
30 /** Defines an invalid register index. */
34 * A liveness interval border.
36 typedef struct _border_t {
37 unsigned magic; /**< A magic number for checking. */
38 struct list_head list; /**< list head for queuing. */
39 struct _border_t *other_end; /**< The other end of the border. */
40 ir_node *irn; /**< The node. */
41 unsigned step; /**< The number equal to the interval border. */
42 unsigned pressure; /**< The pressure at this interval border. (The border itself is counting). */
43 unsigned is_def : 1; /**< Does this border denote a use or a def. */
44 unsigned is_real : 1; /**< Is the def/use real? Or is it just inserted
45 at block beginnings or ends to ensure that inside
46 a block, each value has one begin and one end. */
50 * Environment for each of the chordal register allocator phases
52 struct _be_chordal_env_t {
53 struct obstack obst; /**< An obstack for temporary storage. */
54 firm_dbg_module_t *dbg; /**< Debug module for the chordal register allocator. */
55 const be_main_env_t *main_env; /**< Environment with back-end data. */
56 dom_front_info_t *dom_front; /**< Dominance frontiers. */
57 ir_graph *irg; /**< The graph under examination. */
58 const arch_register_class_t *cls; /**< The current register class. */
59 pmap *border_heads; /**< Maps blocks to border heads. */
60 be_ifg_t *ifg; /**< The interference graph. */
61 void *data; /**< Some pointer, to which different
62 phases can attach data to. */
65 static INLINE struct list_head *_get_block_border_head(const be_chordal_env_t *inf, ir_node *bl) {
66 return pmap_get(inf->border_heads, bl);
69 #define get_block_border_head(info, bl) _get_block_border_head(info, bl)
71 #define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list)
72 #define border_next(b) (list_entry((b)->list.next, border_t, list))
73 #define border_prev(b) (list_entry((b)->list.prev, border_t, list))
75 #define chordal_has_class(chordal_env, irn) \
76 arch_irn_has_reg_class(chordal_env->main_env->arch_env, irn, -1, chordal_env->cls)
78 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b);
80 void be_ra_chordal_color(be_chordal_env_t *chordal_env);
84 BE_CH_SPILL_BELADY = 1,
88 BE_CH_DUMP_NONE = (1 << 0),
89 BE_CH_DUMP_SPILL = (1 << 1),
90 BE_CH_DUMP_LIVE = (1 << 2),
91 BE_CH_DUMP_COLOR = (1 << 3),
92 BE_CH_DUMP_COPYMIN = (1 << 4),
93 BE_CH_DUMP_SSADESTR = (1 << 5),
94 BE_CH_DUMP_TREE_INTV = (1 << 6),
95 BE_CH_DUMP_CONSTR = (1 << 7),
96 BE_CH_DUMP_LOWER = (1 << 8),
97 BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_LOWER - 1,
100 BE_CH_COPYMIN_HEUR = 1,
101 BE_CH_COPYMIN_ILP = 2,
107 /* lower perm method */
108 BE_CH_LOWER_PERM_SWAP = 1,
109 BE_CH_LOWER_PERM_COPY = 2
117 int lower_perm_method;
119 char ilp_server[128];
120 char ilp_solver[128];
121 } be_ra_chordal_opts_t;
124 #endif /* _BECHORDAL_T_H */