[patch] Fix comment typos.

[Kazu Hirata <kazu at cs dot umass dot edu>]

Hi,

Attached is a patch to fix comment typos.  Committed as obvious.

Kazu Hirata

2003-10-05  Kazu Hirata  <kazu@cs.umass.edu>

	* c-pretty-print.c: Fix comment typos.
	* c-pretty-print.h: Likewise.
	* calls.c: Likewise.
	* cfgloopmanip.c: Likewise.
	* cgraphunit.c: Likewise.
	* cppfiles.c: Likewise.
	* final.c: Likewise.
	* function.c: Likewise.
	* gcov-io.h: Likewise.
	* gcse.c: Likewise.
	* genoutput.c: Likewise.
	* loop.c: Likewise.
	* postreload.c: Likewise.
	* reg-stack.c: Likewise.
	* regmove.c: Likewise.
	* sched-int.h: Likewise.
	* sched-rgn.c: Likewise.
	* simplify-rtx.c: Likewise.
	* tree-inline.c: Likewise.
	* config/m68hc11/m68hc11.h: Likewise.
	* config/mmix/mmix.c: Likewise.
	* config/mn10300/mn10300.md: Likewise.
	* config/sh/sh.h: Likewise.

Index: c-pretty-print.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-pretty-print.c,v
retrieving revision 1.30
diff -u -r1.30 c-pretty-print.c
--- c-pretty-print.c	5 Oct 2003 13:09:48 -0000	1.30
+++ c-pretty-print.c	5 Oct 2003 19:41:19 -0000
@@ -538,7 +538,7 @@
       ( declarator )
       direct-declarator [ type-qualifier-list(opt) assignment-expression(opt) ]
       direct-declarator [ static type-qualifier-list(opt) assignment-expression(opt)]
-      direct-declarator [ type-qualifier-list static assignment-exression ]
+      direct-declarator [ type-qualifier-list static assignment-expression ]
       direct-declarator [ type-qualifier-list * ]
       direct-declaratpr ( parameter-type-list )
       direct-declarator ( identifier-list(opt) )  */
@@ -884,7 +884,7 @@
       integer-constant
       floating-constant
       enumeration-constant
-      chatracter-constant   */
+      character-constant   */
 
 void
 pp_c_constant (c_pretty_printer *pp, tree e)
Index: c-pretty-print.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-pretty-print.h,v
retrieving revision 1.14
diff -u -r1.14 c-pretty-print.h
--- c-pretty-print.h	18 Sep 2003 08:25:07 -0000	1.14
+++ c-pretty-print.h	5 Oct 2003 19:41:19 -0000
@@ -46,7 +46,7 @@
    language using C/c++ syntax can derive from this datatype and reuse
    facilities provided here.  It can do so by having a subobject of type
    c_pretty_printer and override the macro pp_c_base to return a pointer
-   to that subobject.  Such a pretty-printer has the responsability to
+   to that subobject.  Such a pretty-printer has the responsibility to
    initialize the pp_base() part, then call pp_c_pretty_printer_init
    to set up the components that are specific to the C pretty-printer.
    A derived pretty-printer can override any function listed in the
Index: calls.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/calls.c,v
retrieving revision 1.302
diff -u -r1.302 calls.c
--- calls.c	3 Oct 2003 17:59:37 -0000	1.302
+++ calls.c	5 Oct 2003 19:41:22 -0000
@@ -2353,7 +2353,7 @@
 
   /* Start updating where the next arg would go.
 
-     On some machines (such as the PA) indirect calls have a difuferent
+     On some machines (such as the PA) indirect calls have a different
      calling convention than normal calls.  The last argument in
      INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
      or not.  */
Index: cfgloopmanip.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cfgloopmanip.c,v
retrieving revision 1.15
diff -u -r1.15 cfgloopmanip.c
--- cfgloopmanip.c	24 Jul 2003 18:54:26 -0000	1.15
+++ cfgloopmanip.c	5 Oct 2003 19:41:22 -0000
@@ -645,7 +645,7 @@
 }
 
 /* Fix placement of LOOP inside loop tree, i.e. find the innermost superloop
-   FATHER of LOOP such that all of the edges comming out of LOOP belong to
+   FATHER of LOOP such that all of the edges coming out of LOOP belong to
    FATHER, and set it as outer loop of LOOP.  Return 1 if placement of
    LOOP changed.  */
 int
Index: cgraphunit.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cgraphunit.c,v
retrieving revision 1.33
diff -u -r1.33 cgraphunit.c
--- cgraphunit.c	26 Sep 2003 00:14:28 -0000	1.33
+++ cgraphunit.c	5 Oct 2003 19:41:23 -0000
@@ -106,7 +106,7 @@
   /* "extern inline" functions are never output locally.  */
   if (DECL_EXTERNAL (decl))
     return false;
-  /* We want to emit COMDAT functions only when absolutely neccesary.  */
+  /* We want to emit COMDAT functions only when absolutely necessary.  */
   if (DECL_COMDAT (decl))
     return false;
   if (!DECL_INLINE (decl)
@@ -166,7 +166,7 @@
 	 inlined in others.
 	 
 	 ??? It may make more sense to use one body for inlining and other
-	 body for expanding the function but this is dificult to do.  */
+	 body for expanding the function but this is difficult to do.  */
 
       /* If node->output is set, then this is a unit-at-a-time compilation
 	 and we have already begun whole-unit analysis.  This is *not*
Index: cppfiles.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cppfiles.c,v
retrieving revision 1.191
diff -u -r1.191 cppfiles.c
--- cppfiles.c	2 Oct 2003 07:23:25 -0000	1.191
+++ cppfiles.c	5 Oct 2003 19:41:24 -0000
@@ -643,7 +643,7 @@
 }
 
 /* Return the directory from which searching for FNAME should start,
-   condiering the directive TYPE and ANGLE_BRACKETS.  If there is
+   considering the directive TYPE and ANGLE_BRACKETS.  If there is
    nothing left in the path, returns NULL.  */
 static struct cpp_dir *
 search_path_head (cpp_reader *pfile, const char *fname, int angle_brackets,
Index: final.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/final.c,v
retrieving revision 1.290
diff -u -r1.290 final.c
--- final.c	4 Sep 2003 03:17:46 -0000	1.290
+++ final.c	5 Oct 2003 19:41:26 -0000
@@ -2508,7 +2508,7 @@
   extract_insn_cached (insn);
   for (i = 0; i < recog_data.n_operands; i++)
     {
-      /* The following test cannot use recog_data.operand when tesing
+      /* The following test cannot use recog_data.operand when testing
 	 for a SUBREG: the underlying object might have been changed
 	 already if we are inside a match_operator expression that
 	 matches the else clause.  Instead we test the underlying
Index: function.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/function.c,v
retrieving revision 1.459
diff -u -r1.459 function.c
--- function.c	5 Oct 2003 13:34:43 -0000	1.459
+++ function.c	5 Oct 2003 19:41:30 -0000
@@ -6342,7 +6342,7 @@
 }
 
 /* Reset cfun, and other non-struct-function variables to defaults as
-   appropriate for emiiting rtl at the start of a function.  */
+   appropriate for emitting rtl at the start of a function.  */
 
 static void
 prepare_function_start (tree fndecl)
Index: gcov-io.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/gcov-io.h,v
retrieving revision 1.45
diff -u -r1.45 gcov-io.h
--- gcov-io.h	30 Jul 2003 19:23:30 -0000	1.45
+++ gcov-io.h	5 Oct 2003 19:41:30 -0000
@@ -148,7 +148,7 @@
    program.  The checksum is used for whole program summaries, and
    disambiguates different programs which include the same
    instrumented object file.  There may be several program summaries,
-   each with a unique checksum.  The object summary's checkum is zero.
+   each with a unique checksum.  The object summary's checksum is zero.
    Note that the data file might contain information from several runs
    concatenated, or the data might be merged.
 
Index: gcse.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/gcse.c,v
retrieving revision 1.275
diff -u -r1.275 gcse.c
--- gcse.c	26 Sep 2003 18:23:26 -0000	1.275
+++ gcse.c	5 Oct 2003 19:41:34 -0000
@@ -5360,7 +5360,7 @@
      reaching_reg <- expr
      old_reg      <- reaching_reg
    because this way copy propagation can discover additional PRE
-   opportunuties.  But if this fails, we try the old way.  */
+   opportunities.  But if this fails, we try the old way.  */
 
 static void
 pre_insert_copy_insn (struct expr *expr, rtx insn)
Index: genoutput.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/genoutput.c,v
retrieving revision 1.78
diff -u -r1.78 genoutput.c
--- genoutput.c	19 Jul 2003 14:47:06 -0000	1.78
+++ genoutput.c	5 Oct 2003 19:41:34 -0000
@@ -1048,7 +1048,7 @@
      check that fails if the value is not the expected one...  */
   if (DEFAULT_CONSTRAINT_LEN (*p, p) != 1)
     abort ();
-  /* And now a comile-time check that should give a diagnostic if the
+  /* And now a compile-time check that should give a diagnostic if the
      definition doesn't exactly match.  */
 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1
   /* Now re-define DEFAULT_CONSTRAINT_LEN so that we can verify it is
Index: loop.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/loop.c,v
retrieving revision 1.472
diff -u -r1.472 loop.c
--- loop.c	15 Sep 2003 01:55:50 -0000	1.472
+++ loop.c	5 Oct 2003 19:41:39 -0000
@@ -6665,7 +6665,7 @@
 								    arg1)),
 					ext_val, benefit);
 	    }
-	  /* Propagate the MULT expressions to the intermost nodes.  */
+	  /* Propagate the MULT expressions to the innermost nodes.  */
 	  else if (GET_CODE (arg0) == PLUS)
 	    {
 	      /* (invar_0 + invar_1) * invar_2.  Distribute.  */
Index: postreload.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/postreload.c,v
retrieving revision 2.4
diff -u -r2.4 postreload.c
--- postreload.c	19 Jul 2003 14:47:07 -0000	2.4
+++ postreload.c	5 Oct 2003 19:41:40 -0000
@@ -757,7 +757,7 @@
 	  else
 	    {
 	      /* Otherwise, look for a free index register.  Since we have
-		 checked above that neiter REG nor BASE are index registers,
+		 checked above that neither REG nor BASE are index registers,
 		 if we find anything at all, it will be different from these
 		 two registers.  */
 	      for (i = first_index_reg; i <= last_index_reg; i++)
Index: reg-stack.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/reg-stack.c,v
retrieving revision 1.133
diff -u -r1.133 reg-stack.c
--- reg-stack.c	22 Sep 2003 06:59:46 -0000	1.133
+++ reg-stack.c	5 Oct 2003 19:41:41 -0000
@@ -2837,7 +2837,7 @@
 	 some dead EH outgoing edge after the possible deletion of the
 	 trapping insn inside the block.  Since the number of predecessors of
 	 "block"'s successors has been computed based on the initial edge set,
-	 we check for the possiblity to process some of these successors
+	 we check for the possibility to process some of these successors
 	 before such an edge deletion may happen.  */
       for (e = block->succ; e ; e = e->succ_next)
 	if (! (e->flags & EDGE_DFS_BACK))
Index: regmove.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/regmove.c,v
retrieving revision 1.149
diff -u -r1.149 regmove.c
--- regmove.c	22 Aug 2003 06:45:14 -0000	1.149
+++ regmove.c	5 Oct 2003 19:41:43 -0000
@@ -706,7 +706,7 @@
       if (! INSN_P (p))
 	continue;
 
-      /* Make a tenative change.  */
+      /* Make a tentative change.  */
       validate_replace_rtx_group (src_reg, subreg, p);
     }
 
Index: sched-int.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/sched-int.h,v
retrieving revision 1.28
diff -u -r1.28 sched-int.h
--- sched-int.h	15 Jul 2003 13:02:20 -0000	1.28
+++ sched-int.h	5 Oct 2003 19:41:43 -0000
@@ -82,7 +82,7 @@
      scheduling is done.  */
   rtx sched_before_next_call;
 
-  /* Used to keep post-call psuedo/hard reg movements together with
+  /* Used to keep post-call pseudo/hard reg movements together with
      the call.  */
   bool in_post_call_group_p;
 
Index: sched-rgn.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/sched-rgn.c,v
retrieving revision 1.63
diff -u -r1.63 sched-rgn.c
--- sched-rgn.c	19 Jul 2003 22:03:37 -0000	1.63
+++ sched-rgn.c	5 Oct 2003 19:41:44 -0000
@@ -1340,7 +1340,7 @@
 	}
       else
 	{
-	  /* Check for psuedo registers.  */
+	  /* Check for pseudo registers.  */
 	  for (i = 0; i < candidate_table[src].split_bbs.nr_members; i++)
 	    {
 	      int b = candidate_table[src].split_bbs.first_member[i];
Index: simplify-rtx.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/simplify-rtx.c,v
retrieving revision 1.161
diff -u -r1.161 simplify-rtx.c
--- simplify-rtx.c	3 Oct 2003 21:33:53 -0000	1.161
+++ simplify-rtx.c	5 Oct 2003 19:41:46 -0000
@@ -778,7 +778,7 @@
 	   && width <= 2*HOST_BITS_PER_WIDE_INT && width > 0)
     {
       /* Although the overflow semantics of RTL's FIX and UNSIGNED_FIX
-	 operators are intentionally left unspecified (to ease implemention
+	 operators are intentionally left unspecified (to ease implementation
 	 by target backends), for consistency, this routine implements the
 	 same semantics for constant folding as used by the middle-end.  */
 
Index: tree-inline.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-inline.c,v
retrieving revision 1.82
diff -u -r1.82 tree-inline.c
--- tree-inline.c	3 Oct 2003 00:23:29 -0000	1.82
+++ tree-inline.c	5 Oct 2003 19:41:47 -0000
@@ -1833,7 +1833,7 @@
     case BLOCK:
     case RECORD_TYPE:
     case CHAR_TYPE:
-      /* None of thse have subtrees other than those already walked
+      /* None of these have subtrees other than those already walked
          above.  */
       break;
 
Index: config/m68hc11/m68hc11.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/config/m68hc11/m68hc11.h,v
retrieving revision 1.79
diff -u -r1.79 m68hc11.h
--- config/m68hc11/m68hc11.h	2 Oct 2003 00:44:23 -0000	1.79
+++ config/m68hc11/m68hc11.h	5 Oct 2003 19:41:49 -0000
@@ -968,7 +968,7 @@
    followed by "to".  Eliminations of the same "from" register are listed
    in order of preference.
 
-   We have two registers that are eliminated on the 6811. The psuedo arg
+   We have two registers that are eliminated on the 6811. The pseudo arg
    pointer and pseudo frame pointer registers can always be eliminated;
    they are replaced with either the stack or the real frame pointer.  */
 
Index: config/mmix/mmix.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/config/mmix/mmix.c,v
retrieving revision 1.54
diff -u -r1.54 mmix.c
--- config/mmix/mmix.c	16 Jul 2003 17:44:59 -0000	1.54
+++ config/mmix/mmix.c	5 Oct 2003 19:41:50 -0000
@@ -62,7 +62,7 @@
    (perhaps any insn).  But regs_ever_live is up-to-date when
    leaf_function_p () isn't, so we "or" them together to get accurate
    information.  FIXME: Some tweak to leaf_function_p might be
-   preferrable.  */
+   preferable.  */
 #define MMIX_CFUN_NEEDS_SAVED_EH_RETURN_ADDRESS			\
  (flag_exceptions						\
   && ((reload_completed && regs_ever_live[MMIX_rJ_REGNUM])	\
Index: config/mn10300/mn10300.md
===================================================================
RCS file: /cvs/gcc/gcc/gcc/config/mn10300/mn10300.md,v
retrieving revision 1.51
diff -u -r1.51 mn10300.md
--- config/mn10300/mn10300.md	27 Sep 2003 04:48:26 -0000	1.51
+++ config/mn10300/mn10300.md	5 Oct 2003 19:41:51 -0000
@@ -859,7 +859,7 @@
 ;; but will have the proper effect on cc0.  Using d0 is arbitrary; any
 ;; data register would work.)
 
-;; Even though the first alternative would be preferrable if it can
+;; Even though the first alternative would be preferable if it can
 ;; possibly match, reload must not be given the opportunity to attempt
 ;; to use it.  It assumes that such matches can only occur when one of
 ;; the operands is used for input and the other for output.  Since
Index: config/sh/sh.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/config/sh/sh.h,v
retrieving revision 1.222
diff -u -r1.222 sh.h
--- config/sh/sh.h	27 Sep 2003 04:48:28 -0000	1.222
+++ config/sh/sh.h	5 Oct 2003 19:41:53 -0000
@@ -3213,7 +3213,7 @@
 #define MAX_FIXED_MODE_SIZE (TARGET_SH5 ? 128 : 64)
 
 /* ??? Define ACCUMULATE_OUTGOING_ARGS?  This is more efficient than pushing
-   and poping arguments.  However, we do have push/pop instructions, and
+   and popping arguments.  However, we do have push/pop instructions, and
    rather limited offsets (4 bits) in load/store instructions, so it isn't
    clear if this would give better code.  If implemented, should check for
    compatibility problems.  */