1*0Sstevel@tonic-gate /*
2*0Sstevel@tonic-gate * CDDL HEADER START
3*0Sstevel@tonic-gate *
4*0Sstevel@tonic-gate * The contents of this file are subject to the terms of the
5*0Sstevel@tonic-gate * Common Development and Distribution License, Version 1.0 only
6*0Sstevel@tonic-gate * (the "License"). You may not use this file except in compliance
7*0Sstevel@tonic-gate * with the License.
8*0Sstevel@tonic-gate *
9*0Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*0Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing.
11*0Sstevel@tonic-gate * See the License for the specific language governing permissions
12*0Sstevel@tonic-gate * and limitations under the License.
13*0Sstevel@tonic-gate *
14*0Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each
15*0Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*0Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the
17*0Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying
18*0Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner]
19*0Sstevel@tonic-gate *
20*0Sstevel@tonic-gate * CDDL HEADER END
21*0Sstevel@tonic-gate */
22*0Sstevel@tonic-gate /*
23*0Sstevel@tonic-gate * Copyright 1997 Sun Microsystems, Inc. All rights reserved.
24*0Sstevel@tonic-gate * Use is subject to license terms.
25*0Sstevel@tonic-gate */
26*0Sstevel@tonic-gate
27*0Sstevel@tonic-gate /* Copyright (c) 1988 AT&T */
28*0Sstevel@tonic-gate /* All Rights Reserved */
29*0Sstevel@tonic-gate
30*0Sstevel@tonic-gate /*
31*0Sstevel@tonic-gate * University Copyright- Copyright (c) 1982, 1986, 1988
32*0Sstevel@tonic-gate * The Regents of the University of California
33*0Sstevel@tonic-gate * All Rights Reserved
34*0Sstevel@tonic-gate *
35*0Sstevel@tonic-gate * University Acknowledgment- Portions of this document are derived from
36*0Sstevel@tonic-gate * software developed by the University of California, Berkeley, and its
37*0Sstevel@tonic-gate * contributors.
38*0Sstevel@tonic-gate */
39*0Sstevel@tonic-gate
40*0Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI"
41*0Sstevel@tonic-gate
42*0Sstevel@tonic-gate /*LINTLIBRARY*/
43*0Sstevel@tonic-gate
44*0Sstevel@tonic-gate #include <stdlib.h>
45*0Sstevel@tonic-gate #include <sys/types.h>
46*0Sstevel@tonic-gate #include "curses_inc.h"
47*0Sstevel@tonic-gate
48*0Sstevel@tonic-gate /* This routine deletes a _window and releases it back to the system. */
49*0Sstevel@tonic-gate
50*0Sstevel@tonic-gate int
delwin(WINDOW * win)51*0Sstevel@tonic-gate delwin(WINDOW *win)
52*0Sstevel@tonic-gate {
53*0Sstevel@tonic-gate int i;
54*0Sstevel@tonic-gate WINDOW *par;
55*0Sstevel@tonic-gate
56*0Sstevel@tonic-gate /* If we have children don't delte the window. */
57*0Sstevel@tonic-gate if (win->_ndescs > 0)
58*0Sstevel@tonic-gate return (ERR);
59*0Sstevel@tonic-gate
60*0Sstevel@tonic-gate /*
61*0Sstevel@tonic-gate * If window is a pad, delete the padwin associated with it.
62*0Sstevel@tonic-gate * NOTE: We shouldn't care that the recursive call will decrement
63*0Sstevel@tonic-gate * ndescs for this window, since the window will be deleted anyhow.
64*0Sstevel@tonic-gate */
65*0Sstevel@tonic-gate
66*0Sstevel@tonic-gate if (win->_padwin) {
67*0Sstevel@tonic-gate win->_padwin->_maxy = win->_maxy;
68*0Sstevel@tonic-gate (void) delwin(win->_padwin);
69*0Sstevel@tonic-gate }
70*0Sstevel@tonic-gate if (win->_parent == NULL) {
71*0Sstevel@tonic-gate /* Delete all the memory associated with this window. */
72*0Sstevel@tonic-gate for (i = win->_maxy; i-- > 0; ) {
73*0Sstevel@tonic-gate free((char *)win->_y[i]);
74*0Sstevel@tonic-gate #ifdef _VR3_COMPAT_CODE
75*0Sstevel@tonic-gate if (_y16update)
76*0Sstevel@tonic-gate free((char *)win->_y16[i]);
77*0Sstevel@tonic-gate #endif /* _VR3_COMPAT_CODE */
78*0Sstevel@tonic-gate }
79*0Sstevel@tonic-gate } else {
80*0Sstevel@tonic-gate /*
81*0Sstevel@tonic-gate * We are a subwin and we don't want to delete the memory since
82*0Sstevel@tonic-gate * it's shared by other windows. We do want to decrement the
83*0Sstevel@tonic-gate * descendant count so that if there are no children left to a
84*0Sstevel@tonic-gate * particular window winsdelln.c will run in fast mode (look there).
85*0Sstevel@tonic-gate */
86*0Sstevel@tonic-gate for (par = win->_parent; par != NULL; par = par->_parent)
87*0Sstevel@tonic-gate par->_ndescs--;
88*0Sstevel@tonic-gate }
89*0Sstevel@tonic-gate
90*0Sstevel@tonic-gate #ifdef _VR3_COMPAT_CODE
91*0Sstevel@tonic-gate if (_y16update)
92*0Sstevel@tonic-gate free((char *)win->_y16);
93*0Sstevel@tonic-gate #endif /* _VR3_COMPAT_CODE */
94*0Sstevel@tonic-gate
95*0Sstevel@tonic-gate free((char *)win->_y);
96*0Sstevel@tonic-gate free((char *)win->_firstch);
97*0Sstevel@tonic-gate free((char *)win);
98*0Sstevel@tonic-gate return (OK);
99*0Sstevel@tonic-gate }
100