* auto-inc-dec.c, config/arm/arm.c,

	config/m32r/constraints.md, config/mips/mips.md,
	config/rs6000/rs6000.c, cselib.c, dce.c, df-core.c,
	df-problems.c, df-scan.c, df.h, dse.c, gimplify.c,
	tree-if-conv.c, tree-ssa-sccvn.c, tree-ssa.c: Fix comment
	typos.  Follow spelling conventions.
	* doc/invoke.texi, doc/rtl.texi: Fix typos.


git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@126439 138bc75d-0d04-0410-961f-82ee72b054a4

19 files changed, 45 insertions, 35 deletions

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 5f9ffcd87dc..81bb7475af9 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,13 @@
+2007-07-07  Kazu Hirata  <kazu@codesourcery.com>
+
+	* auto-inc-dec.c, config/arm/arm.c,
+	config/m32r/constraints.md, config/mips/mips.md,
+	config/rs6000/rs6000.c, cselib.c, dce.c, df-core.c,
+	df-problems.c, df-scan.c, df.h, dse.c, gimplify.c,
+	tree-if-conv.c, tree-ssa-sccvn.c, tree-ssa.c: Fix comment
+	typos.  Follow spelling conventions.
+	* doc/invoke.texi, doc/rtl.texi: Fix typos.
+
 2007-07-06  Daniel Berlin  <dberlin@dberlin.org>
 
 	Fix PR tree-optimization/23488
diff --git a/gcc/auto-inc-dec.c b/gcc/auto-inc-dec.c
index 6718b742c2a..bde2a75fb28 100644
--- a/gcc/auto-inc-dec.c
+++ b/gcc/auto-inc-dec.c
@@ -1276,7 +1276,7 @@ find_inc (bool first_try)
 	 next add or inc, not the next insn that used the
 	 reg.  Because we are going to increment the reg
 	 in this form, we need to make sure that there
-	 were no interveining uses of reg.  */
+	 were no intervening uses of reg.  */
       if (inc_insn.insn != other_insn)
 	return false;
     }
diff --git a/gcc/config/arm/arm.c b/gcc/config/arm/arm.c
index b03a3030437..c1f37bffa6c 100644
--- a/gcc/config/arm/arm.c
+++ b/gcc/config/arm/arm.c
@@ -5822,8 +5822,8 @@ vfp3_const_double_index (rtx x)
   gcc_assert (mantissa >= 16 && mantissa <= 31);
 
   /* The value of 5 here would be 4 if GCC used IEEE754-like encoding (where
-     normalised significands are in the range [1, 2). (Our mantissa is shifted
-     left 4 places at this point relative to normalised IEEE754 values).  GCC
+     normalized significands are in the range [1, 2). (Our mantissa is shifted
+     left 4 places at this point relative to normalized IEEE754 values).  GCC
      internally uses [0.5, 1) (see real.c), so the exponent returned from
      REAL_EXP must be altered.  */
   exponent = 5 - exponent;
diff --git a/gcc/config/m32r/constraints.md b/gcc/config/m32r/constraints.md
index c9563fa5ded..6d8161f1e6b 100644
--- a/gcc/config/m32r/constraints.md
+++ b/gcc/config/m32r/constraints.md
@@ -104,13 +104,13 @@
 
 ;; Extra constraints
 (define_constraint "Q"
-  "A symbolic addresse loadable when ld24."
+  "A symbolic address loadable when ld24."
   (ior (and (match_test "TARGET_ADDR24")
 	    (match_test "GET_CODE (op) == LABEL_REF"))
        (match_test "addr24_operand (op, VOIDmode)")))
 
 (define_constraint "R"
-  "A symbolic addresse loadable with ld24 can't be used."
+  "A symbolic address loadable with ld24 can't be used."
   (ior (and (match_test "TARGET_ADDR32")
 	    (match_test "GET_CODE (op) == LABEL_REF"))
        (match_test "addr32_operand (op, VOIDmode)")))
diff --git a/gcc/config/mips/mips.md b/gcc/config/mips/mips.md
index 2b7a2d2368f..255d6e65c90 100644
--- a/gcc/config/mips/mips.md
+++ b/gcc/config/mips/mips.md
@@ -256,7 +256,7 @@
 ;; logical      integer logical instructions
 ;; shift	integer shift instructions
 ;; slt		set less than instructions
-;; signext      sign extend instuctions
+;; signext      sign extend instructions
 ;; clz		the clz and clo instructions
 ;; trap		trap if instructions
 ;; imul		integer multiply 2 operands
diff --git a/gcc/config/rs6000/rs6000.c b/gcc/config/rs6000/rs6000.c
index f54a216c0ee..09c21ebf76d 100644
--- a/gcc/config/rs6000/rs6000.c
+++ b/gcc/config/rs6000/rs6000.c
@@ -15629,7 +15629,7 @@ rs6000_emit_epilogue (int sibcall)
       else
         {
           /* Make r11 point to the start of the SPE save area.  We worried about
-             not clobbering it when we were saving registers in the prolgoue.
+             not clobbering it when we were saving registers in the prologue.
              There's no need to worry here because the static chain is passed
              anew to every function.  */
           spe_save_area_ptr = gen_rtx_REG (Pmode, 11);
diff --git a/gcc/cselib.c b/gcc/cselib.c
index 6114091a489..3528efb7e0e 100644
--- a/gcc/cselib.c
+++ b/gcc/cselib.c
@@ -948,7 +948,7 @@ cselib_expand_value_rtx (rtx orig, bitmap regs_active, int max_depth)
 	      int regno = REGNO (orig);
 	      
 	      /* The only thing that we are not willing to do (this
-		 is requirement of dse and if others potiential uses
+		 is requirement of dse and if others potential uses
 		 need this function we should add a parm to control
 		 it) is that we will not substitute the
 		 STACK_POINTER_REGNUM, FRAME_POINTER or the
diff --git a/gcc/dce.c b/gcc/dce.c
index 2e8b77ab33e..71823be10cf 100644
--- a/gcc/dce.c
+++ b/gcc/dce.c
@@ -398,7 +398,7 @@ prescan_insns_for_dce (bool fast)
 
 /* UD-based DSE routines. */
 
-/* Mark instructions that define artifically-used registers, such as
+/* Mark instructions that define artificially-used registers, such as
    the frame pointer and the stack pointer.  */
 
 static void
diff --git a/gcc/df-core.c b/gcc/df-core.c
index deca8758530..4418d2c363d 100644
--- a/gcc/df-core.c
+++ b/gcc/df-core.c
@@ -207,7 +207,7 @@ There are four ways of doing the incremental scanning:
    insns when only a small number of them have really changed.
 
 4) Do it yourself - In this mechanism, the pass updates the insns
-   itself using the low level df primatives.  Currently no pass does
+   itself using the low level df primitives.  Currently no pass does
    this, but it has the advantage that it is quite efficient given
    that the pass generally has exact knowledge of what it is changing.  
 
@@ -1502,7 +1502,7 @@ df_bb_delete (int bb_index)
 /* Verify that there is a place for everything and everything is in
    its place.  This is too expensive to run after every pass in the
    mainline.  However this is an excellent debugging tool if the
-   dataflow infomation is not being updated properly.  You can just
+   dataflow information is not being updated properly.  You can just
    sprinkle calls in until you find the place that is changing an
    underlying structure without calling the proper updating
    routine.  */
diff --git a/gcc/df-problems.c b/gcc/df-problems.c
index f286f4fbefe..010ff27d61a 100644
--- a/gcc/df-problems.c
+++ b/gcc/df-problems.c
@@ -713,7 +713,7 @@ static struct df_problem problem_RU =
   df_ru_top_dump,             /* Debugging start block.  */
   df_ru_bottom_dump,          /* Debugging end block.  */
   NULL,                       /* Incremental solution verify start.  */
-  NULL,                       /* Incremental solution verfiy end.  */
+  NULL,                       /* Incremental solution verify end.  */
   NULL,                       /* Dependent problem.  */
   TV_DF_RU,                   /* Timing variable.  */
   true                        /* Reset blocks on dropping out of blocks_to_analyze.  */
@@ -1211,7 +1211,7 @@ static struct df_problem problem_RD =
   df_rd_top_dump,             /* Debugging start block.  */
   df_rd_bottom_dump,          /* Debugging end block.  */
   NULL,                       /* Incremental solution verify start.  */
-  NULL,                       /* Incremental solution verfiy end.  */
+  NULL,                       /* Incremental solution verify end.  */
   NULL,                       /* Dependent problem.  */
   TV_DF_RD,                   /* Timing variable.  */ 
   true                        /* Reset blocks on dropping out of blocks_to_analyze.  */
@@ -3072,7 +3072,7 @@ static struct df_problem problem_UREC =
   df_urec_top_dump,           /* Debugging start block.  */
   df_urec_bottom_dump,        /* Debugging end block.  */
   NULL,                       /* Incremental solution verify start.  */
-  NULL,                       /* Incremental solution verfiy end.  */
+  NULL,                       /* Incremental solution verify end.  */
   &problem_LR,                /* Dependent problem.  */
   TV_DF_UREC,                 /* Timing variable.  */ 
   false                       /* Reset blocks on dropping out of blocks_to_analyze.  */
@@ -3553,7 +3553,7 @@ static struct df_problem problem_CHAIN =
   df_chain_top_dump,          /* Debugging start block.  */
   df_chain_bottom_dump,       /* Debugging end block.  */
   NULL,                       /* Incremental solution verify start.  */
-  NULL,                       /* Incremental solution verfiy end.  */
+  NULL,                       /* Incremental solution verify end.  */
   &problem_RD,                /* Dependent problem.  */
   TV_DF_CHAIN,                /* Timing variable.  */
   false                       /* Reset blocks on dropping out of blocks_to_analyze.  */
@@ -4138,7 +4138,7 @@ static struct df_problem problem_NOTE =
   NULL,                       /* Debugging start block.  */
   NULL,                       /* Debugging end block.  */
   NULL,                       /* Incremental solution verify start.  */
-  NULL,                       /* Incremental solution verfiy end.  */
+  NULL,                       /* Incremental solution verify end.  */
 
   /* Technically this is only dependent on the live registers problem
      but it will produce information if built one of uninitialized
diff --git a/gcc/df-scan.c b/gcc/df-scan.c
index 4a8a1be00b1..3b35928ea1a 100644
--- a/gcc/df-scan.c
+++ b/gcc/df-scan.c
@@ -433,7 +433,7 @@ static struct df_problem problem_SCAN =
   df_scan_start_block,        /* Debugging start block.  */
   NULL,                       /* Debugging end block.  */
   NULL,                       /* Incremental solution verify start.  */
-  NULL,                       /* Incremental solution verfiy end.  */
+  NULL,                       /* Incremental solution verify end.  */
   NULL,                       /* Dependent problem.  */
   TV_DF_SCAN,                 /* Timing variable.  */
   false                       /* Reset blocks on dropping out of blocks_to_analyze.  */
@@ -3432,7 +3432,7 @@ df_get_eh_block_artificial_uses (bitmap eh_block_artificial_uses)
 {
   bitmap_clear (eh_block_artificial_uses);
 
-  /* The following code (down thru the arg_pointer seting APPEARS
+  /* The following code (down thru the arg_pointer setting APPEARS
      to be necessary because there is nothing that actually
      describes what the exception handling code may actually need
      to keep alive.  */
diff --git a/gcc/df.h b/gcc/df.h
index 5c510eec6f9..7d8d767b026 100644
--- a/gcc/df.h
+++ b/gcc/df.h
@@ -530,7 +530,7 @@ struct df
      addresses.  It is incremented whenever a ref is created.  */
   unsigned int ref_order;
 
-  /* Problem specific control infomation.  */
+  /* Problem specific control information.  */
   enum df_changeable_flags changeable_flags;
 };
 
diff --git a/gcc/doc/invoke.texi b/gcc/doc/invoke.texi
index 6c5ee50ddfb..4f4d7d1f1bd 100644
--- a/gcc/doc/invoke.texi
+++ b/gcc/doc/invoke.texi
@@ -10390,7 +10390,7 @@ or @code{remainder} built-in functions: see @ref{Other Builtins} for details.
 This option will enable GCC to use RCPSS and RSQRTSS instructions (and their
 vectorized variants RCPPS and RSQRTPS) instead of DIVSS and SQRTSS (and their
 vectorized variants).  These instructions will be generated only when
-@option{-funsafe-math-optimizatons} is enabled.
+@option{-funsafe-math-optimizations} is enabled.
 
 @item -mpush-args
 @itemx -mno-push-args
diff --git a/gcc/doc/rtl.texi b/gcc/doc/rtl.texi
index fb38f7f3430..247a22e9ad3 100644
--- a/gcc/doc/rtl.texi
+++ b/gcc/doc/rtl.texi
@@ -3370,7 +3370,7 @@ A list (chain of @code{insn_list} expressions) giving information about
 dependencies between instructions within a basic block.  Neither a jump
 nor a label may come between the related insns.  These are only used by
 the schedulers and by combine.  This is a deprecated data structure.
-Def-use and use-def chains are now prefered. 
+Def-use and use-def chains are now preferred. 
 
 @findex REG_NOTES
 @item REG_NOTES (@var{i})
diff --git a/gcc/dse.c b/gcc/dse.c
index 2c27d6e8e8b..1f7588df347 100644
--- a/gcc/dse.c
+++ b/gcc/dse.c
@@ -144,7 +144,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
    ... <- A
 
    flow would replace the right hand side of the second insn with a
-   reference to r100.  Most of the infomation is available to add this
+   reference to r100.  Most of the information is available to add this
    to this pass.  It has not done it because it is a lot of work in
    the case that either r100 is assigned to between the first and
    second insn and/or the second insn is a load of part of the value
@@ -303,7 +303,7 @@ struct insn_info
      insn.  If the insn is deletable, it contains only one mem set.
      But it could also contain clobbers.  Insns that contain more than
      one mem set are not deletable, but each of those mems are here in
-     order to provied info to delete other insns.  */
+     order to provide info to delete other insns.  */
   store_info_t store_rec;
 
   /* The linked list of mem uses in this insn.  Only the reads from
@@ -403,9 +403,9 @@ struct group_info
   rtx canon_base_mem;
 
   /* These two sets of two bitmaps are used to keep track of how many
-     stores are actually referencing that postion from this base.  We
+     stores are actually referencing that position from this base.  We
      only do this for rtx bases as this will be used to assign
-     postions in the bitmaps for the global problem.  Bit N is set in
+     positions in the bitmaps for the global problem.  Bit N is set in
      store1 on the first store for offset N.  Bit N is set in store2
      for the second store to offset N.  This is all we need since we
      only care about offsets that have two or more stores for them.
@@ -420,9 +420,9 @@ struct group_info
      deleted.  */
   bitmap store1_n, store1_p, store2_n, store2_p;
 
-  /* The postions in this bitmap have the same assignments as the in,
+  /* The positions in this bitmap have the same assignments as the in,
      out, gen and kill bitmaps.  This bitmap is all zeros except for
-     the postions that are occupied by stores for this group.  */
+     the positions that are occupied by stores for this group.  */
   bitmap group_kill;
 
   /* True if there are any positions that are to be processed
@@ -434,7 +434,7 @@ struct group_info
   bool frame_related;
 
   /* The offset_map is used to map the offsets from this base into
-     postions in the global bitmaps.  It is only created after all of
+     positions in the global bitmaps.  It is only created after all of
      the all of stores have been scanned and we know which ones we
      care about.  */
   int *offset_map_n, *offset_map_p; 
@@ -1265,7 +1265,7 @@ record_store (rtx body, bb_info_t bb_info)
       bool delete = true;
 
       /* Skip the clobbers. We delete the active insn if this insn
-	 shaddows the set.  To have been put on the active list, it
+	 shadows the set.  To have been put on the active list, it
 	 has exactly on set. */
       while (!s_info->is_set)
 	s_info = s_info->next;
@@ -2017,7 +2017,7 @@ dse_step1 (void)
 
    Assign each byte position in the stores that we are going to
    analyze globally to a position in the bitmaps.  Returns true if
-   there are any bit postions assigned.
+   there are any bit positions assigned.
 ----------------------------------------------------------------------------*/
 
 static void
@@ -2837,7 +2837,7 @@ dse_step5_nospill (void)
 		}
 	    }
 	  /* We do want to process the local info if the insn was
-	     deleted.  For insntance, if the insn did a wild read, we
+	     deleted.  For instance, if the insn did a wild read, we
 	     no longer need to trash the info.  */
 	  if (insn_info->insn 
 	      && INSN_P (insn_info->insn)
diff --git a/gcc/gimplify.c b/gcc/gimplify.c
index dd3d5fa5aba..bc87f39aefb 100644
--- a/gcc/gimplify.c
+++ b/gcc/gimplify.c
@@ -2141,7 +2141,7 @@ gimplify_call_expr (tree *expr_p, tree *pre_p, bool want_value)
 	   i++, p = TREE_CHAIN (p))
 	{
 	  /* We cannot distinguish a varargs function from the case
-	     of excess parameters, still defering the inlining decision
+	     of excess parameters, still deferring the inlining decision
 	     to the callee is possible.  */
 	  if (!p)
 	    break;
diff --git a/gcc/tree-if-conv.c b/gcc/tree-if-conv.c
index bd828bcf463..c1ce57ee297 100644
--- a/gcc/tree-if-conv.c
+++ b/gcc/tree-if-conv.c
@@ -667,7 +667,7 @@ add_to_dst_predicate_list (struct loop * loop, edge e,
 
 /* During if-conversion aux field from basic block structure is used to hold
    predicate list. Clean each basic block's predicate list for the given LOOP.
-   Also clean aux field of succesor edges, used to hold true and false
+   Also clean aux field of successor edges, used to hold true and false
    condition from conditional expression.  */
 
 static void
diff --git a/gcc/tree-ssa-sccvn.c b/gcc/tree-ssa-sccvn.c
index 651f747e479..755fb1d31e8 100644
--- a/gcc/tree-ssa-sccvn.c
+++ b/gcc/tree-ssa-sccvn.c
@@ -1399,7 +1399,7 @@ simplify_binary_expression (tree rhs)
     }
   result = fold_binary (TREE_CODE (rhs), TREE_TYPE (rhs), op0, op1);
 
-  /* Make sure result is not a complex expression consiting
+  /* Make sure result is not a complex expression consisting
      of operators of operators (IE (a + b) + (a + c))
      Otherwise, we will end up with unbounded expressions if
      fold does anything at all.  */
diff --git a/gcc/tree-ssa.c b/gcc/tree-ssa.c
index 5e166525883..db16f2315d0 100644
--- a/gcc/tree-ssa.c
+++ b/gcc/tree-ssa.c
@@ -1006,7 +1006,7 @@ useless_type_conversion_p (tree outer_type, tree inner_type)
 
       /* Otherwise pointers/references are equivalent if their pointed
 	 to types are effectively the same.  We can strip qualifiers
-	 on pointed-to types for further comparsion, which is done in
+	 on pointed-to types for further comparison, which is done in
 	 the callee.  */
       return useless_type_conversion_p (TREE_TYPE (outer_type),
 				        TREE_TYPE (inner_type));