Searched refs:firstPtr (Results 1 - 14 of 14) sorted by relevance

/freebsd-9.3-release/contrib/bmake/lst.lib/
H A DlstConcat.c93 if (list2->firstPtr != NULL) {
111 list2->firstPtr->prevPtr = list1->lastPtr;
113 list1->lastPtr->nextPtr = list2->firstPtr;
115 list1->firstPtr = list2->firstPtr;
119 if (list1->isCirc && list1->firstPtr != NULL) {
125 list1->firstPtr->prevPtr = list1->lastPtr;
126 list1->lastPtr->nextPtr = list1->firstPtr;
129 } else if (list2->firstPtr != NULL) {
143 for (last = list1->lastPtr, ln = list2->firstPtr;
[all...]
H A DlstFirst.c74 return (l->firstPtr);
H A DlstMember.c61 lNode = list->firstPtr;
71 } while (lNode != NULL && lNode != list->firstPtr);
H A DlstRemove.c64 * The list's firstPtr will be set to NULL if ln is the last
92 * if either the firstPtr or lastPtr of the list point to this node,
95 if (list->firstPtr == lNode) {
96 list->firstPtr = lNode->nextPtr;
116 * the only way firstPtr can still point to ln is if ln is the last
120 if (list->firstPtr == lNode) {
121 list->firstPtr = NULL;
H A DlstDestroy.c88 for (ln = list->firstPtr; ln != NULL; ln = tln) {
94 for (ln = list->firstPtr; ln != NULL; ln = tln) {
H A DlstInt.h66 ListNode firstPtr; /* first node in list */ member in struct:List
103 #define LstIsEmpty(l) (((List)(l))->firstPtr == NULL)
H A DlstNext.c95 list->curPtr = tln = list->firstPtr;
105 if (tln == list->firstPtr || tln == NULL) {
H A DlstInit.c78 nList->firstPtr = NULL;
H A DlstInsert.c70 * the firstPtr field will be changed if ln is the first node in the
105 list->firstPtr = list->lastPtr = nLNode;
115 if (lNode == list->firstPtr) {
116 list->firstPtr = nLNode;
H A DlstDupl.c89 ln = list->firstPtr;
H A DlstForEachFrom.c101 done = (next == NULL || next == list->firstPtr);
H A DlstAppend.c71 * list. lastPtr and firstPtr will alter if the list was empty and
105 list->firstPtr = list->lastPtr = nLNode;
/freebsd-9.3-release/usr.bin/make/
H A Dlst.c58 * list. lastPtr and firstPtr will alter if the list was empty and
71 list->firstPtr = list->lastPtr = nLNode;
111 if (list2->firstPtr == NULL)
123 list2->firstPtr->prevPtr = list1->lastPtr;
125 list1->lastPtr->nextPtr = list2->firstPtr;
127 list1->firstPtr = list2->firstPtr;
143 for (last = list1->lastPtr, ln = list2->firstPtr;
151 list1->firstPtr = nln;
207 if (list->firstPtr
[all...]
H A Dlst.h65 LstNode *firstPtr; /* first node in list */ member in struct:Lst
89 (LST)->firstPtr = NULL; \
123 ? (LST)->firstPtr : NULL)
145 for ((PTR) = (LST)->firstPtr; (PTR) != NULL; (PTR) = (PTR)->nextPtr)
173 #define Lst_IsEmpty(L) (!Lst_Valid(L) || (L)->firstPtr == NULL)

Completed in 137 milliseconds