|
|
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[] = "@(#)wwredrawwin.c 3.16 (Berkeley) 6/6/90";
25: #endif /* not lint */
26:
27: #include "ww.h"
28:
29: wwredrawwin1(w, row1, row2, offset)
30: register struct ww *w;
31: int row1, row2, offset;
32: {
33: int row;
34: register col;
35: register char *smap;
36: register union ww_char *buf;
37: register char *win;
38: register union ww_char *ns;
39: int x;
40: int nchanged;
41:
42: for (row = row1; row < row2; row++) {
43: col = w->ww_i.l;
44: ns = wwns[row];
45: smap = &wwsmap[row][col];
46: buf = w->ww_buf[row + offset];
47: win = w->ww_win[row];
48: nchanged = 0;
49: for (; col < w->ww_i.r; col++)
50: if (*smap++ == w->ww_index &&
51: ns[col].c_w !=
52: (x = buf[col].c_w ^ win[col] << WWC_MSHIFT)) {
53: nchanged++;
54: ns[col].c_w = x;
55: }
56: if (nchanged > 0)
57: wwtouched[row] |= WWU_TOUCHED;
58: }
59: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.