|
|
1.1 root 1: /*
2: * Copyright (c) 1981 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[] = "@(#)overwrite.c 5.3 (Berkeley) 6/30/88";
20: #endif /* not lint */
21:
22: # include "curses.ext"
23: # include <ctype.h>
24:
25: # define min(a,b) (a < b ? a : b)
26: # define max(a,b) (a > b ? a : b)
27:
28: /*
29: * This routine writes win1 on win2 destructively.
30: *
31: */
32: overwrite(win1, win2)
33: reg WINDOW *win1, *win2; {
34:
35: reg char *sp, *end;
36: reg int x, y, endy, endx, starty, startx;
37:
38: # ifdef DEBUG
39: fprintf(outf, "OVERWRITE(%0.2o, %0.2o);\n", win1, win2);
40: # endif
41: starty = max(win1->_begy, win2->_begy);
42: startx = max(win1->_begx, win2->_begx);
43: endy = min(win1->_maxy + win1->_begy, win2->_maxy + win2->_begx);
44: endx = min(win1->_maxx + win1->_begx, win2->_maxx + win2->_begx);
45: if (starty >= endy || startx >= endx)
46: return;
47: # ifdef DEBUG
48: fprintf(outf, "OVERWRITE:from (%d,%d) to (%d,%d)\n", starty, startx, endy, endx);
49: # endif
50: x = endx - startx;
51: for (y = starty; y < endy; y++) {
52: bcopy(&win1->_y[y - win1->_begy][startx - win1->_begx],
53: &win2->_y[y - win2->_begy][startx - win2->_begx], x);
54: touchline(win2, y, startx - win2->_begx, endx - win2->_begx);
55: }
56: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.