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
265
266
267
268
269
270
271
272
273
274
275
276
|
/*
* AltiVec optimizations for libjpeg-turbo
*
* Copyright (C) 2015, D. R. Commander. All Rights Reserved.
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable for any damages
* arising from the use of this software.
*
* Permission is granted to anyone to use this software for any purpose,
* including commercial applications, and to alter it and redistribute it
* freely, subject to the following restrictions:
*
* 1. The origin of this software must not be misrepresented; you must not
* claim that you wrote the original software. If you use this software
* in a product, an acknowledgment in the product documentation would be
* appreciated but is not required.
* 2. Altered source versions must be plainly marked as such, and must not be
* misrepresented as being the original software.
* 3. This notice may not be removed or altered from any source distribution.
*/
/* This file is included by jdcolor-altivec.c */
void jsimd_ycc_rgb_convert_altivec(JDIMENSION out_width, JSAMPIMAGE input_buf,
JDIMENSION input_row, JSAMPARRAY output_buf,
int num_rows)
{
JSAMPROW outptr, inptr0, inptr1, inptr2;
int pitch = out_width * RGB_PIXELSIZE, num_cols;
#if __BIG_ENDIAN__
int offset;
#endif
unsigned char __attribute__((aligned(16))) tmpbuf[RGB_PIXELSIZE * 16];
__vector unsigned char rgb0, rgb1, rgb2, rgbx0, rgbx1, rgbx2, rgbx3,
y, cb, cr;
#if __BIG_ENDIAN__
__vector unsigned char edgel, edgeh, edges, out0, out1, out2, out3;
#if RGB_PIXELSIZE == 4
__vector unsigned char out4;
#endif
#endif
#if RGB_PIXELSIZE == 4
__vector unsigned char rgb3;
#endif
__vector short rg0, rg1, rg2, rg3, bx0, bx1, bx2, bx3, yl, yh, cbl, cbh,
crl, crh, rl, rh, gl, gh, bl, bh, g0w, g1w, g2w, g3w;
__vector int g0, g1, g2, g3;
/* Constants
* NOTE: The >> 1 is to compensate for the fact that vec_madds() returns 17
* high-order bits, not 16.
*/
__vector short pw_f0402 = { __8X(F_0_402 >> 1) },
pw_mf0228 = { __8X(-F_0_228 >> 1) },
pw_mf0344_f0285 = { __4X2(-F_0_344, F_0_285) },
pw_one = { __8X(1) }, pw_255 = { __8X(255) },
pw_cj = { __8X(CENTERJSAMPLE) };
__vector int pd_onehalf = { __4X(ONE_HALF) };
__vector unsigned char pb_zero = { __16X(0) },
#if __BIG_ENDIAN__
shift_pack_index =
{ 0, 1, 4, 5, 8, 9, 12, 13, 16, 17, 20, 21, 24, 25, 28, 29 };
#else
shift_pack_index =
{ 2, 3, 6, 7, 10, 11, 14, 15, 18, 19, 22, 23, 26, 27, 30, 31 };
#endif
while (--num_rows >= 0) {
inptr0 = input_buf[0][input_row];
inptr1 = input_buf[1][input_row];
inptr2 = input_buf[2][input_row];
input_row++;
outptr = *output_buf++;
for (num_cols = pitch; num_cols > 0;
num_cols -= RGB_PIXELSIZE * 16, outptr += RGB_PIXELSIZE * 16,
inptr0 += 16, inptr1 += 16, inptr2 += 16) {
y = vec_ld(0, inptr0);
/* NOTE: We have to use vec_merge*() here because vec_unpack*() doesn't
* support unsigned vectors.
*/
yl = (__vector signed short)VEC_UNPACKHU(y);
yh = (__vector signed short)VEC_UNPACKLU(y);
cb = vec_ld(0, inptr1);
cbl = (__vector signed short)VEC_UNPACKHU(cb);
cbh = (__vector signed short)VEC_UNPACKLU(cb);
cbl = vec_sub(cbl, pw_cj);
cbh = vec_sub(cbh, pw_cj);
cr = vec_ld(0, inptr2);
crl = (__vector signed short)VEC_UNPACKHU(cr);
crh = (__vector signed short)VEC_UNPACKLU(cr);
crl = vec_sub(crl, pw_cj);
crh = vec_sub(crh, pw_cj);
/* (Original)
* R = Y + 1.40200 * Cr
* G = Y - 0.34414 * Cb - 0.71414 * Cr
* B = Y + 1.77200 * Cb
*
* (This implementation)
* R = Y + 0.40200 * Cr + Cr
* G = Y - 0.34414 * Cb + 0.28586 * Cr - Cr
* B = Y - 0.22800 * Cb + Cb + Cb
*/
bl = vec_add(cbl, cbl);
bh = vec_add(cbh, cbh);
bl = vec_madds(bl, pw_mf0228, pw_one);
bh = vec_madds(bh, pw_mf0228, pw_one);
bl = vec_sra(bl, (__vector unsigned short)pw_one);
bh = vec_sra(bh, (__vector unsigned short)pw_one);
bl = vec_add(bl, cbl);
bh = vec_add(bh, cbh);
bl = vec_add(bl, cbl);
bh = vec_add(bh, cbh);
bl = vec_add(bl, yl);
bh = vec_add(bh, yh);
rl = vec_add(crl, crl);
rh = vec_add(crh, crh);
rl = vec_madds(rl, pw_f0402, pw_one);
rh = vec_madds(rh, pw_f0402, pw_one);
rl = vec_sra(rl, (__vector unsigned short)pw_one);
rh = vec_sra(rh, (__vector unsigned short)pw_one);
rl = vec_add(rl, crl);
rh = vec_add(rh, crh);
rl = vec_add(rl, yl);
rh = vec_add(rh, yh);
g0w = vec_mergeh(cbl, crl);
g1w = vec_mergel(cbl, crl);
g0 = vec_msums(g0w, pw_mf0344_f0285, pd_onehalf);
g1 = vec_msums(g1w, pw_mf0344_f0285, pd_onehalf);
g2w = vec_mergeh(cbh, crh);
g3w = vec_mergel(cbh, crh);
g2 = vec_msums(g2w, pw_mf0344_f0285, pd_onehalf);
g3 = vec_msums(g3w, pw_mf0344_f0285, pd_onehalf);
/* Clever way to avoid 4 shifts + 2 packs. This packs the high word from
* each dword into a new 16-bit vector, which is the equivalent of
* descaling the 32-bit results (right-shifting by 16 bits) and then
* packing them.
*/
gl = vec_perm((__vector short)g0, (__vector short)g1, shift_pack_index);
gh = vec_perm((__vector short)g2, (__vector short)g3, shift_pack_index);
gl = vec_sub(gl, crl);
gh = vec_sub(gh, crh);
gl = vec_add(gl, yl);
gh = vec_add(gh, yh);
rg0 = vec_mergeh(rl, gl);
bx0 = vec_mergeh(bl, pw_255);
rg1 = vec_mergel(rl, gl);
bx1 = vec_mergel(bl, pw_255);
rg2 = vec_mergeh(rh, gh);
bx2 = vec_mergeh(bh, pw_255);
rg3 = vec_mergel(rh, gh);
bx3 = vec_mergel(bh, pw_255);
rgbx0 = vec_packsu(rg0, bx0);
rgbx1 = vec_packsu(rg1, bx1);
rgbx2 = vec_packsu(rg2, bx2);
rgbx3 = vec_packsu(rg3, bx3);
#if RGB_PIXELSIZE == 3
/* rgbx0 = R0 G0 R1 G1 R2 G2 R3 G3 B0 X0 B1 X1 B2 X2 B3 X3
* rgbx1 = R4 G4 R5 G5 R6 G6 R7 G7 B4 X4 B5 X5 B6 X6 B7 X7
* rgbx2 = R8 G8 R9 G9 Ra Ga Rb Gb B8 X8 B9 X9 Ba Xa Bb Xb
* rgbx3 = Rc Gc Rd Gd Re Ge Rf Gf Bc Xc Bd Xd Be Xe Bf Xf
*
* rgb0 = R0 G0 B0 R1 G1 B1 R2 G2 B2 R3 G3 B3 R4 G4 B4 R5
* rgb1 = G5 B5 R6 G6 B6 R7 G7 B7 R8 G8 B8 R9 G9 B9 Ra Ga
* rgb2 = Ba Rb Gb Bb Rc Gc Bc Rd Gd Bd Re Ge Be Rf Gf Bf
*/
rgb0 = vec_perm(rgbx0, rgbx1, (__vector unsigned char)RGB_INDEX0);
rgb1 = vec_perm(rgbx1, rgbx2, (__vector unsigned char)RGB_INDEX1);
rgb2 = vec_perm(rgbx2, rgbx3, (__vector unsigned char)RGB_INDEX2);
#else
/* rgbx0 = R0 G0 R1 G1 R2 G2 R3 G3 B0 X0 B1 X1 B2 X2 B3 X3
* rgbx1 = R4 G4 R5 G5 R6 G6 R7 G7 B4 X4 B5 X5 B6 X6 B7 X7
* rgbx2 = R8 G8 R9 G9 Ra Ga Rb Gb B8 X8 B9 X9 Ba Xa Bb Xb
* rgbx3 = Rc Gc Rd Gd Re Ge Rf Gf Bc Xc Bd Xd Be Xe Bf Xf
*
* rgb0 = R0 G0 B0 X0 R1 G1 B1 X1 R2 G2 B2 X2 R3 G3 B3 X3
* rgb1 = R4 G4 B4 X4 R5 G5 B5 X5 R6 G6 B6 X6 R7 G7 B7 X7
* rgb2 = R8 G8 B8 X8 R9 G9 B9 X9 Ra Ga Ba Xa Rb Gb Bb Xb
* rgb3 = Rc Gc Bc Xc Rd Gd Bd Xd Re Ge Be Xe Rf Gf Bf Xf
*/
rgb0 = vec_perm(rgbx0, rgbx0, (__vector unsigned char)RGB_INDEX);
rgb1 = vec_perm(rgbx1, rgbx1, (__vector unsigned char)RGB_INDEX);
rgb2 = vec_perm(rgbx2, rgbx2, (__vector unsigned char)RGB_INDEX);
rgb3 = vec_perm(rgbx3, rgbx3, (__vector unsigned char)RGB_INDEX);
#endif
#if __BIG_ENDIAN__
offset = (size_t)outptr & 15;
if (offset) {
__vector unsigned char unaligned_shift_index;
int bytes = num_cols + offset;
if (bytes < (RGB_PIXELSIZE + 1) * 16 && (bytes & 15)) {
/* Slow path to prevent buffer overwrite. Since there is no way to
* write a partial AltiVec register, overwrite would occur on the
* last chunk of the last image row if the right edge is not on a
* 16-byte boundary. It could also occur on other rows if the bytes
* per row is low enough. Since we can't determine whether we're on
* the last image row, we have to assume every row is the last.
*/
vec_st(rgb0, 0, tmpbuf);
vec_st(rgb1, 16, tmpbuf);
vec_st(rgb2, 32, tmpbuf);
#if RGB_PIXELSIZE == 4
vec_st(rgb3, 48, tmpbuf);
#endif
memcpy(outptr, tmpbuf, min(num_cols, RGB_PIXELSIZE * 16));
} else {
/* Fast path */
unaligned_shift_index = vec_lvsl(0, outptr);
edgel = vec_ld(0, outptr);
edgeh = vec_ld(min(num_cols - 1, RGB_PIXELSIZE * 16), outptr);
edges = vec_perm(edgeh, edgel, unaligned_shift_index);
unaligned_shift_index = vec_lvsr(0, outptr);
out0 = vec_perm(edges, rgb0, unaligned_shift_index);
out1 = vec_perm(rgb0, rgb1, unaligned_shift_index);
out2 = vec_perm(rgb1, rgb2, unaligned_shift_index);
#if RGB_PIXELSIZE == 4
out3 = vec_perm(rgb2, rgb3, unaligned_shift_index);
out4 = vec_perm(rgb3, edges, unaligned_shift_index);
#else
out3 = vec_perm(rgb2, edges, unaligned_shift_index);
#endif
vec_st(out0, 0, outptr);
if (bytes > 16)
vec_st(out1, 16, outptr);
if (bytes > 32)
vec_st(out2, 32, outptr);
if (bytes > 48)
vec_st(out3, 48, outptr);
#if RGB_PIXELSIZE == 4
if (bytes > 64)
vec_st(out4, 64, outptr);
#endif
}
} else {
#endif /* __BIG_ENDIAN__ */
if (num_cols < RGB_PIXELSIZE * 16 && (num_cols & 15)) {
/* Slow path */
VEC_ST(rgb0, 0, tmpbuf);
VEC_ST(rgb1, 16, tmpbuf);
VEC_ST(rgb2, 32, tmpbuf);
#if RGB_PIXELSIZE == 4
VEC_ST(rgb3, 48, tmpbuf);
#endif
memcpy(outptr, tmpbuf, min(num_cols, RGB_PIXELSIZE * 16));
} else {
/* Fast path */
VEC_ST(rgb0, 0, outptr);
if (num_cols > 16)
VEC_ST(rgb1, 16, outptr);
if (num_cols > 32)
VEC_ST(rgb2, 32, outptr);
#if RGB_PIXELSIZE == 4
if (num_cols > 48)
VEC_ST(rgb3, 48, outptr);
#endif
}
#if __BIG_ENDIAN__
}
#endif
}
}
}
|
