[dragonfly.git] / usr.bin / window / wwdelete.c

/*	@(#)wwdelete.c	8.1 (Berkeley) 6/6/93	*/
/*	$NetBSD: wwdelete.c,v 1.7 2003/08/07 11:17:38 agc Exp $	*/

/*
 * 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. 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.
 */

#include "ww.h"

/*
 * Pull w free from the cover list.
 */
void
wwdelete(struct ww *w)
{
	int i;

	for (i = w->ww_i.t; i < w->ww_i.b; i++) {
		int j;
		unsigned char *smap = wwsmap[i];
		union ww_char *ns = wwns[i];
		int nchanged = 0;

		for (j = w->ww_i.l; j < w->ww_i.r; j++)
			if (smap[j] == w->ww_index) {
				smap[j] = WWX_NOBODY;
				ns[j].c_w = ' ';
				nchanged++;
			}
		if (nchanged > 0)
			wwtouched[i] |= WWU_TOUCHED;
	}

	{
		struct ww *wp;

		for (wp = w->ww_forw; wp != &wwhead; wp = wp->ww_forw)
			wp->ww_order--;
	}

	if (w->ww_forw != &wwhead)
		wwdelete1(w->ww_forw,
			w->ww_i.t, w->ww_i.b, w->ww_i.l, w->ww_i.r);

	w->ww_back->ww_forw = w->ww_forw;
	w->ww_forw->ww_back = w->ww_back;
	w->ww_forw = w->ww_back = 0;
}

void
wwdelete1(struct ww *w, int t, int b, int l, int r)
{
	int i;
	int tt, bb, ll, rr;
	char hasglass;

again:
	hasglass = 0;
	tt = MAX(t, w->ww_i.t);
	bb = MIN(b, w->ww_i.b);
	ll = MAX(l, w->ww_i.l);
	rr = MIN(r, w->ww_i.r);
	if (tt >= bb || ll >= rr) {
		if ((w = w->ww_forw) == &wwhead)
			return;
		goto again;
	}
	for (i = tt; i < bb; i++) {
		int j;
		unsigned char *smap = wwsmap[i];
		union ww_char *ns = wwns[i];
		char *win = w->ww_win[i];
		union ww_char *buf = w->ww_buf[i];
		int nvis = w->ww_nvis[i];
		int nchanged = 0;

		for (j = ll; j < rr; j++) {
			if (smap[j] != WWX_NOBODY)
				continue;
			if (win[j] & WWM_GLS) {
				hasglass = 1;
				continue;
			}
			smap[j] = w->ww_index;
			ns[j].c_w = buf[j].c_w ^ win[j] << WWC_MSHIFT;
			nchanged++;
			if (win[j] == 0)
				nvis++;
		}
		if (nchanged > 0)
			wwtouched[i] |= WWU_TOUCHED;
		w->ww_nvis[i] = nvis;
	}
	if ((w = w->ww_forw) == &wwhead)
		return;
	if (hasglass)
		goto again;
	if (tt > t)
		wwdelete1(w, t, tt, l, r);
	if (bb < b)
		wwdelete1(w, bb, b, l, r);
	if (ll > l)
		wwdelete1(w, tt, bb, l, ll);
	if (rr < r)
		wwdelete1(w, tt, bb, rr, r);
}
Commit	Line	Data
2c872e05	1	/* @(#)wwdelete.c 8.1 (Berkeley) 6/6/93 */
abecab39 SW	2	/* $NetBSD: wwdelete.c,v 1.7 2003/08/07 11:17:38 agc Exp $ */
abecab39 SW	3
984263bc MD	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.
abecab39	19	* 3. Neither the name of the University nor the names of its contributors
984263bc MD	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
984263bc MD	36	#include "ww.h"
	37
	38	/*
	39	* Pull w free from the cover list.
	40	*/
abecab39 SW	41	void
abecab39 SW	42	wwdelete(struct ww *w)
984263bc	43	{
abecab39	44	int i;
984263bc MD	45
984263bc MD	46	for (i = w->ww_i.t; i < w->ww_i.b; i++) {
abecab39 SW	47	int j;
	48	unsigned char *smap = wwsmap[i];
	49	union ww_char *ns = wwns[i];
	50	int nchanged = 0;
984263bc MD	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	{
abecab39	63	struct ww *wp;
984263bc MD	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
abecab39 SW	78	void
abecab39 SW	79	wwdelete1(struct ww *w, int t, int b, int l, int r)
984263bc MD	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++) {
abecab39 SW	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];
984263bc MD	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	}