aboutsummaryrefslogtreecommitdiff
path: root/gcc
diff options
context:
space:
mode:
authorKazu Hirata <kazu@cs.umass.edu>2004-10-15 14:36:32 +0000
committerKazu Hirata <kazu@gcc.gnu.org>2004-10-15 14:36:32 +0000
commited8b755833fddacaf72eed8977c1bbe9c6c4d45e (patch)
tree9e86aa12e44dad0ef8a0171ec79a85b279ce9164 /gcc
parentdb3a95196c3192a488ad6ece2ea9057915d2c3a6 (diff)
downloadgcc-ed8b755833fddacaf72eed8977c1bbe9c6c4d45e.zip
gcc-ed8b755833fddacaf72eed8977c1bbe9c6c4d45e.tar.gz
gcc-ed8b755833fddacaf72eed8977c1bbe9c6c4d45e.tar.bz2
* pointer-set.c, tree-vectorizer.c: Fix comment typos.
From-SVN: r89094
Diffstat (limited to 'gcc')
-rw-r--r--gcc/ChangeLog4
-rw-r--r--gcc/pointer-set.c2
-rw-r--r--gcc/tree-vectorizer.c8
3 files changed, 9 insertions, 5 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 6dac1c7..2f7ec20 100644
--- 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 510ae43..06592d7 100644
--- 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 e7ade73..30af484 100644
--- 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. */