Lines Matching defs:Node

46     /** Node */
47 RTLISTNODE Node;
55 RTTEST_CHECK(hTest, RTListGetFirst(pList, LISTELEM, Node) != NULL);
56 RTTEST_CHECK(hTest, RTListGetLast(pList, LISTELEM, Node) != NULL);
58 RTTEST_CHECK(hTest, RTListGetLast(pList, LISTELEM, Node) != RTListGetFirst(pList, LISTELEM, Node));
60 RTTEST_CHECK(hTest, RTListGetLast(pList, LISTELEM, Node) == RTListGetFirst(pList, LISTELEM, Node));
63 PLISTELEM pNode = RTListGetFirst(pList, LISTELEM, Node);
67 pNode = RTListNodeGetNext(&pNode->Node, LISTELEM, Node);
71 RTTEST_CHECK(hTest, RTListGetLast(pList, LISTELEM, Node) == pNode);
72 RTTEST_CHECK(hTest, RTListNodeIsLast(pList, &pNode->Node) == true);
75 pNode = RTListGetLast(pList, LISTELEM, Node);
79 pNode = RTListNodeGetPrev(&pNode->Node, LISTELEM, Node);
83 RTTEST_CHECK(hTest, RTListGetFirst(pList, LISTELEM, Node) == pNode);
84 RTTEST_CHECK(hTest, RTListNodeIsFirst(pList, &pNode->Node) == true);
88 RTListForEach(pList, pNode, LISTELEM, Node)
97 RTListForEachReverse(pList, pNode, LISTELEM, Node)
115 RTTEST_CHECK(hTest, RTListGetFirst(&ListHead, LISTELEM, Node) == NULL);
116 RTTEST_CHECK(hTest, RTListGetLast(&ListHead, LISTELEM, Node) == NULL);
124 pNode->Node.pPrev = NULL;
125 pNode->Node.pNext = NULL;
126 RTListAppend(&ListHead, &pNode->Node);
138 RTTEST_CHECK(hTest, RTListGetFirst(&ListHead, LISTELEM, Node) == NULL);
139 RTTEST_CHECK(hTest, RTListGetLast(&ListHead, LISTELEM, Node) == NULL);
150 RTListForEachSafe(&ListHeadNew, pNode, pSafe, LISTELEM, Node)
152 RTListNodeRemove(&pNode->Node);
153 RTListAppend(&ListHead, &pNode->Node);
159 RTListForEachReverseSafe(&ListHead, pNode, pSafe, LISTELEM, Node)
161 RTListNodeRemove(&pNode->Node);
162 RTListPrepend(&ListHeadNew, &pNode->Node);
175 pNode = RTListGetFirst(&ListHeadNew, LISTELEM, Node);
178 PLISTELEM pNext = RTListNodeGetNext(&pNode->Node, LISTELEM, Node);
182 RTListNodeRemove(&pNode->Node);
198 pNode = RTListGetFirst(&ListHeadNew, LISTELEM, Node);
201 PLISTELEM pNext = RTListNodeGetNext(&pNode->Node, LISTELEM, Node);
203 RTListNodeRemove(&pNode->Node);
210 RTTEST_CHECK(hTest, RTListGetFirst(&ListHeadNew, LISTELEM, Node) == NULL);
211 RTTEST_CHECK(hTest, RTListGetLast(&ListHeadNew, LISTELEM, Node) == NULL);