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/lstInsert.c,v 1.6 1999/08/28 01:03:52 peter Exp $
40 static char sccsid[] = "@(#)lstInsert.c 8.1 (Berkeley) 6/6/93";
45 * Insert a new datum before an old one
51 *-----------------------------------------------------------------------
53 * Insert a new node with the given piece of data before the given
54 * node in the given list.
60 * the firstPtr field will be changed if ln is the first node in the
63 *-----------------------------------------------------------------------
67 Lst l; /* list to manipulate */
68 LstNode ln; /* node before which to insert d */
69 ClientData d; /* datum to be inserted */
71 register ListNode nLNode; /* new lnode for d */
72 register ListNode lNode = (ListNode)ln;
73 register List list = (List)l;
77 * check validity of arguments
79 if (LstValid (l) && (LstIsEmpty (l) && ln == NILLNODE))
82 if (!LstValid (l) || LstIsEmpty (l) || !LstNodeValid (ln, l)) {
87 PAlloc (nLNode, ListNode);
90 nLNode->useCount = nLNode->flags = 0;
94 nLNode->prevPtr = nLNode->nextPtr = nLNode;
96 nLNode->prevPtr = nLNode->nextPtr = NilListNode;
98 list->firstPtr = list->lastPtr = nLNode;
100 nLNode->prevPtr = lNode->prevPtr;
101 nLNode->nextPtr = lNode;
103 if (nLNode->prevPtr != NilListNode) {
104 nLNode->prevPtr->nextPtr = nLNode;
106 lNode->prevPtr = nLNode;
108 if (lNode == list->firstPtr) {
109 list->firstPtr = nLNode;