cgraphunit.c, [...]: Fix comment typos.

	* cgraphunit.c, tree-ssa-loop-ivopts.c,
	tree-ssa-structalias.c, tree-vectorizer.c, tree-vectorizer.h,
	config/sparc/sparc.c: Fix comment typos.

From-SVN: r100856

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 88a15fd..1995605 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,9 @@
+2005-06-12  Kazu Hirata  <kazu@codesourcery.com>
+
+       * cgraphunit.c, tree-ssa-loop-ivopts.c,
+       tree-ssa-structalias.c, tree-vectorizer.c, tree-vectorizer.h,
+       config/sparc/sparc.c: Fix comment typos.
+
 2005-06-12  Richard Earnshaw  <richard.earnshaw@arm.com>
 
        * arm/ieee754-df.s (aeabi_dcmpeq, aeabi_dcmplt, aeabi_dcmple)

diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index 67d5e49..2f993f3 100644 (file)
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -736,7 +736,7 @@ cgraph_varpool_assemble_pending_decls (void)
       if (!TREE_ASM_WRITTEN (decl) && !node->alias && !DECL_EXTERNAL (decl))
        {
          assemble_variable (decl, 0, 1, 0);
-         /* Local static vairables are neever seen by check_global_declarations
+         /* Local static variables are never seen by check_global_declarations
             so we need to output debug info by hand.  */
          if (decl_function_context (decl) && errorcount == 0 && sorrycount == 0)
            {

diff --git a/gcc/config/sparc/sparc.c b/gcc/config/sparc/sparc.c
index 6b46165..edbde43 100644 (file)
--- a/gcc/config/sparc/sparc.c
+++ b/gcc/config/sparc/sparc.c
@@ -7978,7 +7978,7 @@ sparc_handle_vis_mul8x16 (int fncode, tree inner_type, tree elts0, tree elts1)
 
 }
 /* Handle TARGET_FOLD_BUILTIN target hook.
-   Fold builtin functions for SPARC intrinsics.  If INGNORE is true the
+   Fold builtin functions for SPARC intrinsics.  If IGNORE is true the
    result of the function call is ignored.  NULL_TREE is returned if the
    function could not be folded.  */
 

diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c
index ab3247c..2d474d3 100644 (file)
--- a/gcc/tree-ssa-loop-ivopts.c
+++ b/gcc/tree-ssa-loop-ivopts.c
@@ -1492,7 +1492,7 @@ may_be_unaligned_p (tree ref)
   unsigned base_align;
 
   /* TARGET_MEM_REFs are translated directly to valid MEMs on the target,
-     thus they are not missaligned.  */
+     thus they are not misaligned.  */
   if (TREE_CODE (ref) == TARGET_MEM_REF)
     return false;
 

diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c
index 00ecb7f..25c2a44 100644 (file)
--- a/gcc/tree-ssa-structalias.c
+++ b/gcc/tree-ssa-structalias.c
@@ -80,7 +80,7 @@ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
    DEREF is a constraint expression type used to represent *x, whether
    it appears on the LHS or the RHS of a statement. 
    ADDRESSOF is a constraint expression used to represent &x, whether
-   it apepars on the LHS or the RHS of a statement.
+   it appears on the LHS or the RHS of a statement.
    
    Each pointer variable in the program is assigned an integer id, and
    each field of a structure variable is assigned an integer id as well.
@@ -137,8 +137,8 @@ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
   causes Sol(P) <- Sol(P) union Sol(Q).
   
   7.  As we visit each node, all complex constraints associated with
-  that node are processed by adding approriate copy edges to the graph, or the
-  approriate variables to the solution set.  
+  that node are processed by adding appropriate copy edges to the graph, or the
+  appropriate variables to the solution set.  
 
   8. The process of walking the graph is iterated until no solution
   sets change.
@@ -245,7 +245,7 @@ DEF_VEC_P(varinfo_t);
 
 DEF_VEC_ALLOC_P(varinfo_t, gc);
 
-/* Table of variable info structures for constraint variables.  Indexed direcly
+/* Table of variable info structures for constraint variables.  Indexed directly
    by variable info id.  */
 static VEC(varinfo_t,gc) *varmap;
 #define get_varinfo(n) VEC_index(varinfo_t, varmap, n)
@@ -1582,7 +1582,7 @@ perform_var_substitution (constraint_graph_t graph)
          /* Theorem 4 in Rountev and Chandra: If i is a direct node,
             then Solution(i) is a subset of Solution (w), where w is a
             predecessor in the graph.  
-            Corrolary: If all predecessors of i have the same
+            Corollary: If all predecessors of i have the same
             points-to set, then i has that same points-to set as
             those predecessors.  */
          tmp = BITMAP_ALLOC (NULL);
@@ -3052,7 +3052,7 @@ init_base_vars (void)
   /* readonly memory points to anything, in order to make deref
      easier.  In reality, it points to anything the particular
      readonly variable can point to, but we don't track this
-     seperately. */
+     separately. */
   lhs.type = SCALAR;
   lhs.var = readonly_id;
   lhs.offset = 0;

diff --git a/gcc/tree-vectorizer.c b/gcc/tree-vectorizer.c
index c6002c4..1f612c5 100644 (file)
--- a/gcc/tree-vectorizer.c
+++ b/gcc/tree-vectorizer.c
@@ -1748,7 +1748,7 @@ vect_is_simple_use (tree operand, loop_vec_info loop_vinfo, tree *def_stmt,
 
    TODO:
    Detect a cross-iteration def-use cucle that represents a simple
-   reduction computation. We look for the followng pattern:
+   reduction computation. We look for the following pattern:
 
    loop_header:
      a1 = phi < a0, a2 >

diff --git a/gcc/tree-vectorizer.h b/gcc/tree-vectorizer.h
index 7892e0a..332025b 100644 (file)
--- a/gcc/tree-vectorizer.h
+++ b/gcc/tree-vectorizer.h
@@ -56,7 +56,7 @@ enum dr_alignment_support {
   dr_aligned
 };
 
-/* Define type of def-use cross-iteraiton cycle.  */
+/* Define type of def-use cross-iteration cycle.  */
 enum vect_def_type {
   vect_constant_def,
   vect_invariant_def,