2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * $FreeBSD: src/usr.bin/make/lst.lib/lstRemove.c,v 1.6 1999/08/28 01:03:56 peter Exp $
37 * $DragonFly: src/usr.bin/make/lst.lib/Attic/lstRemove.c,v 1.9 2004/12/17 07:56:08 okumoto Exp $
39 * @(#)lstRemove.c 8.1 (Berkeley) 6/6/93
44 * Remove an element from a list
51 *-----------------------------------------------------------------------
53 * Remove the given node from the given list.
59 * The list's firstPtr will be set to NULL if ln is the last
60 * node on the list. firsPtr and lastPtr will be altered if ln is
61 * either the first or last node, respectively, on the list.
63 *-----------------------------------------------------------------------
66 Lst_Remove(Lst *list, LstNode *ln)
69 if (!Lst_Valid(list) || !Lst_NodeValid(ln, list)) {
74 * unlink it from the list
76 if (ln->nextPtr != NULL) {
77 ln->nextPtr->prevPtr = ln->prevPtr;
79 if (ln->prevPtr != NULL) {
80 ln->prevPtr->nextPtr = ln->nextPtr;
84 * if either the firstPtr or lastPtr of the list point to this node,
85 * adjust them accordingly
87 if (list->firstPtr == ln) {
88 list->firstPtr = ln->nextPtr;
90 if (list->lastPtr == ln) {
91 list->lastPtr = ln->prevPtr;
95 * the only way firstPtr can still point to ln is if ln is the last
96 * node on the list. The list is, therefore, empty and is marked as such
98 if (list->firstPtr == ln) {
99 list->firstPtr = NULL;
103 * note that the datum is unmolested. The caller must free it as
104 * necessary and as expected.
106 if (ln->useCount == 0) {
109 ln->flags |= LN_DELETED;