X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Fabsgraph.c;h=424db576dcf8f4244f57478dab965bc6a854cd66;hb=b1ac8fe5c7b3b462f66a99e6c780be9826414b7d;hp=02adff8db73b9f1b0e05d94294cde273a93ce1d3;hpb=0a4853e34f3143ffbd7db81fa3959b724a6e3462;p=libfirm

diff --git a/ir/ana/absgraph.c b/ir/ana/absgraph.c
index 02adff8db..424db576d 100644
--- a/ir/ana/absgraph.c
+++ b/ir/ana/absgraph.c
@@ -1,28 +1,13 @@
 /*
- * 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.
  */
 
 /**
- * @file    absgraph.c
+ * @file
  * @author  Sebastian Hack
  * @date    20.04.2007
- * @version $Id$
- * @summary
+ * @brief
  *
  * Abstract graph implementations for the CFG of a ir_graph.
  */
@@ -34,21 +19,20 @@
 
 static void *irg_cfg_succ_get_root(void *self)
 {
-	ir_graph *irg = self;
-	edges_assure_kind(irg, EDGE_KIND_BLOCK);
+	ir_graph *irg = (ir_graph*) self;
+	assure_edges_kind(irg, EDGE_KIND_BLOCK);
 	return get_irg_start_block(irg);
 }
 
 static void *irg_cfg_succ_get_end(void *self)
 {
-	ir_graph *irg = self;
+	ir_graph *irg = (ir_graph*) self;
 	return get_irg_end_block(irg);
 }
 
 static void irg_cfg_succ_grow_succs(void *self, void *node, struct obstack *obst)
 {
-	ir_node *bl = node;
-	const ir_edge_t *edge;
+	ir_node *bl = (ir_node*) node;
 
 	(void) self;
 	foreach_block_succ(bl, edge) {
@@ -77,8 +61,8 @@ static void irg_cfg_pred_grow_succs(void *self, void *node, struct obstack *obst
 	int i, n;
 
 	(void) self;
-	for (i = 0, n = get_irn_arity(node); i < n; ++i) {
-		obstack_ptr_grow(obst, get_irn_n(node, i));
+	for (i = 0, n = get_irn_arity((ir_node*) node); i < n; ++i) {
+		obstack_ptr_grow(obst, get_irn_n((ir_node*) node, i));
 	}
 }