-int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b);
-
-#ifdef BUILD_GRAPH
-typedef struct _if_node_t {
- int nnr;
- pset *neighb;
-} if_node_t;
-
-typedef struct _if_edge_t {
- int src, tgt;
-} if_edge_t;
-
-set *be_ra_get_ifg_edges(const be_chordal_env_t *env);
-set *be_ra_get_ifg_nodes(const be_chordal_env_t *env);
-
-int ifg_has_edge(const be_chordal_env_t *env, const if_node_t *n1, const if_node_t* n2);
-
-#define ifn_get_degree(ifnode) pset_count(ifnode->neighb)
-#define foreach_neighb(ifnode, curr) \
- for(curr=pset_first(ifnode->neighb); curr; curr=pset_next(ifnode->neighb))
-#endif
-
-extern void be_ra_chordal_spill(be_chordal_env_t *env);
-
-/**
- * Allocate registers for an ir graph.
- * @param irg The graph.
- * @return Some internal data to be freed with be_ra_chordal_done().
- */
-be_chordal_env_t *be_ra_chordal(
- const be_main_session_env_t *env,
- const arch_register_class_t *cls);
-
-/**
- * Check current register allocation for correctness.
- * Interfering nodes have different colors
- * Register constraints
- * O(n^2)
- */
-void be_ra_chordal_check(be_chordal_env_t *chordal_env);
-
-/**
- * Free data from the chordal register allocation.
- * @param irg The graph.
- */
-void be_ra_chordal_done(be_chordal_env_t *info);
+#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) \
+ arch_irn_consider_in_reg_alloc(chordal_env->birg->main_env->arch_env, chordal_env->cls, irn)
+
+void be_ra_chordal_color(be_chordal_env_t *chordal_env);
+
+enum {
+ /* Dump flags */
+ BE_CH_DUMP_NONE = (1 << 0),
+ BE_CH_DUMP_SPILL = (1 << 1),
+ BE_CH_DUMP_LIVE = (1 << 2),
+ BE_CH_DUMP_COLOR = (1 << 3),
+ BE_CH_DUMP_COPYMIN = (1 << 4),
+ BE_CH_DUMP_SSADESTR = (1 << 5),
+ BE_CH_DUMP_TREE_INTV = (1 << 6),
+ BE_CH_DUMP_CONSTR = (1 << 7),
+ BE_CH_DUMP_SPILLSLOTS = (1 << 8),
+ BE_CH_DUMP_LOWER = (1 << 9),
+ BE_CH_DUMP_APPEL = (1 << 10),
+ BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_APPEL - 1,
+
+ /* lower perm options */
+ BE_CH_LOWER_PERM_SWAP = 1,
+ BE_CH_LOWER_PERM_COPY = 2,
+
+ /* verify options */
+ BE_CH_VRFY_OFF = 1,
+ BE_CH_VRFY_WARN = 2,
+ BE_CH_VRFY_ASSERT = 3,
+};