Commit e3a9f433 authored by Michael Beck's avatar Michael Beck
Browse files

C99 feature removed.

[r26962]
parent 7ad745a9
...@@ -159,8 +159,8 @@ static void free_node_info(void) ...@@ -159,8 +159,8 @@ static void free_node_info(void)
node_info *n; node_info *n;
n = link_node_state_list; n = link_node_state_list;
while(n) { while(n) {
++a;
node_info *next = n->freelistnext; node_info *next = n->freelistnext;
++a;
xfree(n); xfree(n);
n = next; n = next;
} }
...@@ -1343,7 +1343,7 @@ static void find_most_inner_loop(ir_loop *loop) ...@@ -1343,7 +1343,7 @@ static void find_most_inner_loop(ir_loop *loop)
void loop_optimization(ir_graph *irg) void loop_optimization(ir_graph *irg)
{ {
ir_loop *loop; ir_loop *loop;
int sons, nr; int i, sons, nr;
/* Init */ /* Init */
link_node_state_list = NULL; link_node_state_list = NULL;
...@@ -1380,12 +1380,11 @@ void loop_optimization(ir_graph *irg) ...@@ -1380,12 +1380,11 @@ void loop_optimization(ir_graph *irg)
*/ */
loops = NEW_ARR_F(ir_node *, 0); loops = NEW_ARR_F(ir_node *, 0);
for (nr=0; nr<sons; nr++) { for (nr = 0; nr < sons; ++nr) {
find_most_inner_loop(get_loop_son(loop, nr)); find_most_inner_loop(get_loop_son(loop, nr));
} }
int i; for (i = 0; i < ARR_LEN(loops); ++i) {
for(i=0; i< ARR_LEN(loops); ++i) {
ir_loop *loop; ir_loop *loop;
/* not that efficient */ /* not that efficient */
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment