|
|
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[] = "@(#)wwunframe.c 3.20 (Berkeley) 6/6/90";
25: #endif /* not lint */
26:
27: #include "ww.h"
28:
29: wwunframe(w)
30: register struct ww *w;
31: {
32: int i;
33:
34: for (i = w->ww_i.t; i < w->ww_i.b; i++) {
35: register j;
36: register char *win = w->ww_win[i];
37: register char *fmap = w->ww_fmap ? w->ww_fmap[i] : 0;
38: register char *smap = wwsmap[i];
39: register union ww_char *ns = wwns[i];
40: int nchanged = 0;
41:
42: for (j = w->ww_i.l; j < w->ww_i.r; j++) {
43: if (win[j] & WWM_GLS)
44: continue;
45: win[j] |= WWM_GLS;
46: if (fmap != 0)
47: fmap[j] = 0;
48: if (smap[j] == w->ww_index) {
49: smap[j] = WWX_NOBODY;
50: ns[j].c_w = ' ';
51: nchanged++;
52: }
53: }
54: if (nchanged > 0)
55: wwtouched[i] |= WWU_TOUCHED;
56: w->ww_nvis[i] = 0;
57: }
58:
59: if (w->ww_forw != &wwhead)
60: wwdelete1(w->ww_forw,
61: w->ww_i.t, w->ww_i.b, w->ww_i.l, w->ww_i.r);
62: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.