73 lines
1.8 KiB
C
73 lines
1.8 KiB
C
/*-
|
|
* LstDestroy.c --
|
|
* Nuke a list and all its resources
|
|
*
|
|
* Copyright (c) 1988 by University of California Regents
|
|
*
|
|
* Permission to use, copy, modify, and distribute this
|
|
* software and its documentation for any purpose and without
|
|
* fee is hereby granted, provided that the above copyright
|
|
* notice appears in all copies. Neither the University of California nor
|
|
* Adam de Boor makes any representations about the suitability of this
|
|
* software for any purpose. It is provided "as is" without
|
|
* express or implied warranty.
|
|
*/
|
|
#if !defined(lint) && defined(keep_rcsid)
|
|
static char *rcsid =
|
|
"Id: lstDestroy.c,v 1.5 88/11/17 20:52:15 adam Exp $ SPRITE (Berkeley)";
|
|
#endif lint
|
|
|
|
#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)();
|
|
{
|
|
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;
|
|
}
|
|
|
|
if (freeProc) {
|
|
for (ln = list->firstPtr;
|
|
ln != NilListNode && tln != list->firstPtr;
|
|
ln = tln) {
|
|
tln = ln->nextPtr;
|
|
(*freeProc) (ln->datum);
|
|
free ((Address)ln);
|
|
}
|
|
} else {
|
|
for (ln = list->firstPtr;
|
|
ln != NilListNode && tln != list->firstPtr;
|
|
ln = tln) {
|
|
tln = ln->nextPtr;
|
|
free ((Address)ln);
|
|
}
|
|
}
|
|
|
|
free ((Address)l);
|
|
}
|