Searched refs:intrusive_list_node (Results 1 – 7 of 7) sorted by relevance
26 using d1::intrusive_list_node;33 intrusive_list_node my_head;38 static intrusive_list_node& node ( T& item ) { return List::node(item); } in node()40 static T& item ( intrusive_list_node* node ) { return List::item(node); } in item()171 struct dummy_intrusive_list_item { intrusive_list_node my_node; };191 template <class T, class U, intrusive_list_node U::*NodePtr>196 static intrusive_list_node& node ( T& val ) { return val.*NodePtr; } in node()198 static T& item ( intrusive_list_node* node ) { in item()206 static const T& item( const intrusive_list_node* node ) { in item()207 return item(const_cast<intrusive_list_node*>(node)); in item()[all …]
45 class context_list : public intrusive_list<d1::intrusive_list_node> {66 void remove(d1::intrusive_list_node& val) { in remove()69 intrusive_list<d1::intrusive_list_node>::remove(val); in remove()77 void push_front(d1::intrusive_list_node& val) { in push_front()80 intrusive_list<d1::intrusive_list_node>::push_front(val); in push_front()98 , public d1::intrusive_list_node
27 class thread_dispatcher_client : public d1::intrusive_list_node /* Need for list in thread pool */ {
186 struct arena_base : padded<intrusive_list_node> {
29 struct intrusive_list_node { struct30 intrusive_list_node* my_prev_node{};31 intrusive_list_node* my_next_node{};33 intrusive_list_node() { my_prev_node = my_next_node = this; } in intrusive_list_node() argument
24 using tbb::detail::r1::intrusive_list_node;34 struct DataItemWithInheritedNodeBase : intrusive_list_node {52 intrusive_list_node m_BaseNode;60 intrusive_list_node m_Node;
235 intrusive_list_node my_node;236 …static_assert(sizeof(intrusive_list_node) == sizeof(context_list_node), "To preserve backward comp…258 - sizeof(intrusive_list_node) // my_node