| 1 | /*
|
|---|
| 2 | * Copyright (c) 1988, 1989, 1990, 1993
|
|---|
| 3 | * The Regents of the University of California. All rights reserved.
|
|---|
| 4 | *
|
|---|
| 5 | * This code is derived from software contributed to Berkeley by
|
|---|
| 6 | * Adam de Boor.
|
|---|
| 7 | *
|
|---|
| 8 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 9 | * modification, are permitted provided that the following conditions
|
|---|
| 10 | * are met:
|
|---|
| 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.
|
|---|
| 23 | *
|
|---|
| 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
|
|---|
| 34 | * SUCH DAMAGE.
|
|---|
| 35 | *
|
|---|
| 36 | * $FreeBSD: src/usr.bin/make/lst.lib/lstAppend.c,v 1.6 1999/08/28 01:03:45 peter Exp $
|
|---|
| 37 | */
|
|---|
| 38 |
|
|---|
| 39 | #ifndef lint
|
|---|
| 40 | static char sccsid[] = "@(#)lstAppend.c 8.1 (Berkeley) 6/6/93";
|
|---|
| 41 | #endif /* not lint */
|
|---|
| 42 |
|
|---|
| 43 | /*-
|
|---|
| 44 | * LstAppend.c --
|
|---|
| 45 | * Add a new node with a new datum after an existing node
|
|---|
| 46 | */
|
|---|
| 47 |
|
|---|
| 48 | #include "lstInt.h"
|
|---|
| 49 |
|
|---|
| 50 | /*-
|
|---|
| 51 | *-----------------------------------------------------------------------
|
|---|
| 52 | * Lst_Append --
|
|---|
| 53 | * Create a new node and add it to the given list after the given node.
|
|---|
| 54 | *
|
|---|
| 55 | * Results:
|
|---|
| 56 | * SUCCESS if all went well.
|
|---|
| 57 | *
|
|---|
| 58 | * Side Effects:
|
|---|
| 59 | * A new ListNode is created and linked in to the List. The lastPtr
|
|---|
| 60 | * field of the List will be altered if ln is the last node in the
|
|---|
| 61 | * list. lastPtr and firstPtr will alter if the list was empty and
|
|---|
| 62 | * ln was NILLNODE.
|
|---|
| 63 | *
|
|---|
| 64 | *-----------------------------------------------------------------------
|
|---|
| 65 | */
|
|---|
| 66 | ReturnStatus
|
|---|
| 67 | Lst_Append (l, ln, d)
|
|---|
| 68 | Lst l; /* affected list */
|
|---|
| 69 | LstNode ln; /* node after which to append the datum */
|
|---|
| 70 | ClientData d; /* said datum */
|
|---|
| 71 | {
|
|---|
| 72 | register List list;
|
|---|
| 73 | register ListNode lNode;
|
|---|
| 74 | register ListNode nLNode;
|
|---|
| 75 |
|
|---|
| 76 | if (LstValid (l) && (ln == NILLNODE && LstIsEmpty (l))) {
|
|---|
| 77 | goto ok;
|
|---|
| 78 | }
|
|---|
| 79 |
|
|---|
| 80 | if (!LstValid (l) || LstIsEmpty (l) || ! LstNodeValid (ln, l)) {
|
|---|
| 81 | return (FAILURE);
|
|---|
| 82 | }
|
|---|
| 83 | ok:
|
|---|
| 84 |
|
|---|
| 85 | list = (List)l;
|
|---|
| 86 | lNode = (ListNode)ln;
|
|---|
| 87 |
|
|---|
| 88 | PAlloc (nLNode, ListNode);
|
|---|
| 89 | nLNode->datum = d;
|
|---|
| 90 | nLNode->useCount = nLNode->flags = 0;
|
|---|
| 91 |
|
|---|
| 92 | if (lNode == NilListNode) {
|
|---|
| 93 | if (list->isCirc) {
|
|---|
| 94 | nLNode->nextPtr = nLNode->prevPtr = nLNode;
|
|---|
| 95 | } else {
|
|---|
| 96 | nLNode->nextPtr = nLNode->prevPtr = NilListNode;
|
|---|
| 97 | }
|
|---|
| 98 | list->firstPtr = list->lastPtr = nLNode;
|
|---|
| 99 | } else {
|
|---|
| 100 | nLNode->prevPtr = lNode;
|
|---|
| 101 | nLNode->nextPtr = lNode->nextPtr;
|
|---|
| 102 |
|
|---|
| 103 | lNode->nextPtr = nLNode;
|
|---|
| 104 | if (nLNode->nextPtr != NilListNode) {
|
|---|
| 105 | nLNode->nextPtr->prevPtr = nLNode;
|
|---|
| 106 | }
|
|---|
| 107 |
|
|---|
| 108 | if (lNode == list->lastPtr) {
|
|---|
| 109 | list->lastPtr = nLNode;
|
|---|
| 110 | }
|
|---|
| 111 | }
|
|---|
| 112 |
|
|---|
| 113 | return (SUCCESS);
|
|---|
| 114 | }
|
|---|
| 115 |
|
|---|
