BSD 4_4 release
[unix-history] / usr / src / usr.bin / make / lst.lib / lstDupl.c
CommitLineData
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
ad787160 38static char sccsid[] = "@(#)lstDupl.c 8.1 (Berkeley) 6/6/93";
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 */
62Lst
63Lst_Duplicate (l, copyProc)
64 Lst l; /* the list to duplicate */
65 ClientData (*copyProc)(); /* A function to duplicate each ClientData */
66{
67 register Lst nl;
68 register ListNode ln;
69 register List list = (List)l;
70
71 if (!LstValid (l)) {
72 return (NILLST);
73 }
74
75 nl = Lst_Init (list->isCirc);
76 if (nl == NILLST) {
77 return (NILLST);
78 }
79
80 ln = list->firstPtr;
81 while (ln != NilListNode) {
82 if (copyProc != NOCOPY) {
83 if (Lst_AtEnd (nl, (*copyProc) (ln->datum)) == FAILURE) {
84 return (NILLST);
85 }
86 } else if (Lst_AtEnd (nl, ln->datum) == FAILURE) {
87 return (NILLST);
88 }
89
90 if (list->isCirc && ln == list->lastPtr) {
91 ln = NilListNode;
92 } else {
93 ln = ln->nextPtr;
94 }
95 }
96
97 return (nl);
98}