projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| bb2109e7 KB |
1 | /* |
| 2 | * Copyright (c) 1988, 1989, 1990 The Regents of the University of California. | |
| 3 | * All rights reserved. | |
| c65fedcf | 4 | * |
| bb2109e7 KB |
5 | * This code is derived from software contributed to Berkeley by |
| 6 | * Adam de Boor. | |
| c65fedcf | 7 | * |
| c0567266 KB |
8 | * Redistribution and use in source and binary forms, with or without |
| 9 | * modification, are permitted provided that the following conditions | |
| 10 | * are met: | |
| 11 | * 1. Redistributions of source code must retain the above copyright | |
| 12 | * notice, this list of conditions and the following disclaimer. | |
| 13 | * 2. Redistributions in binary form must reproduce the above copyright | |
| 14 | * notice, this list of conditions and the following disclaimer in the | |
| 15 | * documentation and/or other materials provided with the distribution. | |
| 16 | * 3. All advertising materials mentioning features or use of this software | |
| 17 | * must display the following acknowledgement: | |
| 18 | * This product includes software developed by the University of | |
| 19 | * California, Berkeley and its contributors. | |
| 20 | * 4. 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. | |
| c65fedcf | 35 | */ |
| bb2109e7 | 36 | |
| c65fedcf | 37 | #ifndef lint |
| 1c15e888 | 38 | static char sccsid[] = "@(#)lstDestroy.c 5.3 (Berkeley) 6/1/90"; |
| bb2109e7 KB |
39 | #endif /* not lint */ |
| 40 | ||
| 41 | /*- | |
| 42 | * LstDestroy.c -- | |
| 43 | * Nuke a list and all its resources | |
| 44 | */ | |
| c65fedcf KB |
45 | |
| 46 | #include "lstInt.h" | |
| 47 | ||
| 48 | /*- | |
| 49 | *----------------------------------------------------------------------- | |
| 50 | * Lst_Destroy -- | |
| 51 | * Destroy a list and free all its resources. If the freeProc is | |
| 52 | * given, it is called with the datum from each node in turn before | |
| 53 | * the node is freed. | |
| 54 | * | |
| 55 | * Results: | |
| 56 | * None. | |
| 57 | * | |
| 58 | * Side Effects: | |
| 59 | * The given list is freed in its entirety. | |
| 60 | * | |
| 61 | *----------------------------------------------------------------------- | |
| 62 | */ | |
| 63 | void | |
| 64 | Lst_Destroy (l, freeProc) | |
| 65 | Lst l; | |
| 66 | register void (*freeProc)(); | |
| 67 | { | |
| 68 | register ListNode ln; | |
| 69 | register ListNode tln = NilListNode; | |
| 70 | register List list = (List)l; | |
| 71 | ||
| 72 | if (l == NILLST || ! l) { | |
| 73 | /* | |
| 74 | * Note the check for l == (Lst)0 to catch uninitialized static Lst's. | |
| 75 | * Gross, but useful. | |
| 76 | */ | |
| 77 | return; | |
| 78 | } | |
| 79 | ||
| 80 | if (freeProc) { | |
| 81 | for (ln = list->firstPtr; | |
| 82 | ln != NilListNode && tln != list->firstPtr; | |
| 83 | ln = tln) { | |
| 84 | tln = ln->nextPtr; | |
| 85 | (*freeProc) (ln->datum); | |
| 86 | free ((Address)ln); | |
| 87 | } | |
| 88 | } else { | |
| 89 | for (ln = list->firstPtr; | |
| 90 | ln != NilListNode && tln != list->firstPtr; | |
| 91 | ln = tln) { | |
| 92 | tln = ln->nextPtr; | |
| 93 | free ((Address)ln); | |
| 94 | } | |
| 95 | } | |
| 96 | ||
| 97 | free ((Address)l); | |
| 98 | } |