Searched refs:pNode (Results 1 – 5 of 5) sorted by relevance
246 Item* pNode = static_cast<Item*>(p); in PushBack() local247 NN_ASSERT_WITH_RESULT(!pNode->m_PreviousLink, MakeResultAlreadyListed()); in PushBack()248 NN_TASSERT_(!pNode->m_PreviousLink); in PushBack()249 NN_TASSERT_(!pNode->m_NextLink); in PushBack()257 InsertBefore(m_Head, pNode); in PushBack()266 Item* pNode = static_cast<Item*>(p); in PushFront() local267 NN_ASSERT_WITH_RESULT(!pNode->m_PreviousLink, MakeResultAlreadyListed()); in PushFront()268 NN_TASSERT_(!pNode->m_PreviousLink); in PushFront()269 NN_TASSERT_(!pNode->m_NextLink); in PushFront()276 InsertBefore(m_Head, pNode); in PushFront()[all …]
100 Item* pNode = static_cast<Item*>(p); in Enqueue() local101 NN_TASSERT_(!pNode->m_NextLink); in Enqueue()104 this->m_Head = this->m_Tail = pNode; in Enqueue()105 pNode->m_NextLink = pNode; in Enqueue()
115 for(Node* pNode = m_Children.PopFront(); in ~Node() local116 pNode; in ~Node()117 pNode = m_Children.PopFront()) in ~Node()119 delete pNode; in ~Node()205 for(Node* pNode = m_Children.GetFront(); in Print() local206 pNode; in Print()207 pNode = m_Children.GetNext(pNode)) in Print()209 pNode->Print(depth + 1); in Print()228 for(Node* pNode = m_Children.GetFront(); in GetSpecificChildrenNum() local229 pNode; in GetSpecificChildrenNum()[all …]
82 Node* pNode = this->m_FreeNode; in Dump() local86 pNode, pNode->next, pNode->next - pNode); in Dump()87 pNode = pNode->next; in Dump()
115 void EnqueueImpl(NodeType* pNode);126 void EnqueueImpl(NodeType* pNode) { return LockFreeQueueImplBase::EnqueueImpl(pNode); } in EnqueueImpl() argument