struct be_chordal_env_t {
struct obstack *obst; /**< An obstack for temporary storage. */
be_ra_chordal_opts_t *opts; /**< A pointer to the chordal ra options. */
struct be_chordal_env_t {
struct obstack *obst; /**< An obstack for temporary storage. */
be_ra_chordal_opts_t *opts; /**< A pointer to the chordal ra options. */
ir_graph *irg; /**< The graph under examination. */
const arch_register_class_t *cls; /**< The current register class. */
pmap *border_heads; /**< Maps blocks to border heads. */
be_ifg_t *ifg; /**< The interference graph. */
ir_graph *irg; /**< The graph under examination. */
const arch_register_class_t *cls; /**< The current register class. */
pmap *border_heads; /**< Maps blocks to border heads. */
be_ifg_t *ifg; /**< The interference graph. */
-static INLINE struct list_head *_get_block_border_head(const be_chordal_env_t *inf, ir_node *bl) {
- return pmap_get(inf->border_heads, bl);
+static inline struct list_head *_get_block_border_head(const be_chordal_env_t *inf, ir_node *bl) {
+ return pmap_get(list_head, inf->border_heads, bl);
-#define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list)
+#define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list)
#define border_next(b) (list_entry((b)->list.next, border_t, list))
#define border_prev(b) (list_entry((b)->list.prev, border_t, list))
#define chordal_has_class(chordal_env, irn) \
#define border_next(b) (list_entry((b)->list.next, border_t, list))
#define border_prev(b) (list_entry((b)->list.prev, border_t, list))
#define chordal_has_class(chordal_env, irn) \
BE_CH_DUMP_CONSTR = (1 << 7),
BE_CH_DUMP_SPILLSLOTS = (1 << 8),
BE_CH_DUMP_LOWER = (1 << 9),
BE_CH_DUMP_CONSTR = (1 << 7),
BE_CH_DUMP_SPILLSLOTS = (1 << 8),
BE_CH_DUMP_LOWER = (1 << 9),