cfgexpand.c, [...]: Fix comment typos.

gcc/
	* cfgexpand.c, tree-cfg.c, tree-inline.c, tree-optimize.c,
	tree-ssa-forwprop.c: Fix comment typos.
	* doc/invoke.texi: Fix a typo.

cp/
	* parser.c: Fix comment typos.

From-SVN: r99944

gcc/ChangeLog

+2005-05-19  Kazu Hirata  <kazu@cs.umass.edu>
+
+	* cfgexpand.c, tree-cfg.c, tree-inline.c, tree-optimize.c,
+	tree-ssa-forwprop.c: Fix comment typos.
+	* doc/invoke.texi: Fix a typo.
+
 2005-05-18  Richard Henderson  <rth@redhat.com>
 
 	* config.gcc (powerpc-*-linux*): Include linux64.opt when

gcc/cfgexpand.c

@@ -597,7 +597,7 @@ expand_one_register_var (tree var)
 }
 
 /* A subroutine of expand_one_var.  Called to assign rtl to a VAR_DECL that
-   has some associated error, e.g. it's type is error-mark.  We just need
+   has some associated error, e.g. its type is error-mark.  We just need
    to pick something that won't crash the rest of the compiler.  */
 
 static void

gcc/cp/ChangeLog

+2005-05-19  Kazu Hirata  <kazu@cs.umass.edu>
+
+	* parser.c: Fix comment typos.
+
 2005-05-18  Geoffrey Keating  <geoffk@apple.com>
 
 	* Make-lang.in (cc1plus-dummy): New.

gcc/cp/parser.c

@@ -9687,7 +9687,7 @@ cp_parser_simple_type_specifier (cp_parser* parser,
 	  tree qual_type = objc_get_protocol_qualified_type (type, protos);
 
 	  /* Clobber the "unqualified" type previously entered into
-	     DECL_SPECS with the new, improved protocol-qualifed version.  */
+	     DECL_SPECS with the new, improved protocol-qualified version.  */
 	  if (decl_specs)
 	    decl_specs->type = qual_type;
 
@@ -17015,7 +17015,7 @@ cp_parser_objc_protocol_declaration (cp_parser* parser)
       goto finish;
     }
 
-  /* See if we have a foward declaration or a definition.  */
+  /* See if we have a forward declaration or a definition.  */
   tok = cp_lexer_peek_nth_token (parser->lexer, 2);
   
   /* Try a forward declaration first.  */

gcc/doc/invoke.texi

@@ -1937,7 +1937,7 @@ support for invoking the @code{- (id) .cxx_construct} and
 @item -fobjc-direct-dispatch
 @opindex fobjc-direct-dispatch
 Allow fast jumps to the message dispatcher.  On Darwin this is
-accompilished via the comm page.
+accomplished via the comm page.
 
 @item -fobjc-exceptions
 @opindex fobjc-exceptions

gcc/tree-cfg.c

@@ -1359,7 +1359,7 @@ replace_uses_by (tree name, tree val)
      x = w * w;
 
      If we performed the update in the first loop, the statement
-     would be rescanned after first occurence of w is replaced,
+     would be rescanned after first occurrence of w is replaced,
      the new uses would be placed to the beginning of the list,
      and we would never process them.  */
   for (i = 0; VEC_iterate (tree, stmts, i, stmt); i++)
@@ -1398,7 +1398,7 @@ tree_merge_blocks (basic_block a, basic_block b)
 	{
 	  gcc_assert (is_gimple_reg (def));
 
-	  /* Note that just emiting the copies is fine -- there is no problem
+	  /* Note that just emitting the copies is fine -- there is no problem
 	     with ordering of phi nodes.  This is because A is the single
 	     predecessor of B, therefore results of the phi nodes cannot
 	     appear as arguments of the phi nodes.  */

gcc/tree-inline.c

@@ -513,7 +513,7 @@ copy_body_r (tree *tp, int *walk_subtrees, void *data)
       if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
 	{
 	  /* Replace the RETURN_EXPR with (a copy of) the
-	     MODIFY_EXPR hangning underneath.  */
+	     MODIFY_EXPR hanging underneath.  */
 	  *tp = copy_node (assignment);
 	}
       else /* Else the RETURN_EXPR returns no value.  */
@@ -626,7 +626,7 @@ copy_body_r (tree *tp, int *walk_subtrees, void *data)
 	  && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (*tp))))
 	TREE_BLOCK (*tp) = id->block;
 
-      /* We're duplicationg a CALL_EXPR.  Find any corresponding
+      /* We're duplicating a CALL_EXPR.  Find any corresponding
 	 callgraph edges and update or duplicate them.  */
       if (TREE_CODE (*tp) == CALL_EXPR && id->node && get_callee_fndecl (*tp))
 	{
@@ -750,9 +750,9 @@ copy_bb (inline_data *id, basic_block bb, int frequency_scale, int count_scale)
   return copy_basic_block;
 }
 
-/* Copy edges from BB into it's copy constructed ealier, scale profile
-   accordingly.  Edges will be taken care of
-   later.  Assume aux pointers to point to the copies of each BB  */
+/* Copy edges from BB into its copy constructed earlier, scale profile
+   accordingly.  Edges will be taken care of later.  Assume aux
+   pointers to point to the copies of each BB.  */
 static void
 copy_edges_for_bb (basic_block bb, int count_scale)
 {
@@ -770,7 +770,7 @@ copy_edges_for_bb (basic_block bb, int count_scale)
 
       flags = old_edge->flags;
 
-      /* Return edges do get a FALLTHU flag when the get inlined.  */
+      /* Return edges do get a FALLTHRU flag when the get inlined.  */
       if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
 	  && old_edge->dest->aux != EXIT_BLOCK_PTR)
 	flags |= EDGE_FALLTHRU;
@@ -885,7 +885,7 @@ copy_cfg_body (inline_data * id, gcov_type count, int frequency,
   id->callee_cfun = cfun_to_copy;
 
   /* If saving or cloning a function body, create new basic_block_info
-     and label_to_block_maps.  Otherwise, we're duplicaing a function
+     and label_to_block_maps.  Otherwise, we're duplicating a function
      body for inlining; insert our new blocks and labels into the
      existing varrays.  */
   saving_or_cloning = (id->saving_p || id->cloning_p);
@@ -1084,7 +1084,7 @@ setup_one_parameter (inline_data *id, tree p, tree value, tree fn,
       /* If we did not create a gimple value and we did not create a gimple
 	 cast of a gimple value, then we will need to gimplify INIT_STMTS
 	 at the end.  Note that is_gimple_cast only checks the outer
-	 tree code, not its operand.  Thus the explicit check that it's
+	 tree code, not its operand.  Thus the explicit check that its
 	 operand is a gimple value.  */
       if (!is_gimple_val (rhs)
 	  && (!is_gimple_cast (rhs)
@@ -1591,7 +1591,7 @@ estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
 
     /* We don't account constants for now.  Assume that the cost is amortized
        by operations that do use them.  We may re-consider this decision once
-       we are able to optimize the tree before estimating it's size and break
+       we are able to optimize the tree before estimating its size and break
        out static initializers.  */
     case IDENTIFIER_NODE:
     case INTEGER_CST:
@@ -2231,7 +2231,7 @@ clone_body (tree clone, tree fn, void *arg_map)
 }
 
 /* Save duplicate body in FN.  MAP is used to pass around splay tree
-   used to update argments in restore_body.  */
+   used to update arguments in restore_body.  */
 
 /* Make and return duplicate of body in FN.  Put copies of DECL_ARGUMENTS
    in *arg_copy and of the static chain, if any, in *sc_copy.  */

gcc/tree-optimize.c

@@ -160,7 +160,7 @@ static struct tree_opt_pass pass_free_datastructures =
 };
 
 /* Pass: fixup_cfg - IPA passes or compilation of earlier functions might've
-   changed some properties - such as marged functions nothrow.  Remove now
+   changed some properties - such as marked functions nothrow.  Remove now
    redundant edges and basic blocks.  */
 
 static void

gcc/tree-ssa-forwprop.c

@@ -45,7 +45,7 @@ Boston, MA 02111-1307, USA.  */
    code.  One day we'll want to generalize this code.
 
    One class of common cases we handle is forward propagating a single use
-   variale into a COND_EXPR.  
+   variable into a COND_EXPR.  
 
      bb0:
        x = a COND b;