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

   1 /* { dg-require-effective-target vect_int } */
   2 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
   3
   4 #include <stdlib.h>
   5 #include <stdarg.h>
   6 #include "tree-vect.h"
   7
   8 #define N 9
   9
  10 static int a[N] = {1,2,3,4,5,6,7,8,9};
  11 static int b[N] = {2,3,4,5,6,7,8,9,0};
  12
  13 __attribute__ ((noinline))
  14 int main1 () {
  15   int i;
  16   int *p, *q, *p1, *q1;
  17   p = (unsigned int *) malloc (sizeof (unsigned int) * N);
  18   q = (unsigned int *) malloc (sizeof (unsigned int) * N);
  19
  20   p1 = p; q1 = q;
  21
  22   /* Vectorizable, before pointer plus we would get a redundant cast
  23      (caused by pointer arithmetics), alias analysis fails to distinguish
  24      between the pointers.  */
  25   for (i = 0; i < N; i++)
  26     {
  27       *(q + i) = a[i];
  28       *(p + i) = b[i];
  29     }
  30
  31   /* check results: */
  32 #pragma GCC novector
  33   for (i = 0; i < N; i++)
  34     {
  35        if (*q != a[i] || *p != b[i])
  36          abort();
  37        q++;
  38        p++;
  39     }
  40
  41   q = q1;
  42   p = p1;
  43   /* Vectorizable.  */
  44   for (i = 0; i < N; i++)
  45     {
  46       *q = b[i];
  47       *p = a[i];
  48       q++;
  49       p++;
  50     }
  51
  52   q = q1;
  53   p = p1;
  54   /* check results: */
  55 #pragma GCC novector
  56   for (i = 0; i < N; i++)
  57     {
  58        if (*q != b[i] || *p != a[i])
  59          abort();
  60        q++;
  61        p++;
  62     }
  63
  64   return 0;
  65 }
  66
  67 int main (void)
  68 {
  69   check_vect ();
  70
  71   return main1 ();
  72 }
  73
  74 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
  75
  76 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */