LWG 3035. std::allocator's constructors should be constexpr
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / no-section-anchors-vect-65.c
blob581554064b572b7eb26d5f9852d4d13622317c7e
1 /* { dg-require-effective-target vect_int } */
2 /* { dg-add-options bind_pic_locally } */
4 #include <stdarg.h>
5 #include "tree-vect.h"
7 #define N 16
8 #define M 4
10 int ib[M][M][N] = {{{0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
11 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
12 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
13 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}},
14 {{0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
15 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
16 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
17 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}},
18 {{0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
19 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
20 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
21 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}},
22 {{0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
23 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
24 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45},
25 {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}}};
26 int ia[M][M][N];
27 int ic[N];
29 __attribute__ ((noinline))
30 int main1 ()
32 int i, j;
34 /* Multidimensional array. Aligned. The "inner" dimensions
35 are invariant in the inner loop. Load and store. */
36 for (i = 0; i < M; i++)
38 for (j = 0; j < N; j++)
40 ia[i][1][j] = ib[2][i][j];
44 /* check results: */
45 for (i = 0; i < M; i++)
47 for (j = 0; j < N; j++)
49 if (ia[i][1][j] != ib[2][i][j])
50 abort();
54 /* Multidimensional array. Aligned. The "inner" dimensions
55 are invariant in the inner loop. Load. */
56 for (i = 0; i < M; i++)
58 for (j = 0; j < N; j++)
60 ic[j] = ib[2][i][j];
64 /* check results: */
65 for (i = 0; i < M; i++)
67 for (j = 0; j < N; j++)
69 if (ic[j] != ib[2][i][j])
70 abort();
74 return 0;
77 int main (void)
79 check_vect ();
81 return main1 ();
84 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
85 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */