Sync usage with man page.
[netbsd-mini2440.git] / gnu / dist / gcc4 / gcc / testsuite / gcc.dg / vect / vect-58.c
blob89f6de639245e1708f30209fe8421a6e700ff5ff
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 unknown.
24 No aliasing problems.
25 vect-54.c is similar to this one with one difference:
26 the loop bound is known. */
28 int
29 main1 (int n)
31 int i;
32 float a[N] __attribute__ ((__aligned__(16))); 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}; 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};
33 float *pa = a;
34 float *pb = b;
35 float *pc = c;
37 for (i = 0; i < n/2; i++)
39 pa[i+1] = pb[i+1] * pc[i+1];
42 bar (a,b,c);
44 return 0;
47 int main (void)
49 int i;
50 int n=N;
52 check_vect ();
53 main1 (n);
55 return 0;
58 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
59 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
60 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
61 /* { dg-final { cleanup-tree-dump "vect" } } */