|
|
1.1 root 1: /*
2: * Copyright (c) 1983 Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * Edward Wang at The University of California, Berkeley.
7: *
8: * Redistribution and use in source and binary forms are permitted provided
9: * that: (1) source distributions retain this entire copyright notice and
10: * comment, and (2) distributions including binaries display the following
11: * acknowledgement: ``This product includes software developed by the
12: * University of California, Berkeley and its contributors'' in the
13: * documentation or other materials provided with the distribution and in
14: * all advertising materials mentioning features or use of this software.
15: * Neither the name of the University nor the names of its contributors may
16: * be used to endorse or promote products derived from this software without
17: * specific prior written permission.
18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
19: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
20: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
21: */
22:
23: #ifndef lint
24: static char sccsid[] = "@(#)wwmisc.c 3.14 (Berkeley) 6/6/90";
25: #endif /* not lint */
26:
27: #include "ww.h"
28: #include "tt.h"
29: #include "char.h"
30:
31: /*
32: * Sufficient but not necessary test for total visibility.
33: */
34: wwvisible(w)
35: register struct ww *w;
36: {
37: register i;
38: register nvis = 0;
39:
40: for (i = w->ww_i.t; i < w->ww_i.b; i++)
41: nvis += w->ww_nvis[i];
42: if (w->ww_hascursor
43: && w->ww_cur.r >= w->ww_i.t && w->ww_cur.r < w->ww_i.b
44: && w->ww_cur.c >= w->ww_i.l && w->ww_cur.c < w->ww_i.r
45: && wwsmap[w->ww_cur.r][w->ww_cur.c] == w->ww_index)
46: nvis++;
47: return nvis == w->ww_i.nr * w->ww_i.nc;
48: }
49:
50: wwbell()
51: {
52: ttputc(ctrl('g'));
53: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.