#ifndef _BECHORDAL_T_H
#define _BECHORDAL_T_H
+#include "firm_types.h"
+#include "firm_config.h"
+
#include <stdlib.h>
#include "bitset.h"
#include "pmap.h"
#include "set.h"
-#include "irnode.h"
-#include "irgraph.h"
+#include "execfreq.h"
#include "be_t.h"
+#include "beifg.h"
+#include "bera.h"
#include "bearch.h"
+#include "bechordal.h"
+#include "beirgmod.h"
+#include "belive.h"
+
+typedef struct _be_ra_chordal_opts_t be_ra_chordal_opts_t;
/** Defines an invalid register index. */
#define NO_COLOR (-1)
-#define BUILD_GRAPH
-
-#define DBG_CHORDAL "firm.be.ra.chordal"
-
/**
* A liveness interval border.
*/
typedef struct _border_t {
- 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. */
+ 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;
/**
* 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. */
+ be_ra_chordal_opts_t *opts; /**< A pointer to the chordal ra options. */
+ const be_irg_t *birg; /**< Back-end IRG session. */
+ 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. */
+ exec_freq_t *exec_freq; /**< Adam's execution frequencies. */
+ be_lv_t *lv; /**< Liveness information. */
+ 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. */
+ bitset_t *ignore_colors; /**< A set of colors which shall be ignored in register allocation. */
+ DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< Debug module for the chordal register allocator. */
};
-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);
-
-#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;
+#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))
-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 chordal_has_class(chordal_env, irn) \
+ arch_irn_consider_in_reg_alloc(chordal_env->birg->main_env->arch_env, chordal_env->cls, irn)
-#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
+int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b);
-extern void be_ra_chordal_spill(be_chordal_env_t *env);
+void be_ra_chordal_color(be_chordal_env_t *chordal_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)
+ * Check a register allocation obtained with the chordal register allocator.
+ * @param chordal_env The chordal environment.
*/
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);
+enum {
+ /* spill method */
+ BE_CH_SPILL_BELADY = 1,
+ BE_CH_SPILL_MORGAN = 2,
+ BE_CH_SPILL_REMAT = 3,
+
+ /* 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_LOWER = (1 << 8),
+ BE_CH_DUMP_APPEL = (1 << 9),
+ BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_LOWER - 1,
+
+ /* copymin method */
+ BE_CH_COPYMIN_NONE = 0,
+ BE_CH_COPYMIN_HEUR1 = 1,
+ BE_CH_COPYMIN_HEUR2 = 2,
+ BE_CH_COPYMIN_HEUR3 = 3,
+ BE_CH_COPYMIN_STAT = 4,
+ BE_CH_COPYMIN_ILP = 5,
+ BE_CH_COPYMIN_PARK_MOON = 6,
+
+ /* ifg flavor */
+ BE_CH_IFG_STD = 1,
+ BE_CH_IFG_FAST = 2,
+ BE_CH_IFG_CLIQUE = 3,
+ BE_CH_IFG_POINTER = 4,
+ BE_CH_IFG_LIST = 5,
+ BE_CH_IFG_CHECK = 6,
+
+ /* 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,
+};
-/**
- * Init some things for the chordal register allocator.
- * This must be called before Firm is inited.
- */
-void be_ra_chordal_init(void);
+struct _be_ra_chordal_opts_t {
+ int dump_flags;
+ int spill_method;
+ int copymin_method;
+ int ifg_flavor;
+ int lower_perm_opt;
+ int vrfy_option;
+
+ char ilp_server[128];
+ char ilp_solver[128];
+};
/**
- * Check the register pressure in a graph.
- * @param env The sesion env.
- * @param cls The register class to consider.
+ * Open a file whose name is composed from the graph's name and the current register class.
+ * @note The name of the file will be prefix(ifg_name)_(reg_class_name).suffix
+ * @param prefix The file name's prefix.
+ * @param suffix The file name's ending (the . is inserted automatically).
+ * @return A text file opened for writing.
*/
-void be_check_pressure(const be_main_session_env_t *env, const arch_register_class_t *cls);
+FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix);
+void be_pre_spill_prepare_constr(be_chordal_env_t *cenv);
#endif /* _BECHORDAL_T_H */
projects / libfirm / blobdiff