gomp-20050608-branch/gcc/testsuite/gcc.dg/vect/vect-76.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 8
   7 #define OFF 4
   8
   9 /* Check handling of accesses for which the "initial condition" -
  10    the expression that represents the first location accessed - is
  11    more involved than just an ssa_name.  */
  12
  13 int ib[N+OFF] __attribute__ ((__aligned__(16))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
  14
  15 int main1 (int *pib)
  16 {
  17   int i;
  18   int ia[N+OFF];
  19   int ic[N+OFF] = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
  20
  21   for (i = OFF; i < N; i++)
  22     {
  23       ia[i] = pib[i - OFF];
  24     }
  25
  26
  27   /* check results:  */
  28   for (i = OFF; i < N; i++)
  29     {
  30      if (ia[i] != pib[i - OFF])
  31         abort ();
  32     }
  33
  34   for (i = 0; i < N; i++)
  35     {
  36       ia[i] = pib[i - OFF];
  37     }
  38
  39
  40   /* check results:  */
  41   for (i = 0; i < N; i++)
  42     {
  43      if (ia[i] != pib[i - OFF])
  44         abort ();
  45     }
  46
  47   for (i = OFF; i < N; i++)
  48     {
  49       ia[i] = ic[i - OFF];
  50     }
  51
  52
  53   /* check results:  */
  54   for (i = OFF; i < N; i++)
  55     {
  56      if (ia[i] != ic[i - OFF])
  57         abort ();
  58     }
  59
  60   return 0;
  61 }
  62
  63 int main (void)
  64 {
  65   check_vect ();
  66
  67   main1 (&ib[OFF]);
  68   return 0;
  69 }
  70
  71
  72 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
  73 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
  74 /* { dg-final { cleanup-tree-dump "vect" } } */