* tree-vect-data-refs.c (vect_peeling_hash_get_most_frequent):

        Take number of iterations to peel into account for equally
        frequent misalignment values.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@174965 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 57b374d..a1dd32d 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,9 @@
+2011-06-12  Ira Rosen  <ira.rosen@linaro.org>
+
+       * tree-vect-data-refs.c (vect_peeling_hash_get_most_frequent):
+       Take number of iterations to peel into account for equally frequent
+       misalignment values.
+
 2011-06-11  Jan Hubicka  <jh@suse.cz>
 
        * lto-streamer-out.c (produce_symtab): Stream out the newly represented

diff --git a/gcc/tree-vect-data-refs.c b/gcc/tree-vect-data-refs.c
index 5023710..c98eb13 100644 (file)
--- a/gcc/tree-vect-data-refs.c
+++ b/gcc/tree-vect-data-refs.c
@@ -1248,7 +1248,9 @@ vect_peeling_hash_get_most_frequent (void **slot, void *data)
   vect_peel_info elem = (vect_peel_info) *slot;
   vect_peel_extended_info max = (vect_peel_extended_info) data;
 
-  if (elem->count > max->peel_info.count)
+  if (elem->count > max->peel_info.count
+      || (elem->count == max->peel_info.count
+          && max->peel_info.npeel > elem->npeel))
     {
       max->peel_info.npeel = elem->npeel;
       max->peel_info.count = elem->count;