Searched refs:nextPtr (Results 1 – 16 of 16) sorted by relevance
67 list2->lastPtr->nextPtr = NilListNode;78 list1->lastPtr->nextPtr = list2->firstPtr;91 list1->lastPtr->nextPtr = list1->firstPtr;107 list2->lastPtr->nextPtr = NilListNode;110 ln = ln->nextPtr)115 last->nextPtr = nln;137 list1->lastPtr->nextPtr = list1->firstPtr;140 last->nextPtr = NilListNode;144 list2->lastPtr->nextPtr = list2->firstPtr;
66 nLNode->nextPtr = nLNode->prevPtr = nLNode;68 nLNode->nextPtr = nLNode->prevPtr = NilListNode;73 nLNode->nextPtr = lNode->nextPtr;75 lNode->nextPtr = nLNode;76 if (nLNode->nextPtr != NilListNode) {77 nLNode->nextPtr->prevPtr = nLNode;
53 if (lNode->nextPtr != NilListNode) {54 lNode->nextPtr->prevPtr = lNode->prevPtr;57 lNode->prevPtr->nextPtr = lNode->nextPtr;65 list->firstPtr = lNode->nextPtr;
66 nLNode->prevPtr = nLNode->nextPtr = nLNode;68 nLNode->prevPtr = nLNode->nextPtr = NilListNode;73 nLNode->nextPtr = lNode;76 nLNode->prevPtr->nextPtr = nLNode;
62 next = tln->nextPtr;74 done = (next == tln->nextPtr &&77 next = tln->nextPtr;
56 list->lastPtr->nextPtr = NilListNode;64 tln = ln->nextPtr;70 tln = ln->nextPtr;
66 list->lastPtr->nextPtr = list->firstPtr;69 list->lastPtr->nextPtr = NilListNode;
44 return ((LstNode) ((ListNode) ln)->nextPtr);
46 len++, node = node->nextPtr) {
67 lNode = lNode->nextPtr;
39 lNode = lNode->nextPtr;
58 tln = tln->nextPtr;
68 ln = ln->nextPtr;
70 tln = list->curPtr->nextPtr;
24 struct ListNode *nextPtr; /* next in list */ member
81 struct List_Links *nextPtr; member105 (elementPtr)->nextPtr = (List_Links *) NIL;154 ((headerPtr) == (headerPtr)->nextPtr)187 #define List_First(headerPtr) ((headerPtr)->nextPtr)234 #define List_Next(itemPtr) ((itemPtr)->nextPtr)