-/**
- * @file beifg.c
- * @date 18.11.2005
- * @author Sebastian Hack
- *
- * Copyright (C) 2005 Universitaet Karlsruhe
- * Released under the GPL
+/*
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
-#include <stdlib.h>
-
-#ifdef HAVE_CONFIG_H
+/**
+ * @file
+ * @brief Interface for interference graphs.
+ * @author Sebastian Hack
+ * @date 18.11.2005
+ */
#include "config.h"
-#endif
-#ifdef HAVE_MALLOC_H
-#include <malloc.h>
-#endif
+#include <stdlib.h>
-#ifdef HAVE_ALLOCA_H
-#include <alloca.h>
-#endif
+#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 "beifg_t.h"
+#include "irtools.h"
+#include "beifg.h"
+#include "error.h"
+#include "xmalloc.h"
+
+#include "becopystat.h"
+#include "becopyopt.h"
+#include "beirg.h"
+#include "bemodule.h"
+#include "beintlive_t.h"
+
+void be_ifg_free(be_ifg_t *self)
+{
+ free(self);
+}
+
+int be_ifg_connected(const be_ifg_t *ifg, const ir_node *a, const ir_node *b)
+{
+ be_lv_t *lv = be_get_irg_liveness(ifg->env->irg);
+ return be_values_interfere(lv, a, b);
+}
+
+static void nodes_walker(ir_node *bl, void *data)
+{
+ nodes_iter_t *it = (nodes_iter_t*)data;
+ struct list_head *head = get_block_border_head(it->env, bl);
+
+ foreach_border_head(head, b) {
+ if (b->is_def && b->is_real) {
+ obstack_ptr_grow(&it->obst, b->irn);
+ it->n++;
+ }
+ }
+}
+
+nodes_iter_t be_ifg_nodes_begin(be_ifg_t const *const ifg)
+{
+ nodes_iter_t iter;
+ obstack_init(&iter.obst);
+ iter.n = 0;
+ iter.curr = 0;
+ iter.env = ifg->env;
-size_t (be_ifg_iter_size)(const void *self)
+ 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;
+}
+
+ir_node *be_ifg_nodes_next(nodes_iter_t *const it)
+{
+ if (it->curr < it->n) {
+ return it->nodes[it->curr++];
+ } else {
+ obstack_free(&it->obst, NULL);
+ return NULL;
+ }
+}
+
+static void find_neighbour_walker(ir_node *block, void *data)
{
- const be_ifg_t *ifg = self;
- return ifg->impl->iter_size;
+ 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);
+
+ int has_started = 0;
+
+ if (!be_is_live_in(lv, block, it->irn) && block != get_nodes_block(it->irn))
+ return;
+
+ foreach_border_head(head, b) {
+ ir_node *irn = b->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);
+ }
+
+ }
}
-void (be_ifg_free)(void *self)
+static void find_neighbours(const be_ifg_t *ifg, neighbours_iter_t *it, const ir_node *irn)
{
- be_ifg_t *ifg = self;
- ifg->impl->free(self);
+ it->env = ifg->env;
+ it->irn = irn;
+ it->valid = 1;
+ ir_nodeset_init(&it->neighbours);
+
+ dom_tree_walk(get_nodes_block(irn), find_neighbour_walker, NULL, it);
+
+ ir_nodeset_iterator_init(&it->iter, &it->neighbours);
}
-int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b)
+static inline void neighbours_break(neighbours_iter_t *it, int force)
{
- const be_ifg_t *ifg = self;
- return ifg->impl->connected(self, a, b);
+ (void) force;
+ assert(it->valid == 1);
+ ir_nodeset_destroy(&it->neighbours);
+ it->valid = 0;
}
-ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn)
+static ir_node *get_next_neighbour(neighbours_iter_t *it)
{
- const be_ifg_t *ifg = self;
- return ifg->impl->neighbours_begin(self, iter, irn);
+ ir_node *res = ir_nodeset_iterator_next(&it->iter);
+
+ if (res == NULL) {
+ ir_nodeset_destroy(&it->neighbours);
+ }
+ return res;
}
-ir_node *(be_ifg_neighbours_next)(const void *self, void *iter)
+ir_node *be_ifg_neighbours_begin(const be_ifg_t *ifg, neighbours_iter_t *iter,
+ const ir_node *irn)
{
- const be_ifg_t *ifg = self;
- return ifg->impl->neighbours_next(self, iter);
+ find_neighbours(ifg, iter, irn);
+ return get_next_neighbour(iter);
}
-ir_node *(be_ifg_nodes_begin)(const void *self, void *iter)
+ir_node *be_ifg_neighbours_next(neighbours_iter_t *iter)
{
- const be_ifg_t *ifg = self;
- return ifg->impl->nodes_begin(self, iter);
+ return get_next_neighbour(iter);
}
-ir_node *(be_ifg_nodes_next)(const void *self, void *iter)
+void be_ifg_neighbours_break(neighbours_iter_t *iter)
{
- const be_ifg_t *ifg = self;
- return ifg->impl->nodes_next(self, iter);
+ neighbours_break(iter, 1);
}
-int (be_ifg_degree)(const void *self, const ir_node *irn)
+static inline void free_clique_iter(cliques_iter_t *it)
{
- const be_ifg_t *ifg = self;
- return ifg->impl->degree(self, irn);
+ it->n_blocks = -1;
+ obstack_free(&it->ob, NULL);
+ del_pset(it->living);
}
+static void get_blocks_dom_order(ir_node *blk, void *env)
+{
+ cliques_iter_t *it = (cliques_iter_t*)env;
+ obstack_ptr_grow(&it->ob, blk);
+}
-int be_ifg_is_simplicial(const be_ifg_t *ifg, const ir_node *irn)
+/**
+ * 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)
{
- int degree = be_ifg_degree(ifg, irn);
- void *iter = be_ifg_iter_alloca(ifg);
- ir_node **neighbours = malloc(degree * sizeof(neighbours[0]));
+ /* 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]);
- ir_node *curr;
- int i, j;
+ /* on entry to a new block set the first border ... */
+ if (!it->bor)
+ it->bor = head->prev;
- be_ifg_foreach_neighbour(ifg, iter, irn, curr)
- neighbours[i++] = curr;
+ /* ... 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 < degree; ++i) {
- for(j = 0; j < i; ++j)
- if(!be_ifg_connected(ifg, neighbours[i], neighbours[j])) {
- free(neighbours);
- return 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
+
+ /* if its the last usage the irn dies */
+ {
+ /* before shrinking the set, return the current maximal clique */
+ if (output_on_shrink) {
+ int count = 0;
+
+ /* fill the output buffer */
+ foreach_pset(it->living, ir_node, irn) {
+ it->buf[count++] = irn;
+ }
+
+ assert(count > 0 && "We have a 'last usage', so there must be sth. in it->living");
+
+ return count;
+ }
+
+ pset_remove_ptr(it->living, b->irn);
}
+ }
+
+ it->bor = NULL;
+ assert(0 == pset_count(it->living) && "Something has survived! (At the end of the block it->living must be empty)");
}
+ if (it->n_blocks != -1)
+ free_clique_iter(it);
+
+ return -1;
+}
+
+int be_ifg_cliques_begin(const be_ifg_t *ifg, cliques_iter_t *it,
+ ir_node **buf)
+{
+ obstack_init(&it->ob);
+ dom_tree_walk_irg(ifg->env->irg, get_blocks_dom_order, NULL, it);
+
+ 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);
+}
+
+int be_ifg_cliques_next(cliques_iter_t *iter)
+{
+ return get_next_clique(iter);
+}
+
+void be_ifg_cliques_break(cliques_iter_t *iter)
+{
+ free_clique_iter(iter);
+}
+
+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;
+}
+
+be_ifg_t *be_create_ifg(const be_chordal_env_t *env)
+{
+ be_ifg_t *ifg = XMALLOC(be_ifg_t);
+ ifg->env = env;
+
+ return ifg;
+}
+
+static void int_comp_rec(be_ifg_t *ifg, ir_node *n, bitset_t *seen)
+{
+ neighbours_iter_t neigh_it;
+
+ be_ifg_foreach_neighbour(ifg, &neigh_it, n, m) {
+ if (bitset_is_set(seen, get_irn_idx(m)))
+ continue;
+
+ arch_register_req_t const *const req = arch_get_irn_register_req(m);
+ if (arch_register_req_is(req, ignore))
+ continue;
+
+ bitset_set(seen, get_irn_idx(m));
+ int_comp_rec(ifg, m, seen);
+ }
- free(neighbours);
- return 1;
}
-void be_fg_check(const be_ifg_t *ifg)
+static int int_component_stat(ir_graph *irg, be_ifg_t *ifg)
{
- void *iter1 = be_ifg_iter_alloca(ifg);
- void *iter2 = be_ifg_iter_alloca(ifg);
+ int n_comp = 0;
+ bitset_t *seen = bitset_malloc(get_irg_last_idx(irg));
+
+ be_ifg_foreach_node(ifg, n) {
+ if (bitset_is_set(seen, get_irn_idx(n)))
+ continue;
+
+ arch_register_req_t const *const req = arch_get_irn_register_req(n);
+ if (arch_register_req_is(req, ignore))
+ continue;
+
+ ++n_comp;
+ bitset_set(seen, get_irn_idx(n));
+ int_comp_rec(ifg, n, seen);
+ }
- ir_node *n, *m;
+ free(seen);
+ return n_comp;
+}
- /* Check, if all neighbours are indeed connected to the node. */
- be_ifg_foreach_node(ifg, iter1, n) {
- be_ifg_foreach_neighbour(ifg, iter2, n, m)
- if(!be_ifg_connected(ifg, n, m))
- ir_fprintf(stderr, "%+F is a neighbour of %+F but they are not connected!\n", n, m);
+void be_ifg_stat(ir_graph *irg, be_ifg_t *ifg, be_ifg_stat_t *stat)
+{
+ neighbours_iter_t neigh_it;
+
+ 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;
+ }
}
+
+ 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);
}
projects / libfirm / blobdiff