temp-order.cpp revision 9f16f13639860cf90030bde70b7b29227552fffd
1// Output file should have no calls to error() with folding. 2// RUN: %clang_cc1 -triple i386-unknown-unknown -O3 -emit-llvm -o %t %s 3// RUN: FileCheck %s < %t 4 5static unsigned pow(unsigned Base, unsigned Power) { 6 unsigned Val = 1; 7 while (Power--) 8 Val *= Base; 9 return Val; 10} 11 12struct TempTracker { 13 unsigned Product, Index; 14 15 TempTracker() : Product(1), Index(0) {} 16 17}; 18 19// FIXME: This can be used to check elision as well, if P = 0 hacks are removed. 20struct A { 21 TempTracker &TT; 22 mutable unsigned P; 23 bool Truth; 24 25 A(TempTracker &_TT, unsigned _P, bool _Truth = true) 26 : TT(_TT), P(_P), Truth(_Truth) {} 27 A(const A &RHS) : TT(RHS.TT), P(RHS.P), Truth(RHS.Truth) { RHS.P = 0; } 28 ~A() { 29 if (P) 30 TT.Product *= pow(P, ++TT.Index); 31 } 32 33 A &operator=(const A &RHS) { 34 TT = RHS.TT; 35 P = RHS.P; 36 Truth = RHS.Truth; 37 RHS.P = 0; 38 return *this; 39 } 40 41 operator bool () { return Truth; } 42}; 43 44// 3, 7, 2 45static unsigned f0(bool val = false) { 46 TempTracker tt; 47 { 48 A a(tt, 2); 49 if ((A(tt, 3), val)) 50 A b(tt, 5); 51 A c(tt, 7); 52 } 53 return tt.Product; 54} 55 56// 3, 5, 7, 2 57static unsigned f1(bool val = true) { 58 TempTracker tt; 59 { 60 A a(tt, 2); 61 if ((A(tt, 3), val)) 62 A b(tt, 5); 63 A c(tt, 7); 64 } 65 return tt.Product; 66} 67 68// 5, 3, 7, 2 69static unsigned f2() { 70 TempTracker tt; 71 { 72 A a(tt, 2); 73 if (A b = A(tt, 3)) 74 A c(tt, 5); 75 A d(tt, 7); 76 } 77 return tt.Product; 78} 79 80// 7, 3, 11, 2 81static unsigned f3() { 82 TempTracker tt; 83 { 84 A a(tt, 2); 85 if (A b = A(tt, 3, false)) 86 A c(tt, 5); 87 else 88 A c(tt, 7); 89 A d(tt, 11); 90 } 91 return tt.Product; 92} 93 94// 3, 7, 2 95static unsigned f4() { 96 TempTracker tt; 97 { 98 A a(tt, 2); 99 while (A b = A(tt, 3, false)) 100 A c(tt, 5); 101 A c(tt, 7); 102 } 103 return tt.Product; 104} 105 106// 5, 3, 7, 2 107static unsigned f5() { 108 TempTracker tt; 109 { 110 A a(tt, 2); 111 while (A b = A(tt, 3, true)) { 112 A c(tt, 5); 113 break; 114 } 115 A c(tt, 7); 116 } 117 return tt.Product; 118} 119 120// 3, 7, 11, 5, 13, 2 121static unsigned f6() { 122 TempTracker tt; 123 { 124 A a(tt, 2); 125 for (A b = (A(tt, 3), A(tt, 5)), c = (A(tt, 7), A(tt, 11));;) 126 break; 127 A c(tt, 13); 128 } 129 return tt.Product; 130} 131 132extern "C" void error(); 133extern "C" void print(const char *Name, unsigned N); 134 135#define ORDER3(a, b, c) (pow(a, 1) * pow(b, 2) * pow(c, 3)) 136#define ORDER4(a, b, c, d) (ORDER3(a, b, c) * pow(d, 4)) 137#define ORDER5(a, b, c, d, e) (ORDER4(a, b, c, d) * pow(e, 5)) 138#define ORDER6(a, b, c, d, e, f) (ORDER5(a, b, c, d, e) * pow(f, 6)) 139void test() { 140// CHECK: call void @print(i8* {{.*}}, i32 1176) 141 print("f0", f0()); 142 if (f0() != ORDER3(3, 7, 2)) 143 error(); 144 145// CHECK: call void @print(i8* {{.*}}, i32 411600) 146 print("f1", f1()); 147 if (f1() != ORDER4(3, 5, 7, 2)) 148 error(); 149 150// CHECK: call void @print(i8* {{.*}}, i32 246960) 151 print("f2", f2()); 152 if (f2() != ORDER4(5, 3, 7, 2)) 153 error(); 154 155// CHECK: call void @print(i8* {{.*}}, i32 1341648) 156 print("f3", f3()); 157 if (f3() != ORDER4(7, 3, 11, 2)) 158 error(); 159 160// CHECK: call void @print(i8* {{.*}}, i32 1176) 161 print("f4", f4()); 162 if (f4() != ORDER3(3, 7, 2)) 163 error(); 164 165// CHECK: call void @print(i8* {{.*}}, i32 246960) 166 print("f5", f5()); 167 if (f5() != ORDER4(5, 3, 7, 2)) 168 error(); 169 170// CHECK: call void @print(i8* {{.*}}, i32 1251552576) 171 print("f6", f6()); 172 if (f6() != ORDER6(3, 7, 11, 5, 13, 2)) 173 error(); 174} 175 176 177 178#ifdef HARNESS 179 180#include <cstdlib> 181#include <cstdio> 182 183extern "C" void error() { 184 abort(); 185} 186 187extern "C" void print(const char *name, unsigned N) { 188 printf("%s: %d\n", name, N); 189} 190 191int main() { 192 test(); 193 return 0; 194} 195 196#endif 197