Cross Reference: /vbox/include/iprt/list.h

Lines Matching defs:pList
76  * @param   pList               Pointer to an unitialised list.
78 DECLINLINE(void) RTListInit(PRTLISTNODE pList)
80     pList->pNext = pList;
81     pList->pPrev = pList;
87  * @param   pList               The list to append the node to.
90 DECLINLINE(void) RTListAppend(PRTLISTNODE pList, PRTLISTNODE pNode)
92     pList->pPrev->pNext = pNode;
93     pNode->pPrev        = pList->pPrev;
94     pNode->pNext        = pList;
95     pList->pPrev        = pNode;
101  * @param   pList               The list to prepend the node to.
104 DECLINLINE(void) RTListPrepend(PRTLISTNODE pList, PRTLISTNODE pNode)
106     pList->pNext->pPrev = pNode;
107     pNode->pNext        = pList->pNext;
108     pNode->pPrev        = pList;
109     pList->pNext        = pNode;
158  * @param   pList               The list.
161 #define RTListNodeIsLast(pList, pNode)  ((pNode)->pNext == (pList))
169  * @param   pList               The list.
172 #define RTListNodeIsFirst(pList, pNode) ((pNode)->pPrev == (pList))
175  * Checks if a type converted node is actually the dummy element (@a pList).
180  * @param   pList               The list.
188 #define RTListNodeIsDummy(pList, pNode, Type, Member) \
189          ( (pNode) == RT_FROM_MEMBER((pList), Type, Member) )
191 #define RTListNodeIsDummyCpp(pList, pNode, Type, Member) \
192          ( (pNode) == RT_FROM_CPP_MEMBER((pList), Type, Member) )
200  * @param   pList               The list to check.
202 #define RTListIsEmpty(pList)            ((pList)->pPrev == (pList))
240  * @param   pList               List to get the first element from.
244 #define RTListGetFirst(pList, Type, Member) \
245     (!RTListIsEmpty(pList) ? RTListNodeGetNext(pList, Type, Member) : NULL)
247 #define RTListGetFirstCpp(pList, Type, Member) \
248     (!RTListIsEmpty(pList) ? RTListNodeGetNextCpp(pList, Type, Member) : NULL)
256  * @param   pList               List to get the last element from.
260 #define RTListGetLast(pList, Type, Member) \
261     (!RTListIsEmpty(pList) ? RTListNodeGetPrev(pList, Type, Member) : NULL)
263 #define RTListGetLastCpp(pList, Type, Member) \
264     (!RTListIsEmpty(pList) ? RTListNodeGetPrevCpp(pList, Type, Member) : NULL)
271  * @param   pList               The list @a pCurNode is linked on.
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.
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 )
301  * @param   pList               List to enumerate.
306 #define RTListForEach(pList, pIterator, Type, Member) \
307     for (pIterator = RTListNodeGetNext(pList, Type, Member); \
308          !RTListNodeIsDummy(pList, pIterator, Type, Member); \
311 #define RTListForEachCpp(pList, pIterator, Type, Member) \
312     for (pIterator = RTListNodeGetNextCpp(pList, Type, Member); \
313          !RTListNodeIsDummyCpp(pList, pIterator, Type, Member); \
321  * @param   pList               List to enumerate.
328 #define RTListForEachSafe(pList, pIterator, pIterNext, Type, Member) \
329     for (pIterator = RTListNodeGetNext(pList, Type, Member), \
331          !RTListNodeIsDummy(pList, pIterator, Type, Member); \
335 #define RTListForEachSafeCpp(pList, pIterator, pIterNext, Type, Member) \
336     for (pIterator = RTListNodeGetNextCpp(pList, Type, Member), \
338          !RTListNodeIsDummyCpp(pList, pIterator, Type, Member); \
346  * @param   pList               List to enumerate.
351 #define RTListForEachReverse(pList, pIterator, Type, Member) \
352     for (pIterator = RTListNodeGetPrev(pList, Type, Member); \
353          !RTListNodeIsDummy(pList, pIterator, Type, Member); \
356 #define RTListForEachReverseCpp(pList, pIterator, Type, Member) \
357     for (pIterator = RTListNodeGetPrevCpp(pList, Type, Member); \
358          !RTListNodeIsDummyCpp(pList, pIterator, Type, Member); \
365  * @param   pList               List to enumerate.
372 #define RTListForEachReverseSafe(pList, pIterator, pIterPrev, Type, Member) \
373     for (pIterator = RTListNodeGetPrev(pList, Type, Member), \
375          !RTListNodeIsDummy(pList, pIterator, Type, Member); \
379 #define RTListForEachReverseSafeCpp(pList, pIterator, pIterPrev, Type, Member) \
380     for (pIterator = RTListNodeGetPrevCpp(pList, Type, Member), \
382          !RTListNodeIsDummyCpp(pList, pIterator, Type, Member); \