1236769Sobrien/*	$NetBSD: lstDestroy.c,v 1.16 2008/12/13 15:19:29 dsl Exp $	*/
2236769Sobrien
3236769Sobrien/*
4236769Sobrien * Copyright (c) 1988, 1989, 1990, 1993
5236769Sobrien *	The Regents of the University of California.  All rights reserved.
6236769Sobrien *
7236769Sobrien * This code is derived from software contributed to Berkeley by
8236769Sobrien * Adam de Boor.
9236769Sobrien *
10236769Sobrien * Redistribution and use in source and binary forms, with or without
11236769Sobrien * modification, are permitted provided that the following conditions
12236769Sobrien * are met:
13236769Sobrien * 1. Redistributions of source code must retain the above copyright
14236769Sobrien *    notice, this list of conditions and the following disclaimer.
15236769Sobrien * 2. Redistributions in binary form must reproduce the above copyright
16236769Sobrien *    notice, this list of conditions and the following disclaimer in the
17236769Sobrien *    documentation and/or other materials provided with the distribution.
18236769Sobrien * 3. Neither the name of the University nor the names of its contributors
19236769Sobrien *    may be used to endorse or promote products derived from this software
20236769Sobrien *    without specific prior written permission.
21236769Sobrien *
22236769Sobrien * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23236769Sobrien * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24236769Sobrien * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25236769Sobrien * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26236769Sobrien * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27236769Sobrien * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28236769Sobrien * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29236769Sobrien * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30236769Sobrien * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31236769Sobrien * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32236769Sobrien * SUCH DAMAGE.
33236769Sobrien */
34236769Sobrien
35236769Sobrien#ifndef MAKE_NATIVE
36236769Sobrienstatic char rcsid[] = "$NetBSD: lstDestroy.c,v 1.16 2008/12/13 15:19:29 dsl Exp $";
37236769Sobrien#else
38236769Sobrien#include <sys/cdefs.h>
39236769Sobrien#ifndef lint
40236769Sobrien#if 0
41236769Sobrienstatic char sccsid[] = "@(#)lstDestroy.c	8.1 (Berkeley) 6/6/93";
42236769Sobrien#else
43236769Sobrien__RCSID("$NetBSD: lstDestroy.c,v 1.16 2008/12/13 15:19:29 dsl Exp $");
44236769Sobrien#endif
45236769Sobrien#endif /* not lint */
46236769Sobrien#endif
47236769Sobrien
48236769Sobrien/*-
49236769Sobrien * LstDestroy.c --
50236769Sobrien *	Nuke a list and all its resources
51236769Sobrien */
52236769Sobrien
53236769Sobrien#include	"lstInt.h"
54236769Sobrien
55236769Sobrien/*-
56236769Sobrien *-----------------------------------------------------------------------
57236769Sobrien * Lst_Destroy --
58236769Sobrien *	Destroy a list and free all its resources. If the freeProc is
59236769Sobrien *	given, it is called with the datum from each node in turn before
60236769Sobrien *	the node is freed.
61236769Sobrien *
62236769Sobrien * Results:
63236769Sobrien *	None.
64236769Sobrien *
65236769Sobrien * Side Effects:
66236769Sobrien *	The given list is freed in its entirety.
67236769Sobrien *
68236769Sobrien *-----------------------------------------------------------------------
69236769Sobrien */
70236769Sobrienvoid
71236769SobrienLst_Destroy(Lst list, FreeProc *freeProc)
72236769Sobrien{
73236769Sobrien    ListNode	ln;
74236769Sobrien    ListNode	tln = NULL;
75236769Sobrien
76236769Sobrien    if (list == NULL)
77236769Sobrien	return;
78236769Sobrien
79236769Sobrien    /* To ease scanning */
80236769Sobrien    if (list->lastPtr != NULL)
81236769Sobrien	list->lastPtr->nextPtr = NULL;
82236769Sobrien    else {
83236769Sobrien	free(list);
84236769Sobrien	return;
85236769Sobrien    }
86236769Sobrien
87236769Sobrien    if (freeProc) {
88236769Sobrien	for (ln = list->firstPtr; ln != NULL; ln = tln) {
89236769Sobrien	     tln = ln->nextPtr;
90236769Sobrien	     freeProc(ln->datum);
91236769Sobrien	     free(ln);
92236769Sobrien	}
93236769Sobrien    } else {
94236769Sobrien	for (ln = list->firstPtr; ln != NULL; ln = tln) {
95236769Sobrien	     tln = ln->nextPtr;
96236769Sobrien	     free(ln);
97236769Sobrien	}
98236769Sobrien    }
99236769Sobrien
100236769Sobrien    free(list);
101236769Sobrien}
102