dominance.c, [...]: Fix comment typos.

* dominance.c, gthr-win32.h, reg-stack.c, tree-ssa-copy.c,
	tree-ssa-operands.c, tree-ssa.c, tree-vrp.c, varasm.c,
	config/alpha/alpha.c, config/arm/arm.c, config/m32r/m32r.h,
	config/rs6000/predicates.md: Fix comment typos.

From-SVN: r97904

gcc/ChangeLog

@@ -1,3 +1,10 @@
+2005-04-09  Kazu Hirata  <kazu@cs.umass.edu>
+
+	* dominance.c, gthr-win32.h, reg-stack.c, tree-ssa-copy.c,
+	tree-ssa-operands.c, tree-ssa.c, tree-vrp.c, varasm.c,
+	config/alpha/alpha.c, config/arm/arm.c, config/m32r/m32r.h,
+	config/rs6000/predicates.md: Fix comment typos.
+
 2005-04-09  Jan Hubicka  <jh@suse.cz>
 	    Steven Bosscher  <stevenb@suse.de>
 

gcc/config/alpha/alpha.c

@@ -8418,7 +8418,7 @@ alphaev4_next_group (rtx insn, int *pin_use, int *plen)
 	  if (in_use)
 	    goto done;
 
-	  /* If this is a completely unrecognized insn, its an asm.
+	  /* If this is a completely unrecognized insn, it's an asm.
 	     We don't know how long it is, so record length as -1 to
 	     signal a needed realignment.  */
 	  if (recog_memoized (insn) < 0)
@@ -8516,7 +8516,7 @@ alphaev5_next_group (rtx insn, int *pin_use, int *plen)
 	  if (in_use)
 	    goto done;
 
-	  /* If this is a completely unrecognized insn, its an asm.
+	  /* If this is a completely unrecognized insn, it's an asm.
 	     We don't know how long it is, so record length as -1 to
 	     signal a needed realignment.  */
 	  if (recog_memoized (insn) < 0)

gcc/config/arm/arm.c

@@ -7420,7 +7420,7 @@ arm_const_double_inline_cost (rtx val)
 			      NULL_RTX, NULL_RTX, 0, 0));
 }
 
-/* Return true if it is worthwile to split a 64-bit constant into two
+/* Return true if it is worthwhile to split a 64-bit constant into two
    32-bit operations.  This is the case if optimizing for size, or
    if we have load delay slots, or if one 32-bit part can be done with
    a single data operation.  */

gcc/config/m32r/m32r.h

@@ -1609,7 +1609,7 @@ extern char m32r_punct_chars[256];
    After generation of rtl, the compiler makes no further distinction
    between pointers and any other objects of this machine mode.  */
 /* ??? The M32R doesn't have full 32 bit pointers, but making this PSImode has
-   it's own problems (you have to add extendpsisi2 and truncsipsi2).
+   its own problems (you have to add extendpsisi2 and truncsipsi2).
    Try to avoid it.  */
 #define Pmode SImode
 

gcc/config/rs6000/predicates.md

@@ -339,7 +339,7 @@
 ;; Return 1 if the operand is in volatile memory.  Note that during the
 ;; RTL generation phase, memory_operand does not return TRUE for volatile
 ;; memory references.  So this function allows us to recognize volatile
-;; references where its safe.
+;; references where it's safe.
 (define_predicate "volatile_mem_operand"
   (and (and (match_code "mem")
 	    (match_test "MEM_VOLATILE_P (op)"))

gcc/dominance.c

@@ -30,7 +30,7 @@
 
    The algorithm computes this dominator tree implicitly by computing for
    each block its immediate dominator.  We use tree balancing and path
-   compression, so its the O(e*a(e,v)) variant, where a(e,v) is the very
+   compression, so it's the O(e*a(e,v)) variant, where a(e,v) is the very
    slowly growing functional inverse of the Ackerman function.  */
 
 #include "config.h"

gcc/gthr-win32.h

@@ -71,7 +71,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
 #ifdef _LIBOBJC
 
 /* This is necessary to prevent windef.h (included from windows.h) from
-   defining it's own BOOL as a typedef.  */
+   defining its own BOOL as a typedef.  */
 #ifndef __OBJC__
 #define __OBJC__
 #endif

gcc/reg-stack.c

@@ -1424,7 +1424,7 @@ subst_stack_regs_pat (rtx insn, stack regstack, rtx pat)
 	    if (pat != PATTERN (insn))
 	      {
 		/* The fix_truncdi_1 pattern wants to be able to allocate
-		   it's own scratch register.  It does this by clobbering
+		   its own scratch register.  It does this by clobbering
 		   an fp reg so that it is assured of an empty reg-stack
 		   register.  If the register is live, kill it now.
 		   Remove the DEAD/UNUSED note so we don't try to kill it

gcc/tree-ssa-copy.c

@@ -430,7 +430,7 @@ get_last_copy_of (tree var)
 
 
 /* Set FIRST to be the first variable in the copy-of chain for DEST.
-   If DEST's copy-of value or its copy-of chain have changed, return
+   If DEST's copy-of value or its copy-of chain has changed, return
    true.
 
    MEM_REF is the memory reference where FIRST is stored.  This is

gcc/tree-ssa-operands.c

@@ -67,7 +67,7 @@ Boston, MA 02111-1307, USA.  */
    on each of the 5 operand vectors which have been built up.
 
    If the stmt had a previous operand cache, the finalization routines 
-   attempt to match up the new operands with the old ones.  If its a perfect 
+   attempt to match up the new operands with the old ones.  If it's a perfect 
    match, the old vector is simply reused.  If it isn't a perfect match, then 
    a new vector is created and the new operands are placed there.  For 
    virtual operands, if the previous cache had SSA_NAME version of a 
@@ -473,7 +473,7 @@ correct_use_link (ssa_imm_use_t *ptr, tree stmt)
   if (prev)
     {
       bool stmt_mod = true;
-      /* Find the first element which isn't a SAFE iterator, is in a sifferent
+      /* 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,
 	 see if we are too.  */
 
@@ -493,7 +493,7 @@ correct_use_link (ssa_imm_use_t *ptr, tree stmt)
 	root = prev->stmt;
       else
 	root = *(prev->use);
-      /* If its the right list, simply return.  */
+      /* If it's the right list, simply return.  */
       if (root == *(ptr->use))
 	return;
     }

gcc/tree-ssa.c

@@ -261,7 +261,7 @@ verify_use (basic_block bb, basic_block def_bb, use_operand_p use_p,
     }
 
   /* Make sure the use is in an appropriate list by checking the previous 
-     element to make sure its the same.  */
+     element to make sure it's the same.  */
   if (use_p->prev == NULL)
     {
       error ("No immediate_use list");

gcc/tree-vrp.c

@@ -2000,7 +2000,7 @@ vrp_meet (value_range *vr0, value_range *vr1)
 	  if (compare_values (vr0->min, vr1->min) == 1)
 	    min = vr1->min;
 
-	  /* The upper limit of the new range is the maximium of the
+	  /* The upper limit of the new range is the maximum of the
 	     two ranges.  */
 	  if (compare_values (vr0->max, vr1->max) == -1)
 	    max = vr1->max;

gcc/varasm.c

@@ -5402,7 +5402,7 @@ default_valid_pointer_mode (enum machine_mode mode)
 }
 
 /* Default function to output code that will globalize a label.  A
-   target must define GLOBAL_ASM_OP or provide it's own function to
+   target must define GLOBAL_ASM_OP or provide its own function to
    globalize a label.  */
 #ifdef GLOBAL_ASM_OP
 void