3 * Internal datastructures for the chordal register allocator.
4 * @author Sebastian Hack
22 #include "bechordal.h"
24 /** Defines an invalid register index. */
29 #define DBG_CHORDAL "firm.be.ra.chordal"
32 * A liveness interval border.
34 typedef struct _border_t {
35 unsigned magic; /**< A magic number for checking. */
36 struct list_head list; /**< list head for queuing. */
37 struct _border_t *other_end; /**< The other end of the border. */
38 ir_node *irn; /**< The node. */
39 unsigned step; /**< The number equal to the interval border. */
40 unsigned pressure; /**< The pressure at this interval border.
41 (The border itself is counting). */
42 unsigned is_def : 1; /**< Does this border denote a use or a def. */
43 unsigned is_real : 1; /**< Is the def/use real? Or is it just inserted
44 at block beginnings or ends to ensure that inside
45 a block, each value has one begin and one end. */
49 * Environment for each of the chordal register allocator phases
51 struct _be_chordal_env_t {
52 struct obstack obst; /**< An obstack for temporary storage. */
53 pmap *border_heads; /**< Maps blocks to border heads. */
54 ir_graph *irg; /**< The graph the reg alloc is running on. */
57 set *nodes; /**< The interference graph nodes. */
58 set *edges; /**< The interference graph edges. */
61 bitset_t *live; /**< A liveness bitset. */
62 bitset_t *colors; /**< The color mask. */
63 bitset_t *in_colors; /**< Colors used by live in values. */
64 int colors_n; /**< The number of colors. */
65 const arch_env_t *arch_env; /**< The arch interface environment. */
66 const arch_register_class_t *cls; /**< The current register class. */
67 void *data; /**< Some pointer, to which different
68 phases can attach data to. */
71 static INLINE struct list_head *
72 _get_block_border_head(const be_chordal_env_t *inf, ir_node *bl)
74 return pmap_get(inf->border_heads, bl);
77 #define get_block_border_head(info, bl) _get_block_border_head(info, bl)
79 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b);
82 typedef struct _if_node_t {
87 typedef struct _if_edge_t {
91 set *be_ra_get_ifg_edges(const be_chordal_env_t *env);
92 set *be_ra_get_ifg_nodes(const be_chordal_env_t *env);
93 int ifg_has_edge(const be_chordal_env_t *env, const if_node_t *n1, const if_node_t* n2);
95 #define ifn_get_degree(ifnode) pset_count(ifnode->neighb)
96 #define foreach_neighb(ifnode, curr) \
97 for(curr=pset_first(ifnode->neighb); curr; curr=pset_next(ifnode->neighb))
100 extern void be_ra_chordal_spill(be_chordal_env_t *env);
102 #endif /* _BECHORDAL_T_H */