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
|
/*
* Copyright 2003, Sandro Giessl <ceebx@users.sourceforge.net>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License version 2 as published by the Free Software Foundation.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*/
#include <tqcolor.h>
#include "misc.h"
#include <tqimage.h>
#include <tqpixmap.h>
#include <endian.h>
#if __BYTE_ORDER == __LITTLE_ENDIAN
#undef WORDS_BIGENDIAN
#define WORDS_LITTLEENDIAN 1
#endif
#if __BYTE_ORDER == __BIG_ENDIAN
#undef WORDS_LITTLEENDIAN
#define WORDS_BIGENDIAN 1
#endif
TQColor alphaBlendColors(const TQColor &bgColor, const TQColor &fgColor, const int a)
{
TQRgb rgb = bgColor.rgb();
TQRgb rgb_b = fgColor.rgb();
uint alpha;
if(a > 255) alpha = 255;
else if(a < 0) alpha = 0;
else alpha = a;
uint inv_alpha = 255 - alpha;
return TQColor((tqRed(rgb_b)*inv_alpha + tqRed(rgb)*alpha)>>8,
(tqGreen(rgb_b)*inv_alpha + tqGreen(rgb)*alpha)>>8,
(tqBlue(rgb_b)*inv_alpha + tqBlue(rgb)*alpha)>>8 );
}
TQColor blendColors(const TQColor &bgColor, const TQColor &fgColor)
{
uint fg_r = fgColor.red();
uint fg_g = fgColor.green();
uint fg_b = fgColor.blue();
uint fg_a = tqAlpha(fgColor.rgb());
uint bg_r = bgColor.red();
uint bg_g = bgColor.green();
uint bg_b = bgColor.blue();
uint bg_a = tqAlpha(bgColor.rgb());
uint ac = 65025 - (255 - fg_a) * (255 - bg_a);
uint res_r = ((255 - fg_a) * bg_r * bg_a + fg_a * fg_r * 255 + 127) / ac;
uint res_g = ((255 - fg_a) * bg_g * bg_a + fg_a * fg_g * 255 + 127) / ac;
uint res_b = ((255 - fg_a) * bg_b * bg_a + fg_a * fg_b * 255 + 127) / ac;
uint res_a = (ac+127)/255;
return TQColor(tqRgba(res_r,res_g, res_b, res_a ));
}
TQImage tintImage(const TQImage &img, const TQColor &tintColor) {
TQImage *result = new TQImage(img.width(), img.height(), 32, 0, TQImage::IgnoreEndian);
result->setAlphaBuffer( true );
register uint *data = (unsigned int*) img.bits();
register uint *resultData = (unsigned int*) result->bits();
register uint total = img.width()*img.height();
for ( uint current = 0 ; current < total ; ++current ) {
resultData[ current ] = tqRgba( tintColor.red(), tintColor.green(), tintColor.blue(), tqAlpha( data[ current ] ));
}
return *result;
}
TQImage setImageOpacity(const TQImage &img, const uint &p) {
TQImage *result = new TQImage(img.width(), img.height(), 32, 0, TQImage::IgnoreEndian);
result->setAlphaBuffer( true );
register uint *data = (unsigned int*) img.bits();
register uint *resultData = (unsigned int*) result->bits();
register uint alpha;
register uint total = img.width()*img.height();
for ( uint current = 0 ; current < total ; ++current ) {
alpha = tqAlpha( data[ current ] ) * p / 100;
resultData[ current ] = tqRgba( tqRed( data[ current ] ), tqGreen( data[ current ] ), tqBlue( data[ current ] ), alpha );
}
return *result;
}
bool blend( const TQImage & upper, const TQImage & lower, TQImage & output)
// adopted from kimageeffect::blend - that is not endian safe and cannot handle complex alpha combinations...
{
if
(
upper.width() > lower.width() ||
upper.height() > lower.height() ||
upper.depth() != 32 ||
lower.depth() != 32
)
return false;
output = lower.copy();
uchar *i, *o;
register uint a, ab, ac;
register uint col;
register uint w = upper.width();
int row(upper.height() - 1);
do
{
i = upper.scanLine(row);
o = output.scanLine(row);
col = w << 2;
--col;
do
{
#ifdef WORDS_BIGENDIAN
while (!(a = i[col-3]) && (col != 3))
#else
while (!(a = i[col]) && (col != 3))
#endif
{
--col; --col; --col; --col;
}
#ifdef WORDS_BIGENDIAN
if ((ab = o[col-3]))
#else
if ((ab = o[col]))
#endif
{
ac = 65025 - (255 - a) * (255 - ab);
#ifndef WORDS_BIGENDIAN
o[col]= (ac+127)/255;
--col;
#endif
o[col] = ((255 - a) * o[col] * ab + a * i[col] * 255 + 127) / ac;
--col;
o[col] = ((255 - a) * o[col] * ab + a * i[col] * 255 + 127) / ac;
--col;
o[col] = ((255 - a) * o[col] * ab + a * i[col] * 255 + 127) / ac;
#ifdef WORDS_BIGENDIAN
--col;
o[col]= (ac+127)/255;
#endif
}
else
{
o[col] = i[col]; --col;
o[col] = i[col]; --col;
o[col] = i[col]; --col;
o[col] = i[col];
}
} while (col--);
} while (row--);
return true;
}
|
