X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=4c02ed398d33d4ea9a3eb864e9a6665f131e4ede;hb=0d841728a12986b13b56bc5c019ff9466f1bd3ae;hp=7898bd0d264095dd1ac504b3e0ce651c512e336d;hpb=83c9157ff224552a9b16a73fe4a16451f4963831;p=libfirm

diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h
index 7898bd0d2..4c02ed398 100644
--- a/ir/be/bechordal_t.h
+++ b/ir/be/bechordal_t.h
@@ -8,46 +8,115 @@
 #ifndef _BECHORDAL_T_H
 #define _BECHORDAL_T_H
 
-#define BUILD_GRAPH
+#include <stdlib.h>
+
+#include "bitset.h"
+#include "list.h"
+#include "obst.h"
+#include "pset.h"
+#include "pmap.h"
+#include "set.h"
+
+#include "irnode.h"
+#include "irgraph.h"
+
+#include "be_t.h"
+#include "beifg.h"
+#include "bera.h"
+#include "bearch.h"
+#include "bechordal.h"
+#include "beirgmod.h"
+
+/** Defines an invalid register index. */
+#define NO_COLOR (-1)
 
 /**
  * A liveness interval border.
  */
 typedef struct _border_t {
-#ifdef DEBUG_libfirm
-	unsigned magic;								/**< A magic number for checking. */
-#endif
-	struct list_head list;				/**< list head for queuing. */
-	struct _border_t *other_end;	/**< The other end of the border. */
-	ir_node *irn;						      /**< The node. */
-	unsigned step;								/**< The number equal to the interval border. */
-	unsigned pressure;						/**< The pressure at this interval border.
-																	(The border itself is counting). */
-	unsigned is_def : 1;					/**< Does this border denote a use or a def. */
-	unsigned is_real : 1;					/**< Is the def/use real? Or is it just inserted
-																	at block beginnings or ends to ensure that inside
-																	a block, each value has one begin and one end. */
+	unsigned magic;                 /**< A magic number for checking. */
+	struct list_head list;          /**< list head for queuing. */
+	struct _border_t *other_end;    /**< The other end of the border. */
+	ir_node *irn;                   /**< The node. */
+	unsigned step;                  /**< The number equal to the interval border. */
+	unsigned pressure;              /**< The pressure at this interval border. (The border itself is counting). */
+	unsigned is_def : 1;            /**< Does this border denote a use or a def. */
+	unsigned is_real : 1;           /**< Is the def/use real? Or is it just inserted
+                                        at block beginnings or ends to ensure that inside
+                                        a block, each value has one begin and one end. */
 } border_t;
 
-#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(ir_graph *irg); /**< Deprecated. Use be_ra_get_ifg_edges. */
-set *be_ra_get_ifg_edges(ir_graph *irg);
-set *be_ra_get_ifg_nodes(ir_graph *irg);
-int ifg_has_edge(const ir_graph *irg, if_node_t *n1, 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(ir_graph *irg);
+/**
+ * Environment for each of the chordal register allocator phases
+ */
+struct _be_chordal_env_t {
+	struct obstack obst;       /**< An obstack for temporary storage. */
+	firm_dbg_module_t *dbg;    /**< Debug module for the chordal register allocator. */
+	const be_main_env_t *main_env;   /**< Environment with back-end data. */
+	dom_front_info_t *dom_front; /**< Dominance frontiers. */
+	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. */
+	void *data;                /**< Some pointer, to which different
+                                    phases can attach data to. */
+};
+
+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);
+}
+
+#define get_block_border_head(info, bl)     _get_block_border_head(info, bl)
+
+#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_has_reg_class(chordal_env->main_env->arch_env, irn, -1, chordal_env->cls)
+
+int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b);
+
+void be_ra_chordal_color(be_chordal_env_t *chordal_env);
+
+enum {
+	/* spill method */
+	BE_CH_SPILL_BELADY    = 1,
+	BE_CH_SPILL_ILP       = 2,
+
+	/* Dump flags */
+	BE_CH_DUMP_NONE       = (1 << 0),
+	BE_CH_DUMP_SPILL      = (1 << 1),
+	BE_CH_DUMP_COPYMIN    = (1 << 2),
+	BE_CH_DUMP_SSADESTR   = (1 << 3),
+	BE_CH_DUMP_TREE_INTV  = (1 << 4),
+	BE_CH_DUMP_CONSTR     = (1 << 5),
+	BE_CH_DUMP_LOWER      = (1 << 6),
+	BE_CH_DUMP_ALL        = 2 * BE_CH_DUMP_LOWER - 1,
+
+	/* copymin method */
+	BE_CH_COPYMIN_HEUR    = 1,
+	BE_CH_COPYMIN_ILP     = 2,
+
+	/* ifg flavor */
+	BE_CH_IFG_STD         = 1,
+	BE_CH_IFG_FAST        = 2,
+
+	/* lower perm method */
+	BE_CH_LOWER_PERM_SWAP = 1,
+	BE_CH_LOWER_PERM_COPY = 2
+};
+
+typedef struct {
+	unsigned dump_flags;
+	int spill_method;
+	int copymin_method;
+	int ifg_flavor;
+	int lower_perm_method;
+
+	char ilp_server[128];
+	char ilp_solver[128];
+} be_ra_chordal_opts_t;
+
 
 #endif /* _BECHORDAL_T_H */