1 /* @(#)wwmisc.c 8.1 (Berkeley) 6/6/93 */ 2 /* $NetBSD: wwmisc.c,v 1.7 2003/08/07 11:17:41 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 #include "tt.h" 38 #include "char.h" 39 40 /* 41 * Sufficient but not necessary test for total visibility. 42 */ 43 int 44 wwvisible(struct ww *w) 45 { 46 int i; 47 int nvis = 0; 48 49 for (i = w->ww_i.t; i < w->ww_i.b; i++) 50 nvis += w->ww_nvis[i]; 51 if (ISSET(w->ww_wflags, WWW_HASCURSOR) 52 && w->ww_cur.r >= w->ww_i.t && w->ww_cur.r < w->ww_i.b 53 && w->ww_cur.c >= w->ww_i.l && w->ww_cur.c < w->ww_i.r 54 && wwsmap[w->ww_cur.r][w->ww_cur.c] == w->ww_index) 55 nvis++; 56 return nvis == w->ww_i.nr * w->ww_i.nc; 57 } 58 59 void 60 wwbell(void) 61 { 62 ttputc(ctrl('g')); 63 } 64