Searched refs:NilListNode (Results 1 – 18 of 18) sorted by relevance
58 if (list2->firstPtr != NilListNode) {67 list2->lastPtr->nextPtr = NilListNode;77 if (list1->lastPtr != NilListNode) {84 if (list1->isCirc && list1->firstPtr != NilListNode) {94 } else if (list2->firstPtr != NilListNode) {107 list2->lastPtr->nextPtr = NilListNode;109 ln != NilListNode;114 if (last != NilListNode) {140 last->nextPtr = NilListNode;
43 register ListNode tln = NilListNode;55 if (list->lastPtr != NilListNode)56 list->lastPtr->nextPtr = NilListNode;63 for (ln = list->firstPtr; ln != NilListNode; ln = tln) {69 for (ln = list->firstPtr; ln != NilListNode; ln = tln) {
53 if (lNode->nextPtr != NilListNode) {56 if (lNode->prevPtr != NilListNode) {79 if (list->curPtr == NilListNode) {90 list->firstPtr = NilListNode;
56 if (list->curPtr == NilListNode) {66 tln = NilListNode;73 if (tln == list->firstPtr || tln == NilListNode) {
66 if (list->curPtr == NilListNode) {71 tln = NilListNode;77 if (tln == list->lastPtr || tln == NilListNode) {
64 if (lNode == NilListNode) {68 nLNode->nextPtr = nLNode->prevPtr = NilListNode;76 if (nLNode->nextPtr != NilListNode) {
43 nList->firstPtr = NilListNode;44 nList->lastPtr = NilListNode;
57 if (lNode == NilListNode) {70 } while (lNode != NilListNode && lNode != list->firstPtr);
31 if (lNode == NilListNode) {40 } while (lNode != NilListNode && lNode != list->firstPtr);
68 list->firstPtr->prevPtr = NilListNode;69 list->lastPtr->nextPtr = NilListNode;
56 while (ln != NilListNode) {66 ln = NilListNode;
36 #define NilListNode ((ListNode)-1) macro82 #define LstIsEmpty(l) (((List)l)->firstPtr == NilListNode)
68 nLNode->prevPtr = nLNode->nextPtr = NilListNode;75 if (nLNode->prevPtr != NilListNode) {
51 ((List) l)->curPtr = NilListNode;
45 node != NilListNode;
44 if (tln == NilListNode) {
60 } while (tln != (ListNode)ln && tln != NilListNode);
75 (next == NilListNode || next == list->firstPtr));