1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define K 32
int in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
int out[K];
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
foo ()
{
int res_or, res_and, res_xor, i, j, k;
for (k = 0; k < K; k++)
{
res_or = 0;
for (j = 0; j < K; j++)
for (i = 0; i < K; i++)
res_or = res_or | in[i+k][j];
res_and = 1;
for (j = 0; j < K; j++)
for (i = 0; i < K; i++)
res_and = res_and & in[i+k][j];
res_xor = 0;
for (j = 0; j < K; j++)
for (i = 0; i < K; i++)
res_xor = res_xor ^ in[i+k][j];
out[k] = res_or + res_and + res_xor;
}
}
int main ()
{
int i, j, k;
check_vect ();
for (j = 0; j < K; j++)
{
for (i = 0; i < 2*K; i++)
in[i][j] = i+j;
for (i = 0; i < K; i++)
out[i] = i+j;
}
foo();
for (k = 0; k < K; k++)
if (out[k] != check_result[k])
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 3 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
