Commit ed8b7558 by Kazu Hirata Committed by Kazu Hirata

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

From-SVN: r89094
parent db3a9519
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> 2004-10-15 Diego Novillo <dnovillo@redhat.com>
* tree-optimize.c (execute_one_pass): Stop timer right after * tree-optimize.c (execute_one_pass): Stop timer right after
......
...@@ -87,7 +87,7 @@ void pointer_set_destroy (struct pointer_set_t *pset) ...@@ -87,7 +87,7 @@ void pointer_set_destroy (struct pointer_set_t *pset)
Collisions are resolved by linear probing. More complicated Collisions are resolved by linear probing. More complicated
collision management schemes are only useful when the load factor 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 int
pointer_set_contains (struct pointer_set_t *pset, void *p) pointer_set_contains (struct pointer_set_t *pset, void *p)
{ {
......
...@@ -216,7 +216,7 @@ static void vect_generate_tmps_on_preheader (loop_vec_info, ...@@ -216,7 +216,7 @@ static void vect_generate_tmps_on_preheader (loop_vec_info,
static tree vect_build_loop_niters (loop_vec_info); static tree vect_build_loop_niters (loop_vec_info);
static void vect_update_ivs_after_vectorizer (struct loop *, tree); 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. /* Loop transformations entry point function.
It can be used outside of the vectorizer It can be used outside of the vectorizer
...@@ -955,7 +955,7 @@ tree_duplicate_loop_to_edge (struct loop *loop, struct loops *loops, ...@@ -955,7 +955,7 @@ tree_duplicate_loop_to_edge (struct loop *loop, struct loops *loops,
definitions = marked_ssa_names (); definitions = marked_ssa_names ();
allocate_new_names (definitions); allocate_new_names (definitions);
update_phis_for_duplicate_loop (loop, new_loop, e == exit_e); 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. */ than on phis of the exit from the second loop. */
rename_variables_in_loop (new_loop); rename_variables_in_loop (new_loop);
free_new_names (definitions); free_new_names (definitions);
...@@ -1012,7 +1012,7 @@ tree_duplicate_loop_to_edge (struct loop *loop, struct loops *loops, ...@@ -1012,7 +1012,7 @@ tree_duplicate_loop_to_edge (struct loop *loop, struct loops *loops,
/* 4c. Add condition at the end of preheader bb. */ /* 4c. Add condition at the end of preheader bb. */
skip_e = add_loop_guard (pre_header_bb, pre_condition, first_exit_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. */ to the phis of second loop. */
update_phi_nodes_for_guard (skip_e, first_loop); update_phi_nodes_for_guard (skip_e, first_loop);
...@@ -2951,7 +2951,7 @@ vect_update_ivs_after_vectorizer (struct loop *loop, tree niters) ...@@ -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 to be done for loop before vectorizing it in case of
unknown loop bound. */ unknown loop bound. */
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment