diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-03-31 17:13:31 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-03-31 17:13:31 +0000 |
| commit | 4c9899442c741553dafcc7200453facc56916103 (patch) | |
| tree | 6544ab3575c2f1550b952adb35ce9a54e148107e | |
| parent | 740863c3e273224b1fd7b6cfffde58ae89df3614 (diff) | |
| download | gcc-4c9899442c741553dafcc7200453facc56916103.tar.gz | |
* tree-ssa-alias.c: Follow spelling conventions.
* doc/tree-ssa.texi: Fix a typo.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@97334 138bc75d-0d04-0410-961f-82ee72b054a4
| -rw-r--r-- | gcc/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/doc/tree-ssa.texi | 2 | ||||
| -rw-r--r-- | gcc/tree-ssa-alias.c | 4 |
3 files changed, 8 insertions, 3 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 66e07c72ed9..7cf6097b988 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2005-03-31 Kazu Hirata <kazu@cs.umass.edu> + + * tree-ssa-alias.c: Follow spelling conventions. + * doc/tree-ssa.texi: Fix a typo. + 2005-03-31 J"orn Rennecke <joern.rennecke@st.com> * postreload-gcse.c: Include target.h. diff --git a/gcc/doc/tree-ssa.texi b/gcc/doc/tree-ssa.texi index 4679912fa9a..27e0d34f550 100644 --- a/gcc/doc/tree-ssa.texi +++ b/gcc/doc/tree-ssa.texi @@ -685,7 +685,7 @@ void f() The optimizers need to associate attributes with statements and variables during the optimization process. For instance, we need to -know what basic block does a statement belong to or whether a variable +know what basic block a statement belongs to or whether a variable has aliases. All these attributes are stored in data structures called annotations which are then linked to the field @code{ann} in @code{struct tree_common}. diff --git a/gcc/tree-ssa-alias.c b/gcc/tree-ssa-alias.c index c08cf3b1bfa..0327e3441b2 100644 --- a/gcc/tree-ssa-alias.c +++ b/gcc/tree-ssa-alias.c @@ -2709,7 +2709,7 @@ push_fields_onto_fieldstack (tree type, VEC(fieldoff_t) **fieldstack, { size_t before = VEC_length (fieldoff_t, *fieldstack); /* Empty structures may have actual size, like in C++. So see if we - actually end up pushing a field, and if not, if the size is non-zero, + actually end up pushing a field, and if not, if the size is nonzero, push the field onto the stack */ push_fields_onto_fieldstack (TREE_TYPE (field), fieldstack, offset); if (before == VEC_length (fieldoff_t, *fieldstack) @@ -2739,7 +2739,7 @@ push_fields_onto_fieldstack (tree type, VEC(fieldoff_t) **fieldstack, push_fields_onto_fieldstack (TREE_TYPE (field), fieldstack, offset + bitpos_of_field (field)); /* Empty structures may have actual size, like in C++. So see if we - actually end up pushing a field, and if not, if the size is non-zero, + actually end up pushing a field, and if not, if the size is nonzero, push the field onto the stack */ if (before == VEC_length (fieldoff_t, *fieldstack) && DECL_SIZE (field) |