X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeifg.c;h=f7633be69c05302e153f9bb142c702398b08c958;hb=4e0288d4c454f3cded36e0b81e97be03dca528db;hp=30572872de4809a84b5777ae2be3c2c938fe91da;hpb=7c36344d22a7c306a4e216f135c974bdb9f6b943;p=libfirm diff --git a/ir/be/beifg.c b/ir/be/beifg.c index 30572872d..f7633be69 100644 --- a/ir/be/beifg.c +++ b/ir/be/beifg.c @@ -1,20 +1,6 @@ /* - * 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. + * Copyright (C) 2012 University of Karlsruhe. */ /** @@ -22,7 +8,6 @@ * @brief Interface for interference graphs. * @author Sebastian Hack * @date 18.11.2005 - * @version $Id$ */ #include "config.h" @@ -37,10 +22,7 @@ #include "irnode_t.h" #include "irprintf.h" #include "irtools.h" -#include "irbitset.h" -#include "beifg_t.h" -#include "beifg_impl.h" -#include "irphase_t.h" +#include "beifg.h" #include "error.h" #include "xmalloc.h" @@ -48,604 +30,283 @@ #include "becopyopt.h" #include "beirg.h" #include "bemodule.h" +#include "beintlive_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; - -struct _coloring_t { - ir_phase ph; - ir_graph *irg; -}; - -size_t (be_ifg_nodes_iter_size)(const be_ifg_t *ifg) -{ - return ifg->impl->nodes_iter_size; -} - -size_t (be_ifg_neighbours_iter_size)(const be_ifg_t *ifg) +void be_ifg_free(be_ifg_t *self) { - return ifg->impl->neighbours_iter_size; + free(self); } -size_t (be_ifg_cliques_iter_size)(const be_ifg_t *ifg) +int be_ifg_connected(const be_ifg_t *ifg, const ir_node *a, const ir_node *b) { - return ifg->impl->cliques_iter_size; + be_lv_t *lv = be_get_irg_liveness(ifg->env->irg); + return be_values_interfere(lv, a, b); } -static void *regs_irn_data_init(ir_phase *ph, const ir_node *irn, void *data) +static void nodes_walker(ir_node *bl, void *data) { - (void)ph; - (void)data; + nodes_iter_t *it = (nodes_iter_t*)data; + struct list_head *head = get_block_border_head(it->env, bl); - return (void*)arch_get_irn_register(irn); + foreach_border_head(head, b) { + if (b->is_def && b->is_real) { + obstack_ptr_grow(&it->obst, b->irn); + it->n++; + } + } } -static coloring_t *coloring_init(coloring_t *c, ir_graph *irg) +nodes_iter_t be_ifg_nodes_begin(be_ifg_t const *const ifg) { - phase_init(&c->ph, irg, regs_irn_data_init); - c->irg = irg; - return c; -} + nodes_iter_t iter; + obstack_init(&iter.obst); + iter.n = 0; + iter.curr = 0; + iter.env = ifg->env; -static void get_irn_color(ir_node *irn, void *c) -{ - coloring_t *coloring = c; - phase_get_or_set_irn_data(&coloring->ph, irn); + irg_block_walk_graph(ifg->env->irg, nodes_walker, NULL, &iter); + obstack_ptr_grow(&iter.obst, NULL); + iter.nodes = (ir_node**)obstack_finish(&iter.obst); + return iter; } -static void restore_irn_color(ir_node *irn, void *c) +ir_node *be_ifg_nodes_next(nodes_iter_t *const it) { - coloring_t *coloring = c; - const arch_register_t *reg = phase_get_irn_data(&coloring->ph, irn); - if (reg) - arch_set_irn_register(irn, reg); + if (it->curr < it->n) { + return it->nodes[it->curr++]; + } else { + obstack_free(&it->obst, NULL); + return NULL; + } } -static void coloring_save(coloring_t *c) +static void find_neighbour_walker(ir_node *block, void *data) { - irg_walk_graph(c->irg, NULL, get_irn_color, c); -} + neighbours_iter_t *it = (neighbours_iter_t*)data; + struct list_head *head = get_block_border_head(it->env, block); + be_lv_t *lv = be_get_irg_liveness(it->env->irg); -static void coloring_restore(coloring_t *c) -{ - irg_walk_graph(c->irg, NULL, restore_irn_color, c); -} + int has_started = 0; -void (be_ifg_free)(be_ifg_t *ifg) -{ - ifg->impl->free(ifg); -} + if (!be_is_live_in(lv, block, it->irn) && block != get_nodes_block(it->irn)) + return; -int (be_ifg_connected)(const be_ifg_t *ifg, const ir_node *a, const ir_node *b) -{ - return ifg->impl->connected(ifg, a, b); -} + foreach_border_head(head, b) { + ir_node *irn = b->irn; -ir_node *(be_ifg_neighbours_begin)(const be_ifg_t *ifg, void *iter, const ir_node *irn) -{ - return ifg->impl->neighbours_begin(ifg, iter, irn); -} + if (irn == it->irn) { + if (b->is_def) + has_started = 1; + else + break; /* if we reached the end of the node's lifetime we can safely break */ + } + else if (b->is_def) { + /* if any other node than the one in question starts living, add it to the set */ + ir_nodeset_insert(&it->neighbours, irn); + } + else if (!has_started) { + /* we only delete, if the live range in question has not yet started */ + ir_nodeset_remove(&it->neighbours, irn); + } -ir_node *(be_ifg_neighbours_next)(const be_ifg_t *ifg, void *iter) -{ - return ifg->impl->neighbours_next(ifg, iter); + } } -void (be_ifg_neighbours_break)(const be_ifg_t *ifg, void *iter) +static void find_neighbours(const be_ifg_t *ifg, neighbours_iter_t *it, const ir_node *irn) { - ifg->impl->neighbours_break(ifg, iter); -} + it->env = ifg->env; + it->irn = irn; + it->valid = 1; + ir_nodeset_init(&it->neighbours); -ir_node *(be_ifg_nodes_begin)(const be_ifg_t *ifg, void *iter) -{ - return ifg->impl->nodes_begin(ifg, iter); -} + dom_tree_walk(get_nodes_block(irn), find_neighbour_walker, NULL, it); -ir_node *(be_ifg_nodes_next)(const be_ifg_t *ifg, void *iter) -{ - return ifg->impl->nodes_next(ifg, iter); + ir_nodeset_iterator_init(&it->iter, &it->neighbours); } -void (be_ifg_nodes_break)(const be_ifg_t *ifg, void *iter) +static inline void neighbours_break(neighbours_iter_t *it, int force) { - ifg->impl->nodes_break(ifg, iter); + (void) force; + assert(it->valid == 1); + ir_nodeset_destroy(&it->neighbours); + it->valid = 0; } -int (be_ifg_cliques_begin)(const be_ifg_t *ifg, void *iter, ir_node **buf) +static ir_node *get_next_neighbour(neighbours_iter_t *it) { - return ifg->impl->cliques_begin(ifg, iter, buf); -} + ir_node *res = ir_nodeset_iterator_next(&it->iter); -int (be_ifg_cliques_next)(const be_ifg_t *ifg, void *iter) -{ - return ifg->impl->cliques_next(ifg, iter); + if (res == NULL) { + ir_nodeset_destroy(&it->neighbours); + } + return res; } -void (be_ifg_cliques_break)(const be_ifg_t *ifg, void *iter) +ir_node *be_ifg_neighbours_begin(const be_ifg_t *ifg, neighbours_iter_t *iter, + const ir_node *irn) { - ifg->impl->cliques_break(ifg, iter); + find_neighbours(ifg, iter, irn); + return get_next_neighbour(iter); } -int (be_ifg_degree)(const be_ifg_t *ifg, const ir_node *irn) +ir_node *be_ifg_neighbours_next(neighbours_iter_t *iter) { - return ifg->impl->degree(ifg, irn); + return get_next_neighbour(iter); } - -void be_ifg_check(const be_ifg_t *ifg) +void be_ifg_neighbours_break(neighbours_iter_t *iter) { - void *iter1 = be_ifg_nodes_iter_alloca(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) - { - 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); + neighbours_break(iter, 1); } -static int be_ifg_check_get_node_count(const be_ifg_t *ifg) +static inline void free_clique_iter(cliques_iter_t *it) { - 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; + it->n_blocks = -1; + obstack_free(&it->ob, NULL); + del_pset(it->living); } -static int be_ifg_check_cmp_nodes(const void *a, const void *b) +static void get_blocks_dom_order(ir_node *blk, void *env) { - const ir_node *node_a = *(ir_node **)a; - const ir_node *node_b = *(ir_node **)b; - - long nr_a = get_irn_idx(node_a); - long nr_b = get_irn_idx(node_b); - - return QSORT_CMP(nr_a, nr_b); + cliques_iter_t *it = (cliques_iter_t*)env; + obstack_ptr_grow(&it->ob, blk); } -void be_ifg_check_sorted(const be_ifg_t *ifg) +/** + * NOTE: Be careful when changing this function! + * First understand the control flow of consecutive calls. + */ +static inline int get_next_clique(cliques_iter_t *it) { - 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 = XMALLOCN(ir_node*, node_count); - 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)); - } + /* continue in the block we left the last time */ + for (; it->blk < it->n_blocks; it->blk++) { + int output_on_shrink = 0; + struct list_head *head = get_block_border_head(it->cenv, it->blocks[it->blk]); - all_nodes[i] = n; - i++; - } + /* on entry to a new block set the first border ... */ + if (!it->bor) + it->bor = head->prev; - qsort(all_nodes, node_count, sizeof(all_nodes[0]), be_ifg_check_cmp_nodes); + /* ... otherwise continue with the border we left the last time */ + for (; it->bor != head; it->bor = it->bor->prev) { + border_t *b = list_entry(it->bor, border_t, list); - for (i = 0; i < node_count; i++) - { - ir_node **neighbours = XMALLOCN(ir_node*, node_count); - int j = 0; - int k = 0; - int degree = 0; + /* if its a definition irn starts living */ + if (b->is_def) { + pset_insert_ptr(it->living, b->irn); + if (b->is_real) + output_on_shrink = 1; + } else - degree = be_ifg_degree(ifg, all_nodes[i]); + /* if its the last usage the irn dies */ + { + /* before shrinking the set, return the current maximal clique */ + if (output_on_shrink) { + int count = 0; - be_ifg_foreach_neighbour(ifg, iter2, all_nodes[i], m) - { - neighbours[j] = m; - j++; - } + /* fill the output buffer */ + foreach_pset(it->living, ir_node, irn) { + it->buf[count++] = irn; + } - qsort(neighbours, j, sizeof(neighbours[0]), be_ifg_check_cmp_nodes); + assert(count > 0 && "We have a 'last usage', so there must be sth. in it->living"); - ir_printf("%d. %+F's neighbours(%d): ", i+1, all_nodes[i], degree); + return count; + } - for (k = 0; k < j; k++) - { - ir_printf("%+F, ", neighbours[k]); + pset_remove_ptr(it->living, b->irn); + } } - ir_printf("\n"); - - free(neighbours); + it->bor = NULL; + assert(0 == pset_count(it->living) && "Something has survived! (At the end of the block it->living must be empty)"); } - free(all_nodes); + if (it->n_blocks != -1) + free_clique_iter(it); + return -1; } -void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f) +int be_ifg_cliques_begin(const be_ifg_t *ifg, cliques_iter_t *it, + ir_node **buf) { - 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 = XMALLOCN(ir_node*, node_count); - - 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 = XMALLOCN(ir_node*, node_count); - int j = 0; - int k = 0; - int degree = 0; - - degree = be_ifg_degree(ifg, all_nodes[i]); + obstack_init(&it->ob); + dom_tree_walk_irg(ifg->env->irg, get_blocks_dom_order, NULL, it); - 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); + it->cenv = ifg->env; + it->buf = buf; + it->n_blocks = obstack_object_size(&it->ob) / sizeof(void *); + it->blocks = (ir_node**)obstack_finish(&it->ob); + it->blk = 0; + it->bor = NULL; + it->living = pset_new_ptr(2 * arch_register_class_n_regs(it->cenv->cls)); + return get_next_clique(it); } -void be_ifg_check_performance(be_chordal_env_t *chordal_env) +int be_ifg_cliques_next(cliques_iter_t *iter) { - 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; - - ir_timer_t *timer = ir_timer_new(); - 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); - coloring_save(&coloring); - - ir_timer_reset(timer); - - for (i = 0; iifg = be_ifg_std_new(chordal_env); - - ir_timer_stop(timer); - rt = ir_timer_leave_high_priority(); - - used_memory = ir_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 = ir_timer_enter_high_priority(); - ir_timer_start(timer); - - co_solve_heuristic_new(co); - - ir_timer_stop(timer); - rt = ir_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 = ir_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); - - ir_timer_stop(timer); - rt = ir_timer_leave_high_priority(); - - used_memory = ir_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 = ir_timer_enter_high_priority(); - ir_timer_start(timer); - - co_solve_heuristic_new(co); - - ir_timer_stop(timer); - rt = ir_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 = ir_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); - - ir_timer_stop(timer); - rt = ir_timer_leave_high_priority(); - - used_memory = ir_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 = ir_timer_enter_high_priority(); - ir_timer_start(timer); - - co_solve_heuristic_new(co); - - ir_timer_stop(timer); - rt = ir_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 = ir_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); - - ir_timer_stop(timer); - rt = ir_timer_leave_high_priority(); - - used_memory = ir_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 = ir_timer_enter_high_priority(); - ir_timer_start(timer); - - co_solve_heuristic_new(co); - - ir_timer_stop(timer); - rt = ir_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 = ir_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; - - ir_timer_free(timer); + return get_next_clique(iter); } -void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self) +void be_ifg_cliques_break(cliques_iter_t *iter) { - void *nodes_it = be_ifg_nodes_iter_alloca(ifg); - void *neigh_it = be_ifg_neighbours_iter_alloca(ifg); - bitset_t *nodes = bitset_malloc(get_irg_last_idx(irg)); - - ir_node *n, *m; - - fprintf(file, "graph G {\n\tgraph ["); - if (cb->graph_attr) - cb->graph_attr(file, self); - fprintf(file, "];\n"); - - if (cb->at_begin) - cb->at_begin(file, self); - - be_ifg_foreach_node(ifg, nodes_it, n) { - if (cb->is_dump_node && cb->is_dump_node(self, n)) { - int idx = get_irn_idx(n); - bitset_set(nodes, idx); - fprintf(file, "\tnode ["); - if (cb->node_attr) - cb->node_attr(file, self, n); - fprintf(file, "]; n%d;\n", idx); - } - } + free_clique_iter(iter); +} - /* Check, if all neighbours are indeed connected to the node. */ - be_ifg_foreach_node(ifg, nodes_it, n) { - be_ifg_foreach_neighbour(ifg, neigh_it, n, m) { - int n_idx = get_irn_idx(n); - int m_idx = get_irn_idx(m); - - if (n_idx < m_idx && bitset_is_set(nodes, n_idx) && bitset_is_set(nodes, m_idx)) { - fprintf(file, "\tn%d -- n%d [", n_idx, m_idx); - if (cb->edge_attr) - cb->edge_attr(file, self, n, m); - fprintf(file, "];\n"); - } - } - } +int be_ifg_degree(const be_ifg_t *ifg, const ir_node *irn) +{ + neighbours_iter_t it; + int degree; + find_neighbours(ifg, &it, irn); + degree = ir_nodeset_size(&it.neighbours); + neighbours_break(&it, 1); + return degree; +} - if (cb->at_end) - cb->at_end(file, self); +be_ifg_t *be_create_ifg(const be_chordal_env_t *env) +{ + be_ifg_t *ifg = XMALLOC(be_ifg_t); + ifg->env = env; - fprintf(file, "}\n"); - bitset_free(nodes); + return ifg; } static void int_comp_rec(be_ifg_t *ifg, ir_node *n, bitset_t *seen) { - void *neigh_it = be_ifg_neighbours_iter_alloca(ifg); - ir_node *m; + neighbours_iter_t neigh_it; - be_ifg_foreach_neighbour(ifg, neigh_it, n, m) { - if (bitset_contains_irn(seen, m)) + be_ifg_foreach_neighbour(ifg, &neigh_it, n, m) { + if (bitset_is_set(seen, get_irn_idx(m))) continue; - if (arch_get_register_req_out(m)->type & arch_register_req_type_ignore) + arch_register_req_t const *const req = arch_get_irn_register_req(m); + if (arch_register_req_is(req, ignore)) continue; - bitset_add_irn(seen, m); + bitset_set(seen, get_irn_idx(m)); int_comp_rec(ifg, m, seen); } } -static int int_component_stat(be_irg_t *birg, be_ifg_t *ifg) +static int int_component_stat(ir_graph *irg, 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; + bitset_t *seen = bitset_malloc(get_irg_last_idx(irg)); - be_ifg_foreach_node(ifg, nodes_it, n) { - if (bitset_contains_irn(seen, n)) + be_ifg_foreach_node(ifg, n) { + if (bitset_is_set(seen, get_irn_idx(n))) continue; - if (arch_get_register_req_out(n)->type & arch_register_req_type_ignore) + arch_register_req_t const *const req = arch_get_irn_register_req(n); + if (arch_register_req_is(req, ignore)) continue; ++n_comp; - bitset_add_irn(seen, n); + bitset_set(seen, get_irn_idx(n)); int_comp_rec(ifg, n, seen); } @@ -653,137 +314,21 @@ static int int_component_stat(be_irg_t *birg, be_ifg_t *ifg) return n_comp; } -void be_ifg_stat(be_irg_t *birg, be_ifg_t *ifg, be_ifg_stat_t *stat) +void be_ifg_stat(ir_graph *irg, 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), - LC_OPT_LAST -}; - -BE_REGISTER_MODULE_CONSTRUCTOR(be_init_ifg); -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); -} - + neighbours_iter_t neigh_it; -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: - panic("invalid ifg flavour selected"); - 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; + size_t n_nodes = 0; + size_t n_edges = 0; + be_ifg_foreach_node(ifg, n) { + ++n_nodes; + be_ifg_foreach_neighbour(ifg, &neigh_it, n, m) { + ++n_edges; + } } - return ifg; + stat->n_nodes = n_nodes; + /* Every interference edge was counted twice, once for each end. */ + stat->n_edges = n_edges / 2; + stat->n_comps = int_component_stat(irg, ifg); }