diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2005-04-29 15:34:45 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2005-04-29 15:34:45 +0000 |
| commit | d566f6ef9806687996c52ce1395d18f7316e8345 (patch) | |
| tree | 3b78c2674c93e2275d0d3bf41205b0be32dd8d9e /gcc | |
| parent | d198b59ab12557edbafc2bba595f855caccfc6ec (diff) | |
| download | gcc-d566f6ef9806687996c52ce1395d18f7316e8345.zip gcc-d566f6ef9806687996c52ce1395d18f7316e8345.tar.gz gcc-d566f6ef9806687996c52ce1395d18f7316e8345.tar.bz2 | |
* tree-flow-inline.h, tree-ssa-operands.c: Fix comment typos.
From-SVN: r98994
Diffstat (limited to 'gcc')
| -rw-r--r-- | gcc/ChangeLog | 2 | ||||
| -rw-r--r-- | gcc/tree-flow-inline.h | 6 | ||||
| -rw-r--r-- | gcc/tree-ssa-operands.c | 4 |
3 files changed, 7 insertions, 5 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 7cf1f42..f521434 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -3,6 +3,8 @@ * tree-flow-inline.h: Fix a comment typo. * doc/tree-ssa.texi: Fix a typo. + * tree-flow-inline.h, tree-ssa-operands.c: Fix comment typos. + 2005-04-29 Nathan Sidwell <nathan@codesourcery.com> * config/fr30/fr30.c (fr30_expand_prologue): Use gcc_assert and diff --git a/gcc/tree-flow-inline.h b/gcc/tree-flow-inline.h index d8a0b4b..5da85e0 100644 --- a/gcc/tree-flow-inline.h +++ b/gcc/tree-flow-inline.h @@ -314,7 +314,7 @@ first_safe_imm_use (imm_use_iterator *imm, tree var) return imm->imm_use; } -/* Bump IMM to then next use in the list. */ +/* Bump IMM to the next use in the list. */ static inline use_operand_p next_safe_imm_use (imm_use_iterator *imm) { @@ -332,7 +332,7 @@ next_safe_imm_use (imm_use_iterator *imm) imm->imm_use = imm->imm_use->next; if (! end_safe_imm_use_p (imm)) { - /* This isnt the end, link iternode before the next use. */ + /* This isn't the end, link iternode before the next use. */ ptr->prev = imm->imm_use->prev; ptr->next = imm->imm_use; imm->imm_use->prev->next = ptr; @@ -380,7 +380,7 @@ first_readonly_imm_use (imm_use_iterator *imm, tree var) return imm->imm_use; } -/* Bump IMM to then next use in the list. */ +/* Bump IMM to the next use in the list. */ static inline use_operand_p next_readonly_imm_use (imm_use_iterator *imm) { diff --git a/gcc/tree-ssa-operands.c b/gcc/tree-ssa-operands.c index a010b30..7364052 100644 --- a/gcc/tree-ssa-operands.c +++ b/gcc/tree-ssa-operands.c @@ -1198,8 +1198,8 @@ swap_tree_operands (tree *exp0, tree *exp1) use1 = x; break; } - /* If both uses don't have operand entries, there isnt much we can do - at this point. Presumably we dont need to worry about it. */ + /* If both uses don't have operand entries, there isn't much we can do + at this point. Presumably we dont need to worry about it. */ if (use0 != NUM_USES (uses) && use1 != NUM_USES (uses)) { tree *tmp = USE_OP_PTR (uses, use1)->use; |