Commit 8428d501 authored by Christoph Mallon's avatar Christoph Mallon
Browse files

Remove unnecessary return; at end of void functions.

[r20959]
parent 99122ea7
...@@ -214,8 +214,6 @@ static void irg_out_walk_2(ir_node *node, irg_walk_func *pre, ...@@ -214,8 +214,6 @@ static void irg_out_walk_2(ir_node *node, irg_walk_func *pre,
} }
if (post) post(node, env); if (post) post(node, env);
return;
} }
void irg_out_walk(ir_node *node, void irg_out_walk(ir_node *node,
...@@ -226,7 +224,6 @@ void irg_out_walk(ir_node *node, ...@@ -226,7 +224,6 @@ void irg_out_walk(ir_node *node,
inc_irg_visited (current_ir_graph); inc_irg_visited (current_ir_graph);
irg_out_walk_2(node, pre, post, env); irg_out_walk_2(node, pre, post, env);
} }
return;
} }
static void irg_out_block_walk2(ir_node *bl, static void irg_out_block_walk2(ir_node *bl,
......
...@@ -571,8 +571,6 @@ static void be_ra_chordal_main(be_irg_t *birg) ...@@ -571,8 +571,6 @@ static void be_ra_chordal_main(be_irg_t *birg)
stat_ev_if { stat_ev_if {
be_stat_ev("insns_after", count_insns(irg)); be_stat_ev("insns_after", count_insns(irg));
} }
return;
} }
static be_ra_t be_ra_chordal_allocator = { static be_ra_t be_ra_chordal_allocator = {
......
...@@ -270,8 +270,6 @@ static void find_nodes(const ifg_clique_t *ifg, cli_iter_t *it) ...@@ -270,8 +270,6 @@ static void find_nodes(const ifg_clique_t *ifg, cli_iter_t *it)
element = list_entry(cli_head->list.next, cli_element_t, list); element = list_entry(cli_head->list.next, cli_element_t, list);
it->curr_cli_element = element; it->curr_cli_element = element;
} }
return;
} }
static ir_node *get_next_node(cli_iter_t *it) static ir_node *get_next_node(cli_iter_t *it)
...@@ -401,8 +399,6 @@ static void find_first_neighbour(const ifg_clique_t *ifg, cli_iter_t *it, const ...@@ -401,8 +399,6 @@ static void find_first_neighbour(const ifg_clique_t *ifg, cli_iter_t *it, const
it->curr_cli_element = element; it->curr_cli_element = element;
it->curr_irn = irn; it->curr_irn = irn;
return;
} }
static ir_node *get_next_neighbour(cli_iter_t *it) static ir_node *get_next_neighbour(cli_iter_t *it)
...@@ -484,8 +480,6 @@ static void ifg_clique_neighbours_break(const void *self, void *iter) ...@@ -484,8 +480,6 @@ static void ifg_clique_neighbours_break(const void *self, void *iter)
(void) self; (void) self;
bitset_free(it->visited_neighbours); bitset_free(it->visited_neighbours);
return;
} }
static ir_node *ifg_clique_nodes_begin(const void *self, void *iter) static ir_node *ifg_clique_nodes_begin(const void *self, void *iter)
...@@ -506,8 +500,6 @@ static void ifg_clique_nodes_break(const void *self, void *iter) ...@@ -506,8 +500,6 @@ static void ifg_clique_nodes_break(const void *self, void *iter)
(void) self; (void) self;
bitset_free(it->visited_nodes); bitset_free(it->visited_nodes);
return;
} }
static int ifg_clique_degree(const void *self, const ir_node *irn) static int ifg_clique_degree(const void *self, const ir_node *irn)
......
...@@ -614,8 +614,6 @@ static void ifg_pointer_neighbours_break(const void *self, void *iter) ...@@ -614,8 +614,6 @@ static void ifg_pointer_neighbours_break(const void *self, void *iter)
(void) self; (void) self;
bitset_free(it->visited_neighbours); bitset_free(it->visited_neighbours);
return;
} }
static ir_node *ifg_pointer_nodes_begin(const void *self, void *iter) static ir_node *ifg_pointer_nodes_begin(const void *self, void *iter)
......
...@@ -665,8 +665,6 @@ static void assure_constraints_walker(ir_node *irn, void *walk_env) { ...@@ -665,8 +665,6 @@ static void assure_constraints_walker(ir_node *irn, void *walk_env) {
if (sched_is_scheduled(irn) && mode_is_datab(get_irn_mode(irn))) if (sched_is_scheduled(irn) && mode_is_datab(get_irn_mode(irn)))
assure_different_constraints(irn, walk_env); assure_different_constraints(irn, walk_env);
return;
} }
/** /**
......
...@@ -282,7 +282,6 @@ void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) ...@@ -282,7 +282,6 @@ void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
#ifdef INTERPROCEDURAL_VIEW #ifdef INTERPROCEDURAL_VIEW
} }
#endif #endif
return;
} }
/* /*
...@@ -432,7 +431,6 @@ void irg_walk_in_or_dep(ir_node *node, irg_walk_func *pre, irg_walk_func *post, ...@@ -432,7 +431,6 @@ void irg_walk_in_or_dep(ir_node *node, irg_walk_func *pre, irg_walk_func *post,
nodes_touched = irg_walk_in_or_dep_2(node, pre, post, env); nodes_touched = irg_walk_in_or_dep_2(node, pre, post, env);
clear_using_irn_visited(current_ir_graph); clear_using_irn_visited(current_ir_graph);
} }
return;
} }
/* /*
...@@ -496,7 +494,6 @@ cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) ...@@ -496,7 +494,6 @@ cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
if (post) post(node, env); if (post) post(node, env);
} }
return;
} }
#ifdef INTERPROCEDURAL_VIEW #ifdef INTERPROCEDURAL_VIEW
......
...@@ -233,8 +233,6 @@ static void do_type_walk(type_or_ent tore, ...@@ -233,8 +233,6 @@ static void do_type_walk(type_or_ent tore,
/* execute post method */ /* execute post method */
if (post) if (post)
post(tore, env); post(tore, env);
return;
} }
/** Check whether node contains types or entities as an attribute. /** Check whether node contains types or entities as an attribute.
...@@ -319,7 +317,6 @@ void type_walk_irg(ir_graph *irg, ...@@ -319,7 +317,6 @@ void type_walk_irg(ir_graph *irg,
do_type_walk(cont, pre, post, env); do_type_walk(cont, pre, post, env);
current_ir_graph = rem; current_ir_graph = rem;
return;
} }
static void type_walk_s2s_2(type_or_ent tore, static void type_walk_s2s_2(type_or_ent tore,
...@@ -399,7 +396,6 @@ static void type_walk_s2s_2(type_or_ent tore, ...@@ -399,7 +396,6 @@ static void type_walk_s2s_2(type_or_ent tore,
printf(" *** Faulty type or entity! \n"); printf(" *** Faulty type or entity! \n");
break; break;
} }
return;
} }
void type_walk_super2sub(type_walk_func *pre, void type_walk_super2sub(type_walk_func *pre,
...@@ -494,7 +490,6 @@ type_walk_super_2(type_or_ent tore, ...@@ -494,7 +490,6 @@ type_walk_super_2(type_or_ent tore,
printf(" *** Faulty type or entity! \n"); printf(" *** Faulty type or entity! \n");
break; break;
} }
return;
} }
void type_walk_super(type_walk_func *pre, void type_walk_super(type_walk_func *pre,
...@@ -548,8 +543,6 @@ class_walk_s2s_2(ir_type *tp, ...@@ -548,8 +543,6 @@ class_walk_s2s_2(ir_type *tp,
/* execute post method */ /* execute post method */
if (post) if (post)
post(tp, env); post(tp, env);
return;
} }
void class_walk_super2sub(class_walk_func *pre, void class_walk_super2sub(class_walk_func *pre,
......
...@@ -817,8 +817,6 @@ static void _trunc(const fp_value *a, fp_value *result) { ...@@ -817,8 +817,6 @@ static void _trunc(const fp_value *a, fp_value *result) {
sc_and(_mant(a), temp, _mant(result)); sc_and(_mant(a), temp, _mant(result));
if (a != result) memcpy(_exp(result), _exp(a), value_size); if (a != result) memcpy(_exp(result), _exp(a), value_size);
return;
} }
/******** /********
......
...@@ -134,8 +134,6 @@ INLINE static void tarval_verify(tarval *tv) ...@@ -134,8 +134,6 @@ INLINE static void tarval_verify(tarval *tv)
if (!FIND_TARVAL(tv)) fail_verify(tv); if (!FIND_TARVAL(tv)) fail_verify(tv);
if (tv->length > 0 && !FIND_VALUE(tv->value, tv->length)) fail_verify(tv); if (tv->length > 0 && !FIND_VALUE(tv->value, tv->length)) fail_verify(tv);
return;
} }
#endif /* NDEBUG */ #endif /* NDEBUG */
......
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