1 /* $OpenPackages$ */
2 /* $OpenBSD: lstForEachFrom.c,v 1.15 2007/01/04 17:55:35 espie Exp $ */
3 /* $NetBSD: lstForEachFrom.c,v 1.5 1996/11/06 17:59:42 christos Exp $ */
4
5 /*
6 * Copyright (c) 1988, 1989, 1990, 1993
7 * The Regents of the University of California. All rights reserved.
8 *
9 * This code is derived from software contributed to Berkeley by
10 * Adam de Boor.
11 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. 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 /*-
38 * lstForEachFrom.c --
39 * Perform a given function on all elements of a list starting from
40 * a given point.
41 */
42
43 #include "lstInt.h"
44 #include <stdlib.h>
45
46 /*-
47 *-----------------------------------------------------------------------
48 * Lst_ForEachFrom --
49 * Apply the given function to each element of the given list. The
50 * function should return 0 if traversal should continue and non-
51 * zero if it should abort.
52 *
53 * Side Effects:
54 * Only those created by the passed-in function.
55 *-----------------------------------------------------------------------
56 */
57 void
Lst_ForEachFrom(LstNode ln,ForEachProc proc,void * d)58 Lst_ForEachFrom(LstNode ln, ForEachProc proc, void *d)
59 {
60 LstNode tln;
61
62 for (tln = ln; tln != NULL; tln = tln->nextPtr)
63 (*proc)(tln->datum, d);
64 }
65
66 void
Lst_Every(Lst l,SimpleProc proc)67 Lst_Every(Lst l, SimpleProc proc)
68 {
69 LstNode tln;
70
71 for (tln = l->firstPtr; tln != NULL; tln = tln->nextPtr)
72 (*proc)(tln->datum);
73 }
74
75 void
Lst_ForEachNodeWhile(Lst l,ForEachNodeWhileProc proc,void * d)76 Lst_ForEachNodeWhile(Lst l, ForEachNodeWhileProc proc, void *d)
77 {
78 LstNode it;
79
80 for (it = l->firstPtr; it != NULL; it = it->nextPtr)
81 if ((*proc)(it, d) == 0)
82 return;
83 }
84