gcc/testsuite/gcc.dg/vect/vect-78-global.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 /* { dg-add-options bind_pic_locally } */
   5
   6 #include <stdarg.h>
   7 #include "tree-vect.h"
   8
   9 #define N 8
  10 #define OFF 8
  11
  12 /* Check handling of accesses for which the "initial condition" -
  13    the expression that represents the first location accessed - is
  14    more involved than just an ssa_name.  */
  15
  16 int ia[N];
  17 int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10, 14, 22, 26, 34};
  18 int off = 8;
  19
  20 __attribute__ ((noinline))
  21 int main1 (int *ib)
  22 {
  23   int i;
  24
  25   for (i = 0; i < N; i++)
  26     {
  27       ia[i] = ib[i+off];
  28     }
  29
  30
  31   /* check results:  */
  32 #pragma GCC novector
  33   for (i = 0; i < N; i++)
  34     {
  35      if (ia[i] != ib[i+off])
  36         abort ();
  37     }
  38
  39   return 0;
  40 }
  41
  42 int main (void)
  43 {
  44   check_vect ();
  45
  46   main1 (ib);
  47   return 0;
  48 }
  49
  50 /* For targets that don't support misaligned loads we version for the load.
  51    (The store is aligned).  */
  52
  53 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  54 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail { ! vect_unaligned_possible } } } } */
  55 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
  56 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */
  57 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */