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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
|
/* { dg-do run } */
/* { dg-require-effective-target vsx_hw } */
/* { dg-options "-O2 -ftree-vectorize -mvsx -fno-vect-cost-model -fdump-tree-vect-details" } */
/* To test condition reduction vectorization, where comparison operands are of
double type and condition true/false values are integer type. Cover all
float point comparison codes. */
#include <math.h>
extern void
abort (void) __attribute__ ((noreturn));
#define N 27
#define FP_TYPE double
#define LTGT(a, b) (__builtin_islessgreater ((a), (b)))
#define UNORD(a, b) (__builtin_isunordered ((a), (b)))
#define ORD(a, b) (!__builtin_isunordered ((a), (b)))
#define UNEQ(a, b) (!__builtin_islessgreater ((a), (b)))
#define UNGT(a, b) (!__builtin_islessequal ((a), (b)))
#define UNGE(a, b) (!__builtin_isless ((a), (b)))
#define UNLT(a, b) (!__builtin_isgreaterequal ((a), (b)))
#define UNLE(a, b) (!__builtin_isgreater ((a), (b)))
__attribute__ ((noinline)) int
test_eq (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (a[i] == min_v)
last = i;
return last;
}
__attribute__ ((noinline)) int
test_ne (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (a[i] != min_v)
last = i;
return last;
}
__attribute__ ((noinline)) int
test_gt (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (a[i] > min_v)
last = i;
return last;
}
__attribute__ ((noinline)) int
test_ge (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (a[i] >= min_v)
last = i;
return last;
}
__attribute__ ((noinline)) int
test_lt (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (a[i] < min_v)
last = i;
return last;
}
__attribute__ ((noinline)) int
test_le (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (a[i] <= min_v)
last = i;
return last;
}
__attribute__ ((noinline)) int
test_ltgt (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (LTGT (a[i], min_v))
last = i;
return last;
}
__attribute__ ((noinline)) int
test_ord (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (ORD (a[i], min_v))
last = i;
return last;
}
__attribute__ ((noinline)) int
test_unord (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (UNORD (a[i], min_v))
last = i;
return last;
}
__attribute__ ((noinline)) int
test_uneq (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (UNEQ (a[i], min_v))
last = i;
return last;
}
__attribute__ ((noinline)) int
test_ungt (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (UNGT (a[i], min_v))
last = i;
return last;
}
__attribute__ ((noinline)) int
test_unge (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (UNGE (a[i], min_v))
last = i;
return last;
}
__attribute__ ((noinline)) int
test_unlt (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (UNLT (a[i], min_v))
last = i;
return last;
}
__attribute__ ((noinline)) int
test_unle (FP_TYPE *a, FP_TYPE min_v)
{
int last = 0;
for (int i = 0; i < N; i++)
if (UNLE (a[i], min_v))
last = i;
return last;
}
int
main (void)
{
int ret = 0;
FP_TYPE a1[N] = {11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 21, 22, 23, 24, 25, 26, 27};
FP_TYPE a2[N] = {11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 21, 22, 23, NAN, 25, 26, 27};
FP_TYPE a3[N] = {21, 22, 23, 24, 25, 26, 27, 28, 29, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 1, 2, 3, 4, 5, 6, 7};
FP_TYPE a4[N] = {21, 22, 23, 24, 25, 26, 27, 28, 29, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 1, 2, 3, 4, NAN, 6, 7};
FP_TYPE a5[N] = {21, 22, 23, 24, 25, 26, 27, 28, 29, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 1, 2, 3, 4, NAN, 10, 10};
ret = test_eq (a1, 10);
if (ret != 19)
abort ();
ret = test_ne (a1, 10);
if (ret != 26)
abort ();
ret = test_gt (a3, 10);
if (ret != 19)
abort ();
ret = test_ge (a3, 10);
if (ret != 19)
abort ();
ret = test_lt (a1, 10);
if (ret != 18)
abort ();
ret = test_le (a1, 10);
if (ret != 19)
abort ();
ret = test_ltgt (a3, 10);
if (ret != 26)
abort ();
ret = test_ltgt (a5, 10);
if (ret != 23)
abort ();
ret = test_unord (a5, 10);
if (ret != 24)
abort ();
ret = test_ord (a5, 10);
if (ret != 26)
abort ();
ret = test_uneq (a1, 10);
if (ret != 19)
abort ();
ret = test_uneq (a4, 10);
if (ret != 24)
abort ();
ret = test_ungt (a3, 10);
if (ret != 19)
abort ();
ret = test_ungt (a4, 10);
if (ret != 24)
abort ();
ret = test_unge (a3, 10);
if (ret != 19)
abort ();
ret = test_ungt (a4, 10);
if (ret != 24)
abort ();
ret = test_unlt (a1, 10);
if (ret != 18)
abort ();
ret = test_unlt (a2, 10);
if (ret != 23)
abort ();
ret = test_unle (a1, 10);
if (ret != 19)
abort ();
ret = test_unle (a2, 10);
if (ret != 23)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "LOOP VECTORIZED" 14 "vect" { target has_arch_pwr8 } } } */
|
