beifg: Let be_ifg_foreach_node() declare the node variable.

diff --git a/ir/be/becopyheur4.c b/ir/be/becopyheur4.c
index a98ea3c..69fd485 100644 (file)
--- a/ir/be/becopyheur4.c
+++ b/ir/be/becopyheur4.c
@@ -638,7 +638,6 @@ static void build_affinity_chunks(co_mst_env_t *env)
 {
        nodes_iter_t nodes_it;
        aff_edge_t  *edges    = NEW_ARR_F(aff_edge_t, 0);
-       ir_node     *n;
        int         i, len;
        size_t      pn;
 

diff --git a/ir/be/becopyilp.c b/ir/be/becopyilp.c
index c2a7437..f954592 100644 (file)
--- a/ir/be/becopyilp.c
+++ b/ir/be/becopyilp.c
@@ -131,7 +131,6 @@ static inline bool sr_is_simplicial(size_red_t *sr, const ir_node *ifn)
 
 void sr_remove(size_red_t *sr)
 {
-       ir_node *irn;
        bool redo = true;
        const be_ifg_t *ifg = sr->co->cenv->ifg;
        nodes_iter_t iter;

diff --git a/ir/be/becopyilp2.c b/ir/be/becopyilp2.c
index 95e6b42..d2d76b3 100644 (file)
--- a/ir/be/becopyilp2.c
+++ b/ir/be/becopyilp2.c
@@ -88,7 +88,6 @@ static void build_coloring_cstr(ilp_env_t *ienv)
        unsigned        n_regs = arch_register_class_n_regs(ienv->co->cls);
        const unsigned *allocatable_colors = lenv->allocatable_colors;
        nodes_iter_t    iter;
-       ir_node        *irn;
        char            buf[32];
 
        unsigned *const colors = rbitset_alloca(n_regs);

diff --git a/ir/be/becopyopt.c b/ir/be/becopyopt.c
index f046d96..0e6729d 100644 (file)
--- a/ir/be/becopyopt.c
+++ b/ir/be/becopyopt.c
@@ -899,7 +899,6 @@ static void co_dump_appel_graph(const copy_opt_t *co, FILE *f)
        ir_graph *irg       = co->irg;
        be_irg_t *birg      = be_birg_from_irg(irg);
 
-       ir_node *irn;
        nodes_iter_t it;
        neighbours_iter_t nit;
        int n, n_regs;

diff --git a/ir/be/bedump.c b/ir/be/bedump.c
index 1c2dc18..4ec2e5d 100644 (file)
--- a/ir/be/bedump.c
+++ b/ir/be/bedump.c
@@ -35,7 +35,6 @@
 static void dump_ifg_nodes(FILE *F, const be_ifg_t *ifg)
 {
        nodes_iter_t ifg_iter;
-       ir_node     *node;
        be_ifg_foreach_node(ifg, &ifg_iter, node) {
                dump_node(F, node);
        }
@@ -44,7 +43,6 @@ static void dump_ifg_nodes(FILE *F, const be_ifg_t *ifg)
 static void dump_ifg_edges(FILE *F, const be_ifg_t *ifg)
 {
        nodes_iter_t ifg_iter;
-       ir_node     *node;
 
        be_ifg_foreach_node(ifg, &ifg_iter, node) {
                neighbours_iter_t neigh_iter;

diff --git a/ir/be/beifg.c b/ir/be/beifg.c
index 609bcea..4f79dda 100644 (file)
--- a/ir/be/beifg.c
+++ b/ir/be/beifg.c
@@ -336,8 +336,6 @@ static int int_component_stat(ir_graph *irg, be_ifg_t *ifg)
        nodes_iter_t nodes_it;
        bitset_t *seen     = bitset_malloc(get_irg_last_idx(irg));
 
-       ir_node *n;
-
        be_ifg_foreach_node(ifg, &nodes_it, n) {
                if (bitset_is_set(seen, get_irn_idx(n)))
                        continue;
@@ -360,7 +358,6 @@ void be_ifg_stat(ir_graph *irg, be_ifg_t *ifg, be_ifg_stat_t *stat)
        nodes_iter_t      nodes_it;
        neighbours_iter_t neigh_it;
        bitset_t         *nodes    = bitset_malloc(get_irg_last_idx(irg));
-       ir_node          *n;
 
        memset(stat, 0, sizeof(stat[0]));
 

diff --git a/ir/be/beifg.h b/ir/be/beifg.h
index c866f02..e0dbaa7 100644 (file)
--- a/ir/be/beifg.h
+++ b/ir/be/beifg.h
@@ -81,7 +81,7 @@ int      be_ifg_degree(const be_ifg_t *ifg, const ir_node *irn);
        for (ir_node *pos = be_ifg_neighbours_begin(ifg, iter, irn); pos; pos = be_ifg_neighbours_next(iter))
 
 #define be_ifg_foreach_node(ifg, iter, pos) \
-       for(pos = be_ifg_nodes_begin(ifg, iter); pos != NULL; pos = be_ifg_nodes_next(iter))
+       for (ir_node *pos = be_ifg_nodes_begin(ifg, iter); pos; pos = be_ifg_nodes_next(iter))
 
 #define be_ifg_foreach_clique(ifg, iter, buf, count) \
        for(*(count) = be_ifg_cliques_begin(ifg, iter, buf); \