VirtualBox

source: kBuild/branches/FREEBSD/src/kmk/lst.lib/lstForEachFrom.c@ 10

Last change on this file since 10 was 9, checked in by bird, 22 years ago

Initial revision

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 3.6 KB
Line 
1/*
2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Adam de Boor.
7 *
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.
35 *
36 * @(#)lstForEachFrom.c 8.1 (Berkeley) 6/6/93
37 */
38
39#ifndef lint
40#include <sys/cdefs.h>
41__FBSDID("$FreeBSD: src/usr.bin/make/lst.lib/lstForEachFrom.c,v 1.12 2002/10/09 02:00:22 jmallett Exp $");
42#endif /* not lint */
43
44/*-
45 * lstForEachFrom.c --
46 * Perform a given function on all elements of a list starting from
47 * a given point.
48 */
49
50#include "lstInt.h"
51
52/*-
53 *-----------------------------------------------------------------------
54 * Lst_ForEachFrom --
55 * Apply the given function to each element of the given list. The
56 * function should return 0 if traversal should continue and non-
57 * zero if it should abort.
58 *
59 * Results:
60 * None.
61 *
62 * Side Effects:
63 * Only those created by the passed-in function.
64 *
65 *-----------------------------------------------------------------------
66 */
67/*VARARGS2*/
68void
69Lst_ForEachFrom (l, ln, proc, d)
70 Lst l;
71 LstNode ln;
72 register int (*proc)(void *, void *);
73 register void * d;
74{
75 register ListNode tln = (ListNode)ln;
76 register List list = (List)l;
77 register ListNode next;
78 Boolean done;
79 int result;
80
81 if (!LstValid (list) || LstIsEmpty (list)) {
82 return;
83 }
84
85 do {
86 /*
87 * Take care of having the current element deleted out from under
88 * us.
89 */
90
91 next = tln->nextPtr;
92
93 (void) tln->useCount++;
94 result = (*proc) (tln->datum, d);
95 (void) tln->useCount--;
96
97 /*
98 * We're done with the traversal if
99 * - nothing's been added after the current node and
100 * - the next node to examine is the first in the queue or
101 * doesn't exist.
102 */
103 done = (next == tln->nextPtr &&
104 (next == NULL || next == list->firstPtr));
105
106 next = tln->nextPtr;
107
108 if (tln->flags & LN_DELETED) {
109 free((char *)tln);
110 }
111 tln = next;
112 } while (!result && !LstIsEmpty(list) && !done);
113
114}
115
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette