m32r.c: Fix comment typos.

	* config/m32r/m32r.c: Fix comment typos.
	* config/m68hc11/m68hc11.c: Likewise.
	* config/m68hc11/m68hc11.h: Likewise.
	* config/m68k/m68k.c: Likewise.
	* config/mcore/mcore.c: Likewise.
	* config/mcore/mcore.h: Likewise.
	* config/mcore/mcore.md: Likewise.
	* config/mips/mips.c: Likewise.
	* config/mips/mips.h: Likewise.
	* config/mips/mips.md: Likewise.
	* config/mips/netbsd.h: Likewise.
	* config/mn10300/mn10300.c: Likewise.

From-SVN: r68876

3 files changed, 8 insertions, 8 deletions

diff --git a/gcc/config/mcore/mcore.c b/gcc/config/mcore/mcore.c
index 7030d9d..d88307a 100644
--- a/gcc/config/mcore/mcore.c
+++ b/gcc/config/mcore/mcore.c
@@ -2370,7 +2370,7 @@ mcore_setup_incoming_varargs (args_so_far, mode, type, ptr_pretend_size)
      registers during the prologue.  */
   number_of_regs_before_varargs = args_so_far + mcore_num_arg_regs (mode, type);
   
-  /* There is a bug somwehere in the arg handling code.
+  /* There is a bug somewhere in the arg handling code.
      Until I can find it this workaround always pushes the
      last named argument onto the stack.  */
   number_of_regs_before_varargs = args_so_far;
@@ -2586,7 +2586,7 @@ mcore_expand_epilog ()
     }
 
   /* Give back anything else.  */
-  /* XXX: Should accumuate total and then give it back.  */
+  /* XXX: Should accumulate total and then give it back.  */
   while (growth >= 0)
     output_stack_adjust ( 1, fi.growth[growth--]);
 }
@@ -3147,7 +3147,7 @@ mcore_must_pass_on_stack (mode, type)
   if (type == NULL)
     return 0;
 
-  /* If the argugment can have its address taken, it must
+  /* If the argument can have its address taken, it must
      be placed on the stack.  */
   if (TREE_ADDRESSABLE (type))
     return 1;
@@ -3280,7 +3280,7 @@ mcore_function_arg (cum, mode, type, named)
 /* Implements the FUNCTION_ARG_PARTIAL_NREGS macro.
    Returns the number of argument registers required to hold *part* of
    a parameter of machine mode MODE and type TYPE (which may be NULL if
-   the type is not known).  If the argument fits entirly in the argument
+   the type is not known).  If the argument fits entirely in the argument
    registers, or entirely on the stack, then 0 is returned.  CUM is the
    number of argument registers already used by earlier parameters to
    the function.  */
diff --git a/gcc/config/mcore/mcore.h b/gcc/config/mcore/mcore.h
index 822dfbe..dddd5c1 100644
--- a/gcc/config/mcore/mcore.h
+++ b/gcc/config/mcore/mcore.h
@@ -258,7 +258,7 @@ extern const char * mcore_stack_increment_string;
 /* Allocation boundary (in *bits*) for storing arguments in argument list.  */
 #define PARM_BOUNDARY  	32
 
-/* Doubles must be alogned to an 8 byte boundary.  */
+/* Doubles must be aligned to an 8 byte boundary.  */
 #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
   ((MODE != BLKmode && (GET_MODE_SIZE (MODE) == 8)) \
    ? BIGGEST_ALIGNMENT : PARM_BOUNDARY)
@@ -790,7 +790,7 @@ extern const enum reg_class reg_class_from_letter[];
 /* Output assembler code for a block containing the constant parts
    of a trampoline, leaving space for the variable parts.
 
-   On the MCore, the trapoline looks like:
+   On the MCore, the trampoline looks like:
    	lrw	r1,  function
      	lrw	r13, area
    	jmp	r13
@@ -1195,7 +1195,7 @@ extern long mcore_current_compilation_timestamp;
    games. This is because when we use this, we get a marked 
    reference through the call to assemble_name and this forces C++
    inlined member functions (or any inlined function) to be instantiated
-   regardless of whether any callsites remain.
+   regardless of whether any call sites remain.
    This makes this aspect of the compiler non-ABI compliant.  */
 
 /* Similar, but for libcall. FUN is an rtx.  */
diff --git a/gcc/config/mcore/mcore.md b/gcc/config/mcore/mcore.md
index 6d39db9..bfdd844 100644
--- a/gcc/config/mcore/mcore.md
+++ b/gcc/config/mcore/mcore.md
@@ -691,7 +691,7 @@
 ;;
 ;; Other sizes may be handy for indexing. 
 ;; the tradeoffs to consider when adding these are
-;;	codesize, execution time [vs. mul it is easy to win],
+;;	code size, execution time [vs. mul it is easy to win],
 ;;	and register pressure -- these patterns don't use an extra
 ;;	register to build the offset from the base
 ;;	and whether the compiler will not come up with some other idiom.