|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1983 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that the above copyright notice and this paragraph are ! 7: * duplicated in all such forms and that any documentation, ! 8: * advertising materials, and other materials related to such ! 9: * distribution and use acknowledge that the software was developed ! 10: * by the University of California, Berkeley. The name of the ! 11: * University may not be used to endorse or promote products derived ! 12: * from this software without specific prior written permission. ! 13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 16: */ ! 17: ! 18: #ifndef lint ! 19: static char sccsid[] = "@(#)wwunframe.c 3.17 (Berkeley) 6/29/88"; ! 20: #endif /* not lint */ ! 21: ! 22: #include "ww.h" ! 23: ! 24: wwunframe(w) ! 25: register struct ww *w; ! 26: { ! 27: int i; ! 28: ! 29: for (i = w->ww_i.t; i < w->ww_i.b; i++) { ! 30: register j; ! 31: register char *win = w->ww_win[i]; ! 32: register char *fmap = w->ww_fmap ? w->ww_fmap[i] : 0; ! 33: register char *smap = wwsmap[i]; ! 34: register union ww_char *ns = wwns[i]; ! 35: int nchanged = 0; ! 36: ! 37: for (j = w->ww_i.l; j < w->ww_i.r; j++) { ! 38: if (win[j] & WWM_GLS) ! 39: continue; ! 40: win[j] |= WWM_GLS; ! 41: if (fmap != 0) ! 42: fmap[j] = 0; ! 43: if (smap[j] == w->ww_index) { ! 44: smap[j] = WWX_NOBODY; ! 45: ns[j].c_w = ' '; ! 46: nchanged++; ! 47: } ! 48: } ! 49: if (nchanged > 4) ! 50: wwtouched[i] |= WWU_MAJOR|WWU_TOUCHED; ! 51: else if (nchanged > 0) ! 52: wwtouched[i] |= WWU_TOUCHED; ! 53: w->ww_nvis[i] = 0; ! 54: } ! 55: ! 56: if (w->ww_forw != &wwhead) ! 57: wwdelete1(w->ww_forw, ! 58: w->ww_i.t, w->ww_i.b, w->ww_i.l, w->ww_i.r); ! 59: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.