node_info *n;
n = link_node_state_list;
while(n) {
- ++a;
node_info *next = n->freelistnext;
+ ++a;
xfree(n);
n = next;
}
void loop_optimization(ir_graph *irg)
{
ir_loop *loop;
- int sons, nr;
+ int i, sons, nr;
/* Init */
link_node_state_list = NULL;
*/
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));
}
- int i;
- for(i=0; i< ARR_LEN(loops); ++i) {
+ for (i = 0; i < ARR_LEN(loops); ++i) {
ir_loop *loop;
/* not that efficient */