/* $OpenBSD: lstForEachFrom.c,v 1.19 2010/07/19 19:46:44 espie Exp $ */ /* $NetBSD: lstForEachFrom.c,v 1.5 1996/11/06 17:59:42 christos Exp $ */ /* * 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. 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. */ /*- * lstForEachFrom.c -- * Perform a given function on all elements of a list starting from * a given point. */ #include "lstInt.h" #include /*- *----------------------------------------------------------------------- * Lst_ForEachFrom -- * Apply the given function to each element of the given list. The * function should return 0 if traversal should continue and non- * zero if it should abort. * * Side Effects: * Only those created by the passed-in function. *----------------------------------------------------------------------- */ void Lst_ForEachFrom(LstNode ln, ForEachProc proc, void *d) { LstNode tln; for (tln = ln; tln != NULL; tln = tln->nextPtr) (*proc)(tln->datum, d); } void Lst_Every(Lst l, SimpleProc proc) { LstNode tln; for (tln = l->firstPtr; tln != NULL; tln = tln->nextPtr) (*proc)(tln->datum); } void Lst_ForEachNodeWhile(Lst l, ForEachNodeWhileProc proc, void *d) { LstNode it; for (it = l->firstPtr; it != NULL; it = it->nextPtr) if ((*proc)(it, d) == 0) return; }