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-03-20  Kazu Hirata  <kazu@cs.umass.edu>

	* c-common.c, cfgcleanup.c, cgraphunit.c, c-pretty-print.c,
	expmed.c, ggc-common.c, jump.c, passes.c, recog.c, regmove.c,
	reorg.c, tree.h: Fix comment typos.

Index: c-common.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-common.c,v
retrieving revision 1.491
diff -u -p -r1.491 c-common.c
--- c-common.c	20 Mar 2004 04:52:50 -0000	1.491
+++ c-common.c	20 Mar 2004 05:15:53 -0000
@@ -2229,7 +2229,7 @@ shorten_compare (tree *op0_ptr, tree *op
 					       TREE_TYPE (primop0));
 
       /* In C, if TYPE is an enumeration, then we need to get its
-	 min/max values from it's underlying integral type, not the
+	 min/max values from its underlying integral type, not the
 	 enumerated type itself.  In C++, TYPE_MAX_VALUE and
 	 TYPE_MIN_VALUE have already been set correctly on the
 	 enumeration type.  */
Index: cfgcleanup.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cfgcleanup.c,v
retrieving revision 1.109
diff -u -p -r1.109 cfgcleanup.c
--- cfgcleanup.c	6 Mar 2004 01:21:26 -0000	1.109
+++ cfgcleanup.c	20 Mar 2004 05:15:57 -0000
@@ -23,7 +23,7 @@ Software Foundation, 59 Temple Place - S
    cleanup_cfg.  Following optimizations are performed:
 
    - Unreachable blocks removal
-   - Edge forwarding (edge to the forwarder block is forwarded to it's
+   - Edge forwarding (edge to the forwarder block is forwarded to its
      successor.  Simplification of the branch instruction is performed by
      underlying infrastructure so branch can be converted to simplejump or
      eliminated).
Index: cgraphunit.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cgraphunit.c,v
retrieving revision 1.53
diff -u -p -r1.53 cgraphunit.c
--- cgraphunit.c	14 Mar 2004 22:26:00 -0000	1.53
+++ cgraphunit.c	20 Mar 2004 05:16:00 -0000
@@ -398,7 +398,7 @@ cgraph_finalize_compilation_unit (void)
       cgraph_nodes_queue = cgraph_nodes_queue->next_needed;
 
       /* ??? It is possible to create extern inline function and later using
-	 weak alas attribute to kill it's body. See
+	 weak alas attribute to kill its body. See
 	 gcc.c-torture/compile/20011119-1.c  */
       if (!DECL_SAVED_TREE (decl))
 	continue;
@@ -1508,7 +1508,7 @@ cgraph_inline_p (tree caller_decl, tree 
    Attempt to topologically sort the nodes so function is output when
    all called functions are already assembled to allow data to be
    propagated across the callgraph.  Use a stack to get smaller distance
-   between a function and it's callees (later we may choose to use a more
+   between a function and its callees (later we may choose to use a more
    sophisticated algorithm for function reordering; we will likely want
    to use subsections to make the output functions appear in top-down
    order).  */
@@ -1543,7 +1543,7 @@ cgraph_expand_all_functions (void)
 /* Mark all local functions.
 
    A local function is one whose calls can occur only in the
-   current compilation unit and all it's calls are explicit,
+   current compilation unit and all its calls are explicit,
    so we can change its calling convention.
    We simply mark all static functions whose address is not taken
    as local.  */
Index: c-pretty-print.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-pretty-print.c,v
retrieving revision 1.38
diff -u -p -r1.38 c-pretty-print.c
--- c-pretty-print.c	15 Mar 2004 10:32:41 -0000	1.38
+++ c-pretty-print.c	20 Mar 2004 05:16:03 -0000
@@ -932,7 +932,7 @@ pp_c_constant (c_pretty_printer *pp, tre
     }
 }
 
-/* Pretty-print an IDENTIFIER_NODE, precedeed by whitespace is necessary.  */
+/* Pretty-print an IDENTIFIER_NODE, preceded by whitespace is necessary.  */
 
 void
 pp_c_identifier (c_pretty_printer *pp, const char *id)
Index: expmed.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/expmed.c,v
retrieving revision 1.152
diff -u -p -r1.152 expmed.c
--- expmed.c	19 Mar 2004 09:59:00 -0000	1.152
+++ expmed.c	20 Mar 2004 05:16:12 -0000
@@ -2409,7 +2409,7 @@ synth_mult (struct algorithm *alg_out, u
 	  alg_out->ops * sizeof *alg_out->log);
 }
 
-/* Find the cheapeast way of multiplying a value of mode MODE by VAL.
+/* Find the cheapest way of multiplying a value of mode MODE by VAL.
    Try three variations:
 
        - a shift/add sequence based on VAL itself
Index: ggc-common.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/ggc-common.c,v
retrieving revision 1.85
diff -u -p -r1.85 ggc-common.c
--- ggc-common.c	11 Mar 2004 03:19:03 -0000	1.85
+++ ggc-common.c	20 Mar 2004 05:16:14 -0000
@@ -615,7 +615,7 @@ default_gt_pch_use_address (void *base, 
 #if HAVE_MMAP_FILE
 /* Default version of HOST_HOOKS_GT_PCH_GET_ADDRESS when mmap is present.
    We temporarily allocate SIZE bytes, and let the kernel place the data
-   whereever it will.  If it worked, that's our spot, if not we're likely
+   wherever it will.  If it worked, that's our spot, if not we're likely
    to be in trouble.  */
 
 void *
@@ -793,9 +793,10 @@ loc_descriptor (const char *name, int li
   return *slot;
 }
 
-/* Record ALLOCATED and OVERHEAD bytes to descritor NAME:LINE (FUNCTION).  */
-void ggc_record_overhead (size_t allocated, size_t overhead,
-			  const char *name, int line, const char *function)
+/* Record ALLOCATED and OVERHEAD bytes to descriptor NAME:LINE (FUNCTION).  */
+void
+ggc_record_overhead (size_t allocated, size_t overhead,
+		     const char *name, int line, const char *function)
 {
   struct loc_descriptor *loc = loc_descriptor (name, line, function);
 
Index: jump.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/jump.c,v
retrieving revision 1.242
diff -u -p -r1.242 jump.c
--- jump.c	15 Mar 2004 18:51:53 -0000	1.242
+++ jump.c	20 Mar 2004 05:16:17 -0000
@@ -645,9 +645,9 @@ reversed_comparison_code_parts (enum rtx
   if (mode == VOIDmode)
     mode = GET_MODE (arg1);
 
-  /* First see if machine description supply us way to reverse the comparison.
-     Give it priority over everything else to allow machine description to do
-     tricks.  */
+  /* First see if machine description supplies us way to reverse the
+     comparison.  Give it priority over everything else to allow
+     machine description to do tricks.  */
   if (GET_MODE_CLASS (mode) == MODE_CC
       && REVERSIBLE_CC_MODE (mode))
     {
Index: passes.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/passes.c,v
retrieving revision 2.6
diff -u -p -r2.6 passes.c
--- passes.c	20 Mar 2004 04:52:57 -0000	2.6
+++ passes.c	20 Mar 2004 05:16:21 -0000
@@ -1677,7 +1677,7 @@ rest_of_compilation (tree decl)
 
 #ifdef SETJMP_VIA_SAVE_AREA
   /* This must be performed before virtual register instantiation.
-     Please be aware the everything in the compiler that can look
+     Please be aware that everything in the compiler that can look
      at the RTL up to this point must understand that REG_SAVE_AREA
      is just like a use of the REG contained inside.  */
   if (current_function_calls_alloca)
Index: recog.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/recog.c,v
retrieving revision 1.199
diff -u -p -r1.199 recog.c
--- recog.c	3 Mar 2004 08:34:33 -0000	1.199
+++ recog.c	20 Mar 2004 05:16:27 -0000
@@ -1591,7 +1591,7 @@ decode_asm_operands (rtx body, rtx *oper
   return template;
 }
 
-/* Check if an asm_operand matches it's constraints.
+/* Check if an asm_operand matches its constraints.
    Return > 0 if ok, = 0 if bad, < 0 if inconclusive.  */
 
 int
Index: regmove.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/regmove.c,v
retrieving revision 1.156
diff -u -p -r1.156 regmove.c
--- regmove.c	3 Mar 2004 08:34:33 -0000	1.156
+++ regmove.c	20 Mar 2004 05:16:31 -0000
@@ -291,7 +291,7 @@ mark_flags_life_zones (rtx flags)
 #endif
 	      PUT_MODE (insn, (live ? HImode : VOIDmode));
 
-	      /* In either case, birth is denoted simply by it's presence
+	      /* In either case, birth is denoted simply by its presence
 		 as the destination of a set.  */
 	      flags_set_1_set = 0;
 	      note_stores (PATTERN (insn), flags_set_1, NULL);
Index: reorg.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/reorg.c,v
retrieving revision 1.92
diff -u -p -r1.92 reorg.c
--- reorg.c	22 Feb 2004 22:33:12 -0000	1.92
+++ reorg.c	20 Mar 2004 05:16:39 -0000
@@ -3170,7 +3170,7 @@ relax_delay_slots (rtx first)
 
       /* See if we have a RETURN insn with a filled delay slot followed
 	 by a RETURN insn with an unfilled a delay slot.  If so, we can delete
-	 the first RETURN (but not it's delay insn).  This gives the same
+	 the first RETURN (but not its delay insn).  This gives the same
 	 effect in fewer instructions.
 
 	 Only do so if optimizing for size since this results in slower, but
Index: tree.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree.h,v
retrieving revision 1.480
diff -u -p -r1.480 tree.h
--- tree.h	19 Mar 2004 21:09:45 -0000	1.480
+++ tree.h	20 Mar 2004 05:16:46 -0000
@@ -1000,7 +1000,7 @@ struct tree_block GTY(())
 /* See tree.def for documentation of the use of these fields.
    Look at the documentation of the various ..._TYPE tree codes.
 
-   Note that the type.values, type.minval, and type.maxval fiels are
+   Note that the type.values, type.minval, and type.maxval fields are
    overloaded and used for different macros in different kinds of types.
    Each macro must check to ensure the tree node is of the proper kind of
    type.  Note also that some of the front-ends also overload these fields,


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