bitmap.c, [...]: Fix comment formatting.

	* bitmap.c, bitmap.h, expmed.c, tree-cfg.c: Fix comment
	formatting.

From-SVN: r90595

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index a4527395774616572d15f49876066b57e1db0776..481d95261f3dd8c7b384f1475c799aa13c322b1e 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2004-11-13  Kazu Hirata  <kazu@cs.umass.edu>
+
+       * bitmap.c, bitmap.h, expmed.c, tree-cfg.c: Fix comment
+       formatting.
+
 2004-11-13  Kelley Cook  <kcook@gcc.gnu.org>
 
        * doc/install.texi (automake): Correctly document that everything now 

diff --git a/gcc/bitmap.c b/gcc/bitmap.c
index a067984457ec7c6920171295bc795e940a349c6b..6ab194f154889d77c1d8b670db71e0f6b195fad9 100644 (file)
--- a/gcc/bitmap.c
+++ b/gcc/bitmap.c
@@ -496,7 +496,7 @@ bitmap_first_set_bit (bitmap a)
 }
 \f
 
-/* DST = A & B. */
+/* DST = A & B.  */
 
 void
 bitmap_and (bitmap dst, bitmap a, bitmap b)
@@ -606,7 +606,7 @@ bitmap_and_compl (bitmap dst, bitmap a, bitmap b)
     {
       if (!b_elt || a_elt->indx < b_elt->indx)
        {
-         /* Copy a_elt. */
+         /* Copy a_elt.  */
          if (!dst_elt)
            dst_elt = bitmap_elt_insert_after (dst, dst_prev);
          

diff --git a/gcc/bitmap.h b/gcc/bitmap.h
index 8732c3451aa6b0c5839b4b665c9d5f8e9ef33c65..fb466dcae9eb015533542b5426574d4ab5055139 100644 (file)
--- a/gcc/bitmap.h
+++ b/gcc/bitmap.h
@@ -266,7 +266,7 @@ bmp_iter_and_init (bitmap_iterator *bi, bitmap map1, bitmap map2,
       bi->elt2 = bi->elt2->next;
     }
 
-  /* If we're at the same index, then we have some intersecting bits.   */
+  /* If we're at the same index, then we have some intersecting bits.  */
   if (bi->elt1->indx == bi->elt2->indx)
     {
       /* We might have advanced beyond the start_bit, so reinitialize

diff --git a/gcc/expmed.c b/gcc/expmed.c
index 191df7254760095a91337a88c568ce74b9483913..d9a400103a814568b5519edaf3cdec54507c1efd 100644 (file)
--- a/gcc/expmed.c
+++ b/gcc/expmed.c
@@ -1870,7 +1870,7 @@ extract_force_align_mem_bit_field (rtx op0, unsigned HOST_WIDE_INT bitsize,
   unsigned int sign_shift_up, sign_shift_dn;
   rtx base, a1, a2, v1, v2, comb, shift, result, start;
 
-  /* Choose a mode that will fit BITSIZE.    */
+  /* Choose a mode that will fit BITSIZE.  */
   mode = smallest_mode_for_size (bitsize, MODE_INT);
   m_size = GET_MODE_SIZE (mode);
   m_bitsize = GET_MODE_BITSIZE (mode);

diff --git a/gcc/tree-cfg.c b/gcc/tree-cfg.c
index 049da477da718a053fdc644a1f66ad14c876459f..9136efee7bab4a521eb9d843c14ebbef2c24017e 100644 (file)
--- a/gcc/tree-cfg.c
+++ b/gcc/tree-cfg.c
@@ -2934,7 +2934,7 @@ tree_find_edge_insert_loc (edge e, block_stmt_iterator *bsi,
 
      The requirement for no PHI nodes could be relaxed.  Basically we
      would have to examine the PHIs to prove that none of them used
-     the value set by the statement we want to insert on E.   That
+     the value set by the statement we want to insert on E.  That
      hardly seems worth the effort.  */
   if (EDGE_COUNT (dest->preds) == 1
       && ! phi_nodes (dest)
@@ -4297,12 +4297,12 @@ tree_redirect_edge_and_branch (edge e, basic_block dest)
 
           There is precisely one CASE_LABEL_EXPR in the switch vector
           which needs updating.  Either its label needs to be updated
-          or it needs to be directed to a new case leader.   */
+          or it needs to be directed to a new case leader.  */
        e2 = find_edge (e->src, dest);
        if (e2)
          {
            /* In this case we need to change the case leader for the
-              current leader of E to be the case leader for E2.   */
+              current leader of E to be the case leader for E2.  */
            tree e_leader = get_case_leader_for_edge (e);
            tree e2_leader = get_case_leader_for_edge (e2);
            CASE_LEADER_OR_LABEL (e_leader) = e2_leader;