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 * @(#)wwdelete.c 8.1 (Berkeley) 6/6/93 37 * $FreeBSD: src/usr.bin/window/wwdelete.c,v 1.1.1.1.14.1 2001/05/17 09:45:01 obrien Exp $ 38 * $DragonFly: src/usr.bin/window/wwdelete.c,v 1.2 2003/06/17 04:29:34 dillon Exp $ 39 */ 40 41 #include "ww.h" 42 43 /* 44 * Pull w free from the cover list. 45 */ 46 wwdelete(w) 47 register struct ww *w; 48 { 49 register i; 50 51 for (i = w->ww_i.t; i < w->ww_i.b; i++) { 52 register j; 53 register char *smap = wwsmap[i]; 54 register union ww_char *ns = wwns[i]; 55 register int nchanged = 0; 56 57 for (j = w->ww_i.l; j < w->ww_i.r; j++) 58 if (smap[j] == w->ww_index) { 59 smap[j] = WWX_NOBODY; 60 ns[j].c_w = ' '; 61 nchanged++; 62 } 63 if (nchanged > 0) 64 wwtouched[i] |= WWU_TOUCHED; 65 } 66 67 { 68 register struct ww *wp; 69 70 for (wp = w->ww_forw; wp != &wwhead; wp = wp->ww_forw) 71 wp->ww_order--; 72 } 73 74 if (w->ww_forw != &wwhead) 75 wwdelete1(w->ww_forw, 76 w->ww_i.t, w->ww_i.b, w->ww_i.l, w->ww_i.r); 77 78 w->ww_back->ww_forw = w->ww_forw; 79 w->ww_forw->ww_back = w->ww_back; 80 w->ww_forw = w->ww_back = 0; 81 } 82 83 wwdelete1(w, t, b, l, r) 84 register struct ww *w; 85 { 86 int i; 87 int tt, bb, ll, rr; 88 char hasglass; 89 90 again: 91 hasglass = 0; 92 tt = MAX(t, w->ww_i.t); 93 bb = MIN(b, w->ww_i.b); 94 ll = MAX(l, w->ww_i.l); 95 rr = MIN(r, w->ww_i.r); 96 if (tt >= bb || ll >= rr) { 97 if ((w = w->ww_forw) == &wwhead) 98 return; 99 goto again; 100 } 101 for (i = tt; i < bb; i++) { 102 register j; 103 register char *smap = wwsmap[i]; 104 register union ww_char *ns = wwns[i]; 105 register char *win = w->ww_win[i]; 106 register union ww_char *buf = w->ww_buf[i]; 107 int nvis = w->ww_nvis[i]; 108 int nchanged = 0; 109 110 for (j = ll; j < rr; j++) { 111 if (smap[j] != WWX_NOBODY) 112 continue; 113 if (win[j] & WWM_GLS) { 114 hasglass = 1; 115 continue; 116 } 117 smap[j] = w->ww_index; 118 ns[j].c_w = buf[j].c_w ^ win[j] << WWC_MSHIFT; 119 nchanged++; 120 if (win[j] == 0) 121 nvis++; 122 } 123 if (nchanged > 0) 124 wwtouched[i] |= WWU_TOUCHED; 125 w->ww_nvis[i] = nvis; 126 } 127 if ((w = w->ww_forw) == &wwhead) 128 return; 129 if (hasglass) 130 goto again; 131 if (tt > t) 132 wwdelete1(w, t, tt, l, r); 133 if (bb < b) 134 wwdelete1(w, bb, b, l, r); 135 if (ll > l) 136 wwdelete1(w, tt, bb, l, ll); 137 if (rr < r) 138 wwdelete1(w, tt, bb, rr, r); 139 } 140