Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/vect/vect-68.c @ 131:84e7813d76e9
gcc-8.2
author | mir3636 |
---|---|
date | Thu, 25 Oct 2018 07:37:49 +0900 |
parents | 04ced10e8804 |
children |
line wrap: on
line source
/* { dg-require-effective-target vect_int } */ #include <stdarg.h> #include "tree-vect.h" #define N 32 struct s{ int m; int n[N][N][N]; }; struct test1{ struct s a; /* array a.n is unaligned */ int b; int c; struct s e; /* array e.n is aligned */ }; __attribute__ ((noinline)) int main1 () { int i,j; struct test1 tmp1; /* 1. unaligned */ for (i = 0; i < N; i++) { tmp1.a.n[1][2][i] = 5; } /* check results: */ for (i = 0; i <N; i++) { if (tmp1.a.n[1][2][i] != 5) abort (); } /* 2. aligned */ for (i = 3; i < N-1; i++) { tmp1.a.n[1][2][i] = 6; } /* check results: */ for (i = 3; i < N-1; i++) { if (tmp1.a.n[1][2][i] != 6) abort (); } /* 3. aligned */ for (i = 0; i < N; i++) { tmp1.e.n[1][2][i] = 7; } /* check results: */ for (i = 0; i < N; i++) { if (tmp1.e.n[1][2][i] != 7) abort (); } /* 4. unaligned */ for (i = 3; i < N-3; i++) { tmp1.e.n[1][2][i] = 8; } /* check results: */ for (i = 3; i <N-3; i++) { if (tmp1.e.n[1][2][i] != 8) abort (); } return 0; } int main (void) { check_vect (); return main1 (); } /* { dg-final { scan-tree-dump-times "vectorized 4 loops" 1 "vect" } } */