tree-ssa-phiopt.c, [...]: Fix comment typos.

	* tree-ssa-phiopt.c, config/arm/arm.c, config/fr30/fr30.md,
	config/mcore/mcore.c: Fix comment typos.

From-SVN: r98421

gcc/ChangeLog

+2005-04-19  Kazu Hirata  <kazu@cs.umass.edu>
+
+	* tree-ssa-phiopt.c, config/arm/arm.c, config/fr30/fr30.md,
+	config/mcore/mcore.c: Fix comment typos.
+
 2005-04-19  Daniel Jacobowitz  <dan@codesourcery.com>
 
 	* Makefile.in (libgcc.mk): Pass GCC_FOR_TARGET.

gcc/config/arm/arm.c

@@ -12694,7 +12694,7 @@ is_called_in_ARM_mode (tree func)
   if (TREE_CODE (func) != FUNCTION_DECL)
     abort ();
 
-  /* Ignore the problem about functions whoes address is taken.  */
+  /* Ignore the problem about functions whose address is taken.  */
   if (TARGET_CALLEE_INTERWORKING && TREE_PUBLIC (func))
     return TRUE;
 

gcc/config/fr30/fr30.md

@@ -38,8 +38,8 @@
 ;; An instruction by default is considered to be 'delyabable'
 ;; that is, it can be placed into a delay slot, but it is not
 ;; itself a delayed branch type instruction.  An instruction
-;; whoes type is 'delayed' is one which has a delay slot, and
-;; an instruction whoes delay_type is 'other' is one which does
+;; whose type is 'delayed' is one which has a delay slot, and
+;; an instruction whose delay_type is 'other' is one which does
 ;; not have a delay slot, nor can it be placed into a delay slot.
 
 (define_attr "delay_type" "delayable,delayed,other" (const_string "delayable"))
@@ -316,7 +316,7 @@
 )
 
 ;; If we are loading a large positive constant, one which has bits
-;; in the top byte set, but whoes set bits all lie within an 8 bit
+;; in the top byte set, but whose set bits all lie within an 8 bit
 ;; range, then we can save time and space by loading the byte value
 ;; and shifting it into place.
 (define_split

gcc/config/mcore/mcore.c

@@ -2705,7 +2705,7 @@ handle_structs_in_regs (enum machine_mode mode, tree type, int reg)
 {
   int size;
 
-  /* The MCore ABI defines that a structure whoes size is not a whole multiple
+  /* The MCore ABI defines that a structure whose size is not a whole multiple
      of bytes is passed packed into registers (or spilled onto the stack if
      not enough registers are available) with the last few bytes of the
      structure being packed, left-justified, into the last register/stack slot.

gcc/tree-ssa-phiopt.c

@@ -301,7 +301,7 @@ empty_block_p (basic_block bb)
   return true;
 }
 
-/* Replace PHI node element whoes edge is E in block BB with variable NEW.
+/* Replace PHI node element whose edge is E in block BB with variable NEW.
    Remove the edge from COND_BLOCK which does not lead to BB (COND_BLOCK
    is known to have two edges, one of which must reach BB).  */