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 | * | |
ad787160 C |
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 | 38 | static char sccsid[] = "@(#)lstForEachFrom.c 8.1 (Berkeley) 6/6/93"; |
bb2109e7 KB |
39 | #endif /* not lint */ |
40 | ||
c65fedcf KB |
41 | /*- |
42 | * lstForEachFrom.c -- | |
43 | * Perform a given function on all elements of a list starting from | |
44 | * a given point. | |
c65fedcf | 45 | */ |
c65fedcf KB |
46 | |
47 | #include "lstInt.h" | |
48 | ||
49 | /*- | |
50 | *----------------------------------------------------------------------- | |
51 | * Lst_ForEachFrom -- | |
52 | * Apply the given function to each element of the given list. The | |
53 | * function should return 0 if traversal should continue and non- | |
54 | * zero if it should abort. | |
55 | * | |
56 | * Results: | |
57 | * None. | |
58 | * | |
59 | * Side Effects: | |
60 | * Only those created by the passed-in function. | |
61 | * | |
62 | *----------------------------------------------------------------------- | |
63 | */ | |
64 | /*VARARGS2*/ | |
65 | void | |
66 | Lst_ForEachFrom (l, ln, proc, d) | |
67 | Lst l; | |
68 | LstNode ln; | |
69 | register int (*proc)(); | |
70 | register ClientData d; | |
71 | { | |
72 | register ListNode tln = (ListNode)ln; | |
73 | register List list = (List)l; | |
74 | register ListNode next; | |
75 | Boolean done; | |
76 | int result; | |
77 | ||
78 | if (!LstValid (list) || LstIsEmpty (list)) { | |
79 | return; | |
80 | } | |
81 | ||
82 | do { | |
83 | /* | |
84 | * Take care of having the current element deleted out from under | |
85 | * us. | |
86 | */ | |
87 | ||
88 | next = tln->nextPtr; | |
89 | ||
2a310187 | 90 | (void) tln->useCount++; |
c65fedcf | 91 | result = (*proc) (tln->datum, d); |
2a310187 | 92 | (void) tln->useCount--; |
c65fedcf KB |
93 | |
94 | /* | |
95 | * We're done with the traversal if | |
96 | * - nothing's been added after the current node and | |
97 | * - the next node to examine is the first in the queue or | |
98 | * doesn't exist. | |
99 | */ | |
100 | done = (next == tln->nextPtr && | |
101 | (next == NilListNode || next == list->firstPtr)); | |
102 | ||
103 | next = tln->nextPtr; | |
104 | ||
105 | if (tln->flags & LN_DELETED) { | |
106 | free((char *)tln); | |
107 | } | |
108 | tln = next; | |
109 | } while (!result && !LstIsEmpty(list) && !done); | |
110 | ||
111 | } |