X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fbe%2Fbecopyheur.c;h=8533625c2878b712c6ba86ef8f87d5da624c2dce;hb=2669742071b00949c6a5102f39b7df7fd7d3e3fb;hp=d626badd6d099b96cf2c9530d942ee40d8964d61;hpb=aa89f2a8eee2c5a5b84b6b5377ddc5d57b3aa2e0;p=libfirm diff --git a/ir/be/becopyheur.c b/ir/be/becopyheur.c index d626badd6..8533625c2 100644 --- a/ir/be/becopyheur.c +++ b/ir/be/becopyheur.c @@ -1,13 +1,33 @@ -/** - * Author: Daniel Grund - * Date: 12.04.2005 - * Copyright: (c) Universitaet Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. +/* + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * + * 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 First simple copy minimization heuristics. + * @author Daniel Grund + * @date 12.04.2005 + * @version $Id$ + * * Heuristic for minimizing copies using a queue which holds 'qnodes' not yet * examined. A qnode has a 'target color', nodes out of the opt unit and * a 'conflict graph'. 'Conflict graph' = "Interference graph' + 'conflict edges' - * A 'max indep set' is determined form these. We try to color this mis using a + * A 'max indep set' is determined from these. We try to color this mis using a * color-exchanging mechanism. Occuring conflicts are modeled with 'conflict edges' * and the qnode is reinserted in the queue. The first qnode colored without * conflicts is the best one. @@ -16,19 +36,15 @@ #include "config.h" #endif -#ifdef HAVE_ALLOCA_H -#include -#endif -#ifdef HAVE_MALLOC_H -#include -#endif - #include "debug.h" +#include "bitset.h" +#include "raw_bitset.h" #include "xmalloc.h" + #include "becopyopt_t.h" #include "becopystat.h" -#include "benodesets.h" -#include "bitset.h" +#include "beintlive_t.h" +#include "beirg_t.h" DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) @@ -39,7 +55,7 @@ DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) #define SLOTS_CHANGED_NODES 32 #define list_entry_queue(lh) list_entry(lh, qnode_t, queue) -#define HASH_CONFLICT(c) (nodeset_hash(c.n1) ^ nodeset_hash(c.n2)) +#define HASH_CONFLICT(c) (hash_irn(c.n1) ^ hash_irn(c.n2)) /** * Modeling additional conflicts between nodes. NOT live range interference @@ -54,38 +70,40 @@ typedef struct _conflict_t { */ typedef struct _node_stat_t { ir_node *irn; - int new_color; - int pinned_local :1; + int new_color; + int pinned_local :1; } node_stat_t; /** * Represents a node in the optimization queue. */ typedef struct _qnode_t { - struct list_head queue; /**< chaining of unit_t->queue */ - const unit_t *ou; /**< the opt unit this qnode belongs to */ - int color; /**< target color */ - set *conflicts; /**< contains conflict_t's. All internal conflicts */ - int mis_costs; /**< costs of nodes/copies in the mis. */ - int mis_size; /**< size of the array below */ - ir_node **mis; /**< the nodes of unit_t->nodes[] being part of the max independent set */ - set *changed_nodes; /**< contains node_stat_t's. */ + struct list_head queue; /**< chaining of unit_t->queue */ + const unit_t *ou; /**< the opt unit this node belongs to */ + int color; /**< target color */ + set *conflicts; /**< contains conflict_t's. All internal conflicts */ + int mis_costs; /**< costs of nodes/copies in the mis. */ + int mis_size; /**< size of the array below */ + ir_node **mis; /**< the nodes of unit_t->nodes[] being part of the max independent set */ + set *changed_nodes; /**< contains node_stat_t's. */ } qnode_t; static pset *pinned_global; /**< optimized nodes should not be altered any more */ static INLINE int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b) { - if(env->ifg) + if (env->ifg) return be_ifg_connected(env->ifg, a, b); else - return values_interfere(env->birg->lv, a, b); + return values_interfere(env->birg, a, b); } static int set_cmp_conflict_t(const void *x, const void *y, size_t size) { const conflict_t *xx = x; const conflict_t *yy = y; - return ! (xx->n1 == yy->n1 && xx->n2 == yy->n2); + (void) size; + + return xx->n1 != yy->n1 || xx->n2 != yy->n2; } /** @@ -96,7 +114,7 @@ static INLINE void qnode_add_conflict(const qnode_t *qn, const ir_node *n1, cons conflict_t c; DBG((dbg, LEVEL_4, "\t %+F -- %+F\n", n1, n2)); - if ((int)n1 < (int)n2) { + if (get_irn_idx(n1) < get_irn_idx(n2)) { c.n1 = n1; c.n2 = n2; } else { @@ -115,27 +133,28 @@ static INLINE int qnode_are_conflicting(const qnode_t *qn, const ir_node *n1, co if (n1!=n2 && nodes_interfere(qn->ou->co->cenv, n1, n2)) return 1; /* search for recoloring conflicts */ - if ((int)n1 < (int)n2) { + if (get_irn_idx(n1) < get_irn_idx(n2)) { c.n1 = n1; c.n2 = n2; } else { c.n1 = n2; c.n2 = n1; } - return (int) set_find(qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c)); + return set_find(qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c)) != 0; } static int set_cmp_node_stat_t(const void *x, const void *y, size_t size) { - return ((node_stat_t *)x)->irn != ((node_stat_t *)y)->irn; + (void) size; + return ((const node_stat_t*)x)->irn != ((const node_stat_t*)y)->irn; } /** * Finds a node status entry of a node if existent. Otherwise return NULL */ -static INLINE node_stat_t *qnode_find_node(const qnode_t *qn, ir_node *irn) { +static INLINE const node_stat_t *qnode_find_node(const qnode_t *qn, ir_node *irn) { node_stat_t find; find.irn = irn; - return set_find(qn->changed_nodes, &find, sizeof(find), nodeset_hash(irn)); + return set_find(qn->changed_nodes, &find, sizeof(find), hash_irn(irn)); } /** @@ -147,14 +166,14 @@ static INLINE node_stat_t *qnode_find_or_insert_node(const qnode_t *qn, ir_node find.irn = irn; find.new_color = NO_COLOR; find.pinned_local = 0; - return set_insert(qn->changed_nodes, &find, sizeof(find), nodeset_hash(irn)); + return set_insert(qn->changed_nodes, &find, sizeof(find), hash_irn(irn)); } /** * Returns the virtual color of a node if set before, else returns the real color. */ static INLINE int qnode_get_new_color(const qnode_t *qn, ir_node *irn) { - node_stat_t *found = qnode_find_node(qn, irn); + const node_stat_t *found = qnode_find_node(qn, irn); if (found) return found->new_color; else @@ -176,7 +195,7 @@ static INLINE void qnode_set_new_color(const qnode_t *qn, ir_node *irn, int colo * processed node. */ static INLINE int qnode_is_pinned_local(const qnode_t *qn, ir_node *irn) { - node_stat_t *found = qnode_find_node(qn, irn); + const node_stat_t *found = qnode_find_node(qn, irn); if (found) return found->pinned_local; else @@ -200,7 +219,6 @@ static INLINE void qnode_pin_local(const qnode_t *qn, ir_node *irn) { */ #define CHANGE_SAVE NULL #define CHANGE_IMPOSSIBLE (ir_node *)1 -#define is_conflicting_node(n) (((int)n) > 1) /** * Performs virtual re-coloring of node @p n to color @p col. Virtual colors of @@ -251,7 +269,7 @@ static ir_node *qnode_color_irn(const qnode_t *qn, ir_node *irn, int col, const */ if (irn != trigger) { bitset_t *free_cols = bitset_alloca(cls->n_regs); - arch_register_req_t req; + const arch_register_req_t *req; ir_node *curr; int free_col; @@ -260,10 +278,10 @@ static ir_node *qnode_color_irn(const qnode_t *qn, ir_node *irn, int col, const bitset_flip_all(free_cols); /* Exclude colors not assignable to the irn */ - arch_get_register_req(arch_env, &req, irn, -1); - if (arch_register_req_is(&req, limited)) { + req = arch_get_register_req(arch_env, irn, -1); + if (arch_register_req_is(req, limited)) { bitset_t *limited = bitset_alloca(cls->n_regs); - req.limited(req.limited_env, limited); + rbitset_copy_to_bitset(req->limited, limited); bitset_and(free_cols, limited); } @@ -334,6 +352,7 @@ static int qnode_try_color(const qnode_t *qn) { } else if (confl_node == CHANGE_IMPOSSIBLE) { DBG((dbg, LEVEL_3, "\t Impossible --> remove from qnode\n")); qnode_add_conflict(qn, test_node, test_node); + return 0; } else { if (qnode_is_pinned_local(qn, confl_node)) { /* changing test_node would change back a node of current ou */ @@ -353,10 +372,8 @@ static int qnode_try_color(const qnode_t *qn) { DBG((dbg, LEVEL_3, "\t Conflicting global --> remove from qnode\n")); qnode_add_conflict(qn, test_node, test_node); } - } - - if (confl_node != CHANGE_SAVE) return 0; + } } return 1; } @@ -369,7 +386,8 @@ static INLINE void qnode_max_ind_set(qnode_t *qn, const unit_t *ou) { ir_node **safe, **unsafe; int i, o, safe_count, safe_costs, unsafe_count, *unsafe_costs; bitset_t *curr, *best; - int max, next, pos, curr_weight, best_weight = 0; + bitset_pos_t pos; + int max, next, curr_weight, best_weight = 0; /* assign the nodes into two groups. * safe: node has no interference, hence it is in every max stable set. @@ -519,6 +537,7 @@ static void ou_optimize(unit_t *ou) { qnode_t *curr = NULL, *tmp; const arch_env_t *aenv = ou->co->aenv; const arch_register_class_t *cls = ou->co->cls; + bitset_pos_t idx; bitset_t *pos_regs = bitset_alloca(cls->n_regs); DBG((dbg, LEVEL_1, "\tOptimizing unit:\n")); @@ -530,17 +549,18 @@ static void ou_optimize(unit_t *ou) { arch_get_allocatable_regs(aenv, ou->nodes[0], -1, pos_regs); - /* exclude ingore colors */ + /* exclude ignore colors */ bitset_andnot(pos_regs, ou->co->cenv->ignore_colors); assert(bitset_popcnt(pos_regs) != 0 && "No register is allowed for this node !!?"); /* create new qnode */ - bitset_foreach(pos_regs, i) - ou_insert_qnode(ou, new_qnode(ou, i)); + bitset_foreach(pos_regs, idx) + ou_insert_qnode(ou, new_qnode(ou, idx)); /* search best */ - while (!list_empty(&ou->queue)) { + for (;;) { + assert(!list_empty(&ou->queue)); /* get head of queue */ curr = list_entry_queue(ou->queue.next); list_del(&curr->queue);