[patch] gcc/*.[ch]: 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-08-19  Kazu Hirata  <kazu@cs.umass.edu>

	* builtins.c: Fix comment typos.
	* c-common.c: Likewise.
	* c-decl.c: Likewise.
	* c-pretty-print.c: Likewise.
	* cfgbuild.c: Likewise.
	* cfglayout.c: Likewise.
	* cfgloopanal.c: Likewise.
	* cgraphunit.c: Likewise.
	* cppfiles.c: Likewise.
	* dwarfout.c: Likewise.
	* expr.c: Likewise.
	* fold-const.c: Likewise.
	* gcse.c: Likewise.
	* ggc-page.c: Likewise.
	* haifa-sched.c: Likewise.
	* pretty-print.c: Likewise.
	* tree.c: Likewise.
	* tree.h: Likewise.
	* value-prof.c: Likewise.

Index: builtins.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/builtins.c,v
retrieving revision 1.238
diff -u -r1.238 builtins.c
--- builtins.c	14 Aug 2003 14:38:38 -0000	1.238
+++ builtins.c	19 Aug 2003 23:17:20 -0000
@@ -4544,7 +4544,7 @@
 	  size_t len = strlen (fmt_str);
 	  if (fmt_str[len - 1] == '\n')
 	    {
-	      /* Create a NUL-terminalted string that's one char shorter
+	      /* Create a NUL-terminated string that's one char shorter
 		 than the original, stripping off the trailing '\n'.  */
 	      char *newstr = (char *) alloca (len);
 	      memcpy (newstr, fmt_str, len - 1);
Index: c-common.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-common.c,v
retrieving revision 1.447
diff -u -r1.447 c-common.c
--- c-common.c	19 Aug 2003 21:04:37 -0000	1.447
+++ c-common.c	19 Aug 2003 23:17:23 -0000
@@ -5639,7 +5639,7 @@
       return NULL;
     }
   /* Assume that constants and references counts nothing.  These should
-     be majorized by amount of operations amoung them we count later
+     be majorized by amount of operations among them we count later
      and are common target of CSE and similar optimizations.  */
   if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
       || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
Index: c-decl.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-decl.c,v
retrieving revision 1.432
diff -u -r1.432 c-decl.c
--- c-decl.c	19 Aug 2003 21:09:36 -0000	1.432
+++ c-decl.c	19 Aug 2003 23:17:26 -0000
@@ -6690,7 +6690,7 @@
 /* A wrapper around lhd_set_decl_assembler_name that gives static
    variables their C names if they are at file scope and only one
    translation unit is being compiled, for backwards compatibility
-   with certain bizzare assembler hacks (like crtstuff.c).  */
+   with certain bizarre assembler hacks (like crtstuff.c).  */
 
 void
 c_static_assembler_name (tree decl)
Index: c-pretty-print.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-pretty-print.c,v
retrieving revision 1.22
diff -u -r1.22 c-pretty-print.c
--- c-pretty-print.c	10 Aug 2003 18:17:05 -0000	1.22
+++ c-pretty-print.c	19 Aug 2003 23:17:27 -0000
@@ -30,9 +30,9 @@
 /* The pretty-printer code is primarily designed to closely follow
    (GNU) C and C++ grammars.  That is to be contrasted with spaghetti
    codes we used to have in the past.  Following a structured
-   approach (preferaably the official grammars) is believed to make it
-   much easier o add extensions and nifty pretty-printing effects that
-   takes expresssion or declaration contexts into account.  */
+   approach (preferably the official grammars) is believed to make it
+   much easier to add extensions and nifty pretty-printing effects that
+   takes expression or declaration contexts into account.  */
 
 
 #define pp_c_whitespace(PP)           \
@@ -299,7 +299,7 @@
 
 
   Implementation note:  Because of the non-linearities in array or
-  function declarations, this routinie prints not just the
+  function declarations, this routine prints not just the
   specifier-qualifier-list of such entities or types of such entities,
   but also the 'pointer' production part of their declarators.  The
   remaining part is done by pp_declarator or pp_c_abstract_declarator.  */
Index: cfgbuild.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cfgbuild.c,v
retrieving revision 1.38
diff -u -r1.38 cfgbuild.c
--- cfgbuild.c	22 Jun 2003 15:03:25 -0000	1.38
+++ cfgbuild.c	19 Aug 2003 23:17:27 -0000
@@ -121,7 +121,7 @@
       return (flag_non_call_exceptions && can_throw_internal (insn));
 
     case BARRIER:
-      /* It is nonsence to reach barrier when looking for the
+      /* It is nonsense to reach barrier when looking for the
          end of basic block, but before dead code is eliminated
          this may happen.  */
       return false;
Index: cfglayout.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cfglayout.c,v
retrieving revision 1.45
diff -u -r1.45 cfglayout.c
--- cfglayout.c	14 Jul 2003 21:18:14 -0000	1.45
+++ cfglayout.c	19 Aug 2003 23:17:28 -0000
@@ -795,7 +795,7 @@
   prev_bb->next_bb = EXIT_BLOCK_PTR;
   EXIT_BLOCK_PTR->prev_bb = prev_bb;
 
-  /* Anoying special case - jump around dead jumptables left in the code.  */
+  /* Annoying special case - jump around dead jumptables left in the code.  */
   FOR_EACH_BB (bb)
     {
       edge e;
Index: cfgloopanal.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cfgloopanal.c,v
retrieving revision 1.10
diff -u -r1.10 cfgloopanal.c
--- cfgloopanal.c	6 Jul 2003 18:59:38 -0000	1.10
+++ cfgloopanal.c	19 Aug 2003 23:17:28 -0000
@@ -557,7 +557,7 @@
       abort ();
     }
 
-  /* If this is const_true_rtx and we did not take a conservative aproximation
+  /* If this is const_true_rtx and we did not take a conservative approximation
      of after_wrap above, we might iterate the calculation (but of course we
      would have to take care about infinite cases).  Ignore this for now.  */
   rqmt = simplify_gen_relational (cond, SImode, mode, after_wrap, lim);
Index: cgraphunit.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cgraphunit.c,v
retrieving revision 1.19
diff -u -r1.19 cgraphunit.c
--- cgraphunit.c	16 Aug 2003 11:04:51 -0000	1.19
+++ cgraphunit.c	19 Aug 2003 23:17:29 -0000
@@ -781,7 +781,7 @@
 	  || !cgraph_default_inline_p (node))
 	continue;
 
-      /* Rule out always_inline functions we dealt with earler.  */
+      /* Rule out always_inline functions we dealt with earlier.  */
       for (e = node->callers; e; e = e->next_caller)
 	if (e->inline_call)
 	  break;
@@ -1015,7 +1015,7 @@
     if (e->callee == callee)
       return e->inline_call;
   /* We do not record builtins in the callgraph.  Perhaps it would make more
-     sense to do so and then prune out those not overwriten by explicit
+     sense to do so and then prune out those not overwritten by explicit
      function body.  */
   return false;
 }
@@ -1023,7 +1023,7 @@
 
    Attempt to topologically sort the nodes so function is output when
    all called functions are already assembled to allow data to be
-   propagated accross the callgraph.  Use a stack to get smaller distance
+   propagated across the callgraph.  Use a stack to get smaller distance
    between a function and it's callees (later we may choose to use a more
    sophisticated algorithm for function reordering; we will likely want
    to use subsections to make the output functions appear in top-down
@@ -1058,8 +1058,8 @@
 
 /* Mark all local functions.
 
-   Local function is function whose calls can occur only in the
-   current compilation unit so we change it's calling convetion.
+   A local function is one whose calls can occur only in the
+   current compilation unit, so we change its calling convention.
    We simply mark all static functions whose address is not taken
    as local.  */
 
Index: cppfiles.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cppfiles.c,v
retrieving revision 1.187
diff -u -r1.187 cppfiles.c
--- cppfiles.c	19 Aug 2003 21:09:36 -0000	1.187
+++ cppfiles.c	19 Aug 2003 23:17:29 -0000
@@ -119,7 +119,7 @@
 /* A singly-linked list for all searches for a given file name, with
    its head pointed to by a slot in FILE_HASH.  The file name is what
    appeared between the quotes in a #include directive; it can be
-   determined implicity from the hash table location or explicitly
+   determined implicitly from the hash table location or explicitly
    from FILE->name.
 
    FILE is a structure containing details about the file that was
@@ -494,7 +494,7 @@
 }
 
 /* Convenience wrapper around read_file_guts that opens the file if
-   necessary and closes the file desciptor after reading.  FILE must
+   necessary and closes the file descriptor after reading.  FILE must
    have been passed through find_file() at some stage.  */
 static bool
 read_file (cpp_reader *pfile, _cpp_file *file)
Index: dwarfout.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/dwarfout.c,v
retrieving revision 1.132
diff -u -r1.132 dwarfout.c
--- dwarfout.c	5 Aug 2003 21:15:56 -0000	1.132
+++ dwarfout.c	19 Aug 2003 23:17:32 -0000
@@ -942,7 +942,7 @@
 #endif
 
 /* Pseudo-ops for pushing the current section onto the section stack (and
-   simultaneously changing to a new section) and for poping back to the
+   simultaneously changing to a new section) and for popping back to the
    section we were in immediately before this one.  Note that most svr4
    assemblers only maintain a one level stack... you can push all the
    sections you want, but you can only pop out one level.  (The sparc
Index: expr.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/expr.c,v
retrieving revision 1.576
diff -u -r1.576 expr.c
--- expr.c	12 Aug 2003 01:45:22 -0000	1.576
+++ expr.c	19 Aug 2003 23:17:37 -0000
@@ -6393,7 +6393,7 @@
       /* We can find the lowest bit that's a one.  If the low
 	 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
 	 We need to handle this case since we can find it in a COND_EXPR,
-	 a MIN_EXPR, or a MAX_EXPR.  If the constant overlows, we have an
+	 a MIN_EXPR, or a MAX_EXPR.  If the constant overflows, we have an
 	 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
 	 later ICE.  */
       if (TREE_CONSTANT_OVERFLOW (exp))
Index: fold-const.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/fold-const.c,v
retrieving revision 1.291
diff -u -r1.291 fold-const.c
--- fold-const.c	14 Aug 2003 20:53:26 -0000	1.291
+++ fold-const.c	19 Aug 2003 23:17:41 -0000
@@ -8364,7 +8364,7 @@
 
 #endif
 
-/* Perform constant folding and related simplification of intializer
+/* Perform constant folding and related simplification of initializer
    expression EXPR.  This behaves identically to "fold" but ignores
    potential run-time traps and exceptions that fold must preserve.  */
 
Index: gcse.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/gcse.c,v
retrieving revision 1.268
diff -u -r1.268 gcse.c
--- gcse.c	12 Aug 2003 02:23:57 -0000	1.268
+++ gcse.c	19 Aug 2003 23:17:45 -0000
@@ -4530,7 +4530,7 @@
 
   count = 0;
   FOR_EACH_BB (bb)
-    /* Check for more than one sucessor.  */
+    /* Check for more than one successor.  */
     if (bb->succ && bb->succ->succ_next)
       {
 	cond = fis_get_condition (bb->end);
@@ -6756,7 +6756,7 @@
 /* This routine will take an expression which we are replacing with
    a reaching register, and update any stores that are needed if
    that expression is in the ld_motion list.  Stores are updated by
-   copying their SRC to the reaching register, and then storeing
+   copying their SRC to the reaching register, and then storing
    the reaching register into the store location. These keeps the
    correct value in the reaching register for the loads.  */
 
Index: ggc-page.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/ggc-page.c,v
retrieving revision 1.74
diff -u -r1.74 ggc-page.c
--- ggc-page.c	22 Jul 2003 23:15:28 -0000	1.74
+++ ggc-page.c	19 Aug 2003 23:17:46 -0000
@@ -1452,7 +1452,7 @@
   G.context_depth_allocations &= omask - 1;
   G.context_depth_collections &= omask - 1;
 
-  /* The G.depth array is shortend so that the last index is the
+  /* The G.depth array is shortened so that the last index is the
      context_depth of the top element of by_depth.  */
   if (depth+1 < G.depth_in_use)
     e = G.depth[depth+1];
Index: haifa-sched.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/haifa-sched.c,v
retrieving revision 1.227
diff -u -r1.227 haifa-sched.c
--- haifa-sched.c	11 Aug 2003 21:47:36 -0000	1.227
+++ haifa-sched.c	19 Aug 2003 23:17:47 -0000
@@ -385,7 +385,7 @@
    moved speculatively, by examining it's patterns, returning:
    TRAP_RISKY: store, or risky non-load insn (e.g. division by variable).
    TRAP_FREE: non-load insn.
-   IFREE: load from a globaly safe location.
+   IFREE: load from a globally safe location.
    IRISKY: volatile load.
    PFREE_CANDIDATE, PRISKY_CANDIDATE: load that need to be checked for
    being either PFREE or PRISKY.  */
Index: pretty-print.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/pretty-print.c,v
retrieving revision 2.4
diff -u -r2.4 pretty-print.c
--- pretty-print.c	10 Aug 2003 18:17:05 -0000	2.4
+++ pretty-print.c	19 Aug 2003 23:17:47 -0000
@@ -217,7 +217,7 @@
         default:
           break;
         }
-      /* We don't support precision behond that of "long long".  */
+      /* We don't support precision beyond that of "long long".  */
       if (precision > 2)
         abort();
 
Index: tree.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree.c,v
retrieving revision 1.322
diff -u -r1.322 tree.c
--- tree.c	8 Aug 2003 15:17:02 -0000	1.322
+++ tree.c	19 Aug 2003 23:17:49 -0000
@@ -3823,7 +3823,7 @@
   return t;
 }
 
-/* Build a function type.  The RETURN_TYPE is the type retured by the
+/* Build a function type.  The RETURN_TYPE is the type returned by the
    function.  If additional arguments are provided, they are
    additional argument types.  The list of argument types must always
    be terminated by NULL_TREE.  */
Index: tree.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree.h,v
retrieving revision 1.435
diff -u -r1.435 tree.h
--- tree.h	19 Aug 2003 07:37:06 -0000	1.435
+++ tree.h	19 Aug 2003 23:17:51 -0000
@@ -2387,7 +2387,7 @@
   USIZETYPE,		/* Unsigned representation of sizes in bytes.  */
   BITSIZETYPE,		/* Normal representation of sizes in bits.  */
   SBITSIZETYPE,		/* Signed representation of sizes in bits.  */
-  UBITSIZETYPE,	        /* Unsifgned representation of sizes in bits.  */
+  UBITSIZETYPE,	        /* Unsigned representation of sizes in bits.  */
   TYPE_KIND_LAST};
 
 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
Index: value-prof.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/value-prof.c,v
retrieving revision 1.3
diff -u -r1.3 value-prof.c
--- value-prof.c	30 Jul 2003 19:23:31 -0000	1.3
+++ value-prof.c	19 Aug 2003 23:17:51 -0000
@@ -40,7 +40,7 @@
    insn_values_to_profile function.  This function is called from branch_prob
    in profile.c and the requested values are instrumented by it in the first
    compilation with -fprofile-arcs.  The optimization may then read the
-   gathered data in the second compilation with -fbranch-probablities.
+   gathered data in the second compilation with -fbranch-probabilities.
    The measured data is appended as REG_VALUE_PROFILE note to the instrumented
    insn.  The argument to the note consists of an EXPR_LIST where its
    members have the following meaning (from the first to the last):