1*2e2caf59SThomas Veerman /* $NetBSD: lstForEachFrom.c,v 1.17 2009/01/23 21:26:30 dsl Exp $ */
2*2e2caf59SThomas Veerman
3*2e2caf59SThomas Veerman /*
4*2e2caf59SThomas Veerman * Copyright (c) 1988, 1989, 1990, 1993
5*2e2caf59SThomas Veerman * The Regents of the University of California. All rights reserved.
6*2e2caf59SThomas Veerman *
7*2e2caf59SThomas Veerman * This code is derived from software contributed to Berkeley by
8*2e2caf59SThomas Veerman * Adam de Boor.
9*2e2caf59SThomas Veerman *
10*2e2caf59SThomas Veerman * Redistribution and use in source and binary forms, with or without
11*2e2caf59SThomas Veerman * modification, are permitted provided that the following conditions
12*2e2caf59SThomas Veerman * are met:
13*2e2caf59SThomas Veerman * 1. Redistributions of source code must retain the above copyright
14*2e2caf59SThomas Veerman * notice, this list of conditions and the following disclaimer.
15*2e2caf59SThomas Veerman * 2. Redistributions in binary form must reproduce the above copyright
16*2e2caf59SThomas Veerman * notice, this list of conditions and the following disclaimer in the
17*2e2caf59SThomas Veerman * documentation and/or other materials provided with the distribution.
18*2e2caf59SThomas Veerman * 3. Neither the name of the University nor the names of its contributors
19*2e2caf59SThomas Veerman * may be used to endorse or promote products derived from this software
20*2e2caf59SThomas Veerman * without specific prior written permission.
21*2e2caf59SThomas Veerman *
22*2e2caf59SThomas Veerman * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23*2e2caf59SThomas Veerman * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24*2e2caf59SThomas Veerman * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25*2e2caf59SThomas Veerman * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26*2e2caf59SThomas Veerman * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27*2e2caf59SThomas Veerman * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28*2e2caf59SThomas Veerman * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29*2e2caf59SThomas Veerman * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30*2e2caf59SThomas Veerman * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31*2e2caf59SThomas Veerman * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32*2e2caf59SThomas Veerman * SUCH DAMAGE.
33*2e2caf59SThomas Veerman */
34*2e2caf59SThomas Veerman
35*2e2caf59SThomas Veerman #ifndef MAKE_NATIVE
36*2e2caf59SThomas Veerman static char rcsid[] = "$NetBSD: lstForEachFrom.c,v 1.17 2009/01/23 21:26:30 dsl Exp $";
37*2e2caf59SThomas Veerman #else
38*2e2caf59SThomas Veerman #include <sys/cdefs.h>
39*2e2caf59SThomas Veerman #ifndef lint
40*2e2caf59SThomas Veerman #if 0
41*2e2caf59SThomas Veerman static char sccsid[] = "@(#)lstForEachFrom.c 8.1 (Berkeley) 6/6/93";
42*2e2caf59SThomas Veerman #else
43*2e2caf59SThomas Veerman __RCSID("$NetBSD: lstForEachFrom.c,v 1.17 2009/01/23 21:26:30 dsl Exp $");
44*2e2caf59SThomas Veerman #endif
45*2e2caf59SThomas Veerman #endif /* not lint */
46*2e2caf59SThomas Veerman #endif
47*2e2caf59SThomas Veerman
48*2e2caf59SThomas Veerman /*-
49*2e2caf59SThomas Veerman * lstForEachFrom.c --
50*2e2caf59SThomas Veerman * Perform a given function on all elements of a list starting from
51*2e2caf59SThomas Veerman * a given point.
52*2e2caf59SThomas Veerman */
53*2e2caf59SThomas Veerman
54*2e2caf59SThomas Veerman #include "lstInt.h"
55*2e2caf59SThomas Veerman
56*2e2caf59SThomas Veerman /*-
57*2e2caf59SThomas Veerman *-----------------------------------------------------------------------
58*2e2caf59SThomas Veerman * Lst_ForEachFrom --
59*2e2caf59SThomas Veerman * Apply the given function to each element of the given list. The
60*2e2caf59SThomas Veerman * function should return 0 if traversal should continue and non-
61*2e2caf59SThomas Veerman * zero if it should abort.
62*2e2caf59SThomas Veerman *
63*2e2caf59SThomas Veerman * Results:
64*2e2caf59SThomas Veerman * None.
65*2e2caf59SThomas Veerman *
66*2e2caf59SThomas Veerman * Side Effects:
67*2e2caf59SThomas Veerman * Only those created by the passed-in function.
68*2e2caf59SThomas Veerman *
69*2e2caf59SThomas Veerman *-----------------------------------------------------------------------
70*2e2caf59SThomas Veerman */
71*2e2caf59SThomas Veerman /*VARARGS2*/
72*2e2caf59SThomas Veerman int
Lst_ForEachFrom(Lst l,LstNode ln,int (* proc)(void *,void *),void * d)73*2e2caf59SThomas Veerman Lst_ForEachFrom(Lst l, LstNode ln, int (*proc)(void *, void *),
74*2e2caf59SThomas Veerman void *d)
75*2e2caf59SThomas Veerman {
76*2e2caf59SThomas Veerman ListNode tln = ln;
77*2e2caf59SThomas Veerman List list = l;
78*2e2caf59SThomas Veerman ListNode next;
79*2e2caf59SThomas Veerman Boolean done;
80*2e2caf59SThomas Veerman int result;
81*2e2caf59SThomas Veerman
82*2e2caf59SThomas Veerman if (!LstValid (list) || LstIsEmpty (list)) {
83*2e2caf59SThomas Veerman return 0;
84*2e2caf59SThomas Veerman }
85*2e2caf59SThomas Veerman
86*2e2caf59SThomas Veerman do {
87*2e2caf59SThomas Veerman /*
88*2e2caf59SThomas Veerman * Take care of having the current element deleted out from under
89*2e2caf59SThomas Veerman * us.
90*2e2caf59SThomas Veerman */
91*2e2caf59SThomas Veerman
92*2e2caf59SThomas Veerman next = tln->nextPtr;
93*2e2caf59SThomas Veerman
94*2e2caf59SThomas Veerman /*
95*2e2caf59SThomas Veerman * We're done with the traversal if
96*2e2caf59SThomas Veerman * - the next node to examine is the first in the queue or
97*2e2caf59SThomas Veerman * doesn't exist and
98*2e2caf59SThomas Veerman * - nothing's been added after the current node (check this
99*2e2caf59SThomas Veerman * after proc() has been called).
100*2e2caf59SThomas Veerman */
101*2e2caf59SThomas Veerman done = (next == NULL || next == list->firstPtr);
102*2e2caf59SThomas Veerman
103*2e2caf59SThomas Veerman (void) tln->useCount++;
104*2e2caf59SThomas Veerman result = (*proc) (tln->datum, d);
105*2e2caf59SThomas Veerman (void) tln->useCount--;
106*2e2caf59SThomas Veerman
107*2e2caf59SThomas Veerman /*
108*2e2caf59SThomas Veerman * Now check whether a node has been added.
109*2e2caf59SThomas Veerman * Note: this doesn't work if this node was deleted before
110*2e2caf59SThomas Veerman * the new node was added.
111*2e2caf59SThomas Veerman */
112*2e2caf59SThomas Veerman if (next != tln->nextPtr) {
113*2e2caf59SThomas Veerman next = tln->nextPtr;
114*2e2caf59SThomas Veerman done = 0;
115*2e2caf59SThomas Veerman }
116*2e2caf59SThomas Veerman
117*2e2caf59SThomas Veerman if (tln->flags & LN_DELETED) {
118*2e2caf59SThomas Veerman free((char *)tln);
119*2e2caf59SThomas Veerman }
120*2e2caf59SThomas Veerman tln = next;
121*2e2caf59SThomas Veerman } while (!result && !LstIsEmpty(list) && !done);
122*2e2caf59SThomas Veerman
123*2e2caf59SThomas Veerman return result;
124*2e2caf59SThomas Veerman }
125*2e2caf59SThomas Veerman
126