Searched refs:prevPtr (Results 1 – 7 of 7) sorted by relevance
101 nLNode->prevPtr = nLNode->nextPtr = nLNode; in Lst_InsertBefore()103 nLNode->prevPtr = nLNode->nextPtr = NULL; in Lst_InsertBefore()107 nLNode->prevPtr = lNode->prevPtr; in Lst_InsertBefore()110 if (nLNode->prevPtr != NULL) { in Lst_InsertBefore()111 nLNode->prevPtr->nextPtr = nLNode; in Lst_InsertBefore()113 lNode->prevPtr = nLNode; in Lst_InsertBefore()
85 lNode->nextPtr->prevPtr = lNode->prevPtr; in Lst_Remove()87 if (lNode->prevPtr != NULL) { in Lst_Remove()88 lNode->prevPtr->nextPtr = lNode->nextPtr; in Lst_Remove()99 list->lastPtr = lNode->prevPtr; in Lst_Remove()109 list->curPtr = list->prevPtr; in Lst_Remove()
101 nLNode->nextPtr = nLNode->prevPtr = nLNode; in Lst_InsertAfter()103 nLNode->nextPtr = nLNode->prevPtr = NULL; in Lst_InsertAfter()107 nLNode->prevPtr = lNode; in Lst_InsertAfter()112 nLNode->nextPtr->prevPtr = nLNode; in Lst_InsertAfter()
111 list2->firstPtr->prevPtr = list1->lastPtr; in Lst_Concat()125 list1->firstPtr->prevPtr = list1->lastPtr; in Lst_Concat()154 nln->prevPtr = last; in Lst_Concat()173 list1->firstPtr->prevPtr = list1->lastPtr; in Lst_Concat()
48 struct ListNode *prevPtr; /* previous element in list */ member77 ListNode prevPtr; /* Previous node, if open. Used by member
76 return (ln->prevPtr); in Lst_Prev()
86 list->prevPtr = list->curPtr; in Lst_Next()