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 comment typos.


Hi,

Attached is a patch to fix comment typos.  Committed as obvious.

Kazu Hirata

2002-05-02  Kazu Hirata  <kazu@hxi.com>

	* combine.c: Fix typos.
	* expr.c: Likewise.
	* genautomata.c: Likewise.
	* stmt.c: Likewise.
	* tree.h: Likewise.

Index: combine.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/combine.c,v
retrieving revision 1.283
diff -u -r1.283 combine.c
--- combine.c	30 Apr 2002 00:38:23 -0000	1.283
+++ combine.c	2 May 2002 13:26:51 -0000
@@ -5600,7 +5600,7 @@
 
       len = GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0)));
       /* If the inner object has VOIDmode (the only way this can happen
-	 is if it is a ASM_OPERANDS), we can't do anything since we don't
+	 is if it is an ASM_OPERANDS), we can't do anything since we don't
 	 know how much masking to do.  */
       if (len == 0)
 	return x;
@@ -7076,7 +7076,7 @@
 	    }
 	}
 
-      /* If MASK is 1, convert this to a LSHIFTRT.  This can be done
+      /* If MASK is 1, convert this to an LSHIFTRT.  This can be done
 	 even if the shift count isn't a constant.  */
       if (mask == 1)
 	x = gen_binary (LSHIFTRT, GET_MODE (x), XEXP (x, 0), XEXP (x, 1));
@@ -7884,7 +7884,7 @@
     return const0_rtx;
 
   /* If VAROP is a NEG of something known to be zero or 1 and CONSTOP is
-     a power of two, we can replace this with a ASHIFT.  */
+     a power of two, we can replace this with an ASHIFT.  */
   if (GET_CODE (varop) == NEG && nonzero_bits (XEXP (varop, 0), mode) == 1
       && (i = exact_log2 (constop)) >= 0)
     return simplify_shift_const (NULL_RTX, ASHIFT, mode, XEXP (varop, 0), i);
@@ -9054,8 +9054,8 @@
 
       /* We simplify the tests below and elsewhere by converting
 	 ASHIFTRT to LSHIFTRT if we know the sign bit is clear.
-	 `make_compound_operation' will convert it to a ASHIFTRT for
-	 those machines (such as VAX) that don't have a LSHIFTRT.  */
+	 `make_compound_operation' will convert it to an ASHIFTRT for
+	 those machines (such as VAX) that don't have an LSHIFTRT.  */
       if (GET_MODE_BITSIZE (shift_mode) <= HOST_BITS_PER_WIDE_INT
 	  && code == ASHIFTRT
 	  && ((nonzero_bits (varop, shift_mode)
@@ -9228,7 +9228,7 @@
 
 	      /* If this was (ashiftrt (ashift foo C1) C2) and FOO has more
 		 than C1 high-order bits equal to the sign bit, we can convert
-		 this to either an ASHIFT or a ASHIFTRT depending on the
+		 this to either an ASHIFT or an ASHIFTRT depending on the
 		 two counts.
 
 		 We cannot do this if VAROP's mode is not SHIFT_MODE.  */
@@ -9628,7 +9628,7 @@
     x = simplify_shift_const (x, code, shift_mode, XEXP (x, 0),
 			      INTVAL (XEXP (x, 1)));
 
-  /* If we were doing a LSHIFTRT in a wider mode than it was originally,
+  /* If we were doing an LSHIFTRT in a wider mode than it was originally,
      turn off all the bits that the shift would have turned off.  */
   if (orig_code == LSHIFTRT && result_mode != shift_mode)
     x = simplify_and_const_int (NULL_RTX, shift_mode, x,
Index: expr.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/expr.c,v
retrieving revision 1.449
diff -u -r1.449 expr.c
--- expr.c	16 Apr 2002 06:09:39 -0000	1.449
+++ expr.c	2 May 2002 13:27:06 -0000
@@ -8906,7 +8906,7 @@
 		      == TREE_TYPE (exp)))));
 }
 
-/* Return the tree node if a ARG corresponds to a string constant or zero
+/* Return the tree node if an ARG corresponds to a string constant or zero
    if it doesn't.  If we return non-zero, set *PTR_OFFSET to the offset
    in bytes within the string that ARG is accessing.  The type of the
    offset will be `sizetype'.  */
Index: genautomata.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/genautomata.c,v
retrieving revision 1.4
diff -u -r1.4 genautomata.c
--- genautomata.c	29 Apr 2002 22:34:32 -0000	1.4
+++ genautomata.c	2 May 2002 13:27:15 -0000
@@ -1134,7 +1134,7 @@
   /* The following member has nonzero value if there is arc from state of
      the automaton marked by the ainsn.  */
   char arc_exists_p;
-  /* Cyclic list of insns of a equivalence class is formed with the
+  /* Cyclic list of insns of an equivalence class is formed with the
      aid of the following field.  */
   ainsn_t next_equiv_class_insn;
   /* The following field value is nonzero if the insn declaration is
@@ -1268,7 +1268,7 @@
    following.  */
 static vla_ptr_t decls;
 
-/* Given a pointer to a (char *) and a separator, return a alloc'ed
+/* Given a pointer to a (char *) and a separator, return an alloc'ed
    string containing the next separated element, taking parentheses
    into account if PAR_FLAG has nonzero value.  Advance the pointer to
    after the string scanned, or the end-of-string.  Return NULL if at
@@ -1471,7 +1471,7 @@
       }
 }
 
-/* Process a EXCLUSION_SET.  
+/* Process an EXCLUSION_SET.  
 
    This gives information about a cpu unit conflicts.  We fill a
    struct unit_rel_decl (excl) with information used later by
@@ -1550,7 +1550,7 @@
   num_dfa_decls++;
 }
 
-/* Process a ABSENCE_SET.  
+/* Process an ABSENCE_SET.  
 
    This gives information about a cpu unit reservation requirements.
    We fill a struct unit_rel_decl (absence) with information used
@@ -1618,7 +1618,7 @@
     }
 }
 
-/* Process a AUTOMATA_OPTION.  
+/* Process an AUTOMATA_OPTION.  
 
    This gives information how to generate finite state automaton used
    for recognizing pipeline hazards.  */
@@ -1859,7 +1859,7 @@
    Key of the table elements is name of given automaton.  Rememeber
    that automaton names have own space.  */
 
-/* The function evaluates hash value of a automaton declaration.  The
+/* The function evaluates hash value of an automaton declaration.  The
    function is used by abstract data `hashtab'.  The function returns
    hash value (0..UINT_MAX) of given automaton declaration.  */
 static unsigned
@@ -1961,7 +1961,7 @@
    define_insn_reservation).  Rememeber that insn names have own
    space.  */
 
-/* The function evaluates hash value of a insn declaration.  The
+/* The function evaluates hash value of an insn declaration.  The
    function is used by abstract data `hashtab'.  The function returns
    hash value (0..UINT_MAX) of given insn declaration.  */
 static unsigned
Index: stmt.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/stmt.c,v
retrieving revision 1.262
diff -u -r1.262 stmt.c
--- stmt.c	17 Apr 2002 01:47:20 -0000	1.262
+++ stmt.c	2 May 2002 13:27:21 -0000
@@ -204,7 +204,7 @@
 	  struct label_chain *label_chain;
 	  /* Number of function calls seen, as of start of this block.  */
 	  int n_function_calls;
-	  /* Nonzero if this is associated with a EH region.  */
+	  /* Nonzero if this is associated with an EH region.  */
 	  int exception_region;
 	  /* The saved target_temp_slot_level from our outer block.
 	     We may reset target_temp_slot_level to be the level of
@@ -5170,7 +5170,7 @@
 
       /* The time complexity of this code is normally O(N), where
 	 N being the number of members in the enumerated type.
-	 However, if type is a ENUMERAL_TYPE whose values do not
+	 However, if type is an ENUMERAL_TYPE whose values do not
 	 increase monotonically, O(N*log(N)) time may be needed.  */
 
       mark_seen_cases (type, cases_seen, size, sparseness);
Index: tree.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree.h,v
retrieving revision 1.332
diff -u -r1.332 tree.h
--- tree.h	29 Apr 2002 18:40:45 -0000	1.332
+++ tree.h	2 May 2002 13:27:25 -0000
@@ -667,7 +667,7 @@
 
 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
 
-/* Nonzero in a IDENTIFIER_NODE if the use of the name is defined as a
+/* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
    deprecated feature by __attribute__((deprecated)).  */
 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
 
@@ -852,7 +852,7 @@
 #define LABELED_BLOCK_BODY(NODE) \
   TREE_OPERAND (LABELED_BLOCK_EXPR_CHECK (NODE), 1)
 
-/* In a EXIT_BLOCK_EXPR node.  */
+/* In an EXIT_BLOCK_EXPR node.  */
 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
   TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 0)
 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 1)
@@ -860,7 +860,7 @@
 /* In a LOOP_EXPR node.  */
 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (LOOP_EXPR_CHECK (NODE), 0)
 
-/* In a EXPR_WITH_FILE_LOCATION node.  */
+/* In an EXPR_WITH_FILE_LOCATION node.  */
 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
   (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
 #define EXPR_WFL_NODE(NODE) \
@@ -1324,7 +1324,7 @@
    base.  The actual contents are language-dependent.  Under the old
    ABI, the C++ front-end uses a FIELD_DECL whose contents are a
    pointer to the virtual base; under the new ABI this field is
-   instead a INTEGER_CST giving an offset into the vtable where the
+   instead an INTEGER_CST giving an offset into the vtable where the
    offset to the virtual base can be found.  */
 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
 


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