+/*
+ * 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
+ * @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 "beifg_t.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.h"
+#include "irphase_t.h"
+#include "error.h"
+#include "xmalloc.h"
-#define IF_EDGE_HASH(e) ((e)->sourceNode)
-#define IF_NODE_HASH(n) ((n)->nodeNumber)
-#define IF_NODE_NEIGHBOUR_SLOTS 8
+#include "becopystat.h"
+#include "becopyopt.h"
+#include "beirg.h"
+#include "bemodule.h"
+#include "beintlive_t.h"
-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;
+void be_ifg_free(be_ifg_t *self)
+{
+ free(self);
+}
- return !((e1->sourceNode == e2->sourceNode) && (e1->targetNode == e2->targetNode));
+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 = data;
+ struct list_head *head = get_block_border_head(it->env, bl);
+ border_t *b;
+
+ foreach_border_head(head, b) {
+ if (b->is_def && b->is_real) {
+ obstack_ptr_grow(&it->obst, b->irn);
+ it->n++;
+ }
+ }
}
-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;
+static void find_nodes(const be_ifg_t *ifg, nodes_iter_t *iter)
+{
+ obstack_init(&iter->obst);
+ iter->n = 0;
+ iter->curr = 0;
+ iter->env = ifg->env;
- return (n1->nodeNumber != n2->nodeNumber);
+ irg_block_walk_graph(ifg->env->irg, nodes_walker, NULL, iter);
+ obstack_ptr_grow(&iter->obst, NULL);
+ iter->nodes = obstack_finish(&iter->obst);
}
-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 inline void node_break(nodes_iter_t *it, int force)
+{
+ if ((it->curr >= it->n || force) && it->nodes) {
+ obstack_free(&it->obst, NULL);
+ it->nodes = NULL;
}
- 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 ir_node *get_next_node(nodes_iter_t *it)
+{
+ ir_node *res = NULL;
+
+ if (it->curr < it->n)
+ res = it->nodes[it->curr++];
+
+ node_break(it, 0);
+
+ return res;
}
-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;
+ir_node *be_ifg_nodes_begin(const be_ifg_t *ifg, nodes_iter_t *iter)
+{
+ find_nodes(ifg, iter);
+ return get_next_node(iter);
+}
+
+ir_node *be_ifg_nodes_next(nodes_iter_t *iter)
+{
+ return get_next_node(iter);
+}
+
+void be_ifg_nodes_break(nodes_iter_t *iter)
+{
+ node_break(iter, 1);
+}
+
+static void find_neighbour_walker(ir_node *block, void *data)
+{
+ neighbours_iter_t *it = data;
+ struct list_head *head = get_block_border_head(it->env, block);
+ be_lv_t *lv = be_get_irg_liveness(it->env->irg);
+
+ border_t *b;
+ 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);
+ }
+
}
- free(graph->nodes);
- graph->nodes = 0;
- free(graph->edges);
- graph->edges = 0;
- free(graph);
}
-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));
+static void find_neighbours(const be_ifg_t *ifg, neighbours_iter_t *it, const ir_node *irn)
+{
+ 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);
- /* 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));
+ ir_nodeset_iterator_init(&it->iter, &it->neighbours);
+}
- /* insert neighbors into nodes */
- pset_insert_ptr(sourceNode->neighbourNodes, targetNode);
- pset_insert_ptr(targetNode->neighbourNodes, sourceNode);
+static inline void neighbours_break(neighbours_iter_t *it, int force)
+{
+ (void) force;
+ assert(it->valid == 1);
+ ir_nodeset_destroy(&it->neighbours);
+ it->valid = 0;
}
-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;
+static ir_node *get_next_neighbour(neighbours_iter_t *it)
+{
+ ir_node *res = ir_nodeset_iterator_next(&it->iter);
+
+ if (res == NULL) {
+ ir_nodeset_destroy(&it->neighbours);
+ }
+ return res;
}
-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);
+ir_node *be_ifg_neighbours_begin(const be_ifg_t *ifg, neighbours_iter_t *iter,
+ const ir_node *irn)
+{
+ find_neighbours(ifg, iter, irn);
+ return ir_nodeset_iterator_next(&iter->iter);
+}
+
+ir_node *be_ifg_neighbours_next(neighbours_iter_t *iter)
+{
+ return get_next_neighbour(iter);
+}
+
+void be_ifg_neighbours_break(neighbours_iter_t *iter)
+{
+ neighbours_break(iter, 1);
+}
+
+static inline void free_clique_iter(cliques_iter_t *it)
+{
+ 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 = env;
+ obstack_ptr_grow(&it->ob, blk);
+}
+
+/**
+ * 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)
+{
+
+ /* 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]);
+
+ /* on entry to a new block set the first border ... */
+ if (!it->bor)
+ it->bor = head->prev;
+
+ /* ... 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);
+
+ /* 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;
+ ir_node *irn;
+
+ /* fill the output buffer */
+ for (irn = pset_first(it->living); irn != NULL;
+ irn = pset_next(it->living)) {
+ 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)
+{
+ ir_node *start_bl = get_irg_start_block(ifg->env->irg);
+
+ obstack_init(&it->ob);
+ dom_tree_walk(start_bl, 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 = 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;
+}
+
+void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self)
+{
+ nodes_iter_t nodes_it;
+ neighbours_iter_t neigh_it;
+ 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 void int_comp_rec(be_ifg_t *ifg, ir_node *n, bitset_t *seen)
+{
+ neighbours_iter_t neigh_it;
+ ir_node *m;
+
+ be_ifg_foreach_neighbour(ifg, &neigh_it, n, m) {
+ if (bitset_contains_irn(seen, m))
+ continue;
+
+ if (arch_get_register_req_out(m)->type & arch_register_req_type_ignore)
+ continue;
+
+ bitset_add_irn(seen, m);
+ int_comp_rec(ifg, m, seen);
+ }
+
+}
+
+static int int_component_stat(ir_graph *irg, be_ifg_t *ifg)
+{
+ int n_comp = 0;
+ nodes_iter_t nodes_it;
+ bitset_t *seen = bitset_irg_malloc(irg);
+
+ ir_node *n;
+
+ be_ifg_foreach_node(ifg, &nodes_it, n) {
+ if (bitset_contains_irn(seen, n))
+ continue;
+
+ if (arch_get_register_req_out(n)->type & arch_register_req_type_ignore)
+ continue;
+
+ ++n_comp;
+ bitset_add_irn(seen, n);
+ int_comp_rec(ifg, n, seen);
+ }
+
+ free(seen);
+ return n_comp;
+}
+
+void be_ifg_stat(ir_graph *irg, be_ifg_t *ifg, be_ifg_stat_t *stat)
+{
+ nodes_iter_t nodes_it;
+ neighbours_iter_t neigh_it;
+ bitset_t *nodes = bitset_irg_malloc(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(irg, ifg);
+ bitset_free(nodes);
}
projects / libfirm / blobdiff