1 /* $OpenPackages$ */ 2 /* $OpenBSD: lstDestroy.c,v 1.15 2003/06/03 02:56:12 millert Exp $ */ 3 /* $NetBSD: lstDestroy.c,v 1.6 1996/11/06 17:59:37 christos Exp $ */ 4 5 /* 6 * Copyright (c) 1988, 1989, 1990, 1993 7 * The Regents of the University of California. All rights reserved. 8 * 9 * This code is derived from software contributed to Berkeley by 10 * Adam de Boor. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. 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 37 /*- 38 * LstDestroy.c -- 39 * Nuke a list and all its resources 40 */ 41 42 #include "lstInt.h" 43 #include <stdlib.h> 44 45 /*- 46 *----------------------------------------------------------------------- 47 * Lst_Destroy -- 48 * Destroy a list and free all its resources. If the freeProc is 49 * given, it is called with the datum from each node in turn before 50 * the node is freed. 51 * 52 * Side Effects: 53 * The given list is freed in its entirety. 54 * 55 *----------------------------------------------------------------------- 56 */ 57 void 58 Lst_Destroy(l, freeProc) 59 Lst l; 60 SimpleProc freeProc; 61 { 62 LstNode ln; 63 LstNode tln; 64 65 if (freeProc) { 66 for (ln = l->firstPtr; ln != NULL; ln = tln) { 67 tln = ln->nextPtr; 68 (*freeProc)(ln->datum); 69 free(ln); 70 } 71 } else { 72 for (ln = l->firstPtr; ln != NULL; ln = tln) { 73 tln = ln->nextPtr; 74 free(ln); 75 } 76 } 77 } 78 79