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

   1 /* { dg-require-effective-target vect_int } */
   2 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
   3
   4 #include <stdarg.h>
   5 #include "tree-vect.h"
   6
   7 #define N 16
   8
   9 char x[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
  10 char cb[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  11
  12 __attribute__ ((noinline))
  13 int main1 ()
  14 {
  15   struct {
  16     char *p;
  17     char *q;
  18   } s;
  19   int i;
  20
  21   /* Check that datarefs analysis can determine that the access via pointer
  22      s.p is based off array x, which enables us to antialias this access from
  23      the access to array cb.  */
  24   s.p = x;
  25   for (i = 0; i < N; i++)
  26     {
  27       s.p[i] = cb[i];
  28     }
  29
  30   /* check results:  */
  31 #pragma GCC novector
  32   for (i = 0; i < N; i++)
  33     {
  34       if (s.p[i] != cb[i])
  35         abort ();
  36     }
  37
  38   /* Check that datarefs analysis can determine that the access via pointer
  39      s.p is based off array x, and that the access via pointer s.q is based off
  40      array cb, which enables us to antialias these two accesses.  */
  41   s.q = cb;
  42   for (i = 0; i < N; i++)
  43     {
  44       s.p[i] = s.q[i];
  45     }
  46
  47   /* check results:  */
  48 #pragma GCC novector
  49   for (i = 0; i < N; i++)
  50     {
  51       if (s.p[i] != s.q[i])
  52         abort ();
  53     }
  54
  55   return 0;
  56 }
  57
  58 int main (void)
  59 {
  60   check_vect ();
  61
  62   return main1 ();
  63 }
  64
  65
  66 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
  67 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
  68 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */