| /* Disabling epilogues until we find a better way to deal with scans. */ |
| /* { dg-additional-options "--param vect-epilogues-nomask=0" } */ |
| /* { dg-require-effective-target vect_int } */ |
| |
| #include <stdarg.h> |
| #include "tree-vect.h" |
| |
| #define N 32 |
| |
| int ia[8][5][N+2]; |
| int ic[16][16][5][N+2]; |
| |
| __attribute__ ((noinline)) |
| int main1 () |
| { |
| int i, j; |
| |
| /* Multidimensional array. Aligned. */ |
| for (i = 0; i < 16; i++) |
| { |
| for (j = 0; j < N; j++) |
| { |
| ia[2][6][j] = 5; |
| } |
| } |
| |
| /* check results: */ |
| for (i = 0; i < 16; i++) |
| { |
| for (j = 0; j < N; j++) |
| { |
| if (ia[2][6][j] != 5) |
| abort(); |
| } |
| } |
| /* Multidimensional array. Aligned. */ |
| for (i = 0; i < 16; i++) |
| { |
| for (j = 0; j < N; j++) |
| ia[3][6][j+2] = 5; |
| } |
| |
| /* check results: */ |
| for (i = 0; i < 16; i++) |
| { |
| for (j = 2; j < N+2; j++) |
| { |
| if (ia[3][6][j] != 5) |
| abort(); |
| } |
| } |
| |
| /* Multidimensional array. Not aligned. */ |
| for (i = 0; i < 16; i++) |
| { |
| for (j = 0; j < N; j++) |
| { |
| ic[2][1][6][j+1] = 5; |
| } |
| } |
| |
| /* check results: */ |
| for (i = 0; i < 16; i++) |
| { |
| for (j = 0; j < N; j++) |
| { |
| if (ic[2][1][6][j+1] != 5) |
| 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" { target { {! vect_aligned_arrays} && {vect_sizes_32B_16B} } } } } */ |
| /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { target { {vect_aligned_arrays} && {! vect_sizes_32B_16B} } } } } */ |
