c-cppbuiltin.c, [...]: Fix comment typos.

	* c-cppbuiltin.c, cgraph.c, domwalk.h, except.c, gimplify.c,
	lambda-code.c, postreload.c, predict.c, tree-sra.c,
	tree-ssa-loop-manip.c, tree.c: Fix comment typos.

From-SVN: r90596

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 481d95261f3dd8c7b384f1475c799aa13c322b1e..ef8f5357e35bc8dd355d54c4413558bcf33cc573 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -3,6 +3,10 @@
        * bitmap.c, bitmap.h, expmed.c, tree-cfg.c: Fix comment
        formatting.
 
+       * c-cppbuiltin.c, cgraph.c, domwalk.h, except.c, gimplify.c,
+       lambda-code.c, postreload.c, predict.c, tree-sra.c,
+       tree-ssa-loop-manip.c, tree.c: Fix comment typos.
+
 2004-11-13  Kelley Cook  <kcook@gcc.gnu.org>
 
        * doc/install.texi (automake): Correctly document that everything now 

diff --git a/gcc/c-cppbuiltin.c b/gcc/c-cppbuiltin.c
index a970df5d53837147dac6299bc63fec3bd9592527..cedf9e7a46e3e1fb3d3d266e5bbbfca3ba72e435 100644 (file)
--- a/gcc/c-cppbuiltin.c
+++ b/gcc/c-cppbuiltin.c
@@ -347,7 +347,7 @@ c_cpp_builtins (cpp_reader *pfile)
        different from system to system.  */
     builtin_define_with_int_value ("__GXX_ABI_VERSION", 999999);
   else if (flag_abi_version == 1)
-    /* Due to an historical accident, this version had the value
+    /* Due to a historical accident, this version had the value
        "102".  */
     builtin_define_with_int_value ("__GXX_ABI_VERSION", 102);
   else

diff --git a/gcc/cgraph.c b/gcc/cgraph.c
index 0908b6a02eb76511823840ccbb7ae4abaa51ccc5..8a570b394a1ac6a7748adb630a345da046aec9f3 100644 (file)
--- a/gcc/cgraph.c
+++ b/gcc/cgraph.c
@@ -44,7 +44,7 @@ The callgraph:
 
     The callgraph at the moment does not represent indirect calls or calls
     from other compilation unit.  Flag NEEDED is set for each node that may
-    be accessed in such a invisible way and it shall be considered an
+    be accessed in such an invisible way and it shall be considered an
     entry point to the callgraph.
 
     Intraprocedural information:

diff --git a/gcc/domwalk.h b/gcc/domwalk.h
index b8f31f57eac69c5094914fbbad49d526fdaafac2..fbf549bbd9842ad0dc2cc5ca2c10c12f9d538a00 100644 (file)
--- a/gcc/domwalk.h
+++ b/gcc/domwalk.h
@@ -55,7 +55,7 @@ struct dom_walk_data
   /* Function to call before the statement walk occurring before the
      recursive walk of the dominator children. 
 
-     This typically initializes an block local data and pushes that
+     This typically initializes a block local data and pushes that
      data onto BLOCK_DATA_STACK.  */
   void (*before_dom_children_before_stmts) (struct dom_walk_data *,
                                            basic_block);

diff --git a/gcc/except.c b/gcc/except.c
index 71fc01153a6285c20d99fbd25b11c5a5e5f27104..c399eb11f7d715906853373bcada5ce9f3cb20a9 100644 (file)
--- a/gcc/except.c
+++ b/gcc/except.c
@@ -1304,7 +1304,7 @@ emit_to_new_bb_before (rtx seq, rtx insn)
   edge e;
   edge_iterator ei;
 
-  /* If there happens to be an fallthru edge (possibly created by cleanup_cfg
+  /* If there happens to be a fallthru edge (possibly created by cleanup_cfg
      call), we don't want it to go into newly created landing pad or other EH 
      construct.  */
   for (ei = ei_start (BLOCK_FOR_INSN (insn)->preds); (e = ei_safe_edge (ei)); )

diff --git a/gcc/gimplify.c b/gcc/gimplify.c
index 3d8ecdfd98e7f37a63e3dc1cc558ea973c0f4ca5..669ec9f127d842d6edad6254ec9a2dd0caf98959 100644 (file)
--- a/gcc/gimplify.c
+++ b/gcc/gimplify.c
@@ -724,7 +724,7 @@ unshare_expr (tree expr)
   return expr;
 }
 
-/* A terser interface for building a representation of a exception
+/* A terser interface for building a representation of an exception
    specification.  */
 
 tree

diff --git a/gcc/lambda-code.c b/gcc/lambda-code.c
index 0d066b936dfdaf1c752b9274e279587537c38707..08f963e534b29e71de9020d7eca5c0dadbd53636 100644 (file)
--- a/gcc/lambda-code.c
+++ b/gcc/lambda-code.c
@@ -53,7 +53,7 @@
 
  A loop iteration space represents the points traversed by the loop.  A point in the
  iteration space can be represented by a vector of size <loop depth>.  You can
- therefore represent the iteration space as a integral combinations of a set
+ therefore represent the iteration space as an integral combinations of a set
  of basis vectors. 
 
  A loop iteration space is dense if every integer point between the loop

diff --git a/gcc/postreload.c b/gcc/postreload.c
index 2ff95b1a4a71c6d59993d79f7f3bd8158b818f8a..14dc71268837ed7b8723863ee358e09fd65e702e 100644 (file)
--- a/gcc/postreload.c
+++ b/gcc/postreload.c
@@ -427,7 +427,7 @@ reload_cse_simplify_operands (rtx insn, rtx testreg)
             extension.  Punt on this for now.  */
          if (! set)
            continue;
-         /* If the destination is a also MEM or a STRICT_LOW_PART, no
+         /* If the destination is also a MEM or a STRICT_LOW_PART, no
             extension applies.
             Also, if there is an explicit extension, we don't have to
             worry about an implicit one.  */

diff --git a/gcc/predict.c b/gcc/predict.c
index 7be6b90fc3b807c95a4f27be997c42b0281af064..944a5565f22c688929e23b179b2bf2f6aa742a0e 100644 (file)
--- a/gcc/predict.c
+++ b/gcc/predict.c
@@ -919,7 +919,7 @@ expr_expected_value (tree expr, bitmap visited)
 
              /* If this PHI has itself as an argument, we cannot
                 determine the string length of this argument.  However,
-                if we can find a expected constant value for the other
+                if we can find an expected constant value for the other
                 PHI args then we can still be sure that this is
                 likely a constant.  So be optimistic and just
                 continue with the next argument.  */

diff --git a/gcc/tree-sra.c b/gcc/tree-sra.c
index 561585babaa74e2d3ae4788e9ac4f430bde6543f..91314a5c83d2a0bb86f3d8c6357f4836f50aa8ea 100644 (file)
--- a/gcc/tree-sra.c
+++ b/gcc/tree-sra.c
@@ -620,7 +620,7 @@ struct sra_walk_fns
 };
 
 #ifdef ENABLE_CHECKING
-/* Invoked via walk_tree, if *TP contains an candidate decl, return it.  */
+/* Invoked via walk_tree, if *TP contains a candidate decl, return it.  */
 
 static tree
 sra_find_candidate_decl (tree *tp, int *walk_subtrees,

diff --git a/gcc/tree-ssa-loop-manip.c b/gcc/tree-ssa-loop-manip.c
index 99e1031ca8b78d4b470f550cf65727f00c8a2313..22324949e9bfa5e248076117475929fc9e7cc4e0 100644 (file)
--- a/gcc/tree-ssa-loop-manip.c
+++ b/gcc/tree-ssa-loop-manip.c
@@ -681,7 +681,7 @@ lv_adjust_loop_header_phi (basic_block first, basic_block second,
 
 /* Adjust entry edge for lv.
    
-  e is a incoming edge. 
+  e is an incoming edge. 
 
   --- edge e ---- > [second_head]
 

diff --git a/gcc/tree.c b/gcc/tree.c
index 8774107e3d558572b5a9ac3df78b2603bbcfb678..a05dab73f73b1dd29c62d4344c131bfabe5a5649 100644 (file)
--- a/gcc/tree.c
+++ b/gcc/tree.c
@@ -4054,7 +4054,7 @@ associative_tree_code (enum tree_code code)
   return false;
 }
 
-/* Return true if CODE represents an commutative tree code.  Otherwise
+/* Return true if CODE represents a commutative tree code.  Otherwise
    return false.  */
 bool
 commutative_tree_code (enum tree_code code)