40 lines · cpp
1// RUN: %clang_analyze_cc1 -analyzer-checker=core -verify %s2// expected-no-diagnostics3 4template <class T, int Idx, bool CanBeEmptyBase = __is_empty(T) && (!__is_final(T))>5struct compressed_pair_elem {6 explicit compressed_pair_elem(T u) : value(u) {}7 T value;8};9 10template <class T, int Idx>11struct compressed_pair_elem<T, Idx, /*CanBeEmptyBase=*/true> : T {12 explicit compressed_pair_elem(T u) : T(u) {}13};14 15template <class T1, class T2, class Base1 = compressed_pair_elem<T1, 0>, class Base2 = compressed_pair_elem<T2, 1>>16struct compressed_pair : Base1, Base2 {17 explicit compressed_pair(T1 t1, T2 t2) : Base1(t1), Base2(t2) {}18};19 20// empty deleter object21template <class T>22struct default_delete {23 void operator()(T* p) {24 delete p;25 }26};27 28template <class T, class Deleter = default_delete<T> >29struct some_unique_ptr {30 // compressed_pair will employ the empty base class optimization, thus overlapping31 // the `int*` and the empty `Deleter` object, clobbering the pointer.32 compressed_pair<int*, Deleter> ptr;33 some_unique_ptr(int* p, Deleter d) : ptr(p, d) {}34 ~some_unique_ptr();35};36 37void entry_point() {38 some_unique_ptr<int, default_delete<int> > u3(new int(12), default_delete<int>());39}40