From e28d0cfbfb126fd6d89fbc7459c9d94c89554f55 Mon Sep 17 00:00:00 2001
From: Kazu Hirata <kazu@cs.umass.edu>
Date: Sat, 13 Nov 2004 20:48:45 +0000
Subject: [PATCH] bitmap.c, [...]: Fix comment formatting.
* bitmap.c, bitmap.h, expmed.c, tree-cfg.c: Fix comment
formatting.
From-SVN: r90595
---
gcc/ChangeLog | 5 +++++
gcc/bitmap.c | 4 ++--
gcc/bitmap.h | 2 +-
gcc/expmed.c | 2 +-
gcc/tree-cfg.c | 6 +++---
5 files changed, 12 insertions(+), 7 deletions(-)
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index a45273957746..481d95261f3d 100644
--- 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 a067984457ec..6ab194f15488 100644
--- a/gcc/bitmap.c
+++ b/gcc/bitmap.c
@@ -496,7 +496,7 @@ bitmap_first_set_bit (bitmap a)
}
-/* 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 8732c3451aa6..fb466dcae9eb 100644
--- 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 191df7254760..d9a400103a81 100644
--- 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 049da477da71..9136efee7bab 100644
--- 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;
--
GitLab