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] Fix ChangeLog entries and comment typos 1/3.

From: Volker Reichelt <reichelt at igpm dot rwth-aachen dot de>
To: gcc-patches at gcc dot gnu dot org
Date: Mon, 24 Jan 2005 23:17:19 +0100 (CET)
Subject: [patch] Fix ChangeLog entries and comment typos 1/3.
The following patch fixes a bunch of ChangeLog entries and
comment typos in gcc/gcc/.

Ok to apply to mainline?

Regards,
Volker


2005-01-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)
===================================================================
Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]