This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

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


Hi,

Committed as obvious.

Kazu Hirata

2004-11-13  Kazu Hirata  <kazu@cs.umass.edu>

	* 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.

Index: c-cppbuiltin.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-cppbuiltin.c,v
retrieving revision 1.25
diff -u -d -p -r1.25 c-cppbuiltin.c
--- c-cppbuiltin.c	3 Oct 2004 20:53:01 -0000	1.25
+++ c-cppbuiltin.c	13 Nov 2004 21:04:59 -0000
@@ -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
Index: cgraph.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cgraph.c,v
retrieving revision 1.60
diff -u -d -p -r1.60 cgraph.c
--- cgraph.c	8 Nov 2004 07:42:56 -0000	1.60
+++ cgraph.c	13 Nov 2004 21:04:59 -0000
@@ -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:
Index: domwalk.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/domwalk.h,v
retrieving revision 2.4
diff -u -d -p -r2.4 domwalk.h
--- domwalk.h	22 Oct 2004 17:05:05 -0000	2.4
+++ domwalk.h	13 Nov 2004 21:04:59 -0000
@@ -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);
Index: except.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/except.c,v
retrieving revision 1.293
diff -u -d -p -r1.293 except.c
--- except.c	13 Nov 2004 14:17:58 -0000	1.293
+++ except.c	13 Nov 2004 21:05:00 -0000
@@ -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)); )
Index: gimplify.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/gimplify.c,v
retrieving revision 2.84
diff -u -d -p -r2.84 gimplify.c
--- gimplify.c	23 Oct 2004 09:16:46 -0000	2.84
+++ gimplify.c	13 Nov 2004 21:05:02 -0000
@@ -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
Index: lambda-code.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/lambda-code.c,v
retrieving revision 2.18
diff -u -d -p -r2.18 lambda-code.c
--- lambda-code.c	3 Nov 2004 17:32:34 -0000	2.18
+++ lambda-code.c	13 Nov 2004 21:05:03 -0000
@@ -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
Index: postreload.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/postreload.c,v
retrieving revision 2.23
diff -u -d -p -r2.23 postreload.c
--- postreload.c	13 Sep 2004 09:05:31 -0000	2.23
+++ postreload.c	13 Nov 2004 21:05:03 -0000
@@ -427,7 +427,7 @@ reload_cse_simplify_operands (rtx insn, 
 	     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.  */
Index: predict.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/predict.c,v
retrieving revision 1.132
diff -u -d -p -r1.132 predict.c
--- predict.c	4 Nov 2004 10:10:27 -0000	1.132
+++ predict.c	13 Nov 2004 21:05:03 -0000
@@ -919,7 +919,7 @@ expr_expected_value (tree expr, bitmap v
 
 	      /* 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.  */
Index: tree-sra.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-sra.c,v
retrieving revision 2.41
diff -u -d -p -r2.41 tree-sra.c
--- tree-sra.c	4 Nov 2004 08:41:14 -0000	2.41
+++ tree-sra.c	13 Nov 2004 21:05:04 -0000
@@ -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,
Index: tree-ssa-loop-manip.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-loop-manip.c,v
retrieving revision 2.16
diff -u -d -p -r2.16 tree-ssa-loop-manip.c
--- tree-ssa-loop-manip.c	13 Nov 2004 07:13:48 -0000	2.16
+++ tree-ssa-loop-manip.c	13 Nov 2004 21:05:04 -0000
@@ -681,7 +681,7 @@ lv_adjust_loop_header_phi (basic_block f
 
 /* Adjust entry edge for lv.
    
-  e is a incoming edge. 
+  e is an incoming edge. 
 
   --- edge e ---- > [second_head]
 
Index: tree.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree.c,v
retrieving revision 1.446
diff -u -d -p -r1.446 tree.c
--- tree.c	13 Nov 2004 04:18:51 -0000	1.446
+++ tree.c	13 Nov 2004 21:05:06 -0000
@@ -4054,7 +4054,7 @@ associative_tree_code (enum tree_code co
   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)


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]