2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Edward Wang at The University of California, Berkeley.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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.
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
38 static char sccsid[] = "@(#)wwmove.c 8.1 (Berkeley) 6/6/93";
44 * Move a window. Should be unattached.
47 register struct ww *w;
65 w->ww_i.t = MAX(w->ww_w.t, 0);
66 w->ww_i.b = MIN(w->ww_w.b, wwnrow);
67 w->ww_i.nr = w->ww_i.b - w->ww_i.t;
68 w->ww_i.l = MAX(w->ww_w.l, 0);
69 w->ww_i.r = MIN(w->ww_w.r, wwncol);
70 w->ww_i.nc = w->ww_i.r - w->ww_i.l;
76 for (i = w->ww_w.t; i < w->ww_w.b; i++)
78 if (w->ww_fmap != 0) {
80 for (i = w->ww_w.t; i < w->ww_w.b; i++)
84 for (i = w->ww_i.t; i < w->ww_i.b; i++) {
85 register j = w->ww_i.l;
86 register char *win = &w->ww_win[i][j];
87 register char *smap = &wwsmap[i][j];
90 for (; j < w->ww_i.r; j++, win++, smap++)
91 if (*win == 0 && *smap == w->ww_index)
96 for (i = w->ww_b.t; i < w->ww_b.b; i++)