c-decl.c, [...]: Fix comment typos.
* c-decl.c, config/avr/avr.c, config/avr/avr.h, config/m68k/m68k.c, config/m68k/netbsd-elf.h, config/mn10300/mn10300.c, config/pdp11/pdp11.h, config/rs6000/cell.md, config/rs6000/darwin.h, config/sh/sh.md, config/sh/sh4-300.md, config/spu/spu.c, config/spu/spu.md, cselib.c, expr.c, haifa-sched.c, hwint.h, jump.c, reload.c, sched-deps.c, sched-int.h, tree-inline.c, tree-profile.c, tree-ssa-live.h, tree-vrp.c: Fix comment typos. Follow spelling conventions. * doc/invoke.texi: Follow spelling conventions. From-SVN: r121546
This commit is contained in:
parent
735dfed7f6
commit
9f5ed61a80
27 changed files with 41 additions and 28 deletions
|
@ -1,3 +1,16 @@
|
|||
2007-02-03 Kazu Hirata <kazu@codesourcery.com>
|
||||
|
||||
* c-decl.c, config/avr/avr.c, config/avr/avr.h,
|
||||
config/m68k/m68k.c, config/m68k/netbsd-elf.h,
|
||||
config/mn10300/mn10300.c, config/pdp11/pdp11.h,
|
||||
config/rs6000/cell.md, config/rs6000/darwin.h,
|
||||
config/sh/sh.md, config/sh/sh4-300.md, config/spu/spu.c,
|
||||
config/spu/spu.md, cselib.c, expr.c, haifa-sched.c, hwint.h,
|
||||
jump.c, reload.c, sched-deps.c, sched-int.h, tree-inline.c,
|
||||
tree-profile.c, tree-ssa-live.h, tree-vrp.c: Fix comment
|
||||
typos. Follow spelling conventions.
|
||||
* doc/invoke.texi: Follow spelling conventions.
|
||||
|
||||
2007-02-03 Roger Sayle <roger@eyesopen.com>
|
||||
|
||||
* simplify-rtx.c (simplify_relational_operation_1): Implement some
|
||||
|
|
|
@ -64,7 +64,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
|
|||
|
||||
/* Set this to 1 if you want the standard ISO C99 semantics of 'inline'
|
||||
when you specify -std=c99 or -std=gnu99, and to 0 if you want
|
||||
behaviour compatible with the nonstandard semantics implemented by
|
||||
behavior compatible with the nonstandard semantics implemented by
|
||||
GCC 2.95 through 4.2. */
|
||||
#define WANT_C99_INLINE_SEMANTICS 1
|
||||
|
||||
|
|
|
@ -5527,7 +5527,7 @@ avr_ret_register (void)
|
|||
return 24;
|
||||
}
|
||||
|
||||
/* Ceate an RTX representing the place where a
|
||||
/* Create an RTX representing the place where a
|
||||
library function returns a value of mode MODE. */
|
||||
|
||||
rtx
|
||||
|
|
|
@ -725,7 +725,7 @@ extern int avr_case_values_threshold;
|
|||
#define CC1PLUS_SPEC "%{!frtti:-fno-rtti} \
|
||||
%{!fenforce-eh-specs:-fno-enforce-eh-specs} \
|
||||
%{!fexceptions:-fno-exceptions}"
|
||||
/* A C string constant that tells the GCC drvier program options to
|
||||
/* A C string constant that tells the GCC driver program options to
|
||||
pass to `cc1plus'. */
|
||||
|
||||
#define ASM_SPEC "%{mmcu=avr25:-mmcu=avr2;\
|
||||
|
|
|
@ -462,7 +462,7 @@ override_options (void)
|
|||
implementing architecture ARCH. -mcpu=CPU should override -march
|
||||
and should generate code that runs on processor CPU, making free
|
||||
use of any instructions that CPU understands. -mtune=UARCH applies
|
||||
on top of -mcpu or -march and optimises the code for UARCH. It does
|
||||
on top of -mcpu or -march and optimizes the code for UARCH. It does
|
||||
not change the target architecture. */
|
||||
if (m68k_cpu_entry)
|
||||
{
|
||||
|
|
|
@ -69,7 +69,7 @@ Boston, MA 02110-1301, USA. */
|
|||
|
||||
|
||||
/* Provide an ASM_SPEC appropriate for NetBSD m68k ELF targets. We need
|
||||
to passn PIC code generation options. */
|
||||
to pass PIC code generation options. */
|
||||
|
||||
#undef ASM_SPEC
|
||||
#define ASM_SPEC "%(asm_cpu_spec) %{fpic|fpie:-k} %{fPIC|fPIE:-k -K}"
|
||||
|
|
|
@ -546,7 +546,7 @@ fp_regs_to_save (void)
|
|||
/* Print a set of registers in the format required by "movm" and "ret".
|
||||
Register K is saved if bit K of MASK is set. The data and address
|
||||
registers can be stored individually, but the extended registers cannot.
|
||||
We assume that the mask alread takes that into account. For instance,
|
||||
We assume that the mask already takes that into account. For instance,
|
||||
bits 14 to 17 must have the same value. */
|
||||
|
||||
void
|
||||
|
|
|
@ -441,7 +441,7 @@ extern int current_first_parm_offset;
|
|||
For the pdp11, this is nonzero to account for the return address.
|
||||
1 - return address
|
||||
2 - frame pointer (always saved, even when not used!!!!)
|
||||
-- chnage some day !!!:q!
|
||||
-- change some day !!!:q!
|
||||
|
||||
*/
|
||||
#define FIRST_PARM_OFFSET(FNDECL) 4
|
||||
|
|
|
@ -25,7 +25,7 @@
|
|||
;; This file simulate PPU processor unit backend of pipeline, maualP24.
|
||||
;; manual P27, stall and flush points
|
||||
;; IU, XU, VSU, dispatcher decodes and dispatch 2 insns per cycle in program
|
||||
;; order, the grouped adress are aligned by 8
|
||||
;; order, the grouped address are aligned by 8
|
||||
;; This file only simulate one thread situation
|
||||
;; XU executes all fixed point insns(3 units, a simple alu, a complex unit,
|
||||
;; and load/store unit)
|
||||
|
|
|
@ -401,7 +401,7 @@ do { \
|
|||
macro in the Apple version of GCC, except that version supports
|
||||
'mac68k' alignment, and that version uses the computed alignment
|
||||
always for the first field of a structure. The first-field
|
||||
behaviour is dealt with by
|
||||
behavior is dealt with by
|
||||
darwin_rs6000_special_round_type_align. */
|
||||
#define ADJUST_FIELD_ALIGN(FIELD, COMPUTED) \
|
||||
(TARGET_ALIGN_NATURAL ? (COMPUTED) \
|
||||
|
|
|
@ -4771,7 +4771,7 @@ label:
|
|||
|
||||
; N.B. This should agree with LOAD_EXTEND_OP and movqi.
|
||||
; Because we use zero extension, we can't provide signed QImode compares
|
||||
; using a simple compare or conditional banch insn.
|
||||
; using a simple compare or conditional branch insn.
|
||||
(define_insn "truncdiqi2"
|
||||
[(set (match_operand:QI 0 "general_movdst_operand" "=r,m")
|
||||
(truncate:QI (match_operand:DI 1 "register_operand" "r,r")))]
|
||||
|
|
|
@ -187,7 +187,7 @@
|
|||
;; Scheduling runs before reorg, so we approximate this by saying that we
|
||||
;; want the call to be paired with a preceding insn.
|
||||
;; In most cases, the insn that loads the address of the call should have
|
||||
;; a non-zero latency (mov rn,rm doesn't make sense since we could use rn
|
||||
;; a nonzero latency (mov rn,rm doesn't make sense since we could use rn
|
||||
;; for the address then). Thus, a preceding insn that can be paired with
|
||||
;; a call should be eligible for the delay slot.
|
||||
;;
|
||||
|
|
|
@ -2792,7 +2792,7 @@ spu_handle_vector_attribute (tree * node, tree name,
|
|||
return NULL_TREE;
|
||||
}
|
||||
|
||||
/* Return non-zero if FUNC is a naked function. */
|
||||
/* Return nonzero if FUNC is a naked function. */
|
||||
static int
|
||||
spu_naked_function_p (tree func)
|
||||
{
|
||||
|
|
|
@ -55,7 +55,7 @@
|
|||
(define_insn_reservation "FP7" 7 (eq_attr "type" "fp7")
|
||||
"pipe0, fp, nothing*5")
|
||||
|
||||
;; The behaviour of the double precision is that both pipes stall
|
||||
;; The behavior of the double precision is that both pipes stall
|
||||
;; for 6 cycles and the the rest of the operation pipelines for
|
||||
;; 7 cycles. The simplest way to model this is to simply ignore
|
||||
;; the 6 cyle stall.
|
||||
|
|
|
@ -1453,7 +1453,7 @@ cselib_process_insn (rtx insn)
|
|||
|
||||
if (n_useless_values > MAX_USELESS_VALUES
|
||||
/* remove_useless_values is linear in the hash table size. Avoid
|
||||
quadratic behaviour for very large hashtables with very few
|
||||
quadratic behavior for very large hashtables with very few
|
||||
useless elements. */
|
||||
&& (unsigned int)n_useless_values > cselib_hash_table->n_elements / 4)
|
||||
remove_useless_values ();
|
||||
|
|
|
@ -1658,7 +1658,7 @@ when used within the DSO@. Enabling this option can have a dramatic effect
|
|||
on load and link times of a DSO as it massively reduces the size of the
|
||||
dynamic export table when the library makes heavy use of templates.
|
||||
|
||||
The behaviour of this switch is not quite the same as marking the
|
||||
The behavior of this switch is not quite the same as marking the
|
||||
methods as hidden directly, because it does not affect static variables
|
||||
local to the function or cause the compiler to deduce that
|
||||
the function is defined in only one shared object.
|
||||
|
|
|
@ -8988,7 +8988,7 @@ string_constant (tree arg, tree *ptr_offset)
|
|||
&& TREE_CODE (array) != VAR_DECL)
|
||||
return 0;
|
||||
|
||||
/* Check if the array has a non-zero lower bound. */
|
||||
/* Check if the array has a nonzero lower bound. */
|
||||
lower_bound = array_ref_low_bound (TREE_OPERAND (arg, 0));
|
||||
if (!integer_zerop (lower_bound))
|
||||
{
|
||||
|
|
|
@ -684,7 +684,7 @@ dep_cost (dep_t link)
|
|||
rtx dep_cost_rtx_link = alloc_INSN_LIST (NULL_RTX, NULL_RTX);
|
||||
|
||||
/* Make it self-cycled, so that if some tries to walk over this
|
||||
incomplete list he/she will be cought in an endless loop. */
|
||||
incomplete list he/she will be caught in an endless loop. */
|
||||
XEXP (dep_cost_rtx_link, 1) = dep_cost_rtx_link;
|
||||
|
||||
/* Targets use only REG_NOTE_KIND of the link. */
|
||||
|
|
|
@ -128,7 +128,7 @@ extern char sizeof_long_long_must_be_8[sizeof(long long) == 8 ? 1 : -1];
|
|||
efficiently in hardware. (That is, the widest integer type that fits
|
||||
in a hardware register.) Normally this is "long" but on some hosts it
|
||||
should be "long long" or "__int64". This is no convenient way to
|
||||
autodect this, so such systems must set a flag in config.host; see there
|
||||
autodetect this, so such systems must set a flag in config.host; see there
|
||||
for details. */
|
||||
|
||||
#ifdef USE_LONG_LONG_FOR_WIDEST_FAST_INT
|
||||
|
|
|
@ -1639,7 +1639,7 @@ redirect_jump_2 (rtx jump, rtx olabel, rtx nlabel, int delete_unused,
|
|||
{
|
||||
rtx note;
|
||||
|
||||
/* negative DELETE_UNUSED used to be used to signalize behaviour on
|
||||
/* Negative DELETE_UNUSED used to be used to signalize behavior on
|
||||
moving FUNCTION_END note. Just sanity check that no user still worry
|
||||
about this. */
|
||||
gcc_assert (delete_unused >= 0);
|
||||
|
|
|
@ -1717,7 +1717,7 @@ combine_reloads (void)
|
|||
return;
|
||||
|
||||
/* If there is a reload for part of the address of this operand, we would
|
||||
need to chnage it to RELOAD_FOR_OTHER_ADDRESS. But that would extend
|
||||
need to change it to RELOAD_FOR_OTHER_ADDRESS. But that would extend
|
||||
its life to the point where doing this combine would not lower the
|
||||
number of spill registers needed. */
|
||||
for (i = 0; i < n_reloads; i++)
|
||||
|
|
|
@ -97,7 +97,7 @@ init_dep_1 (dep_t dep, rtx pro, rtx con, enum reg_note kind, ds_t ds)
|
|||
|
||||
/* Init DEP with the arguments.
|
||||
While most of the scheduler (including targets) only need the major type
|
||||
of the dependency, it is convinient to hide full dep_status from them. */
|
||||
of the dependency, it is convenient to hide full dep_status from them. */
|
||||
void
|
||||
init_dep (dep_t dep, rtx pro, rtx con, enum reg_note kind)
|
||||
{
|
||||
|
@ -2425,7 +2425,7 @@ add_back_forw_dep (rtx insn, rtx elem, enum reg_note dep_type, ds_t ds)
|
|||
gcc_assert (deps_list_consistent_p (INSN_BACK_DEPS (insn)));
|
||||
}
|
||||
|
||||
/* Remove a dependency refered by L. */
|
||||
/* Remove a dependency referred to by L. */
|
||||
void
|
||||
delete_back_forw_dep (dep_link_t l)
|
||||
{
|
||||
|
|
|
@ -142,8 +142,8 @@ void copy_deps_list_change_con (deps_list_t, deps_list_t, rtx);
|
|||
|
||||
void move_dep_link (dep_link_t, deps_list_t);
|
||||
|
||||
/* Suppose we have a depedence Y between insn pro1 and con1, where pro1 has
|
||||
additional dependants con0 and con2, and con1 is dependant on additional
|
||||
/* Suppose we have a dependence Y between insn pro1 and con1, where pro1 has
|
||||
additional dependents con0 and con2, and con1 is dependent on additional
|
||||
insns pro0 and pro1:
|
||||
|
||||
.con0 pro0
|
||||
|
|
|
@ -2223,7 +2223,7 @@ estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
|
|||
}
|
||||
|
||||
/* Estimate number of instructions that will be created by expanding EXPR.
|
||||
WEIGHTS contains weigths attributed to various constructs. */
|
||||
WEIGHTS contains weights attributed to various constructs. */
|
||||
|
||||
int
|
||||
estimate_num_insns (tree expr, eni_weights *weights)
|
||||
|
|
|
@ -64,7 +64,7 @@ static GTY(()) tree ptr_void;
|
|||
|
||||
/* Add code:
|
||||
static gcov* __gcov_indirect_call_counters; // pointer to actual counter
|
||||
static void* __gcov_indirect_call_callee; // actual callee address
|
||||
static void* __gcov_indirect_call_callee; // actual callee addres
|
||||
*/
|
||||
static void
|
||||
tree_init_ic_make_global_vars (void)
|
||||
|
|
|
@ -46,7 +46,7 @@ Boston, MA 02110-1301, USA. */
|
|||
change. (ie, it is truly a view since it doesn't change anything)
|
||||
|
||||
The final component of the data structure is the basevar map. This provides
|
||||
a list of all the different base variables which occue in a partition view,
|
||||
a list of all the different base variables which occur in a partition view,
|
||||
and a unique index for each one. Routines are provided to quickly produce
|
||||
the base variable of a partition.
|
||||
|
||||
|
|
|
@ -3481,7 +3481,7 @@ insert_range_assertions (void)
|
|||
|
||||
/* Checks one ARRAY_REF in REF, located at LOCUS. Ignores flexible arrays
|
||||
and "struct" hacks. If VRP can determine that the
|
||||
array subscript is a contant, check if it is outside valid
|
||||
array subscript is a constant, check if it is outside valid
|
||||
range. If the array subscript is a RANGE, warn if it is
|
||||
non-overlapping with valid range.
|
||||
IGNORE_OFF_BY_ONE is true if the ARRAY_REF is inside a ADDR_EXPR. */
|
||||
|
|
Loading…
Add table
Reference in a new issue