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/lstAppend.c,v 1.6 1999/08/28 01:03:45 peter Exp $
37 * $DragonFly: src/usr.bin/make/lst.lib/Attic/lstAppend.c,v 1.2 2003/06/17 04:29:29 dillon Exp $
39 * @(#)lstAppend.c 8.1 (Berkeley) 6/6/93
44 * Add a new node with a new datum after an existing node
50 *-----------------------------------------------------------------------
52 * Create a new node and add it to the given list after the given node.
55 * SUCCESS if all went well.
58 * A new ListNode is created and linked in to the List. The lastPtr
59 * field of the List will be altered if ln is the last node in the
60 * list. lastPtr and firstPtr will alter if the list was empty and
63 *-----------------------------------------------------------------------
67 Lst l; /* affected list */
68 LstNode ln; /* node after which to append the datum */
69 ClientData d; /* said datum */
72 register ListNode lNode;
73 register ListNode nLNode;
75 if (LstValid (l) && (ln == NILLNODE && LstIsEmpty (l))) {
79 if (!LstValid (l) || LstIsEmpty (l) || ! LstNodeValid (ln, l)) {
87 PAlloc (nLNode, ListNode);
89 nLNode->useCount = nLNode->flags = 0;
91 if (lNode == NilListNode) {
93 nLNode->nextPtr = nLNode->prevPtr = nLNode;
95 nLNode->nextPtr = nLNode->prevPtr = NilListNode;
97 list->firstPtr = list->lastPtr = nLNode;
99 nLNode->prevPtr = lNode;
100 nLNode->nextPtr = lNode->nextPtr;
102 lNode->nextPtr = nLNode;
103 if (nLNode->nextPtr != NilListNode) {
104 nLNode->nextPtr->prevPtr = nLNode;
107 if (lNode == list->lastPtr) {
108 list->lastPtr = nLNode;