+2005-05-19 Kazu Hirata <kazu@cs.umass.edu>
+
+ * cfgexpand.c, tree-cfg.c, tree-inline.c, tree-optimize.c,
+ tree-ssa-forwprop.c: Fix comment typos.
+ * doc/invoke.texi: Fix a typo.
+
2005-05-18 Richard Henderson <rth@redhat.com>
* config.gcc (powerpc-*-linux*): Include linux64.opt when
}
/* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL that
- has some associated error, e.g. it's type is error-mark. We just need
+ has some associated error, e.g. its type is error-mark. We just need
to pick something that won't crash the rest of the compiler. */
static void
+2005-05-19 Kazu Hirata <kazu@cs.umass.edu>
+
+ * parser.c: Fix comment typos.
+
2005-05-18 Geoffrey Keating <geoffk@apple.com>
* Make-lang.in (cc1plus-dummy): New.
tree qual_type = objc_get_protocol_qualified_type (type, protos);
/* Clobber the "unqualified" type previously entered into
- DECL_SPECS with the new, improved protocol-qualifed version. */
+ DECL_SPECS with the new, improved protocol-qualified version. */
if (decl_specs)
decl_specs->type = qual_type;
goto finish;
}
- /* See if we have a foward declaration or a definition. */
+ /* See if we have a forward declaration or a definition. */
tok = cp_lexer_peek_nth_token (parser->lexer, 2);
/* Try a forward declaration first. */
@item -fobjc-direct-dispatch
@opindex fobjc-direct-dispatch
Allow fast jumps to the message dispatcher. On Darwin this is
-accompilished via the comm page.
+accomplished via the comm page.
@item -fobjc-exceptions
@opindex fobjc-exceptions
x = w * w;
If we performed the update in the first loop, the statement
- would be rescanned after first occurence of w is replaced,
+ would be rescanned after first occurrence of w is replaced,
the new uses would be placed to the beginning of the list,
and we would never process them. */
for (i = 0; VEC_iterate (tree, stmts, i, stmt); i++)
{
gcc_assert (is_gimple_reg (def));
- /* Note that just emiting the copies is fine -- there is no problem
+ /* Note that just emitting the copies is fine -- there is no problem
with ordering of phi nodes. This is because A is the single
predecessor of B, therefore results of the phi nodes cannot
appear as arguments of the phi nodes. */
if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
{
/* Replace the RETURN_EXPR with (a copy of) the
- MODIFY_EXPR hangning underneath. */
+ MODIFY_EXPR hanging underneath. */
*tp = copy_node (assignment);
}
else /* Else the RETURN_EXPR returns no value. */
&& IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (*tp))))
TREE_BLOCK (*tp) = id->block;
- /* We're duplicationg a CALL_EXPR. Find any corresponding
+ /* We're duplicating a CALL_EXPR. Find any corresponding
callgraph edges and update or duplicate them. */
if (TREE_CODE (*tp) == CALL_EXPR && id->node && get_callee_fndecl (*tp))
{
return copy_basic_block;
}
-/* Copy edges from BB into it's copy constructed ealier, scale profile
- accordingly. Edges will be taken care of
- later. Assume aux pointers to point to the copies of each BB */
+/* Copy edges from BB into its copy constructed earlier, scale profile
+ accordingly. Edges will be taken care of later. Assume aux
+ pointers to point to the copies of each BB. */
static void
copy_edges_for_bb (basic_block bb, int count_scale)
{
flags = old_edge->flags;
- /* Return edges do get a FALLTHU flag when the get inlined. */
+ /* Return edges do get a FALLTHRU flag when the get inlined. */
if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
&& old_edge->dest->aux != EXIT_BLOCK_PTR)
flags |= EDGE_FALLTHRU;
id->callee_cfun = cfun_to_copy;
/* If saving or cloning a function body, create new basic_block_info
- and label_to_block_maps. Otherwise, we're duplicaing a function
+ and label_to_block_maps. Otherwise, we're duplicating a function
body for inlining; insert our new blocks and labels into the
existing varrays. */
saving_or_cloning = (id->saving_p || id->cloning_p);
/* If we did not create a gimple value and we did not create a gimple
cast of a gimple value, then we will need to gimplify INIT_STMTS
at the end. Note that is_gimple_cast only checks the outer
- tree code, not its operand. Thus the explicit check that it's
+ tree code, not its operand. Thus the explicit check that its
operand is a gimple value. */
if (!is_gimple_val (rhs)
&& (!is_gimple_cast (rhs)
/* We don't account constants for now. Assume that the cost is amortized
by operations that do use them. We may re-consider this decision once
- we are able to optimize the tree before estimating it's size and break
+ we are able to optimize the tree before estimating its size and break
out static initializers. */
case IDENTIFIER_NODE:
case INTEGER_CST:
}
/* Save duplicate body in FN. MAP is used to pass around splay tree
- used to update argments in restore_body. */
+ used to update arguments in restore_body. */
/* Make and return duplicate of body in FN. Put copies of DECL_ARGUMENTS
in *arg_copy and of the static chain, if any, in *sc_copy. */
};
/* Pass: fixup_cfg - IPA passes or compilation of earlier functions might've
- changed some properties - such as marged functions nothrow. Remove now
+ changed some properties - such as marked functions nothrow. Remove now
redundant edges and basic blocks. */
static void
code. One day we'll want to generalize this code.
One class of common cases we handle is forward propagating a single use
- variale into a COND_EXPR.
+ variable into a COND_EXPR.
bb0:
x = a COND b;
OSDN Git Service
