1 /* 2 * Copyright (c) 1983, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Edward Wang at The University of California, Berkeley. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. All advertising materials mentioning features or use of this software 17 * must display the following acknowledgement: 18 * This product includes software developed by the University of 19 * California, Berkeley and its contributors. 20 * 4. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)wwsize.c 8.1 (Berkeley) 6/6/93 37 * $FreeBSD: src/usr.bin/window/wwsize.c,v 1.2.6.1 2001/05/17 09:45:01 obrien Exp $ 38 * $DragonFly: src/usr.bin/window/wwsize.c,v 1.2 2003/06/17 04:29:34 dillon Exp $ 39 */ 40 41 #include <stdlib.h> 42 #include "ww.h" 43 44 /* 45 * Resize a window. Should be unattached. 46 */ 47 wwsize(w, nrow, ncol) 48 register struct ww *w; 49 { 50 register i, j; 51 int nline; 52 union ww_char **buf = 0; 53 char **win = 0; 54 short *nvis = 0; 55 char **fmap = 0; 56 char m; 57 58 /* 59 * First allocate new buffers. 60 */ 61 win = wwalloc(w->ww_w.t, w->ww_w.l, nrow, ncol, sizeof (char)); 62 if (win == 0) 63 goto bad; 64 if (w->ww_fmap != 0) { 65 fmap = wwalloc(w->ww_w.t, w->ww_w.l, nrow, ncol, sizeof (char)); 66 if (fmap == 0) 67 goto bad; 68 } 69 if (nrow > w->ww_b.nr || ncol > w->ww_b.nc) { 70 nline = MAX(w->ww_b.nr, nrow); 71 buf = (union ww_char **) wwalloc(w->ww_b.t, w->ww_b.l, 72 nline, ncol, sizeof (union ww_char)); 73 if (buf == 0) 74 goto bad; 75 } 76 nvis = (short *)malloc((unsigned) nrow * sizeof (short)); 77 if (nvis == 0) { 78 wwerrno = WWE_NOMEM; 79 goto bad; 80 } 81 nvis -= w->ww_w.t; 82 /* 83 * Copy text buffer. 84 */ 85 if (buf != 0) { 86 int b, r; 87 88 b = w->ww_b.t + nline; 89 r = w->ww_b.l + ncol; 90 if (ncol < w->ww_b.nc) 91 for (i = w->ww_b.t; i < w->ww_b.b; i++) 92 for (j = w->ww_b.l; j < r; j++) 93 buf[i][j] = w->ww_buf[i][j]; 94 else 95 for (i = w->ww_b.t; i < w->ww_b.b; i++) { 96 for (j = w->ww_b.l; j < w->ww_b.r; j++) 97 buf[i][j] = w->ww_buf[i][j]; 98 for (; j < r; j++) 99 buf[i][j].c_w = ' '; 100 } 101 for (; i < b; i++) 102 for (j = w->ww_b.l; j < r; j++) 103 buf[i][j].c_w = ' '; 104 } 105 /* 106 * Now free the old stuff. 107 */ 108 wwfree((char **)w->ww_win, w->ww_w.t); 109 w->ww_win = win; 110 if (buf != 0) { 111 wwfree((char **)w->ww_buf, w->ww_b.t); 112 w->ww_buf = buf; 113 } 114 if (w->ww_fmap != 0) { 115 wwfree((char **)w->ww_fmap, w->ww_w.t); 116 w->ww_fmap = fmap; 117 } 118 free((char *)(w->ww_nvis + w->ww_w.t)); 119 w->ww_nvis = nvis; 120 /* 121 * Set new sizes. 122 */ 123 /* window */ 124 w->ww_w.b = w->ww_w.t + nrow; 125 w->ww_w.r = w->ww_w.l + ncol; 126 w->ww_w.nr = nrow; 127 w->ww_w.nc = ncol; 128 /* text buffer */ 129 if (buf != 0) { 130 w->ww_b.b = w->ww_b.t + nline; 131 w->ww_b.r = w->ww_b.l + ncol; 132 w->ww_b.nr = nline; 133 w->ww_b.nc = ncol; 134 } 135 /* scroll */ 136 if ((i = w->ww_b.b - w->ww_w.b) < 0 || 137 (i = w->ww_cur.r - w->ww_w.b + 1) > 0) { 138 w->ww_buf += i; 139 w->ww_b.t -= i; 140 w->ww_b.b -= i; 141 w->ww_cur.r -= i; 142 } 143 /* interior */ 144 w->ww_i.b = MIN(w->ww_w.b, wwnrow); 145 w->ww_i.r = MIN(w->ww_w.r, wwncol); 146 w->ww_i.nr = w->ww_i.b - w->ww_i.t; 147 w->ww_i.nc = w->ww_i.r - w->ww_i.l; 148 /* 149 * Initialize new buffers. 150 */ 151 /* window */ 152 m = 0; 153 if (w->ww_oflags & WWO_GLASS) 154 m |= WWM_GLS; 155 if (w->ww_oflags & WWO_REVERSE) 156 m |= WWM_REV; 157 for (i = w->ww_w.t; i < w->ww_w.b; i++) 158 for (j = w->ww_w.l; j < w->ww_w.r; j++) 159 w->ww_win[i][j] = m; 160 /* frame map */ 161 if (fmap != 0) 162 for (i = w->ww_w.t; i < w->ww_w.b; i++) 163 for (j = w->ww_w.l; j < w->ww_w.r; j++) 164 w->ww_fmap[i][j] = 0; 165 /* visibility */ 166 j = m ? 0 : w->ww_w.nc; 167 for (i = w->ww_w.t; i < w->ww_w.b; i++) 168 w->ww_nvis[i] = j; 169 /* 170 * Put cursor back. 171 */ 172 if (w->ww_hascursor) { 173 w->ww_hascursor = 0; 174 wwcursor(w, 1); 175 } 176 /* 177 * Fool with pty. 178 */ 179 if (w->ww_ispty && w->ww_pty >= 0) 180 (void) wwsetttysize(w->ww_pty, nrow, ncol); 181 return 0; 182 bad: 183 if (win != 0) 184 wwfree(win, w->ww_w.t); 185 if (fmap != 0) 186 wwfree(fmap, w->ww_w.t); 187 if (buf != 0) 188 wwfree((char **)buf, w->ww_b.t); 189 if (nvis != 0) 190 free((char *)(nvis + w->ww_w.t)); 191 return -1; 192 } 193