head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.3 netbsd-11-0-RC3:1.1.1.3 netbsd-11-0-RC2:1.1.1.3 netbsd-11-0-RC1:1.1.1.3 perseant-exfatfs-base-20250801:1.1.1.3 netbsd-11:1.1.1.3.0.10 netbsd-11-base:1.1.1.3 netbsd-10-1-RELEASE:1.1.1.3 perseant-exfatfs-base-20240630:1.1.1.3 perseant-exfatfs:1.1.1.3.0.8 perseant-exfatfs-base:1.1.1.3 netbsd-8-3-RELEASE:1.1.1.1 netbsd-9-4-RELEASE:1.1.1.2 netbsd-10-0-RELEASE:1.1.1.3 netbsd-10-0-RC6:1.1.1.3 netbsd-10-0-RC5:1.1.1.3 netbsd-10-0-RC4:1.1.1.3 netbsd-10-0-RC3:1.1.1.3 netbsd-10-0-RC2:1.1.1.3 netbsd-10-0-RC1:1.1.1.3 netbsd-10:1.1.1.3.0.6 netbsd-10-base:1.1.1.3 netbsd-9-3-RELEASE:1.1.1.2 cjep_sun2x:1.1.1.3.0.4 cjep_sun2x-base:1.1.1.3 cjep_staticlib_x-base1:1.1.1.3 netbsd-9-2-RELEASE:1.1.1.2 cjep_staticlib_x:1.1.1.3.0.2 cjep_staticlib_x-base:1.1.1.3 netbsd-9-1-RELEASE:1.1.1.2 phil-wifi-20200421:1.1.1.3 phil-wifi-20200411:1.1.1.3 phil-wifi-20200406:1.1.1.3 netbsd-8-2-RELEASE:1.1.1.1 netbsd-9-0-RELEASE:1.1.1.2 netbsd-9-0-RC2:1.1.1.2 netbsd-9-0-RC1:1.1.1.2 netbsd-9:1.1.1.2.0.2 netbsd-9-base:1.1.1.2 phil-wifi-20190609:1.1.1.2 netbsd-8-1-RELEASE:1.1.1.1 netbsd-8-1-RC1:1.1.1.1 pgoyette-compat-merge-20190127:1.1.1.1.14.1 pgoyette-compat-20190127:1.1.1.2 pgoyette-compat-20190118:1.1.1.2 pgoyette-compat-1226:1.1.1.2 pgoyette-compat-1126:1.1.1.2 pgoyette-compat-1020:1.1.1.2 pgoyette-compat-0930:1.1.1.2 pgoyette-compat-0906:1.1.1.2 pgoyette-compat-0728:1.1.1.2 clang-337282:1.1.1.2 netbsd-8-0-RELEASE:1.1.1.1 phil-wifi:1.1.1.1.0.16 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 pgoyette-compat:1.1.1.1.0.14 pgoyette-compat-base:1.1.1.1 clang-319952:1.1.1.1 matt-nb8-mediatek:1.1.1.1.0.12 matt-nb8-mediatek-base:1.1.1.1 clang-309604:1.1.1.1 perseant-stdc-iso10646:1.1.1.1.0.10 perseant-stdc-iso10646-base:1.1.1.1 netbsd-8:1.1.1.1.0.8 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.6 prg-localcount2-base:1.1.1.1 pgoyette-localcount-20170426:1.1.1.1 bouyer-socketcan-base1:1.1.1.1 pgoyette-localcount:1.1.1.1.0.4 pgoyette-localcount-20170320:1.1.1.1 clang-294123:1.1.1.1 bouyer-socketcan:1.1.1.1.0.2 bouyer-socketcan-base:1.1.1.1 clang-291444:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.1 date 2017.01.11.10.40.05; author joerg; state Exp; branches 1.1.1.1; next ; commitid CNnUNfII1jgNmxBz; 1.1.1.1 date 2017.01.11.10.40.05; author joerg; state Exp; branches 1.1.1.1.4.1 1.1.1.1.14.1 1.1.1.1.16.1; next 1.1.1.2; commitid CNnUNfII1jgNmxBz; 1.1.1.2 date 2018.07.17.18.31.27; author joerg; state Exp; branches; next 1.1.1.3; commitid wDzL46ALjrCZgwKA; 1.1.1.3 date 2019.11.13.22.20.14; author joerg; state dead; branches; next ; commitid QD8YATxuNG34YJKB; 1.1.1.1.4.1 date 2017.01.11.10.40.05; author pgoyette; state dead; branches; next 1.1.1.1.4.2; commitid jjw7cAwgyKq7RfKz; 1.1.1.1.4.2 date 2017.03.20.06.52.58; author pgoyette; state Exp; branches; next ; commitid jjw7cAwgyKq7RfKz; 1.1.1.1.14.1 date 2018.07.28.04.33.42; author pgoyette; state Exp; branches; next ; commitid 1UP1xAIUxv1ZgRLA; 1.1.1.1.16.1 date 2019.06.10.21.45.51; author christos; state Exp; branches; next 1.1.1.1.16.2; commitid jtc8rnCzWiEEHGqB; 1.1.1.1.16.2 date 2020.04.13.07.47.28; author martin; state dead; branches; next ; commitid X01YhRUPVUDaec4C; desc @@ 1.1 log @Initial revision @ text @// Check that delete exprs call aligned (de)allocation functions if // -faligned-allocation is passed in both C++11 and C++14. // RUN: %clang_cc1 -std=c++11 -fexceptions -fsized-deallocation -faligned-allocation %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s // RUN: %clang_cc1 -std=c++14 -fexceptions -fsized-deallocation -faligned-allocation %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s // RUN: %clang_cc1 -std=c++1z -fexceptions -fsized-deallocation %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s // Check that we don't used aligned (de)allocation without -faligned-allocation or C++1z. // RUN: %clang_cc1 -std=c++14 -DUNALIGNED -fexceptions %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s --check-prefix=CHECK-UNALIGNED // RUN: %clang_cc1 -std=c++1z -DUNALIGNED -fexceptions -fno-aligned-allocation %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s --check-prefix=CHECK-UNALIGNED // CHECK-UNALIGNED-NOT: _Znwm_St11align_val_t // CHECK-UNALIGNED-NOT: _Znam_St11align_val_t // CHECK-UNALIGNED-NOT: _ZdlPv_St11align_val_t // CHECK-UNALIGNED-NOT: _ZdaPv_St11align_val_t // CHECK-UNALIGNED-NOT: _ZdlPvm_St11align_val_t // CHECK-UNALIGNED-NOT: _ZdaPvm_St11align_val_t typedef decltype(sizeof(0)) size_t; namespace std { enum class align_val_t : size_t {}; } #define OVERALIGNED alignas(__STDCPP_DEFAULT_NEW_ALIGNMENT__ * 2) // Global new and delete. // ====================== struct OVERALIGNED A { A(); int n[128]; }; // CHECK-LABEL: define {{.*}} @@_Z2a0v() // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnwmSt11align_val_t(i64 512, i64 32) // CHECK: call void @@_ZdlPvSt11align_val_t(i8* %[[ALLOC]], i64 32) void *a0() { return new A; } // CHECK-LABEL: define {{.*}} @@_Z2a1l( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnamSt11align_val_t(i64 %{{.*}}, i64 32) // No array cookie. // CHECK-NOT: store // CHECK: invoke void @@_ZN1AC1Ev( // CHECK: call void @@_ZdaPvSt11align_val_t(i8* %[[ALLOC]], i64 32) void *a1(long n) { return new A[n]; } // CHECK-LABEL: define {{.*}} @@_Z2a2P1A( // CHECK: call void @@_ZdlPvmSt11align_val_t(i8* %{{.*}}, i64 512, i64 32) #9 void a2(A *p) { delete p; } // CHECK-LABEL: define {{.*}} @@_Z2a3P1A( // CHECK: call void @@_ZdaPvSt11align_val_t(i8* %{{.*}}, i64 32) #9 void a3(A *p) { delete[] p; } // Class-specific usual new and delete. // ==================================== struct OVERALIGNED B { B(); // These are just a distraction. We should ignore them. void *operator new(size_t); void operator delete(void*, size_t); void operator delete[](void*, size_t); void *operator new(size_t, std::align_val_t); void operator delete(void*, std::align_val_t); void operator delete[](void*, std::align_val_t); int n[128]; }; // CHECK-LABEL: define {{.*}} @@_Z2b0v() // CHECK: %[[ALLOC:.*]] = call i8* @@_ZN1BnwEmSt11align_val_t(i64 512, i64 32) // CHECK: call void @@_ZN1BdlEPvSt11align_val_t(i8* %[[ALLOC]], i64 32) void *b0() { return new B; } // CHECK-LABEL: define {{.*}} @@_Z2b1l( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnamSt11align_val_t(i64 %{{.*}}, i64 32) // No array cookie. // CHECK-NOT: store // CHECK: invoke void @@_ZN1BC1Ev( // CHECK: call void @@_ZN1BdaEPvSt11align_val_t(i8* %[[ALLOC]], i64 32) void *b1(long n) { return new B[n]; } // CHECK-LABEL: define {{.*}} @@_Z2b2P1B( // CHECK: call void @@_ZN1BdlEPvSt11align_val_t(i8* %{{.*}}, i64 32) void b2(B *p) { delete p; } // CHECK-LABEL: define {{.*}} @@_Z2b3P1B( // CHECK: call void @@_ZN1BdaEPvSt11align_val_t(i8* %{{.*}}, i64 32) void b3(B *p) { delete[] p; } struct OVERALIGNED C { C(); void *operator new[](size_t, std::align_val_t); void operator delete[](void*, size_t, std::align_val_t); // It doesn't matter that we have an unaligned operator delete[] that doesn't // want the size. What matters is that the aligned one does. void operator delete[](void*); }; // This one has an array cookie. // CHECK-LABEL: define {{.*}} @@_Z2b4l( // CHECK: call {{.*}} @@llvm.umul.with.overflow{{.*}}i64 32 // CHECK: call {{.*}} @@llvm.uadd.with.overflow{{.*}}i64 32 // CHECK: %[[ALLOC:.*]] = call i8* @@_ZN1CnaEmSt11align_val_t(i64 %{{.*}}, i64 32) // CHECK: store // CHECK: call void @@_ZN1CC1Ev( // // Note, we're still calling a placement allocation function, and there is no // matching placement operator delete. =( // FIXME: This seems broken. // CHECK-NOT: call void @@_ZN1CdaEPvmSt11align_val_t( #ifndef UNALIGNED void *b4(long n) { return new C[n]; } #endif // CHECK-LABEL: define {{.*}} @@_Z2b5P1C( // CHECK: mul i64{{.*}} 32 // CHECK: add i64{{.*}} 32 // CHECK: call void @@_ZN1CdaEPvmSt11align_val_t( void b5(C *p) { delete[] p; } // Global placement new. // ===================== struct Q { int n; } q; void *operator new(size_t, Q); void *operator new(size_t, std::align_val_t, Q); void operator delete(void*, Q); void operator delete(void*, std::align_val_t, Q); // CHECK-LABEL: define {{.*}} @@_Z2c0v( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnwmSt11align_val_t1Q(i64 512, i64 32, i32 % // CHECK: call void @@_ZdlPvSt11align_val_t1Q(i8* %[[ALLOC]], i64 32, i32 % void *c0() { return new (q) A; } // Class-specific placement new. // ============================= struct OVERALIGNED D { D(); void *operator new(size_t, Q); void *operator new(size_t, std::align_val_t, Q); void operator delete(void*, Q); void operator delete(void*, std::align_val_t, Q); }; // CHECK-LABEL: define {{.*}} @@_Z2d0v( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZN1DnwEmSt11align_val_t1Q(i64 32, i64 32, i32 % // CHECK: call void @@_ZN1DdlEPvSt11align_val_t1Q(i8* %[[ALLOC]], i64 32, i32 % void *d0() { return new (q) D; } // Calling aligned new with placement syntax. // ========================================== #ifndef UNALIGNED // CHECK-LABEL: define {{.*}} @@_Z2e0v( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnwmSt11align_val_t(i64 512, i64 5) // CHECK: call void @@_ZdlPvSt11align_val_t(i8* %[[ALLOC]], i64 5) void *e0() { return new (std::align_val_t(5)) A; } // CHECK-LABEL: define {{.*}} @@_Z2e1v( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZN1BnwEmSt11align_val_t(i64 512, i64 5) // CHECK: call void @@_ZN1BdlEPvSt11align_val_t(i8* %[[ALLOC]], i64 5) void *e1() { return new (std::align_val_t(5)) B; } #endif // Variadic placement/non-placement allocation functions. // ====================================================== struct OVERALIGNED F { F(); void *operator new(size_t, ...); void operator delete(void*, ...); int n[128]; }; // CHECK-LABEL: define {{.*}} @@_Z2f0v( // CHECK: %[[ALLOC:.*]] = call i8* (i64, ...) @@_ZN1FnwEmz(i64 512, i64 32) // Non-placement allocation function, uses normal deallocation lookup which // cares about whether a parameter has type std::align_val_t. // CHECK: call void (i8*, ...) @@_ZN1FdlEPvz(i8* %[[ALLOC]]) void *f0() { return new F; } // CHECK-LABEL: define {{.*}} @@_Z2f1v( // CHECK: %[[ALLOC:.*]] = call i8* (i64, ...) @@_ZN1FnwEmz(i64 512, i64 32, i32 % // Placement allocation function, uses placement deallocation matching, which // passes same arguments and therefore includes alignment. // CHECK: call void (i8*, ...) @@_ZN1FdlEPvz(i8* %[[ALLOC]], i64 32, i32 % void *f1() { return new (q) F; } struct OVERALIGNED G { G(); void *operator new(size_t, std::align_val_t, ...); void operator delete(void*, std::align_val_t, ...); int n[128]; }; #ifndef UNALIGNED // CHECK-LABEL: define {{.*}} @@_Z2g0v // CHECK: %[[ALLOC:.*]] = call i8* (i64, i64, ...) @@_ZN1GnwEmSt11align_val_tz(i64 512, i64 32) // CHECK: call void (i8*, i64, ...) @@_ZN1GdlEPvSt11align_val_tz(i8* %[[ALLOC]], i64 32) void *g0() { return new G; } // CHECK-LABEL: define {{.*}} @@_Z2g1v // CHECK: %[[ALLOC:.*]] = call i8* (i64, i64, ...) @@_ZN1GnwEmSt11align_val_tz(i64 512, i64 32, i32 % // CHECK: call void (i8*, i64, ...) @@_ZN1GdlEPvSt11align_val_tz(i8* %[[ALLOC]], i64 32, i32 % void *g1() { return new (q) G; } #endif @ 1.1.1.1 log @Import Clang pre-4.0.0 r291444. @ text @@ 1.1.1.1.16.1 log @Sync with HEAD @ text @a6 2 // RUN: %clang_cc1 -std=c++1z -fexceptions -fsized-deallocation %s -emit-llvm -triple x86_64-windows-msvc -o - | FileCheck %s --check-prefix=CHECK-MS a29 4 // CHECK-MS-LABEL: define {{.*}} @@"?a0@@@@YAPEAXXZ"() // CHECK-MS: %[[ALLOC:.*]] = call i8* @@"??2@@YAPEAX_KW4align_val_t@@std@@@@@@Z"(i64 512, i64 32) // CHECK-MS: cleanuppad // CHECK-MS: call void @@"??3@@YAXPEAXW4align_val_t@@std@@@@@@Z"(i8* %[[ALLOC]], i64 32) a31 3 // FIXME: Why don't we call the sized array deallocation overload in this case? // The size is known. // a37 7 // CHECK-MS-LABEL: define {{.*}} @@"?a1@@@@YAPEAXJ@@Z"( // CHECK-MS: %[[ALLOC:.*]] = call i8* @@"??_U@@YAPEAX_KW4align_val_t@@std@@@@@@Z"(i64 %{{.*}}, i64 32) // No array cookie. // CHECK-MS-NOT: store // CHECK-MS: invoke %struct.A* @@"??0A@@@@QEAA@@XZ"( // CHECK-MS: cleanuppad // CHECK-MS: call void @@"??_V@@YAXPEAXW4align_val_t@@std@@@@@@Z"(i8* %[[ALLOC]], i64 32) @ 1.1.1.1.16.2 log @Mostly merge changes from HEAD upto 20200411 @ text @@ 1.1.1.1.14.1 log @Sync with HEAD @ text @a6 2 // RUN: %clang_cc1 -std=c++1z -fexceptions -fsized-deallocation %s -emit-llvm -triple x86_64-windows-msvc -o - | FileCheck %s --check-prefix=CHECK-MS a29 4 // CHECK-MS-LABEL: define {{.*}} @@"?a0@@@@YAPEAXXZ"() // CHECK-MS: %[[ALLOC:.*]] = call i8* @@"??2@@YAPEAX_KW4align_val_t@@std@@@@@@Z"(i64 512, i64 32) // CHECK-MS: cleanuppad // CHECK-MS: call void @@"??3@@YAXPEAXW4align_val_t@@std@@@@@@Z"(i8* %[[ALLOC]], i64 32) a31 3 // FIXME: Why don't we call the sized array deallocation overload in this case? // The size is known. // a37 7 // CHECK-MS-LABEL: define {{.*}} @@"?a1@@@@YAPEAXJ@@Z"( // CHECK-MS: %[[ALLOC:.*]] = call i8* @@"??_U@@YAPEAX_KW4align_val_t@@std@@@@@@Z"(i64 %{{.*}}, i64 32) // No array cookie. // CHECK-MS-NOT: store // CHECK-MS: invoke %struct.A* @@"??0A@@@@QEAA@@XZ"( // CHECK-MS: cleanuppad // CHECK-MS: call void @@"??_V@@YAXPEAXW4align_val_t@@std@@@@@@Z"(i8* %[[ALLOC]], i64 32) @ 1.1.1.2 log @Import clang r337282 from trunk @ text @a6 2 // RUN: %clang_cc1 -std=c++1z -fexceptions -fsized-deallocation %s -emit-llvm -triple x86_64-windows-msvc -o - | FileCheck %s --check-prefix=CHECK-MS a29 4 // CHECK-MS-LABEL: define {{.*}} @@"?a0@@@@YAPEAXXZ"() // CHECK-MS: %[[ALLOC:.*]] = call i8* @@"??2@@YAPEAX_KW4align_val_t@@std@@@@@@Z"(i64 512, i64 32) // CHECK-MS: cleanuppad // CHECK-MS: call void @@"??3@@YAXPEAXW4align_val_t@@std@@@@@@Z"(i8* %[[ALLOC]], i64 32) a31 3 // FIXME: Why don't we call the sized array deallocation overload in this case? // The size is known. // a37 7 // CHECK-MS-LABEL: define {{.*}} @@"?a1@@@@YAPEAXJ@@Z"( // CHECK-MS: %[[ALLOC:.*]] = call i8* @@"??_U@@YAPEAX_KW4align_val_t@@std@@@@@@Z"(i64 %{{.*}}, i64 32) // No array cookie. // CHECK-MS-NOT: store // CHECK-MS: invoke %struct.A* @@"??0A@@@@QEAA@@XZ"( // CHECK-MS: cleanuppad // CHECK-MS: call void @@"??_V@@YAXPEAXW4align_val_t@@std@@@@@@Z"(i8* %[[ALLOC]], i64 32) @ 1.1.1.3 log @Mark old LLVM instance as dead. @ text @@ 1.1.1.1.4.1 log @file cxx1z-aligned-allocation.cpp was added on branch pgoyette-localcount on 2017-03-20 06:52:58 +0000 @ text @d1 206 @ 1.1.1.1.4.2 log @Sync with HEAD @ text @a0 206 // Check that delete exprs call aligned (de)allocation functions if // -faligned-allocation is passed in both C++11 and C++14. // RUN: %clang_cc1 -std=c++11 -fexceptions -fsized-deallocation -faligned-allocation %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s // RUN: %clang_cc1 -std=c++14 -fexceptions -fsized-deallocation -faligned-allocation %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s // RUN: %clang_cc1 -std=c++1z -fexceptions -fsized-deallocation %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s // Check that we don't used aligned (de)allocation without -faligned-allocation or C++1z. // RUN: %clang_cc1 -std=c++14 -DUNALIGNED -fexceptions %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s --check-prefix=CHECK-UNALIGNED // RUN: %clang_cc1 -std=c++1z -DUNALIGNED -fexceptions -fno-aligned-allocation %s -emit-llvm -triple x86_64-linux-gnu -o - | FileCheck %s --check-prefix=CHECK-UNALIGNED // CHECK-UNALIGNED-NOT: _Znwm_St11align_val_t // CHECK-UNALIGNED-NOT: _Znam_St11align_val_t // CHECK-UNALIGNED-NOT: _ZdlPv_St11align_val_t // CHECK-UNALIGNED-NOT: _ZdaPv_St11align_val_t // CHECK-UNALIGNED-NOT: _ZdlPvm_St11align_val_t // CHECK-UNALIGNED-NOT: _ZdaPvm_St11align_val_t typedef decltype(sizeof(0)) size_t; namespace std { enum class align_val_t : size_t {}; } #define OVERALIGNED alignas(__STDCPP_DEFAULT_NEW_ALIGNMENT__ * 2) // Global new and delete. // ====================== struct OVERALIGNED A { A(); int n[128]; }; // CHECK-LABEL: define {{.*}} @@_Z2a0v() // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnwmSt11align_val_t(i64 512, i64 32) // CHECK: call void @@_ZdlPvSt11align_val_t(i8* %[[ALLOC]], i64 32) void *a0() { return new A; } // CHECK-LABEL: define {{.*}} @@_Z2a1l( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnamSt11align_val_t(i64 %{{.*}}, i64 32) // No array cookie. // CHECK-NOT: store // CHECK: invoke void @@_ZN1AC1Ev( // CHECK: call void @@_ZdaPvSt11align_val_t(i8* %[[ALLOC]], i64 32) void *a1(long n) { return new A[n]; } // CHECK-LABEL: define {{.*}} @@_Z2a2P1A( // CHECK: call void @@_ZdlPvmSt11align_val_t(i8* %{{.*}}, i64 512, i64 32) #9 void a2(A *p) { delete p; } // CHECK-LABEL: define {{.*}} @@_Z2a3P1A( // CHECK: call void @@_ZdaPvSt11align_val_t(i8* %{{.*}}, i64 32) #9 void a3(A *p) { delete[] p; } // Class-specific usual new and delete. // ==================================== struct OVERALIGNED B { B(); // These are just a distraction. We should ignore them. void *operator new(size_t); void operator delete(void*, size_t); void operator delete[](void*, size_t); void *operator new(size_t, std::align_val_t); void operator delete(void*, std::align_val_t); void operator delete[](void*, std::align_val_t); int n[128]; }; // CHECK-LABEL: define {{.*}} @@_Z2b0v() // CHECK: %[[ALLOC:.*]] = call i8* @@_ZN1BnwEmSt11align_val_t(i64 512, i64 32) // CHECK: call void @@_ZN1BdlEPvSt11align_val_t(i8* %[[ALLOC]], i64 32) void *b0() { return new B; } // CHECK-LABEL: define {{.*}} @@_Z2b1l( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnamSt11align_val_t(i64 %{{.*}}, i64 32) // No array cookie. // CHECK-NOT: store // CHECK: invoke void @@_ZN1BC1Ev( // CHECK: call void @@_ZN1BdaEPvSt11align_val_t(i8* %[[ALLOC]], i64 32) void *b1(long n) { return new B[n]; } // CHECK-LABEL: define {{.*}} @@_Z2b2P1B( // CHECK: call void @@_ZN1BdlEPvSt11align_val_t(i8* %{{.*}}, i64 32) void b2(B *p) { delete p; } // CHECK-LABEL: define {{.*}} @@_Z2b3P1B( // CHECK: call void @@_ZN1BdaEPvSt11align_val_t(i8* %{{.*}}, i64 32) void b3(B *p) { delete[] p; } struct OVERALIGNED C { C(); void *operator new[](size_t, std::align_val_t); void operator delete[](void*, size_t, std::align_val_t); // It doesn't matter that we have an unaligned operator delete[] that doesn't // want the size. What matters is that the aligned one does. void operator delete[](void*); }; // This one has an array cookie. // CHECK-LABEL: define {{.*}} @@_Z2b4l( // CHECK: call {{.*}} @@llvm.umul.with.overflow{{.*}}i64 32 // CHECK: call {{.*}} @@llvm.uadd.with.overflow{{.*}}i64 32 // CHECK: %[[ALLOC:.*]] = call i8* @@_ZN1CnaEmSt11align_val_t(i64 %{{.*}}, i64 32) // CHECK: store // CHECK: call void @@_ZN1CC1Ev( // // Note, we're still calling a placement allocation function, and there is no // matching placement operator delete. =( // FIXME: This seems broken. // CHECK-NOT: call void @@_ZN1CdaEPvmSt11align_val_t( #ifndef UNALIGNED void *b4(long n) { return new C[n]; } #endif // CHECK-LABEL: define {{.*}} @@_Z2b5P1C( // CHECK: mul i64{{.*}} 32 // CHECK: add i64{{.*}} 32 // CHECK: call void @@_ZN1CdaEPvmSt11align_val_t( void b5(C *p) { delete[] p; } // Global placement new. // ===================== struct Q { int n; } q; void *operator new(size_t, Q); void *operator new(size_t, std::align_val_t, Q); void operator delete(void*, Q); void operator delete(void*, std::align_val_t, Q); // CHECK-LABEL: define {{.*}} @@_Z2c0v( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnwmSt11align_val_t1Q(i64 512, i64 32, i32 % // CHECK: call void @@_ZdlPvSt11align_val_t1Q(i8* %[[ALLOC]], i64 32, i32 % void *c0() { return new (q) A; } // Class-specific placement new. // ============================= struct OVERALIGNED D { D(); void *operator new(size_t, Q); void *operator new(size_t, std::align_val_t, Q); void operator delete(void*, Q); void operator delete(void*, std::align_val_t, Q); }; // CHECK-LABEL: define {{.*}} @@_Z2d0v( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZN1DnwEmSt11align_val_t1Q(i64 32, i64 32, i32 % // CHECK: call void @@_ZN1DdlEPvSt11align_val_t1Q(i8* %[[ALLOC]], i64 32, i32 % void *d0() { return new (q) D; } // Calling aligned new with placement syntax. // ========================================== #ifndef UNALIGNED // CHECK-LABEL: define {{.*}} @@_Z2e0v( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZnwmSt11align_val_t(i64 512, i64 5) // CHECK: call void @@_ZdlPvSt11align_val_t(i8* %[[ALLOC]], i64 5) void *e0() { return new (std::align_val_t(5)) A; } // CHECK-LABEL: define {{.*}} @@_Z2e1v( // CHECK: %[[ALLOC:.*]] = call i8* @@_ZN1BnwEmSt11align_val_t(i64 512, i64 5) // CHECK: call void @@_ZN1BdlEPvSt11align_val_t(i8* %[[ALLOC]], i64 5) void *e1() { return new (std::align_val_t(5)) B; } #endif // Variadic placement/non-placement allocation functions. // ====================================================== struct OVERALIGNED F { F(); void *operator new(size_t, ...); void operator delete(void*, ...); int n[128]; }; // CHECK-LABEL: define {{.*}} @@_Z2f0v( // CHECK: %[[ALLOC:.*]] = call i8* (i64, ...) @@_ZN1FnwEmz(i64 512, i64 32) // Non-placement allocation function, uses normal deallocation lookup which // cares about whether a parameter has type std::align_val_t. // CHECK: call void (i8*, ...) @@_ZN1FdlEPvz(i8* %[[ALLOC]]) void *f0() { return new F; } // CHECK-LABEL: define {{.*}} @@_Z2f1v( // CHECK: %[[ALLOC:.*]] = call i8* (i64, ...) @@_ZN1FnwEmz(i64 512, i64 32, i32 % // Placement allocation function, uses placement deallocation matching, which // passes same arguments and therefore includes alignment. // CHECK: call void (i8*, ...) @@_ZN1FdlEPvz(i8* %[[ALLOC]], i64 32, i32 % void *f1() { return new (q) F; } struct OVERALIGNED G { G(); void *operator new(size_t, std::align_val_t, ...); void operator delete(void*, std::align_val_t, ...); int n[128]; }; #ifndef UNALIGNED // CHECK-LABEL: define {{.*}} @@_Z2g0v // CHECK: %[[ALLOC:.*]] = call i8* (i64, i64, ...) @@_ZN1GnwEmSt11align_val_tz(i64 512, i64 32) // CHECK: call void (i8*, i64, ...) @@_ZN1GdlEPvSt11align_val_tz(i8* %[[ALLOC]], i64 32) void *g0() { return new G; } // CHECK-LABEL: define {{.*}} @@_Z2g1v // CHECK: %[[ALLOC:.*]] = call i8* (i64, i64, ...) @@_ZN1GnwEmSt11align_val_tz(i64 512, i64 32, i32 % // CHECK: call void (i8*, i64, ...) @@_ZN1GdlEPvSt11align_val_tz(i8* %[[ALLOC]], i64 32, i32 % void *g1() { return new (q) G; } #endif @