OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

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

* config/i386/i386.c, config/pa/pa.c, config/spu/spu.c,
	df-problems.c, df-scan.c, domwalk.c, ebitmap.c, ebitmap.h,
	fold-const.c, gcc.c, ipa-type-escape.c, omega.c, omega.h,
	tree-ssa-coalesce.c, tree-ssa-live.c, tree-ssa-structalias.c,
	tree-vrp.c: Fix comment typos.  Follow spelling conventions.
	* doc/tm.texi: Follow spelling conventions.

From-SVN: r125090
This commit is contained in:
Kazu Hirata 2007-05-26 13:00:47 +00:00 committed by Kazu Hirata
parent 4dad0aca14
commit 110abdbc68
19 changed files with 34 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
gcc/ChangeLog
View File

@ -6,6 +6,13 @@
follow spelling conventions in various
warning/error/diagnostic messages.
* config/i386/i386.c, config/pa/pa.c, config/spu/spu.c,
df-problems.c, df-scan.c, domwalk.c, ebitmap.c, ebitmap.h,
fold-const.c, gcc.c, ipa-type-escape.c, omega.c, omega.h,
tree-ssa-coalesce.c, tree-ssa-live.c, tree-ssa-structalias.c,
tree-vrp.c: Fix comment typos. Follow spelling conventions.
* doc/tm.texi: Follow spelling conventions.
2007-05-25 Andrew Pinski <andrew_pinski@playstation.sony.com>
PR tree-opt/32090

2
gcc/config/i386/i386.c
View File

@ -16548,7 +16548,7 @@ enum ix86_builtins
/* Table for the ix86 builtin decls. */
static GTY(()) tree ix86_builtins[(int) IX86_BUILTIN_MAX];
/* Add a ix86 target builtin function with CODE, NAME and TYPE. Do so,
/* Add an ix86 target builtin function with CODE, NAME and TYPE. Do so,
* if the target_flags include one of MASK. Stores the function decl
* in the ix86_builtins array.
* Returns the function decl or NULL_TREE, if the builtin was not added. */

2
gcc/config/pa/pa.c
View File

@ -4220,7 +4220,7 @@ hppa_profile_hook (int label_no)
emit_move_insn (gen_rtx_REG (word_mode, 26), gen_rtx_REG (word_mode, 2));
/* The address of the function is loaded into %r25 with a instruction-
/* The address of the function is loaded into %r25 with an instruction-
relative sequence that avoids the use of relocations. The sequence
is split so that the load_offset_label_address instruction can
occupy the delay slot of the call to _mcount. */

2
gcc/config/spu/spu.c
View File

@ -2153,7 +2153,7 @@ insert_branch_hints (void)
prop = prev;
/* If this is the JOIN block of a simple IF-THEN then
propogate the hint to the HEADER block. */
propagate the hint to the HEADER block. */
else if (prev && prev2
&& EDGE_COUNT (bb->preds) == 2
&& EDGE_COUNT (prev->preds) == 1

2
gcc/df-problems.c
View File

@ -2138,7 +2138,7 @@ df_ur_add_problem (struct df *df, int flags)
This is a variant of the UR problem above that has a lot of special
features just for the register allocation phase. This problem
should go a away if someone would fix the interference graph.
should go away if someone would fix the interference graph.
----------------------------------------------------------------------------*/

2
gcc/df-scan.c
View File

@ -1681,7 +1681,7 @@ df_bb_refs_record (struct dataflow *dflow, basic_block bb)
{
#ifdef EH_USES
unsigned int i;
/* This code is putting in a artificial ref for the use at the
/* This code is putting in an artificial ref for the use at the
TOP of the block that receives the exception. It is too
cumbersome to actually put the ref on the edge. We could
either model this at the top of the receiver block or the

2
gcc/doc/tm.texi
View File

@ -3727,7 +3727,7 @@ which.
@c something, not sure if it looks good. --mew 10feb93
@defmac OUTGOING_REG_PARM_STACK_SPACE
Define this to a non-zero value if it is the responsibility of the caller
Define this to a nonzero value if it is the responsibility of the caller
to allocate the area reserved for arguments passed in registers.
If @code{ACCUMULATE_OUTGOING_ARGS} is defined, this macro controls

2
gcc/domwalk.c
View File

@ -122,7 +122,7 @@ Boston, MA 02110-1301, USA. */
which reduces code duplication since the rewriting phase is inherently
a walk of the dominator tree.
And (of course), we use the dominator walker to drive a our dominator
And (of course), we use the dominator walker to drive our dominator
optimizer, which is a semi-global optimizer.
TODO:

2
gcc/ebitmap.c
View File

@ -30,7 +30,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
/* The ebitmap data structure is a sparse bitmap structure that works
by having two pieces:
1. An array of all non-zero words in the structures, organized as
1. An array of all nonzero words in the structures, organized as
an array of HOST_WIDE_INT's.
2. A non-sparse bitmap saying which bitmap words are present in the
array.

6
gcc/ebitmap.h
View File

@ -30,10 +30,10 @@ typedef struct ebitmap_def
{
unsigned int n_elts; /* number of elements in the array. */
sbitmap wordmask; /* wordmask saying which words are
non-zero. */
unsigned int numwords; /* number of non-zero words. */
nonzero. */
unsigned int numwords; /* number of nonzero words. */
unsigned int cacheindex; /* which word cache is. */
EBITMAP_ELT_TYPE *elts; /* non-zero element array. */
EBITMAP_ELT_TYPE *elts; /* nonzero element array. */
EBITMAP_ELT_TYPE *cache; /* last tested element, or NULL. */
} *ebitmap;

6
gcc/fold-const.c
View File

@ -65,7 +65,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
#include "langhooks.h"
#include "md5.h"
/* Non-zero if we are folding constants inside an initializer; zero
/* Nonzero if we are folding constants inside an initializer; zero
otherwise. */
int folding_initializer = 0;
@ -910,7 +910,7 @@ div_if_zero_remainder (enum tree_code code, tree arg1, tree arg2)
return build_int_cst_wide (type, quol, quoh);
}
/* This is non-zero if we should defer warnings about undefined
/* This is nonzero if we should defer warnings about undefined
overflow. This facility exists because these warnings are a
special case. The code to estimate loop iterations does not want
to issue any warnings, since it works with expressions which do not
@ -7831,7 +7831,7 @@ fold_unary (enum tree_code code, tree type, tree op0)
}
/* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
of the same precision, and X is a integer type not narrower than
of the same precision, and X is an integer type not narrower than
types T1 or T2, i.e. the cast (T2)X isn't an extension. */
if (INTEGRAL_TYPE_P (type)
&& TREE_CODE (op0) == BIT_NOT_EXPR

2
gcc/gcc.c
View File

@ -127,7 +127,7 @@ static const char dir_separator_str[] = { DIR_SEPARATOR, 0 };
/* Flag set by cppspec.c to 1. */
int is_cpp_driver;
/* Flag set to non-zero if an @file argument has been supplied to gcc. */
/* Flag set to nonzero if an @file argument has been supplied to gcc. */
static bool at_file_supplied;
/* Flag saying to pass the greatest exit code returned by a sub-process

2
gcc/ipa-type-escape.c
View File

@ -656,7 +656,7 @@ check_cast_type (tree to_type, tree from_type)
return CT_SIDEWAYS;
}
/* This function returns non-zero if VAR is result of call
/* This function returns nonzero if VAR is result of call
to malloc function. */
static bool

8
gcc/omega.c
View File

@ -1806,13 +1806,13 @@ cleanout_wildcards (omega_pb pb)
for (i = n_vars; !omega_safe_var_p (pb, i); i--)
if (pb->eqs[e].coef[i] != 0)
{
/* i is the last non-zero non-safe variable. */
/* i is the last nonzero non-safe variable. */
for (j = i - 1; !omega_safe_var_p (pb, j); j--)
if (pb->eqs[e].coef[j] != 0)
break;
/* j is the next non-zero non-safe variable, or points
/* j is the next nonzero non-safe variable, or points
to a safe variable: it is then a wildcard variable. */
/* Clean it out. */
@ -3174,9 +3174,9 @@ omega_solve_eq (omega_pb pb, enum omega_result desired_res)
if (eqn->coef[j])
break;
/* i is the position of last non-zero coefficient,
/* i is the position of last nonzero coefficient,
g is the coefficient of i,
j is the position of next non-zero coefficient. */
j is the position of next nonzero coefficient. */
if (j == 0)
{

2
gcc/omega.h
View File

@ -1,4 +1,4 @@
/* Source code for an implementation of the Omega test, a integer
/* Source code for an implementation of the Omega test, an integer
programming algorithm for dependence analysis, by William Pugh,
appeared in Supercomputing '91 and CACM Aug 92.

2
gcc/tree-ssa-coalesce.c
View File

@ -476,7 +476,7 @@ typedef struct ssa_conflicts_d
} * ssa_conflicts_p;
/* Return a empty new conflict graph for SIZE elements. */
/* Return an empty new conflict graph for SIZE elements. */
static inline ssa_conflicts_p
ssa_conflicts_new (unsigned size)

4
gcc/tree-ssa-live.c
View File

@ -569,7 +569,7 @@ delete_tree_live_info (tree_live_info_p live)
}
/* Visit basic block BB and propogate any required live on entry bits from
/* Visit basic block BB and propagate any required live on entry bits from
LIVE into the predecessors. VISITED is the bitmap of visited blocks.
TMP is a temporary work bitmap which is passed in to avoid reallocating
it each time. */
@ -625,7 +625,7 @@ live_worklist (tree_live_info_p live)
sbitmap_zero (visited);
/* Visit all the blocks in reverse order and propogate live on entry values
/* Visit all the blocks in reverse order and propagate live on entry values
into the predecessors blocks. */
FOR_EACH_BB_REVERSE (bb)
loe_visit_block (live, bb, visited, tmp);

2
gcc/tree-ssa-structalias.c
View File

@ -2808,7 +2808,7 @@ do_rhs_deref_structure_copy (const struct constraint_expr lhs,
}
/* Handle the structure copy case where we have a structure copy
between a aggregate on the RHS and a dereference of a pointer on
between an aggregate on the RHS and a dereference of a pointer on
the LHS that is of SIZE (in bits)
For each field of the rhs variable (rhsfield)

4
gcc/tree-vrp.c
View File

@ -387,7 +387,7 @@ set_value_range_to_value (value_range_t *vr, tree val, bitmap equiv)
}
/* Set value range VR to a non-negative range of type TYPE.
OVERFLOW_INFINITY indicates whether to use a overflow infinity
OVERFLOW_INFINITY indicates whether to use an overflow infinity
rather than TYPE_MAX_VALUE; this should be true if we determine
that the range is nonnegative based on the assumption that signed
overflow does not occur. */
@ -607,7 +607,7 @@ symbolic_range_p (value_range_t *vr)
|| !is_gimple_min_invariant (vr->max));
}
/* Return true if value range VR uses a overflow infinity. */
/* Return true if value range VR uses an overflow infinity. */
static inline bool
overflow_infinity_range_p (value_range_t *vr)