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
|
// Output file should have no calls to error() with folding.
// RUN: %clang_cc1 -triple i386-unknown-unknown -mllvm -inline-threshold=1024 -O3 -emit-llvm -o %t %s
// RUN: FileCheck %s < %t
static unsigned pow(unsigned Base, unsigned Power) {
unsigned Val = 1;
while (Power--)
Val *= Base;
return Val;
}
struct TempTracker {
unsigned Product, Index;
TempTracker() : Product(1), Index(0) {}
};
// FIXME: This can be used to check elision as well, if P = 0 hacks are removed.
struct A {
TempTracker &TT;
mutable unsigned P;
bool Truth;
A(TempTracker &_TT, unsigned _P, bool _Truth = true)
: TT(_TT), P(_P), Truth(_Truth) {}
A(const A &RHS) : TT(RHS.TT), P(RHS.P), Truth(RHS.Truth) { RHS.P = 0; }
~A() {
if (P)
TT.Product *= pow(P, ++TT.Index);
}
A &operator=(const A &RHS) {
TT = RHS.TT;
P = RHS.P;
Truth = RHS.Truth;
RHS.P = 0;
return *this;
}
operator bool () { return Truth; }
};
// 3, 7, 2
static unsigned f0(bool val = false) {
TempTracker tt;
{
A a(tt, 2);
if ((A(tt, 3), val))
A b(tt, 5);
A c(tt, 7);
}
return tt.Product;
}
// 3, 5, 7, 2
static unsigned f1(bool val = true) {
TempTracker tt;
{
A a(tt, 2);
if ((A(tt, 3), val))
A b(tt, 5);
A c(tt, 7);
}
return tt.Product;
}
// 5, 3, 7, 2
static unsigned f2() {
TempTracker tt;
{
A a(tt, 2);
if (A b = A(tt, 3))
A c(tt, 5);
A d(tt, 7);
}
return tt.Product;
}
// 7, 3, 11, 2
static unsigned f3() {
TempTracker tt;
{
A a(tt, 2);
if (A b = A(tt, 3, false))
A c(tt, 5);
else
A c(tt, 7);
A d(tt, 11);
}
return tt.Product;
}
// 3, 7, 2
static unsigned f4() {
TempTracker tt;
{
A a(tt, 2);
while (A b = A(tt, 3, false))
A c(tt, 5);
A c(tt, 7);
}
return tt.Product;
}
// 5, 3, 7, 2
static unsigned f5() {
TempTracker tt;
{
A a(tt, 2);
while (A b = A(tt, 3, true)) {
A c(tt, 5);
break;
}
A c(tt, 7);
}
return tt.Product;
}
// 3, 7, 11, 5, 13, 2
static unsigned f6() {
TempTracker tt;
{
A a(tt, 2);
for (A b = (A(tt, 3), A(tt, 5)), c = (A(tt, 7), A(tt, 11));;)
break;
A c(tt, 13);
}
return tt.Product;
}
// 5, 2
static unsigned f7() {
TempTracker tt;
{
(void)((A(tt, 2, false) && A(tt, 3, false)) || A(tt, 5, false));
}
return tt.Product;
}
// 5, 2
static unsigned f8() {
TempTracker tt;
{
(void)((A(tt, 2) || A(tt, 3)) && A(tt, 5));
}
return tt.Product;
}
extern "C" void error();
extern "C" void print(const char *Name, unsigned N);
#define ORDER2(a, b) (pow(a, 1) * pow(b, 2))
#define ORDER3(a, b, c) (ORDER2(a, b) * pow(c, 3))
#define ORDER4(a, b, c, d) (ORDER3(a, b, c) * pow(d, 4))
#define ORDER5(a, b, c, d, e) (ORDER4(a, b, c, d) * pow(e, 5))
#define ORDER6(a, b, c, d, e, f) (ORDER5(a, b, c, d, e) * pow(f, 6))
void test() {
// CHECK: call void @print(i8* {{.*}}, i32 1176)
print("f0", f0());
if (f0() != ORDER3(3, 7, 2))
error();
// CHECK: call void @print(i8* {{.*}}, i32 411600)
print("f1", f1());
if (f1() != ORDER4(3, 5, 7, 2))
error();
// CHECK: call void @print(i8* {{.*}}, i32 246960)
print("f2", f2());
if (f2() != ORDER4(5, 3, 7, 2))
error();
// CHECK: call void @print(i8* {{.*}}, i32 1341648)
print("f3", f3());
if (f3() != ORDER4(7, 3, 11, 2))
error();
// CHECK: call void @print(i8* {{.*}}, i32 1176)
print("f4", f4());
if (f4() != ORDER3(3, 7, 2))
error();
// CHECK: call void @print(i8* {{.*}}, i32 246960)
print("f5", f5());
if (f5() != ORDER4(5, 3, 7, 2))
error();
// CHECK: call void @print(i8* {{.*}}, i32 1251552576)
print("f6", f6());
if (f6() != ORDER6(3, 7, 11, 5, 13, 2))
error();
// CHECK: call void @print(i8* {{.*}}, i32 20)
print("f7", f7());
if (f7() != ORDER2(5, 2))
error();
// CHECK: call void @print(i8* {{.*}}, i32 20)
print("f8", f8());
if (f8() != ORDER2(5, 2))
error();
}
#ifdef HARNESS
#include <cstdlib>
#include <cstdio>
extern "C" void error() {
abort();
}
extern "C" void print(const char *name, unsigned N) {
printf("%s: %d\n", name, N);
}
int main() {
test();
return 0;
}
#endif
|
