Lines Matching full:pprev
72 * InsertNode(): Insert new node between pPrev and pNext
74 static INLINE void InsertNode( TQueNodeHdr *pNode, TQueNodeHdr *pPrev, TQueNodeHdr *pNext)
76 pNext->pPrev = pNode;
78 pNode->pPrev = pPrev;
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;
104 InsertNode( pNode, pListHead->pPrev, pListHead );
112 RemoveNode (pNode->pPrev, pNode->pNext);
153 pQue->tHead.pNext = pQue->tHead.pPrev = &pQue->tHead;
302 hItem = (TI_HANDLE)((TI_UINT8*)pQue->tHead.pPrev - pQue->uNodeHeaderOffset);
304 DelFromTail (pQue->tHead.pPrev); /* remove node from the queue */
422 pQue->uNodeHeaderOffset, pQue->tHead.pNext, pQue->tHead.pPrev));
