#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"
#include "bestatevent.h"
#include "beirg_t.h"
#include "error.h"
-#include "bera.h"
#include <libcore/lc_timing.h>
#include <libcore/lc_opts.h>
LC_OPT_ENT_ENUM_MASK ("style", "dump style for ifg dumping", &style_var),
LC_OPT_ENT_BOOL ("stats", "dump statistics after each optimization", &do_stats),
LC_OPT_ENT_BOOL ("improve", "run heur3 before if algo can exploit start solutions", &improve),
- { NULL }
+ LC_OPT_LAST
};
/* Insert additional options registration functions here. */
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;
ir_node *root_block = get_nodes_block(root);
+ (void) co;
+ (void) arg;
if (is_Phi(root)) {
/* for phis the copies are placed in the corresponding pred-block */
int res;
ir_node *root_bl = get_nodes_block(root);
ir_node *copy_bl = is_Phi(root) ? get_Block_cfgpred_block(root_bl, pos) : root_bl;
+ (void) arg;
res = get_block_execfreq_ulong(co->cenv->birg->exec_freq, copy_bl);
/* don't allow values smaller than one. */
int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node *arg, int pos) {
+ (void) co;
+ (void) root;
+ (void) arg;
+ (void) pos;
return 1;
}
ir_node **safe, **unsafe;
int i, o, safe_count, safe_costs, unsafe_count, *unsafe_costs;
bitset_t *curr;
- int max, pos, curr_weight, best_weight = 0;
+ bitset_pos_t pos;
+ int max, curr_weight, best_weight = 0;
/* assign the nodes into two groups.
* safe: node has no interference, hence it is in every max stable set.
/* 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 int compare_affinity_node_t(const void *k1, const void *k2, size_t size) {
const affinity_node_t *n1 = k1;
const affinity_node_t *n2 = k2;
+ (void) size;
return (n1->irn != n2->irn);
}
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));
}
}
return res == 0 ? 1 : res;
#else
ir_loop *loop = get_irn_loop(bl);
+ (void) env;
if(loop) {
int d = get_loop_depth(loop);
return 1 + d * d;
static void *appel_clique_walker_irn_init(ir_phase *phase, ir_node *irn, void *old)
{
appel_block_info_t *res = NULL;
+ (void) old;
if(is_Block(irn)) {
appel_clique_walker_t *d = (void *) phase;
|_| |___/
*/
-static const char *get_dot_color_name(int col)
+static const char *get_dot_color_name(size_t col)
{
static const char *names[] = {
"blue",
static void ifg_dump_graph_attr(FILE *f, void *self)
{
+ (void) self;
fprintf(f, "overlap=scale");
}
void co_solve_park_moon(copy_opt_t *opt)
{
-
+ (void) opt;
}
static int void_algo(copy_opt_t *co)
{
+ (void) co;
return 0;
}
co_algo_t *algo_func;
int was_optimal = 0;
- if (algo < 0 || algo >= CO_ALGO_LAST)
+ if (algo >= CO_ALGO_LAST)
return;
+ be_liveness_assure_chk(be_get_birg_liveness(cenv->birg));
+
co = new_copy_opt(cenv, cost_func);
co_build_ou_structure(co);
co_build_graph_structure(co);
projects / libfirm / blobdiff