3 * Internal datastructures for the chordal register allocator.
4 * @author Sebastian Hack
12 * A liveness interval border.
14 typedef struct _border_t {
16 unsigned magic; /**< A magic number for checking. */
18 struct list_head list; /**< list head for queuing. */
19 struct _border_t *other_end; /**< The other end of the border. */
20 const ir_node *irn; /**< The node. */
21 unsigned step; /**< The number equal to the interval border. */
22 unsigned pressure; /**< The pressure at this interval border.
23 (The border itself is counting). */
24 unsigned is_def : 1; /**< Does this border denote a use or a def. */
25 unsigned is_real : 1; /**< Is the def/use real? Or is it just inserted
26 at block beginnings or ends to ensure that inside
27 a block, each value has one begin and one end. */
30 extern void be_ra_chordal_spill(ir_graph *irg);
32 #endif /* _BECHORDAL_T_H */