X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Firbackedge.c;h=6607f216f22c9f325b299eb4a40d5eba485f20ab;hb=819e65a153b40fcec250c779dfab17b63ac0441d;hp=9bc7b3a30a968451341cf0e25c61a42197c168f7;hpb=5244f95767968d8b59ef3f2031612b86474e2455;p=libfirm diff --git a/ir/ana/irbackedge.c b/ir/ana/irbackedge.c index 9bc7b3a30..6607f216f 100644 --- a/ir/ana/irbackedge.c +++ b/ir/ana/irbackedge.c @@ -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,7 +65,7 @@ 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); @@ -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))) @@ -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); }