Lines Matching full:pnext
72 * InsertNode(): Insert new node between pPrev and pNext
74 static INLINE void InsertNode( TQueNodeHdr *pNode, TQueNodeHdr *pPrev, TQueNodeHdr *pNext)
76 pNext->pPrev = pNode;
77 pNode->pNext = pNext;
79 pPrev->pNext = pNode;
83 * RemoveNode(): Remove node from between pPrev and pNext
85 static INLINE void RemoveNode( TQueNodeHdr *pPrev, TQueNodeHdr *pNext)
87 pNext->pPrev = pPrev;
88 pPrev->pNext = pNext;
96 InsertNode (pNode, pListHead, pListHead->pNext);
112 RemoveNode (pNode->pPrev, pNode->pNext);
153 pQue->tHead.pNext = pQue->tHead.pPrev = &pQue->tHead;
241 /* Check that (pNext == NULL) --> Sanity check that this item was dequeued before */
242 if (pQueNodeHdr->pNext)
303 /* Clear the pNext so we can do a sanity check when enqueuing this structre in the future */
304 ((TQueNodeHdr *)((TI_UINT8*)hItem + pQue->uNodeHeaderOffset))->pNext = NULL;
409 pQue->uNodeHeaderOffset, pQue->tHead.pNext, pQue->tHead.pPrev));
