[patch] gcc/*.[ch]: Fix comment typos.

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

Hi,

Committed as obvious without a ChangeLog entry.  (See
http://sources.redhat.com/ml/binutils/2003-10/msg00667.html.)

Kazu Hirata

Index: ChangeLog.7
===================================================================
RCS file: /cvs/gcc/gcc/gcc/ChangeLog.7,v
retrieving revision 1.5
diff -u -r1.5 ChangeLog.7
--- ChangeLog.7	1 Jul 2003 13:10:25 -0000	1.5
+++ ChangeLog.7	21 Nov 2003 06:46:24 -0000
@@ -12648,7 +12648,7 @@
 
 Thu Mar 28 19:13:36 CET 2002  Jan Hubicka  <jh@suse.cz>
 
-	* ifcvt.c (if_convert): Clear aux_for_blocks early enought.
+	* ifcvt.c (if_convert): Clear aux_for_blocks early enough.
 
 Thu Mar 28 13:21:53 CET 2002  Jan Hubicka  <jh@suse.cz>
 
Index: c-common.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-common.c,v
retrieving revision 1.466
diff -u -r1.466 c-common.c
--- c-common.c	6 Nov 2003 22:08:17 -0000	1.466
+++ c-common.c	21 Nov 2003 06:46:27 -0000
@@ -5774,7 +5774,7 @@
     return NULL;
   switch (TREE_CODE (x))
     { 
-    /* Reconginze assignments of large structures and constructors of
+    /* Recognize assignments of large structures and constructors of
        big arrays.  */
     case MODIFY_EXPR:
     case CONSTRUCTOR:
Index: c-pretty-print.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-pretty-print.c,v
retrieving revision 1.32
diff -u -r1.32 c-pretty-print.c
--- c-pretty-print.c	8 Oct 2003 18:13:53 -0000	1.32
+++ c-pretty-print.c	21 Nov 2003 06:46:28 -0000
@@ -1820,7 +1820,7 @@
 
 /* statement:
       labeled-statement
-      coumpound-statement
+      compound-statement
       expression-statement
       selection-statement
       iteration-statement
@@ -1870,7 +1870,7 @@
       pp_needs_newline (pp) = true;
       break;
 
-      /* coumpound-statement:
+      /* compound-statement:
             {  block-item-list(opt) }
 
          block-item-list:
Index: cgraphunit.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cgraphunit.c,v
retrieving revision 1.38
diff -u -r1.38 cgraphunit.c
--- cgraphunit.c	9 Nov 2003 02:37:54 -0000	1.38
+++ cgraphunit.c	21 Nov 2003 06:46:28 -0000
@@ -931,7 +931,7 @@
    All inline candidates are put into prioritized heap based on estimated
    growth of the overall number of instructions and then update the estimates.
 
-   INLINED and INLINED_CALEES are just pointers to arrays large enought
+   INLINED and INLINED_CALEES are just pointers to arrays large enough
    to be passed to cgraph_inlined_into and cgraph_inlined_callees.  */
 
 static void
Index: et-forest.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/et-forest.h,v
retrieving revision 1.5
diff -u -r1.5 et-forest.h
--- et-forest.h	5 Jul 2003 15:17:28 -0000	1.5
+++ et-forest.h	21 Nov 2003 06:46:32 -0000
@@ -20,7 +20,7 @@
    for tree operations (insertion and removal of nodes and edges) and
    poly-logarithmic time for nearest common ancestor.
 
-   ET tree stores its structue as a sequence of symbols obtained
+   ET tree stores its structure as a sequence of symbols obtained
    by dfs(root)
 
    dfs (node)
Index: expr.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/expr.c,v
retrieving revision 1.603
diff -u -r1.603 expr.c
--- expr.c	20 Nov 2003 22:41:57 -0000	1.603
+++ expr.c	21 Nov 2003 06:46:37 -0000
@@ -9341,7 +9341,7 @@
     {
       /* We have a true reference to the value in OP0.
 	 If there is an insn to add or subtract in this mode, queue it.
-	 Queueing the increment insn avoids the register shuffling
+	 Queuing the increment insn avoids the register shuffling
 	 that often results if we must increment now and first save
 	 the old value for subsequent use.  */
 
Index: gcse.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/gcse.c,v
retrieving revision 1.277
diff -u -r1.277 gcse.c
--- gcse.c	17 Oct 2003 16:16:44 -0000	1.277
+++ gcse.c	21 Nov 2003 06:46:40 -0000
@@ -2205,7 +2205,7 @@
 		       && oprs_available_p (pat, tmp))))
 	insert_set_in_table (pat, insn, table);
     }
-  /* In case of store we want to consider the memory value as avaiable in
+  /* In case of store we want to consider the memory value as available in
      the REG stored in that memory. This makes it possible to remove
      redundant loads from due to stores to the same location.  */
   else if (flag_gcse_las && GET_CODE (src) == REG && GET_CODE (dest) == MEM)
Index: genautomata.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/genautomata.c,v
retrieving revision 1.51
diff -u -r1.51 genautomata.c
--- genautomata.c	19 Jul 2003 14:47:06 -0000	1.51
+++ genautomata.c	21 Nov 2003 06:46:44 -0000
@@ -6282,7 +6282,7 @@
 		}
           }
 	/* Its is important that alt states were sorted before and
-           after merging to have the same quering results.  */
+           after merging to have the same querying results.  */
         new_state->component_states = uniq_sort_alt_states (alt_states);
       }
     else
Index: genrecog.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/genrecog.c,v
retrieving revision 1.131
diff -u -r1.131 genrecog.c
--- genrecog.c	11 Aug 2003 21:47:36 -0000	1.131
+++ genrecog.c	21 Nov 2003 06:46:45 -0000
@@ -633,7 +633,7 @@
 	if (GET_CODE (dest) == STRICT_LOW_PART)
 	  dest = XEXP (dest, 0);
 
-	/* Find the referant for a DUP.  */
+	/* Find the referent for a DUP.  */
 
 	if (GET_CODE (dest) == MATCH_DUP
 	    || GET_CODE (dest) == MATCH_OP_DUP
Index: gensupport.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/gensupport.c,v
retrieving revision 1.42
diff -u -r1.42 gensupport.c
--- gensupport.c	19 Jul 2003 14:47:06 -0000	1.42
+++ gensupport.c	21 Nov 2003 06:46:46 -0000
@@ -259,7 +259,7 @@
   fclose (input_file);
 }
 
-/* Process a top level rtx in some way, queueing as appropriate.  */
+/* Process a top level rtx in some way, queuing as appropriate.  */
 
 static void
 process_rtx (rtx desc, int lineno)
Index: ggc-zone.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/ggc-zone.c,v
retrieving revision 2.3
diff -u -r2.3 ggc-zone.c
--- ggc-zone.c	29 Oct 2003 22:13:59 -0000	2.3
+++ ggc-zone.c	21 Nov 2003 06:46:47 -0000
@@ -1001,7 +1001,7 @@
   return result;
 }
 
-/* Allocate a SIZE of chunk memory of GTE type, into an approriate zone
+/* Allocate a SIZE of chunk memory of GTE type, into an appropriate zone
    for that type.  */
 
 void *
@@ -1288,7 +1288,7 @@
 	}
 
       /* Large pages are all or none affairs. Either they are
-	 completely empty, or they are completeley full.
+	 completely empty, or they are completely full.
 	 Thus, if the above didn't catch it, we need not do anything
 	 except remove the mark and reset the bytes_free.
 
Index: haifa-sched.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/haifa-sched.c,v
retrieving revision 1.232
diff -u -r1.232 haifa-sched.c
--- haifa-sched.c	21 Oct 2003 14:40:04 -0000	1.232
+++ haifa-sched.c	21 Nov 2003 06:46:48 -0000
@@ -973,7 +973,7 @@
 }
 
 /* Macros and functions for keeping the priority queue sorted, and
-   dealing with queueing and dequeueing of instructions.  */
+   dealing with queuing and dequeuing of instructions.  */
 
 #define SCHED_SORT(READY, N_READY)                                   \
 do { if ((N_READY) == 2)				             \
Index: ifcvt.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/ifcvt.c,v
retrieving revision 1.129
diff -u -r1.129 ifcvt.c
--- ifcvt.c	2 Nov 2003 13:56:40 -0000	1.129
+++ ifcvt.c	21 Nov 2003 06:46:49 -0000
@@ -1652,7 +1652,7 @@
 
   target = expand_abs_nojump (GET_MODE (if_info->x), b, if_info->x, 1);
 
-  /* ??? It's a quandry whether cmove would be better here, especially
+  /* ??? It's a quandary whether cmove would be better here, especially
      for integers.  Perhaps combine will clean things up.  */
   if (target && negate)
     target = expand_simple_unop (GET_MODE (target), NEG, target, if_info->x, 0);
Index: loop.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/loop.c,v
retrieving revision 1.475
diff -u -r1.475 loop.c
--- loop.c	9 Nov 2003 14:33:20 -0000	1.475
+++ loop.c	21 Nov 2003 06:46:58 -0000
@@ -6223,7 +6223,7 @@
       /* convert_modes can emit new instructions, e.g. when arg is a loop
 	 invariant MEM and dest_reg has a different mode.
 	 These instructions would be emitted after the end of the function
-	 and then *inc_val would be an unitialized pseudo.
+	 and then *inc_val would be an uninitialized pseudo.
 	 Detect this and bail in this case.
 	 Other alternatives to solve this can be introducing a convert_modes
 	 variant which is allowed to fail but not allowed to emit new
Index: optabs.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/optabs.c,v
retrieving revision 1.202
diff -u -r1.202 optabs.c
--- optabs.c	23 Oct 2003 21:37:52 -0000	1.202
+++ optabs.c	21 Nov 2003 06:46:58 -0000
@@ -5371,7 +5371,7 @@
     abs_optab->handlers[TYPE_MODE (complex_double_type_node)].libfunc
       = init_one_libfunc ("cabs");
 
-  /* The ffs function op[1erates on `int'.  */
+  /* The ffs function operates on `int'.  */
   ffs_optab->handlers[(int) mode_for_size (INT_TYPE_SIZE, MODE_INT, 0)].libfunc
     = init_one_libfunc ("ffs");
 
Index: pretty-print.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/pretty-print.h,v
retrieving revision 1.10
diff -u -r1.10 pretty-print.h
--- pretty-print.h	25 Aug 2003 19:10:48 -0000	1.10
+++ pretty-print.h	21 Nov 2003 06:46:58 -0000
@@ -234,7 +234,7 @@
 
 #define pp_buffer(PP) pp_base (PP)->buffer
 /* Clients that directly derive from pretty_printer need to override
-   this macro to return a pointer to the base pretty_printer structrure.  */
+   this macro to return a pointer to the base pretty_printer structure.  */
 #define pp_base(PP) (PP)
 
 extern void pp_construct (pretty_printer *, const char *, int);
Index: regrename.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/regrename.c,v
retrieving revision 1.69
diff -u -r1.69 regrename.c
--- regrename.c	11 Oct 2003 22:57:45 -0000	1.69
+++ regrename.c	21 Nov 2003 06:46:58 -0000
@@ -1734,7 +1734,7 @@
       /* If a block has a single predecessor, that we've already
 	 processed, begin with the value data that was live at
 	 the end of the predecessor block.  */
-      /* ??? Ought to use more intelligent queueing of blocks.  */
+      /* ??? Ought to use more intelligent queuing of blocks.  */
       if (bb->pred)
 	for (bbp = bb; bbp && bbp != bb->pred->src; bbp = bbp->prev_bb);
       if (bb->pred
Index: rtl.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/rtl.h,v
retrieving revision 1.437
diff -u -r1.437 rtl.h
--- rtl.h	18 Oct 2003 18:45:15 -0000	1.437
+++ rtl.h	21 Nov 2003 06:46:59 -0000
@@ -1742,7 +1742,7 @@
 /* regclass.c */
 
 /* Maximum number of parallel sets and clobbers in any insn in this fn.
-   Always at least 3, since the combiner could put that many togetherm
+   Always at least 3, since the combiner could put that many together
    and we want this to remain correct for all the remaining passes.  */
 
 extern int max_parallel;
Index: sched-rgn.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/sched-rgn.c,v
retrieving revision 1.65
diff -u -r1.65 sched-rgn.c
--- sched-rgn.c	7 Oct 2003 08:18:41 -0000	1.65
+++ sched-rgn.c	21 Nov 2003 06:47:00 -0000
@@ -2036,7 +2036,7 @@
      end since moving them results in worse register allocation.  Uses remain
      at the end to ensure proper register allocation.
 
-     cc0 setters remaim at the end because they can't be moved away from
+     cc0 setters remain at the end because they can't be moved away from
      their cc0 user.
 
      Insns setting CLASS_LIKELY_SPILLED_P registers (usually return values)
Index: target.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/target.h,v
retrieving revision 1.70
diff -u -r1.70 target.h
--- target.h	16 Nov 2003 19:10:05 -0000	1.70
+++ target.h	21 Nov 2003 06:47:01 -0000
@@ -207,7 +207,7 @@
        correspondingly starts and finishes.  The function defined by
        init_dfa_pre_cycle_insn and init_dfa_post_cycle_insn are used
        to initialize the corresponding insns.  The default values of
-       the memebers result in not changing the automaton state when
+       the members result in not changing the automaton state when
        the new simulated processor cycle correspondingly starts and
        finishes.  */
     void (* init_dfa_pre_cycle_insn) (void);
Index: value-prof.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/value-prof.c,v
retrieving revision 1.6
diff -u -r1.6 value-prof.c
--- value-prof.c	31 Oct 2003 01:08:38 -0000	1.6
+++ value-prof.c	21 Nov 2003 06:47:01 -0000
@@ -132,7 +132,7 @@
 	  (*n_values)++;
 	}
 
-      /* For mod, check whether it is not often a noop (or replacable by
+      /* For mod, check whether it is not often a noop (or replaceable by
 	 a few subtractions).  */
       if (GET_CODE (set_src) == UMOD && !side_effects_p (op1))
 	{
@@ -446,9 +446,9 @@
   histogram = XEXP (histogram, 1);
   all = INTVAL (XEXP (histogram, 0));
 
-  /* We requiere that count is at least half of all; this means
+  /* We require that count is at least half of all; this means
      that for the transformation to fire the value must be constant
-     at least 50% of time (and 75% gives the garantee of usage).  */
+     at least 50% of time (and 75% gives the guarantee of usage).  */
   if (!rtx_equal_p (op2, value) || 2 * count < all)
     return false;
 
Index: web.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/web.c,v
retrieving revision 2.3
diff -u -r2.3 web.c
--- web.c	31 Oct 2003 01:08:38 -0000	2.3
+++ web.c	21 Nov 2003 06:47:01 -0000
@@ -20,7 +20,7 @@
 02111-1307, USA.  */
 
 /* Simple optimization pass that splits independent uses of each pseudo,
-   increasing effectivity of other optimizations.  The optimization can
+   increasing effectiveness of other optimizations.  The optimization can
    serve as an example of use for the dataflow module.
 
    We don't split registers with REG_USERVAR set unless -fmessy-debugging