|
|
1.1 ! root 1: /*- ! 2: * Copyright (c) 1982 The Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that: (1) source distributions retain this entire copyright ! 7: * notice and comment, and (2) distributions including binaries display ! 8: * the following acknowledgement: ``This product includes software ! 9: * developed by the University of California, Berkeley and its contributors'' ! 10: * in the documentation or other materials provided with the distribution ! 11: * and in all advertising materials mentioning features or use of this ! 12: * software. Neither the name of the University nor the names of its ! 13: * contributors may be used to endorse or promote products derived ! 14: * from this software without specific prior written permission. ! 15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 18: */ ! 19: ! 20: #ifndef lint ! 21: static char sccsid[] = "@(#)DFDISPOSE.c 4.4 (Berkeley) 4/9/90"; ! 22: #endif /* not lint */ ! 23: ! 24: /* ! 25: * Close all active files within a dynamic record, ! 26: * then dispose of the record. ! 27: */ ! 28: ! 29: #include "h00vars.h" ! 30: #include "libpc.h" ! 31: ! 32: DFDISPOSE(var, size) ! 33: char **var; /* pointer to pointer being deallocated */ ! 34: long size; /* sizeof(bletch) */ ! 35: { ! 36: register struct iorec *next, *prev; ! 37: struct iorec *start, *end; ! 38: ! 39: start = (struct iorec *)(*var); ! 40: end = (struct iorec *)(*var + size); ! 41: prev = (struct iorec *)(&_fchain); ! 42: next = _fchain.fchain; ! 43: while(next != FILNIL && (next->flev < GLVL || next < start)) { ! 44: prev = next; ! 45: next = next->fchain; ! 46: } ! 47: while(next != FILNIL && start <= next && next < end) ! 48: next = PFCLOSE(next, TRUE); ! 49: prev->fchain = next; ! 50: DISPOSE(var, size); ! 51: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.