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

   1 /* Disabling epilogues until we find a better way to deal with scans.  */
   2 /* { dg-additional-options "--param vect-epilogues-nomask=0 -fdump-tree-optimized-details-blocks" } */
   3 /* { dg-require-effective-target vect_int } */
   4
   5 #include <stdarg.h>
   6 #include "tree-vect.h"
   7
   8 #if VECTOR_BITS > 128
   9 #define N (VECTOR_BITS * 2 / 32)
  10 #define OFF (VECTOR_BITS / 32)
  11 #else
  12 #define N 8
  13 #define OFF 8
  14 #endif
  15
  16 /* Check handling of accesses for which the "initial condition" -
  17    the expression that represents the first location accessed - is
  18    more involved than just an ssa_name.  */
  19
  20 int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10, 14, 22, 26, 34};
  21
  22 __attribute__ ((noinline))
  23 int main1 (int *ib)
  24 {
  25   int i;
  26   int ia[N];
  27
  28   for (i = 0; i < N; i++)
  29     {
  30       ia[i] = ib[i+OFF];
  31     }
  32
  33
  34   /* check results:  */
  35 #pragma GCC novector
  36   for (i = 0; i < N; i++)
  37     {
  38      if (ia[i] != ib[i+OFF])
  39         abort ();
  40     }
  41
  42   return 0;
  43 }
  44
  45 int main (void)
  46 {
  47   check_vect ();
  48
  49   main1 (ib);
  50   return 0;
  51 }
  52
  53
  54 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  55 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */
  56 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target { ! vect_align_stack_vars } xfail { ! vect_unaligned_possible } } } } */
  57 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target vect_align_stack_vars xfail { ! vect_unaligned_possible } } } } */
  58 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */