blob: 5138712731f245eb1f17ef2e9e02e333c8e214de (
plain)
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
|
/* { dg-additional-options "-fdump-tree-optimized -fno-trapping-math -ffinite-math-only" } */
#include "tree-vect.h"
#define N (VECTOR_BITS * 11 / 64 + 3)
#define add(A, B) ((A) + (B))
#define sub(A, B) ((A) - (B))
#define mul(A, B) ((A) * (B))
#define div(A, B) ((A) / (B))
#define DEF(OP) \
void __attribute__ ((noipa)) \
f_##OP (double *restrict a, double *restrict b, double x) \
{ \
for (int i = 0; i < N; ++i) \
{ \
double truev = OP (b[i], x); \
a[i] = b[i] < 100 ? truev : b[i]; \
} \
}
#define TEST(OP) \
{ \
f_##OP (a, b, 10); \
_Pragma("GCC novector") \
for (int i = 0; i < N; ++i) \
{ \
int bval = (i % 17) * 10; \
int truev = OP (bval, 10); \
if (a[i] != (bval < 100 ? truev : bval)) \
__builtin_abort (); \
asm volatile ("" ::: "memory"); \
} \
}
#define FOR_EACH_OP(T) \
T (add) \
T (sub) \
T (mul) \
T (div) \
T (__builtin_fmax) \
T (__builtin_fmin)
FOR_EACH_OP (DEF)
int
main (void)
{
double a[N], b[N];
for (int i = 0; i < N; ++i)
{
b[i] = (i % 17) * 10;
asm volatile ("" ::: "memory");
}
FOR_EACH_OP (TEST)
return 0;
}
/* { dg-final { scan-tree-dump { = \.COND_ADD} "optimized" { target vect_double_cond_arith } } } */
/* { dg-final { scan-tree-dump { = \.COND_SUB} "optimized" { target vect_double_cond_arith } } } */
/* { dg-final { scan-tree-dump { = \.COND_MUL} "optimized" { target vect_double_cond_arith } } } */
/* { dg-final { scan-tree-dump { = \.COND_RDIV} "optimized" { target vect_double_cond_arith } } } */
/* { dg-final { scan-tree-dump { = \.COND_MAX} "optimized" { target vect_double_cond_arith } } } */
/* { dg-final { scan-tree-dump { = \.COND_MIN} "optimized" { target vect_double_cond_arith } } } */
|
