+/*
+ * 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.
+ */
+
/**
- * Common use interference graph.
- * Originally written by Sebastian Hack. Refactored into a seperate
- * source file and header by Kimon Hoffmann.
- * @author Sebastian Hack
- * @date 27.06.2005
- * $Id$
+ * @file
+ * @brief Interface for interference graphs.
+ * @author Sebastian Hack
+ * @date 18.11.2005
+ * @version $Id$
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
-#ifdef HAVE_MALLOC_H
-#include <malloc.h>
-#endif
-#ifdef HAVE_ALLOCA_H
-#include <alloca.h>
-#endif
-
#include <stdlib.h>
-#include "debug.h"
+#include "lc_opts.h"
+#include "lc_opts_enum.h"
+
+#include "timing.h"
+#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_t.h"
+#include "error.h"
+#include "xmalloc.h"
+
+#include "becopystat.h"
+#include "becopyopt.h"
+#include "beirg_t.h"
+#include "bemodule.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;
+ const arch_env_t *arch_env;
+ 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)
+{
+ return ifg->impl->neighbours_iter_size;
+}
+
+size_t (be_ifg_cliques_iter_size)(const be_ifg_t *ifg)
+{
+ return ifg->impl->cliques_iter_size;
+}
+
+static void *regs_irn_data_init(ir_phase *ph, const ir_node *irn, void *data)
+{
+ coloring_t *coloring = (coloring_t *) ph;
+ (void) data;
+
+ 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, NULL);
+ 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)
+{
+ irg_walk_graph(c->irg, NULL, restore_irn_color, c);
+}
+
+void (be_ifg_free)(be_ifg_t *ifg)
+{
+ ifg->impl->free(ifg);
+}
+
+int (be_ifg_connected)(const be_ifg_t *ifg, const ir_node *a, const ir_node *b)
+{
+ return ifg->impl->connected(ifg, a, b);
+}
+
+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);
+}
+
+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)
+{
+ ifg->impl->neighbours_break(ifg, iter);
+}
+
+ir_node *(be_ifg_nodes_begin)(const be_ifg_t *ifg, void *iter)
+{
+ return ifg->impl->nodes_begin(ifg, iter);
+}
+
+ir_node *(be_ifg_nodes_next)(const be_ifg_t *ifg, void *iter)
+{
+ return ifg->impl->nodes_next(ifg, iter);
+}
+
+void (be_ifg_nodes_break)(const be_ifg_t *ifg, void *iter)
+{
+ ifg->impl->nodes_break(ifg, iter);
+}
+
+int (be_ifg_cliques_begin)(const be_ifg_t *ifg, void *iter, ir_node **buf)
+{
+ return ifg->impl->cliques_begin(ifg, iter, buf);
+}
+
+int (be_ifg_cliques_next)(const be_ifg_t *ifg, void *iter)
+{
+ return ifg->impl->cliques_next(ifg, iter);
+}
+
+void (be_ifg_cliques_break)(const be_ifg_t *ifg, void *iter)
+{
+ 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);
+}
+
+
+int be_ifg_is_simplicial(const be_ifg_t *ifg, const ir_node *irn)
+{
+ int degree = be_ifg_degree(ifg, irn);
+ void *iter = be_ifg_neighbours_iter_alloca(ifg);
+
+ ir_node **neighbours = xmalloc(degree * sizeof(neighbours[0]));
+
+ ir_node *curr;
+ int i, j;
+
+ i = 0;
+ be_ifg_foreach_neighbour(ifg, iter, irn, curr)
+ neighbours[i++] = curr;
+
+ for(i = 0; i < degree; ++i) {
+ for(j = 0; j < i; ++j)
+ if(!be_ifg_connected(ifg, neighbours[i], neighbours[j])) {
+ free(neighbours);
+ return 0;
+ }
+ }
+
+
+ free(neighbours);
+ return 1;
+}
+
+void be_ifg_check(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;
+ 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);
+}
+
+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_idx(node_a);
+ long nr_b = get_irn_idx(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++;
+ }
-#define IF_EDGE_HASH(e) ((e)->sourceNode)
-#define IF_NODE_HASH(n) ((n)->nodeNumber)
-#define IF_NODE_NEIGHBOUR_SLOTS 8
+ qsort(neighbours, j, sizeof(neighbours[0]), be_ifg_check_cmp_nodes);
-static int if_edge_cmp(const void* p1, const void* p2, size_t size) {
- const be_if_edge_t* e1 = p1;
- const be_if_edge_t* e2 = p2;
+ 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);
- return !((e1->sourceNode == e2->sourceNode) && (e1->targetNode == e2->targetNode));
}
-static int if_node_cmp(const void* p1, const void* p2, size_t size) {
- const be_if_node_t* n1 = p1;
- const be_if_node_t* n2 = p2;
+void be_ifg_check_performance(be_chordal_env_t *chordal_env)
+{
+ 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_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);
+
+ ir_timer_reset(timer);
+
+ for (i = 0; i<tests; i++) /* performance test with std */
+ {
+
+ used_memory = ir_get_heap_used_bytes();
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ chordal_env->ifg = 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; i<tests; i++) /* performance test with clique */
+ {
+ used_memory = ir_get_heap_used_bytes();
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ chordal_env->ifg = 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; i<tests; i++) /* performance test with list */
+ {
+ used_memory = ir_get_heap_used_bytes();
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ chordal_env->ifg = 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);
- return (n1->nodeNumber != n2->nodeNumber);
+ used_memory=0;
+ elapsed_usec=0;
+
+ for (i = 0; i<tests; i++) /* performance test with pointer */
+ {
+ used_memory = ir_get_heap_used_bytes();
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ chordal_env->ifg = 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;
+}
+
+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 *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);
+ }
+ }
+
+ /* 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");
+ }
+ }
+ }
+
+ if(cb->at_end)
+ cb->at_end(file, self);
+
+ fprintf(file, "}\n");
+ bitset_free(nodes);
}
-static INLINE be_if_edge_t *edge_init(be_if_edge_t* edge, int source, int target) {
- /* Bring the smaller entry to src. */
- if (source > target) {
- edge->sourceNode = target;
- edge->targetNode = source;
- } else {
- edge->sourceNode = source;
- edge->targetNode = target;
+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);
+ }
}
- return edge;
+
}
-be_if_graph_t* be_ifg_new(int slots) {
- be_if_graph_t* graph = malloc(sizeof(*graph));
- graph->edges = new_set(if_edge_cmp, slots);
- graph->nodes = new_set(if_node_cmp, slots);
- return graph;
+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_free(be_if_graph_t* graph) {
- be_if_node_t* ifn;
- for (ifn = set_first(graph->nodes); ifn; ifn = set_next(graph->nodes)) {
- free(ifn->neighbourNodes);
- ifn->neighbourNodes = 0;
+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);
+ }
}
- free(graph->nodes);
- graph->nodes = 0;
- free(graph->edges);
- graph->edges = 0;
- free(graph);
+
+ stat->n_comps = int_component_stat(birg, ifg);
+ bitset_free(nodes);
}
-void be_ifg_add_interference(be_if_graph_t* graph, int source, int target) {
- /* insert edge */
- be_if_edge_t edge;
- edge_init(&edge, source, target);
- set_insert(graph->edges, &edge, sizeof(edge), IF_EDGE_HASH(&edge));
+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
+};
- /* insert nodes */
- be_if_node_t node;
- node.nodeNumber = source;
- node.neighbourNodes = pset_new_ptr(IF_NODE_NEIGHBOUR_SLOTS);
- be_if_node_t* sourceNode = set_insert(graph->nodes, &node, sizeof(node), IF_NODE_HASH(&node));
- node.nodeNumber = target;
- node.neighbourNodes = pset_new_ptr(IF_NODE_NEIGHBOUR_SLOTS);
- be_if_node_t* targetNode = set_insert(graph->nodes, &node, sizeof(node), IF_NODE_HASH(&node));
+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
+};
- /* insert neighbors into nodes */
- pset_insert_ptr(sourceNode->neighbourNodes, targetNode);
- pset_insert_ptr(targetNode->neighbourNodes, sourceNode);
+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);
}
-static INLINE int are_connected(const be_if_graph_t* graph, int source, int target) {
- be_if_edge_t edge;
- edge_init(&edge, source, target);
- return set_find(graph->edges, &edge, sizeof(edge), IF_EDGE_HASH(&edge)) != NULL;
+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;
}
-int be_ifg_has_edge(const be_if_graph_t* graph, const be_if_node_t* n1, const be_if_node_t* n2) {
- return are_connected(graph, n1->nodeNumber, n2->nodeNumber);
+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;
}
projects / libfirm / blobdiff