Searched refs:firstPtr (Results 1 – 15 of 15) sorted by relevance
58 if (list2->firstPtr != NilListNode) {76 list2->firstPtr->prevPtr = list1->lastPtr;78 list1->lastPtr->nextPtr = list2->firstPtr;80 list1->firstPtr = list2->firstPtr;90 list1->firstPtr->prevPtr = list1->lastPtr;91 list1->lastPtr->nextPtr = list1->firstPtr;94 } else if (list2->firstPtr != NilListNode) {117 list1->firstPtr = nln;137 list1->lastPtr->nextPtr = list1->firstPtr;138 list1->firstPtr->prevPtr = list1->lastPtr;[all …]
64 if (list->firstPtr == lNode) {65 list->firstPtr = lNode->nextPtr;89 if (list->firstPtr == lNode) {90 list->firstPtr = NilListNode;
65 list->firstPtr->prevPtr = list->lastPtr;66 list->lastPtr->nextPtr = list->firstPtr;68 list->firstPtr->prevPtr = NilListNode;
70 list->firstPtr = list->lastPtr = nLNode;80 if (lNode == list->firstPtr) {81 list->firstPtr = nLNode;
44 for (len = 0, node = list->firstPtr;47 if (node == list->firstPtr && len != 0) {
55 lNode = list->firstPtr;70 } while (lNode != NilListNode && lNode != list->firstPtr);
30 lNode = list->firstPtr;40 } while (lNode != NilListNode && lNode != list->firstPtr);
63 list->curPtr = tln = list->firstPtr;73 if (tln == list->firstPtr || tln == NilListNode) {
63 for (ln = list->firstPtr; ln != NilListNode; ln = tln) {69 for (ln = list->firstPtr; ln != NilListNode; ln = tln) {
43 ListNode firstPtr; /* first node in list */ member82 #define LstIsEmpty(l) (((List)l)->firstPtr == NilListNode)
42 return ((LstNode)((List)l)->firstPtr);
43 nList->firstPtr = NilListNode;
55 ln = list->firstPtr;
75 (next == NilListNode || next == list->firstPtr));
70 list->firstPtr = list->lastPtr = nLNode;