#include "irgwalk.h"
#include "irloop_t.h"
#include "irnode.h"
-#include "irprintf_t.h"
+#include "irprintf.h"
#include "irprog.h"
#include "irtools.h"
#include "pmap.h"
#include "bemodule.h"
#include "benode.h"
#include "besched.h"
-#include "bestatevent.h"
+#include "statev_t.h"
#include "beutil.h"
#include "lc_opts.h"
*/
static int co_is_optimizable_root(ir_node *irn)
{
- const arch_register_req_t *req;
-
- if (arch_irn_is_ignore(irn))
+ arch_register_req_t const *const req = arch_get_irn_register_req(irn);
+ if (arch_register_req_is(req, ignore))
return 0;
if (is_Reg_Phi(irn) || is_Perm_Proj(irn))
return 1;
- req = arch_get_irn_register_req(irn);
- if (is_2addr_code(req))
+ if (arch_register_req_is(req, should_be_same))
return 1;
return 0;
unit->nodes[0] = irn;
unit->nodes[1] = get_Perm_src(irn);
unit->costs[1] = co->get_costs(irn, -1);
- } else {
+ } else if (arch_register_req_is(req, should_be_same)) {
/* Src == Tgt of a 2-addr-code instruction */
- if (is_2addr_code(req)) {
- const unsigned other = req->other_same;
- int count = 0;
- int i;
+ const unsigned other = req->other_same;
+ int count = 0;
+ int i;
+
+ for (i = 0; (1U << i) <= other; ++i) {
+ if (other & (1U << i)) {
+ ir_node *o = get_irn_n(skip_Proj(irn), i);
+ if (arch_irn_is_ignore(o))
+ continue;
+ if (nodes_interfere(co->cenv, irn, o))
+ continue;
+ ++count;
+ }
+ }
- for (i = 0; (1U << i) <= other; ++i) {
+ if (count != 0) {
+ int k = 0;
+ ++count;
+ unit->nodes = XMALLOCN(ir_node*, count);
+ unit->costs = XMALLOCN(int, count);
+ unit->node_count = count;
+ unit->nodes[k++] = irn;
+
+ for (i = 0; 1U << i <= other; ++i) {
if (other & (1U << i)) {
ir_node *o = get_irn_n(skip_Proj(irn), i);
- if (arch_irn_is_ignore(o))
- continue;
- if (nodes_interfere(co->cenv, irn, o))
- continue;
- ++count;
- }
- }
-
- if (count != 0) {
- int k = 0;
- ++count;
- unit->nodes = XMALLOCN(ir_node*, count);
- unit->costs = XMALLOCN(int, count);
- unit->node_count = count;
- unit->nodes[k++] = irn;
-
- for (i = 0; 1U << i <= other; ++i) {
- if (other & (1U << i)) {
- ir_node *o = get_irn_n(skip_Proj(irn), i);
- if (!arch_irn_is_ignore(o) &&
- !nodes_interfere(co->cenv, irn, o)) {
- unit->nodes[k] = o;
- unit->costs[k] = co->get_costs(irn, -1);
- ++k;
- }
+ if (!arch_irn_is_ignore(o) &&
+ !nodes_interfere(co->cenv, irn, o)) {
+ unit->nodes[k] = o;
+ unit->costs[k] = co->get_costs(irn, -1);
+ ++k;
}
}
}
- } else {
- assert(0 && "This is not an optimizable node!");
}
+ } else {
+ assert(0 && "This is not an optimizable node!");
}
/* Insert the new unit at a position according to its costs */
if (get_irn_mode(irn) == mode_T)
return;
req = arch_get_irn_register_req(irn);
- if (req->cls != co->cls || arch_irn_is_ignore(irn))
+ if (req->cls != co->cls || arch_register_req_is(req, ignore))
return;
if (is_Reg_Phi(irn)) { /* Phis */
} else if (is_Perm_Proj(irn)) { /* Perms */
ir_node *arg = get_Perm_src(irn);
add_edges(co, irn, arg, co->get_costs(irn, -1));
- } else { /* 2-address code */
- if (is_2addr_code(req)) {
- const unsigned other = req->other_same;
- int i;
+ } else if (arch_register_req_is(req, should_be_same)) {
+ const unsigned other = req->other_same;
+ int i;
- for (i = 0; 1U << i <= other; ++i) {
- if (other & (1U << i)) {
- ir_node *other = get_irn_n(skip_Proj(irn), i);
- if (!arch_irn_is_ignore(other))
- add_edges(co, irn, other, co->get_costs(irn, -1));
- }
+ for (i = 0; 1U << i <= other; ++i) {
+ if (other & (1U << i)) {
+ ir_node *other = get_irn_n(skip_Proj(irn), i);
+ if (!arch_irn_is_ignore(other))
+ add_edges(co, irn, other, co->get_costs(irn, -1));
}
}
}
fprintf(f, "%d %d\n", n, n_regs);
be_ifg_foreach_node(ifg, &it, irn) {
- if (!arch_irn_is_ignore(irn)) {
- int idx = node_map[get_irn_idx(irn)];
- affinity_node_t *a = get_affinity_info(co, irn);
- const arch_register_req_t *req = arch_get_irn_register_req(irn);
- ir_node *adj;
-
- if (arch_register_req_is(req, limited)) {
- for (i = 0; i < co->cls->n_regs; ++i) {
- if (!rbitset_is_set(req->limited, i) && color_map[i] >= 0)
- fprintf(f, "%d %d -1\n", color_map[i], idx);
- }
+ arch_register_req_t const *const req = arch_get_irn_register_req(irn);
+ if (arch_register_req_is(req, ignore))
+ continue;
+
+ int idx = node_map[get_irn_idx(irn)];
+ affinity_node_t *a = get_affinity_info(co, irn);
+ ir_node *adj;
+
+ if (arch_register_req_is(req, limited)) {
+ for (i = 0; i < co->cls->n_regs; ++i) {
+ if (!rbitset_is_set(req->limited, i) && color_map[i] >= 0)
+ fprintf(f, "%d %d -1\n", color_map[i], idx);
}
+ }
- be_ifg_foreach_neighbour(ifg, &nit, irn, adj) {
- if (!arch_irn_is_ignore(adj) &&
- !co_dump_appel_disjoint_constraints(co, irn, adj)) {
- int adj_idx = node_map[get_irn_idx(adj)];
- if (idx < adj_idx)
- fprintf(f, "%d %d -1\n", idx, adj_idx);
- }
+ be_ifg_foreach_neighbour(ifg, &nit, irn, adj) {
+ if (!arch_irn_is_ignore(adj) &&
+ !co_dump_appel_disjoint_constraints(co, irn, adj)) {
+ int adj_idx = node_map[get_irn_idx(adj)];
+ if (idx < adj_idx)
+ fprintf(f, "%d %d -1\n", idx, adj_idx);
}
+ }
- if (a) {
- co_gs_foreach_neighb(a, n) {
- if (!arch_irn_is_ignore(n->irn)) {
- int n_idx = node_map[get_irn_idx(n->irn)];
- if (idx < n_idx)
- fprintf(f, "%d %d %d\n", idx, n_idx, (int) n->costs);
- }
+ if (a) {
+ co_gs_foreach_neighb(a, n) {
+ if (!arch_irn_is_ignore(n->irn)) {
+ int n_idx = node_map[get_irn_idx(n->irn)];
+ if (idx < n_idx)
+ fprintf(f, "%d %d %d\n", idx, n_idx, (int) n->costs);
}
}
}
co_complete_stats(co, &before);
- be_stat_ev_ull("co_aff_nodes", before.aff_nodes);
- be_stat_ev_ull("co_aff_edges", before.aff_edges);
- be_stat_ev_ull("co_max_costs", before.max_costs);
- be_stat_ev_ull("co_inevit_costs", before.inevit_costs);
- be_stat_ev_ull("co_aff_int", before.aff_int);
+ stat_ev_ull("co_aff_nodes", before.aff_nodes);
+ stat_ev_ull("co_aff_edges", before.aff_edges);
+ stat_ev_ull("co_max_costs", before.max_costs);
+ stat_ev_ull("co_inevit_costs", before.inevit_costs);
+ stat_ev_ull("co_aff_int", before.aff_int);
- be_stat_ev_ull("co_init_costs", before.costs);
- be_stat_ev_ull("co_init_unsat", before.unsatisfied_edges);
+ stat_ev_ull("co_init_costs", before.costs);
+ stat_ev_ull("co_init_unsat", before.unsatisfied_edges);
if (dump_flags & DUMP_BEFORE) {
FILE *f = my_open(cenv, "", "-before.vcg");
/* do the stats and provide the current costs */
co_complete_stats(co, &stats);
- be_stat_ev_ull("co_prepare_costs", stats.costs);
+ stat_ev_ull("co_prepare_costs", stats.costs);
}
/* perform actual copy minimization */
was_optimal = selected_copyopt->copyopt(co);
ir_timer_stop(timer);
- be_stat_ev("co_time", ir_timer_elapsed_msec(timer));
- be_stat_ev_ull("co_optimal", was_optimal);
+ stat_ev_dbl("co_time", ir_timer_elapsed_msec(timer));
+ stat_ev_ull("co_optimal", was_optimal);
ir_timer_free(timer);
if (dump_flags & DUMP_AFTER) {
fclose(f);
}
- be_stat_ev_ull("co_after_costs", after.costs);
- be_stat_ev_ull("co_after_unsat", after.unsatisfied_edges);
+ stat_ev_ull("co_after_costs", after.costs);
+ stat_ev_ull("co_after_unsat", after.unsatisfied_edges);
co_free_graph_structure(co);
co_free_ou_structure(co);
projects / libfirm / blobdiff