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