URL
https://opencores.org/ocsvn/openrisc_2011-10-31/openrisc_2011-10-31/trunk
Subversion Repositories openrisc_2011-10-31
[/] [openrisc/] [trunk/] [gnu-src/] [gcc-4.2.2/] [gcc/] [testsuite/] [gcc.dg/] [vect/] [vect-70.c] - Rev 149
Go to most recent revision | Compare with Previous | Blame | View Log
/* { dg-require-effective-target vect_int } */ #include <stdarg.h> #include "tree-vect.h" #define N 16 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[N]; /* array e.n is aligned */ }; int main1 () { int i,j; struct test1 tmp1; for (i = 0; i < N; i++) for (j = 3; j < N-3; j++) { tmp1.e[i].n[1][2][j] = 8; } /* check results: */ for (i = 0; i < N; i++) for (j = 3; j < N-3; j++) { if (tmp1.e[i].n[1][2][j] != 8) abort (); } /* not consecutive */ for (i = 0; i < N; i++) for (j = 3; j < N-3; j++) { tmp1.e[j].n[1][2][j] = 8; } /* check results: */ for (i = 0; i < N; i++) for (j = 3; j < N-3; j++) { if (tmp1.e[j].n[1][2][j] != 8) abort (); } return 0; } int main (void) { check_vect (); return main1 (); } /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */ /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */ /* { dg-final { cleanup-tree-dump "vect" } } */
Go to most recent revision | Compare with Previous | Blame | View Log