Commit b74f0db1 by Jonathan Wakely Committed by Jonathan Wakely

Simplify allocator usage in unordered containers

	* include/bits/hashtable_policy.h (_ReuseOrAllocNode): Remove
	__value_alloc_type and __value_alloc_traits typedefs.
	(_ReuseOrAllocNode::operator()): Call construct and destroy on the
	node allocator.
	(_Hashtable_alloc): Simplify __value_alloc_traits typedef.
	(_Hashtable_alloc<_NodeAlloc>::_M_allocate_node(_Args&&...)): Call
	construct on the node allocator.
	(_Hashtable_alloc<_NodeAlloc>::_M_deallocate_node(__node_type*)): Call
	destroy on the node allocator.

From-SVN: r251187
parent f661e57e
2017-08-18 Jonathan Wakely <jwakely@redhat.com> 2017-08-18 Jonathan Wakely <jwakely@redhat.com>
* include/bits/hashtable_policy.h (_ReuseOrAllocNode): Remove
__value_alloc_type and __value_alloc_traits typedefs.
(_ReuseOrAllocNode::operator()): Call construct and destroy on the
node allocator.
(_Hashtable_alloc): Simplify __value_alloc_traits typedef.
(_Hashtable_alloc<_NodeAlloc>::_M_allocate_node(_Args&&...)): Call
construct on the node allocator.
(_Hashtable_alloc<_NodeAlloc>::_M_deallocate_node(__node_type*)): Call
destroy on the node allocator.
PR libstdc++/81891 PR libstdc++/81891
* include/bits/hashtable.h (_Hashtable(_InputIterator, _InputIterator, * include/bits/hashtable.h (_Hashtable(_InputIterator, _InputIterator,
size_type, const _H1&, const _H2&, const _Hash&, const _Equal&, size_type, const _H1&, const _H2&, const _Hash&, const _Equal&,
......
...@@ -111,9 +111,6 @@ namespace __detail ...@@ -111,9 +111,6 @@ namespace __detail
private: private:
using __node_alloc_type = _NodeAlloc; using __node_alloc_type = _NodeAlloc;
using __hashtable_alloc = _Hashtable_alloc<__node_alloc_type>; using __hashtable_alloc = _Hashtable_alloc<__node_alloc_type>;
using __value_alloc_type = typename __hashtable_alloc::__value_alloc_type;
using __value_alloc_traits =
typename __hashtable_alloc::__value_alloc_traits;
using __node_alloc_traits = using __node_alloc_traits =
typename __hashtable_alloc::__node_alloc_traits; typename __hashtable_alloc::__node_alloc_traits;
using __node_type = typename __hashtable_alloc::__node_type; using __node_type = typename __hashtable_alloc::__node_type;
...@@ -135,18 +132,17 @@ namespace __detail ...@@ -135,18 +132,17 @@ namespace __detail
__node_type* __node = _M_nodes; __node_type* __node = _M_nodes;
_M_nodes = _M_nodes->_M_next(); _M_nodes = _M_nodes->_M_next();
__node->_M_nxt = nullptr; __node->_M_nxt = nullptr;
__value_alloc_type __a(_M_h._M_node_allocator()); auto& __a = _M_h._M_node_allocator();
__value_alloc_traits::destroy(__a, __node->_M_valptr()); __node_alloc_traits::destroy(__a, __node->_M_valptr());
__try __try
{ {
__value_alloc_traits::construct(__a, __node->_M_valptr(), __node_alloc_traits::construct(__a, __node->_M_valptr(),
std::forward<_Arg>(__arg)); std::forward<_Arg>(__arg));
} }
__catch(...) __catch(...)
{ {
__node->~__node_type(); __node->~__node_type();
__node_alloc_traits::deallocate(_M_h._M_node_allocator(), __node_alloc_traits::deallocate(__a, __node, 1);
__node, 1);
__throw_exception_again; __throw_exception_again;
} }
return __node; return __node;
...@@ -2000,10 +1996,8 @@ namespace __detail ...@@ -2000,10 +1996,8 @@ namespace __detail
// Use __gnu_cxx to benefit from _S_always_equal and al. // Use __gnu_cxx to benefit from _S_always_equal and al.
using __node_alloc_traits = __gnu_cxx::__alloc_traits<__node_alloc_type>; using __node_alloc_traits = __gnu_cxx::__alloc_traits<__node_alloc_type>;
using __value_type = typename __node_type::value_type; using __value_alloc_traits = typename __node_alloc_traits::template
using __value_alloc_type = rebind_traits<typename __node_type::value_type>;
__alloc_rebind<__node_alloc_type, __value_type>;
using __value_alloc_traits = std::allocator_traits<__value_alloc_type>;
using __node_base = __detail::_Hash_node_base; using __node_base = __detail::_Hash_node_base;
using __bucket_type = __node_base*; using __bucket_type = __node_base*;
...@@ -2057,10 +2051,10 @@ namespace __detail ...@@ -2057,10 +2051,10 @@ namespace __detail
__node_type* __n = std::__addressof(*__nptr); __node_type* __n = std::__addressof(*__nptr);
__try __try
{ {
__value_alloc_type __a(_M_node_allocator());
::new ((void*)__n) __node_type; ::new ((void*)__n) __node_type;
__value_alloc_traits::construct(__a, __n->_M_valptr(), __node_alloc_traits::construct(_M_node_allocator(),
std::forward<_Args>(__args)...); __n->_M_valptr(),
std::forward<_Args>(__args)...);
return __n; return __n;
} }
__catch(...) __catch(...)
...@@ -2076,8 +2070,7 @@ namespace __detail ...@@ -2076,8 +2070,7 @@ namespace __detail
{ {
typedef typename __node_alloc_traits::pointer _Ptr; typedef typename __node_alloc_traits::pointer _Ptr;
auto __ptr = std::pointer_traits<_Ptr>::pointer_to(*__n); auto __ptr = std::pointer_traits<_Ptr>::pointer_to(*__n);
__value_alloc_type __a(_M_node_allocator()); __node_alloc_traits::destroy(_M_node_allocator(), __n->_M_valptr());
__value_alloc_traits::destroy(__a, __n->_M_valptr());
__n->~__node_type(); __n->~__node_type();
__node_alloc_traits::deallocate(_M_node_allocator(), __ptr, 1); __node_alloc_traits::deallocate(_M_node_allocator(), __ptr, 1);
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment