PR middle-end/77357 - strlen of constant strings not folded
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / no-section-anchors-vect-64.c
blob470bbfb5537226e25d87b5bfbe84f281a42d986d
1 /* { dg-require-effective-target vect_int } */
2 /* { dg-add-options bind_pic_locally } */
4 #include <stdarg.h>
5 #include "tree-vect.h"
7 #if VECTOR_BITS > 128
8 #define NINTS (VECTOR_BITS / 32)
9 #else
10 #define NINTS 4
11 #endif
13 #define N (NINTS * 4)
15 int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
16 int ia[N][NINTS][N + 1];
17 int ic[N][N][NINTS - 1][2 * N + 2];
18 int id[N][N][N + NINTS];
20 __attribute__ ((noinline))
21 int main1 ()
23 int i, j;
25 /* Multidimensional array. Not aligned: vectorizable. */
26 for (i = 0; i < N; i++)
28 for (j = 0; j < N; j++)
30 ia[i][1][j] = ib[i];
34 /* Multidimensional array. Aligned: vectorizable. */
35 for (i = 0; i < N; i++)
37 for (j = 0; j < N; j++)
39 ic[i][1][1][j] = ib[i];
43 /* Multidimensional array. Not aligned: vectorizable. */
44 for (i = 0; i < N; i++)
46 for (j = 0; j < N; j++)
48 id[i][1][j+1] = ib[i];
52 /* check results: */
53 for (i = 0; i < N; i++)
55 for (j = 0; j < N; j++)
57 if (ia[i][1][j] != ib[i])
58 abort();
62 /* check results: */
63 for (i = 0; i < N; i++)
65 for (j = 0; j < N; j++)
67 if (ic[i][1][1][j] != ib[i])
68 abort();
72 /* check results: */
73 for (i = 0; i < N; i++)
75 for (j = 0; j < N; j++)
77 if (id[i][1][j+1] != ib[i])
78 abort();
82 return 0;
85 int main (void)
87 check_vect ();
89 return main1 ();
92 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
93 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
94 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" { xfail vect_element_align_preferred } } } */