make/lst.lib/lstRemove.c

74     ListNode	lNode = ln;
84     if (lNode->nextPtr != NULL) {
85 	lNode->nextPtr->prevPtr = lNode->prevPtr;
87     if (lNode->prevPtr != NULL) {
88 	lNode->prevPtr->nextPtr = lNode->nextPtr;
95     if (list->firstPtr == lNode) {
96 	list->firstPtr = lNode->nextPtr;
98     if (list->lastPtr == lNode) {
99 	list->lastPtr = lNode->prevPtr;
108     if (list->isOpen && (list->curPtr == lNode)) {
117      * node on the list (the list is circular, so lNode->nextptr == lNode in
120     if (list->firstPtr == lNode) {
128     if (lNode->useCount == 0) {
131 	lNode->flags |= LN_DELETED;