1 /* $OpenBSD: lstDestroy.c,v 1.20 2010/07/19 19:46:44 espie Exp $ */
2 /* $NetBSD: lstDestroy.c,v 1.6 1996/11/06 17:59:37 christos Exp $ */
3
4 /*
5 * Copyright (c) 1988, 1989, 1990, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * Adam de Boor.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36 /*-
37 * LstDestroy.c --
38 * Nuke a list and all its resources
39 */
40
41 #include "lstInt.h"
42 #include <stdlib.h>
43
44 /*-
45 *-----------------------------------------------------------------------
46 * Lst_Destroy --
47 * Destroy a list and free all its resources. If the freeProc is
48 * given, it is called with the datum from each node in turn before
49 * the node is freed.
50 *
51 * Side Effects:
52 * The given list is freed in its entirety.
53 *
54 *-----------------------------------------------------------------------
55 */
56 void
Lst_Destroy(Lst l,SimpleProc freeProc)57 Lst_Destroy(Lst l, SimpleProc freeProc)
58 {
59 LstNode ln;
60 LstNode tln;
61
62 if (freeProc) {
63 for (ln = l->firstPtr; ln != NULL; ln = tln) {
64 tln = ln->nextPtr;
65 (*freeProc)(ln->datum);
66 free(ln);
67 }
68 } else {
69 for (ln = l->firstPtr; ln != NULL; ln = tln) {
70 tln = ln->nextPtr;
71 free(ln);
72 }
73 }
74 }
75
76