diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-04-29 15:34:45 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-04-29 15:34:45 +0000 |
| commit | 17dc88a9b40b154ecfc8fe7c693efc60a1b3ce0c (patch) | |
| tree | 3b78c2674c93e2275d0d3bf41205b0be32dd8d9e | |
| parent | c6871095139bbc19c1716601d755c6ca97c56ead (diff) | |
| download | ppe42-gcc-17dc88a9b40b154ecfc8fe7c693efc60a1b3ce0c.tar.gz ppe42-gcc-17dc88a9b40b154ecfc8fe7c693efc60a1b3ce0c.zip | |
* tree-flow-inline.h, tree-ssa-operands.c: Fix comment typos.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@98994 138bc75d-0d04-0410-961f-82ee72b054a4
| -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 7cf1f42fecf..f52143430ef 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 d8a0b4b727c..5da85e049e1 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 a010b3040ef..7364052e10f 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; |
