usr.bin/window/wwdelete.c

   1 /*      @(#)wwdelete.c  8.1 (Berkeley) 6/6/93   */
   2 /*      $NetBSD: wwdelete.c,v 1.7 2003/08/07 11:17:38 agc Exp $ */
   3
   4 /*
   5  * Copyright (c) 1983, 1993
   6  *      The Regents of the University of California.  All rights reserved.
   7  *
   8  * This code is derived from software contributed to Berkeley by
   9  * Edward Wang at The University of California, Berkeley.
  10  *
  11  * Redistribution and use in source and binary forms, with or without
  12  * modification, are permitted provided that the following conditions
  13  * are met:
  14  * 1. Redistributions of source code must retain the above copyright
  15  *    notice, this list of conditions and the following disclaimer.
  16  * 2. Redistributions in binary form must reproduce the above copyright
  17  *    notice, this list of conditions and the following disclaimer in the
  18  *    documentation and/or other materials provided with the distribution.
  19  * 3. Neither the name of the University nor the names of its contributors
  20  *    may be used to endorse or promote products derived from this software
  21  *    without specific prior written permission.
  22  *
  23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33  * SUCH DAMAGE.
  34  */
  35
  36 #include "ww.h"
  37
  38 /*
  39  * Pull w free from the cover list.
  40  */
  41 void
  42 wwdelete(struct ww *w)
  43 {
  44         int i;
  45
  46         for (i = w->ww_i.t; i < w->ww_i.b; i++) {
  47                 int j;
  48                 unsigned char *smap = wwsmap[i];
  49                 union ww_char *ns = wwns[i];
  50                 int nchanged = 0;
  51
  52                 for (j = w->ww_i.l; j < w->ww_i.r; j++)
  53                         if (smap[j] == w->ww_index) {
  54                                 smap[j] = WWX_NOBODY;
  55                                 ns[j].c_w = ' ';
  56                                 nchanged++;
  57                         }
  58                 if (nchanged > 0)
  59                         wwtouched[i] |= WWU_TOUCHED;
  60         }
  61
  62         {
  63                 struct ww *wp;
  64
  65                 for (wp = w->ww_forw; wp != &wwhead; wp = wp->ww_forw)
  66                         wp->ww_order--;
  67         }
  68
  69         if (w->ww_forw != &wwhead)
  70                 wwdelete1(w->ww_forw,
  71                         w->ww_i.t, w->ww_i.b, w->ww_i.l, w->ww_i.r);
  72
  73         w->ww_back->ww_forw = w->ww_forw;
  74         w->ww_forw->ww_back = w->ww_back;
  75         w->ww_forw = w->ww_back = 0;
  76 }
  77
  78 void
  79 wwdelete1(struct ww *w, int t, int b, int l, int r)
  80 {
  81         int i;
  82         int tt, bb, ll, rr;
  83         char hasglass;
  84
  85 again:
  86         hasglass = 0;
  87         tt = MAX(t, w->ww_i.t);
  88         bb = MIN(b, w->ww_i.b);
  89         ll = MAX(l, w->ww_i.l);
  90         rr = MIN(r, w->ww_i.r);
  91         if (tt >= bb || ll >= rr) {
  92                 if ((w = w->ww_forw) == &wwhead)
  93                         return;
  94                 goto again;
  95         }
  96         for (i = tt; i < bb; i++) {
  97                 int j;
  98                 unsigned char *smap = wwsmap[i];
  99                 union ww_char *ns = wwns[i];
 100                 char *win = w->ww_win[i];
 101                 union ww_char *buf = w->ww_buf[i];
 102                 int nvis = w->ww_nvis[i];
 103                 int nchanged = 0;
 104
 105                 for (j = ll; j < rr; j++) {
 106                         if (smap[j] != WWX_NOBODY)
 107                                 continue;
 108                         if (win[j] & WWM_GLS) {
 109                                 hasglass = 1;
 110                                 continue;
 111                         }
 112                         smap[j] = w->ww_index;
 113                         ns[j].c_w = buf[j].c_w ^ win[j] << WWC_MSHIFT;
 114                         nchanged++;
 115                         if (win[j] == 0)
 116                                 nvis++;
 117                 }
 118                 if (nchanged > 0)
 119                         wwtouched[i] |= WWU_TOUCHED;
 120                 w->ww_nvis[i] = nvis;
 121         }
 122         if ((w = w->ww_forw) == &wwhead)
 123                 return;
 124         if (hasglass)
 125                 goto again;
 126         if (tt > t)
 127                 wwdelete1(w, t, tt, l, r);
 128         if (bb < b)
 129                 wwdelete1(w, bb, b, l, r);
 130         if (ll > l)
 131                 wwdelete1(w, tt, bb, l, ll);
 132         if (rr < r)
 133                 wwdelete1(w, tt, bb, rr, r);
 134 }