Home
last modified time | relevance | path

Searched refs:lastPtr (Results 1 – 11 of 11) sorted by relevance

/original-bsd/usr.bin/make/lst.lib/
H A DlstConcat.c67 list2->lastPtr->nextPtr = NilListNode;
76 list2->firstPtr->prevPtr = list1->lastPtr;
77 if (list1->lastPtr != NilListNode) {
78 list1->lastPtr->nextPtr = list2->firstPtr;
82 list1->lastPtr = list2->lastPtr;
90 list1->firstPtr->prevPtr = list1->lastPtr;
91 list1->lastPtr->nextPtr = list1->firstPtr;
107 list2->lastPtr->nextPtr = NilListNode;
128 list1->lastPtr = last;
137 list1->lastPtr->nextPtr = list1->firstPtr;
[all …]
H A DlstSetCirc.c65 list->firstPtr->prevPtr = list->lastPtr;
66 list->lastPtr->nextPtr = list->firstPtr;
69 list->lastPtr->nextPtr = NilListNode;
H A DlstAppend.c70 list->firstPtr = list->lastPtr = nLNode;
80 if (lNode == list->lastPtr) {
81 list->lastPtr = nLNode;
H A DlstPrev.c68 list->curPtr = tln = list->lastPtr;
77 if (tln == list->lastPtr || tln == NilListNode) {
H A DlstDestroy.c55 if (list->lastPtr != NilListNode)
56 list->lastPtr->nextPtr = NilListNode;
H A DlstRemove.c67 if (list->lastPtr == lNode) {
68 list->lastPtr = lNode->prevPtr;
H A DlstLast.c42 return ((LstNode)((List)l)->lastPtr);
H A DlstInit.c44 nList->lastPtr = NilListNode;
H A DlstDupl.c65 if (list->isCirc && ln == list->lastPtr) {
H A DlstInt.h44 ListNode lastPtr; /* last node in list */ member
H A DlstInsert.c70 list->firstPtr = list->lastPtr = nLNode;