X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeifg_list.c;h=7624d655bce959783957929e7de78faebece40ee;hb=9276447aec4972df060349e162f583c4898dfec8;hp=617f160f6f8cc607f32d181c77f6e51022a7c795;hpb=d6768d8d4427959eb045aafb1d15bd189beaa5dd;p=libfirm

diff --git a/ir/be/beifg_list.c b/ir/be/beifg_list.c
index 617f160f6..7624d655b 100644
--- a/ir/be/beifg_list.c
+++ b/ir/be/beifg_list.c
@@ -18,14 +18,12 @@
  */
 
 /**
- * @file   beifg_list.c
- * @date   18.11.2005
- * @author Sebastian Hack
- *
- * Copyright (C) 2005 Universitaet Karlsruhe
- * Released under the GPL
+ * @file
+ * @brief       List based implementation of chordal interference graphs.
+ * @author      Sebastian Hack
+ * @date        18.11.2005
+ * @version     $Id$
  */
-
 #ifdef HAVE_CONFIG_H
 #include "config.h"
 #endif
@@ -49,38 +47,39 @@
 typedef struct _adj_head_t adj_head_t;
 
 typedef struct _ifg_list_t {
-	const be_ifg_impl_t *impl;
+	const be_ifg_impl_t    *impl;
 	const be_chordal_env_t *env;
-	struct obstack obst;
-	adj_head_t **adj_heads;
+	struct obstack         obst;
+	adj_head_t             **adj_heads;
 } ifg_list_t;
 
 typedef struct _adj_element_t adj_element_t;
 
 struct _adj_element_t {
 	adj_element_t *next_adj_element;
-	ir_node *neighbour;
+	ir_node       *neighbour;
 };
 
 struct _adj_head_t {
-	ir_node *irn; /* the node you search neighbours for */
+	ir_node       *irn; /* the node you search neighbours for */
 	adj_element_t *first_adj_element;
-	int degree;
+	int           degree;
 };
 
 typedef struct _nodes_iter_t {
 	const ifg_list_t *ifg;
-	unsigned int curr_node_idx;
+	unsigned int     curr_node_idx;
 } nodes_iter_t;
 
 typedef struct _adj_iter_t {
 	const ifg_list_t *ifg;
-	adj_element_t *curr_adj_element;
+	adj_element_t    *curr_adj_element;
 } adj_iter_t;
 
 /* PRIVATE FUNCTIONS */
 
-static void create_node (ifg_list_t *ifg, ir_node *irn) /* add node to the array of all nodes in this ifg implementation, if the node isn't already in the ifg */
+/* add node to the array of all nodes in this ifg implementation, if the node isn't already in the ifg */
+static void create_node(ifg_list_t *ifg, ir_node *irn)
 {
 	adj_head_t *adj_head = NULL;
 
@@ -106,11 +105,12 @@ static adj_element_t *create_adj_element(ifg_list_t *ifg, ir_node *irn)
 	return element;
 }
 
-static void add_edge(ifg_list_t *ifg, ir_node *node_a, ir_node *node_b) /* write the information about the edge between a and b */
+/* write the information about the edge between a and b */
+static void add_edge(ifg_list_t *ifg, ir_node *node_a, ir_node *node_b)
 {
-	adj_head_t *adj_head = NULL;
+	adj_head_t    *adj_head     = NULL;
 	adj_element_t *curr_element = NULL;
-	adj_element_t *new_element = NULL;
+	adj_element_t *new_element  = NULL;
 
 	adj_head = ifg->adj_heads[node_a->node_idx]; /* find the neighbours list of a */
 
@@ -166,16 +166,16 @@ static void add_edge(ifg_list_t *ifg, ir_node *node_a, ir_node *node_b) /* write
 	}
 }
 
-static void find_neighbour_walker(ir_node *bl, void *data) /* find all adjacent nodes in the irg */
+/* find all adjacent nodes in the irg */
+static void find_neighbour_walker(ir_node *bl, void *data)
 {
-	ifg_list_t *ifg = data;
-	struct list_head *head  = get_block_border_head(ifg->env, bl);
+	ifg_list_t       *ifg      = data;
+	struct list_head *head     = get_block_border_head(ifg->env, bl);
+	nodeset          *live     = new_nodeset(ifg->env->cls->n_regs);
+	ir_node          *live_irn = NULL;
+	border_t         *b        = NULL;
 
-	nodeset *live = new_nodeset(ifg->env->cls->n_regs);
-	ir_node *live_irn = NULL;
-	border_t *b = NULL;
-
-	assert (is_Block(bl) && "There is no block to work on");
+	assert(is_Block(bl) && "There is no block to work on");
 
 	foreach_border_head(head, b) /* follow the borders of each block */
 	{
@@ -205,9 +205,9 @@ static void find_neighbour_walker(ir_node *bl, void *data) /* find all adjacent
 
 static ir_node *get_first_node(const ifg_list_t *ifg, nodes_iter_t *it)
 {
-	ir_node *res = NULL;
-	adj_head_t *adj_head= NULL;
-	int curr_idx = -1;
+	ir_node    *res      = NULL;
+	adj_head_t *adj_head = NULL;
+	int        curr_idx  = -1;
 
 	it->ifg = ifg;
 	it->curr_node_idx = 0;
@@ -231,10 +231,10 @@ static ir_node *get_first_node(const ifg_list_t *ifg, nodes_iter_t *it)
 
 static ir_node *get_next_node(nodes_iter_t *it)
 {
-	const ifg_list_t *ifg = it->ifg;
-	ir_node *res = NULL;
-	adj_head_t *adj_head= NULL;
-	unsigned int curr_idx = it->curr_node_idx;
+	const ifg_list_t *ifg      = it->ifg;
+	ir_node          *res      = NULL;
+	adj_head_t       *adj_head = NULL;
+	unsigned int      curr_idx = it->curr_node_idx;
 
 	while (adj_head == NULL && curr_idx < it->ifg->env->irg->last_node_idx - 1)
 	{
@@ -255,11 +255,11 @@ static ir_node *get_next_node(nodes_iter_t *it)
 
 static ir_node *get_first_neighbour(const ifg_list_t *ifg, adj_iter_t *it, const ir_node *curr_irn)
 {
-	ir_node *res = NULL;
+	ir_node    *res      = NULL;
 	adj_head_t *adj_head = NULL;
 
 	adj_head = ifg->adj_heads[curr_irn->node_idx];
-	assert (adj_head && "There is no entry for this node");
+	assert(adj_head && "There is no entry for this node");
 
 	it->curr_adj_element = NULL;
 	it->ifg = ifg;
@@ -277,7 +277,7 @@ static ir_node *get_first_neighbour(const ifg_list_t *ifg, adj_iter_t *it, const
 
 static ir_node *get_next_neighbour(adj_iter_t *it)
 {
-	ir_node *res = NULL;
+	ir_node       *res     = NULL;
 	adj_element_t *element = it->curr_adj_element;
 
 	if (element->next_adj_element) /* return next neighbour */
@@ -303,10 +303,10 @@ static void ifg_list_free(void *self)
 
 static int ifg_list_connected(const void *self, const ir_node *a, const ir_node *b)
 {
-	const ifg_list_t *ifg = self;
-	int res = -1;
-	adj_head_t *adj_head = NULL;
-	adj_element_t *curr_element = NULL;
+	const ifg_list_t *ifg          = self;
+	int              res           = -1;
+	adj_head_t       *adj_head     = NULL;
+	adj_element_t    *curr_element = NULL;
 
 	/* first try: find b in the neigbours of a */
 	adj_head = ifg->adj_heads[a->node_idx];
@@ -314,7 +314,7 @@ static int ifg_list_connected(const void *self, const ir_node *a, const ir_node
 	assert(adj_head && "There is no entry for the node a");
 	curr_element = adj_head->first_adj_element;
 
-	if(curr_element)
+	if (curr_element)
 	{
 		while (curr_element->neighbour != b && curr_element->next_adj_element)
 		{
@@ -334,7 +334,7 @@ static int ifg_list_connected(const void *self, const ir_node *a, const ir_node
 	assert(adj_head && "There is no entry for the node b");
 	curr_element = adj_head->first_adj_element;
 
-	if(curr_element)
+	if (curr_element)
 	{
 		while (curr_element->neighbour != a && curr_element->next_adj_element)
 		{