head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC5:1.1.1.2 netbsd-11-0-RC4:1.1.1.2 netbsd-11-0-RC3:1.1.1.2 netbsd-11-0-RC2:1.1.1.2 netbsd-11-0-RC1:1.1.1.2 perseant-exfatfs-base-20250801:1.1.1.2 netbsd-11:1.1.1.2.0.10 netbsd-11-base:1.1.1.2 netbsd-10-1-RELEASE:1.1.1.2 perseant-exfatfs-base-20240630:1.1.1.2 perseant-exfatfs:1.1.1.2.0.8 perseant-exfatfs-base:1.1.1.2 netbsd-8-3-RELEASE:1.1.1.1 netbsd-9-4-RELEASE:1.1.1.1 netbsd-10-0-RELEASE:1.1.1.2 netbsd-10-0-RC6:1.1.1.2 netbsd-10-0-RC5:1.1.1.2 netbsd-10-0-RC4:1.1.1.2 netbsd-10-0-RC3:1.1.1.2 netbsd-10-0-RC2:1.1.1.2 netbsd-10-0-RC1:1.1.1.2 netbsd-10:1.1.1.2.0.6 netbsd-10-base:1.1.1.2 netbsd-9-3-RELEASE:1.1.1.1 cjep_sun2x:1.1.1.2.0.4 cjep_sun2x-base:1.1.1.2 cjep_staticlib_x-base1:1.1.1.2 netbsd-9-2-RELEASE:1.1.1.1 cjep_staticlib_x:1.1.1.2.0.2 cjep_staticlib_x-base:1.1.1.2 netbsd-9-1-RELEASE:1.1.1.1 phil-wifi-20200421:1.1.1.2 phil-wifi-20200411:1.1.1.2 phil-wifi-20200406:1.1.1.2 netbsd-8-2-RELEASE:1.1.1.1 netbsd-9-0-RELEASE:1.1.1.1 netbsd-9-0-RC2:1.1.1.1 netbsd-9-0-RC1:1.1.1.1 netbsd-9:1.1.1.1.0.32 netbsd-9-base:1.1.1.1 phil-wifi-20190609:1.1.1.1 netbsd-8-1-RELEASE:1.1.1.1 netbsd-8-1-RC1:1.1.1.1 pgoyette-compat-merge-20190127:1.1.1.1 pgoyette-compat-20190127:1.1.1.1 pgoyette-compat-20190118:1.1.1.1 pgoyette-compat-1226:1.1.1.1 pgoyette-compat-1126:1.1.1.1 pgoyette-compat-1020:1.1.1.1 pgoyette-compat-0930:1.1.1.1 pgoyette-compat-0906:1.1.1.1 netbsd-7-2-RELEASE:1.1.1.1 pgoyette-compat-0728:1.1.1.1 clang-337282:1.1.1.1 netbsd-8-0-RELEASE:1.1.1.1 phil-wifi:1.1.1.1.0.30 phil-wifi-base:1.1.1.1 pgoyette-compat-0625:1.1.1.1 netbsd-8-0-RC2:1.1.1.1 pgoyette-compat-0521:1.1.1.1 pgoyette-compat-0502:1.1.1.1 pgoyette-compat-0422:1.1.1.1 netbsd-8-0-RC1:1.1.1.1 pgoyette-compat-0415:1.1.1.1 pgoyette-compat-0407:1.1.1.1 pgoyette-compat-0330:1.1.1.1 pgoyette-compat-0322:1.1.1.1 pgoyette-compat-0315:1.1.1.1 netbsd-7-1-2-RELEASE:1.1.1.1 pgoyette-compat:1.1.1.1.0.28 pgoyette-compat-base:1.1.1.1 netbsd-7-1-1-RELEASE:1.1.1.1 clang-319952:1.1.1.1 matt-nb8-mediatek:1.1.1.1.0.26 matt-nb8-mediatek-base:1.1.1.1 clang-309604:1.1.1.1 perseant-stdc-iso10646:1.1.1.1.0.24 perseant-stdc-iso10646-base:1.1.1.1 netbsd-8:1.1.1.1.0.22 netbsd-8-base:1.1.1.1 prg-localcount2-base3:1.1.1.1 prg-localcount2-base2:1.1.1.1 prg-localcount2-base1:1.1.1.1 prg-localcount2:1.1.1.1.0.20 prg-localcount2-base:1.1.1.1 pgoyette-localcount-20170426:1.1.1.1 bouyer-socketcan-base1:1.1.1.1 pgoyette-localcount-20170320:1.1.1.1 netbsd-7-1:1.1.1.1.0.18 netbsd-7-1-RELEASE:1.1.1.1 netbsd-7-1-RC2:1.1.1.1 clang-294123:1.1.1.1 netbsd-7-nhusb-base-20170116:1.1.1.1 bouyer-socketcan:1.1.1.1.0.16 bouyer-socketcan-base:1.1.1.1 clang-291444:1.1.1.1 pgoyette-localcount-20170107:1.1.1.1 netbsd-7-1-RC1:1.1.1.1 pgoyette-localcount-20161104:1.1.1.1 netbsd-7-0-2-RELEASE:1.1.1.1 localcount-20160914:1.1.1.1 netbsd-7-nhusb:1.1.1.1.0.14 netbsd-7-nhusb-base:1.1.1.1 clang-280599:1.1.1.1 pgoyette-localcount-20160806:1.1.1.1 pgoyette-localcount-20160726:1.1.1.1 pgoyette-localcount:1.1.1.1.0.12 pgoyette-localcount-base:1.1.1.1 netbsd-7-0-1-RELEASE:1.1.1.1 clang-261930:1.1.1.1 netbsd-7-0:1.1.1.1.0.10 netbsd-7-0-RELEASE:1.1.1.1 netbsd-7-0-RC3:1.1.1.1 netbsd-7-0-RC2:1.1.1.1 netbsd-7-0-RC1:1.1.1.1 clang-237755:1.1.1.1 clang-232565:1.1.1.1 clang-227398:1.1.1.1 tls-maxphys-base:1.1.1.1 tls-maxphys:1.1.1.1.0.8 netbsd-7:1.1.1.1.0.6 netbsd-7-base:1.1.1.1 clang-215315:1.1.1.1 clang-209886:1.1.1.1 yamt-pagecache:1.1.1.1.0.4 yamt-pagecache-base9:1.1.1.1 tls-earlyentropy:1.1.1.1.0.2 tls-earlyentropy-base:1.1.1.1 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.1 riastradh-drm2-base3:1.1.1.1 clang-202566:1.1.1.1 clang-201163:1.1.1.1 clang-199312:1.1.1.1 clang-198450:1.1.1.1 clang-196603:1.1.1.1 clang-195771:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.1 date 2013.11.28.14.14.58; author joerg; state Exp; branches 1.1.1.1; next ; commitid ow8OybrawrB1f3fx; 1.1.1.1 date 2013.11.28.14.14.58; author joerg; state Exp; branches 1.1.1.1.4.1 1.1.1.1.8.1 1.1.1.1.30.1; next 1.1.1.2; commitid ow8OybrawrB1f3fx; 1.1.1.2 date 2019.11.13.22.20.15; author joerg; state dead; branches; next ; commitid QD8YATxuNG34YJKB; 1.1.1.1.4.1 date 2013.11.28.14.14.58; author yamt; state dead; branches; next 1.1.1.1.4.2; commitid WSrDtL5nYAUyiyBx; 1.1.1.1.4.2 date 2014.05.22.16.18.57; author yamt; state Exp; branches; next ; commitid WSrDtL5nYAUyiyBx; 1.1.1.1.8.1 date 2013.11.28.14.14.58; author tls; state dead; branches; next 1.1.1.1.8.2; commitid jTnpym9Qu0o4R1Nx; 1.1.1.1.8.2 date 2014.08.19.23.47.58; author tls; state Exp; branches; next ; commitid jTnpym9Qu0o4R1Nx; 1.1.1.1.30.1 date 2020.04.13.07.47.29; author martin; state dead; branches; next ; commitid X01YhRUPVUDaec4C; desc @@ 1.1 log @Initial revision @ text @// 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 #include 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 @ 1.1.1.1 log @Import Clang 3.4rc1 r195771. @ text @@ 1.1.1.1.30.1 log @Mostly merge changes from HEAD upto 20200411 @ text @@ 1.1.1.2 log @Mark old LLVM instance as dead. @ text @@ 1.1.1.1.8.1 log @file temp-order.cpp was added on branch tls-maxphys on 2014-08-19 23:47:58 +0000 @ text @d1 226 @ 1.1.1.1.8.2 log @Rebase to HEAD as of a few days ago. @ text @a0 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 #include 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 @ 1.1.1.1.4.1 log @file temp-order.cpp was added on branch yamt-pagecache on 2014-05-22 16:18:57 +0000 @ text @d1 226 @ 1.1.1.1.4.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 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 #include 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 @