-/**
- * @file beifg_pointer.c
- * @date 18.11.2005
- * @author Sebastian Hack
+/*
+ * Copyright (C) 1995-2007 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.
*
- * Copyright (C) 2005 Universitaet Karlsruhe
- * Released under the GPL
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
*/
+/**
+ * @file
+ * @brief Pointer based implementation of chordal interference graphs.
+ * @author Sebastian Hack
+ * @date 18.11.2005
+ * @version $Id$
+ */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
typedef struct _ptr_element_t ptr_element_t;
typedef union element_content {
- ir_node *irn;
+ ir_node *irn;
ptr_element_t *element;
} element_content;
typedef struct _ptr_head_t {
struct list_head list;
- ptr_element_t *element;
+ ptr_element_t *element;
} ptr_head_t;
typedef struct _ifg_pointer_t {
- const be_ifg_impl_t *impl;
+ const be_ifg_impl_t *impl;
const be_chordal_env_t *env;
- ir_phase ph;
- struct obstack obst;
- ptr_head_t *curr_ptr_head;
- ptr_element_t *curr_element;
- pmap *node_map;
+ ir_phase ph;
+ struct obstack obst;
+ ptr_head_t *curr_ptr_head;
+ ptr_element_t *curr_element;
} ifg_pointer_t;
typedef struct _ptr_iter_t {
const ifg_pointer_t *ifg;
- const ir_node *irn;
- ptr_head_t *curr_ptr_head;
- ptr_head_t *first_head;
- ptr_element_t *curr_element_t;
- ir_node *curr_irn;
- int get_first;
- int sub_call;
- bitset_t *visited_neighbours;
+ const ir_node *irn;
+ ptr_head_t *curr_ptr_head;
+ ptr_head_t *first_head;
+ ptr_element_t *curr_element_t;
+ ir_node *curr_irn;
+ int get_first;
+ int sub_call;
+ bitset_t *visited_neighbours;
} ptr_iter_t;
/* PRIVATE FUNCTIONS */
-static void *ptr_irn_data_init(ir_phase *ph, ir_node *irn, void *data)
+static void *ptr_irn_data_init(ir_phase *ph, const ir_node *irn, void *data)
{
ptr_head_t *head = phase_alloc(ph, sizeof(*head));
+ (void) irn;
+ (void) data;
INIT_LIST_HEAD(&head->list);
return head;
}
static void write_pointers(bitset_t *live, ifg_pointer_t *ifg)
{
- ir_node *live_irn;
- bitset_pos_t elm;
+ ir_node *live_irn;
+ bitset_pos_t elm;
- bitset_foreach_irn(ifg->env->irg, live, elm, live_irn)
- {
- ptr_head_t *head = phase_get_or_set_irn_data(&ifg->ph, live_irn);
+ bitset_foreach_irn(ifg->env->irg, live, elm, live_irn) {
+ ptr_head_t *head = phase_get_or_set_irn_data(&ifg->ph, live_irn);
ptr_head_t *element = ptr_get_new_head(ifg);
- ir_node *irn = NULL;
-
-#if 0
- // Matze: huh, what is this?!? node numbers aren't in any way deterministic AFAIK
- if (live_irn->node_nr == 1883 || live_irn->node_nr == 1858)
- irn = NULL;
-#endif
element->element = ifg->curr_element; /* write current highest sub-clique for each node */
list_add(&element->list, &head->list);
-
- /* the following code is to find all nodes, it should be replaced by a "keywalker" of irphase */
- irn = pmap_get(ifg->node_map, live_irn);
- if (!irn)
- pmap_insert(ifg->node_map, live_irn, live_irn);
}
}
static void find_neighbour_walker(ir_node *bl, void *data)
{
- ifg_pointer_t *ifg = data;
- struct list_head *head = get_block_border_head(ifg->env, bl);
- border_t *b;
- bitset_t *live = bitset_malloc(get_irg_last_idx(ifg->env->irg));
- bitset_t *my_live;
- bitset_pos_t my_elm;
- ir_node *my_irn;
- element_content last_irn;
- element_content last_element;
- int was_def = 0;
- ir_node *first = NULL;
- int was_first = 0;
-
- last_irn.irn = NULL;
+ ifg_pointer_t *ifg = data;
+ struct list_head *head = get_block_border_head(ifg->env, bl);
+ int was_def = 0;
+ int was_first = 0;
+ ir_node *first = NULL;
+ bitset_t *live = bitset_malloc(get_irg_last_idx(ifg->env->irg));
+ bitset_t *my_live;
+ bitset_pos_t my_elm;
+ border_t *b;
+ ir_node *my_irn;
+ element_content last_irn;
+ element_content last_element;
+
+ last_irn.irn = NULL;
last_element.element = NULL;
assert(is_Block(bl) && "There is no block to work on.");
foreach_border_head(head, b) /* follow the borders of the block */
{
- ir_node *irn = b->irn;
+ ir_node *irn = b->irn;
ptr_element_t *element = NULL;
-#if 0
- // ?!?
- if (irn->node_nr == 1883 || irn->node_nr == 1858)
- i=1;
-#endif
-
if (b->is_def) /* b is a new node */
{
bitset_set(live, get_irn_idx(irn));
element->content_second.irn = b->irn;
element->kind = 8888; /* both are ir_nodes */
-#if 0
- // ?!?
- if (irn->node_nr == 1883 || irn->node_nr == 1858 || irn->node_nr == 1936)
- i=1;
-#endif
-
-
last_element.element = element;
- ifg->curr_element = element;
- last_irn.irn = NULL;
+ ifg->curr_element = element;
+ last_irn.irn = NULL;
}
else
{
last_element.element = get_last_sub_clique(ifg, live, my_live, irn);
/* check and add still living nodes */
- //bitset_remv_irn(my_live, irn);
if (bitset_popcnt(my_live) > 1)
{
if (last_element.element)
my_element->kind = 8888; /* both are ir_nodes */
last_element.element = my_element;
ifg->curr_element = my_element;
-
-#if 0
- // ?!?
- if (my_irn->node_nr == 1883 || my_irn->node_nr == 1858 || my_irn->node_nr == 1936)
- i=1;
-#endif
-
-
first = NULL;
}
else
static ir_node *get_first_irn(const ifg_pointer_t *ifg, ptr_iter_t *it)
{
- /* this should be replaced using a keywalker of the irphase &ifg.ph */
- ir_node *irn;
- pmap_entry *entry;
-
- it->ifg = ifg;
- entry = pmap_first(ifg->node_map);
+ ir_node *irn = phase_get_first_node(&ifg->ph);
- if (!entry)
+ if (! irn)
return NULL;
- irn = entry->value;
it->curr_irn = irn;
return irn;
static ir_node *get_next_irn(ptr_iter_t *it)
{
- /* this should be replaced using a keywalker of the irphase &ifg.ph */
- ir_node *irn;
- pmap_entry *entry;
+ ir_node *irn = phase_get_next_node(&it->ifg->ph, it->curr_irn);
- irn = it->curr_irn;
- entry = pmap_next(it->ifg->node_map);
-
- if (!entry)
+ if (! irn)
return NULL;
- it->curr_irn = entry->value;
+ it->curr_irn = irn;
- return entry->value;
+ return irn;
}
static ir_node *get_next_neighbour(ptr_iter_t *it)
{
- ir_node *res;
- ptr_head_t *head;
+ ir_node *res;
+ ptr_head_t *head;
ptr_element_t *element;
element = it->curr_element_t;
if (element == NULL)
{
-#if 0
- // ?!?
- if (it->irn->node_nr == 1883 || it->irn->node_nr == 1858)
- i=1;
-#endif
-
if (it->curr_ptr_head->list.next != &it->first_head->list)
{
head = list_entry(it->curr_ptr_head->list.next, ptr_head_t, list);
static ir_node *get_first_neighbour(const ifg_pointer_t *ifg, ptr_iter_t *it, const ir_node *irn)
{
- ir_node *res;
- ptr_head_t *head;
+ ir_node *res;
+ ptr_head_t *head;
ptr_element_t *element;
- bitset_t *bitsetvisited_neighbours = bitset_malloc(get_irg_last_idx(ifg->env->irg));
+ bitset_t *bitsetvisited_neighbours = bitset_malloc(get_irg_last_idx(ifg->env->irg));
- it->ifg = ifg;
- it->irn = irn;
+ it->ifg = ifg;
+ it->irn = irn;
it->get_first = 0;
- it->sub_call = 0;
+ it->sub_call = 0;
it->visited_neighbours = bitsetvisited_neighbours;
head = phase_get_irn_data(&ifg->ph, irn);
- if (!head)
+ if (! head)
return NULL;
else
{
static int ifg_pointer_connected(const void *self, const ir_node *a, const ir_node *b)
{
const ifg_pointer_t *ifg = self;
- int connected = -1;
- ptr_iter_t it;
- ir_node *irn = NULL;
+ int connected = -1;
+ ptr_iter_t it;
+ ir_node *irn = NULL;
- irn = get_first_neighbour(ifg, &it, a);
+ irn = get_first_neighbour(ifg, &it, a);
connected = 0;
while (irn != NULL)
{
static ir_node *ifg_pointer_neighbours_next(const void *self, void *iter)
{
+ (void) self;
return get_next_neighbour(iter);
}
static void ifg_pointer_neighbours_break(const void *self, void *iter)
{
ptr_iter_t *it = iter;
+ (void) self;
bitset_free(it->visited_neighbours);
static ir_node *ifg_pointer_nodes_next(const void *self, void *iter)
{
+ (void) self;
return get_next_irn(iter);
}
static void ifg_pointer_nodes_break(const void *self, void *iter)
{
+ (void) self;
+ (void) iter;
return;
}
ifg->impl = &ifg_pointer_impl;
ifg->env = env;
- ifg->node_map = pmap_create(); /* to find all nodes, should be replaced by a "keywalker" of irphase */
-
- phase_init(&ifg->ph, "ptr_map", env->irg, PHASE_DEFAULT_GROWTH, ptr_irn_data_init);
+ phase_init(&ifg->ph, "ptr_map", env->irg, PHASE_DEFAULT_GROWTH, ptr_irn_data_init, NULL);
obstack_init(&ifg->obst);
dom_tree_walk_irg(env->irg, find_neighbour_walker, NULL, ifg);
projects / libfirm / blobdiff