gcc/testsuite/gcc.dg/vect/vect-peel-3.c

   1 /* { dg-require-effective-target vect_int } */
   2 /* { dg-add-options bind_pic_locally } */
   3
   4 #include <stdarg.h>
   5 #include "tree-vect.h"
   6
   7 #if VECTOR_BITS > 128
   8 #define NINTS (VECTOR_BITS / 32)
   9 #define EXTRA (NINTS * 2)
  10 #else
  11 #define NINTS 4
  12 #define EXTRA 10
  13 #endif
  14
  15 #define N 128
  16
  17 #define RES_A (N * N / 4)
  18 #define RES_B (N * (N + 1) / 2 + (NINTS + 3) * (N + 1))
  19 #define RES_C (N * (N + 1) / 2 + (N + 1))
  20 #define RES (RES_A + RES_B + RES_C)
  21
  22 int ib[N + EXTRA];
  23 int ia[N + EXTRA];
  24 int ic[N + EXTRA];
  25
  26 __attribute__ ((noinline))
  27 int main1 ()
  28 {
  29   int i, suma = 0, sumb = 0, sumc = 0;
  30
  31   /* ib and ic have same misalignment, we peel to align them.  */
  32   for (i = 0; i <= N; i++)
  33     {
  34       suma += ia[i];
  35       sumb += ib[i + NINTS + 1];
  36       sumc += ic[i + 1];
  37     }
  38
  39   /* check results:  */
  40   if (suma + sumb + sumc != RES)
  41     abort ();
  42
  43   return 0;
  44 }
  45
  46 int main (void)
  47 {
  48   int i;
  49
  50   check_vect ();
  51
  52   for (i = 0; i < N + EXTRA; i++)
  53     {
  54       asm volatile ("" : "+r" (i));
  55       ib[i] = i;
  56       ic[i] = i+2;
  57       ia[i] = i/2;
  58     }
  59
  60   return main1 ();
  61 }
  62
  63 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail { vect_no_align && { ! vect_hw_misalign } } } } } */
  64 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect"  { xfail { { ! vect_unaligned_possible } || vect_sizes_32B_16B } } } } */
  65 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { { ! vect_unaligned_possible } || vect_sizes_32B_16B } } } } */