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