mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-04-24 07:30:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
* config/arm/arm.c, config/rs6000/ppu_intrinsics.h,
	config/spu/spu.c, df-scan.c, fixed-value.c, fold-const.c,
	ginclude/tgmath.h, haifa-sched.c, optabs.c, recog.c,
	sched-deps.c, sched-int.h, system.h, target.h,
	tree-ssa-live.c, tree-vect-transform.c, tree-vectorizer.c,
	tree.def: Fix comment typos.

From-SVN: r128016
This commit is contained in:
Kazu Hirata 2007-09-01 20:13:45 +00:00 committed by Kazu Hirata
parent 8785d88cf1
commit 15dc95cbcc
19 changed files with 32 additions and 23 deletions

9
gcc/ChangeLog

@ -1,3 +1,12 @@
2007-09-01 Kazu Hirata <kazu@codesourcery.com>
* config/arm/arm.c, config/rs6000/ppu_intrinsics.h,
config/spu/spu.c, df-scan.c, fixed-value.c, fold-const.c,
ginclude/tgmath.h, haifa-sched.c, optabs.c, recog.c,
sched-deps.c, sched-int.h, system.h, target.h,
tree-ssa-live.c, tree-vect-transform.c, tree-vectorizer.c,
tree.def: Fix comment typos.
2007-09-01 Kazu Hirata <kazu@codesourcery.com>
* config/m68k/m68k.c (TARGET_DEFAULT_TARGET_FLAGS): Remove.

2
gcc/config/arm/arm.c

@ -5868,7 +5868,7 @@ vfp3_const_double_index (rtx x)
return -1;
/* Sign, mantissa and exponent are now in the correct form to plug into the
formulae described in the comment above. */
formula described in the comment above. */
return (sign << 7) | ((exponent ^ 3) << 4) | (mantissa - 16);
}

2
gcc/config/rs6000/ppu_intrinsics.h

@ -188,7 +188,7 @@ typedef int __V4SI __attribute__((vector_size(16)));
#endif /* __powerpc64__ */
#ifdef __powerpc64__
/* Work around the hadware bug in the current Cell implemention. */
/* Work around the hardware bug in the current Cell implementation. */
#define __mftb() __extension__ \
({ unsigned long long result; \
__asm__ volatile ("1: mftb %[current_tb]\n" \

2
gcc/config/spu/spu.c

@ -5484,7 +5484,7 @@ spu_builtin_vectorization_cost (bool runtime_test)
/* If the branch of the runtime test is taken - i.e. - the vectorized
version is skipped - this incurs a misprediction cost (because the
vectorized version is expected to be the fall-through). So we subtract
the latency of a mispredicted branch from the costs that are incured
the latency of a mispredicted branch from the costs that are incurred
when the vectorized version is executed. */
if (runtime_test)
return -19;

2
gcc/df-scan.c

@ -3632,7 +3632,7 @@ df_record_entry_block_defs (bitmap entry_block_defs)
}
/* Update the defs in the entry bolck. */
/* Update the defs in the entry block. */
void
df_update_entry_block_defs (void)

4
gcc/fixed-value.c

@ -553,7 +553,7 @@ do_fixed_divide (FIXED_VALUE_TYPE *f, const FIXED_VALUE_TYPE *a,
&r.low, &r.high, 0);
}
/* Divide r by pos_b to quo_r. The remanider is in mod. */
/* Divide r by pos_b to quo_r. The remainder is in mod. */
div_and_round_double (TRUNC_DIV_EXPR, 1, r.low, r.high, pos_b.low,
pos_b.high, &quo_r.low, &quo_r.high, &mod.low,
&mod.high);
@ -613,7 +613,7 @@ do_fixed_divide (FIXED_VALUE_TYPE *f, const FIXED_VALUE_TYPE *a,
return overflow_p;
}
/* Calculate F = A << B if LEFT_P. Otherwies, F = A >> B.
/* Calculate F = A << B if LEFT_P. Otherwise, F = A >> B.
If SAT_P, saturate the result to the max or the min.
Return true, if !SAT_P and overflow. */

4
gcc/fold-const.c

@ -3537,7 +3537,7 @@ omit_one_operand (tree type, tree result, tree omitted)
{
tree t = fold_convert (type, result);
/* If the resulting operand is an empty statement, just return the ommited
/* If the resulting operand is an empty statement, just return the omitted
statement casted to void. */
if (IS_EMPTY_STMT (t) && TREE_SIDE_EFFECTS (omitted))
return build1 (NOP_EXPR, void_type_node, fold_ignored_result (omitted));
@ -3555,7 +3555,7 @@ pedantic_omit_one_operand (tree type, tree result, tree omitted)
{
tree t = fold_convert (type, result);
/* If the resulting operand is an empty statement, just return the ommited
/* If the resulting operand is an empty statement, just return the omitted
statement casted to void. */
if (IS_EMPTY_STMT (t) && TREE_SIDE_EFFECTS (omitted))
return build1 (NOP_EXPR, void_type_node, fold_ignored_result (omitted));

2
gcc/ginclude/tgmath.h

@ -50,7 +50,7 @@ Boston, MA 02111-1307, USA. */
If any generic parameter is complex, we use a complex version. Otherwise
we use a real version. If the real part of any generic parameter is long
double, we use the long double version. Otherwise if the real part of any
generic paramter is double or of integer type, we use the double version.
generic parameter is double or of integer type, we use the double version.
Otherwise we use the float version. */
#define __tg_cplx(expr) \

4
gcc/haifa-sched.c

@ -2924,7 +2924,7 @@ try_ready (rtx next)
else
{
/* One of the NEXT's dependencies has been resolved.
Recalcute NEXT's status. */
Recalculate NEXT's status. */
*ts &= ~SPECULATIVE & ~HARD_DEP;
@ -3857,7 +3857,7 @@ create_check_block_twin (rtx insn, bool mutate_p)
DONE_SPEC (insn) = ts & BEGIN_SPEC;
CHECK_SPEC (check) = ts & BEGIN_SPEC;
/* Luckyness of future speculations solely depends upon initial
/* Luckiness of future speculations solely depends upon initial
BEGIN speculation. */
if (ts & BEGIN_DATA)
fs = set_dep_weak (fs, BE_IN_DATA, get_dep_weak (ts, BEGIN_DATA));

2
gcc/optabs.c

@ -1265,7 +1265,7 @@ shift_optab_p (optab binoptab)
}
}
/* Return true if BINOPTAB implements a commutatative binary operation. */
/* Return true if BINOPTAB implements a commutative binary operation. */
static bool
commutative_optab_p (optab binoptab)

2
gcc/recog.c

@ -443,7 +443,7 @@ confirm_change_group (void)
if (changes[i].unshare)
*changes[i].loc = copy_rtx (*changes[i].loc);
/* Avoid unnecesary rescaning when multiple changes to same instruction
/* Avoid unnecesary rescanning when multiple changes to same instruction
are made. */
if (object)
{

4
gcc/sched-deps.c

@ -359,7 +359,7 @@ free_deps_list (deps_list_t l)
}
/* Return true if there is no dep_nodes and deps_lists out there.
After the region is scheduled all the depedency nodes and lists
After the region is scheduled all the dependency nodes and lists
should [generally] be returned to pool. */
bool
deps_pools_are_empty_p (void)
@ -648,7 +648,7 @@ sd_finish_insn (rtx insn)
/* Find a dependency between producer PRO and consumer CON.
Search through resolved dependency lists if RESOLVED_P is true.
If no such dependency is found return NULL,
overwise return the dependency and initialize SD_IT_PTR [if it is nonnull]
otherwise return the dependency and initialize SD_IT_PTR [if it is nonnull]
with an iterator pointing to it. */
static dep_t
sd_find_dep_between_no_cache (rtx pro, rtx con, bool resolved_p,

2
gcc/sched-int.h

@ -897,7 +897,7 @@ struct _sd_iterator
simply a pointer to the next element to allow easy deletion from the
list. When a dep is being removed from the list the iterator
will automatically advance because the value in *linkp will start
reffering to the next element. */
referring to the next element. */
dep_link_t *linkp;
/* True if the current list is a resolved one. */

2
gcc/system.h

@ -789,7 +789,7 @@ extern void fancy_abort (const char *, int, const char *) ATTRIBUTE_NORETURN;
#define CONST_CAST(X) ((void*)(X))
#endif
/* Acivate -Wcast-qual as a warning (not an error/-Werror). */
/* Activate -Wcast-qual as a warning (not an error/-Werror). */
#if GCC_VERSION >= 4003
#pragma GCC diagnostic warning "-Wcast-qual"
#endif

2
gcc/target.h

@ -306,7 +306,7 @@ struct gcc_target
/* The values of the following two members are pointers to
functions used to simplify the automaton descriptions.
dfa_pre_advance_cycle and dfa_post_advance_cycle are getting called
immediatelly before and after cycle is advanced. */
immediately before and after cycle is advanced. */
void (* dfa_pre_advance_cycle) (void);
void (* dfa_post_advance_cycle) (void);

2
gcc/tree-ssa-live.c

@ -477,7 +477,7 @@ remove_unused_scope_block_p (tree scope)
{
next = &TREE_CHAIN (*t);
/* Debug info of nested function reffers to the block of the
/* Debug info of nested function refers to the block of the
function. */
if (TREE_CODE (*t) == FUNCTION_DECL)
unused = false;

4
gcc/tree-vect-transform.c

@ -4619,7 +4619,7 @@ vect_setup_realignment (tree stmt, block_stmt_iterator *bsi,
The problem arises only if the memory access is in an inner-loop nested
inside LOOP, which is now being vectorized using outer-loop vectorization.
This is the only case when the misalignment of the memory access may not
remain fixed thtoughout the iterations of the inner-loop (as exaplained in
remain fixed throughout the iterations of the inner-loop (as explained in
detail in vect_supportable_dr_alignment). In this case, not only is the
optimized realignment scheme not applicable, but also the misalignment
computation (and generation of the realignment token that is passed to
@ -6467,7 +6467,7 @@ vect_create_cond_for_align_checks (loop_vec_info loop_vinfo,
DR: The data reference.
VECT_FACTOR: vectorization factor.
Return an exrpession whose value is the size of segment which will be
Return an expression whose value is the size of segment which will be
accessed by DR. */
static tree

2
gcc/tree-vectorizer.c

@ -1701,7 +1701,7 @@ vect_supportable_dr_alignment (struct data_reference *dr)
iterations, it is *not* guaranteed that is will remain the same throughout
the execution of the inner-loop. This is because the inner-loop advances
with the original scalar step (and not in steps of VS). If the inner-loop
step happens to be a multiple of VS, then the misalignment remaines fixed
step happens to be a multiple of VS, then the misalignment remains fixed
and we can use the optimized realignment scheme. For example:
for (i=0; i<N; i++)

2
gcc/tree.def

@ -1017,7 +1017,7 @@ DEFTREECODE (OMP_FOR, "omp_for", tcc_statement, 6)
which of the sections to execute. */
DEFTREECODE (OMP_SECTIONS, "omp_sections", tcc_statement, 3)
/* This tree immediatelly follows OMP_SECTIONS, and represents the switch
/* This tree immediately follows OMP_SECTIONS, and represents the switch
used to decide which branch is taken. */
DEFTREECODE (OMP_SECTIONS_SWITCH, "omp_sections_switch", tcc_statement, 0)