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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
/****************************************************************************
* Copyright (c) 1998-2006,2007 Free Software Foundation, Inc. *
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
/****************************************************************************
* Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
* and: Eric S. Raymond <esr@snark.thyrsus.com> *
****************************************************************************/
/*
** lib_overlay.c
**
** The routines overlay(), copywin(), and overwrite().
**
*/
#include <curses.priv.h>
MODULE_ID("$Id: lib_overlay.c,v 1.25 2008/04/12 17:21:59 tom Exp $")
static int
overlap(const WINDOW *const src, WINDOW *const dst, int const flag)
{
int rc = ERR;
int sx1, sy1, sx2, sy2;
int dx1, dy1, dx2, dy2;
int sminrow, smincol;
int dminrow, dmincol;
int dmaxrow, dmaxcol;
T((T_CALLED("overlap(%p,%p,%d)"), src, dst, flag));
if (src != 0 && dst != 0) {
_nc_lock_window(src);
_nc_lock_window(dst);
T(("src : begy %ld, begx %ld, maxy %ld, maxx %ld",
(long) src->_begy,
(long) src->_begx,
(long) src->_maxy,
(long) src->_maxx));
T(("dst : begy %ld, begx %ld, maxy %ld, maxx %ld",
(long) dst->_begy,
(long) dst->_begx,
(long) dst->_maxy,
(long) dst->_maxx));
sx1 = src->_begx;
sy1 = src->_begy;
sx2 = sx1 + src->_maxx;
sy2 = sy1 + src->_maxy;
dx1 = dst->_begx;
dy1 = dst->_begy;
dx2 = dx1 + dst->_maxx;
dy2 = dy1 + dst->_maxy;
if (dx2 >= sx1 && dx1 <= sx2 && dy2 >= sy1 && dy1 <= sy2) {
sminrow = max(sy1, dy1) - sy1;
smincol = max(sx1, dx1) - sx1;
dminrow = max(sy1, dy1) - dy1;
dmincol = max(sx1, dx1) - dx1;
dmaxrow = min(sy2, dy2) - dy1;
dmaxcol = min(sx2, dx2) - dx1;
rc = copywin(src, dst,
sminrow, smincol,
dminrow, dmincol,
dmaxrow, dmaxcol,
flag);
}
_nc_unlock_window(dst);
_nc_unlock_window(src);
}
returnCode(rc);
}
/*
**
** overlay(win1, win2)
**
**
** overlay() writes the overlapping area of win1 behind win2
** on win2 non-destructively.
**
**/
NCURSES_EXPORT(int)
overlay(const WINDOW *win1, WINDOW *win2)
{
T((T_CALLED("overlay(%p,%p)"), win1, win2));
returnCode(overlap(win1, win2, TRUE));
}
/*
**
** overwrite(win1, win2)
**
**
** overwrite() writes the overlapping area of win1 behind win2
** on win2 destructively.
**
**/
NCURSES_EXPORT(int)
overwrite(const WINDOW *win1, WINDOW *win2)
{
T((T_CALLED("overwrite(%p,%p)"), win1, win2));
returnCode(overlap(win1, win2, FALSE));
}
NCURSES_EXPORT(int)
copywin(const WINDOW *src, WINDOW *dst,
int sminrow, int smincol,
int dminrow, int dmincol,
int dmaxrow, int dmaxcol,
int over)
{
int rc = ERR;
int sx, sy, dx, dy;
bool touched;
attr_t bk;
attr_t mask;
T((T_CALLED("copywin(%p, %p, %d, %d, %d, %d, %d, %d, %d)"),
src, dst, sminrow, smincol, dminrow, dmincol, dmaxrow, dmaxcol, over));
if (src && dst) {
_nc_lock_window(src);
_nc_lock_window(dst);
bk = AttrOf(dst->_nc_bkgd);
mask = ~(attr_t) ((bk & A_COLOR) ? A_COLOR : 0);
/* make sure rectangle exists in source */
if ((sminrow + dmaxrow - dminrow) <= (src->_maxy + 1) &&
(smincol + dmaxcol - dmincol) <= (src->_maxx + 1)) {
T(("rectangle exists in source"));
/* make sure rectangle fits in destination */
if (dmaxrow <= dst->_maxy && dmaxcol <= dst->_maxx) {
T(("rectangle fits in destination"));
for (dy = dminrow, sy = sminrow;
dy <= dmaxrow;
sy++, dy++) {
touched = FALSE;
for (dx = dmincol, sx = smincol;
dx <= dmaxcol;
sx++, dx++) {
if (over) {
if ((CharOf(src->_line[sy].text[sx]) != L(' ')) &&
(!CharEq(dst->_line[dy].text[dx],
src->_line[sy].text[sx]))) {
dst->_line[dy].text[dx] =
src->_line[sy].text[sx];
SetAttr(dst->_line[dy].text[dx],
((AttrOf(src->_line[sy].text[sx]) &
mask) | bk));
touched = TRUE;
}
} else {
if (!CharEq(dst->_line[dy].text[dx],
src->_line[sy].text[sx])) {
dst->_line[dy].text[dx] =
src->_line[sy].text[sx];
touched = TRUE;
}
}
}
if (touched) {
touchline(dst, dminrow, (dmaxrow - dminrow + 1));
}
}
T(("finished copywin"));
rc = OK;
}
}
_nc_unlock_window(dst);
_nc_unlock_window(src);
}
returnCode(rc);
}
|
