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