Merge from mainline (gomp-merge-2005-02-26).
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-64.c
blobbf84ac8643431d215fb023085720305fb8d3c29d
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include "tree-vect.h"
6 #define N 16
8 int main1 ()
10 int i, j;
11 int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
12 int ia[N][4][N+1];
13 int ic[N][N][3][13];
14 int id[N][N][N];
16 /* Multidimensional array. Not aligned: vectorizable. */
17 for (i = 0; i < N; i++)
19 for (j = 0; j < N; j++)
21 ia[i][1][j] = ib[i];
25 /* Multidimensional array. Aligned: vectorizable. */
26 for (i = 0; i < N; i++)
28 for (j = 0; j < N; j++)
30 ic[i][1][1][j] = ib[i];
34 /* Multidimensional array. Not aligned: vectorizable. */
35 for (i = 0; i < N; i++)
37 for (j = 0; j < N; j++)
39 id[i][1][j+1] = ib[i];
43 /* check results: */
44 for (i = 0; i < N; i++)
46 for (j = 0; j < N; j++)
48 if (ia[i][1][j] != ib[i])
49 abort();
53 /* check results: */
54 for (i = 0; i < N; i++)
56 for (j = 0; j < N; j++)
58 if (ic[i][1][1][j] != ib[i])
59 abort();
63 /* check results: */
64 for (i = 0; i < N; i++)
66 for (j = 0; j < N; j++)
68 if (id[i][1][j+1] != ib[i])
69 abort();
73 return 0;
76 int main (void)
78 check_vect ();
80 return main1 ();
83 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
84 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
85 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" } } */