*/
/**
- * Author: Daniel Grund
- * Date: 12.04.2005
- * Copyright: (c) Universitaet Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ * @file
+ * @brief Copy minimization driver.
+ * @author Daniel Grund
+ * @date 12.04.2005
+ * @version $Id$
+ *
+ * Main file for the optimization reducing the copies needed for:
+ * - Phi coalescing
+ * - Register-constrained nodes
+ * - Two-address code instructions
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#include "debug.h"
#include "pmap.h"
#include "raw_bitset.h"
+#include "irnode.h"
#include "irgraph.h"
#include "irgwalk.h"
#include "irprog.h"
#include "benode_t.h"
#include "beutil.h"
#include "beifg_t.h"
+#include "beintlive_t.h"
#include "becopyopt_t.h"
#include "becopystat.h"
#include "belive_t.h"
static unsigned style_flags = 0;
static unsigned do_stats = 0;
static cost_fct_t cost_func = co_get_costs_exec_freq;
-static unsigned algo = CO_ALGO_HEUR;
+static unsigned algo = CO_ALGO_HEUR4;
static int improve = 1;
static const lc_opt_enum_mask_items_t dump_items[] = {
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);
}
return 0;
}
-int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn) {
- const ir_edge_t *edge;
- const arch_register_t *reg;
-
- assert(0 && "Is buggy and obsolete. Do not use");
-
- if (arch_irn_is(co->aenv, irn, ignore))
- return 0;
-
- reg = arch_get_irn_register(co->aenv, irn);
- if (arch_register_type_is(reg, ignore))
- return 0;
-
- foreach_out_edge(irn, edge) {
- ir_node *n = edge->src;
-
- if (!nodes_interfere(co->cenv, irn, n) || irn == n) {
- const arch_register_req_t *req;
- req = arch_get_register_req(co->aenv, n, -1);
-
- if(is_Reg_Phi(n) ||
- is_Perm(co->aenv, n) ||
- (arch_register_req_is(req, should_be_same))) {
- ir_node *other = get_irn_n(irn, req->other_same);
- if(other == irn)
- return 1;
- }
- }
- }
-
- return 0;
-}
-
int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos) {
int cost = 0;
ir_loop *loop;
/* Src == Tgt of a 2-addr-code instruction */
if (is_2addr_code(req)) {
- ir_node *other = get_irn_n(irn, req->other_same);
+ ir_node *other = get_irn_n(skip_Proj(irn), req->other_same);
if (!arch_irn_is(co->aenv, other, ignore) &&
!nodes_interfere(co->cenv, irn, other)) {
unit->nodes = xmalloc(2 * sizeof(*unit->nodes));
static void add_edge(copy_opt_t *co, ir_node *n1, ir_node *n2, int costs) {
affinity_node_t new_node, *node;
- neighb_t new_nbr, *nbr;
- int allocnew;
+ neighb_t *nbr;
+ int allocnew = 1;
new_node.irn = n1;
new_node.degree = 0;
new_node.neighbours = NULL;
node = set_insert(co->nodes, &new_node, sizeof(new_node), nodeset_hash(new_node.irn));
- allocnew = 1;
for (nbr = node->neighbours; nbr; nbr = nbr->next)
if (nbr->irn == n2) {
allocnew = 0;
/* if we did not find n2 in n1's neighbourhood insert it */
if (allocnew) {
- obstack_grow(&co->obst, &new_nbr, sizeof(new_nbr));
- nbr = obstack_finish(&co->obst);
+ nbr = obstack_alloc(&co->obst, sizeof(*nbr));
nbr->irn = n2;
nbr->costs = 0;
nbr->next = node->neighbours;
+
node->neighbours = nbr;
node->degree++;
}
const arch_register_req_t *req =
arch_get_register_req(co->aenv, irn, -1);
if (is_2addr_code(req)) {
- ir_node *other = get_irn_n(irn, req->other_same);
- if(!arch_irn_is(co->aenv, other, ignore))
+ ir_node *other = get_irn_n(skip_Proj(irn), req->other_same);
+ if (! arch_irn_is(co->aenv, other, ignore))
add_edges(co, irn, other, co->get_costs(co, irn, other, 0));
}
}