gcc/testsuite/gcc.dg/vect/vect-13.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 16
   7
   8 int a[N];
   9 int results[N] = {0,1,2,3,0,0,0,0,0,0,0,0,12,13,14,15};
  10
  11 int main1()
  12 {
  13   int i;
  14   int b[N] = {0,1,2,3,-4,-5,-6,-7,-8,-9,-10,-11,12,13,14,15};
  15
  16   /* Max pattern.  */
  17   for (i = 0; i < N; i++)
  18     {
  19       a[i] = (b[i] >= 0 ? b[i] : 0);
  20     }
  21
  22   /* Check results  */
  23   for (i = 0; i < N; i++)
  24     {
  25       if (a[i] != results[i])
  26         abort ();
  27     }
  28
  29   return 0;
  30 }
  31
  32 int main (void)
  33 {
  34   check_vect ();
  35
  36   return main1 ();
  37 }
  38
  39 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_max } } } */
  40 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */