ChangeLog.7: Fix comment typos.

	* ChangeLog.7: Fix comment typos.
	* c-common.c: Likewise.
	* c-pretty-print.c: Likewise.
	* cgraphunit.c: Likewise.
	* et-forest.h: Likewise.
	* expr.c: Likewise.
	* gcse.c: Likewise.
	* genautomata.c: Likewise.
	* genrecog.c: Likewise.
	* gensupport.c: Likewise.
	* ggc-zone.c: Likewise.
	* haifa-sched.c: Likewise.
	* ifcvt.c: Likewise.
	* loop.c: Likewise.
	* optabs.c: Likewise.
	* pretty-print.h: Likewise.
	* regrename.c: Likewise.
	* rtl.h: Likewise.
	* sched-rgn.c: Likewise.
	* target.h: Likewise.
	* value-prof.c: Likewise.
	* web.c: Likewise.

From-SVN: r73795

diff --git a/gcc/ChangeLog.7 b/gcc/ChangeLog.7
index c796d0fd23c76e8fe3f50ccdbe6544c5ac78db1f..f9c6a7dbcb0f863d9bdc91392b71fe8cb2f96c6d 100644 (file)
--- a/gcc/ChangeLog.7
+++ b/gcc/ChangeLog.7
@@ -12648,7 +12648,7 @@ Thu Mar 28 16:35:31 2002  Jeffrey A Law  (law@redhat.com)
 
 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>
 

diff --git a/gcc/c-common.c b/gcc/c-common.c
index f587fb2df63186771b72c41a103c88a638bebccc..acc1e4471c7851f3ea2a3702d96ac29dcc43af55 100644 (file)
--- a/gcc/c-common.c
+++ b/gcc/c-common.c
@@ -5774,7 +5774,7 @@ c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
     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:

diff --git a/gcc/c-pretty-print.c b/gcc/c-pretty-print.c
index b2161b0b6a3dc344804a7d1a7ead42408f1ce60c..7d0a157acf180a9660fa60f14c3a5a5ef4bcc6bd 100644 (file)
--- a/gcc/c-pretty-print.c
+++ b/gcc/c-pretty-print.c
@@ -1820,7 +1820,7 @@ pp_c_expression (c_pretty_printer *pp, tree e)
 
 /* statement:
       labeled-statement
-      coumpound-statement
+      compound-statement
       expression-statement
       selection-statement
       iteration-statement
@@ -1870,7 +1870,7 @@ pp_c_statement (c_pretty_printer *pp, tree stmt)
       pp_needs_newline (pp) = true;
       break;
 
-      /* coumpound-statement:
+      /* compound-statement:
             {  block-item-list(opt) }
 
          block-item-list:

diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index 672b753bc46df0b621ecfc2408e92ab782d375a4..d2d4d4cb996c07f691c1c092fb3f7c4afabebc6e 100644 (file)
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -931,7 +931,7 @@ cgraph_default_inline_p (struct cgraph_node *n)
    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

diff --git a/gcc/et-forest.h b/gcc/et-forest.h
index 66aec4897c0d55a7693c0f2a15fb09793f95287b..f646d59b9107cf308707a19cc3ac3df39f94b584 100644 (file)
--- a/gcc/et-forest.h
+++ b/gcc/et-forest.h
@@ -20,7 +20,7 @@ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */
    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)

diff --git a/gcc/expr.c b/gcc/expr.c
index ac0249f38816f1af808dc698bf68cac624deea37..79b94867f6bc3d7c62160898e62463b4a674bb76 100644 (file)
--- a/gcc/expr.c
+++ b/gcc/expr.c
@@ -9341,7 +9341,7 @@ expand_increment (tree exp, int post, int ignore)
     {
       /* 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.  */
 

diff --git a/gcc/gcse.c b/gcc/gcse.c
index 3e09f02252bb9bb7168219f14186fea4f228a5cb..8f9f13aa4cb3d39dd667f4696cd85a03fbb42a9e 100644 (file)
--- a/gcc/gcse.c
+++ b/gcc/gcse.c
@@ -2205,7 +2205,7 @@ hash_scan_set (rtx pat, rtx insn, struct hash_table *table)
                       && 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)

diff --git a/gcc/genautomata.c b/gcc/genautomata.c
index a5783e6f80db24f6e8dc48a893a5622e39af8a6a..b343d6e65ba5f56db3ab105be327b3697490c26c 100644 (file)
--- a/gcc/genautomata.c
+++ b/gcc/genautomata.c
@@ -6282,7 +6282,7 @@ merge_states (automaton_t automaton, vla_ptr_t *equiv_classes)
                }
           }
        /* 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

diff --git a/gcc/genrecog.c b/gcc/genrecog.c
index 76f3749610706cb9cb59f0ce482267ab4d3bb9c1..adf81dd70a2a4e0da4c52f992d1f1b3a069f7437 100644 (file)
--- a/gcc/genrecog.c
+++ b/gcc/genrecog.c
@@ -633,7 +633,7 @@ validate_pattern (rtx pattern, rtx insn, rtx set, int set_code)
        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

diff --git a/gcc/gensupport.c b/gcc/gensupport.c
index 23f8e3f32cdb660578f21633f7c228e196093e12..0d4a8570c6920e48f6e6aee7b2e126b96e10baff 100644 (file)
--- a/gcc/gensupport.c
+++ b/gcc/gensupport.c
@@ -259,7 +259,7 @@ process_include (rtx desc, int lineno)
   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)

diff --git a/gcc/ggc-zone.c b/gcc/ggc-zone.c
index 2b9c45d41468f9b2ba2ecd09ddf47fe71244fd96..dbca7614a8b0cc1d9d1a7e000a0f67f94b60a0db 100644 (file)
--- a/gcc/ggc-zone.c
+++ b/gcc/ggc-zone.c
@@ -1001,7 +1001,7 @@ ggc_alloc_zone_1 (size_t size, struct alloc_zone *zone, short type)
   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 @@ sweep_pages (struct alloc_zone *zone)
        }
 
       /* 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.
 

diff --git a/gcc/haifa-sched.c b/gcc/haifa-sched.c
index f75894ac3be385fcd897e6b4fb6090fd3e710ed9..41ed7718dd838590517307adcf9519156c04cfdd 100644 (file)
--- a/gcc/haifa-sched.c
+++ b/gcc/haifa-sched.c
@@ -973,7 +973,7 @@ priority (rtx insn)
 }
 \f
 /* 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)                                            \

diff --git a/gcc/ifcvt.c b/gcc/ifcvt.c
index 9844bf4d2b35782a5650aaeb6b5e7a4b13b813c0..f7fddf987649af88a20bb1812084b6b3e967fd6a 100644 (file)
--- a/gcc/ifcvt.c
+++ b/gcc/ifcvt.c
@@ -1652,7 +1652,7 @@ noce_try_abs (struct noce_if_info *if_info)
 
   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);

diff --git a/gcc/loop.c b/gcc/loop.c
index 159906d3747e6feb15c488a882bbc23b2b9adf0f..77567f868d4343e772c7504fce025a414cfd90aa 100644 (file)
--- a/gcc/loop.c
+++ b/gcc/loop.c
@@ -6223,7 +6223,7 @@ basic_induction_var (const struct loop *loop, rtx x, enum machine_mode mode,
       /* 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

diff --git a/gcc/optabs.c b/gcc/optabs.c
index 1410ed2d209766393e52cba611e141419a767411..3a5705f9334a0d784e1ef96c93141120e260aada 100644 (file)
--- a/gcc/optabs.c
+++ b/gcc/optabs.c
@@ -5371,7 +5371,7 @@ init_optabs (void)
     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");
 

diff --git a/gcc/pretty-print.h b/gcc/pretty-print.h
index 80affe83e6faddb32669536ce9b2ea9f0c248a63..1691aec274a9a753544bff097f40141538a0db38 100644 (file)
--- a/gcc/pretty-print.h
+++ b/gcc/pretty-print.h
@@ -234,7 +234,7 @@ struct pretty_print_info
 
 #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);

diff --git a/gcc/regrename.c b/gcc/regrename.c
index 4e93fab796bc6d21e9d2b4b3cf55f45552831309..b22e56e19c13971334bdab05dda692c4302dc6af 100644 (file)
--- a/gcc/regrename.c
+++ b/gcc/regrename.c
@@ -1734,7 +1734,7 @@ copyprop_hardreg_forward (void)
       /* 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

diff --git a/gcc/rtl.h b/gcc/rtl.h
index 8967193d51f2c7933b30a45a21df4925de53acdd..33027e68f0e777cff81ba4fb0c588a87734f71b2 100644 (file)
--- a/gcc/rtl.h
+++ b/gcc/rtl.h
@@ -1742,7 +1742,7 @@ rtx alloc_EXPR_LIST                       (int, rtx, rtx);
 /* 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;

diff --git a/gcc/sched-rgn.c b/gcc/sched-rgn.c
index 0b89e35ee3ec4eedd1a4b7c0b0a66fc617957b16..f052f1b9938fda4d156d9b1cf86424cae2d2041a 100644 (file)
--- a/gcc/sched-rgn.c
+++ b/gcc/sched-rgn.c
@@ -2036,7 +2036,7 @@ add_branch_dependences (rtx head, rtx tail)
      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)

diff --git a/gcc/target.h b/gcc/target.h
index 10be23702695c8b26f130b605771e658a607dd43..c959656e6b2dd31a073dd48825002eb97a3815c6 100644 (file)
--- a/gcc/target.h
+++ b/gcc/target.h
@@ -207,7 +207,7 @@ struct gcc_target
        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);

diff --git a/gcc/value-prof.c b/gcc/value-prof.c
index 0cc3fe3128eea7d1edf33b63284640d1098a32cc..4f6f3da599a90b1c834b01ef4ddd8a24f224f484 100644 (file)
--- a/gcc/value-prof.c
+++ b/gcc/value-prof.c
@@ -132,7 +132,7 @@ insn_divmod_values_to_profile (rtx insn, unsigned *n_values,
          (*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 @@ divmod_fixed_value_transform (rtx insn)
   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;
 

diff --git a/gcc/web.c b/gcc/web.c
index 955d4733e3eb89d329c04dde6c257b728367d198..e846ee1d2fc7836a9141a938e16893d2310d9ac4 100644 (file)
--- a/gcc/web.c
+++ b/gcc/web.c
@@ -20,7 +20,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
 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