X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fana%2Firbackedge.c;h=6607f216f22c9f325b299eb4a40d5eba485f20ab;hb=87d0e52206e83773dcd8a260418e53f3eb6bbb83;hp=0af98d89e4ed44a30677456d4b1f002aae8db104;hpb=1904be1476fab95c3f09c622f9718bb44b6aae6c;p=libfirm

diff --git a/ir/ana/irbackedge.c b/ir/ana/irbackedge.c
index 0af98d89e..6607f216f 100644
--- a/ir/ana/irbackedge.c
+++ b/ir/ana/irbackedge.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2011 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -44,7 +44,7 @@
  * Does not assert whether the backarray is correct -- use
  * very careful!
  */
-static bitset_t *mere_get_backarray(ir_node *n)
+static bitset_t *mere_get_backarray(const ir_node *n)
 {
 	switch (get_irn_opcode(n)) {
 	case iro_Block:
@@ -65,14 +65,14 @@ static bitset_t *mere_get_backarray(ir_node *n)
  * Returns backarray if the node can have backedges, else returns
  * NULL.
  */
-static bitset_t *get_backarray(ir_node *n)
+static bitset_t *get_backarray(const ir_node *n)
 {
 	bitset_t *ba = mere_get_backarray(n);
 
 #ifndef NDEBUG
 	if (ba) {
-		int bal = bitset_size(ba);  /* avoid macro expansion in assertion. */
-		int inl = get_irn_arity(n);
+		size_t bal = bitset_size(ba);  /* avoid macro expansion in assertion. */
+		size_t inl = get_irn_arity(n);
 		assert(bal == inl && "backedge array with faulty length");
 	}
 #endif
@@ -85,7 +85,7 @@ static bitset_t *get_backarray(ir_node *n)
  * Returns non-zero if node has no backarray, or
  *                  if size of backarray == size of in array.
  */
-static int legal_backarray(ir_node *n)
+static int legal_backarray(const ir_node *n)
 {
 	bitset_t *ba = mere_get_backarray(n);
 	if (ba && (bitset_size(ba) != (unsigned) get_irn_arity(n)))
@@ -97,7 +97,7 @@ static int legal_backarray(ir_node *n)
 void fix_backedges(struct obstack *obst, ir_node *n)
 {
 	bitset_t *arr = mere_get_backarray(n);
-	ir_opcode opc;
+	unsigned opc;
 	int arity;
 
 	if (! arr)
@@ -119,7 +119,7 @@ void fix_backedges(struct obstack *obst, ir_node *n)
 }
 
 /* Returns non-zero if the predecessor pos is a backedge. */
-int is_backedge(ir_node *n, int pos)
+int is_backedge(const ir_node *n, int pos)
 {
 	bitset_t *ba = get_backarray(n);
 	if (ba)
@@ -144,7 +144,7 @@ void set_not_backedge(ir_node *n, int pos)
 }
 
 /* Returns non-zero if n has backedges. */
-int has_backedges(ir_node *n)
+int has_backedges(const ir_node *n)
 {
 	bitset_t *ba = get_backarray(n);
 	if (ba != NULL) {
@@ -163,7 +163,7 @@ void clear_backedges(ir_node *n)
 }
 
 /* Allocate a new backedge array on the obstack for given size. */
-bitset_t *new_backedge_arr(struct obstack *obst, unsigned size)
+bitset_t *new_backedge_arr(struct obstack *obst, size_t size)
 {
 	return bitset_obstack_alloc(obst, size);
 }