diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 12872d86a2020cd145b763bff8a9b2f0fd6c2bb8..e2568bc0c2b0c3214955b05e7d1a5dd626b0db7c 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,10 @@
+2005-05-04 Kazu Hirata <kazu@cs.umass.edu>
+
+ * tree-flow-inline.h, tree-ssa-operands.c,
+ tree-ssa-operands.h, tree-ssa-opfinalize.h:
+ Likewise. tree-vn.c: Fix comment typos.
+ * doc/passes.texi, doc/tree-ssa.texi: Fix typos.
+
2005-05-04 Paolo Bonzini <bonzini@gnu.org>
* doc/tm.texi (Target Hooks): Document
diff --git a/gcc/doc/passes.texi b/gcc/doc/passes.texi
index f2aba6d975865f56037eff6df37eb28ed9ac7d62..8e123667ec58b3cba177bf5e64874eadfe7ec88a 100644
--- a/gcc/doc/passes.texi
+++ b/gcc/doc/passes.texi
@@ -409,7 +409,7 @@ the number of elements operated upon in parallel in each iteration, and the
Additional loop transformations such as peeling and versioning may take place
to align the number of iterations, and to align the memory accesses in the loop.
The pass is implemented in @file{tree-vectorizer.c} (the main driver and general
-utilities), @file{tree-vect-analyze.c} and @file{tree-vect-tranform.c}.
+utilities), @file{tree-vect-analyze.c} and @file{tree-vect-transform.c}.
Analysis of data references is in @file{tree-data-ref.c}.
@item Tree level if-conversion for vectorizer
diff --git a/gcc/doc/tree-ssa.texi b/gcc/doc/tree-ssa.texi
index 88dcacf912d87f33bc047469847772feeea22599..cbceb37073c491f13af7fcd1f5c295d4f8f9a5fc 100644
--- a/gcc/doc/tree-ssa.texi
+++ b/gcc/doc/tree-ssa.texi
@@ -831,7 +831,7 @@ The following access routines are available for examining operands:
@enumerate
@item @code{SINGLE_SSA_@{USE,DEF,TREE@}_OPERAND}: These accessors will return
-NULL unless there is exactly one operand mathcing the specified flags. If
+NULL unless there is exactly one operand matching the specified flags. If
there is exactly one operand, the operand is returned as either a @code{tree},
@code{def_operand_p}, or @code{use_operand_p}.
diff --git a/gcc/tree-flow-inline.h b/gcc/tree-flow-inline.h
index 3fa6259aa8ef203cb894c1cd93a09b4c54c61153..00fb7ac6d3df5457fdc00084770d054514bd1ec9 100644
--- a/gcc/tree-flow-inline.h
+++ b/gcc/tree-flow-inline.h
@@ -957,7 +957,7 @@ op_iter_next_tree (ssa_op_iter *ptr)
}
-/* This functiins clears the iterator PTR, and marks it done. This is normally
+/* This functions clears the iterator PTR, and marks it done. This is normally
used to prevent warnings in the compile about might be uninitailzied
components. */
@@ -1103,7 +1103,7 @@ op_iter_init_must_and_may_def (ssa_op_iter *ptr, tree stmt,
}
-/* If there is a single opernad in STMT matching FLAGS, return it. Otherwise
+/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
return NULL. PTR is the iterator to use. */
static inline tree
single_ssa_tree_operand (tree stmt, int flags)
@@ -1121,7 +1121,7 @@ single_ssa_tree_operand (tree stmt, int flags)
}
-/* If there is a single opernad in STMT matching FLAGS, return it. Otherwise
+/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
return NULL. PTR is the iterator to use. */
static inline use_operand_p
single_ssa_use_operand (tree stmt, int flags)
@@ -1140,7 +1140,7 @@ single_ssa_use_operand (tree stmt, int flags)
-/* If there is a single opernad in STMT matching FLAGS, return it. Otherwise
+/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
return NULL. PTR is the iterator to use. */
static inline def_operand_p
single_ssa_def_operand (tree stmt, int flags)
@@ -1158,7 +1158,7 @@ single_ssa_def_operand (tree stmt, int flags)
}
-/* If there is a single opernad in STMT matching FLAGS, return it. Otherwise
+/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
return NULL. PTR is the iterator to use. */
static inline bool
zero_ssa_operands (tree stmt, int flags)
@@ -1170,7 +1170,7 @@ zero_ssa_operands (tree stmt, int flags)
}
-/* Return the number of opernads mathcing FLAGS in STMT. */
+/* Return the number of operands matching FLAGS in STMT. */
static inline int
num_ssa_operands (tree stmt, int flags)
{
@@ -1285,7 +1285,7 @@ op_iter_init_phiuse (ssa_op_iter *ptr, tree phi, int flags)
comp = (is_gimple_reg (phi_def) ? SSA_OP_USE : SSA_OP_VIRTUAL_USES);
- /* if the PHI node deosn't the operand type we care about, we're done. */
+ /* If the PHI node doesn't the operand type we care about, we're done. */
if ((flags & comp) == 0)
{
ptr->done = true;
@@ -1299,7 +1299,7 @@ op_iter_init_phiuse (ssa_op_iter *ptr, tree phi, int flags)
}
-/* Start an iterator for a PHI defintion. */
+/* Start an iterator for a PHI definition. */
static inline def_operand_p
op_iter_init_phidef (ssa_op_iter *ptr, tree phi, int flags)
@@ -1314,7 +1314,7 @@ op_iter_init_phidef (ssa_op_iter *ptr, tree phi, int flags)
comp = (is_gimple_reg (phi_def) ? SSA_OP_DEF : SSA_OP_VIRTUAL_DEFS);
- /* if the PHI node deosn't the operand type we care about, we're done. */
+ /* If the PHI node doesn't the operand type we care about, we're done. */
if ((flags & comp) == 0)
{
ptr->done = true;
diff --git a/gcc/tree-ssa-operands.c b/gcc/tree-ssa-operands.c
index d46bf8478385093cd8f671920e78624f795c7094..d2a48bbf530c97f3661bfec1dbb94402c739c680 100644
--- a/gcc/tree-ssa-operands.c
+++ b/gcc/tree-ssa-operands.c
@@ -104,7 +104,7 @@ Boston, MA 02111-1307, USA. */
struct opbuild_list_d GTY (())
{
varray_type vars; /* The VAR_DECLS tree. */
- varray_type uid; /* The sort value for virtaul symbols. */
+ varray_type uid; /* The sort value for virtual symbols. */
varray_type next; /* The next index in the sorted list. */
int first; /* First element in list. */
unsigned num; /* Number of elements. */
@@ -284,7 +284,7 @@ opbuild_append_virtual (struct opbuild_list_d *list, tree var)
}
else
{
- /* Dont enter duplicates at all. */
+ /* Don't enter duplicates at all. */
if (VARRAY_UINT (list->uid, last) == var_uid)
return;
@@ -359,7 +359,7 @@ opbuild_clear (struct opbuild_list_d *list)
}
-/* Remove ELEM from LIST where PREV is the rpevious element. Return the next
+/* Remove ELEM from LIST where PREV is the previous element. Return the next
element. */
static inline int
@@ -1064,7 +1064,7 @@ copy_virtual_operands (tree dest, tree src)
build_ssa_operands (dest);
- /* Copy all the virtuial fields. */
+ /* Copy all the virtual fields. */
FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VUSE)
append_vuse (t);
FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VMAYDEF)
diff --git a/gcc/tree-ssa-operands.h b/gcc/tree-ssa-operands.h
index 2fb8d97f08428fa5dc1dae4dcda183311c1f2d4a..12f75ceec06c0fd8178409d8f6603b6eb2d5fb60 100644
--- a/gcc/tree-ssa-operands.h
+++ b/gcc/tree-ssa-operands.h
@@ -267,9 +267,9 @@ typedef struct ssa_operand_iterator_d
!op_iter_done (&(ITER)); \
op_iter_next_maymustdef (&(KILLVAR), &(DEFVAR), &(ITER)))
-/* This macro will execute a loop over all the arguemnts of a PHI which
- match FLAGS. A use_operand_p is alwasy returned via USEVAR. FLAGS
- can be eiother SSA_OP_USE or SSA_OP_VIRTUAL_USES or SSA_OP_ALL_USES. */
+/* This macro will execute a loop over all the arguments of a PHI which
+ match FLAGS. A use_operand_p is always returned via USEVAR. FLAGS
+ can be either SSA_OP_USE or SSA_OP_VIRTUAL_USES or SSA_OP_ALL_USES. */
#define FOR_EACH_PHI_ARG (USEVAR, STMT, ITER, FLAGS) \
for ((USEVAR) = op_iter_init_phiuse (&(ITER), STMT, FLAGS); \
!op_iter_done (&(ITER)); \
@@ -314,7 +314,7 @@ typedef struct ssa_operand_iterator_d
/* This macro returns TRUE if there are no operands matching FLAGS in STMT. */
#define ZERO_SSA_OPERANDS(STMT, FLAGS) zero_ssa_operands (STMT, FLAGS)
-/* THis macro counts the number of operands in STMT matching FLAGS. */
+/* This macro counts the number of operands in STMT matching FLAGS. */
#define NUM_SSA_OPERANDS(STMT, FLAGS) num_ssa_operands (STMT, FLAGS)
#endif /* GCC_TREE_SSA_OPERANDS_H */
diff --git a/gcc/tree-ssa-opfinalize.h b/gcc/tree-ssa-opfinalize.h
index 16850c06d49e34e4a5933d92476313d990e151d8..3415cf46979999d9e8a384b070499b018781c856 100644
--- a/gcc/tree-ssa-opfinalize.h
+++ b/gcc/tree-ssa-opfinalize.h
@@ -20,7 +20,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
/* This file contains common code which is used by each of the 5 operand
- types. Macros are defined to specify the varying componenets.
+ types. Macros are defined to specify the varying components.
FINALIZE_FUNC - name of finalize function.
FINALIZE_ALLOC - name of allocation routine.
@@ -29,8 +29,8 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
FINALIZE_OPS - Lead element in list.
FINALIZE_USE_PTR - How to get the use_operand_p, if this is a use operand.
FINALIZE_INITIALIZE - How to initialize an element.
- FINALIZE_ELEM - How to retreive an element.
- FINALIZE_BASE - How to retreive the base variable of an element.
+ FINALIZE_ELEM - How to retrieve an element.
+ FINALIZE_BASE - How to retrieve the base variable of an element.
FINALIZE_BASE_TYPE - Type of the base variable.
FINALIZE_OPBUILD - Opbuild array for these nodes.
FINALIZE_OPBUILD_ELEM - How to get an element from the opbuild list.
diff --git a/gcc/tree-vn.c b/gcc/tree-vn.c
index c1178e382b133fb433bd4b16671e8ea5f869d4aa..5f003720e4dfb4f6b1a01d692d1584e46ab072f2 100644
--- a/gcc/tree-vn.c
+++ b/gcc/tree-vn.c
@@ -175,7 +175,7 @@ set_value_handle (tree e, tree v)
/* Insert EXPR into VALUE_TABLE with value VAL, and add expression
- EXPR to the value set for value VAL. STMT represent the stmt
+ EXPR to the value set for value VAL. STMT represents the stmt
associated with EXPR. It is used when computing a hash value for EXPR. */
void
@@ -202,7 +202,7 @@ vn_add (tree expr, tree val, tree stmt)
/* Search in VALUE_TABLE for an existing instance of expression EXPR,
and return its value, or NULL if none has been set. STMT
- represent the stmt associated with EXPR. It is arused when computing the
+ represents the stmt associated with EXPR. It is used when computing the
hash value for EXPR. */
tree
@@ -228,7 +228,7 @@ vn_lookup (tree expr, tree stmt)
/* Like vn_lookup, but creates a new value for expression EXPR, if
EXPR doesn't already have a value. Return the existing/created
- value for EXPR. STMT represent the stmt associated with EXPR. It is used
+ value for EXPR. STMT represents the stmt associated with EXPR. It is used
when computing the hash value for EXPR. */
tree