Searched refs:firstPtr (Results 1 – 12 of 12) sorted by relevance
93 if (list2->firstPtr != NULL) { in Lst_Concat()111 list2->firstPtr->prevPtr = list1->lastPtr; in Lst_Concat()113 list1->lastPtr->nextPtr = list2->firstPtr; in Lst_Concat()115 list1->firstPtr = list2->firstPtr; in Lst_Concat()125 list1->firstPtr->prevPtr = list1->lastPtr; in Lst_Concat()126 list1->lastPtr->nextPtr = list1->firstPtr; in Lst_Concat()129 } else if (list2->firstPtr != NULL) { in Lst_Concat()152 list1->firstPtr = nln; in Lst_Concat()172 list1->lastPtr->nextPtr = list1->firstPtr; in Lst_Concat()173 list1->firstPtr->prevPtr = list1->lastPtr; in Lst_Concat()[all …]
95 if (list->firstPtr == lNode) { in Lst_Remove()96 list->firstPtr = lNode->nextPtr; in Lst_Remove()120 if (list->firstPtr == lNode) { in Lst_Remove()121 list->firstPtr = NULL; in Lst_Remove()
105 list->firstPtr = list->lastPtr = nLNode; in Lst_InsertBefore()115 if (lNode == list->firstPtr) { in Lst_InsertBefore()116 list->firstPtr = nLNode; in Lst_InsertBefore()
64 lNode = list->firstPtr; in Lst_Member()74 } while (lNode != NULL && lNode != list->firstPtr); in Lst_Member()
66 ListNode firstPtr; /* first node in list */ member103 #define LstIsEmpty(l) (((List)(l))->firstPtr == NULL)
88 for (ln = list->firstPtr; ln != NULL; ln = tln) { in Lst_Destroy()94 for (ln = list->firstPtr; ln != NULL; ln = tln) { in Lst_Destroy()
95 list->curPtr = tln = list->firstPtr; in Lst_Next()105 if (tln == list->firstPtr || tln == NULL) { in Lst_Next()
74 return (l->firstPtr); in Lst_First()
78 nList->firstPtr = NULL; in Lst_Init()
89 ln = list->firstPtr; in Lst_Duplicate()
101 done = (next == NULL || next == list->firstPtr); in Lst_ForEachFrom()
105 list->firstPtr = list->lastPtr = nLNode; in Lst_InsertAfter()