X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=ffdd4238d293ba6d3e5793852530ea746e5e50c2;hb=3c751b006ff4ad049b3733a082efd2f30c8fdbca;hp=35317c69ae64e7cc4744ecefef6843f0f1a564be;hpb=b267d8d2e4100aa20cc3771b1b8558d9e0302ed1;p=libfirm

diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h
index 35317c69a..ffdd4238d 100644
--- a/ir/be/bechordal_t.h
+++ b/ir/be/bechordal_t.h
@@ -21,13 +21,15 @@
 #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)
 
-#define BUILD_GRAPH
-
 #define DBG_CHORDAL "firm.be.ra.chordal"
 
 /**
@@ -43,100 +45,77 @@ typedef struct _border_t {
 																	(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. */
+												at block beginnings or ends to ensure that inside
+												a block, each value has one begin and one end. */
 } border_t;
 
 /**
  * Environment for each of the chordal register allocator phases
  */
 struct _be_chordal_env_t {
-	struct obstack obst;	/**< An obstack for temporary storage. */
-  const be_main_session_env_t *session_env; /**< The current session. */
-  pmap *border_heads;   /**< Maps blocks to border heads. */
-
-#ifdef BUILD_GRAPH
-	set *nodes;						/**< The interference graph nodes. */
-	set *edges;						/**< The interference graph edges. */
-#endif
-
-	bitset_t *live;				/**< A liveness bitset. */
-	bitset_t *colors;			/**< The color mask. */
-	bitset_t *in_colors;	/**< Colors used by live in values. */
-	int colors_n;					/**< The number of colors. */
-  const arch_register_class_t *cls;   /**< The current register class. */
-  void *data;           /**< Some pointer, to which different
-                          phases can attach data to. */
+	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. */
 };
 
-typedef struct _be_chordal_env_t be_chordal_env_t;
-
-static INLINE struct list_head *
-_get_block_border_head(const be_chordal_env_t *inf, ir_node *bl)
-{
+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)
 
-int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b);
+#define foreach_border_head(head, pos)		list_for_each_entry_reverse(border_t, pos, head, list)
 
-#ifdef BUILD_GRAPH
-typedef struct _if_node_t {
-	int nnr;
-	pset *neighb;
-} if_node_t;
+#define chordal_has_class(chordal_env, irn) \
+	arch_irn_has_reg_class(chordal_env->main_env->arch_env, irn, -1, chordal_env->cls)
 
-typedef struct _if_edge_t {
-	int src, tgt;
-} if_edge_t;
+int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b);
 
-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);
+void be_ra_chordal_color(be_chordal_env_t *chordal_env);
 
-#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
+enum {
+	/* spill method */
+	BE_CH_SPILL_BELADY    = 1,
+	BE_CH_SPILL_ILP       = 2,
 
-extern void be_ra_chordal_spill(be_chordal_env_t *env);
+	/* 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_ALL        = 2 * BE_CH_DUMP_TREE_INTV - 1,
 
-/**
- * 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);
+	/* copymin method */
+	BE_CH_COPYMIN_HEUR    = 1,
+	BE_CH_COPYMIN_ILP     = 2,
 
-/**
- * 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);
+	/* ifg flavor */
+	BE_CH_IFG_STD         = 1,
+	BE_CH_IFG_FAST        = 2,
 
-/**
- * Free data from the chordal register allocation.
- * @param irg The graph.
- */
-void be_ra_chordal_done(be_chordal_env_t *info);
+	/* lower perm method */
+	BE_CH_LOWER_PERM_SWAP = 1,
+	BE_CH_LOWER_PERM_COPY = 2
+};
 
-/**
- * Init some things for the chordal register allocator.
- * This must be called before Firm is inited.
- */
-void be_ra_chordal_init(void);
+typedef struct {
+	int dump_flags;
+	int spill_method;
+	int copymin_method;
+	int ifg_flavor;
+	int lower_perm_method;
 
-/**
- * Check the register pressure in a graph.
- * @param env The sesion env.
- * @param cls The register class to consider.
- */
-void be_check_pressure(const be_main_session_env_t *env, const arch_register_class_t *cls);
+	char ilp_server[128];
+	char ilp_solver[128];
+} be_ra_chordal_opts_t;
 
 
 #endif /* _BECHORDAL_T_H */