Searched refs:prevPtr (Results 1 - 9 of 9) sorted by relevance

/freebsd-10.0-release/contrib/bmake/lst.lib/
H A DlstInsert.c101 nLNode->prevPtr = nLNode->nextPtr = nLNode;
103 nLNode->prevPtr = nLNode->nextPtr = NULL;
107 nLNode->prevPtr = lNode->prevPtr;
110 if (nLNode->prevPtr != NULL) {
111 nLNode->prevPtr->nextPtr = nLNode;
113 lNode->prevPtr = nLNode;
H A DlstPrev.c76 return (ln->prevPtr);
H A DlstRemove.c85 lNode->nextPtr->prevPtr = lNode->prevPtr;
87 if (lNode->prevPtr != NULL) {
88 lNode->prevPtr->nextPtr = lNode->nextPtr;
99 list->lastPtr = lNode->prevPtr;
105 * previous one was non-existent (prevPtr == NULL), we set the
109 list->curPtr = list->prevPtr;
H A DlstAppend.c101 nLNode->nextPtr = nLNode->prevPtr = nLNode;
103 nLNode->nextPtr = nLNode->prevPtr = NULL;
107 nLNode->prevPtr = lNode;
112 nLNode->nextPtr->prevPtr = nLNode;
H A DlstInt.h48 struct ListNode *prevPtr; /* previous element in list */ member in struct:ListNode
77 ListNode prevPtr; /* Previous node, if open. Used by member in struct:List
H A DlstConcat.c111 list2->firstPtr->prevPtr = list1->lastPtr;
125 list1->firstPtr->prevPtr = list1->lastPtr;
134 * prevPtr to fit into l1 and its datum field from the
154 nln->prevPtr = last;
173 list1->firstPtr->prevPtr = list1->lastPtr;
H A DlstNext.c86 list->prevPtr = list->curPtr;
/freebsd-10.0-release/usr.bin/make/
H A Dlst.c70 nLNode->nextPtr = nLNode->prevPtr = NULL;
73 nLNode->prevPtr = ln;
78 nLNode->nextPtr->prevPtr = nLNode;
123 list2->firstPtr->prevPtr = list1->lastPtr;
134 * new LstNodes and filling in the nextPtr, and prevPtr to fit
153 nln->prevPtr = last;
273 nLNode->prevPtr = nLNode->nextPtr = NULL;
276 nLNode->prevPtr = ln->prevPtr;
279 if (nLNode->prevPtr !
[all...]
H A Dlst.h55 struct LstNode *prevPtr; /* previous element in list */ member in struct:LstNode

Completed in 117 milliseconds