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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
/* { dg-require-effective-target vect_float } */
#include "tree-vect.h"
void __attribute__((noipa))
test (double x0, double x1, double *restrict res, double *restrict ptr, int n)
{
for (int i = 0; i < n; i += 2)
{
x0 = __builtin_fmin (x0, ptr[i + 0]);
x1 = __builtin_fmin (x1, ptr[i + 1]);
}
res[0] = x0;
res[1] = x1;
}
#define N 128
#define HALF (N / 2)
int
main (void)
{
check_vect ();
double res[2], a[N];
for (int i = 0; i < N; i += 2)
{
a[i] = i < HALF ? HALF - i : 0;
a[i + 1] = -i / 8;
}
test (N, N, res, a, 2);
if (res[0] != HALF || res[1] != 0)
__builtin_abort ();
test (N, N, res, a, 6);
if (res[0] != HALF - 4 || res[1] != 0)
__builtin_abort ();
test (N, N, res, a, 8);
if (res[0] != HALF - 6 || res[1] != 0)
__builtin_abort ();
test (N, N, res, a, 10);
if (res[0] != HALF - 8 || res[1] != -1)
__builtin_abort ();
test (N, N, res, a, HALF - 2);
if (res[0] != 4 || res[1] != -HALF / 8 + 1)
__builtin_abort ();
test (N, N, res, a, HALF);
if (res[0] != 2 || res[1] != -HALF / 8 + 1)
__builtin_abort ();
test (N, N, res, a, HALF + 2);
if (res[0] != 0 || res[1] != -HALF / 8)
__builtin_abort ();
test (N, N, res, a, HALF + 8);
if (res[0] != 0 || res[1] != -HALF / 8)
__builtin_abort ();
test (N, N, res, a, HALF + 10);
if (res[0] != 0 || res[1] != -HALF / 8 - 1)
__builtin_abort ();
test (N, N, res, a, N);
if (res[0] != 0 || res[1] != -N / 8 + 1)
__builtin_abort ();
test (-1, N, res, a, N);
if (res[0] != -1 || res[1] != -N / 8 + 1)
__builtin_abort ();
test (-1, -N / 8, res, a, N);
if (res[0] != -1 || res[1] != -N / 8)
__builtin_abort ();
return 0;
}
/* { dg-final { scan-tree-dump "Detected reduction" "vect" } } */
/* { dg-final { scan-tree-dump "LOOP VECTORIZED" "vect" { target vect_max_reduc } } } */
|
