/*
- * bechordal_common.c
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
- * Created on: Nov 11, 2009
- * Author: bersch
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
*/
+/**
+ * @file
+ * @brief Common functions for chordal register allocation.
+ * @author Sebastian Hack
+ * @date 08.12.2004
+ */
#include "config.h"
+
+#include "bechordal_common.h"
+
#include "debug.h"
#include "iredges.h"
DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
/* Make a fourcc for border checking. */
-#define BORDER_FOURCC FOURCC('B', 'O', 'R', 'D')
-
+#define BORDER_FOURCC FOURCC('B', 'O', 'R', 'D')
-/**
- * Check, if an irn is of the register class currently under processing.
- * @param env The chordal environment.
- * @param irn The node.
- * @return 1, if the node is of that register class, 0 if not.
- */
-inline int has_reg_class(const be_chordal_env_t *env, const ir_node *irn)
+int has_reg_class(const be_chordal_env_t *env, const ir_node *irn)
{
return arch_irn_consider_in_reg_alloc(env->cls, irn);
}
-/**
- * Add an interval border to the list of a block's list
- * of interval border.
- * @note You always have to create the use before the def.
- * @param env The environment.
- * @param head The list head to enqueue the borders.
- * @param irn The node (value) the border belongs to.
- * @param pressure The pressure at this point in time.
- * @param step A time step for the border.
- * @param is_def Is the border a use or a def.
- * @return The created border.
- */
static inline border_t *border_add(be_chordal_env_t *env, struct list_head *head,
ir_node *irn, unsigned step, unsigned pressure,
unsigned is_def, unsigned is_real)
*/
set_irn_link(irn, def);
- DEBUG_ONLY(b->magic = BORDER_FOURCC);
- DEBUG_ONLY(def->magic = BORDER_FOURCC);
+ DEBUG_ONLY(b->magic = BORDER_FOURCC;)
+ DEBUG_ONLY(def->magic = BORDER_FOURCC;)
} else {
/*
* If the def is encountered, the use was made and so was the
* the def node (see the code above). It was placed into the
* link field of the irn, so we can get it there.
*/
- b = get_irn_link(irn);
+ b = (border_t*)get_irn_link(irn);
- DEBUG_ONLY(assert(b && b->magic == BORDER_FOURCC && "Illegal border encountered"));
+ DEBUG_ONLY(assert(b && b->magic == BORDER_FOURCC && "Illegal border encountered");)
}
b->pressure = pressure;
return b;
}
-/**
- * Annotate the register pressure to the nodes and compute
- * the liveness intervals.
- * @param block The block to do it for.
- * @param env_ptr The environment.
- */
-void pressure(ir_node *block, void *env_ptr)
+void create_borders(ir_node *block, void *env_ptr)
{
/* Convenience macro for a def */
#define border_def(irn, step, real) \
#define border_use(irn, step, real) \
border_add(env, head, irn, step, ++pressure, 0, real)
- be_chordal_env_t *env = env_ptr;
- bitset_t *live = bitset_malloc(get_irg_last_idx(env->irg));
- ir_node *irn;
- be_lv_t *lv = env->birg->lv;
+ be_chordal_env_t *env = (be_chordal_env_t*)env_ptr;
+ bitset_t *live = bitset_malloc(get_irg_last_idx(env->irg));
+ be_lv_t *lv = be_get_irg_liveness(env->irg);
- int i, n;
- bitset_pos_t elm;
unsigned step = 0;
unsigned pressure = 0;
struct list_head *head;
/* Set up the border list in the block info */
head = OALLOC(env->obst, struct list_head);
INIT_LIST_HEAD(head);
- assert(pmap_get(env->border_heads, block) == NULL);
+ assert(pmap_get(struct list_head, env->border_heads, block) == NULL);
pmap_insert(env->border_heads, block, head);
/*
* Make final uses of all values live out of the block.
* They are necessary to build up real intervals.
*/
- be_lv_foreach(lv, block, be_lv_state_end, i) {
- ir_node *irn = be_lv_get_irn(lv, block, i);
+ be_lv_foreach(lv, block, be_lv_state_end, irn) {
if (has_reg_class(env, irn)) {
DBG((dbg, LEVEL_3, "\tMaking live: %+F/%d\n", irn, get_irn_idx(irn)));
bitset_set(live, get_irn_idx(irn));
DBG((dbg, LEVEL_2, "\tlive: %B\n", live));
if (get_irn_mode(irn) == mode_T) {
- const ir_edge_t *edge;
-
foreach_out_edge(irn, edge) {
ir_node *proj = get_edge_src_irn(edge);
* If the node is no phi node we can examine the uses.
*/
if (!is_Phi(irn)) {
- for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
+ for (int i = 0, n = get_irn_arity(irn); i < n; ++i) {
ir_node *op = get_irn_n(irn, i);
if (has_reg_class(env, op)) {
{
be_insn_env_t ie;
- ie.ignore_colors = env->ignore_colors;
- ie.obst = env->obst;
- ie.cls = env->cls;
+ ie.allocatable_regs = env->allocatable_regs;
+ ie.obst = env->obst;
+ ie.cls = env->cls;
return be_scan_insn(&ie, irn);
}
ir_node *pre_process_constraints(be_chordal_env_t *env, be_insn_t **the_insn)
{
- be_insn_t *insn = *the_insn;
- ir_node *perm = NULL;
- bitset_t *out_constr = bitset_alloca(env->cls->n_regs);
- const ir_edge_t *edge;
- int i;
+ be_insn_t *insn = *the_insn;
+ ir_node *perm = NULL;
+ bitset_t *out_constr = bitset_alloca(env->cls->n_regs);
+ int i;
assert(insn->has_constraints && "only do this for constrained nodes");
* Make the Perm, recompute liveness and re-scan the insn since the
* in operands are now the Projs of the Perm.
*/
- perm = insert_Perm_after(env->birg, env->cls, sched_prev(insn->irn));
+ perm = insert_Perm_after(env->irg, env->cls, sched_prev(insn->irn));
/* Registers are propagated by insert_Perm_after(). Clean them here! */
if (perm == NULL)
return perm;
}
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal_common)
void be_init_chordal_common(void)
{
FIRM_DBG_REGISTER(dbg, "firm.be.chordal_common");
}
-
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal_common);
projects / libfirm / blobdiff