X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbedomfront.c;h=bee65117d66ed593e4cae77c4d6a0e0b94a7e766;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=dd54d1d744bd7d41c89409300b7fd3254a37a253;hpb=ce6161a7e42a48f7422b7babcc64d8ace18e2687;p=libfirm

diff --git a/ir/be/bedomfront.c b/ir/be/bedomfront.c
index dd54d1d74..bee65117d 100644
--- a/ir/be/bedomfront.c
+++ b/ir/be/bedomfront.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.
  *
@@ -22,7 +22,6 @@
  * @brief       Algorithms for computing dominance frontiers.
  * @author      Sebastian Hack, Daniel Grund
  * @date        04.05.2005
- * @version     $Id$
  */
 #include "config.h"
 
@@ -72,7 +71,7 @@ static ir_node **compute_df(ir_node *blk, be_dom_front_info_t *info)
 	const ir_edge_t *edge;
 	ir_node **df_list = NEW_ARR_F(ir_node *, 0);
 	ir_node **df;
-	int len;
+	size_t len;
 
 	/* Add local dominance frontiers */
 	foreach_block_succ(blk, edge) {
@@ -89,11 +88,11 @@ static ir_node **compute_df(ir_node *blk, be_dom_front_info_t *info)
 	 * dominated by the given block.
 	 */
 	for (c = get_Block_dominated_first(blk); c; c = get_Block_dominated_next(c)) {
-		int i;
+		size_t i;
 		ir_node **df_c_list = compute_df(c, info);
 
-		for (i = ARR_LEN(df_c_list) - 1; i >= 0; --i) {
-			ir_node *w = df_c_list[i];
+		for (i = ARR_LEN(df_c_list); i > 0;) {
+			ir_node *w = df_c_list[--i];
 			if (get_idom(w) != blk)
 				ARR_APP1(ir_node *, df_list, w);
 		}