38     static intrusive_list_node& node ( T& item ) { return List::node(item); }  in node()  function
40     static T& item ( intrusive_list_node* node ) { return List::item(node); }  in item()  argument
42     static const T& item( const intrusive_list_node* node ) { return List::item(node); }  in item()  argument
134         __TBB_ASSERT( node(val).my_prev_node == &node(val) && node(val).my_next_node == &node(val),  in push_front()
137         node(val).my_prev_node = &my_head;  in push_front()
138         node(val).my_next_node = my_head.my_next_node;  in push_front()
139         my_head.my_next_node->my_prev_node = &node(val);  in push_front()
140         my_head.my_next_node = &node(val);  in push_front()
146 …__TBB_ASSERT( node(val).my_prev_node != &node(val) && node(val).my_next_node != &node(val), "Eleme…  in remove()
147 …__TBB_ASSERT( node(val).my_prev_node->my_next_node == &node(val) && node(val).my_next_node->my_pre…  in remove()
149         node(val).my_next_node->my_prev_node = node(val).my_prev_node;  in remove()
150         node(val).my_prev_node->my_next_node = node(val).my_next_node;  in remove()
152         node(val).my_prev_node = node(val).my_next_node = &node(val);  in remove()
196     static intrusive_list_node& node ( T& val ) { return val.*NodePtr; }  in node()  function
198     static T& item ( intrusive_list_node* node ) {  in item()  argument
203 …return *reinterpret_cast<T*>((char*)node - ((ptrdiff_t)&(reinterpret_cast<T*>(0x1000)->*NodePtr) -…  in item()
206     static const T& item( const intrusive_list_node* node ) {  in item()  argument
207         return item(const_cast<intrusive_list_node*>(node));  in item()
222     static intrusive_list_node& node ( T& val ) { return val; }  in node()  function
224     static T& item ( intrusive_list_node* node ) { return *static_cast<T*>(node); }  in item()  argument
226     static const T& item( const intrusive_list_node* node ) { return *static_cast<const T*>(node); }  in item()  argument