+2004-09-17 Kazu Hirata <kazu@cs.umass.edu>
+
+ * basic-block.h, c-decl.c, c-parse.in, cgraphunit.c, ddg.c,
+ gimplify.c, lambda-code.c, optabs.c, predict.c,
+ tree-scalar-evolution.c, tree-sra.c, tree-ssa-loop-ch.c,
+ tree-ssa.c, vec.h: Fix comment typos. Follow spelling
+ conventions.
+
2004-09-17 Kazu Hirata <kazu@cs.umass.edu>
* doc/compat.texi, doc/cpp.texi, doc/cppopts.texi,
#define EDGE_SIBCALL 256 /* Edge from sibcall to exit. */
#define EDGE_LOOP_EXIT 512 /* Exit of a loop. */
#define EDGE_TRUE_VALUE 1024 /* Edge taken when controlling
- predicate is non zero. */
+ predicate is nonzero. */
#define EDGE_FALSE_VALUE 2048 /* Edge taken when controlling
predicate is zero. */
#define EDGE_EXECUTABLE 4096 /* Edge is executable. Only
DECL_SAVED_TREE (fndecl) = push_stmt_list ();
/* ??? Insert the contents of the pending sizes list into the function
- to be evaluated. This just changes mis-behaviour until assign_parms
+ to be evaluated. This just changes mis-behavior until assign_parms
phase ordering problems are resolved. */
{
tree t;
static int yylex (void);
static void init_reswords (void);
- /* Initialisation routine for this file. */
+ /* Initialization routine for this file. */
void
c_parse_init (void)
{
??? Move this to separate file after tree-ssa merge.
We separate inlining decisions from the inliner itself and store it
- inside callgraph as so called inline plan. Reffer to cgraph.c
+ inside callgraph as so called inline plan. Refer to cgraph.c
documentation about particular representation of inline plans in the
callgraph
\f
/* Given FROM - a bitmap of source nodes - and TO - a bitmap of destination
nodes - find all nodes that lie on paths from FROM to TO (not excluding
- nodes from FROM and TO). Return non zero if nodes exist. */
+ nodes from FROM and TO). Return nonzero if nodes exist. */
int
find_nodes_on_paths (sbitmap result, ddg_ptr g, sbitmap from, sbitmap to)
{
the gimplifier will consider this a store to memory. Doing this
gimplification now means that we won't have to deal with complicated
language-specific trees, nor trees like SAVE_EXPR that can induce
- exponential search behaviour. */
+ exponential search behavior. */
one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
if (one == GS_ERROR)
{
/* Returns true when the vector V is lexicographically positive, in
- other words, when the first non zero element is positive. */
+ other words, when the first nonzero element is positive. */
static bool
lambda_vector_lexico_pos (lambda_vector v,
{
/* We must avoid shifting by BITS_PER_WORD bits since that is either
the same as a zero shift (if shift_mask == BITS_PER_WORD - 1) or
- has unknown behaviour. Do a single shift first, then shift by the
+ has unknown behavior. Do a single shift first, then shift by the
remainder. It's OK to use ~OP1 as the remainder if shift counts
are truncated to the mode size. */
carries = expand_binop (word_mode, reverse_unsigned_shift,
/* If this PHI has itself as an argument, we cannot
determine the string length of this argument. However,
- if we can find a expectd constant value for the other
+ if we can find a expected constant value for the other
PHI args then we can still be sure that this is
likely a constant. So be optimistic and just
continue with the next argument. */
/* Get the index corresponding to VAR in the current LOOP. If
it's the first time we ask for this VAR, then we return
- chrec_not_analysed_yet for this VAR and return its index. */
+ chrec_not_analyzed_yet for this VAR and return its index. */
static tree *
find_var_scev_info (tree var)
};
/* Random access to the child of a parent is performed by hashing.
- This prevents quadratic behaviour, and allows SRA to function
+ This prevents quadratic behavior, and allows SRA to function
reasonably on larger records. */
static htab_t sra_map;
/* Duplicates headers of loops if they are small enough, so that the statements
in the loop body are always executed when the loop is entered. This
- increases effectivity of code motion optimizations, and reduces the need
+ increases effectiveness of code motion optimizations, and reduces the need
for loop preconditioning. */
/* Check whether we should duplicate HEADER of LOOP. At most *LIMIT
verify_alias_info ();
free (definition_block);
- /* Restore the dominance infomation to its prior known state, so
- that we do not perturb the compiler's subsequent behaviour. */
+ /* Restore the dominance information to its prior known state, so
+ that we do not perturb the compiler's subsequent behavior. */
if (orig_dom_state == DOM_NONE)
free_dominance_info (CDI_DOMINATORS);
else
out-of-line generic functions. The vectors are designed to
interoperate with the GTY machinery.
- Because of the different behaviour of objects and of pointers to
+ Because of the different behavior of objects and of pointers to
objects, there are two flavors. One to deal with a vector of
pointers to objects, and one to deal with a vector of objects
themselves. Both of these pass pointers to objects around -- in
Ensure that V has at least RESERVE slots available, if RESERVE is
>= 0. If RESERVE < 0, ensure that there is at least one spare
- slot. These differ in their reallocation behaviour, the first will
+ slot. These differ in their reallocation behavior, the first will
not create additional headroom, but the second mechanism will
perform the usual exponential headroom increase. Note this can
cause V to be reallocated. Returns nonzero iff reallocation
projects / gcc.git / commitdiff