1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/***************************************************************************
* COPYRIGHT NOTICE *
****************************************************************************
* ncurses is copyright (C) 1992-1995 *
* Zeyd M. Ben-Halim *
* zmbenhal@netcom.com *
* Eric S. Raymond *
* esr@snark.thyrsus.com *
* *
* Permission is hereby granted to reproduce and distribute ncurses *
* by any means and for any fee, whether alone or as part of a *
* larger distribution, in source or in binary form, PROVIDED *
* this notice is included with any such distribution, and is not *
* removed from any of its header files. Mention of ncurses in any *
* applications linked with it is highly appreciated. *
* *
* ncurses comes AS IS with no warranty, implied or expressed. *
* *
***************************************************************************/
/*
** lib_overlay.c
**
** The routines overlay(), copywin(), and overwrite().
**
*/
#include "curses.priv.h"
static void overlap(const WINDOW *const s, WINDOW *const d, int const flag)
{
int sminrow, smincol, dminrow, dmincol, dmaxrow, dmaxcol;
T(("overlap : sby %d, sbx %d, smy %d, smx %d, dby %d, dbx %d, dmy %d, dmx %d",
s->_begy, s->_begx, s->_maxy, s->_maxx,
d->_begy, d->_begx, d->_maxy, d->_maxx));
sminrow = max(s->_begy, d->_begy) - s->_begy;
smincol = max(s->_begx, d->_begx) - s->_begx;
dminrow = max(s->_begy, d->_begy) - d->_begy;
dmincol = max(s->_begx, d->_begx) - d->_begx;
dmaxrow = min(s->_maxy+s->_begy, d->_maxy+d->_begy) - d->_begy;
dmaxcol = min(s->_maxx+s->_begx, d->_maxx+d->_begx) - d->_begx;
copywin(s, d, sminrow, smincol, dminrow, dmincol, dmaxrow, dmaxcol, flag);
}
/*
**
** overlay(win1, win2)
**
**
** overlay() writes the overlapping area of win1 behind win2
** on win2 non-destructively.
**
**/
int overlay(const WINDOW *win1, WINDOW *win2)
{
overlap(win1, win2, TRUE);
return OK;
}
/*
**
** overwrite(win1, win2)
**
**
** overwrite() writes the overlapping area of win1 behind win2
** on win2 destructively.
**
**/
int overwrite(const WINDOW *win1, WINDOW *win2)
{
overlap(win1, win2, FALSE);
return OK;
}
int copywin(const WINDOW *src, WINDOW *dst,
int sminrow, int smincol,
int dminrow, int dmincol, int dmaxrow, int dmaxcol,
int over)
{
int sx, sy, dx, dy;
int touched;
T(("copywin(%p, %p, %d, %d, %d, %d, %d, %d, %d)",
src, dst, sminrow, smincol, dminrow, dmincol, dmaxrow, dmaxcol, over));
/* make sure rectangle exists in source */
if ((sminrow + dmaxrow - dminrow) > (src->_maxy + 1) ||
(smincol + dmaxcol - dmincol) > (src->_maxx + 1)) {
return ERR;
}
T(("rectangle exists in source"));
/* make sure rectangle fits in destination */
if (dmaxrow > dst->_maxy || dmaxcol > dst->_maxx) {
return ERR;
}
T(("rectangle fits in destination"));
for (dy = dminrow, sy = sminrow; dy <= dmaxrow; sy++, dy++) {
touched=0;
for(dx=dmincol, sx=smincol; dx <= dmaxcol; sx++, dx++)
{
if (over)
{
if (((src->_line[sy].text[sx] & A_CHARTEXT)!=' ') &&
(dst->_line[dy].text[dx]!=src->_line[sy].text[sx]))
{
dst->_line[dy].text[dx] = src->_line[sy].text[sx];
touched=1;
}
}
else {
if (dst->_line[dy].text[dx] != src->_line[sy].text[sx])
{
dst->_line[dy].text[dx] = src->_line[sy].text[sx];
touched=1;
}
}
}
if (touched)
{
touchline(dst,0,getmaxy(dst));
}
}
T(("finished copywin"));
return OK;
}
|
