diff options
author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-05-19 03:05:49 +0000 |
---|---|---|
committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-05-19 03:05:49 +0000 |
commit | c78cbec85ead213282b6beaf5815ce68aa6bdaa8 (patch) | |
tree | 2515da9a6676ddb153df106225173fc9b07d620d /gcc/tree-cfg.c | |
parent | e168332da6a7399278e91f551b41c1a2544574c2 (diff) | |
download | gcc-c78cbec85ead213282b6beaf5815ce68aa6bdaa8.tar.gz |
gcc/
* cfgexpand.c, tree-cfg.c, tree-inline.c, tree-optimize.c,
tree-ssa-forwprop.c: Fix comment typos.
* doc/invoke.texi: Fix a typo.
cp/
* parser.c: Fix comment typos.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@99944 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-cfg.c')
-rw-r--r-- | gcc/tree-cfg.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/tree-cfg.c b/gcc/tree-cfg.c index c1419827e1f..9eeb7839287 100644 --- a/gcc/tree-cfg.c +++ b/gcc/tree-cfg.c @@ -1359,7 +1359,7 @@ replace_uses_by (tree name, tree val) 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++) @@ -1398,7 +1398,7 @@ tree_merge_blocks (basic_block a, basic_block b) { 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. */ |