1 /* 2 * Copyright (c) 1981 Regents of the University of California. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 static char sccsid[] = "@(#)delwin.c 5.4 (Berkeley) 6/1/90"; 36 #endif /* not lint */ 37 38 # include "curses.ext" 39 40 /* 41 * This routine deletes a window and releases it back to the system. 42 * 43 */ 44 delwin(win) 45 reg WINDOW *win; { 46 47 reg int i; 48 reg WINDOW *wp, *np; 49 50 if (win->_orig == NULL) { 51 /* 52 * If we are the original window, delete the space for 53 * all the subwindows, and the array of space as well. 54 */ 55 for (i = 0; i < win->_maxy && win->_y[i]; i++) 56 free(win->_y[i]); 57 free(win->_firstch); 58 free(win->_lastch); 59 wp = win->_nextp; 60 while (wp != win) { 61 np = wp->_nextp; 62 delwin(wp); 63 wp = np; 64 } 65 } 66 else { 67 /* 68 * If we are a subwindow, take ourselves out of the 69 * list. NOTE: if we are a subwindow, the minimum list 70 * is orig followed by this subwindow, so there are 71 * always at least two windows in the list. 72 */ 73 for (wp = win->_nextp; wp->_nextp != win; wp = wp->_nextp) 74 continue; 75 wp->_nextp = win->_nextp; 76 } 77 free(win->_y); 78 free(win); 79 } 80