diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index cf3ba5e7453afe97c8abf2e92b179e4321fee79a..29ca30140e9cb70732089c5b4eb5add044bef465 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,18 @@
+2001-08-17 Kazu Hirata <kazu@hxi.com>
+
+ * sbitmap.c: Fix comment formatting.
+ * sched-deps.c: Likewise.
+ * sibcall.c: Likewise.
+ * simplify-rtx.c: Likewise.
+ * ssa.c: Likewise.
+ * ssa-ccp.c: Likewise.
+ * stor-layout.c: Likewise.
+ * timevar.c: Likewise.
+ * toplev.c: Likewise.
+ * unwind-dw2.c: Likewise.
+ * unwind-dw2-fde.c: Likewise.
+ * varasm.c: Likewise.
+
2001-08-17 John David Anglin <dave@hiauly1.hia.nrc.ca>
* pa.h (RETURN_IN_MEMORY): Return types with a size that is varable
diff --git a/gcc/sbitmap.c b/gcc/sbitmap.c
index 5490a6321d18f9316ae327b7902fcae4b31bde57..ef9fcd1e7aebcdd4a5102d9f50ee92b0ccb4edf5 100644
--- a/gcc/sbitmap.c
+++ b/gcc/sbitmap.c
@@ -99,7 +99,7 @@ sbitmap_copy (dst, src)
memcpy (dst->elms, src->elms, sizeof (SBITMAP_ELT_TYPE) * dst->size);
}
-/* Determine if a == b. */
+/* Determine if a == b. */
int
sbitmap_equal (a, b)
sbitmap a, b;
@@ -238,7 +238,7 @@ sbitmap_a_and_b (dst, a, b)
}
/* Set DST to be (A xor B)).
- Return non-zero if any change is made. */
+ Return non-zero if any change is made. */
int
sbitmap_a_xor_b (dst, a, b)
diff --git a/gcc/sched-deps.c b/gcc/sched-deps.c
index 3662b7a7ec441d6e503c0c370b2225e0586422be..d7cb5490c27ab702b5ee45cecdf141812b0a04f0 100644
--- a/gcc/sched-deps.c
+++ b/gcc/sched-deps.c
@@ -63,7 +63,7 @@ static int reg_pending_sets_all;
Each insn has associated bitmaps for its dependencies. Each bitmap
has enough entries to represent a dependency on any other insn in
the insn chain. All bitmap for true dependencies cache is
- allocated then the rest two ones are also allocated. */
+ allocated then the rest two ones are also allocated. */
static sbitmap *true_dependency_cache;
static sbitmap *anti_dependency_cache;
static sbitmap *output_dependency_cache;
@@ -71,7 +71,7 @@ static sbitmap *output_dependency_cache;
/* To speed up checking consistency of formed forward insn
dependencies we use the following cache. Another possible solution
could be switching off checking duplication of insns in forward
- dependencies. */
+ dependencies. */
#ifdef ENABLE_CHECKING
static sbitmap *forward_dependency_cache;
#endif
@@ -299,7 +299,7 @@ add_dependence (insn, elem, dep_type)
{
#ifdef INSN_SCHEDULING
/* Clear corresponding cache entry because type of the link
- may be changed. */
+ may be changed. */
if (true_dependency_cache != NULL)
{
if (REG_NOTE_KIND (link) == REG_DEP_ANTI)
@@ -321,7 +321,7 @@ add_dependence (insn, elem, dep_type)
#ifdef INSN_SCHEDULING
/* If we are adding a dependency to INSN's LOG_LINKs, then
- note that in the bitmap caches of dependency information. */
+ note that in the bitmap caches of dependency information. */
if (true_dependency_cache != NULL)
{
if ((int)REG_NOTE_KIND (link) == 0)
@@ -347,7 +347,7 @@ add_dependence (insn, elem, dep_type)
#ifdef INSN_SCHEDULING
/* If we are adding a dependency to INSN's LOG_LINKs, then note that
- in the bitmap caches of dependency information. */
+ in the bitmap caches of dependency information. */
if (true_dependency_cache != NULL)
{
if ((int)dep_type == 0)
diff --git a/gcc/sibcall.c b/gcc/sibcall.c
index 91cc7485831ffe052acd81e082f3a4bacccbc56c..a6638b7d2597d256e198155ea09682ead63ac134 100644
--- a/gcc/sibcall.c
+++ b/gcc/sibcall.c
@@ -408,7 +408,7 @@ uses_addressof (x)
if (code == MEM)
return 0;
- /* Scan all subexpressions. */
+ /* Scan all subexpressions. */
fmt = GET_RTX_FORMAT (code);
for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
{
@@ -518,7 +518,7 @@ purge_mem_unchanging_flag (x)
return;
}
- /* Scan all subexpressions. */
+ /* Scan all subexpressions. */
fmt = GET_RTX_FORMAT (code);
for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
{
@@ -553,7 +553,7 @@ replace_call_placeholder (insn, use)
if (XEXP (PATTERN (insn), 3))
LABEL_PRESERVE_P (XEXP (PATTERN (insn), 3)) = 0;
- /* "Delete" the placeholder insn. */
+ /* "Delete" the placeholder insn. */
PUT_CODE (insn, NOTE);
NOTE_SOURCE_FILE (insn) = 0;
NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
@@ -703,7 +703,7 @@ optimize_sibling_and_tail_recursive_calls ()
|| (call_block->succ->dest != EXIT_BLOCK_PTR
&& call_block->succ->dest != alternate_exit)
/* If this call doesn't end the block, there are operations at
- the end of the block which we must execute after returning. */
+ the end of the block which we must execute after returning. */
|| ! call_ends_block_p (insn, call_block->end))
sibcall = 0, tailrecursion = 0;
diff --git a/gcc/simplify-rtx.c b/gcc/simplify-rtx.c
index a29e4850f89c06c4c63f0999488abc3d7e2754a2..74e50c8f4cdf121e97a824d80b9ad709e01ce8ce 100644
--- a/gcc/simplify-rtx.c
+++ b/gcc/simplify-rtx.c
@@ -2415,7 +2415,7 @@ simplify_subreg (outermode, op, innermode, byte)
/* The SUBREG_BYTE represents offset, as if the value were stored
in memory. Irritating exception is paradoxical subreg, where
we define SUBREG_BYTE to be 0. On big endian machines, this
- value should be negative. For a moment, undo this exception. */
+ value should be negative. For a moment, undo this exception. */
if (byte == 0 && GET_MODE_SIZE (innermode) < GET_MODE_SIZE (outermode))
{
int difference = (GET_MODE_SIZE (innermode) - GET_MODE_SIZE (outermode));
@@ -2538,7 +2538,7 @@ simplify_subreg (outermode, op, innermode, byte)
res = simplify_subreg (outermode, part, GET_MODE (part), final_offset);
if (res)
return res;
- /* We can at least simplify it by referring directly to the relevent part. */
+ /* We can at least simplify it by referring directly to the relevent part. */
return gen_rtx_SUBREG (outermode, part, final_offset);
}
diff --git a/gcc/ssa-ccp.c b/gcc/ssa-ccp.c
index 1c163570e657207bfbf36623d3465205b5fe6222..0815f756f16276e18ba08b8815b3f393836eb71b 100644
--- a/gcc/ssa-ccp.c
+++ b/gcc/ssa-ccp.c
@@ -673,7 +673,7 @@ examine_flow_edges (void)
/* If we haven't looked at the next block, and it has a
single successor, add it onto the worklist. This is because
if we only have one successor, we know it gets executed,
- so we don't have to wait for cprop to tell us. */
+ so we don't have to wait for cprop to tell us. */
if (succ_edge != NULL
&& succ_edge->succ_next == NULL
&& !TEST_BIT (executable_edges,
diff --git a/gcc/ssa.c b/gcc/ssa.c
index 770ea46902c9f3d0a9f8ea1b555c079de7dda590..77357863e84953097e0a3611bc37b1e699bd353e 100644
--- a/gcc/ssa.c
+++ b/gcc/ssa.c
@@ -786,7 +786,7 @@ apply_delayed_renames (c)
if (r->prev_reg == NULL_RTX && !HARD_REGISTER_P (r->old_reg))
{
r->new_reg = r->old_reg;
- /* We want to restore RENAME_NO_RTX rather than NULL_RTX. */
+ /* We want to restore RENAME_NO_RTX rather than NULL_RTX. */
r->prev_reg = RENAME_NO_RTX;
}
else
@@ -1602,14 +1602,14 @@ make_equivalent_phi_alternatives_equivalent (bb, reg_partition)
abort ();
/* If the alternatives aren't already in the same
- class ... */
+ class ... */
if (partition_find (reg_partition, REGNO (*alt))
!= partition_find (reg_partition, REGNO (*alt2)))
{
/* ... make them so. */
if (conflicting_hard_regs_p (REGNO (*alt), REGNO (*alt2)))
/* It is illegal to unify a hard register with
- a different register. */
+ a different register. */
abort ();
partition_union (reg_partition,
@@ -1698,7 +1698,7 @@ coalesce_if_unconflicting (p, conflicts, reg1, reg2)
{
int reg;
- /* Work only on SSA registers. */
+ /* Work only on SSA registers. */
if (!CONVERT_REGISTER_TO_SSA_P (reg1) || !CONVERT_REGISTER_TO_SSA_P (reg2))
return 0;
diff --git a/gcc/stor-layout.c b/gcc/stor-layout.c
index 5431c261a85c34a73331a8b53c795876843524b3..39c30c5a9127e7f720ba41c27778f355147ee909 100644
--- a/gcc/stor-layout.c
+++ b/gcc/stor-layout.c
@@ -274,7 +274,7 @@ int_mode_for_mode (mode)
if (mode == BLKmode)
break;
- /* ... fall through ... */
+ /* ... fall through ... */
case MODE_CC:
default:
@@ -1303,11 +1303,11 @@ layout_type (type)
of the language-specific code. */
abort ();
- case BOOLEAN_TYPE: /* Used for Java, Pascal, and Chill. */
+ case BOOLEAN_TYPE: /* Used for Java, Pascal, and Chill. */
if (TYPE_PRECISION (type) == 0)
- TYPE_PRECISION (type) = 1; /* default to one byte/boolean. */
+ TYPE_PRECISION (type) = 1; /* default to one byte/boolean. */
- /* ... fall through ... */
+ /* ... fall through ... */
case INTEGER_TYPE:
case ENUMERAL_TYPE:
@@ -1525,7 +1525,7 @@ layout_type (type)
}
break;
- case SET_TYPE: /* Used by Chill and Pascal. */
+ case SET_TYPE: /* Used by Chill and Pascal. */
if (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type))) != INTEGER_CST
|| TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (type))) != INTEGER_CST)
abort();
diff --git a/gcc/timevar.c b/gcc/timevar.c
index b0e013d39fe26605e02846c630c4238aa4f7e12e..09d453d52c8e8cf87411d78092c7b48fa809fb4f 100644
--- a/gcc/timevar.c
+++ b/gcc/timevar.c
@@ -113,7 +113,7 @@ static int clocks_to_msec;
/* See timevar.h for an explanation of timing variables. */
-/* This macro evaluates to non-zero if timing variables are enabled. */
+/* This macro evaluates to non-zero if timing variables are enabled. */
#define TIMEVAR_ENABLE (time_report)
/* A timing variable. */
@@ -279,7 +279,7 @@ timevar_push (timevar)
timevar_accumulate (&stack->timevar->elapsed, &start_time, &now);
/* Reset the start time; from now on, time is attributed to
- TIMEVAR. */
+ TIMEVAR. */
start_time = now;
/* See if we have a previously-allocated stack instance. If so,
@@ -441,7 +441,7 @@ timevar_print (fp)
timevar_accumulate (&stack->timevar->elapsed, &start_time, &now);
/* Reset the start time; from now on, time is attributed to
- TIMEVAR. */
+ TIMEVAR. */
start_time = now;
fputs (_("\nExecution times (seconds)\n"), fp);
diff --git a/gcc/toplev.c b/gcc/toplev.c
index 576462647049689f8ed9c41477bc9adb981f57be..690a3bc556da7a118a83792a6acf835a23199d36 100644
--- a/gcc/toplev.c
+++ b/gcc/toplev.c
@@ -2902,7 +2902,7 @@ rest_of_compilation (decl)
if (flag_ssa_dce)
{
- /* Remove dead code. */
+ /* Remove dead code. */
timevar_push (TV_SSA_DCE);
open_dump_file (DFI_ssa_dce, decl);
diff --git a/gcc/unwind-dw2-fde.c b/gcc/unwind-dw2-fde.c
index 333daecd4515a41a8f5939037ac85bad9a7d30eb..c9ead4af7764487b8fd46c01eab6a9caa0bf8e51 100644
--- a/gcc/unwind-dw2-fde.c
+++ b/gcc/unwind-dw2-fde.c
@@ -436,11 +436,11 @@ frame_heapsort (struct object *ob, fde_compare_t fde_compare,
{
/* For a description of this algorithm, see:
Samuel P. Harbison, Guy L. Steele Jr.: C, a reference manual, 2nd ed.,
- p. 60-61. */
+ p. 60-61. */
fde ** a = erratic->array;
/* A portion of the array is called a "heap" if for all i>=0:
If i and 2i+1 are valid indices, then a[i] >= a[2i+1].
- If i and 2i+2 are valid indices, then a[i] >= a[2i+2]. */
+ If i and 2i+2 are valid indices, then a[i] >= a[2i+2]. */
#define SWAP(x,y) do { fde * tmp = x; x = y; y = tmp; } while (0)
size_t n = erratic->count;
size_t m = n;
@@ -448,7 +448,7 @@ frame_heapsort (struct object *ob, fde_compare_t fde_compare,
while (m > 0)
{
- /* Invariant: a[m..n-1] is a heap. */
+ /* Invariant: a[m..n-1] is a heap. */
m--;
for (i = m; 2*i+1 < n; )
{
@@ -470,7 +470,7 @@ frame_heapsort (struct object *ob, fde_compare_t fde_compare,
}
while (n > 1)
{
- /* Invariant: a[0..n-1] is a heap. */
+ /* Invariant: a[0..n-1] is a heap. */
n--;
SWAP (a[0], a[n]);
for (i = 0; 2*i+1 < n; )
@@ -494,7 +494,7 @@ frame_heapsort (struct object *ob, fde_compare_t fde_compare,
#undef SWAP
}
-/* Merge V1 and V2, both sorted, and put the result into V1. */
+/* Merge V1 and V2, both sorted, and put the result into V1. */
static inline void
fde_merge (struct object *ob, fde_compare_t fde_compare,
struct fde_vector *v1, struct fde_vector *v2)
diff --git a/gcc/unwind-dw2.c b/gcc/unwind-dw2.c
index c1aa67fdb5ad2d3b8c1340f660472895b5b263c0..16f6bceb5c936e3d039a5e065192a0f5f43e3ff2 100644
--- a/gcc/unwind-dw2.c
+++ b/gcc/unwind-dw2.c
@@ -291,7 +291,7 @@ static _Unwind_Word
execute_stack_op (const unsigned char *op_ptr, const unsigned char *op_end,
struct _Unwind_Context *context, _Unwind_Word initial)
{
- _Unwind_Word stack[64]; /* ??? Assume this is enough. */
+ _Unwind_Word stack[64]; /* ??? Assume this is enough. */
int stack_elt;
stack[0] = initial;
diff --git a/gcc/varasm.c b/gcc/varasm.c
index c3a6322c8df1be61fc374a9a0716ddef6618226e..8b340624b8efc4c20f26696b42e08553e8df1888 100644
--- a/gcc/varasm.c
+++ b/gcc/varasm.c
@@ -803,7 +803,7 @@ make_decl_rtl (decl, asmspec)
"register name given for non-register variable `%s'");
/* Specifying a section attribute on a variable forces it into a
- non-.bss section, and thus it cannot be common. */
+ non-.bss section, and thus it cannot be common. */
if (TREE_CODE (decl) == VAR_DECL
&& DECL_SECTION_NAME (decl) != NULL_TREE
&& DECL_INITIAL (decl) == NULL_TREE
@@ -1754,7 +1754,7 @@ assemble_static_space (size)
{
/* Round size up to multiple of BIGGEST_ALIGNMENT bits
so that each uninitialized object starts on such a boundary. */
- /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
+ /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
int rounded ATTRIBUTE_UNUSED
= ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
/ (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
@@ -2473,7 +2473,7 @@ const_hash (exp)
return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
default:
- /* A language specific constant. Just hash the code. */
+ /* A language specific constant. Just hash the code. */
return (int) code % MAX_HASH_TABLE;
}
@@ -4466,7 +4466,7 @@ output_constructor (exp, size)
There is always a maximum of one element in the chain LINK for unions
(even if the initializer in a source program incorrectly contains
- more one). */
+ more one). */
for (link = CONSTRUCTOR_ELTS (exp);
link;
link = TREE_CHAIN (link),