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, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | * 1. Redistributions of source code must retain the above copyright
|
---|
9 | * notice, this list of conditions and the following disclaimer.
|
---|
10 | * 2. Redistributions in binary form must reproduce the above copyright
|
---|
11 | * notice, this list of conditions and the following disclaimer in the
|
---|
12 | * documentation and/or other materials provided with the distribution.
|
---|
13 | * 3. All advertising materials mentioning features or use of this software
|
---|
14 | * must display the following acknowledgement:
|
---|
15 | * This product includes software developed by the University of
|
---|
16 | * California, Berkeley and its contributors.
|
---|
17 | * 4. Neither the name of the University nor the names of its contributors
|
---|
18 | * may be used to endorse or promote products derived from this software
|
---|
19 | * without specific prior written permission.
|
---|
20 | *
|
---|
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
---|
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
---|
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
---|
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
---|
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
---|
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
---|
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
---|
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
---|
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
---|
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
---|
31 | * SUCH DAMAGE.
|
---|
32 | */
|
---|
33 |
|
---|
34 | #ifndef lint
|
---|
35 | static char sccsid[] = "@(#)overlay.c 5.6 (Berkeley) 6/1/90";
|
---|
36 | #endif /* not lint */
|
---|
37 |
|
---|
38 | # include "curses.ext"
|
---|
39 | # include <ctype.h>
|
---|
40 |
|
---|
41 | # define min(a,b) (a < b ? a : b)
|
---|
42 | # define max(a,b) (a > b ? a : b)
|
---|
43 |
|
---|
44 | /*
|
---|
45 | * This routine writes win1 on win2 non-destructively.
|
---|
46 | *
|
---|
47 | */
|
---|
48 | overlay(win1, win2)
|
---|
49 | reg WINDOW *win1, *win2; {
|
---|
50 |
|
---|
51 | reg char *sp, *end;
|
---|
52 | reg int x, y, endy, endx, starty, startx;
|
---|
53 | reg int y1,y2;
|
---|
54 |
|
---|
55 | # ifdef DEBUG
|
---|
56 | fprintf(outf, "OVERLAY(%0.2o, %0.2o);\n", win1, win2);
|
---|
57 | # endif
|
---|
58 | starty = max(win1->_begy, win2->_begy);
|
---|
59 | startx = max(win1->_begx, win2->_begx);
|
---|
60 | endy = min(win1->_maxy + win1->_begy, win2->_maxy + win2->_begx);
|
---|
61 | endx = min(win1->_maxx + win1->_begx, win2->_maxx + win2->_begx);
|
---|
62 | # ifdef DEBUG
|
---|
63 | fprintf(outf, "OVERLAY:from (%d,%d) to (%d,%d)\n", starty, startx, endy, endx);
|
---|
64 | # endif
|
---|
65 | if (starty >= endy || startx >= endx)
|
---|
66 | return;
|
---|
67 | y1 = starty - win1->_begy;
|
---|
68 | y2 = starty - win2->_begy;
|
---|
69 | for (y = starty; y < endy; y++, y1++, y2++) {
|
---|
70 | end = &win1->_y[y1][endx - win1->_begx];
|
---|
71 | x = startx - win2->_begx;
|
---|
72 | for (sp = &win1->_y[y1][startx - win1->_begx]; sp < end; sp++) {
|
---|
73 | if (!isspace(*sp))
|
---|
74 | mvwaddch(win2, y2, x, *sp);
|
---|
75 | x++;
|
---|
76 | }
|
---|
77 | }
|
---|
78 | }
|
---|