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
|
/* Copyright (C) 2004 Free Software Foundation.
Test for composite comparison always true/false optimization.
Written by Paolo Bonzini, 26th May 2004. */
extern void link_error0 ();
extern void link_error1 ();
void
test1 (float x, float y)
{
if ((x==y) && (x!=y))
link_error0();
}
void
test2 (float x, float y)
{
if ((x<y) && (x>y))
link_error0();
}
void
test3 (float x, float y)
{
if ((x<y) && (y<x))
link_error0();
}
void
test4 (float x, float y)
{
if ((x==y) || (x!=y))
{
}
else
link_error1 ();
}
void
test5 (float x, float y)
{
if (__builtin_isunordered (x, y) || (x>=y) || (x<y))
{
}
else
link_error1 ();
}
void
test6 (float x, float y)
{
if (__builtin_isunordered (y, x) || (x<=y) || (y<x))
{
}
else
link_error1 ();
}
void
test7 (float x, float y)
{
if (__builtin_isunordered (x, y) || !__builtin_isunordered (x, y))
{
}
else
link_error1 ();
}
void
all_tests (float x, float y)
{
test1 (x, y);
test2 (x, y);
test3 (x, y);
test4 (x, y);
test5 (x, y);
test6 (x, y);
test7 (x, y);
}
int
main ()
{
all_tests (0, 0);
all_tests (1, 2);
all_tests (4, 3);
return 0;
}
#ifndef __OPTIMIZE__
void link_error0() {}
void link_error1() {}
#endif /* ! __OPTIMIZE__ */
|
