Lines Matching defs:pNode

63     PLISTELEM pNode = RTListGetFirst(pList, LISTELEM, Node);
66 RTTEST_CHECK(hTest, pNode->idx == i);
67 pNode = RTListNodeGetNext(&pNode->Node, LISTELEM, Node);
70 RTTEST_CHECK(hTest, pNode->idx == idxLast);
71 RTTEST_CHECK(hTest, RTListGetLast(pList, LISTELEM, Node) == pNode);
72 RTTEST_CHECK(hTest, RTListNodeIsLast(pList, &pNode->Node) == true);
75 pNode = RTListGetLast(pList, LISTELEM, Node);
78 RTTEST_CHECK(hTest, pNode->idx == i);
79 pNode = RTListNodeGetPrev(&pNode->Node, LISTELEM, Node);
82 RTTEST_CHECK(hTest, pNode->idx == idxFirst);
83 RTTEST_CHECK(hTest, RTListGetFirst(pList, LISTELEM, Node) == pNode);
84 RTTEST_CHECK(hTest, RTListNodeIsFirst(pList, &pNode->Node) == true);
88 RTListForEach(pList, pNode, LISTELEM, Node)
90 RTTEST_CHECK_RETV(hTest, idx == pNode->idx);
97 RTListForEachReverse(pList, pNode, LISTELEM, Node)
99 RTTEST_CHECK_RETV(hTest, idx == pNode->idx);
121 PLISTELEM pNode = (PLISTELEM)RTMemAlloc(sizeof(LISTELEM));
123 pNode->idx = i;
124 pNode->Node.pPrev = NULL;
125 pNode->Node.pNext = NULL;
126 RTListAppend(&ListHead, &pNode->Node);
149 PLISTELEM pNode, pSafe;
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);
180 if (!(pNode->idx % 2))
182 RTListNodeRemove(&pNode->Node);
183 RTMemFree(pNode);
186 pNode = pNext;
198 pNode = RTListGetFirst(&ListHeadNew, LISTELEM, Node);
201 PLISTELEM pNext = RTListNodeGetNext(&pNode->Node, LISTELEM, Node);
203 RTListNodeRemove(&pNode->Node);
204 RTMemFree(pNode);
205 pNode = pNext;