1 /* @(#)wwmove.c 8.1 (Berkeley) 6/6/93 */ 2 /* $NetBSD: wwmove.c,v 1.7 2003/08/07 11:17:42 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 * Move a window. Should be unattached. 40 */ 41 void 42 wwmove(struct ww *w, int row, int col) 43 { 44 int dr, dc; 45 int i; 46 47 dr = row - w->ww_w.t; 48 dc = col - w->ww_w.l; 49 50 w->ww_w.t += dr; 51 w->ww_w.b += dr; 52 w->ww_w.l += dc; 53 w->ww_w.r += dc; 54 55 w->ww_b.t += dr; 56 w->ww_b.b += dr; 57 w->ww_b.l += dc; 58 w->ww_b.r += dc; 59 60 w->ww_i.t = MAX(w->ww_w.t, 0); 61 w->ww_i.b = MIN(w->ww_w.b, wwnrow); 62 w->ww_i.nr = w->ww_i.b - w->ww_i.t; 63 w->ww_i.l = MAX(w->ww_w.l, 0); 64 w->ww_i.r = MIN(w->ww_w.r, wwncol); 65 w->ww_i.nc = w->ww_i.r - w->ww_i.l; 66 67 w->ww_cur.r += dr; 68 w->ww_cur.c += dc; 69 70 w->ww_win -= dr; 71 for (i = w->ww_w.t; i < w->ww_w.b; i++) 72 w->ww_win[i] -= dc; 73 if (w->ww_fmap != 0) { 74 w->ww_fmap -= dr; 75 for (i = w->ww_w.t; i < w->ww_w.b; i++) 76 w->ww_fmap[i] -= dc; 77 } 78 w->ww_nvis -= dr; 79 for (i = w->ww_i.t; i < w->ww_i.b; i++) { 80 int j = w->ww_i.l; 81 char *win = &w->ww_win[i][j]; 82 unsigned char *smap = &wwsmap[i][j]; 83 int nvis = 0; 84 85 for (; j < w->ww_i.r; j++, win++, smap++) 86 if (*win == 0 && *smap == w->ww_index) 87 nvis++; 88 w->ww_nvis[i] = nvis; 89 } 90 w->ww_buf -= dr; 91 for (i = w->ww_b.t; i < w->ww_b.b; i++) 92 w->ww_buf[i] -= dc; 93 } 94