Dead
[official-gcc.git] / gomp-20050608-branch / gcc / testsuite / gcc.dg / vect / vect-54.c
blob05962dfd35f7f7b2786e58fa95a80747ce21a935
1 /* { dg-require-effective-target vect_float } */
3 #include <stdarg.h>
4 #include "tree-vect.h"
6 #define N 256
8 void bar (float *pa, float *pb, float *pc)
10 int i;
12 /* check results: */
13 for (i = 0; i < N/2; i++)
15 if (pa[i+1] != (pb[i+1] * pc[i+1]))
16 abort ();
19 return;
22 /* Unaligned pointer accesses, with a known alignment.
23 The loop bound is known and divisible by the vectorization factor.
24 No aliasing problems.
25 vect-58.c is similar to this one with one difference:
26 the loop bound is unknown. */
28 int
29 main1 ()
31 int i;
32 float a[N] __attribute__ ((__aligned__(16)));
33 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};
34 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};
35 float *pa = a;
36 float *pb = b;
37 float *pc = c;
39 for (i = 0; i < N/2; i++)
41 pa[i+1] = pb[i+1] * pc[i+1];
44 bar (a,b,c);
46 return 0;
49 int main (void)
51 int i;
53 check_vect ();
54 main1 ();
56 return 0;
59 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
60 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
61 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
62 /* { dg-final { cleanup-tree-dump "vect" } } */