1 /*	$OpenBSD: lstForEachFrom.c,v 1.20 2015/10/14 13:52:11 espie Exp $	*/
2 /*	$NetBSD: lstForEachFrom.c,v 1.5 1996/11/06 17:59:42 christos Exp $	*/
3 
4 /*
5  * Copyright (c) 1988, 1989, 1990, 1993
6  *	The Regents of the University of California.  All rights reserved.
7  *
8  * This code is derived from software contributed to Berkeley by
9  * Adam de Boor.
10  *
11  * Redistribution and use in source and binary forms, with or without
12  * modification, are permitted provided that the following conditions
13  * are met:
14  * 1. Redistributions of source code must retain the above copyright
15  *    notice, this list of conditions and the following disclaimer.
16  * 2. Redistributions in binary form must reproduce the above copyright
17  *    notice, this list of conditions and the following disclaimer in the
18  *    documentation and/or other materials provided with the distribution.
19  * 3. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 /*-
37  * lstForEachFrom.c --
38  *	Perform a given function on all elements of a list starting from
39  *	a given point.
40  */
41 
42 #include	"lstInt.h"
43 #include	<stdlib.h>
44 
45 /*-
46  *-----------------------------------------------------------------------
47  * Lst_ForEachFrom --
48  *	Apply the given function to each element of the given list. The
49  *	function should return 0 if traversal should continue and non-
50  *	zero if it should abort.
51  *
52  * Side Effects:
53  *	Only those created by the passed-in function.
54  *-----------------------------------------------------------------------
55  */
56 void
Lst_ForEachFrom(LstNode ln,ForEachProc proc,void * d)57 Lst_ForEachFrom(LstNode ln, ForEachProc proc, void *d)
58 {
59 	LstNode	tln;
60 
61 	for (tln = ln; tln != NULL; tln = tln->nextPtr)
62 		(*proc)(tln->datum, d);
63 }
64 
65 void
Lst_Every(Lst l,SimpleProc proc)66 Lst_Every(Lst l, SimpleProc proc)
67 {
68 	LstNode tln;
69 
70 	for (tln = l->firstPtr; tln != NULL; tln = tln->nextPtr)
71 		(*proc)(tln->datum);
72 }
73