tree-ssa-alias.c: Follow spelling conventions.

	* tree-ssa-alias.c: Follow spelling conventions.
	* doc/tree-ssa.texi: Fix a typo.

From-SVN: r97334

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 66e07c72ed9d5d6baeb235abce892692f72b24b7..7cf6097b988e66500a2b92590ad40dc991252eb1 100644 (file)
--- 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 4679912fa9aacbc4ae0d2132385952ebde3c441c..27e0d34f55071f138f0a6a54a139238926576a85 100644 (file)
--- 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 c08cf3b1bfa1125aadb8d4820b23fca829d6a88b..0327e3441b297ba4d981f916c906a553fd2e76ec 100644 (file)
--- 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)