reg-stack.c: Fix comment typo(s).

	* reg-stack.c: Fix comment typo(s).
	* tree-ssa-operands.c: Likewise.
	* tree-vectorizer: Likewise.

From-SVN: r102232

gcc/ChangeLog

+2005-07-21  Volker Reichelt  <reichelt@igpm.rwth-aachen.de>
+
+	* reg-stack.c: Fix comment typo(s).
+	* tree-ssa-operands.c: Likewise.
+	* tree-vectorizer: Likewise.
+
 2005-07-21  Nick Clifton  <nickc@redhat.com>
 
 	* config/sh/symbian.c: Replace C++ style line comments with C

gcc/reg-stack.c

@@ -228,7 +228,7 @@ enum emit_where
 static basic_block current_block;
 
 /* In the current_block, whether we're processing the first register
-   stack or call instruction, i.e. the the regstack is currently the
+   stack or call instruction, i.e. the regstack is currently the
    same as BLOCK_INFO(current_block)->stack_in.  */
 static bool starting_stack_p;
 

gcc/tree-ssa-operands.c

@@ -459,10 +459,10 @@ ssa_operand_alloc (unsigned size)
 }
 
 
-/* Make sure PTR is inn the correct immediate use list.  Since uses are simply
+/* Make sure PTR is in the correct immediate use list.  Since uses are simply
    pointers into the stmt TREE, there is no way of telling if anyone has
    changed what this pointer points to via TREE_OPERANDS (exp, 0) = <...>.
-   THe contents are different, but the the pointer is still the same.  This
+   The contents are different, but the pointer is still the same.  This
    routine will check to make sure PTR is in the correct list, and if it isn't
    put it in the correct list.  We cannot simply check the previous node 
    because all nodes in the same stmt might have be changed.  */
@@ -482,7 +482,7 @@ correct_use_link (use_operand_p ptr, tree stmt)
     {
       bool stmt_mod = true;
       /* Find the first element which isn't a SAFE iterator, is in a different
-	 stmt, and is not a a modified stmt,  That node is in the correct list,
+	 stmt, and is not a modified stmt.  That node is in the correct list,
 	 see if we are too.  */
 
       while (stmt_mod)

gcc/tree-vectorizer.c

@@ -1792,7 +1792,7 @@ reduction_code_for_scalar_code (enum tree_code code,
   
    such that:
    1. operation is commutative and associative and it is safe to 
-      change the the order of the computation.
+      change the order of the computation.
    2. no uses for a2 in the loop (a2 is used out of the loop)
    3. no uses of a1 in the loop besides the reduction operation.