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 $
37 * $DragonFly: src/usr.bin/make/lst.lib/Attic/lstInsert.c,v 1.5 2004/12/08 11:26:39 okumoto Exp $
39 * @(#)lstInsert.c 8.1 (Berkeley) 6/6/93
44 * 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.
59 * l list to manipulate
60 * ln node before which to insert d
61 * d datum to be inserted
64 * the firstPtr field will be changed if ln is the first node in the
67 *-----------------------------------------------------------------------
70 Lst_Insert(Lst list, LstNode ln, void *d)
72 LstNode nLNode; /* new lnode for d */
75 * check validity of arguments
77 if (Lst_Valid (list) && (Lst_IsEmpty (list) && ln == NULL))
80 if (!Lst_Valid (list) || Lst_IsEmpty (list) || !Lst_NodeValid (ln, list)) {
85 nLNode = emalloc(sizeof(*nLNode));
88 nLNode->useCount = nLNode->flags = 0;
92 nLNode->prevPtr = nLNode->nextPtr = nLNode;
94 nLNode->prevPtr = nLNode->nextPtr = NULL;
96 list->firstPtr = list->lastPtr = nLNode;
98 nLNode->prevPtr = ln->prevPtr;
101 if (nLNode->prevPtr != NULL) {
102 nLNode->prevPtr->nextPtr = nLNode;
104 ln->prevPtr = nLNode;
106 if (ln == list->firstPtr) {
107 list->firstPtr = nLNode;