OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

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
This commit is contained in:
Kazu Hirata 2005-04-29 15:06:07 +00:00 committed by Kazu Hirata
parent 4e81e7c201
commit be12e697e4
3 changed files with 7 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -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

2
gcc/doc/tree-ssa.texi
View File

@ -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)

2
gcc/tree-flow-inline.h
View File

@ -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;