/*
- * 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.
*/
/**
* @brief Interface for interference graphs.
* @author Sebastian Hack
* @date 18.11.2005
- * @version $Id$
*/
#include "config.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"
{
nodes_iter_t *it = (nodes_iter_t*)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) {
}
}
-static void find_nodes(const be_ifg_t *ifg, nodes_iter_t *iter)
+nodes_iter_t be_ifg_nodes_begin(be_ifg_t const *const ifg)
{
- obstack_init(&iter->obst);
- iter->n = 0;
- iter->curr = 0;
- iter->env = ifg->env;
-
- 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);
+ nodes_iter_t iter;
+ obstack_init(&iter.obst);
+ iter.n = 0;
+ iter.curr = 0;
+ iter.env = ifg->env;
+
+ 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 inline void node_break(nodes_iter_t *it, int force)
+ir_node *be_ifg_nodes_next(nodes_iter_t *const it)
{
- if ((it->curr >= it->n || force) && it->nodes) {
+ if (it->curr < it->n) {
+ return it->nodes[it->curr++];
+ } else {
obstack_free(&it->obst, NULL);
- it->nodes = NULL;
+ return NULL;
}
}
-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;
-}
-
-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 = (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);
- border_t *b;
int has_started = 0;
if (!be_is_live_in(lv, block, it->irn) && block != get_nodes_block(it->irn))
const ir_node *irn)
{
find_neighbours(ifg, iter, irn);
- return ir_nodeset_iterator_next(&iter->iter);
+ return get_next_neighbour(iter);
}
ir_node *be_ifg_neighbours_next(neighbours_iter_t *iter)
/* 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 = (ir_node*)pset_first(it->living); irn != NULL;
- irn = (ir_node*)pset_next(it->living)) {
+ foreach_pset(it->living, ir_node, irn) {
it->buf[count++] = irn;
}
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);
+ dom_tree_walk_irg(ifg->env->irg, get_blocks_dom_order, NULL, it);
it->cenv = ifg->env;
it->buf = buf;
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))
+ 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(ir_graph *irg, be_ifg_t *ifg)
{
int n_comp = 0;
- nodes_iter_t nodes_it;
- bitset_t *seen = bitset_irg_malloc(irg);
+ bitset_t *seen = bitset_malloc(get_irg_last_idx(irg));
- ir_node *n;
-
- 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);
}
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;
+ 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) {
- bitset_add_irn(nodes, n);
- stat->n_edges += !bitset_contains_irn(nodes, 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);
- bitset_free(nodes);
}
projects / libfirm / blobdiff