Commit 368ebcd6 by Kazu Hirata Committed by Kazu Hirata

fold-const.c: Follow spelling conventions.

	* fold-const.c: Follow spelling conventions.
	* function.c: Likewise.
	* config/c4x/c4x.h: Likewise.
	* config/c4x/c4x.md: Likewise.
	* config/frv/frv.md: Likewise.
	* config/rs6000/aix.h: Likewise.
	* config/rs6000/linux64.h: Likewise.
	* config/xtensa/xtensa.c: Likewise.

From-SVN: r72111
parent 0ee55ad8
2003-10-05 Kazu Hirata <kazu@cs.umass.edu>
* fold-const.c: Follow spelling conventions.
* function.c: Likewise.
* config/c4x/c4x.h: Likewise.
* config/c4x/c4x.md: Likewise.
* config/frv/frv.md: Likewise.
* config/rs6000/aix.h: Likewise.
* config/rs6000/linux64.h: Likewise.
* config/xtensa/xtensa.c: Likewise.
2003-10-05 Kazu Hirata <kazu@cs.umass.edu>
* c-pretty-print.c: Fix comment formatting.
* cfglayout.c: Likewise.
* cfgloopanal.c: Likewise.
......
......@@ -777,7 +777,7 @@ enum reg_class
the register arguments (R2,R3), respectively. I'm reluctant to define
this macro since it stomps on many potential optimizations. Ideally
it should have a register class argument so that not all the register
classes gets penalised for the sake of a naughty few... For long
classes gets penalized for the sake of a naughty few... For long
double arithmetic we need two additional registers that we can use as
spill registers. */
......
......@@ -476,7 +476,7 @@
;
; C4x FUNCTIONAL UNITS
;
; Define functional units for instruction scheduling to minimise
; Define functional units for instruction scheduling to minimize
; pipeline conflicts.
;
; With the C3x, an external memory write (with no wait states) takes
......
......@@ -304,7 +304,7 @@
;; Instruction type
;; The table below summarises the types of media instruction and their
;; The table below summarizes the types of media instruction and their
;; scheduling classification. Headings are:
;; Type: the name of the define_attr type
......
......@@ -155,7 +155,7 @@
layout treating the parameter area as any other block of memory,
then map the reg param area to registers, i.e., pad upward, which
is the way IBM Compilers for AIX behave.
Setting both of the following defines results in this behaviour. */
Setting both of the following defines results in this behavior. */
#define AGGREGATE_PADDING_FIXED 1
#define AGGREGATES_PAD_UPWARD_ALWAYS 1
......
......@@ -241,7 +241,7 @@
reasonably assume that they follow the normal rules for structure
layout treating the parameter area as any other block of memory,
then map the reg param area to registers. ie. pad updard.
Setting both of the following defines results in this behaviour.
Setting both of the following defines results in this behavior.
Setting just the first one will result in aggregates that fit in a
doubleword being padded downward, and others being padded upward.
Not a bad idea as this results in struct { int x; } being passed
......
......@@ -1724,7 +1724,7 @@ function_arg_advance (CUMULATIVE_ARGS *cum, enum machine_mode mode, tree type)
/* Return an RTL expression containing the register for the given mode,
or 0 if the argument is to be passed on the stack. INCOMING_P is non-zero
or 0 if the argument is to be passed on the stack. INCOMING_P is nonzero
if this is an incoming argument to the current function. */
rtx
......
......@@ -3098,7 +3098,7 @@ make_range (tree exp, int *pin_p, tree *plow, tree *phigh)
in_p = n_in_p, low = n_low, high = n_high;
/* If the high bound is missing, but we have a non-zero low
/* If the high bound is missing, but we have a nonzero low
bound, reverse the range so it goes from zero to the low bound
minus 1. */
if (high == 0 && low && ! integer_zerop (low))
......
......@@ -4530,7 +4530,7 @@ assign_parms (tree fndecl)
Internally, gcc assumes that the argument pointer is
aligned to STACK_BOUNDARY bits. This is used both for
alignment optimisations (see init_emit) and to locate
alignment optimizations (see init_emit) and to locate
arguments that are aligned to more than PARM_BOUNDARY
bits. We must preserve this invariant by rounding
CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to a stack
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment