gnu/dist/gcc4/gcc/testsuite/gcc.dg/vect/vect-56.c

   1 /* { dg-require-effective-target vect_float } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 256
   7
   8 void bar (float *pa, float *pb, float *pc)
   9 {
  10   int i;
  11
  12   /* check results:  */
  13   for (i = 0; i < N/2; i++)
  14     {
  15       if (pa[i] != (pb[i+1] * pc[i+1]))
  16         abort ();
  17     }
  18
  19   return;
  20 }
  21
  22 /* Unaligned pointer read accesses, aligned write access.
  23    The loop bound is known and divisible by the vectorization factor.
  24    No aliasing problems.
  25    vect-48.c is similar to this one with one difference:
  26         the alignment of the read accesses is unknown.
  27    vect-60.c is similar to this one with one difference:
  28         the loop bound is unknown.
  29    vect-57.c is similar to this one with two differences:
  30         aliasing is a problem, and the write access has unknown alignment.  */
  31
  32 int
  33 main1 ()
  34 {
  35   int i;
  36   float a[N] __attribute__ ((__aligned__(16)));
  37   float b[N] __attribute__ ((__aligned__(16))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
  38   float c[N] __attribute__ ((__aligned__(16))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
  39   float *pa = a;
  40   float *pb = b;
  41   float *pc = c;
  42
  43   for (i = 0; i < N/2; i++)
  44     {
  45       pa[i] = pb[i+1] * pc[i+1];
  46     }
  47
  48   /* check results:  */
  49   for (i = 0; i < N/2; i++)
  50     {
  51       if (pa[i] != (pb[i+1] * pc[i+1]))
  52         abort ();
  53     }
  54
  55   return 0;
  56 }
  57
  58 int main (void)
  59 {
  60   int i;
  61
  62   check_vect ();
  63   main1 ();
  64
  65   return 0;
  66 }
  67
  68 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */
  69 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
  70 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
  71 /* { dg-final { cleanup-tree-dump "vect" } } */