* Copyright (c) 1983 Regents of the University of California.
* 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
* 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. 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
static char sccsid
[] = "@(#)wwmove.c 3.11 (Berkeley) 6/6/90";
* Move a window. Should be unattached.
w
->ww_i
.t
= MAX(w
->ww_w
.t
, 0);
w
->ww_i
.b
= MIN(w
->ww_w
.b
, wwnrow
);
w
->ww_i
.nr
= w
->ww_i
.b
- w
->ww_i
.t
;
w
->ww_i
.l
= MAX(w
->ww_w
.l
, 0);
w
->ww_i
.r
= MIN(w
->ww_w
.r
, wwncol
);
w
->ww_i
.nc
= w
->ww_i
.r
- w
->ww_i
.l
;
for (i
= w
->ww_w
.t
; i
< w
->ww_w
.b
; i
++)
for (i
= w
->ww_w
.t
; i
< w
->ww_w
.b
; i
++)
for (i
= w
->ww_i
.t
; i
< w
->ww_i
.b
; i
++) {
register char *win
= &w
->ww_win
[i
][j
];
register char *smap
= &wwsmap
[i
][j
];
for (; j
< w
->ww_i
.r
; j
++, win
++, smap
++)
if (*win
== 0 && *smap
== w
->ww_index
)
for (i
= w
->ww_b
.t
; i
< w
->ww_b
.b
; i
++)