Speed-up loop blocking: strip-mining is always legal.
[official-gcc/graphite-test-results.git] / gcc / testsuite / gcc.dg / vect / costmodel / ppc / costmodel-vect-68d.c
blob7fc25946587ae540315c937226d3a000ffb0fb2e
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include "../../tree-vect.h"
6 #define N 11
8 struct s{
9 int m;
10 int n[N][N][N];
13 struct test1{
14 struct s a; /* array a.n is unaligned */
15 int b;
16 int c;
17 struct s e; /* array e.n is aligned */
20 int main1 ()
22 int i,j;
23 struct test1 tmp1;
25 /* 4. unaligned */
26 for (i = 3; i < N-3; i++)
28 tmp1.e.n[1][2][i] = 8;
31 /* check results: */
32 for (i = 3; i <N-3; i++)
34 if (tmp1.e.n[1][2][i] != 8)
35 abort ();
38 return 0;
41 int main (void)
43 check_vect ();
45 return main1 ();
48 /* { dg-final { scan-tree-dump-times "vectorization not profitable" 1 "vect" } } */
49 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 0 "vect" } } */
50 /* { dg-final { cleanup-tree-dump "vect" } } */