X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=6ab04af554b18cba2eed79ab08059a891ea4a6a7;hb=7105209a991d24ef0be91898e7fb36386c3a9b9b;hp=a696031ca481c90dd81c9e871f696bc240945bde;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm

diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h
index a696031ca..6ab04af55 100644
--- a/ir/be/bechordal_t.h
+++ b/ir/be/bechordal_t.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -17,43 +17,25 @@
  * PURPOSE.
  */
 
-
 /**
- * Internal data structures 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 _BECHORDAL_T_H
-#define _BECHORDAL_T_H
+#ifndef FIRM_BE_BECHORDAL_T_H
+#define FIRM_BE_BECHORDAL_T_H
 
 #include "firm_types.h"
-#include "firm_config.h"
-
-#include <stdlib.h>
-
-#include "bitset.h"
 #include "list.h"
-#include "obst.h"
-#include "pset.h"
 #include "pmap.h"
-#include "set.h"
-
-#include "execfreq.h"
+#include "bitset.h"
+#include "obst.h"
+#include "debug.h"
 
-#include "be_t.h"
-#include "beifg.h"
-#include "bera.h"
-#include "bearch_t.h"
 #include "bechordal.h"
-#include "belive.h"
-#include "beirg_t.h"
-
-typedef struct be_ra_chordal_opts_t  be_ra_chordal_opts_t;
-typedef struct border_t              border_t;
-
-/** Defines an invalid register index. */
-#define NO_COLOR (-1)
+#include "beirg.h"
+#include "beifg.h"
 
 /**
  * A liveness interval border.
@@ -65,7 +47,7 @@ struct border_t {
 	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_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
@@ -78,28 +60,30 @@ struct border_t {
 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. */
-	be_irg_t             *birg;         /**< Back-end IRG session. */
 	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             *ignore_colors;/**< A set of colors which shall be ignored in register allocation. */
+	bitset_t             *allocatable_regs; /**< set of allocatable registers */
 };
 
-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(be_chordal_env_t const *const inf, ir_node *const bl)
+{
+  return pmap_get(list_head, 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_consider_in_reg_alloc(chordal_env->birg->main_env->arch_env, chordal_env->cls, irn)
+#define foreach_border_head(head, pos)      list_for_each_entry_reverse(border_t, pos, head, list)
 
-void be_ra_chordal_color(be_chordal_env_t *chordal_env);
+/**
+ * Check, if an irn is of the register class currently under processing.
+ * @param env The chordal environment.
+ * @param irn The node.
+ * @return whether the node is of that register class.
+ */
+static inline bool has_reg_class(be_chordal_env_t const *const env, ir_node const *const irn)
+{
+	return arch_irn_consider_in_reg_alloc(env->cls, irn);
+}
 
 enum {
 	/* Dump flags */
@@ -113,7 +97,8 @@ enum {
 	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_SPLIT      = (1 << 10),
+	BE_CH_DUMP_APPEL      = (1 << 11),
 	BE_CH_DUMP_ALL        = 2 * BE_CH_DUMP_APPEL - 1,
 
 	/* lower perm options */
@@ -127,14 +112,11 @@ enum {
 };
 
 struct be_ra_chordal_opts_t {
-	int dump_flags;
-	int lower_perm_opt;
-	int vrfy_option;
-
-	char ilp_server[128];
-	char ilp_solver[128];
+	unsigned dump_flags;
+	int      lower_perm_opt;
+	int      vrfy_option;
 };
 
-void be_pre_spill_prepare_constr(be_chordal_env_t *cenv);
+void check_for_memory_operands(ir_graph *irg);
 
-#endif /* _BECHORDAL_T_H */
+#endif /* FIRM_BE_BECHORDAL_T_H */