cse.c (insert_with_costs): Put semi-colon after empty loop body on the next line.

	* 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.

From-SVN: r176216

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index f820c2d1e6578c5354713e43c577c871ade391e5..c21c70ba76180b4da3313092882f549dead4a936 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,16 @@
+2011-07-12  Eric Botcazou  <ebotcazou@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.
+
 2011-07-12  Uros Bizjak  <ubizjak@gmail.com>
 
        * config/i386/i386.c: Tidy processor feature bitmasks.

diff --git a/gcc/c-family/ChangeLog b/gcc/c-family/ChangeLog
index 87930c21fcf7b811c6e95105ae210fbd0ed0d4f0..38149c8c6dd341f62e1cb0d1b14882045f579669 100644 (file)
--- a/gcc/c-family/ChangeLog
+++ b/gcc/c-family/ChangeLog
@@ -1,3 +1,8 @@
+2011-07-12  Eric Botcazou  <ebotcazou@adacore.com>
+
+       * c-ada-spec.c (dump_nested_types): Put semi-colon after empty loop
+       body on the next line.
+
 2011-07-08  Jason Merrill  <jason@redhat.com>
 
        PR c++/45437

diff --git a/gcc/c-family/c-ada-spec.c b/gcc/c-family/c-ada-spec.c
index f582e7dfb0e391b534fc6215b1200292208a4504..c6666675ccc0b04eb101c677a4c97527312121ff 100644 (file)
--- a/gcc/c-family/c-ada-spec.c
+++ b/gcc/c-family/c-ada-spec.c
@@ -2333,7 +2333,8 @@ dump_nested_types (pretty_printer *buffer, tree t, tree parent, bool forward,
                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);
 

diff --git a/gcc/cse.c b/gcc/cse.c
index a078329ac553c18c232a8af5c49ea3bf308fdc41..54edf7ee94202345ef679ce60ec386eeca9638af 100644 (file)
--- a/gcc/cse.c
+++ b/gcc/cse.c
@@ -1637,8 +1637,10 @@ insert_with_costs (rtx x, struct table_elt *classp, unsigned int hash,
          /* 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;

diff --git a/gcc/emit-rtl.c b/gcc/emit-rtl.c
index c641b7e6ca220b543bf6baf6d910871c29a8d6f0..e4049b99184c9bdbd62432ed8eb709de2eb32504 100644 (file)
--- a/gcc/emit-rtl.c
+++ b/gcc/emit-rtl.c
@@ -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);

diff --git a/gcc/haifa-sched.c b/gcc/haifa-sched.c
index 407b626d60d234ed91eb63414cb80f4a0d916aa6..f4caecd284c261a1547f344b7771a2795b7afdb5 100644 (file)
--- a/gcc/haifa-sched.c
+++ b/gcc/haifa-sched.c
@@ -2568,7 +2568,8 @@ max_issue (struct ready_list *ready, int privileged_n, state_t state,
                {
                  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...  */

diff --git a/gcc/matrix-reorg.c b/gcc/matrix-reorg.c
index dfc189632d5a0e17dc7666f926a93d07d6864cf0..fbeb16437961e1ce3f5c486c254c0d1a4de8e8f1 100644 (file)
--- a/gcc/matrix-reorg.c
+++ b/gcc/matrix-reorg.c
@@ -719,7 +719,8 @@ add_allocation_site (struct matrix_info *mi, gimple stmt, int level)
          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;

diff --git a/gcc/postreload-gcse.c b/gcc/postreload-gcse.c
index e05e4450d0e0e45dd0ab9f2bac3729f5ae149ef7..64f100697d4e17599bec7604aeb5f35437e12aad 100644 (file)
--- a/gcc/postreload-gcse.c
+++ b/gcc/postreload-gcse.c
@@ -1131,7 +1131,8 @@ eliminate_partially_redundant_load (basic_block bb, rtx insn,
      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)
     {

diff --git a/gcc/reload.c b/gcc/reload.c
index 735fa6edce4bd7784e3667c9acaac67c25c85c60..c86f69b78c0b3fae53e00684ecb9bd60eb63349e 100644 (file)
--- a/gcc/reload.c
+++ b/gcc/reload.c
@@ -4591,7 +4591,8 @@ alternative_allows_const_pool_ref (rtx mem ATTRIBUTE_UNUSED,
   /* Skip alternatives before the one requested.  */
   while (altnum > 0)
     {
-      while (*constraint++ != ',');
+      while (*constraint++ != ',')
+       ;
       altnum--;
     }
   /* Scan the requested alternative for TARGET_MEM_CONSTRAINT or 'o'.

diff --git a/gcc/sched-rgn.c b/gcc/sched-rgn.c
index e510980816e7ab3e7b6703d49fd50728983b14ac..aa9c81d981406d24b8e6ea5a07003eb30bb6ed82 100644 (file)
--- a/gcc/sched-rgn.c
+++ b/gcc/sched-rgn.c
@@ -3396,7 +3396,8 @@ rgn_add_block (basic_block bb, basic_block after)
       /* 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_bbi, int check_bb_nexti)
 
   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)]);
 

diff --git a/gcc/tree.c b/gcc/tree.c
index e9876dd81a1c3134e4f3e35d8768527146a029eb..acc3841f216c54d7831413bc9f416e4952ca4860 100644 (file)
--- a/gcc/tree.c
+++ b/gcc/tree.c
@@ -6350,7 +6350,8 @@ attribute_list_contained (const_tree l1, const_tree l2)
        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)