1
/* $NetBSD: lstRemove.c,v 1.7 1997/09/28 03:31:33 lukem Exp $ */
4
* Copyright (c) 1988, 1989, 1990, 1993
5
* The Regents of the University of California. All rights reserved.
7
* This code is derived from software contributed to Berkeley by
10
* Redistribution and use in source and binary forms, with or without
11
* modification, are permitted provided that the following conditions
13
* 1. Redistributions of source code must retain the above copyright
14
* notice, this list of conditions and the following disclaimer.
15
* 2. Redistributions in binary form must reproduce the above copyright
16
* notice, this list of conditions and the following disclaimer in the
17
* documentation and/or other materials provided with the distribution.
18
* 3. All advertising materials mentioning features or use of this software
19
* must display the following acknowledgement:
20
* This product includes software developed by the University of
21
* California, Berkeley and its contributors.
22
* 4. Neither the name of the University nor the names of its contributors
23
* may be used to endorse or promote products derived from this software
24
* without specific prior written permission.
26
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40
static char rcsid[] = "$NetBSD: lstRemove.c,v 1.7 1997/09/28 03:31:33 lukem Exp $";
42
#include <sys/cdefs.h>
45
static char sccsid[] = "@(#)lstRemove.c 8.1 (Berkeley) 6/6/93";
47
__RCSID("$NetBSD: lstRemove.c,v 1.7 1997/09/28 03:31:33 lukem Exp $");
54
* Remove an element from a list
60
*-----------------------------------------------------------------------
62
* Remove the given node from the given list.
68
* The list's firstPtr will be set to NilListNode if ln is the last
69
* node on the list. firsPtr and lastPtr will be altered if ln is
70
* either the first or last node, respectively, on the list.
72
*-----------------------------------------------------------------------
79
register List list = (List) l;
80
register ListNode lNode = (ListNode) ln;
83
!LstNodeValid (ln, l)) {
88
* unlink it from the list
90
if (lNode->nextPtr != NilListNode) {
91
lNode->nextPtr->prevPtr = lNode->prevPtr;
93
if (lNode->prevPtr != NilListNode) {
94
lNode->prevPtr->nextPtr = lNode->nextPtr;
98
* if either the firstPtr or lastPtr of the list point to this node,
99
* adjust them accordingly
101
if (list->firstPtr == lNode) {
102
list->firstPtr = lNode->nextPtr;
104
if (list->lastPtr == lNode) {
105
list->lastPtr = lNode->prevPtr;
109
* Sequential access stuff. If the node we're removing is the current
110
* node in the list, reset the current node to the previous one. If the
111
* previous one was non-existent (prevPtr == NilListNode), we set the
112
* end to be Unknown, since it is.
114
if (list->isOpen && (list->curPtr == lNode)) {
115
list->curPtr = list->prevPtr;
116
if (list->curPtr == NilListNode) {
117
list->atEnd = Unknown;
122
* the only way firstPtr can still point to ln is if ln is the last
123
* node on the list (the list is circular, so lNode->nextptr == lNode in
124
* this case). The list is, therefore, empty and is marked as such
126
if (list->firstPtr == lNode) {
127
list->firstPtr = NilListNode;
131
* note that the datum is unmolested. The caller must free it as
132
* necessary and as expected.
134
if (lNode->useCount == 0) {
137
lNode->flags |= LN_DELETED;
added
removed
lst.lib/lstRemove.c
