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
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
|
/**
* $Id$
* ***** BEGIN GPL/BL DUAL LICENSE BLOCK *****
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version. The Blender
* Foundation also sells licenses for use in proprietary software under
* the Blender License. See http://www.blender.org/BL/ for information
* about this.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL/BL DUAL LICENSE BLOCK *****
*/
#include "IMG_PixmapRGBA32.h"
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
IMG_PixmapRGBA32::IMG_PixmapRGBA32(TUns32 width, TUns32 height)
: IMG_Pixmap(), m_mem(width * height)
{
m_image = m_mem;
m_width = width;
m_height = height;
m_rowBytes = width * sizeof(TPixelRGBA32);
m_pixelSize = 8 * sizeof(TPixelRGBA32);
m_pixelType = kPixelTypeRGBA32;
}
IMG_PixmapRGBA32::IMG_PixmapRGBA32(void* image, TUns32 width, TUns32 height, TUns32 rowBytes)
: IMG_Pixmap(), m_mem(image, width * rowBytes)
{
m_image = m_mem;
m_width = width;
m_height = height;
m_rowBytes = rowBytes;
m_pixelSize = 8 * sizeof(TPixelRGBA32);
m_pixelType = kPixelTypeRGBA32;
}
void IMG_PixmapRGBA32::fillRect(const IMG_Rect& r, const IMG_ColorRGB& c)
{
IMG_Rect t_bnds (0, 0, m_width, m_height); // Bounds of this pixmap
IMG_Rect r_bnds (r); // Area to set
// Determine visibility
TVisibility v = t_bnds.getVisibility(r_bnds);
if (v == kNotVisible) return;
if (v == kPartiallyVisible) {
// Clip the destination rectangle to the bounds of this pixmap
t_bnds.clip(r_bnds);
if (r_bnds.isEmpty()) {
return;
}
}
#if 0
// Set new pixels using shifting
// Prepare the pixel value to set
IMG_ColorRGBA ca (c);
TPixelRGBA32 pv = getPixelValue(c);
// Mask off the alpha bits
pv &= 0x00FFFFFF; //0xFFFFFF00;
// Set the pixels in the destination rectangle
for (TInt32 y = r.m_t; y < r.m_b; y++) {
// Park pixel pointer at the start pixels
TPixelPtr desPtr = getPixelPtr(r_bnds.m_l, y);
for (TInt32 x = r.m_l; x < r.m_r; x++) {
// Set the new pixel value (retain current alpha)
*(desPtr++) = pv | ((*desPtr) & 0xFF000000); //0x000000FF);
}
}
#else
// Set new values using byte indexing
//IMG_ColorRGBA ca (c);
TPixelRGBA32 src = getPixelValue(c);
TPixelPtr desPtr;
TUns8* srcBytes = (TUns8*) &src;
// Set the pixels in the destination rectangle
for (TInt32 y = r.m_t; y < r.m_b; y++) {
// Park pixel pointer at the start pixels
desPtr = getPixelPtr(r_bnds.m_l, y);
for (TInt32 x = r.m_l; x < r.m_r; x++) {
// Set the new pixel value (retain current alpha)
((TUns8*)desPtr)[bi_r] = srcBytes[bi_r];
((TUns8*)desPtr)[bi_g] = srcBytes[bi_g];
((TUns8*)desPtr)[bi_b] = srcBytes[bi_b];
desPtr++;
}
}
#endif
}
void IMG_PixmapRGBA32::fillRect(const IMG_Rect& r, const IMG_ColorRGBA& c)
{
IMG_Rect t_bnds (0, 0, m_width, m_height); // Bounds of this pixmap
IMG_Rect r_bnds (r); // Area to set
// Determine visibility
TVisibility v = t_bnds.getVisibility(r_bnds);
if (v == kNotVisible) return;
if (v == kPartiallyVisible) {
// Clip the destination rectangle to the bounds of this pixmap
t_bnds.clip(r_bnds);
if (r_bnds.isEmpty()) {
return;
}
}
// Set the pixels in the destination rectangle
TPixelRGBA32 pixel = getPixelValue(c);
for (TInt32 y = r.m_t; y < r.m_b; y++) {
// Park pixel pointer at the start pixels
TPixelPtr desPtr = getPixelPtr(r_bnds.m_l, y);
for (TInt32 x = r.m_l; x < r.m_r; x++) {
*(desPtr++) = pixel;
}
}
}
void IMG_PixmapRGBA32::setPixmap(TUns32 x, TUns32 y, const IMG_PixmapRGBA32& pixmap, const IMG_Rect& bnds)
{
IMG_Rect i_bnds (bnds); // Bounds of input pixmap
IMG_Rect t_bnds (0, 0, m_width, m_height); // Bounds of this pixmap
IMG_Rect p_bnds (bnds); // Bounds of the paste area
p_bnds.setCenter(x, y);
// The next check could be removed if the caller is made responsible for handing us non-empty rectangles
if (i_bnds.isEmpty()) {
// Nothing to do
return;
}
// Determine visibility of the paste area
TVisibility v = t_bnds.getVisibility(p_bnds);
if (v == kNotVisible) return;
if (v == kPartiallyVisible) {
// Clipping is needed
if (p_bnds.m_l < 0) {
i_bnds.m_l += p_bnds.m_l;
p_bnds.m_l = 0;
}
if (p_bnds.m_t < 0) {
i_bnds.m_t += p_bnds.m_t;
p_bnds.m_t = 0;
}
TInt32 d = p_bnds.getWidth();
if (p_bnds.m_r > d) {
i_bnds.m_t -= d - p_bnds.m_r;
p_bnds.m_t = d;
}
d = p_bnds.getHeight();
if (p_bnds.m_b > d) {
i_bnds.m_b -= d - p_bnds.m_b;
p_bnds.m_b = d;
}
}
// Iterate through the rows
for (TInt32 r = 0; r < p_bnds.getHeight(); r++) {
// Park pixel pointers at the start pixels
TPixelPtr srcPtr = getPixelPtr(i_bnds.m_l, i_bnds.m_t + r);
TPixelPtr desPtr = getPixelPtr(p_bnds.m_l, p_bnds.m_t + r);
// Iterate through the columns
for (int c = 0; c < p_bnds.getWidth(); c++) {
*(desPtr++) = *(srcPtr++);
}
}
}
void IMG_PixmapRGBA32::blendPixmap(TUns32 x, TUns32 y, const IMG_PixmapRGBA32& pixmap, const IMG_Rect& bnds)
{
IMG_Rect i_bnds (bnds); // Bounds of input pixmap
IMG_Rect t_bnds (0, 0, m_width, m_height); // Bounds of this pixmap
IMG_Rect p_bnds (bnds); // Bounds of the paste area
p_bnds.setCenter(x, y);
// The next check could be removed if the caller is made responsible for handing us non-empty rectangles
if (i_bnds.isEmpty()) {
// Nothing to do
return;
}
// Determine visibility of the paste area
TVisibility v = t_bnds.getVisibility(p_bnds);
if (v == kNotVisible) return;
if (v == kPartiallyVisible) {
// Clipping is needed
if (p_bnds.m_l < 0) {
i_bnds.m_l += -p_bnds.m_l;
p_bnds.m_l = 0;
}
if (p_bnds.m_t < 0) {
i_bnds.m_t += -p_bnds.m_t;
p_bnds.m_t = 0;
}
TInt32 d = t_bnds.getWidth();
if (p_bnds.m_r > d) {
i_bnds.m_r -= p_bnds.m_r - d;
p_bnds.m_r = d;
}
d = t_bnds.getHeight();
if (p_bnds.m_b > d) {
i_bnds.m_b -= p_bnds.m_b - d;
p_bnds.m_b = d;
}
}
IMG_ColorRGBA srcColor;
IMG_ColorRGBA desColor;
// Iterate through the rows
for (int r = 0; r < p_bnds.getHeight(); r++) {
// Park pixel pointers at the start pixels
TPixelPtr srcPtr = pixmap.getPixelPtr(i_bnds.m_l, i_bnds.m_t + r);
TPixelPtr desPtr = getPixelPtr(p_bnds.m_l, p_bnds.m_t + r);
// Iterate through the columns
for (int c = 0; c < p_bnds.getWidth(); c++) {
// Retrieve colors from source and destination pixmaps
getColor(*srcPtr, srcColor);
getColor(*desPtr, desColor);
// Blend the colors
desColor.blendColor(srcColor);
// Write color back to destination pixmap
*desPtr = getPixelValue(desColor);
srcPtr++;
desPtr++;
}
}
}
void IMG_PixmapRGBA32::blendPixmap(float u, float v, const IMG_PixmapRGBA32& pixmap)
{
TUns32 x, y;
getPixelAddress(u, v, x, y);
blendPixmap(x, y, pixmap);
}
|