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,committed] Fix comment typos


The following three patches fix a couple of comment and ChangeLog typos.

Committed as obvious.

Regards,
Volker


2005-02-24  Volker Reichelt  <reichelt@igpm.rwth-aachen.de>

	* ChangeLog.5: Fix log message typo(s).
	* ChangeLog.7: Likewise.
	* ChangeLog.tree-ssa: Likewise.
	* cfgexpand.c: Fix comment typo(s).
	* conflict.c: Likewise.
	* defaults.h: Likewise.
	* dwarf2out.c: Likewise.
	* gcse.c: Likewise.
	* ggc-page.c: Likewise.
	* tree-eh.c: Likewise.
	* tree-ssa-dom.c: Likewise.

===================================================================
--- ChangeLog.5	19 Dec 2002 05:18:03 -0000	1.14
+++ ChangeLog.5	24 Jan 2005 12:32:29 -0000
@@ -3405,8 +3405,8 @@ Fri May 18 15:39:16 CEST 2001  Jan Hubic
 	what a basic block is, and what the various fields are used for.
 	* flow.c (calculate_globlal_regs_live): Add documentation about
 	how the algorithm works, and how we know that it will terminate.
-	Check that the the inductive assumption that guarantees
-	termination actually holds.
+	Check that the inductive assumption that guarantees termination
+	actually holds.
 	(mark_used_regs): Treat conditionally set registers as used.
 	(debug_regset): Add comment.
 	* rtl.texi (cond_exec): Add documentation.
===================================================================
--- ChangeLog.7	21 Nov 2003 06:52:22 -0000	1.6
+++ ChangeLog.7	24 Jan 2005 12:23:55 -0000
@@ -1717,7 +1717,7 @@ Tue Jun 11 21:53:37 CEST 2002  Jan Hubic
 	last insn created by the splitter.
 
 	* caller-save.c (init_caller_save): Move creation of SAVEINSN
-	and RESTINSN into into the scope of the sequence.
+	and RESTINSN into the scope of the sequence.
 
 	* mips.c (mips_expand_prologue): Use emit_jump_insn for trivial
 	RETURN insns.
===================================================================
--- ChangeLog.tree-ssa	13 May 2004 06:39:24 -0000	2.1
+++ ChangeLog.tree-ssa	24 Jan 2005 12:31:49 -0000
@@ -3420,7 +3420,7 @@
 
 	* tree-alias-common.c (find_func_aliases): Do not call
 	intra_function_call for languages assuring no aliasing between
-	arguments (by themselves) and and global memory.
+	arguments (by themselves) and global memory.
 
 2003-12-21  Jan Hubicka  <jh@suse.cz>
 
@@ -7693,7 +7693,7 @@
 	(finalize): Free allocations.
 	(cfg_blocks_empty): New. Is cfg_blocks queue list.
 	(cfg_blocks_add): New. Add a basic block to cfg_blocks list.
-	(cfg_blocks_pop): New. Get a a basic_block form the list.
+	(cfg_blocks_pop): New. Get a basic_block from the list.
 
 2003-09-18  Richard Henderson  <rth@redhat.com>
 
@@ -9565,7 +9565,7 @@
 	(optimize_stmt): Don't abort if a statement makes more than one
 	definition.
 	Check for MODIFY_EXPR statements directly, instead of relying on
-	the the presence of a single definition.
+	the presence of a single definition.
 	* tree-ssa-pre.c (tree_perform_ssapre): Call dump_function_to_file
 	instead of dump_function.
 	* tree-ssa.c (rewrite_into_ssa): Likewise.
@@ -15291,7 +15291,7 @@
 	* tree-ssa-dce (tree_ssa_eliminate_dead_code): Initialize prev to
 	NULL_TREE.
 	Don't close dump_file until end of function.
-	Dump the the tree after DCE for -fdump-tree-dce.
+	Dump the tree after DCE for -fdump-tree-dce.
 
 2002-10-08  Richard Henderson  <rth@redhat.com>
 	    Jason Merrill  <jason@redhat.com>
===================================================================
--- cfgexpand.c	24 Nov 2004 11:32:17 -0000	2.30
+++ cfgexpand.c	24 Jan 2005 12:28:03 -0000
@@ -1138,7 +1138,7 @@ expand_gimple_basic_block (basic_block b
 
   do_pending_stack_adjust ();
 
-  /* Find the the block tail.  The last insn is the block is the insn
+  /* Find the block tail.  The last insn in the block is the insn
      before a barrier and/or table jump insn.  */
   last = get_last_insn ();
   if (BARRIER_P (last))
===================================================================
--- conflict.c	9 Nov 2004 17:41:23 -0000	1.28
+++ conflict.c	24 Jan 2005 12:21:20 -0000
@@ -208,7 +208,7 @@ conflict_graph_add (conflict_graph graph
   arc->smaller = smaller;
   arc->larger = larger;
 
-  /* Link the conflict into into two lists, one for each reg.  */
+  /* Link the conflict into two lists, one for each reg.  */
   arc->smaller_next = graph->neighbor_heads[smaller];
   graph->neighbor_heads[smaller] = arc;
   arc->larger_next = graph->neighbor_heads[larger];
===================================================================
--- defaults.h	20 Dec 2004 02:08:53 -0000	1.165
+++ defaults.h	24 Jan 2005 12:28:45 -0000
@@ -761,7 +761,7 @@ do { fputs (integer_asm_op (POINTER_SIZE
 #define REGISTER_MOVE_COST(m, x, y) 2
 #endif
 
-/* Determine whether the the entire c99 runtime
+/* Determine whether the entire c99 runtime
    is present in the runtime library.  */
 #ifndef TARGET_C99_FUNCTIONS
 #define TARGET_C99_FUNCTIONS 0
===================================================================
--- dwarf2out.c	6 Jan 2005 14:49:31 -0000	1.566
+++ dwarf2out.c	24 Jan 2005 10:19:08 -0000
@@ -4117,7 +4117,7 @@ static char ranges_section_label[2 * MAX
 #endif
 
 /* We allow a language front-end to designate a function that is to be
-   called to "demangle" any name before it it put into a DIE.  */
+   called to "demangle" any name before it is put into a DIE.  */
 
 static const char *(*demangle_name_func) (const char *);
 
===================================================================
--- gcse.c	5 Jan 2005 23:19:18 -0000	1.326
+++ gcse.c	24 Jan 2005 10:14:32 -0000
@@ -4202,7 +4202,7 @@ pre_edge_insert (struct edge_list *edge_
 		    if (! occr->deleted_p)
 		      continue;
 
-		    /* Insert this expression on this edge if if it would
+		    /* Insert this expression on this edge if it would
 		       reach the deleted occurrence in BB.  */
 		    if (!TEST_BIT (inserted[e], j))
 		      {
@@ -5919,7 +5919,7 @@ find_loads (rtx x, rtx store_pattern, in
 
 /* Check if INSN kills the store pattern X (is aliased with it).
    AFTER is true if we are checking the case when store X occurs
-   after the insn.  Return true if it it does.  */
+   after the insn.  Return true if it does.  */
 
 static bool
 store_killed_in_insn (rtx x, rtx x_regs, rtx insn, int after)
===================================================================
--- ggc-page.c	22 Oct 2004 17:05:05 -0000	1.96
+++ ggc-page.c	24 Jan 2005 12:29:24 -0000
@@ -2212,8 +2212,7 @@ ggc_pch_write_object (struct ggc_pch_dat
       /* To speed small writes, we use a nulled-out array that's larger
          than most padding requests as the source for our null bytes.  This
          permits us to do the padding with fwrite() rather than fseek(), and
-         limits the chance the the OS may try to flush any outstanding
-         writes.  */
+         limits the chance the OS may try to flush any outstanding writes.  */
       if (padding <= sizeof(emptyBytes))
         {
           if (fwrite (emptyBytes, 1, padding, f) != padding)
===================================================================
--- tree-eh.c	4 Jan 2005 12:45:42 -0000	2.23
+++ tree-eh.c	24 Jan 2005 10:12:19 -0000
@@ -755,7 +755,7 @@ lower_try_finally_fallthru_label (struct
    alternative considered below.  For the nonce, we always choose the first
    option.
 
-   THIS_STATE may be null if if this is a try-cleanup, not a try-finally.  */
+   THIS_STATE may be null if this is a try-cleanup, not a try-finally.  */
 
 static void
 honor_protect_cleanup_actions (struct leh_state *outer_state,
===================================================================
--- tree-ssa-dom.c	28 Dec 2004 06:34:55 -0000	2.81
+++ tree-ssa-dom.c	24 Jan 2005 12:31:04 -0000
@@ -181,7 +181,7 @@ static struct opt_stats_d opt_stats;
    of the form SSA_NAME COND CONST we create a new vrp_element to record
    how the condition affects the possible values SSA_NAME may have.
 
-   Each record contains the condition tested (COND), and the the range of
+   Each record contains the condition tested (COND), and the range of
    values the variable may legitimately have if COND is true.  Note the
    range of values may be a smaller range than COND specifies if we have
    recorded other ranges for this variable.  Each record also contains the
@@ -1400,7 +1400,7 @@ record_cond (tree cond, tree value)
 
 /* Build a new conditional using NEW_CODE, OP0 and OP1 and store
    the new conditional into *p, then store a boolean_true_node
-   into the the *(p + 1).  */
+   into *(p + 1).  */
    
 static void
 build_and_record_new_cond (enum tree_code new_code, tree op0, tree op1, tree *p)
===================================================================


2005-02-24  Volker Reichelt  <reichelt@igpm.rwth-aachen.de>

	* call.c, class.c, cp-tree.h, decl2.c, error.c, init.c, mangle.c,
        parser.c: Fix comment typo(s).

===================================================================
--- cp/call.c	1 Jan 2005 01:43:12 -0000	1.526
+++ cp/call.c	24 Jan 2005 12:36:33 -0000
@@ -538,8 +538,7 @@ build_conv (conversion_kind code, tree t
 }
 
 /* Build a representation of the identity conversion from EXPR to
-   itself.  The TYPE should match the the type of EXPR, if EXPR is
-   non-NULL.  */
+   itself.  The TYPE should match the type of EXPR, if EXPR is non-NULL.  */
 
 static conversion *
 build_identity_conv (tree type, tree expr)
@@ -2450,7 +2449,7 @@ print_z_candidates (struct z_candidate *
 /* USER_SEQ is a user-defined conversion sequence, beginning with a
    USER_CONV.  STD_SEQ is the standard conversion sequence applied to
    the result of the conversion function to convert it to the final
-   desired type.  Merge the the two sequences into a single sequence,
+   desired type.  Merge the two sequences into a single sequence,
    and return the merged sequence.  */
 
 static conversion *
===================================================================
--- cp/class.c	6 Jan 2005 20:23:36 -0000	1.700
+++ cp/class.c	24 Jan 2005 12:35:39 -0000
@@ -3489,7 +3489,7 @@ layout_empty_base (tree binfo, tree eoc,
   return atend;
 }
 
-/* Layout the the base given by BINFO in the class indicated by RLI.
+/* Layout the base given by BINFO in the class indicated by RLI.
    *BASE_ALIGN is a running maximum of the alignments of
    any base class.  OFFSETS gives the location of empty base
    subobjects.  T is the most derived type.  Return nonzero if the new
@@ -4019,7 +4019,7 @@ check_bases_and_members (tree t)
   /* Nonzero if the implicitly generated copy constructor should take
      a non-const reference argument.  */
   int cant_have_const_ctor;
-  /* Nonzero if the the implicitly generated assignment operator
+  /* Nonzero if the implicitly generated assignment operator
      should take a non-const reference argument.  */
   int no_const_asn_ref;
   tree access_decls;
@@ -7675,8 +7675,8 @@ build_rtti_vtbl_entries (tree binfo, vtb
   *vid->last_init = build_tree_list (NULL_TREE, init);
   vid->last_init = &TREE_CHAIN (*vid->last_init);
 
-  /* Add the offset-to-top entry.  It comes earlier in the vtable that
-     the the typeinfo entry.  Convert the offset to look like a
+  /* Add the offset-to-top entry.  It comes earlier in the vtable than
+     the typeinfo entry.  Convert the offset to look like a
      function pointer, so that we can put it in the vtable.  */
   init = build_nop (vfunc_ptr_type_node, offset);
   *vid->last_init = build_tree_list (NULL_TREE, init);
===================================================================
--- cp/cp-tree.h	10 Jan 2005 19:37:05 -0000	1.1088
+++ cp/cp-tree.h	24 Jan 2005 12:35:07 -0000
@@ -1673,7 +1673,7 @@ struct lang_decl GTY(())
 
 /* Nonzero if NODE (a FUNCTION_DECL) is a destructor, but not the
    specialized in-charge constructor, in-charge deleting constructor,
-   or the the base destructor.  */
+   or the base destructor.  */
 #define DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P(NODE)			\
   (DECL_DESTRUCTOR_P (NODE) && !DECL_CLONED_FUNCTION_P (NODE))
 
@@ -2828,7 +2828,7 @@ struct lang_decl GTY(())
 
 /* Nonzero if this VAR_DECL or FUNCTION_DECL has already been
    instantiated, i.e. its definition has been generated from the
-   pattern given in the the template.  */
+   pattern given in the template.  */
 #define DECL_TEMPLATE_INSTANTIATED(NODE) \
   DECL_LANG_FLAG_1 (VAR_OR_FUNCTION_DECL_CHECK (NODE))
 
@@ -4408,7 +4408,7 @@ extern tree mangle_ref_init_variable    
 /* in dump.c */
 extern bool cp_dump_tree                         (void *, tree);
 
-/* in cp-simplify.c */
+/* in cp-gimplify.c */
 extern int cp_gimplify_expr		        (tree *, tree *, tree *);
 extern void cp_genericize			(tree);
 
===================================================================
--- cp/decl2.c	5 Jan 2005 10:02:11 -0000	1.764
+++ cp/decl2.c	24 Jan 2005 10:20:39 -0000
@@ -2477,7 +2477,7 @@ do_static_initialization (tree decl, tre
   if (init)
     finish_expr_stmt (init);
 
-  /* If we're using __cxa_atexit, register a a function that calls the
+  /* If we're using __cxa_atexit, register a function that calls the
      destructor for the object.  */
   if (flag_use_cxa_atexit)
     finish_expr_stmt (register_dtor_fn (decl));
===================================================================
--- cp/error.c	21 Dec 2004 17:54:23 -0000	1.275
+++ cp/error.c	24 Jan 2005 12:34:53 -0000
@@ -2203,7 +2203,7 @@ print_instantiation_full_context (diagno
       else
 	{
 	  if (current_function_decl == TINST_DECL (p))
-	    /* Avoid redundancy with the the "In function" line.  */;
+	    /* Avoid redundancy with the "In function" line.  */;
 	  else
 	    pp_verbatim (context->printer,
                          "%s: In instantiation of %qs:\n",
===================================================================
--- cp/init.c	1 Jan 2005 01:43:12 -0000	1.408
+++ cp/init.c	24 Jan 2005 10:20:18 -0000
@@ -1762,7 +1762,7 @@ build_new_1 (tree exp)
      from ELT_TYPE for a multi-dimensional array; ELT_TYPE is never an
      ARRAY_TYPE, but TYPE may be an ARRAY_TYPE.  */
   tree type;
-  /* A pointer type pointing to to the FULL_TYPE.  */
+  /* A pointer type pointing to the FULL_TYPE.  */
   tree full_pointer_type;
   tree outer_nelts = NULL_TREE;
   tree nelts = NULL_TREE;
===================================================================
--- cp/mangle.c	9 Nov 2004 10:12:36 -0000	1.115
+++ cp/mangle.c	24 Jan 2005 12:34:43 -0000
@@ -2230,7 +2230,7 @@ write_template_arg (tree node)
   MANGLE_TRACE_TREE ("template-arg", node);
 
   /* A template template parameter's argument list contains TREE_LIST
-     nodes of which the value field is the the actual argument.  */
+     nodes of which the value field is the actual argument.  */
   if (code == TREE_LIST)
     {
       node = TREE_VALUE (node);
===================================================================
--- cp/parser.c	6 Jan 2005 20:21:13 -0000	1.302
+++ cp/parser.c	24 Jan 2005 12:34:17 -0000
@@ -9488,7 +9488,7 @@ cp_parser_simple_type_specifier (cp_pars
    typedef-name:
      identifier
 
-   Returns a TYPE_DECL for the the type.  */
+   Returns a TYPE_DECL for the type.  */
 
 static tree
 cp_parser_type_name (cp_parser* parser)
@@ -14214,7 +14214,7 @@ cp_parser_lookup_name (cp_parser *parser
 	     lookup_member, we must enter the scope here.  */
 	  if (dependent_p)
 	    pushed_scope = push_scope (parser->scope);
-	  /* If the PARSER->SCOPE is a a template specialization, it
+	  /* If the PARSER->SCOPE is a template specialization, it
 	     may be instantiated during name lookup.  In that case,
 	     errors may be issued.  Even if we rollback the current
 	     tentative parse, those errors are valid.  */
===================================================================


2005-02-24  Volker Reichelt  <reichelt@igpm.rwth-aachen.de>

	* decl.c, resolve.c, trans-array.c, trans.h: Fix comment typo(s).

===================================================================
--- fortran/decl.c	3 Jan 2005 21:43:49 -0000	1.28
+++ fortran/decl.c	24 Jan 2005 10:18:30 -0000
@@ -27,7 +27,7 @@ Software Foundation, 59 Temple Place - S
 #include "parse.h"
 
 
-/* This flag is set if a an old-style length selector is matched
+/* This flag is set if an old-style length selector is matched
    during a type-declaration statement.  */
 
 static int old_char_selector;
===================================================================
--- fortran/resolve.c	3 Jan 2005 21:43:50 -0000	1.25
+++ fortran/resolve.c	24 Jan 2005 10:17:48 -0000
@@ -898,8 +898,8 @@ set_type:
 }
 
 
-/* Figure out if if a function reference is pure or not.  Also sets the name
-   of the function for a potential error message.  Returns nonzero if the
+/* Figure out if a function reference is pure or not.  Also set the name
+   of the function for a potential error message.  Return nonzero if the
    function is PURE, zero if not.  */
 
 static int
===================================================================
--- fortran/trans-array.c	3 Jan 2005 21:43:54 -0000	1.32
+++ fortran/trans-array.c	24 Jan 2005 10:15:36 -0000
@@ -1271,7 +1271,7 @@ gfc_conv_ss_descriptor (stmtblock_t * bl
       /* Also the data pointer.  */
       tmp = gfc_conv_array_data (se.expr);
       /* If this is a variable or address of a variable we use it directly.
-         Otherwise we must evaluate it now to to avoid break dependency
+         Otherwise we must evaluate it now to avoid breaking dependency
 	 analysis by pulling the expressions for elemental array indices
 	 inside the loop.  */
       if (!(DECL_P (tmp)
===================================================================
--- fortran/trans.h	16 Nov 2004 02:02:37 -0000	1.21
+++ fortran/trans.h	24 Jan 2005 12:37:32 -0000
@@ -118,7 +118,7 @@ typedef enum
      scalarization loop.  */
   GFC_SS_SCALAR,
 
-  /* Like GFC_SS_SCALAR except it evaluates a pointer the the expression.
+  /* Like GFC_SS_SCALAR except it evaluates a pointer to the expression.
      Used for elemental function parameters.  */
   GFC_SS_REFERENCE,
 
===================================================================



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