Lines Matching refs:pCurNode

115  * @param   pCurNode            The current node.
118 DECLINLINE(void) RTListNodeInsertAfter(PRTLISTNODE pCurNode, PRTLISTNODE pNewNode)
120 RTListPrepend(pCurNode, pNewNode);
126 * @param pCurNode The current node.
129 DECLINLINE(void) RTListNodeInsertBefore(PRTLISTNODE pCurNode, PRTLISTNODE pNewNode)
131 RTListAppend(pCurNode, pNewNode);
209 * @param pCurNode The current node.
213 #define RTListNodeGetNext(pCurNode, Type, Member) \
214 RT_FROM_MEMBER((pCurNode)->pNext, Type, Member)
216 #define RTListNodeGetNextCpp(pCurNode, Type, Member) \
217 RT_FROM_CPP_MEMBER((pCurNode)->pNext, Type, Member)
224 * @param pCurNode The current node.
228 #define RTListNodeGetPrev(pCurNode, Type, Member) \
229 RT_FROM_MEMBER((pCurNode)->pPrev, Type, Member)
231 #define RTListNodeGetPrevCpp(pCurNode, Type, Member) \
232 RT_FROM_CPP_MEMBER((pCurNode)->pPrev, Type, Member)
271 * @param pList The list @a pCurNode is linked on.
272 * @param pCurNode The current node, of type @a Type.
276 #define RTListGetNext(pList, pCurNode, Type, Member) \
277 ( (pCurNode)->Member.pNext != (pList) ? RT_FROM_MEMBER((pCurNode)->Member.pNext, Type, Member) : NULL )
279 #define RTListGetNextCpp(pList, pCurNode, Type, Member) \
280 ( (pCurNode)->Member.pNext != (pList) ? RT_FROM_CPP_MEMBER((pCurNode)->Member.pNext, Type, Member) : NULL )
287 * @param pList The list @a pCurNode is linked on.
288 * @param pCurNode The current node, of type @a Type.
292 #define RTListGetPrev(pList, pCurNode, Type, Member) \
293 ( (pCurNode)->Member.pPrev != (pList) ? RT_FROM_MEMBER((pCurNode)->Member.pPrev, Type, Member) : NULL )
295 #define RTListGetPrevCpp(pList, pCurNode, Type, Member) \
296 ( (pCurNode)->Member.pPrev != (pList) ? RT_FROM_CPP_MEMBER((pCurNode)->Member.pPrev, Type, Member) : NULL )