Commit | Line | Data |
---|---|---|
bb2109e7 | 1 | /* |
ad787160 C |
2 | * Copyright (c) 1988, 1989, 1990, 1993 |
3 | * The Regents of the University of California. All rights reserved. | |
bb2109e7 KB |
4 | * |
5 | * This code is derived from software contributed to Berkeley by | |
6 | * Adam de Boor. | |
7 | * | |
c0567266 KB |
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. | |
bb2109e7 KB |
35 | */ |
36 | ||
37 | #ifndef lint | |
fd88f5c5 | 38 | static char sccsid[] = "@(#)lstDupl.c 8.2 (Berkeley) 4/28/95"; |
bb2109e7 KB |
39 | #endif /* not lint */ |
40 | ||
c65fedcf KB |
41 | /*- |
42 | * listDupl.c -- | |
43 | * Duplicate a list. This includes duplicating the individual | |
44 | * elements. | |
c65fedcf | 45 | */ |
c65fedcf KB |
46 | |
47 | #include "lstInt.h" | |
48 | ||
49 | /*- | |
50 | *----------------------------------------------------------------------- | |
51 | * Lst_Duplicate -- | |
52 | * Duplicate an entire list. If a function to copy a ClientData is | |
53 | * given, the individual client elements will be duplicated as well. | |
54 | * | |
55 | * Results: | |
56 | * The new Lst structure or NILLST if failure. | |
57 | * | |
58 | * Side Effects: | |
59 | * A new list is created. | |
60 | *----------------------------------------------------------------------- | |
61 | */ | |
62 | Lst | |
63 | Lst_Duplicate (l, copyProc) | |
64 | Lst l; /* the list to duplicate */ | |
bfdbffbb CZ |
65 | /* A function to duplicate each ClientData */ |
66 | ClientData (*copyProc) __P((ClientData)); | |
c65fedcf KB |
67 | { |
68 | register Lst nl; | |
69 | register ListNode ln; | |
70 | register List list = (List)l; | |
71 | ||
72 | if (!LstValid (l)) { | |
73 | return (NILLST); | |
74 | } | |
75 | ||
76 | nl = Lst_Init (list->isCirc); | |
77 | if (nl == NILLST) { | |
78 | return (NILLST); | |
79 | } | |
80 | ||
81 | ln = list->firstPtr; | |
82 | while (ln != NilListNode) { | |
83 | if (copyProc != NOCOPY) { | |
84 | if (Lst_AtEnd (nl, (*copyProc) (ln->datum)) == FAILURE) { | |
85 | return (NILLST); | |
86 | } | |
87 | } else if (Lst_AtEnd (nl, ln->datum) == FAILURE) { | |
88 | return (NILLST); | |
89 | } | |
90 | ||
91 | if (list->isCirc && ln == list->lastPtr) { | |
92 | ln = NilListNode; | |
93 | } else { | |
94 | ln = ln->nextPtr; | |
95 | } | |
96 | } | |
97 | ||
98 | return (nl); | |
99 | } |