Commit | Line | Data |
---|---|---|
15637ed4 RG |
1 | /* |
2 | * Copyright (c) 1988, 1989, 1990 The Regents of the University of California. | |
3 | * 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 | ||
37 | #ifndef lint | |
38 | static char sccsid[] = "@(#)lstAppend.c 5.3 (Berkeley) 6/1/90"; | |
39 | #endif /* not lint */ | |
40 | ||
41 | /*- | |
42 | * LstAppend.c -- | |
43 | * Add a new node with a new datum after an existing node | |
44 | */ | |
45 | ||
46 | #include "lstInt.h" | |
47 | ||
48 | /*- | |
49 | *----------------------------------------------------------------------- | |
50 | * Lst_Append -- | |
51 | * Create a new node and add it to the given list after the given node. | |
52 | * | |
53 | * Results: | |
54 | * SUCCESS if all went well. | |
55 | * | |
56 | * Side Effects: | |
57 | * A new ListNode is created and linked in to the List. The lastPtr | |
58 | * field of the List will be altered if ln is the last node in the | |
59 | * list. lastPtr and firstPtr will alter if the list was empty and | |
60 | * ln was NILLNODE. | |
61 | * | |
62 | *----------------------------------------------------------------------- | |
63 | */ | |
64 | ReturnStatus | |
65 | Lst_Append (l, ln, d) | |
66 | Lst l; /* affected list */ | |
67 | LstNode ln; /* node after which to append the datum */ | |
68 | ClientData d; /* said datum */ | |
69 | { | |
70 | register List list; | |
71 | register ListNode lNode; | |
72 | register ListNode nLNode; | |
73 | ||
74 | if (LstValid (l) && (ln == NILLNODE && LstIsEmpty (l))) { | |
75 | goto ok; | |
76 | } | |
77 | ||
78 | if (!LstValid (l) || LstIsEmpty (l) || ! LstNodeValid (ln, l)) { | |
79 | return (FAILURE); | |
80 | } | |
81 | ok: | |
82 | ||
83 | list = (List)l; | |
84 | lNode = (ListNode)ln; | |
85 | ||
86 | PAlloc (nLNode, ListNode); | |
87 | nLNode->datum = d; | |
88 | nLNode->useCount = nLNode->flags = 0; | |
89 | ||
90 | if (lNode == NilListNode) { | |
91 | if (list->isCirc) { | |
92 | nLNode->nextPtr = nLNode->prevPtr = nLNode; | |
93 | } else { | |
94 | nLNode->nextPtr = nLNode->prevPtr = NilListNode; | |
95 | } | |
96 | list->firstPtr = list->lastPtr = nLNode; | |
97 | } else { | |
98 | nLNode->prevPtr = lNode; | |
99 | nLNode->nextPtr = lNode->nextPtr; | |
100 | ||
101 | lNode->nextPtr = nLNode; | |
102 | if (nLNode->nextPtr != NilListNode) { | |
103 | nLNode->nextPtr->prevPtr = nLNode; | |
104 | } | |
105 | ||
106 | if (lNode == list->lastPtr) { | |
107 | list->lastPtr = nLNode; | |
108 | } | |
109 | } | |
110 | ||
111 | return (SUCCESS); | |
112 | } | |
113 |