forked from boostorg/smart_ptr
Reduce the amount of code in allocate_array_helper, make_array_helper, and array_deleter using the empty base class optimization technique.
150 lines
6.0 KiB
C++
150 lines
6.0 KiB
C++
/*
|
|
* Copyright (c) 2012-2014 Glen Joseph Fernandes
|
|
* glenfe at live dot com
|
|
*
|
|
* Distributed under the Boost Software License,
|
|
* Version 1.0. (See accompanying file LICENSE_1_0.txt
|
|
* or copy at http://boost.org/LICENSE_1_0.txt)
|
|
*/
|
|
#ifndef BOOST_SMART_PTR_ALLOCATE_SHARED_ARRAY_HPP
|
|
#define BOOST_SMART_PTR_ALLOCATE_SHARED_ARRAY_HPP
|
|
|
|
#include <boost/smart_ptr/detail/allocate_array_helper.hpp>
|
|
#include <boost/smart_ptr/detail/array_deleter.hpp>
|
|
#include <boost/smart_ptr/detail/sp_if_array.hpp>
|
|
#include <boost/type_traits/remove_cv.hpp>
|
|
|
|
namespace boost {
|
|
template<typename T, typename A>
|
|
inline typename boost::detail::sp_if_array<T>::type
|
|
allocate_shared(const A& allocator, std::size_t size) {
|
|
typedef typename boost::detail::array_inner<T>::type T1;
|
|
typedef typename boost::detail::array_base<T1>::type T2;
|
|
typedef typename boost::remove_cv<T2>::type T3;
|
|
T1* p1 = 0;
|
|
T3* p2 = 0;
|
|
std::size_t n1 = size * boost::detail::array_total<T1>::size;
|
|
boost::detail::allocate_array_helper<A, T3[]> a1(allocator, n1, &p2);
|
|
boost::detail::array_deleter<T3[]> d1(n1);
|
|
boost::shared_ptr<T> s1(p1, d1, a1);
|
|
typedef boost::detail::array_deleter<T3[]>* D2;
|
|
p1 = reinterpret_cast<T1*>(p2);
|
|
D2 d2 = static_cast<D2>(s1._internal_get_untyped_deleter());
|
|
d2->init(p2);
|
|
return boost::shared_ptr<T>(s1, p1);
|
|
}
|
|
|
|
template<typename T, typename A>
|
|
inline typename boost::detail::sp_if_size_array<T>::type
|
|
allocate_shared(const A& allocator) {
|
|
typedef typename boost::detail::array_inner<T>::type T1;
|
|
typedef typename boost::detail::array_base<T1>::type T2;
|
|
typedef typename boost::remove_cv<T2>::type T3;
|
|
enum {
|
|
N = boost::detail::array_total<T>::size
|
|
};
|
|
T1* p1 = 0;
|
|
T3* p2 = 0;
|
|
boost::detail::allocate_array_helper<A, T3[N]> a1(allocator, &p2);
|
|
boost::detail::array_deleter<T3[N]> d1;
|
|
boost::shared_ptr<T> s1(p1, d1, a1);
|
|
typedef boost::detail::array_deleter<T3[N]>* D2;
|
|
p1 = reinterpret_cast<T1*>(p2);
|
|
D2 d2 = static_cast<D2>(s1._internal_get_untyped_deleter());
|
|
d2->init(p2);
|
|
return boost::shared_ptr<T>(s1, p1);
|
|
}
|
|
|
|
template<typename T, typename A>
|
|
inline typename boost::detail::sp_if_array<T>::type
|
|
allocate_shared(const A& allocator, std::size_t size,
|
|
const typename boost::detail::array_inner<T>::type& value) {
|
|
typedef typename boost::detail::array_inner<T>::type T1;
|
|
typedef typename boost::detail::array_base<T1>::type T2;
|
|
typedef typename boost::remove_cv<T2>::type T3;
|
|
typedef const T2 T4;
|
|
enum {
|
|
M = boost::detail::array_total<T1>::size
|
|
};
|
|
T1* p1 = 0;
|
|
T3* p2 = 0;
|
|
T4* p3 = reinterpret_cast<T4*>(&value);
|
|
std::size_t n1 = M * size;
|
|
boost::detail::allocate_array_helper<A, T3[]> a1(allocator, n1, &p2);
|
|
boost::detail::array_deleter<T3[]> d1(n1);
|
|
boost::shared_ptr<T> s1(p1, d1, a1);
|
|
typedef boost::detail::array_deleter<T3[]>* D2;
|
|
p1 = reinterpret_cast<T1*>(p2);
|
|
D2 d2 = static_cast<D2>(s1._internal_get_untyped_deleter());
|
|
d2->template init<M>(p2, p3);
|
|
return boost::shared_ptr<T>(s1, p1);
|
|
}
|
|
|
|
template<typename T, typename A>
|
|
inline typename boost::detail::sp_if_size_array<T>::type
|
|
allocate_shared(const A& allocator,
|
|
const typename boost::detail::array_inner<T>::type& value) {
|
|
typedef typename boost::detail::array_inner<T>::type T1;
|
|
typedef typename boost::detail::array_base<T1>::type T2;
|
|
typedef typename boost::remove_cv<T2>::type T3;
|
|
typedef const T2 T4;
|
|
enum {
|
|
M = boost::detail::array_total<T1>::size,
|
|
N = boost::detail::array_total<T>::size
|
|
};
|
|
T1* p1 = 0;
|
|
T3* p2 = 0;
|
|
T4* p3 = reinterpret_cast<T4*>(&value);
|
|
boost::detail::allocate_array_helper<A, T3[N]> a1(allocator, &p2);
|
|
boost::detail::array_deleter<T3[N]> d1;
|
|
boost::shared_ptr<T> s1(p1, d1, a1);
|
|
typedef boost::detail::array_deleter<T3[N]>* D2;
|
|
p1 = reinterpret_cast<T1*>(p2);
|
|
D2 d2 = static_cast<D2>(s1._internal_get_untyped_deleter());
|
|
d2->template init<M>(p2, p3);
|
|
return boost::shared_ptr<T>(s1, p1);
|
|
}
|
|
|
|
template<typename T, typename A>
|
|
inline typename boost::detail::sp_if_array<T>::type
|
|
allocate_shared_noinit(const A& allocator, std::size_t size) {
|
|
typedef typename boost::detail::array_inner<T>::type T1;
|
|
typedef typename boost::detail::array_base<T1>::type T2;
|
|
typedef typename boost::remove_cv<T2>::type T3;
|
|
T1* p1 = 0;
|
|
T3* p2 = 0;
|
|
std::size_t n1 = size * boost::detail::array_total<T1>::size;
|
|
boost::detail::allocate_array_helper<A, T3[]> a1(allocator, n1, &p2);
|
|
boost::detail::array_deleter<T3[]> d1(n1);
|
|
boost::shared_ptr<T> s1(p1, d1, a1);
|
|
typedef boost::detail::array_deleter<T3[]>* D2;
|
|
p1 = reinterpret_cast<T1*>(p2);
|
|
D2 d2 = static_cast<D2>(s1._internal_get_untyped_deleter());
|
|
d2->noinit(p2);
|
|
return boost::shared_ptr<T>(s1, p1);
|
|
}
|
|
|
|
template<typename T, typename A>
|
|
inline typename boost::detail::sp_if_size_array<T>::type
|
|
allocate_shared_noinit(const A& allocator) {
|
|
typedef typename boost::detail::array_inner<T>::type T1;
|
|
typedef typename boost::detail::array_base<T1>::type T2;
|
|
typedef typename boost::remove_cv<T2>::type T3;
|
|
enum {
|
|
N = boost::detail::array_total<T>::size
|
|
};
|
|
T1* p1 = 0;
|
|
T3* p2 = 0;
|
|
boost::detail::allocate_array_helper<A, T3[N]> a1(allocator, &p2);
|
|
boost::detail::array_deleter<T3[N]> d1;
|
|
boost::shared_ptr<T> s1(p1, d1, a1);
|
|
typedef boost::detail::array_deleter<T3[N]>* D2;
|
|
p1 = reinterpret_cast<T1*>(p2);
|
|
D2 d2 = static_cast<D2>(s1._internal_get_untyped_deleter());
|
|
d2->noinit(p2);
|
|
return boost::shared_ptr<T>(s1, p1);
|
|
}
|
|
}
|
|
|
|
#endif
|