VirtualBox

source: kBuild/trunk/src/kmk/lst.lib/lstForEachFrom.c@ 25

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

This commit was generated by cvs2svn to compensate for changes in r24,
which included commits to RCS files with non-trunk default branches.

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