G++ kindly suggested making the following changes during a build so here we go.
Bootstrapped/regtested on x86_64-suse-linux, applied as obvious.
2011-07-12 Eric Botcazou <ebotca...@adacore.com>
* cse.c (insert_with_costs): Put semi-colon after empty loop body
on the next line.
* emit-rtl.c (push_to_sequence): Likewise.
* haifa-sched.c (max_issue): Likewise.
* matrix-reorg.c (add_allocation_site): Likewise.
* postreload-gcse.c (eliminate_partially_redundant_load): Likewise.
* reload.c (alternative_allows_const_pool_ref): Likewise.
* sched-rgn.c (rgn_add_block): Likewise.
(rgn_fix_recovery_cfg): Likewise.
* tree.c (attribute_list_contained): Likewise.
c-family/
* c-ada-spec.c (dump_nested_types): Put semi-colon after empty loop
body on the next line.
--
Eric Botcazou
Index: c-family/c-ada-spec.c
===================================================================
--- c-family/c-ada-spec.c (revision 176072)
+++ c-family/c-ada-spec.c (working copy)
@@ -2333,7 +2333,8 @@ dump_nested_types (pretty_printer *buffe
if (TREE_CODE (decl) == FUNCTION_TYPE)
for (decl = TREE_TYPE (decl);
decl && TREE_CODE (decl) == POINTER_TYPE;
- decl = TREE_TYPE (decl));
+ decl = TREE_TYPE (decl))
+ ;
decl = get_underlying_decl (decl);
Index: postreload-gcse.c
===================================================================
--- postreload-gcse.c (revision 176072)
+++ postreload-gcse.c (working copy)
@@ -1131,7 +1131,8 @@ eliminate_partially_redundant_load (basi
discover additional redundancies, so mark it for later deletion. */
for (a_occr = get_bb_avail_insn (bb, expr->avail_occr);
a_occr && (a_occr->insn != insn);
- a_occr = get_bb_avail_insn (bb, a_occr->next));
+ a_occr = get_bb_avail_insn (bb, a_occr->next))
+ ;
if (!a_occr)
{
Index: tree.c
===================================================================
--- tree.c (revision 176072)
+++ tree.c (working copy)
@@ -6350,7 +6350,8 @@ attribute_list_contained (const_tree l1,
t1 != 0 && t2 != 0
&& TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
&& TREE_VALUE (t1) == TREE_VALUE (t2);
- t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
+ t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
+ ;
/* Maybe the lists are equal. */
if (t1 == 0 && t2 == 0)
Index: reload.c
===================================================================
--- reload.c (revision 176072)
+++ reload.c (working copy)
@@ -4591,7 +4591,8 @@ alternative_allows_const_pool_ref (rtx m
/* Skip alternatives before the one requested. */
while (altnum > 0)
{
- while (*constraint++ != ',');
+ while (*constraint++ != ',')
+ ;
altnum--;
}
/* Scan the requested alternative for TARGET_MEM_CONSTRAINT or 'o'.
Index: haifa-sched.c
===================================================================
--- haifa-sched.c (revision 176072)
+++ haifa-sched.c (working copy)
@@ -2568,7 +2568,8 @@ max_issue (struct ready_list *ready, int
{
n = privileged_n;
/* Try to find issued privileged insn. */
- while (n && !ready_try[--n]);
+ while (n && !ready_try[--n])
+ ;
}
if (/* If all insns are equally good... */
Index: cse.c
===================================================================
--- cse.c (revision 176072)
+++ cse.c (working copy)
@@ -1637,8 +1637,10 @@ insert_with_costs (rtx x, struct table_e
/* Put it after the last element cheaper than X. */
struct table_elt *p, *next;
- for (p = classp; (next = p->next_same_value) && CHEAPER (next, elt);
- p = next);
+ for (p = classp;
+ (next = p->next_same_value) && CHEAPER (next, elt);
+ p = next)
+ ;
/* Put it after P and before NEXT. */
elt->next_same_value = next;
Index: matrix-reorg.c
===================================================================
--- matrix-reorg.c (revision 176072)
+++ matrix-reorg.c (working copy)
@@ -719,7 +719,8 @@ add_allocation_site (struct matrix_info
must be set accordingly. */
for (min_malloc_level = 0;
min_malloc_level < mi->max_malloced_level
- && mi->malloc_for_level[min_malloc_level]; min_malloc_level++);
+ && mi->malloc_for_level[min_malloc_level]; min_malloc_level++)
+ ;
if (level < min_malloc_level)
{
mi->allocation_function_decl = current_function_decl;
Index: emit-rtl.c
===================================================================
--- emit-rtl.c (revision 176072)
+++ emit-rtl.c (working copy)
@@ -5043,7 +5043,8 @@ push_to_sequence (rtx first)
start_sequence ();
- for (last = first; last && NEXT_INSN (last); last = NEXT_INSN (last));
+ for (last = first; last && NEXT_INSN (last); last = NEXT_INSN (last))
+ ;
set_first_insn (first);
set_last_insn (last);
Index: sched-rgn.c
===================================================================
--- sched-rgn.c (revision 176072)
+++ sched-rgn.c (working copy)
@@ -3396,7 +3396,8 @@ rgn_add_block (basic_block bb, basic_blo
/* Now POS is the index of the last block in the region. */
/* Find index of basic block AFTER. */
- for (; rgn_bb_table[pos] != after->index; pos--);
+ for (; rgn_bb_table[pos] != after->index; pos--)
+ ;
pos++;
gcc_assert (pos > ebb_head[i - 1]);
@@ -3443,12 +3444,14 @@ rgn_fix_recovery_cfg (int bbi, int check
for (old_pos = ebb_head[BLOCK_TO_BB (check_bbi) + 1] - 1;
rgn_bb_table[old_pos] != check_bb_nexti;
- old_pos--);
+ old_pos--)
+ ;
gcc_assert (old_pos > ebb_head[BLOCK_TO_BB (check_bbi)]);
for (new_pos = ebb_head[BLOCK_TO_BB (bbi) + 1] - 1;
rgn_bb_table[new_pos] != bbi;
- new_pos--);
+ new_pos--)
+ ;
new_pos++;
gcc_assert (new_pos > ebb_head[BLOCK_TO_BB (bbi)]);
