|
|
1.1 ! root 1: /* freblk.c ! 2: Free up an entire memory block. ! 3: ! 4: Copyright (C) 1992 Ian Lance Taylor ! 5: ! 6: This file is part of the Taylor UUCP uuconf library. ! 7: ! 8: This library is free software; you can redistribute it and/or ! 9: modify it under the terms of the GNU Library General Public License ! 10: as published by the Free Software Foundation; either version 2 of ! 11: the License, or (at your option) any later version. ! 12: ! 13: This library is distributed in the hope that it will be useful, but ! 14: WITHOUT ANY WARRANTY; without even the implied warranty of ! 15: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ! 16: Library General Public License for more details. ! 17: ! 18: You should have received a copy of the GNU Library General Public ! 19: License along with this library; if not, write to the Free Software ! 20: Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. ! 21: ! 22: The author of the program may be contacted at [email protected] or ! 23: c/o Infinity Development Systems, P.O. Box 520, Waltham, MA 02254. ! 24: */ ! 25: ! 26: #include "uucnfi.h" ! 27: ! 28: #if USE_RCS_ID ! 29: const char _uuconf_freblk_rcsid[] = "$Id: freblk.c,v 1.1 93/07/30 08:07:10 bin Exp Locker: bin $"; ! 30: #endif ! 31: ! 32: #include "alloc.h" ! 33: ! 34: /* Free up an entire memory block. */ ! 35: ! 36: #if UUCONF_ANSI_C ! 37: void ! 38: #endif ! 39: uuconf_free_block (pblock) ! 40: pointer pblock; ! 41: { ! 42: struct sblock *q = (struct sblock *) pblock; ! 43: struct sblock *qloop; ! 44: ! 45: /* We have to free the added blocks first because the list may link ! 46: into blocks that are earlier on the list. */ ! 47: for (qloop = q; qloop != NULL; qloop = qloop->qnext) ! 48: { ! 49: struct sadded *qadd; ! 50: ! 51: for (qadd = qloop->qadded; qadd != NULL; qadd = qadd->qnext) ! 52: free (qadd->padded); ! 53: } ! 54: ! 55: while (q != NULL) ! 56: { ! 57: struct sblock *qnext; ! 58: ! 59: qnext = q->qnext; ! 60: free ((pointer) q); ! 61: q = qnext; ! 62: } ! 63: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.