* c-common.h: Fix comment typos.

	* c-decl.c: Likewise.
	* cgraphunit.c: Likewise.
	* combine.c: Likewise.
	* et-forest.c: Likewise.
	* flow.c: Likewise.
	* function.c: Likewise.
	* ifcvt.c: Likewise.
	* integrate.c: Likewise.
	* jump.c: Likewise.
	* postreload.c: Likewise.
	* varray.c: Likewise.


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

13 files changed, 31 insertions, 16 deletions

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 81421e4b8d2..0fcc6d95968 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,5 +1,20 @@
 2004-01-24  Kazu Hirata  <kazu@cs.umass.edu>
 
+	* c-common.h: Fix comment typos.
+	* c-decl.c: Likewise.
+	* cgraphunit.c: Likewise.
+	* combine.c: Likewise.
+	* et-forest.c: Likewise.
+	* flow.c: Likewise.
+	* function.c: Likewise.
+	* ifcvt.c: Likewise.
+	* integrate.c: Likewise.
+	* jump.c: Likewise.
+	* postreload.c: Likewise.
+	* varray.c: Likewise.
+
+2004-01-24  Kazu Hirata  <kazu@cs.umass.edu>
+
 	* doc/frontends.texi: Update copyright.
 	* doc/gcov.texi: Likewise.
 	* doc/gty.texi: Likewise.
diff --git a/gcc/c-common.h b/gcc/c-common.h
index 82c0b1529e8..aec0fc569e0 100644
--- a/gcc/c-common.h
+++ b/gcc/c-common.h
@@ -206,7 +206,7 @@ struct c_common_identifier GTY(())
 
 #define default_function_type		c_global_trees[CTI_DEFAULT_FUNCTION_TYPE]
 
-/* g77 integer types, which which must be kept in sync with f/com.h */
+/* g77 integer types, which must be kept in sync with f/com.h */
 #define g77_integer_type_node		c_global_trees[CTI_G77_INTEGER_TYPE]
 #define g77_uinteger_type_node		c_global_trees[CTI_G77_UINTEGER_TYPE]
 #define g77_longint_type_node		c_global_trees[CTI_G77_LONGINT_TYPE]
diff --git a/gcc/c-decl.c b/gcc/c-decl.c
index 3af82f4b7c7..6dd6bc09272 100644
--- a/gcc/c-decl.c
+++ b/gcc/c-decl.c
@@ -792,7 +792,7 @@ match_builtin_function_types (tree newtype, tree oldtype)
   return build_type_attribute_variant (trytype, TYPE_ATTRIBUTES (oldtype));
 }
 
-/* Subroutine of diagnose_mismathed_decls.  Check for function type
+/* Subroutine of diagnose_mismatched_decls.  Check for function type
    mismatch involving an empty arglist vs a nonempty one and give clearer
    diagnostics. */
 static void
diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index a883ebf6728..3a7dcb3a4dc 100644
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -844,7 +844,7 @@ cgraph_remove_unreachable_nodes (void)
   /* Remove unreachable nodes.  Extern inline functions need special care;
      Unreachable extern inline functions shall be removed.
      Reachable extern inline functions we never inlined shall get their bodies
-     elliminated
+     eliminated.
      Reachable extern inline functions we sometimes inlined will be turned into
      unanalyzed nodes so they look like for true extern functions to the rest
      of code.  */
diff --git a/gcc/combine.c b/gcc/combine.c
index b2d776902ef..f84c277b239 100644
--- a/gcc/combine.c
+++ b/gcc/combine.c
@@ -2467,7 +2467,7 @@ try_combine (rtx i3, rtx i2, rtx i1, int *new_direct_jump_p)
 			undobuf.other_insn, NULL_RTX);
     }
 #ifdef HAVE_cc0
-  /* If I2 is the setter CC0 and I3 is the user CC0 then check whether
+  /* If I2 is the CC0 setter and I3 is the CC0 user then check whether
      they are adjacent to each other or not.  */
   {
     rtx p = prev_nonnote_insn (i3);
diff --git a/gcc/et-forest.c b/gcc/et-forest.c
index 62cdd2107d3..77194c63068 100644
--- a/gcc/et-forest.c
+++ b/gcc/et-forest.c
@@ -37,7 +37,7 @@ Boston, MA 02111-1307, USA.
 #include "basic-block.h"
 #endif
 
-/* The occurence of a node in the et tree.  */
+/* The occurrence of a node in the et tree.  */
 struct et_occ
 {
   struct et_node *of;		/* The node.  */
@@ -51,7 +51,7 @@ struct et_occ
   int min;			/* The minimum value of the depth in the subtree
 				   is obtained by adding sum of depth fields
 				   on the path to the root.  */
-  struct et_occ *min_occ;	/* The occurence in the subtree with the minimal
+  struct et_occ *min_occ;	/* The occurrence in the subtree with the minimal
 				   depth.  */
 };
 
@@ -112,7 +112,7 @@ set_next (struct et_occ *occ, struct et_occ *t)
     t->parent = occ;
 }
 
-/* Recompute minimum for occurence OCC.  */
+/* Recompute minimum for occurrence OCC.  */
 
 static inline void
 et_recomp_min (struct et_occ *occ)
@@ -310,7 +310,7 @@ check_path_after (struct et_occ *occ)
 
 #endif
 
-/* Splay the occurence OCC to the root of the tree.  */
+/* Splay the occurrence OCC to the root of the tree.  */
 
 static void
 et_splay (struct et_occ *occ)
@@ -452,7 +452,7 @@ et_splay (struct et_occ *occ)
 #endif
 }
 
-/* Create a new et tree occurence of NODE.  */
+/* Create a new et tree occurrence of NODE.  */
 
 static struct et_occ *
 et_new_occ (struct et_node *node)
diff --git a/gcc/flow.c b/gcc/flow.c
index c146310cb0a..dbd82503609 100644
--- a/gcc/flow.c
+++ b/gcc/flow.c
@@ -468,7 +468,7 @@ life_analysis (rtx f, FILE *file, int flags)
 
   free_basic_block_vars (1);
 
-  /* Removing dead insns should've made jumptables really dead.  */
+  /* Removing dead insns should have made jumptables really dead.  */
   delete_dead_jumptables ();
 }
 
diff --git a/gcc/function.c b/gcc/function.c
index 2cdcdd33e36..f4c90b5cdc3 100644
--- a/gcc/function.c
+++ b/gcc/function.c
@@ -269,7 +269,7 @@ static tree blocks_nreverse (tree);
 static int all_blocks (tree, tree *);
 static tree *get_block_vector (tree, int *);
 extern tree debug_find_var_in_block_tree (tree, tree);
-/* We always define `record_insns' even if its not used so that we
+/* We always define `record_insns' even if it's not used so that we
    can always export `prologue_epilogue_contains'.  */
 static void record_insns (rtx, varray_type *) ATTRIBUTE_UNUSED;
 static int contains (rtx, varray_type);
diff --git a/gcc/ifcvt.c b/gcc/ifcvt.c
index 2b10e18628e..ffcb0016298 100644
--- a/gcc/ifcvt.c
+++ b/gcc/ifcvt.c
@@ -1964,7 +1964,7 @@ noce_process_if_block (struct ce_if_block * ce_info)
     }
 
   /* Disallow the "if (...) x = a;" form (with an implicit "else x = x;")
-     for most optimizations if writing to x may trap, i.e. its a memory
+     for most optimizations if writing to x may trap, i.e. it's a memory
      other than a static var or a stack slot.  */
   if (! set_b
       && GET_CODE (orig_x) == MEM
diff --git a/gcc/integrate.c b/gcc/integrate.c
index d45bbfce2a5..82e8114214b 100644
--- a/gcc/integrate.c
+++ b/gcc/integrate.c
@@ -191,7 +191,7 @@ function_cannot_inline_p (tree fndecl)
   if (current_function_cannot_inline)
     return current_function_cannot_inline;
 
-  /* If its not even close, don't even look.  */
+  /* If it's not even close, don't even look.  */
   if (get_max_uid () > 3 * max_insns)
     return N_("function too large to be inline");
 
diff --git a/gcc/jump.c b/gcc/jump.c
index d2b53f8cf4b..f62d2629ccc 100644
--- a/gcc/jump.c
+++ b/gcc/jump.c
@@ -1051,7 +1051,7 @@ simplejump_p (rtx insn)
 /* Return nonzero if INSN is a (possibly) conditional jump
    and nothing more.
 
-   Use this function is deprecated, since we need to support combined
+   Use of this function is deprecated, since we need to support combined
    branch and compare insns.  Use any_condjump_p instead whenever possible.  */
 
 int
diff --git a/gcc/postreload.c b/gcc/postreload.c
index 6f567f07f9e..7b7e3d2cfdd 100644
--- a/gcc/postreload.c
+++ b/gcc/postreload.c
@@ -410,7 +410,7 @@ reload_cse_simplify_operands (rtx insn, rtx testreg)
 	{
 	  rtx set = single_set (insn);
 
-	  /* We might have multiple sets, some of which do implict
+	  /* We might have multiple sets, some of which do implicit
 	     extension.  Punt on this for now.  */
 	  if (! set)
 	    continue;
diff --git a/gcc/varray.c b/gcc/varray.c
index a4448d20e76..9c70b9f6dad 100644
--- a/gcc/varray.c
+++ b/gcc/varray.c
@@ -33,7 +33,7 @@
 
 #ifdef GATHER_STATISTICS
 
-/* Store infromation about each particular varray.  */
+/* Store information about each particular varray.  */
 struct varray_descriptor
 {
   const char *name;