Lines Matching refs:pstNext
39 struct UTILS_DL_LIST *pstNext; /* < Current node's pointer to the next node */
61 list->pstNext = list;
85 #define UTILS_DL_LIST_FIRST(object) ((object)->pstNext)
129 #define UTILS_DL_LIST_IS_ON_QUEUE(node) ((node)->pstPrev != NULL && (node)->pstNext != NULL)
174 node->pstNext = list->pstNext;
176 list->pstNext->pstPrev = node;
177 list->pstNext = node;
249 node->pstNext->pstPrev = node->pstPrev;
250 node->pstPrev->pstNext = node->pstNext;
251 node->pstNext = NULL;
278 return (bool)(list->pstNext == list);
302 UTILS_DL_LIST *oldListHead = oldList->pstNext;
307 oldListTail->pstNext = newListHead;
310 newListTail->pstNext = oldListHead;
453 for (item = UTILS_DL_LIST_ENTRY((list)->pstNext, type, member); \
455 item = UTILS_DL_LIST_ENTRY((item)->member.pstNext, type, member))
480 for (item = UTILS_DL_LIST_ENTRY((list)->pstNext, type, member), \
481 next = UTILS_DL_LIST_ENTRY((item)->member.pstNext, type, member); \
483 item = next, next = UTILS_DL_LIST_ENTRY((item)->member.pstNext, type, member))
505 list->pstNext->pstPrev = list->pstPrev;
506 list->pstPrev->pstNext = list->pstNext;
530 for (item = (list)->pstNext; \
532 item = (item)->pstNext)
555 for (item = (list)->pstNext, next = (item)->pstNext; \
557 item = next, next = (item)->pstNext)
582 if ((list)->pstNext == list) { \
585 __t = UTILS_DL_LIST_ENTRY((list)->pstNext, type, element); \
593 if ((list)->pstNext == list) { \
596 __t = UTILS_DL_LIST_ENTRY((list)->pstNext, type, element); \
597 UtilsListDelete((list)->pstNext); \
605 if ((item)->pstNext == list) { \
608 __t = UTILS_DL_LIST_ENTRY((item)->pstNext, type, element); \