gcc/testsuite/gcc.dg/vect/vect-77-alignchecks.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #if VECTOR_BITS > 128
   7 #define N (VECTOR_BITS * 2 / 32)
   8 #define OFF (VECTOR_BITS / 32)
   9 #else
  10 #define N 8
  11 #define OFF 8
  12 #endif
  13
  14 /* Check handling of accesses for which the "initial condition" -
  15    the expression that represents the first location accessed - is
  16    more involved than just an ssa_name.  */
  17
  18 int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10, 14, 22, 26, 34};
  19
  20 __attribute__ ((noinline))
  21 int main1 (int *ib, int off)
  22 {
  23   int i;
  24   int ia[N];
  25
  26   for (i = 0; i < N; i++)
  27     {
  28       ia[i] = ib[i+off];
  29     }
  30
  31
  32   /* check results:  */
  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, 8);
  47   return 0;
  48 }
  49
  50 /* For targets that don't support misaligned loads we version for the load.
  51    The store is aligned if alignment can be forced on the stack. Otherwise, we need to
  52    peel the loop in order to align the store. For targets that can't align variables
  53    using peeling (don't guarantee natural alignment) versioning the loop is required
  54    both for the load and the store.  */
  55
  56 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  57 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target { ! vect_align_stack_vars } xfail { ! vect_unaligned_possible } } } } */
  58 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target vect_align_stack_vars xfail { ! vect_unaligned_possible } } } } */
  59 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { target { {! vect_no_align} && { unaligned_stack && vector_alignment_reachable } } } } } */
  60 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { { {! unaligned_stack} && { vect_no_align && { ! vect_hw_misalign } } } || {unaligned_stack && { {! vector_alignment_reachable} && {! vect_no_align } } } } } } } */
  61 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 2 "vect" { target { { unaligned_stack && { vector_alignment_reachable && vect_no_align } } || {unaligned_stack && { {! vector_alignment_reachable} && vect_no_align } } } } } } */