X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=5117657c2423c2d779d01cf6f3b57673735f7322;hb=ecfcdc3a97ed77eebe8f4944c89dc26d7a395347;hp=3403628493fd756a9fa4cf6ef31706b6a47c8a7c;hpb=6498260a82cf36ffb510276ee66e22b5a38d8a5d;p=libfirm

diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h
index 340362849..5117657c2 100644
--- a/ir/be/bechordal_t.h
+++ b/ir/be/bechordal_t.h
@@ -1,53 +1,95 @@
+/*
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
+ */
 
 /**
- * Internal datastructures for the chordal register allocator.
- * @author Sebastian Hack
- * @date 25.1.2005
+ * @file
+ * @brief       Internal data structures for the chordal register allocator.
+ * @author      Sebastian Hack
+ * @date        25.01.2005
  */
+#ifndef FIRM_BE_BECHORDAL_T_H
+#define FIRM_BE_BECHORDAL_T_H
 
-#ifndef _BECHORDAL_T_H
-#define _BECHORDAL_T_H
+#include "firm_types.h"
+#include "list.h"
+#include "pmap.h"
+#include "bitset.h"
+#include "obst.h"
+#include "debug.h"
 
-#define BUILD_GRAPH
+#include "bechordal.h"
+#include "beifg.h"
 
 /**
  * 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. */
-	const 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);
-
-#endif /* _BECHORDAL_T_H */
+struct border_t {
+	DEBUG_ONLY(unsigned magic;)     /**< A magic number for checking. */
+	struct list_head  list;         /**< list head for queuing. */
+	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         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. */
+};
+
+/**
+ * Environment for each of the chordal register allocator phases
+ */
+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. */
+	bitset_t             *allocatable_regs; /**< set of allocatable registers */
+};
+
+static inline struct list_head *get_block_border_head(be_chordal_env_t const *const inf, ir_node *const 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)
+
+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_SPLIT      = (1 << 10),
+	BE_CH_DUMP_APPEL      = (1 << 11),
+	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,
+};
+
+struct be_ra_chordal_opts_t {
+	unsigned dump_flags;
+	int      lower_perm_opt;
+	int      vrfy_option;
+};
+
+void check_for_memory_operands(ir_graph *irg);
+
+#endif /* FIRM_BE_BECHORDAL_T_H */