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 scalar_all_fma } */
/* { dg-additional-options "-fdump-tree-optimized" } */
#include "tree-vect.h"
#define N (VECTOR_BITS * 11 / 64 + 3)
#define DEF(INV) \
void __attribute__ ((noipa)) \
f_##INV (double *restrict a, double *restrict b, \
double *restrict c, double *restrict d) \
{ \
for (int i = 0; i < N; ++i) \
{ \
double mb = (INV & 1 ? -b[i] : b[i]); \
double mc = c[i]; \
double md = (INV & 2 ? -d[i] : d[i]); \
double fma = __builtin_fma (mb, mc, md); \
double truev = (INV & 4 ? -fma : fma); \
a[i] = b[i] < 10 ? truev : 10.0; \
} \
}
#define TEST(INV) \
{ \
f_##INV (a, b, c, d); \
_Pragma("GCC novector") \
for (int i = 0; i < N; ++i) \
{ \
double mb = (INV & 1 ? -b[i] : b[i]); \
double mc = c[i]; \
double md = (INV & 2 ? -d[i] : d[i]); \
double fma = __builtin_fma (mb, mc, md); \
double truev = (INV & 4 ? -fma : fma); \
if (a[i] != (i % 17 < 10 ? truev : 10.0)) \
__builtin_abort (); \
asm volatile ("" ::: "memory"); \
} \
}
#define FOR_EACH_INV(T) \
T (0) T (1) T (2) T (3) T (4) T (5) T (6) T (7)
FOR_EACH_INV (DEF)
int
main (void)
{
double a[N], b[N], c[N], d[N];
for (int i = 0; i < N; ++i)
{
b[i] = i % 17;
c[i] = i % 9 + 11;
d[i] = i % 13 + 14;
asm volatile ("" ::: "memory");
}
FOR_EACH_INV (TEST)
return 0;
}
/* { dg-final { scan-tree-dump-times { = \.COND_FMA } 2 "optimized" { target vect_double_cond_arith } } } */
/* { dg-final { scan-tree-dump-times { = \.COND_FMS } 2 "optimized" { target vect_double_cond_arith } } } */
/* { dg-final { scan-tree-dump-times { = \.COND_FNMA } 2 "optimized" { target vect_double_cond_arith } } } */
/* { dg-final { scan-tree-dump-times { = \.COND_FNMS } 2 "optimized" { target vect_double_cond_arith } } } */
|
