1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <memory> 11 12 // template <class Y, class D> explicit shared_ptr(unique_ptr<Y, D>&&r); 13 14 // UNSUPPORTED: asan, msan 15 16 #include <memory> 17 #include <new> 18 #include <cstdlib> 19 #include <cassert> 20 21 bool throw_next = false; 22 23 void* operator new(std::size_t s) throw(std::bad_alloc) 24 { 25 if (throw_next) 26 throw std::bad_alloc(); 27 return std::malloc(s); 28 } 29 30 void operator delete(void* p) throw() 31 { 32 std::free(p); 33 } 34 35 struct B 36 { 37 static int count; 38 39 B() {++count;} 40 B(const B&) {++count;} 41 virtual ~B() {--count;} 42 }; 43 44 int B::count = 0; 45 46 struct A 47 : public B 48 { 49 static int count; 50 51 A() {++count;} 52 A(const A&) {++count;} 53 ~A() {--count;} 54 }; 55 56 int A::count = 0; 57 58 void fn ( const std::shared_ptr<int> &) {} 59 void fn ( const std::shared_ptr<B> &) { assert (false); } 60 61 int main() 62 { 63 { 64 std::unique_ptr<A> ptr(new A); 65 A* raw_ptr = ptr.get(); 66 std::shared_ptr<B> p(std::move(ptr)); 67 assert(A::count == 1); 68 assert(B::count == 1); 69 assert(p.use_count() == 1); 70 assert(p.get() == raw_ptr); 71 assert(ptr.get() == 0); 72 } 73 assert(A::count == 0); 74 { 75 std::unique_ptr<A> ptr(new A); 76 A* raw_ptr = ptr.get(); 77 throw_next = true; 78 try 79 { 80 std::shared_ptr<B> p(std::move(ptr)); 81 assert(false); 82 } 83 catch (...) 84 { 85 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 86 assert(A::count == 1); 87 assert(B::count == 1); 88 assert(ptr.get() == raw_ptr); 89 #else 90 assert(A::count == 0); 91 assert(B::count == 0); 92 assert(ptr.get() == 0); 93 #endif 94 } 95 } 96 assert(A::count == 0); 97 98 // LWG 2399 99 { 100 throw_next = false; 101 fn(std::unique_ptr<int>(new int)); 102 } 103 } 104
