193 lines
5.2 KiB
C
193 lines
5.2 KiB
C
/*
|
|
* Copyright (c) 1983, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Edward Wang at The University of California, Berkeley.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef lint
|
|
static char sccsid[] = "@(#)wwsize.c 8.1 (Berkeley) 6/6/93";
|
|
#endif /* not lint */
|
|
|
|
#include <stdlib.h>
|
|
#include "ww.h"
|
|
|
|
/*
|
|
* Resize a window. Should be unattached.
|
|
*/
|
|
wwsize(w, nrow, ncol)
|
|
register struct ww *w;
|
|
{
|
|
register i, j;
|
|
int nline;
|
|
union ww_char **buf = 0;
|
|
char **win = 0;
|
|
short *nvis = 0;
|
|
char **fmap = 0;
|
|
char m;
|
|
|
|
/*
|
|
* First allocate new buffers.
|
|
*/
|
|
win = wwalloc(w->ww_w.t, w->ww_w.l, nrow, ncol, sizeof (char));
|
|
if (win == 0)
|
|
goto bad;
|
|
if (w->ww_fmap != 0) {
|
|
fmap = wwalloc(w->ww_w.t, w->ww_w.l, nrow, ncol, sizeof (char));
|
|
if (fmap == 0)
|
|
goto bad;
|
|
}
|
|
if (nrow > w->ww_b.nr || ncol > w->ww_b.nc) {
|
|
nline = MAX(w->ww_b.nr, nrow);
|
|
buf = (union ww_char **) wwalloc(w->ww_b.t, w->ww_b.l,
|
|
nline, ncol, sizeof (union ww_char));
|
|
if (buf == 0)
|
|
goto bad;
|
|
}
|
|
nvis = (short *)malloc((unsigned) nrow * sizeof (short));
|
|
if (nvis == 0) {
|
|
wwerrno = WWE_NOMEM;
|
|
goto bad;
|
|
}
|
|
nvis -= w->ww_w.t;
|
|
/*
|
|
* Copy text buffer.
|
|
*/
|
|
if (buf != 0) {
|
|
int b, r;
|
|
|
|
b = w->ww_b.t + nline;
|
|
r = w->ww_b.l + ncol;
|
|
if (ncol < w->ww_b.nc)
|
|
for (i = w->ww_b.t; i < w->ww_b.b; i++)
|
|
for (j = w->ww_b.l; j < r; j++)
|
|
buf[i][j] = w->ww_buf[i][j];
|
|
else
|
|
for (i = w->ww_b.t; i < w->ww_b.b; i++) {
|
|
for (j = w->ww_b.l; j < w->ww_b.r; j++)
|
|
buf[i][j] = w->ww_buf[i][j];
|
|
for (; j < r; j++)
|
|
buf[i][j].c_w = ' ';
|
|
}
|
|
for (; i < b; i++)
|
|
for (j = w->ww_b.l; j < r; j++)
|
|
buf[i][j].c_w = ' ';
|
|
}
|
|
/*
|
|
* Now free the old stuff.
|
|
*/
|
|
wwfree((char **)w->ww_win, w->ww_w.t);
|
|
w->ww_win = win;
|
|
if (buf != 0) {
|
|
wwfree((char **)w->ww_buf, w->ww_b.t);
|
|
w->ww_buf = buf;
|
|
}
|
|
if (w->ww_fmap != 0) {
|
|
wwfree((char **)w->ww_fmap, w->ww_w.t);
|
|
w->ww_fmap = fmap;
|
|
}
|
|
free((char *)(w->ww_nvis + w->ww_w.t));
|
|
w->ww_nvis = nvis;
|
|
/*
|
|
* Set new sizes.
|
|
*/
|
|
/* window */
|
|
w->ww_w.b = w->ww_w.t + nrow;
|
|
w->ww_w.r = w->ww_w.l + ncol;
|
|
w->ww_w.nr = nrow;
|
|
w->ww_w.nc = ncol;
|
|
/* text buffer */
|
|
if (buf != 0) {
|
|
w->ww_b.b = w->ww_b.t + nline;
|
|
w->ww_b.r = w->ww_b.l + ncol;
|
|
w->ww_b.nr = nline;
|
|
w->ww_b.nc = ncol;
|
|
}
|
|
/* scroll */
|
|
if ((i = w->ww_b.b - w->ww_w.b) < 0 ||
|
|
(i = w->ww_cur.r - w->ww_w.b + 1) > 0) {
|
|
w->ww_buf += i;
|
|
w->ww_b.t -= i;
|
|
w->ww_b.b -= i;
|
|
w->ww_cur.r -= i;
|
|
}
|
|
/* interior */
|
|
w->ww_i.b = MIN(w->ww_w.b, wwnrow);
|
|
w->ww_i.r = MIN(w->ww_w.r, wwncol);
|
|
w->ww_i.nr = w->ww_i.b - w->ww_i.t;
|
|
w->ww_i.nc = w->ww_i.r - w->ww_i.l;
|
|
/*
|
|
* Initialize new buffers.
|
|
*/
|
|
/* window */
|
|
m = 0;
|
|
if (w->ww_oflags & WWO_GLASS)
|
|
m |= WWM_GLS;
|
|
if (w->ww_oflags & WWO_REVERSE)
|
|
m |= WWM_REV;
|
|
for (i = w->ww_w.t; i < w->ww_w.b; i++)
|
|
for (j = w->ww_w.l; j < w->ww_w.r; j++)
|
|
w->ww_win[i][j] = m;
|
|
/* frame map */
|
|
if (fmap != 0)
|
|
for (i = w->ww_w.t; i < w->ww_w.b; i++)
|
|
for (j = w->ww_w.l; j < w->ww_w.r; j++)
|
|
w->ww_fmap[i][j] = 0;
|
|
/* visibility */
|
|
j = m ? 0 : w->ww_w.nc;
|
|
for (i = w->ww_w.t; i < w->ww_w.b; i++)
|
|
w->ww_nvis[i] = j;
|
|
/*
|
|
* Put cursor back.
|
|
*/
|
|
if (w->ww_hascursor) {
|
|
w->ww_hascursor = 0;
|
|
wwcursor(w, 1);
|
|
}
|
|
/*
|
|
* Fool with pty.
|
|
*/
|
|
if (w->ww_ispty && w->ww_pty >= 0)
|
|
(void) wwsetttysize(w->ww_pty, nrow, ncol);
|
|
return 0;
|
|
bad:
|
|
if (win != 0)
|
|
wwfree(win, w->ww_w.t);
|
|
if (fmap != 0)
|
|
wwfree(fmap, w->ww_w.t);
|
|
if (buf != 0)
|
|
wwfree((char **)buf, w->ww_b.t);
|
|
if (nvis != 0)
|
|
free((char *)(nvis + w->ww_w.t));
|
|
return -1;
|
|
}
|