X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeifg.c;h=3b3b4394c350c659536f6d5c48aece940060ff15;hb=eb798733d50fbfb32b12ae9cb2f989d8b86f0d12;hp=e329de7a0efd1627d3cffb7243dd80fc8b32d574;hpb=07d8c1a354a04f227cf7522a33babb64de585eb6;p=libfirm diff --git a/ir/be/beifg.c b/ir/be/beifg.c index e329de7a0..3b3b4394c 100644 --- a/ir/be/beifg.c +++ b/ir/be/beifg.c @@ -6,115 +6,171 @@ * Copyright (C) 2005 Universitaet Karlsruhe * Released under the GPL */ - -#include - #ifdef HAVE_CONFIG_H #include "config.h" #endif +#include + #ifdef HAVE_MALLOC_H #include #endif +#ifdef __linux__ +#include +#endif /* __linux__ */ + #ifdef HAVE_ALLOCA_H #include #endif +#ifdef WITH_LIBCORE +#include +#include +#include +#endif /* WITH_LIBCORE */ + #include "bitset.h" +#include "irgwalk.h" #include "irnode_t.h" #include "irprintf.h" +#include "irtools.h" +#include "irbitset.h" #include "beifg_t.h" +#include "beifg_impl.h" +#include "irphase.h" +#include "irphase_t.h" +#include "bechordal.h" +#include "error.h" + +#include "becopystat.h" +#include "becopyopt.h" +#include "beirg_t.h" + +/** Defines values for the ifg performance test */ +#define BE_CH_PERFORMANCETEST_MIN_NODES (50) +#define BE_CH_PERFORMANCETEST_COUNT (500) + +typedef struct _coloring_t coloring_t; -size_t (be_ifg_nodes_iter_size)(const void *self) +struct _coloring_t { + phase_t ph; + const arch_env_t *arch_env; + ir_graph *irg; +}; + +size_t (be_ifg_nodes_iter_size)(const be_ifg_t *ifg) { - const be_ifg_t *ifg = self; return ifg->impl->nodes_iter_size; } -size_t (be_ifg_neighbours_iter_size)(const void *self) +size_t (be_ifg_neighbours_iter_size)(const be_ifg_t *ifg) { - const be_ifg_t *ifg = self; return ifg->impl->neighbours_iter_size; } -size_t (be_ifg_cliques_iter_size)(const void *self) +size_t (be_ifg_cliques_iter_size)(const be_ifg_t *ifg) { - const be_ifg_t *ifg = self; return ifg->impl->cliques_iter_size; } -void (be_ifg_free)(void *self) +static void *regs_irn_data_init(phase_t *ph, ir_node *irn, void *data) +{ + coloring_t *coloring = (coloring_t *) ph; + return (void *) arch_get_irn_register(coloring->arch_env, irn); +} + +coloring_t *coloring_init(coloring_t *c, ir_graph *irg, const arch_env_t *aenv) +{ + phase_init(&c->ph, "regs_map", irg, PHASE_DEFAULT_GROWTH, regs_irn_data_init); + c->arch_env = aenv; + c->irg = irg; + return c; +} + +static void get_irn_color(ir_node *irn, void *c) +{ + coloring_t *coloring = c; + phase_get_or_set_irn_data(&coloring->ph, irn); +} + +static void restore_irn_color(ir_node *irn, void *c) +{ + coloring_t *coloring = c; + const arch_register_t *reg = phase_get_irn_data(&coloring->ph, irn); + if(reg) + arch_set_irn_register(coloring->arch_env, irn, reg); +} + +void coloring_save(coloring_t *c) +{ + irg_walk_graph(c->irg, NULL, get_irn_color, c); +} + +void coloring_restore(coloring_t *c) { - be_ifg_t *ifg = self; - ifg->impl->free(self); + irg_walk_graph(c->irg, NULL, restore_irn_color, c); } -int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b) +void (be_ifg_free)(be_ifg_t *ifg) { - const be_ifg_t *ifg = self; - return ifg->impl->connected(self, a, b); + ifg->impl->free(ifg); } -ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn) +int (be_ifg_connected)(const be_ifg_t *ifg, const ir_node *a, const ir_node *b) { - const be_ifg_t *ifg = self; - return ifg->impl->neighbours_begin(self, iter, irn); + return ifg->impl->connected(ifg, a, b); } -ir_node *(be_ifg_neighbours_next)(const void *self, void *iter) +ir_node *(be_ifg_neighbours_begin)(const be_ifg_t *ifg, void *iter, const ir_node *irn) { - const be_ifg_t *ifg = self; - return ifg->impl->neighbours_next(self, iter); + return ifg->impl->neighbours_begin(ifg, iter, irn); } -void (be_ifg_neighbours_break)(const void *self, void *iter) +ir_node *(be_ifg_neighbours_next)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - ifg->impl->neighbours_break(self, iter); + return ifg->impl->neighbours_next(ifg, iter); } -ir_node *(be_ifg_nodes_begin)(const void *self, void *iter) +void (be_ifg_neighbours_break)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - return ifg->impl->nodes_begin(self, iter); + ifg->impl->neighbours_break(ifg, iter); } -ir_node *(be_ifg_nodes_next)(const void *self, void *iter) +ir_node *(be_ifg_nodes_begin)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - return ifg->impl->nodes_next(self, iter); + return ifg->impl->nodes_begin(ifg, iter); } -void (be_ifg_nodes_break)(const void *self, void *iter) +ir_node *(be_ifg_nodes_next)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - ifg->impl->nodes_break(self, iter); + return ifg->impl->nodes_next(ifg, iter); } -int (be_ifg_cliques_begin)(const void *self, void *iter, ir_node **buf) +void (be_ifg_nodes_break)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - return ifg->impl->cliques_begin(self, iter, buf); + ifg->impl->nodes_break(ifg, iter); } -int (be_ifg_cliques_next)(const void *self, void *iter) +int (be_ifg_cliques_begin)(const be_ifg_t *ifg, void *iter, ir_node **buf) { - const be_ifg_t *ifg = self; - return ifg->impl->cliques_next(self, iter); + return ifg->impl->cliques_begin(ifg, iter, buf); } -void (be_ifg_cliques_break)(const void *self, void *iter) +int (be_ifg_cliques_next)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - ifg->impl->cliques_break(self, iter); + return ifg->impl->cliques_next(ifg, iter); } -int (be_ifg_degree)(const void *self, const ir_node *irn) +void (be_ifg_cliques_break)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - return ifg->impl->degree(self, irn); + ifg->impl->cliques_break(ifg, iter); +} + +int (be_ifg_degree)(const be_ifg_t *ifg, const ir_node *irn) +{ + return ifg->impl->degree(ifg, irn); } @@ -151,13 +207,385 @@ void be_ifg_check(const be_ifg_t *ifg) void *iter2 = be_ifg_neighbours_iter_alloca(ifg); ir_node *n, *m; + int node_count = 0; + int neighbours_count = 0; + int degree = 0; + + /* count all nodes */ + ir_printf("\n\nFound the following nodes in the graph %+F:\n\n", current_ir_graph); + be_ifg_foreach_node(ifg,iter1,n) + { + node_count++; + degree = be_ifg_degree(ifg, n); + ir_printf("%d. %+F with degree: %d\n", node_count, n, degree); + } + + ir_printf("\n\nNumber of nodes: %d\n\n", node_count); /* Check, if all neighbours are indeed connected to the node. */ - be_ifg_foreach_node(ifg, iter1, n) { + be_ifg_foreach_node(ifg, iter1, n) + { + ir_printf("\n%+F; ", n); be_ifg_foreach_neighbour(ifg, iter2, n, m) + { + ir_printf("%+F; ", m); + neighbours_count++; if(!be_ifg_connected(ifg, n, m)) ir_fprintf(stderr, "%+F is a neighbour of %+F but they are not connected!\n", n, m); + } + } + ir_printf("\n\nFound %d nodes in the 'check neighbour section'\n", neighbours_count); +} + +int be_ifg_check_get_node_count(const be_ifg_t *ifg) +{ + void *iter = be_ifg_nodes_iter_alloca(ifg); + int node_count = 0; + ir_node *n; + + be_ifg_foreach_node(ifg, iter, n) + { + node_count++; + } + + return node_count; +} + +static int be_ifg_check_cmp_nodes(const void *a, const void *b) +{ + const ir_node *node_a = *(ir_node **)a; + const ir_node *node_b = *(ir_node **)b; + + long nr_a = get_irn_node_nr(node_a); + long nr_b = get_irn_node_nr(node_b); + + return QSORT_CMP(nr_a, nr_b); +} + +void be_ifg_check_sorted(const be_ifg_t *ifg) +{ + void *iter1 = be_ifg_nodes_iter_alloca(ifg); + void *iter2 = be_ifg_neighbours_iter_alloca(ifg); + + ir_node *n, *m; + const int node_count = be_ifg_check_get_node_count(ifg); + int i = 0; + + ir_node **all_nodes = xmalloc(node_count * sizeof(all_nodes[0])); + + be_ifg_foreach_node(ifg, iter1, n) + { + if(!node_is_in_irgs_storage(ifg->env->irg, n)) + { + ir_printf("+%F is in ifg but not in the current irg!", n); + assert (node_is_in_irgs_storage(ifg->env->irg, n)); + } + + all_nodes[i] = n; + i++; + } + + qsort(all_nodes, node_count, sizeof(all_nodes[0]), be_ifg_check_cmp_nodes); + + for (i = 0; i < node_count; i++) + { + ir_node **neighbours = xmalloc(node_count * sizeof(neighbours[0])); + int j = 0; + int k = 0; + int degree = 0; + + degree = be_ifg_degree(ifg, all_nodes[i]); + + be_ifg_foreach_neighbour(ifg, iter2, all_nodes[i], m) + { + neighbours[j] = m; + j++; + } + + qsort(neighbours, j, sizeof(neighbours[0]), be_ifg_check_cmp_nodes); + + ir_printf("%d. %+F's neighbours(%d): ", i+1, all_nodes[i], degree); + + for(k = 0; k < j; k++) + { + ir_printf("%+F, ", neighbours[k]); + } + + ir_printf("\n"); + + free(neighbours); + } + + free(all_nodes); + +} + +void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f) +{ + void *iter1 = be_ifg_nodes_iter_alloca(ifg); + void *iter2 = be_ifg_neighbours_iter_alloca(ifg); + + ir_node *n, *m; + const int node_count = be_ifg_check_get_node_count(ifg); + int i = 0; + + ir_node **all_nodes = xmalloc(node_count * sizeof(all_nodes[0])); + + be_ifg_foreach_node(ifg, iter1, n) + { + if(!node_is_in_irgs_storage(ifg->env->irg, n)) + { + ir_fprintf (f,"+%F is in ifg but not in the current irg!",n); + assert (node_is_in_irgs_storage(ifg->env->irg, n)); + } + + all_nodes[i] = n; + i++; + } + + qsort(all_nodes, node_count, sizeof(all_nodes[0]), be_ifg_check_cmp_nodes); + + for (i = 0; i < node_count; i++) + { + ir_node **neighbours = xmalloc(node_count * sizeof(neighbours[0])); + int j = 0; + int k = 0; + int degree = 0; + + degree = be_ifg_degree(ifg, all_nodes[i]); + + be_ifg_foreach_neighbour(ifg, iter2, all_nodes[i], m) + { + neighbours[j] = m; + j++; + } + + qsort(neighbours, j, sizeof(neighbours[0]), be_ifg_check_cmp_nodes); + + ir_fprintf (f,"%d. %+F's neighbours(%d): ", i+1, all_nodes[i], degree); + + for(k = 0; k < j; k++) + { + ir_fprintf (f,"%+F, ", neighbours[k]); + } + + ir_fprintf (f,"\n"); + + free(neighbours); } + + free(all_nodes); + +} + +void be_ifg_check_performance(be_chordal_env_t *chordal_env) +{ +#ifdef WITH_LIBCORE + int tests = BE_CH_PERFORMANCETEST_COUNT; + coloring_t coloring; + + int used_memory; + + int i = 0; + int rt; + copy_opt_t *co; + be_ifg_t *old_if = chordal_env->ifg; + + lc_timer_t *timer = lc_timer_register("getTime","get Time of copy minimization using the ifg"); + unsigned long elapsed_usec = 0; + + if (get_irg_estimated_node_cnt(chordal_env->irg) >= BE_CH_PERFORMANCETEST_MIN_NODES) + { + coloring_init(&coloring, chordal_env->irg, chordal_env->birg->main_env->arch_env); + coloring_save(&coloring); + + lc_timer_reset(timer); + + for (i = 0; iifg = be_ifg_std_new(chordal_env); + + lc_timer_stop(timer); + rt = lc_timer_leave_high_priority(); + + used_memory = lc_get_heap_used_bytes() - used_memory; + + coloring_restore(&coloring); + + co = NULL; + co = new_copy_opt(chordal_env, co_get_costs_loop_depth); + co_build_ou_structure(co); + co_build_graph_structure(co); + + rt = lc_timer_enter_high_priority(); + lc_timer_start(timer); + + co_solve_heuristic_new(co); + + lc_timer_stop(timer); + rt = lc_timer_leave_high_priority(); + + co_free_graph_structure(co); + co_free_ou_structure(co); + free_copy_opt(co); + be_ifg_free(chordal_env->ifg); + + } + + elapsed_usec = lc_timer_elapsed_usec(timer); + /* calculating average */ + elapsed_usec = elapsed_usec / tests; + + ir_printf("\nstd:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec); + + used_memory=0; + elapsed_usec=0; + + for (i = 0; iifg = be_ifg_clique_new(chordal_env); + + lc_timer_stop(timer); + rt = lc_timer_leave_high_priority(); + + used_memory = lc_get_heap_used_bytes() - used_memory; + + coloring_restore(&coloring); + + co = NULL; + co = new_copy_opt(chordal_env, co_get_costs_loop_depth); + co_build_ou_structure(co); + co_build_graph_structure(co); + + rt = lc_timer_enter_high_priority(); + lc_timer_start(timer); + + co_solve_heuristic_new(co); + + lc_timer_stop(timer); + rt = lc_timer_leave_high_priority(); + + co_free_graph_structure(co); + co_free_ou_structure(co); + free_copy_opt(co); + be_ifg_free(chordal_env->ifg); + + } + + elapsed_usec = lc_timer_elapsed_usec(timer); + /* calculating average */ + elapsed_usec = elapsed_usec / tests; + + ir_printf("\nclique:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec); + + used_memory=0; + elapsed_usec=0; + + for (i = 0; iifg = be_ifg_list_new(chordal_env); + + lc_timer_stop(timer); + rt = lc_timer_leave_high_priority(); + + used_memory = lc_get_heap_used_bytes() - used_memory; + + coloring_restore(&coloring); + + co = NULL; + co = new_copy_opt(chordal_env, co_get_costs_loop_depth); + co_build_ou_structure(co); + co_build_graph_structure(co); + + rt = lc_timer_enter_high_priority(); + lc_timer_start(timer); + + co_solve_heuristic_new(co); + + lc_timer_stop(timer); + rt = lc_timer_leave_high_priority(); + + co_free_graph_structure(co); + co_free_ou_structure(co); + free_copy_opt(co); + be_ifg_free(chordal_env->ifg); + + } + + elapsed_usec = lc_timer_elapsed_usec(timer); + /* calculating average */ + elapsed_usec = elapsed_usec / tests; + + ir_printf("\nlist:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec); + + used_memory=0; + elapsed_usec=0; + + for (i = 0; iifg = be_ifg_pointer_new(chordal_env); + + lc_timer_stop(timer); + rt = lc_timer_leave_high_priority(); + + used_memory = lc_get_heap_used_bytes() - used_memory; + + coloring_restore(&coloring); + + co = NULL; + co = new_copy_opt(chordal_env, co_get_costs_loop_depth); + co_build_ou_structure(co); + co_build_graph_structure(co); + + rt = lc_timer_enter_high_priority(); + lc_timer_start(timer); + + co_solve_heuristic_new(co); + + lc_timer_stop(timer); + rt = lc_timer_leave_high_priority(); + + co_free_graph_structure(co); + co_free_ou_structure(co); + free_copy_opt(co); + be_ifg_free(chordal_env->ifg); + + } + + elapsed_usec = lc_timer_elapsed_usec(timer); + /* calculating average */ + elapsed_usec = elapsed_usec / tests; + + ir_printf("\npointer:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec); + + i=0; + used_memory=0; + elapsed_usec=0; + } + + chordal_env->ifg = old_if; +#endif /* WITH_LIBCORE */ } void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self) @@ -208,3 +636,173 @@ void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump fprintf(file, "}\n"); bitset_free(nodes); } + +static void int_comp_rec(be_irg_t *birg, be_ifg_t *ifg, ir_node *n, bitset_t *seen) +{ + void *neigh_it = be_ifg_neighbours_iter_alloca(ifg); + ir_node *m; + + be_ifg_foreach_neighbour(ifg, neigh_it, n, m) { + if(!bitset_contains_irn(seen, m) && !arch_irn_is(birg->main_env->arch_env, m, ignore)) { + bitset_add_irn(seen, m); + int_comp_rec(birg, ifg, m, seen); + } + } + +} + +static int int_component_stat(be_irg_t *birg, be_ifg_t *ifg) +{ + int n_comp = 0; + void *nodes_it = be_ifg_nodes_iter_alloca(ifg); + bitset_t *seen = bitset_irg_malloc(birg->irg); + + ir_node *n; + + be_ifg_foreach_node(ifg, nodes_it, n) { + if (! bitset_contains_irn(seen, n) && ! arch_irn_is(birg->main_env->arch_env, n, ignore)) { + ++n_comp; + bitset_add_irn(seen, n); + int_comp_rec(birg, ifg, n, seen); + } + } + + free(seen); + return n_comp; +} + +void be_ifg_stat(be_irg_t *birg, be_ifg_t *ifg, be_ifg_stat_t *stat) +{ + void *nodes_it = be_ifg_nodes_iter_alloca(ifg); + void *neigh_it = be_ifg_neighbours_iter_alloca(ifg); + bitset_t *nodes = bitset_irg_malloc(birg->irg); + ir_node *n, *m; + + memset(stat, 0, sizeof(stat[0])); + + be_ifg_foreach_node(ifg, nodes_it, n) { + stat->n_nodes += 1; + be_ifg_foreach_neighbour(ifg, neigh_it, n, m) { + bitset_add_irn(nodes, n); + stat->n_edges += !bitset_contains_irn(nodes, m); + } + } + + stat->n_comps = int_component_stat(birg, ifg); + bitset_free(nodes); +} + +enum { + BE_IFG_STD = 1, + BE_IFG_FAST = 2, + BE_IFG_CLIQUE = 3, + BE_IFG_POINTER = 4, + BE_IFG_LIST = 5, + BE_IFG_CHECK = 6 +}; + +static int ifg_flavor = BE_IFG_STD; + +static const lc_opt_enum_int_items_t ifg_flavor_items[] = { + { "std", BE_IFG_STD }, + { "fast", BE_IFG_FAST }, + { "clique", BE_IFG_CLIQUE }, + { "pointer", BE_IFG_POINTER }, + { "list", BE_IFG_LIST }, + { "check", BE_IFG_CHECK }, + { NULL, 0 } +}; + +static lc_opt_enum_int_var_t ifg_flavor_var = { + &ifg_flavor, ifg_flavor_items +}; + +static const lc_opt_table_entry_t be_ifg_options[] = { + LC_OPT_ENT_ENUM_PTR ("ifg", "interference graph flavour", &ifg_flavor_var), + { NULL } +}; + +void be_init_ifg(void) +{ + lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be"); + lc_opt_entry_t *ifg_grp = lc_opt_get_grp(be_grp, "ifg"); + + lc_opt_add_table(ifg_grp, be_ifg_options); +} + +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_ifg); + +static FILE *be_ifg_open(const be_chordal_env_t *env, const char *prefix) +{ + FILE *result; + char buf[1024]; + + ir_snprintf(buf, sizeof(buf), "%s%F_%s.log", prefix, env->irg, env->cls->name); + result = fopen(buf, "wt"); + if(result == NULL) { + panic("Couldn't open '%s' for writing.", buf); + } + + return result; +} + +static void check_ifg_implementations(const be_chordal_env_t *chordal_env) +{ + be_ifg_t *ifg; + FILE *f; + + f = be_ifg_open(chordal_env, "std"); + ifg = be_ifg_std_new(chordal_env); + be_ifg_check_sorted_to_file(ifg, f); + fclose(f); + be_ifg_free(ifg); + + f = be_ifg_open(chordal_env, "list"); + ifg = be_ifg_list_new(chordal_env); + be_ifg_check_sorted_to_file(ifg, f); + fclose(f); + be_ifg_free(ifg); + + f = be_ifg_open(chordal_env, "clique"); + ifg = be_ifg_clique_new(chordal_env); + be_ifg_check_sorted_to_file(ifg, f); + fclose(f); + be_ifg_free(ifg); + + f = be_ifg_open(chordal_env, "pointer"); + ifg = be_ifg_pointer_new(chordal_env); + be_ifg_check_sorted_to_file(ifg, f); + fclose(f); + be_ifg_free(ifg); +}; + +be_ifg_t *be_create_ifg(const be_chordal_env_t *chordal_env) +{ + be_ifg_t *ifg = NULL; + + switch (ifg_flavor) { + default: + assert(0); + fprintf(stderr, "no valid ifg flavour selected. falling back to std\n"); + case BE_IFG_STD: + case BE_IFG_FAST: + ifg = be_ifg_std_new(chordal_env); + break; + case BE_IFG_CLIQUE: + ifg = be_ifg_clique_new(chordal_env); + break; + case BE_IFG_POINTER: + ifg = be_ifg_pointer_new(chordal_env); + break; + case BE_IFG_LIST: + ifg = be_ifg_list_new(chordal_env); + break; + case BE_IFG_CHECK: + check_ifg_implementations(chordal_env); + /* Build the interference graph. */ + ifg = be_ifg_std_new(chordal_env); + break; + } + + return ifg; +}