[patch] gcc/*.c: Fix comment typos.

[Kazu Hirata <kazu at cs dot umass dot edu>]

Hi,

Committed as obvious.

Kazu Hirata

2004-09-20  Kazu Hirata  <kazu@cs.umass.edu>

	* cfg.c, tree-ssa-threadupdate.c, tree-vectorizer.c: Fix
	comment typos.

Index: cfg.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cfg.c,v
retrieving revision 1.67
diff -u -r1.67 cfg.c
--- cfg.c	19 Sep 2004 16:04:00 -0000	1.67
+++ cfg.c	20 Sep 2004 11:13:55 -0000
@@ -891,11 +891,11 @@
 
 /* An edge originally destinating BB of FREQUENCY and COUNT has been proved to
    leave the block by TAKEN_EDGE.  Update profile of BB such that edge E can be
-   redirected to destiantion of TAKEN_EDGE. 
+   redirected to destination of TAKEN_EDGE. 
 
    This function may leave the profile inconsistent in the case TAKEN_EDGE
    frequency or count is believed to be lower than FREQUENCY or COUNT
-   respectivly.  */
+   respectively.  */
 void
 update_bb_profile_for_threading (basic_block bb, int edge_frequency,
 				 gcov_type count, edge taken_edge)
Index: tree-ssa-threadupdate.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-threadupdate.c,v
retrieving revision 2.7
diff -u -r2.7 tree-ssa-threadupdate.c
--- tree-ssa-threadupdate.c	19 Sep 2004 16:04:01 -0000	2.7
+++ tree-ssa-threadupdate.c	20 Sep 2004 11:14:11 -0000
@@ -55,7 +55,7 @@
 	with the edge B'->C.
 
      4. For each PHI in B, find or create a PHI in B' with an identical
-	PHI_RESULT.  Add an argument to the PHI in B' which as the same
+	PHI_RESULT.  Add an argument to the PHI in B' which has the same
 	value as the PHI in B associated with the edge A->B.  Associate
 	the new argument in the PHI in B' with the edge A->B.
 
@@ -226,7 +226,7 @@
    to update the SSA graph for those names.
 
    We are also going to experiment with a true incremental update
-   scheme for the duplicated resources.  Of of the interesting
+   scheme for the duplicated resources.  One of the interesting
    properties we can exploit here is that all the resources set
    in BB will have the same IDFS, so we have one IDFS computation
    per block with incoming threaded edges, which can lower the
Index: tree-vectorizer.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-vectorizer.c,v
retrieving revision 2.9
diff -u -r2.9 tree-vectorizer.c
--- tree-vectorizer.c	19 Sep 2004 18:01:48 -0000	2.9
+++ tree-vectorizer.c	20 Sep 2004 11:14:13 -0000
@@ -2346,7 +2346,7 @@
 
    Input:
    ARRAY - an array_ref (possibly multidimensional) of type ARRAY_TYPE.
-   VECTYPE - we are interested in the misalignment modulu the size of vectype.
+   VECTYPE - we are interested in the misalignment modulo the size of vectype.
 	     if NULL: don't compute misalignment, just return the base of ARRAY.
    PREV_DIMENSIONS - initialized to one.
    MISALIGNMENT - the computed misalignment in bits.
@@ -3123,7 +3123,7 @@
 
 	  STRIP_NOPS(oprnd1);
 	  /* Only {address_base + offset} expressions are supported,  
-	     where address_base can be POINTER_TYPE or ARRRAY_TYPE and 
+	     where address_base can be POINTER_TYPE or ARRAY_TYPE and 
 	     offset can be anything but POINTER_TYPE or ARRAY_TYPE.  
 	     TODO: swap operands if {offset + address_base}.  */
 	  if ((TREE_CODE (TREE_TYPE (oprnd1)) == POINTER_TYPE