gcc/testsuite/gcc.dg/vect/vect-peel-1.c

   1 /* { dg-require-effective-target vect_int } */
   2 /* { dg-add-options quad_vectors } */
   3
   4 #include <stdarg.h>
   5 #include "tree-vect.h"
   6
   7 #define N 128
   8
   9 int ib[N+7];
  10
  11 __attribute__ ((noinline))
  12 int main1 ()
  13 {
  14   int i;
  15   int ia[N+1];
  16
  17   /* All the accesses are misaligned. With cost model disabled, we count the
  18      the number of aligned accesses for each peeling option, and in this case
  19      we align the two loads if possible (i.e., if misaligned stores are
  20      supported).  */
  21   for (i = 1; i <= N; i++)
  22     {
  23       ia[i] = ib[i+2] + ib[i+6];
  24     }
  25
  26   /* check results:  */
  27   for (i = 1; i <= N; i++)
  28     {
  29       if (ia[i] != ib[i+2] + ib[i+6])
  30         abort ();
  31     }
  32
  33   return 0;
  34 }
  35
  36 int main (void)
  37 {
  38   int i;
  39
  40   check_vect ();
  41
  42   for (i = 0; i <= N+6; i++)
  43     ib[i] = i;
  44
  45   return main1 ();
  46 }
  47
  48 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { xfail  vect_no_align } } } */
  49 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target vect_element_align  } } } */
  50 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail { vect_no_align || vect_element_align } } } } */
  51 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail  vect_no_align } } } */
  52 /* { dg-final { cleanup-tree-dump "vect" } } */