freebsd-dev/usr.bin/make/lst.lib/lstForEachFrom.c

116 lines
3.5 KiB
C
Raw Normal View History

1994-05-27 12:33:43 +00:00
/*
* Copyright (c) 1988, 1989, 1990, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Adam de Boor.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
2000-07-09 00:08:47 +00:00
* @(#)lstForEachFrom.c 8.1 (Berkeley) 6/6/93
1994-05-27 12:33:43 +00:00
*/
#ifndef lint
2000-07-09 00:08:47 +00:00
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
1994-05-27 12:33:43 +00:00
#endif /* not lint */
/*-
* lstForEachFrom.c --
* Perform a given function on all elements of a list starting from
* a given point.
*/
#include "lstInt.h"
/*-
*-----------------------------------------------------------------------
* Lst_ForEachFrom --
* Apply the given function to each element of the given list. The
* function should return 0 if traversal should continue and non-
1995-05-30 06:41:30 +00:00
* zero if it should abort.
1994-05-27 12:33:43 +00:00
*
* Results:
* None.
*
* Side Effects:
* Only those created by the passed-in function.
*
*-----------------------------------------------------------------------
*/
/*VARARGS2*/
void
Lst_ForEachFrom (l, ln, proc, d)
Lst l;
LstNode ln;
2002-03-22 01:33:25 +00:00
register int (*proc)(void *, void *);
register void * d;
1994-05-27 12:33:43 +00:00
{
register ListNode tln = (ListNode)ln;
register List list = (List)l;
register ListNode next;
Boolean done;
int result;
1995-05-30 06:41:30 +00:00
1994-05-27 12:33:43 +00:00
if (!LstValid (list) || LstIsEmpty (list)) {
return;
}
1995-05-30 06:41:30 +00:00
1994-05-27 12:33:43 +00:00
do {
/*
* Take care of having the current element deleted out from under
* us.
*/
1995-05-30 06:41:30 +00:00
1994-05-27 12:33:43 +00:00
next = tln->nextPtr;
1995-05-30 06:41:30 +00:00
1994-05-27 12:33:43 +00:00
(void) tln->useCount++;
result = (*proc) (tln->datum, d);
(void) tln->useCount--;
/*
* We're done with the traversal if
* - nothing's been added after the current node and
* - the next node to examine is the first in the queue or
* doesn't exist.
*/
done = (next == tln->nextPtr &&
(next == NULL || next == list->firstPtr));
1995-05-30 06:41:30 +00:00
1994-05-27 12:33:43 +00:00
next = tln->nextPtr;
if (tln->flags & LN_DELETED) {
free((char *)tln);
}
tln = next;
} while (!result && !LstIsEmpty(list) && !done);
1995-05-30 06:41:30 +00:00
1994-05-27 12:33:43 +00:00
}