cgraph.h, [...]: Fix comment typos.

	* cgraph.h, cgraphunit.c, fold-const.c, lambda-mat.c,
	lambda.h, profile.c, tree-optimize.c, tree-sra.c, vec.h: Fix
	comment typos.  Follow spelling conventions.

From-SVN: r87490

10 files changed, 23 insertions, 17 deletions

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index e8f96df..e604a68 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,5 +1,11 @@
 2004-09-14  Kazu Hirata  <kazu@cs.umass.edu>
 
+	* cgraph.h, cgraphunit.c, fold-const.c, lambda-mat.c,
+	lambda.h, profile.c, tree-optimize.c, tree-sra.c, vec.h: Fix
+	comment typos.  Follow spelling conventions.
+
+2004-09-14  Kazu Hirata  <kazu@cs.umass.edu>
+
 	* config/darwin-c.c, config/alpha/alpha.c, config/i386/i386.c,
 	config/i386/predicates.md, config/sparc/sparc.c: Follow
 	spelling conventions.
diff --git a/gcc/cgraph.h b/gcc/cgraph.h
index 0af4447..ca355fe 100644
--- a/gcc/cgraph.h
+++ b/gcc/cgraph.h
@@ -96,7 +96,7 @@ struct cgraph_rtl_info GTY(())
    rest of the compilation continues.  When this reorgination is done,
    it will no longer be necessary to have the _decl_uid versions of
    local_static_vars_info and global_static_vars_info structures.
-   Having both structures is now requirred because the _ann_uid values
+   Having both structures is now required because the _ann_uid values
    for static variables are reset as each function is compiled.
    Currently, the analysis is done using the _decl_uid versions and
    converted to the _var_ann versions on demand.
diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index 73f5d6c..e04de96 100644
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -166,7 +166,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
 
 
 /* Additionally this file gathers information about how local statics
-   are used.  This is done in cgraph_charactize_statics.  After the
+   are used.  This is done in cgraph_characterize_statics.  After the
    call graph has been built, each function is analyzed to determine
    which local static variables are either read or written or have
    their address taken.  Any local static that has its address taken
@@ -2024,7 +2024,7 @@ bool has_proper_scope_for_analysis (tree t)
 }
 
 /* Check to see if T is a read or address of operation on a static var
-   we are interrested in analyzing.  FN is passed in to get access to
+   we are interested in analyzing.  FN is passed in to get access to
    its bit vectors.  */
 
 static void
@@ -2058,7 +2058,7 @@ check_rhs_var (struct cgraph_node *fn, tree t)
     }
 }
 
-/* Check to see if T is an assignement to a static var we are
+/* Check to see if T is an assignment to a static var we are
    interrested in analyzing.  FN is passed in to get access to its bit
    vectors.
 */
@@ -2325,7 +2325,7 @@ clear_static_vars_maps (int index)
 /* FIXME -- PROFILE-RESTRUCTURE: Change all *_decl_uid to *_ann_uid.  */
 
 /* Or in all of the bits from every callee into X, the caller's, bit
-   vector.  There are several cases to check to avoid the sparce
+   vector.  There are several cases to check to avoid the sparse
    bitmap oring.  */
 static void
 cgraph_propagate_bits (struct cgraph_node *x)
diff --git a/gcc/fold-const.c b/gcc/fold-const.c
index 4453f36..0dd0248 100644
--- a/gcc/fold-const.c
+++ b/gcc/fold-const.c
@@ -191,11 +191,11 @@ decode (HOST_WIDE_INT *words, unsigned HOST_WIDE_INT *low,
    indicates whether constant overflow has already occurred.  We force
    T's value to be within range of T's type (by setting to 0 or 1 all
    the bits outside the type's range).  We set TREE_OVERFLOWED if,
-  	OVERFLOWED is non-zero,
+  	OVERFLOWED is nonzero,
 	or OVERFLOWABLE is >0 and signed overflow occurs
 	or OVERFLOWABLE is <0 and any overflow occurs
    We set TREE_CONSTANT_OVERFLOWED if,
-        CONST_OVERFLOWED is non-zero
+        CONST_OVERFLOWED is nonzero
 	or we set TREE_OVERFLOWED.
   We return either the original T, or a copy.  */
 
diff --git a/gcc/lambda-mat.c b/gcc/lambda-mat.c
index 4734dc2..16fd65e 100644
--- a/gcc/lambda-mat.c
+++ b/gcc/lambda-mat.c
@@ -441,7 +441,7 @@ lambda_matrix_hermite (lambda_matrix mat, int n,
 	    }
 	}
 
-      /* Stop when only the diagonal element is non-zero.  */
+      /* Stop when only the diagonal element is nonzero.  */
       while (lambda_vector_first_nz (row, n, j + 1) < n)
 	{
 	  minimum_col = lambda_vector_min_nz (row, n, j);
@@ -548,7 +548,7 @@ lambda_matrix_left_hermite (lambda_matrix A, int m, int n,
     }
 }
 
-/* When it exists, return the first non-zero row in MAT after row
+/* When it exists, return the first nonzero row in MAT after row
    STARTROW.  Otherwise return rowsize.  */
 
 int
diff --git a/gcc/lambda.h b/gcc/lambda.h
index ec48ea4..36a9664 100644
--- a/gcc/lambda.h
+++ b/gcc/lambda.h
@@ -282,7 +282,7 @@ lambda_vector_equal (lambda_vector vec1, lambda_vector vec2, int size)
   return true;
 }
 
-/* Return the minimum non-zero element in vector VEC1 between START and N.
+/* Return the minimum nonzero element in vector VEC1 between START and N.
    We must have START <= N.  */
 
 static inline int
diff --git a/gcc/profile.c b/gcc/profile.c
index 7b0a667..e56f30e 100644
--- a/gcc/profile.c
+++ b/gcc/profile.c
@@ -686,7 +686,7 @@ compute_value_histograms (histogram_values values)
 
 #define BB_TO_GCOV_INDEX(bb)  ((bb)->index + 1)
 /* When passed NULL as file_name, initialize.
-   When passed something else, output the neccesary commands to change
+   When passed something else, output the necessary commands to change
    line to LINE and offset to FILE_NAME.  */
 static void
 output_location (char const *file_name, int line,
@@ -1029,7 +1029,7 @@ branch_prob (void)
 				     &offset, bb);
 		}
 
-	      /* Notice GOTO expressions we elliminated while constructing the
+	      /* Notice GOTO expressions we eliminated while constructing the
 	         CFG.  */
 	      if (bb->succ && !bb->succ->succ_next && bb->succ->goto_locus)
 	        {
diff --git a/gcc/tree-optimize.c b/gcc/tree-optimize.c
index c07701a..b9a2fa5 100644
--- a/gcc/tree-optimize.c
+++ b/gcc/tree-optimize.c
@@ -285,7 +285,7 @@ static struct tree_opt_pass **
 next_pass_1 (struct tree_opt_pass **list, struct tree_opt_pass *pass)
 {
 
-  /* A non-zero static_pass_number indicates that the
+  /* A nonzero static_pass_number indicates that the
      pass is already in the list.  */
   if (pass->static_pass_number)
     {
diff --git a/gcc/tree-sra.c b/gcc/tree-sra.c
index cde865a..4ebc061 100644
--- a/gcc/tree-sra.c
+++ b/gcc/tree-sra.c
@@ -182,7 +182,7 @@ type_can_be_decomposed_p (tree type)
   if (bitmap_bit_p (sra_type_decomp_cache, cache+1))
     return false;
 
-  /* The type must have a definite non-zero size.  */
+  /* The type must have a definite nonzero size.  */
   if (TYPE_SIZE (type) == NULL || integer_zerop (TYPE_SIZE (type)))
     goto fail;
 
diff --git a/gcc/vec.h b/gcc/vec.h
index d6fc8ad..43b7eab 100644
--- a/gcc/vec.h
+++ b/gcc/vec.h
@@ -186,11 +186,11 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
    
    int VEC_T_space (VEC(T) *v,int reserve)
 
-   If V has space for RESERVE additional entries, return non-zero.  If
+   If V has space for RESERVE additional entries, return nonzero.  If
    RESERVE is < 0, ensure there is at least one space slot.  You
    usually only need to use this if you are doing your own vector
    reallocation, for instance on an embedded vector.  This returns
-   non-zero in exactly the same circumstances that VEC_T_reserve
+   nonzero in exactly the same circumstances that VEC_T_reserve
    will.  */
 
 #define VEC_space(TDEF,V,R)	(VEC_OP(TDEF,space)(V,R))
@@ -203,7 +203,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
    slot.  These differ in their reallocation behaviour, the first will
    not create additional headroom, but the second mechanism will
    perform the usual exponential headroom increase.  Note this can
-   cause V to be reallocated.  Returns non-zero iff reallocation
+   cause V to be reallocated.  Returns nonzero iff reallocation
    actually occurred.  */
 
 #define VEC_reserve(TDEF,V,R)	(VEC_OP(TDEF,reserve)(&(V),R MEM_STAT_INFO))