dwarf2out.c, [...]: Fix comment typos.

	* dwarf2out.c, fold-const.c, ipa-type-escape.c,
	loop-invariant.c, predict.c, predict.def, reload1.c, reorg.c,
	tree-sra.c, config/arm/arm.c, config/crx/crx.c,
	config/i386/i386.c, config/mips/mips.h,
	config/rs6000/rs6000.h, config/sh/sh.c,
	config/stormy16/stormy16.c: Fix comment typos.

From-SVN: r102620

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index d010f6b1aec8d7ad5f0913377a0038831e4a2fdc..bc0f2930bc2709e109ca4f9b259e49ed1d90c84a 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,12 @@
+2005-08-01  Kazu Hirata  <kazu@codesourcery.com>
+
+       * dwarf2out.c, fold-const.c, ipa-type-escape.c,
+       loop-invariant.c, predict.c, predict.def, reload1.c, reorg.c,
+       tree-sra.c, config/arm/arm.c, config/crx/crx.c,
+       config/i386/i386.c, config/mips/mips.h,
+       config/rs6000/rs6000.h, config/sh/sh.c,
+       config/stormy16/stormy16.c: Fix comment typos.
+
 2005-08-01  Joseph S. Myers  <joseph@codesourcery.com>
 
        PR c/22311

diff --git a/gcc/config/arm/arm.c b/gcc/config/arm/arm.c
index cb4ed75b3fbad4e46e254a818611a95611ffe3f4..289fb00159a76ea6dff1e9728c5c1dcc19fe5495 100644 (file)
--- a/gcc/config/arm/arm.c
+++ b/gcc/config/arm/arm.c
@@ -14738,7 +14738,7 @@ arm_unwind_emit_stm (FILE * asm_out_file, rtx p)
   if (reg < 16)
     {
       /* The function prologue may also push pc, but not annotate it as it is
-        never restored.  We turn this into an stack pointer adjustment.  */
+        never restored.  We turn this into a stack pointer adjustment.  */
       if (nregs * 4 == offset - 4)
        {
          fprintf (asm_out_file, "\t.pad #4\n");

diff --git a/gcc/config/crx/crx.c b/gcc/config/crx/crx.c
index 32b147d19ee189740a79d11b74358d5ffb6dc703..8eb4d0dcbbac985e1dac2d75e092304e78846be3 100644 (file)
--- a/gcc/config/crx/crx.c
+++ b/gcc/config/crx/crx.c
@@ -80,7 +80,7 @@
   ((GET_CODE(X) == CONST_INT                           \
     && SIGNED_INT_FITS_N_BITS(INTVAL(X),n)) ? 1 : 0)
 
-/* Nonzero if the rtx X is a unsigned const int of n bits */
+/* Nonzero if the rtx X is an unsigned const int of n bits.  */
 #define RTX_UNSIGNED_INT_FITS_N_BITS(X,n)              \
   ((GET_CODE(X) == CONST_INT                           \
     && UNSIGNED_INT_FITS_N_BITS(INTVAL(X),n)) ? 1 : 0)

diff --git a/gcc/config/i386/i386.c b/gcc/config/i386/i386.c
index 94648b1d38f2d4e6158c1d3955fac7393b9d7843..69f7bdf8e8c46c433035eed2bf79ae3d0a52f887 100644 (file)
--- a/gcc/config/i386/i386.c
+++ b/gcc/config/i386/i386.c
@@ -1791,7 +1791,7 @@ x86_64_elf_unique_section (tree decl, int reloc)
 /* This says how to output assembler code to declare an
    uninitialized external linkage data object.
 
-   For medim model x86-64 we need to use .largecomm opcode for
+   For medium model x86-64 we need to use .largecomm opcode for
    large objects.  */
 void
 x86_elf_aligned_common (FILE *file,
@@ -5789,7 +5789,7 @@ legitimate_address_p (enum machine_mode mode, rtx addr, int strict)
   return FALSE;
 }
 \f
-/* Return an unique alias set for the GOT.  */
+/* Return a unique alias set for the GOT.  */
 
 static HOST_WIDE_INT
 ix86_GOT_alias_set (void)

diff --git a/gcc/config/mips/mips.h b/gcc/config/mips/mips.h
index b68075a4fe08b17264ce0418bbf6c6c6230aae06..76f81dee36985dba146cf2832712199f3f27940a 100644 (file)
--- a/gcc/config/mips/mips.h
+++ b/gcc/config/mips/mips.h
@@ -1663,7 +1663,7 @@ extern enum reg_class mips_char_to_class[256];
 
 #define REG_CLASS_FROM_LETTER(C) mips_char_to_class[(unsigned char)(C)]
 
-/* True if VALUE is a unsigned 6-bit number.  */
+/* True if VALUE is an unsigned 6-bit number.  */
 
 #define UIMM6_OPERAND(VALUE) \
   (((VALUE) & ~(unsigned HOST_WIDE_INT) 0x3f) == 0)

diff --git a/gcc/config/rs6000/rs6000.h b/gcc/config/rs6000/rs6000.h
index b5e1286e51b2c617e0c5e6968dab68e9548342d3..01f091d366104bf264784866df0d597b82e4e045 100644 (file)
--- a/gcc/config/rs6000/rs6000.h
+++ b/gcc/config/rs6000/rs6000.h
@@ -1109,7 +1109,7 @@ enum reg_class
    'T' is a constant that can be placed into a 32-bit mask operand
    'U' is for V.4 small data references.
    'W' is a vector constant that can be easily generated (no mem refs).
-   'Y' is a indexed or word-aligned displacement memory operand.
+   'Y' is an indexed or word-aligned displacement memory operand.
    'Z' is an indexed or indirect memory operand.
    't' is for AND masks that can be performed by two rldic{l,r} insns.  */
 

diff --git a/gcc/config/sh/sh.c b/gcc/config/sh/sh.c
index c773f4edaeaf27a1bf4bb2852b6141c1e2651fb8..fbf8e01e8852fa29e1c864bd36106430a613d0af 100644 (file)
--- a/gcc/config/sh/sh.c
+++ b/gcc/config/sh/sh.c
@@ -1755,7 +1755,7 @@ unspec_caller_rtx_p (rtx pat)
 }
 
 /* Indicate that INSN cannot be duplicated.  This is true for insn
-   that generates an unique label.  */
+   that generates a unique label.  */
 
 static bool
 sh_cannot_copy_insn_p (rtx insn)

diff --git a/gcc/config/stormy16/stormy16.c b/gcc/config/stormy16/stormy16.c
index 8cb738549fe8041b9b7f52f5241fdfa27759291e..8a7c8d724c4d88ad3c17b2855efa41f7da17a60c 100644 (file)
--- a/gcc/config/stormy16/stormy16.c
+++ b/gcc/config/stormy16/stormy16.c
@@ -2479,7 +2479,7 @@ combine_bnp (rtx insn)
 
   if (need_extend)
     {
-      /* LT and GE conditionals should have an sign extend before
+      /* LT and GE conditionals should have a sign extend before
         them.  */
       for (and = prev_real_insn (insn); and; and = prev_real_insn (and))
        {

diff --git a/gcc/dwarf2out.c b/gcc/dwarf2out.c
index 970cbb5a82d8a0dd97f86d7ee3f1dd65228a4c5b..be2f55764abc340d4eb60bd4cb518dcc51c1afea 100644 (file)
--- a/gcc/dwarf2out.c
+++ b/gcc/dwarf2out.c
@@ -13078,7 +13078,7 @@ dwarf2out_decl (tree decl)
         declarations.  We have to check DECL_INITIAL instead. That's because
         the C front-end supports some weird semantics for "extern inline"
         function definitions.  These can get inlined within the current
-        translation unit (an thus, we need to generate Dwarf info for their
+        translation unit (and thus, we need to generate Dwarf info for their
         abstract instances so that the Dwarf info for the concrete inlined
         instances can have something to refer to) but the compiler never
         generates any out-of-lines instances of such things (despite the fact

diff --git a/gcc/fold-const.c b/gcc/fold-const.c
index d27eeb0f9f132fc564e64d59a9d1b90d7fb0a039..c74f8910374a97a3388d622cdf70210a8fcfd554 100644 (file)
--- a/gcc/fold-const.c
+++ b/gcc/fold-const.c
@@ -2029,7 +2029,7 @@ fold_convert (tree type, tree arg)
     }
 }
 \f
-/* Return false if expr can be assumed not to be an value, true
+/* Return false if expr can be assumed not to be an lvalue, true
    otherwise.  */
 
 static bool

diff --git a/gcc/ipa-type-escape.c b/gcc/ipa-type-escape.c
index 19a2a1e08b59bf8793d64d8eb10477c56d1f761a..e369d313dacd60cb9bdce0daf528c5ba4714b6ff 100644 (file)
--- a/gcc/ipa-type-escape.c
+++ b/gcc/ipa-type-escape.c
@@ -1622,7 +1622,7 @@ close_type_full_escape (tree type)
 }
 
 /* Transitively close the addressof bitmap for the type with UID.
-   This means that if we had a.b and b.c, a would have both b an c in
+   This means that if we had a.b and b.c, a would have both b and c in
    its maps.  */ 
 
 static bitmap

diff --git a/gcc/loop-invariant.c b/gcc/loop-invariant.c
index 8a09ff969449463514940431264bd7c2ff089475..7765a0eda3572c5a8e7d1f0acccc18eaeba06605 100644 (file)
--- a/gcc/loop-invariant.c
+++ b/gcc/loop-invariant.c
@@ -470,7 +470,7 @@ find_invariant_insn (rtx insn, bool always_reached, bool always_executed,
   create_new_invariant (def, insn, depends_on, always_executed);
 }
 
-/* Record registers used in INSN that have an unique invariant definition.
+/* Record registers used in INSN that have a unique invariant definition.
    DF is the dataflow object.  */
 
 static void

diff --git a/gcc/predict.c b/gcc/predict.c
index 9fc8f4501cc6cd56c4571ec2b44b0bd78c22dbac..412af8616e73c5ff5e55b90b851cd7741e408ca1 100644 (file)
--- a/gcc/predict.c
+++ b/gcc/predict.c
@@ -1557,11 +1557,11 @@ typedef struct block_info_def
 /* Similar information for edges.  */
 typedef struct edge_info_def
 {
-  /* In case edge is an loopback edge, the probability edge will be reached
+  /* In case edge is a loopback edge, the probability edge will be reached
      in case header is.  Estimated number of iterations of the loop can be
      then computed as 1 / (1 - back_edge_prob).  */
   sreal back_edge_prob;
-  /* True if the edge is an loopback edge in the natural loop.  */
+  /* True if the edge is a loopback edge in the natural loop.  */
   unsigned int back_edge:1;
 } *edge_info;
 

diff --git a/gcc/predict.def b/gcc/predict.def
index a6fcb730ef3d971a84ec13a1806deb0337c14570..997f4d2cc987a765c665f4d8839fe86edaeb761c 100644 (file)
--- a/gcc/predict.def
+++ b/gcc/predict.def
@@ -41,7 +41,7 @@ DEF_PREDICTOR (PRED_COMBINED, "combined", PROB_ALWAYS, 0)
 /* An outcome estimated by Dempster-Shaffer theory.  */
 DEF_PREDICTOR (PRED_DS_THEORY, "DS theory", PROB_ALWAYS, 0)
 
-/* An combined heuristics using probability determined by first
+/* A combined heuristics using probability determined by first
    matching heuristics from this list.  */
 DEF_PREDICTOR (PRED_FIRST_MATCH, "first match", PROB_ALWAYS, 0)
 

diff --git a/gcc/reload1.c b/gcc/reload1.c
index 708db0b548894c42e003c963f16130e3f6675269..08e939bba901c40941461b87f3ddaf6f00df1b30 100644 (file)
--- a/gcc/reload1.c
+++ b/gcc/reload1.c
@@ -1042,7 +1042,7 @@ reload (rtx first, int global)
              /* If we already deleted the insn or if it may trap, we can't
                 delete it.  The latter case shouldn't happen, but can
                 if an insn has a variable address, gets a REG_EH_REGION
-                note added to it, and then gets converted into an load
+                note added to it, and then gets converted into a load
                 from a constant address.  */
              if (NOTE_P (equiv_insn)
                  || can_throw_internal (equiv_insn))

diff --git a/gcc/reorg.c b/gcc/reorg.c
index c32d9bc0f939d12fa40af95d54a8b3ded3d79685..cda716887d66257d31d1b8059516097e760f0501 100644 (file)
--- a/gcc/reorg.c
+++ b/gcc/reorg.c
@@ -1934,7 +1934,7 @@ reorg_redirect_jump (rtx jump, rtx nlabel)
    that reference values used in INSN.  If we find one, then we move the
    REG_DEAD note to INSN.
 
-   This is needed to handle the case where an later insn (after INSN) has a
+   This is needed to handle the case where a later insn (after INSN) has a
    REG_DEAD note for a register used by INSN, and this later insn subsequently
    gets moved before a CODE_LABEL because it is a redundant insn.  In this
    case, mark_target_live_regs may be confused into thinking the register

diff --git a/gcc/tree-sra.c b/gcc/tree-sra.c
index 0d839d8cbb7a007b0157ec67b8188f3399b4efba..337b79777162c164e4240997a1325494e79f0d97 100644 (file)
--- a/gcc/tree-sra.c
+++ b/gcc/tree-sra.c
@@ -724,7 +724,7 @@ sra_walk_expr (tree *expr_p, block_stmt_iterator *bsi, bool is_output,
        goto use_all;
 
       case ARRAY_RANGE_REF:
-       /* Similarly, an subrange reference is used to modify indexing.  Which
+       /* Similarly, a subrange reference is used to modify indexing.  Which
           means that the canonical element names that we have won't work.  */
        goto use_all;