1/* { dg-require-effective-target vect_float } */
2
3#include <stdarg.h>
4#include "tree-vect.h"
5
6#define N 256
7
8void 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 unknown
24   No aliasing problems.
25   vect-52.c is similar to this one with one difference:
26        the alignment of the read accesses is unknown.
27   vect-56.c is similar to this one with one difference:
28        the loop bound is known.
29   vect-61.c is similar to this one with two differences:
30        aliasing is not a problem, and the write access has unknown alignment.  */
31
32int
33main1 (int n)
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
58int main (void)
59{
60  int i;
61  int n=N;
62
63  check_vect ();
64  main1 (n);
65
66  return 0;
67}
68
69/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */
70/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
71/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
72/* { dg-final { cleanup-tree-dump "vect" } } */
73