102     void PushBack(T* p);
109     void PushFront(T* p);
150     T* GetNext(T* p) const;
159     T* GetPrevious(T* p) const;
176     void Erase(T* p);
194     static void ClearLinks(Item* p);
201     static void InsertBefore(Item* p, Item* q);
228 inline void IntrusiveLinkedList<T, Tag>::ClearLinks(Item* p)  in ClearLinks()  argument
230     p->m_PreviousLink = p->m_NextLink = 0;  in ClearLinks()
234 inline void IntrusiveLinkedList<T, Tag>::InsertBefore(Item* p, Item* q)  in InsertBefore()  argument
236     q->m_NextLink = p;  in InsertBefore()
237     p->m_PreviousLink->m_NextLink = q;  in InsertBefore()
238     q->m_PreviousLink = p->m_PreviousLink;  in InsertBefore()
239     p->m_PreviousLink = q;  in InsertBefore()
243 inline void IntrusiveLinkedList<T, Tag>::PushBack(T* p)  in PushBack()  argument
245     NN_ASSERT_WITH_RESULT(p, MakeResultInvalidAddress());  in PushBack()
246     NN_TASSERT_(p);  in PushBack()
247     Item* pNode = static_cast<Item*>(p);  in PushBack()
253         p->m_PreviousLink = p->m_NextLink = p;  in PushBack()
254         this->m_Head = p;  in PushBack()
263 inline void IntrusiveLinkedList<T, Tag>::PushFront(T* p)  in PushFront()  argument
265     NN_ASSERT_WITH_RESULT(p, MakeResultInvalidAddress());  in PushFront()
266     NN_TASSERT_(p);  in PushFront()
267     Item* pNode = static_cast<Item*>(p);  in PushFront()
273         p->m_PreviousLink = p->m_NextLink = p;  in PushFront()
279     this->m_Head = p;  in PushFront()
330 inline T* IntrusiveLinkedList<T, Tag>::GetPrevious(T* p) const  in GetPrevious()  argument
332     NN_ASSERT_WITH_RESULT(p, MakeResultInvalidAddress());  in GetPrevious()
333     NN_TASSERT_(p);  in GetPrevious()
334     Item* pNode = static_cast<Item*>(p);  in GetPrevious()
338     if (p == this->GetFront())  in GetPrevious()
346 inline T* IntrusiveLinkedList<T, Tag>::GetNext(T* p) const  in GetNext()  argument
348     NN_ASSERT_WITH_RESULT(p, MakeResultInvalidAddress());  in GetNext()
349     NN_TASSERT_(p);  in GetNext()
350     Item* pNode = static_cast<Item*>(p);  in GetNext()
354     if (p == this->GetBack())  in GetNext()
389 inline void IntrusiveLinkedList<T, Tag>::Erase(T* p)  in Erase()  argument
391     NN_ASSERT_WITH_RESULT(p, MakeResultInvalidAddress());  in Erase()
392     NN_TASSERT_(p);  in Erase()
393     Item* pNode = static_cast<Item*>(p);  in Erase()
418         Item* p = m_Head;  in Clear()  local
419         while (p)  in Clear()
421             Item* q = p;  in Clear()
422             p = p->m_NextLink;  in Clear()