Commit 2a8a8292 by Kazu Hirata Committed by Kazu Hirata

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

	* cfgexpand.c, config/i386/i386.c, genpreds.c, tree-cfg.c: Fix
	comment typos.

From-SVN: r115098
parent 27651ad3
2006-06-30 Kazu Hirata <kazu@codesourcery.com>
* cfgexpand.c, config/i386/i386.c, genpreds.c, tree-cfg.c: Fix
comment typos.
2006-06-29 Jason Merrill <jason@redhat.com> 2006-06-29 Jason Merrill <jason@redhat.com>
PR c++/26905 PR c++/26905
......
...@@ -1626,7 +1626,7 @@ tree_expand_cfg (void) ...@@ -1626,7 +1626,7 @@ tree_expand_cfg (void)
init_block = construct_init_block (); init_block = construct_init_block ();
/* Clear EDGE_EXECUTABLE on the entry edge(s). It is cleaned from the /* Clear EDGE_EXECUTABLE on the entry edge(s). It is cleaned from the
remainining edges in expand_gimple_basic_block. */ remaining edges in expand_gimple_basic_block. */
FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
e->flags &= ~EDGE_EXECUTABLE; e->flags &= ~EDGE_EXECUTABLE;
......
...@@ -68,7 +68,7 @@ Boston, MA 02110-1301, USA. */ ...@@ -68,7 +68,7 @@ Boston, MA 02110-1301, USA. */
#define COSTS_N_BYTES(N) ((N) * 2) #define COSTS_N_BYTES(N) ((N) * 2)
static const static const
struct processor_costs size_cost = { /* costs for tunning for size */ struct processor_costs size_cost = { /* costs for tuning for size */
COSTS_N_BYTES (2), /* cost of an add instruction */ COSTS_N_BYTES (2), /* cost of an add instruction */
COSTS_N_BYTES (3), /* cost of a lea instruction */ COSTS_N_BYTES (3), /* cost of a lea instruction */
COSTS_N_BYTES (2), /* variable shift costs */ COSTS_N_BYTES (2), /* variable shift costs */
......
...@@ -373,7 +373,7 @@ add_mode_tests (struct pred_data *p) ...@@ -373,7 +373,7 @@ add_mode_tests (struct pred_data *p)
case AND: case AND:
/* The switch code generation in write_predicate_stmts prefers /* The switch code generation in write_predicate_stmts prefers
rtx code tests to be at the top of the expression tree. So rtx code tests to be at the top of the expression tree. So
push this AND down into the second operand of an exisiting push this AND down into the second operand of an existing
AND expression. */ AND expression. */
if (generate_switch_p (XEXP (subexp, 0))) if (generate_switch_p (XEXP (subexp, 0)))
pos = &XEXP (subexp, 1); pos = &XEXP (subexp, 1);
...@@ -563,7 +563,7 @@ write_match_code_switch (rtx exp) ...@@ -563,7 +563,7 @@ write_match_code_switch (rtx exp)
} }
} }
/* Given a predictate expression EXP, write out a sequence of stmts /* Given a predicate expression EXP, write out a sequence of stmts
to evaluate it. This is similar to write_predicate_expr but can to evaluate it. This is similar to write_predicate_expr but can
generate efficient switch statements. */ generate efficient switch statements. */
......
...@@ -3121,7 +3121,7 @@ reinstall_phi_args (edge new_edge, edge old_edge) ...@@ -3121,7 +3121,7 @@ reinstall_phi_args (edge new_edge, edge old_edge)
PENDING_STMT (old_edge) = NULL; PENDING_STMT (old_edge) = NULL;
} }
/* Returns the basic block after that the new basic block created /* Returns the basic block after which the new basic block created
by splitting edge EDGE_IN should be placed. Tries to keep the new block by splitting edge EDGE_IN should be placed. Tries to keep the new block
near its "logical" location. This is of most help to humans looking near its "logical" location. This is of most help to humans looking
at debugging dumps. */ at debugging dumps. */
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment