////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/interprocess for documentation. // ////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_INTERPROCESS_SEGMENT_MANAGER_BASE_HPP #define BOOST_INTERPROCESS_SEGMENT_MANAGER_BASE_HPP #ifndef BOOST_CONFIG_HPP # include #endif # #if defined(BOOST_HAS_PRAGMA_ONCE) # pragma once #endif #include #include // interprocess #include // interprocess/detail #include #include // container/detail #include //alignment_of #include #include // intrusive #include // move/detail #include //make_unsigned #include // other boost #include //BOOST_ASSERT // std #include //std::size_t namespace boost{ namespace interprocess{ template class segment_manager_base; //!An integer that describes the type of the //!instance constructed in memory enum instance_type { anonymous_type, named_type, unique_type, max_allocation_type }; namespace ipcdetail{ template class mem_algo_deallocator { void * m_ptr; MemoryAlgorithm & m_algo; public: mem_algo_deallocator(void *ptr, MemoryAlgorithm &algo) : m_ptr(ptr), m_algo(algo) {} void release() { m_ptr = 0; } ~mem_algo_deallocator() { if(m_ptr) m_algo.deallocate(m_ptr); } }; #if !defined(BOOST_INTERPROCESS_SEGMENT_MANAGER_ABI) #define BOOST_INTERPROCESS_SEGMENT_MANAGER_ABI 2 #endif //#if !defined(BOOST_INTERPROCESS_SEGMENT_MANAGER_ABI) #if (BOOST_INTERPROCESS_SEGMENT_MANAGER_ABI == 1) template struct block_header { private: const size_type m_value_bytes; const unsigned short m_num_char; const unsigned char m_value_alignment; const unsigned char m_alloc_type_sizeof_char; public: typedef std::size_t name_len_t; block_header(size_type val_bytes ,size_type val_alignment ,unsigned char al_type ,std::size_t szof_char ,std::size_t num_char ) : m_value_bytes(val_bytes) , m_num_char((unsigned short)num_char) , m_value_alignment((unsigned char)val_alignment) , m_alloc_type_sizeof_char( (unsigned char)((al_type << 5u) | ((unsigned char)szof_char & 0x1F)) ) {}; template size_type total_anonymous_size() const { return this->value_offset() + m_value_bytes; } template size_type total_named_size(std::size_t namelen) const { (void)namelen; BOOST_ASSERT(namelen == m_num_char); return name_offset() + (m_num_char+1u)*sizeof_char(); } template size_type total_named_size_with_header(std::size_t namelen) const { BOOST_ASSERT(namelen == m_num_char); return get_rounded_size ( size_type(sizeof(Header)) , size_type(::boost::container::dtl::alignment_of >::value)) + this->template total_named_size<0, char>(namelen); } size_type value_bytes() const { return m_value_bytes; } unsigned char alloc_type() const { return (m_alloc_type_sizeof_char >> 5u)&(unsigned char)0x7; } unsigned char sizeof_char() const { return m_alloc_type_sizeof_char & (unsigned char)0x1F; } template CharType *name() const { return const_cast(move_detail::force_ptr (reinterpret_cast(this) + name_offset())); } unsigned short name_length() const { return m_num_char; } void *value() const { return const_cast((reinterpret_cast(this) + this->value_offset())); } template static block_header *block_header_from_value(T *value) { // BOOST_ASSERT(is_ptr_aligned(value, algn)); const std::size_t algn = ::boost::container::dtl::alignment_of::value; block_header* hdr = const_cast (move_detail::force_ptr(reinterpret_cast(value) - get_rounded_size(sizeof(block_header), algn))); //Some sanity checks BOOST_ASSERT(hdr->m_value_alignment == algn); BOOST_ASSERT(hdr->m_value_bytes % sizeof(T) == 0); return hdr; } template static block_header *from_first_header(Header *header) { block_header * hdr = move_detail::force_ptr(reinterpret_cast(header) + get_rounded_size( size_type(sizeof(Header)) , size_type(::boost::container::dtl::alignment_of::value))); //Some sanity checks return hdr; } template static const block_header *from_first_header(const Header *header) { return from_first_header(const_cast(header)); } template static Header *to_first_header(block_header *bheader) { Header * hdr = move_detail::force_ptr(reinterpret_cast(bheader) - get_rounded_size( size_type(sizeof(Header)) , size_type(::boost::container::dtl::alignment_of::value))); //Some sanity checks return hdr; } template static size_type front_space_without_header() { return 0u; } template static size_type front_space_with_header() { return 0u; } void store_name_length(std::size_t) {} private: size_type value_offset() const { return get_rounded_size(size_type(sizeof(block_header)), size_type(m_value_alignment)); } size_type name_offset() const { return this->value_offset() + get_rounded_size(size_type(m_value_bytes), size_type(sizeof_char())); } }; #elif (BOOST_INTERPROCESS_SEGMENT_MANAGER_ABI == 2) template struct sm_between_headers { BOOST_STATIC_CONSTEXPR std::size_t value = sizeof(Header) + ct_rounded_size< sizeof(BlockHeader), boost::move_detail::alignment_of
::value>::value - sizeof(BlockHeader); }; template struct sg_offsets_with_header { private: BOOST_STATIC_CONSTEXPR std::size_t between_headers = sm_between_headers::value; BOOST_STATIC_CONSTEXPR std::size_t both_headers = between_headers + sizeof(BlockHeader); BOOST_STATIC_CONSTEXPR std::size_t total_prefix = ct_rounded_size::value; public: BOOST_STATIC_CONSTEXPR std::size_t block_header_prefix = total_prefix - sizeof(BlockHeader); BOOST_STATIC_CONSTEXPR std::size_t front_space = total_prefix - both_headers; BOOST_INTERPROCESS_STATIC_ASSERT((total_prefix % TypeAlignment) == 0); BOOST_INTERPROCESS_STATIC_ASSERT((front_space % boost::move_detail::alignment_of
::value) == 0); BOOST_INTERPROCESS_STATIC_ASSERT((block_header_prefix % boost::move_detail::alignment_of::value) == 0); BOOST_INTERPROCESS_STATIC_ASSERT(total_prefix == (sizeof(BlockHeader) + sizeof(Header) + front_space + (between_headers - sizeof(Header)))); }; template struct sg_offsets_without_header { BOOST_STATIC_CONSTEXPR std::size_t total_prefix = ct_rounded_size::value; public: BOOST_STATIC_CONSTEXPR std::size_t block_header_prefix = total_prefix - sizeof(BlockHeader); BOOST_STATIC_CONSTEXPR std::size_t front_space = block_header_prefix; }; template struct block_header { private: const size_type m_alloc_type : 2; const size_type m_value_bytes : sizeof(size_type)*CHAR_BIT - 2u; public: typedef unsigned short name_len_t; block_header(size_type val_bytes ,size_type ,unsigned char al_type ,std::size_t ,std::size_t ) : m_alloc_type(al_type & 3u) , m_value_bytes(val_bytes & (~size_type(0) >> 2u)) {}; template size_type total_anonymous_size() const { BOOST_CONSTEXPR_OR_CONST std::size_t block_header_prefix = sg_offsets_without_header::block_header_prefix; return block_header_prefix + this->value_offset() + m_value_bytes; } template size_type total_named_size(std::size_t namelen) const { BOOST_CONSTEXPR_OR_CONST std::size_t block_header_prefix = sg_offsets_without_header::block_header_prefix; return block_header_prefix + name_offset< ::boost::move_detail::alignment_of::value>() + (namelen + 1u) * sizeof(CharType); } template size_type total_named_size_with_header(std::size_t namelen) const { typedef sg_offsets_with_header offsets_t; return offsets_t::block_header_prefix + name_offset< ::boost::move_detail::alignment_of::value>() + (namelen + 1u) * sizeof(CharType); } size_type value_bytes() const { return m_value_bytes; } unsigned char alloc_type() const { return m_alloc_type; } template CharType *name() const { return const_cast(move_detail::force_ptr (reinterpret_cast(this) + this->template name_offset< ::boost::move_detail::alignment_of::value>())); } name_len_t name_length() const { if(m_alloc_type == anonymous_type) return 0; return *(move_detail::force_ptr (reinterpret_cast(this) + this->name_length_offset())); } void *value() const { return const_cast((reinterpret_cast(this) + this->value_offset())); } template static block_header *block_header_from_value(T *value) { BOOST_ASSERT(is_ptr_aligned(value, ::boost::container::dtl::alignment_of::value)); block_header* hdr = const_cast (move_detail::force_ptr (reinterpret_cast(value) - value_offset())); //Some sanity checks BOOST_ASSERT(hdr->m_value_bytes % sizeof(T) == 0); return hdr; } template static block_header *from_first_header(Header *header) { BOOST_ASSERT(is_ptr_aligned(header)); block_header * const hdr = move_detail::force_ptr( reinterpret_cast(header) + sm_between_headers::value); //Some sanity checks BOOST_ASSERT(is_ptr_aligned(hdr)); return hdr; } template static const block_header *from_first_header(const Header *header) { return from_first_header(const_cast(header)); } template static Header *to_first_header(block_header *bheader) { BOOST_ASSERT(is_ptr_aligned(bheader)); Header * hdr = move_detail::force_ptr( reinterpret_cast(bheader) - sm_between_headers::value); //Some sanity checks BOOST_ASSERT(is_ptr_aligned(hdr)); return hdr; } template static size_type front_space_with_header() { return sg_offsets_with_header::front_space; } template static size_type front_space_without_header() { return sg_offsets_without_header::front_space; } void store_name_length(name_len_t namelen) { ::new( reinterpret_cast(this) + this->name_length_offset() , boost_container_new_t() ) name_len_t(namelen); } private: static size_type value_offset() { return size_type(sizeof(block_header)); } template size_type name_offset() const { return get_rounded_size( size_type(this->name_length_offset()+sizeof(name_len_t)) , size_type(CharAlign)); } size_type name_length_offset() const { return this->value_offset() + get_rounded_size( size_type(m_value_bytes) , size_type(::boost::move_detail::alignment_of::value)); } }; #else //(BOOST_INTERPROCESS_SEGMENT_MANAGER_ABI == ) #error "Incorrect BOOST_INTERPROCESS_SEGMENT_MANAGER_ABI value!" #endif template struct intrusive_compare_key { typedef CharT char_type; intrusive_compare_key(const CharT* str_, std::size_t len_) : mp_str(str_), m_len(len_) {} const CharT* str() const { return mp_str; } std::size_t len() const { return m_len; } const CharT* mp_str; std::size_t m_len; }; //!This struct indicates an anonymous object creation //!allocation template class instance_t { instance_t(){} }; template struct char_if_void { typedef T type; }; template<> struct char_if_void { typedef char type; }; typedef instance_t anonymous_instance_t; typedef instance_t unique_instance_t; template struct intrusive_value_type_impl : public Hook { private: //Non-copyable intrusive_value_type_impl(const intrusive_value_type_impl &); intrusive_value_type_impl& operator=(const intrusive_value_type_impl &); public: typedef CharType char_type; typedef SizeType size_type; typedef block_header block_header_t; intrusive_value_type_impl(){} CharType *name() const { return get_block_header()->template name(); } unsigned short name_length() const { return get_block_header()->name_length(); } void *value() const { return get_block_header()->value(); } private: const block_header_t *get_block_header() const { return block_header_t::from_first_header(this); } }; template class char_ptr_holder { public: char_ptr_holder(const CharType *name) : m_name(name) {} char_ptr_holder(const anonymous_instance_t *) : m_name(static_cast(0)) {} char_ptr_holder(const unique_instance_t *) : m_name(reinterpret_cast(-1)) {} operator const CharType *() { return m_name; } const CharType *get() const { return m_name; } bool is_unique() const { return m_name == reinterpret_cast(-1); } bool is_anonymous() const { return m_name == static_cast(0); } private: const CharType *m_name; }; //!The key of the the named allocation information index. Stores an offset pointer //!to a null terminated string and the length of the string to speed up sorting template struct index_key { typedef typename boost::intrusive:: pointer_traits::template rebind_pointer::type const_char_ptr_t; typedef CharT char_type; typedef typename boost::intrusive::pointer_traits::difference_type difference_type; typedef typename boost::move_detail::make_unsigned::type size_type; private: //Offset pointer to the object's name const_char_ptr_t mp_str; //Length of the name buffer (null NOT included) size_type m_len; public: //!Constructor of the key index_key (const char_type *nm, size_type length) : mp_str(nm), m_len(length) {} //!Less than function for index ordering bool operator < (const index_key & right) const { return (m_len < right.m_len) || (m_len == right.m_len && std::char_traits::compare (to_raw_pointer(mp_str),to_raw_pointer(right.mp_str), m_len) < 0); } //!Equal to function for index ordering bool operator == (const index_key & right) const { return m_len == right.m_len && std::char_traits::compare (to_raw_pointer(mp_str), to_raw_pointer(right.mp_str), m_len) == 0; } void name(const CharT *nm) { mp_str = nm; } void name_length(size_type len) { m_len = len; } const CharT *name() const { return to_raw_pointer(mp_str); } size_type name_length() const { return m_len; } }; //!The index_data stores a pointer to a buffer and the element count needed //!to know how many destructors must be called when calling destroy template struct index_data { typedef VoidPointer void_pointer; void_pointer m_ptr; explicit index_data(void *ptr) : m_ptr(ptr){} void *value() const { return static_cast(to_raw_pointer(m_ptr)); } }; template struct segment_manager_base_type { typedef segment_manager_base type; }; template struct index_config { typedef typename MemoryAlgorithm::void_pointer void_pointer; typedef CharT char_type; typedef index_key key_type; typedef index_data mapped_type; typedef typename segment_manager_base_type ::type segment_manager_base; template struct intrusive_value_type { typedef intrusive_value_type_impl < HeaderBase , CharT , typename segment_manager_base::size_type > type; }; typedef intrusive_compare_key compare_key_type; }; template class segment_manager_iterator_value_adaptor { typedef typename Iterator::value_type iterator_val_t; typedef typename iterator_val_t::char_type char_type; public: segment_manager_iterator_value_adaptor(const typename Iterator::value_type &val) : m_val(&val) {} const char_type *name() const { return m_val->name(); } unsigned short name_length() const { return m_val->name_length(); } const void *value() const { return m_val->value(); } const typename Iterator::value_type *m_val; }; template class segment_manager_iterator_value_adaptor { typedef typename Iterator::value_type iterator_val_t; typedef typename iterator_val_t::first_type first_type; typedef typename iterator_val_t::second_type second_type; typedef typename first_type::char_type char_type; typedef typename first_type::size_type size_type; public: segment_manager_iterator_value_adaptor(const typename Iterator::value_type &val) : m_val(&val) {} const char_type *name() const { return m_val->first.name(); } size_type name_length() const { return m_val->first.name_length(); } const void *value() const { return move_detail::force_ptr*> (to_raw_pointer(m_val->second.m_ptr))->value(); } const typename Iterator::value_type *m_val; }; template struct segment_manager_iterator_transform { typedef segment_manager_iterator_value_adaptor result_type; template result_type operator()(const T &arg) const { return result_type(arg); } }; template inline T* null_or_bad_alloc(bool dothrow) { if (dothrow) throw bad_alloc(); return 0; } template inline T* null_or_already_exists(bool dothrow) { if (dothrow) throw interprocess_exception(already_exists_error); return 0; } } //namespace ipcdetail { //These pointers are the ones the user will use to //indicate previous allocation types static const ipcdetail::anonymous_instance_t * anonymous_instance = 0; static const ipcdetail::unique_instance_t * unique_instance = 0; namespace ipcdetail_really_deep_namespace { //Otherwise, gcc issues a warning of previously defined //anonymous_instance and unique_instance struct dummy { dummy() { (void)anonymous_instance; (void)unique_instance; } }; } //detail_really_deep_namespace }} //namespace boost { namespace interprocess #include #endif //#ifndef BOOST_INTERPROCESS_SEGMENT_MANAGER_BASE_HPP