X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Fcallgraph.c;h=89714502bfee926dcad7a7f8c8de09619705f1b4;hb=ed85eaaf130c68efbc2b671eee2910071bbc6c8d;hp=d8ff40ee6b59ca1d7e677fd94af3a7c8f6a6fc35;hpb=e88385016800d3c56c3fa09770e9f7995c42e106;p=libfirm

diff --git a/ir/ana/callgraph.c b/ir/ana/callgraph.c
index d8ff40ee6..89714502b 100644
--- a/ir/ana/callgraph.c
+++ b/ir/ana/callgraph.c
@@ -299,7 +299,7 @@ static int graph_cmp(const void *elt, const void *key)
 /* Construct and destruct the callgraph. */
 void compute_callgraph(void)
 {
-	int i, n_irgs;
+	size_t i, n_irgs;
 
 	/* initialize */
 	free_callgraph();
@@ -357,7 +357,7 @@ void compute_callgraph(void)
 /* Destruct the callgraph. */
 void free_callgraph(void)
 {
-	int i, n_irgs = get_irp_n_irgs();
+	size_t i, n_irgs = get_irp_n_irgs();
 	for (i = 0; i < n_irgs; ++i) {
 		ir_graph *irg = get_irp_irg(i);
 		if (irg->callees) DEL_ARR_F(irg->callees);
@@ -400,7 +400,7 @@ static void do_walk(ir_graph *irg, callgraph_walk_func *pre, callgraph_walk_func
 
 void callgraph_walk(callgraph_walk_func *pre, callgraph_walk_func *post, void *env)
 {
-	int i, n_irgs = get_irp_n_irgs();
+	size_t i, n_irgs = get_irp_n_irgs();
 	++master_cg_visited;
 
 	/* roots are methods which have no callers in the current program */
@@ -663,8 +663,7 @@ static ir_loop *new_loop(void)
 
 static void init_scc(struct obstack *obst)
 {
-	int i;
-	int n_irgs;
+	size_t i, n_irgs;
 
 	current_dfn   = 1;
 	loop_node_cnt = 0;
@@ -918,7 +917,7 @@ static void cgscc(ir_graph *n)
  */
 static void reset_isbe(void)
 {
-	int i, n_irgs = get_irp_n_irgs();
+	size_t i, n_irgs = get_irp_n_irgs();
 
 	for (i = 0; i < n_irgs; ++i) {
 		ir_graph *irg = get_irp_irg(i);
@@ -984,7 +983,7 @@ static void compute_loop_depth(ir_graph *irg, void *env)
 /* For callees, we want to remember the Call nodes, too. */
 typedef struct ana_entry2 {
 	ir_loop **loop_stack;   /**< a stack of ir_loop entries */
-	int tos;                /**< the top of stack entry */
+	size_t    tos;          /**< the top of stack entry */
 	int recursion_nesting;
 } ana_entry2;
 
@@ -1014,9 +1013,9 @@ static ir_loop *pop2(ana_entry2 *e)
  */
 static int in_stack(ana_entry2 *e, ir_loop *g)
 {
-	int i;
-	for (i = e->tos-1; i >= 0; --i) {
-		if (e->loop_stack[i] == g) return 1;
+	size_t i;
+	for (i = e->tos; i != 0;) {
+		if (e->loop_stack[--i] == g) return 1;
 	}
 	return 0;
 }
@@ -1151,7 +1150,7 @@ static void compute_method_execution_frequency(ir_graph *irg, void *env)
 /* Compute the backedges that represent recursions. */
 void find_callgraph_recursions(void)
 {
-	int i, n_irgs;
+	size_t i, n_irgs;
 	struct obstack temp;
 
 	reset_isbe();