105 lines
3.3 KiB
C
105 lines
3.3 KiB
C
/*
|
|
* 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.
|
|
*
|
|
* $Id$
|
|
*/
|
|
|
|
#ifndef lint
|
|
static char sccsid[] = "@(#)lstDestroy.c 8.1 (Berkeley) 6/6/93";
|
|
#endif /* not lint */
|
|
|
|
/*-
|
|
* LstDestroy.c --
|
|
* Nuke a list and all its resources
|
|
*/
|
|
|
|
#include "lstInt.h"
|
|
|
|
/*-
|
|
*-----------------------------------------------------------------------
|
|
* Lst_Destroy --
|
|
* Destroy a list and free all its resources. If the freeProc is
|
|
* given, it is called with the datum from each node in turn before
|
|
* the node is freed.
|
|
*
|
|
* Results:
|
|
* None.
|
|
*
|
|
* Side Effects:
|
|
* The given list is freed in its entirety.
|
|
*
|
|
*-----------------------------------------------------------------------
|
|
*/
|
|
void
|
|
Lst_Destroy (l, freeProc)
|
|
Lst l;
|
|
register void (*freeProc) __P((ClientData));
|
|
{
|
|
register ListNode ln;
|
|
register ListNode tln = NilListNode;
|
|
register List list = (List)l;
|
|
|
|
if (l == NILLST || ! l) {
|
|
/*
|
|
* Note the check for l == (Lst)0 to catch uninitialized static Lst's.
|
|
* Gross, but useful.
|
|
*/
|
|
return;
|
|
}
|
|
|
|
/* To ease scanning */
|
|
if (list->lastPtr != NilListNode)
|
|
list->lastPtr->nextPtr = NilListNode;
|
|
else {
|
|
free ((Address)l);
|
|
return;
|
|
}
|
|
|
|
if (freeProc) {
|
|
for (ln = list->firstPtr; ln != NilListNode; ln = tln) {
|
|
tln = ln->nextPtr;
|
|
(*freeProc) (ln->datum);
|
|
free ((Address)ln);
|
|
}
|
|
} else {
|
|
for (ln = list->firstPtr; ln != NilListNode; ln = tln) {
|
|
tln = ln->nextPtr;
|
|
free ((Address)ln);
|
|
}
|
|
}
|
|
|
|
free ((Address)l);
|
|
}
|