* pointer-set.c, tree-vectorizer.c: Fix comment typos.

From-SVN: r89094

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 6dac1c7220a010150e17c79a04fd80f24b0f8f93..2f7ec20f9ef28360e988f788ceda139843332b80 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,7 @@
+2004-10-15  Kazu Hirata  <kazu@cs.umass.edu>
+
+       * pointer-set.c, tree-vectorizer.c: Fix comment typos.
+
 2004-10-15  Diego Novillo  <dnovillo@redhat.com>
 
        * tree-optimize.c (execute_one_pass): Stop timer right after

diff --git a/gcc/pointer-set.c b/gcc/pointer-set.c
index 510ae430d30f835c5ba156998a47680795fcfac1..06592d741a667328215c3c03004f0503c35dd814 100644 (file)
--- a/gcc/pointer-set.c
+++ b/gcc/pointer-set.c
@@ -87,7 +87,7 @@ void pointer_set_destroy (struct pointer_set_t *pset)
 
    Collisions are resolved by linear probing.  More complicated
    collision management schemes are only useful when the load factor
-   significatly exceeds 0.5, and we never let that happen. */
+   significantly exceeds 0.5, and we never let that happen. */
 int
 pointer_set_contains (struct pointer_set_t *pset, void *p)
 {

diff --git a/gcc/tree-vectorizer.c b/gcc/tree-vectorizer.c
index e7ade73d3116d64af80981dd7a331bebe31711c0..30af48475dbc89ded652a7585de5d87d7659a50c 100644 (file)
--- a/gcc/tree-vectorizer.c
+++ b/gcc/tree-vectorizer.c
@@ -216,7 +216,7 @@ static void vect_generate_tmps_on_preheader (loop_vec_info,
 static tree vect_build_loop_niters (loop_vec_info);
 static void vect_update_ivs_after_vectorizer (struct loop *, tree); 
 
-/* Loop transformations prior to vectorizeration.  */
+/* Loop transformations prior to vectorization.  */
 
 /* Loop transformations entry point function. 
    It can be used outside of the vectorizer 
@@ -955,7 +955,7 @@ tree_duplicate_loop_to_edge (struct loop *loop, struct loops *loops,
   definitions = marked_ssa_names ();
   allocate_new_names (definitions);
   update_phis_for_duplicate_loop (loop, new_loop, e == exit_e);
-  /* Here, using assumption (5), we do not propagate new names futher 
+  /* Here, using assumption (5), we do not propagate new names further 
      than on phis of the exit from the second loop.  */
   rename_variables_in_loop (new_loop);
   free_new_names (definitions);
@@ -1012,7 +1012,7 @@ tree_duplicate_loop_to_edge (struct loop *loop, struct loops *loops,
   /* 4c. Add condition at the end of preheader bb.  */
   skip_e = add_loop_guard (pre_header_bb, pre_condition, first_exit_bb);
 
-  /* 4d. Updtae phis at first loop exit and propagate changes 
+  /* 4d. Update phis at first loop exit and propagate changes 
      to the phis of second loop.  */
   update_phi_nodes_for_guard (skip_e, first_loop);
 
@@ -2951,7 +2951,7 @@ vect_update_ivs_after_vectorizer (struct loop *loop, tree niters)
 }
 
 
-/* This function is the main driver of tranformation 
+/* This function is the main driver of transformation 
    to be done for loop before vectorizing it in case of 
    unknown loop bound.  */