Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/vect/no-section-anchors-vect-64.c @ 131:84e7813d76e9
gcc-8.2
author | mir3636 |
---|---|
date | Thu, 25 Oct 2018 07:37:49 +0900 |
parents | 04ced10e8804 |
children | 1830386684a0 |
line wrap: on
line source
/* { dg-require-effective-target vect_int } */ /* { dg-add-options bind_pic_locally } */ #include <stdarg.h> #include "tree-vect.h" #if VECTOR_BITS > 128 #define NINTS (VECTOR_BITS / 32) #else #define NINTS 4 #endif #define N (NINTS * 4) int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; int ia[N][NINTS][N + 1]; int ic[N][N][NINTS - 1][2 * N + 2]; int id[N][N][N + NINTS]; __attribute__ ((noinline)) int main1 () { int i, j; /* Multidimensional array. Not aligned: vectorizable. */ for (i = 0; i < N; i++) { for (j = 0; j < N; j++) { ia[i][1][j] = ib[i]; } } /* Multidimensional array. Aligned: vectorizable. */ for (i = 0; i < N; i++) { for (j = 0; j < N; j++) { ic[i][1][1][j] = ib[i]; } } /* Multidimensional array. Not aligned: vectorizable. */ for (i = 0; i < N; i++) { for (j = 0; j < N; j++) { id[i][1][j+1] = ib[i]; } } /* check results: */ for (i = 0; i < N; i++) { for (j = 0; j < N; j++) { if (ia[i][1][j] != ib[i]) abort(); } } /* check results: */ for (i = 0; i < N; i++) { for (j = 0; j < N; j++) { if (ic[i][1][1][j] != ib[i]) abort(); } } /* check results: */ for (i = 0; i < N; i++) { for (j = 0; j < N; j++) { if (id[i][1][j+1] != ib[i]) abort(); } } return 0; } int main (void) { check_vect (); return main1 (); } /* { dg-final { scan-tree-dump-times "vectorized 3 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" 2 "vect" { xfail vect_element_align_preferred } } } */