aboutsummaryrefslogtreecommitdiff
path: root/gcc
diff options
context:
space:
mode:
authorKazu Hirata <kazu@codesourcery.com>2006-06-30 19:29:39 +0000
committerKazu Hirata <kazu@gcc.gnu.org>2006-06-30 19:29:39 +0000
commit2a8a8292ee7f7e775c7bff8074dead0a8a2919ea (patch)
tree1fb738fe0271684322341bb9f99dd331266561c6 /gcc
parent27651ad32c903c079fa300a4d134e60567935567 (diff)
downloadgcc-2a8a8292ee7f7e775c7bff8074dead0a8a2919ea.zip
gcc-2a8a8292ee7f7e775c7bff8074dead0a8a2919ea.tar.gz
gcc-2a8a8292ee7f7e775c7bff8074dead0a8a2919ea.tar.bz2
cfgexpand.c, [...]: Fix comment typos.
* cfgexpand.c, config/i386/i386.c, genpreds.c, tree-cfg.c: Fix comment typos. From-SVN: r115098
Diffstat (limited to 'gcc')
-rw-r--r--gcc/ChangeLog5
-rw-r--r--gcc/cfgexpand.c2
-rw-r--r--gcc/config/i386/i386.c2
-rw-r--r--gcc/genpreds.c4
-rw-r--r--gcc/tree-cfg.c2
5 files changed, 10 insertions, 5 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index e5cc18a..7ba6c45 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+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>
PR c++/26905
diff --git a/gcc/cfgexpand.c b/gcc/cfgexpand.c
index 1f43a32..630a82a 100644
--- a/gcc/cfgexpand.c
+++ b/gcc/cfgexpand.c
@@ -1626,7 +1626,7 @@ tree_expand_cfg (void)
init_block = construct_init_block ();
/* 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)
e->flags &= ~EDGE_EXECUTABLE;
diff --git a/gcc/config/i386/i386.c b/gcc/config/i386/i386.c
index 6c8e1a7..958bd61 100644
--- a/gcc/config/i386/i386.c
+++ b/gcc/config/i386/i386.c
@@ -68,7 +68,7 @@ Boston, MA 02110-1301, USA. */
#define COSTS_N_BYTES(N) ((N) * 2)
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 (3), /* cost of a lea instruction */
COSTS_N_BYTES (2), /* variable shift costs */
diff --git a/gcc/genpreds.c b/gcc/genpreds.c
index 655c4e6..adc3e48 100644
--- a/gcc/genpreds.c
+++ b/gcc/genpreds.c
@@ -373,7 +373,7 @@ add_mode_tests (struct pred_data *p)
case AND:
/* The switch code generation in write_predicate_stmts prefers
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. */
if (generate_switch_p (XEXP (subexp, 0)))
pos = &XEXP (subexp, 1);
@@ -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
generate efficient switch statements. */
diff --git a/gcc/tree-cfg.c b/gcc/tree-cfg.c
index 6dbb7d3..82adabd 100644
--- a/gcc/tree-cfg.c
+++ b/gcc/tree-cfg.c
@@ -3121,7 +3121,7 @@ reinstall_phi_args (edge new_edge, edge old_edge)
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
near its "logical" location. This is of most help to humans looking
at debugging dumps. */