diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2005-04-29 15:06:07 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2005-04-29 15:06:07 +0000 |
| commit | be12e697e42187347dffea36e37db82cf04d37a5 (patch) | |
| tree | 53b2bf17c9be2fae7bff6c994de299e07f052fb5 | |
| parent | 4e81e7c201f6093138fa387d8bdc708a279c6f0a (diff) | |
| download | gcc-be12e697e42187347dffea36e37db82cf04d37a5.zip gcc-be12e697e42187347dffea36e37db82cf04d37a5.tar.gz gcc-be12e697e42187347dffea36e37db82cf04d37a5.tar.bz2 | |
tree-flow-inline.h: Fix a comment typo.
* tree-flow-inline.h: Fix a comment typo.
* doc/tree-ssa.texi: Fix a typo.
From-SVN: r98992
| -rw-r--r-- | gcc/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/doc/tree-ssa.texi | 2 | ||||
| -rw-r--r-- | gcc/tree-flow-inline.h | 2 |
3 files changed, 7 insertions, 2 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 889a78e..7cf1f42 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2005-04-29 Kazu Hirata <kazu@cs.umass.edu> + + * tree-flow-inline.h: Fix a comment typo. + * doc/tree-ssa.texi: Fix a typo. + 2005-04-29 Nathan Sidwell <nathan@codesourcery.com> * config/fr30/fr30.c (fr30_expand_prologue): Use gcc_assert and diff --git a/gcc/doc/tree-ssa.texi b/gcc/doc/tree-ssa.texi index faf8ccc..8528406 100644 --- a/gcc/doc/tree-ssa.texi +++ b/gcc/doc/tree-ssa.texi @@ -1051,7 +1051,7 @@ through the use list, preventing insertions and deletions in the list from resulting in invalid pointers. This is a little slower since it adds a placeholder element and moves it through the list. This element must be also be removed if the loop is terminated early. A macro -(@code{BREAK_FROM SAFE_IMM_USE} is provided for this: +(@code{BREAK_FROM SAFE_IMM_USE}) is provided for this: @smallexample FOR_EACH_IMM_USE_SAFE (use_p, iter, var) diff --git a/gcc/tree-flow-inline.h b/gcc/tree-flow-inline.h index 87a243d..d8a0b4b 100644 --- a/gcc/tree-flow-inline.h +++ b/gcc/tree-flow-inline.h @@ -203,7 +203,7 @@ static inline void link_imm_use_to_list (ssa_imm_use_t *linknode, ssa_imm_use_t *list) { /* Link the new node at the head of the list. If we are in the process of - traversing the list, we wont visit any new nodes added to it. */ + traversing the list, we won't visit any new nodes added to it. */ linknode->prev = list; linknode->next = list->next; list->next->prev = linknode; |