| /* { dg-require-effective-target vect_int } */ |
| int in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); |
| int check_result[K] = {63,63,191,191,127,127,191,191,127,127,191,191,127,127,191,191,127,127,191,191,127,127,191,191,127,127,191,191,127,127,191,191}; |
| __attribute__ ((noinline)) void |
| int res_or, res_and, res_xor, i, j, k; |
| res_or = res_or | in[i+k][j]; |
| res_and = res_and & in[i+k][j]; |
| res_xor = res_xor ^ in[i+k][j]; |
| out[k] = res_or + res_and + res_xor; |
| for (i = 0; i < 2*K; i++) |
| if (out[k] != check_result[k]) |
| /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 3 "vect" } } */ |