painting/qmemrotate.cpp

Source codeSwitch to Preprocessed file
LineSource CodeCoverage
1/**************************************************************************** -
2** -
3** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies). -
4** Contact: http://www.qt-project.org/legal -
5** -
6** This file is part of the QtGui module of the Qt Toolkit. -
7** -
8** $QT_BEGIN_LICENSE:LGPL$ -
9** Commercial License Usage -
10** Licensees holding valid commercial Qt licenses may use this file in -
11** accordance with the commercial license agreement provided with the -
12** Software or, alternatively, in accordance with the terms contained in -
13** a written agreement between you and Digia. For licensing terms and -
14** conditions see http://qt.digia.com/licensing. For further information -
15** use the contact form at http://qt.digia.com/contact-us. -
16** -
17** GNU Lesser General Public License Usage -
18** Alternatively, this file may be used under the terms of the GNU Lesser -
19** General Public License version 2.1 as published by the Free Software -
20** Foundation and appearing in the file LICENSE.LGPL included in the -
21** packaging of this file. Please review the following information to -
22** ensure the GNU Lesser General Public License version 2.1 requirements -
23** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. -
24** -
25** In addition, as a special exception, Digia gives you certain additional -
26** rights. These rights are described in the Digia Qt LGPL Exception -
27** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. -
28** -
29** GNU General Public License Usage -
30** Alternatively, this file may be used under the terms of the GNU -
31** General Public License version 3.0 as published by the Free Software -
32** Foundation and appearing in the file LICENSE.GPL included in the -
33** packaging of this file. Please review the following information to -
34** ensure the GNU General Public License version 3.0 requirements will be -
35** met: http://www.gnu.org/copyleft/gpl.html. -
36** -
37** -
38** $QT_END_LICENSE$ -
39** -
40****************************************************************************/ -
41 -
42#include "private/qmemrotate_p.h" -
43 -
44QT_BEGIN_NAMESPACE -
45 -
46#if QT_ROTATION_ALGORITHM == QT_ROTATION_TILED -
47static const int tileSize = 32; -
48#endif -
49 -
50#if Q_BYTE_ORDER == Q_BIG_ENDIAN -
51#if QT_ROTATION_ALGORITHM == QT_ROTATION_PACKED || QT_ROTATION_ALGORITHM == QT_ROTATION_TILED -
52#error Big endian version not implemented for the transformed driver! -
53#endif -
54#endif -
55 -
56template <class T> -
57Q_STATIC_TEMPLATE_FUNCTION -
58inline void qt_memrotate90_cachedRead(const T *src, int w, int h, int sstride, T *dest, -
59 int dstride) -
60{ -
61 const char *s = reinterpret_cast<const char*>(src);
never executed (the execution status of this line is deduced): const char *s = reinterpret_cast<const char*>(src);
-
62 char *d = reinterpret_cast<char*>(dest);
never executed (the execution status of this line is deduced): char *d = reinterpret_cast<char*>(dest);
-
63 for (int y = 0; y < h; ++y) {
never evaluated: y < h
0
64 for (int x = w - 1; x >= 0; --x) {
never evaluated: x >= 0
0
65 T *destline = reinterpret_cast<T *>(d + (w - x - 1) * dstride);
never executed (the execution status of this line is deduced): T *destline = reinterpret_cast<T *>(d + (w - x - 1) * dstride);
-
66 destline[y] = src[x];
never executed (the execution status of this line is deduced): destline[y] = src[x];
-
67 }
never executed: }
0
68 s += sstride;
never executed (the execution status of this line is deduced): s += sstride;
-
69 src = reinterpret_cast<const T*>(s);
never executed (the execution status of this line is deduced): src = reinterpret_cast<const T*>(s);
-
70 }
never executed: }
0
71}
never executed: }
0
72 -
73template <class T> -
74Q_STATIC_TEMPLATE_FUNCTION -
75inline void qt_memrotate270_cachedRead(const T *src, int w, int h, int sstride, T *dest, -
76 int dstride) -
77{ -
78 const char *s = reinterpret_cast<const char*>(src);
never executed (the execution status of this line is deduced): const char *s = reinterpret_cast<const char*>(src);
-
79 char *d = reinterpret_cast<char*>(dest);
never executed (the execution status of this line is deduced): char *d = reinterpret_cast<char*>(dest);
-
80 s += (h - 1) * sstride;
never executed (the execution status of this line is deduced): s += (h - 1) * sstride;
-
81 for (int y = h - 1; y >= 0; --y) {
never evaluated: y >= 0
0
82 src = reinterpret_cast<const T*>(s);
never executed (the execution status of this line is deduced): src = reinterpret_cast<const T*>(s);
-
83 for (int x = 0; x < w; ++x) {
never evaluated: x < w
0
84 T *destline = reinterpret_cast<T *>(d + x * dstride);
never executed (the execution status of this line is deduced): T *destline = reinterpret_cast<T *>(d + x * dstride);
-
85 destline[h - y - 1] = src[x];
never executed (the execution status of this line is deduced): destline[h - y - 1] = src[x];
-
86 }
never executed: }
0
87 s -= sstride;
never executed (the execution status of this line is deduced): s -= sstride;
-
88 }
never executed: }
0
89}
never executed: }
0
90 -
91#if QT_ROTATION_ALGORITHM == QT_ROTATION_CACHEDWRITE -
92 -
93template <class T> -
94Q_STATIC_TEMPLATE_FUNCTION -
95inline void qt_memrotate90_cachedWrite(const T *src, int w, int h, int sstride, T *dest, -
96 int dstride) -
97{ -
98 for (int x = w - 1; x >= 0; --x) { -
99 T *d = dest + (w - x - 1) * dstride; -
100 for (int y = 0; y < h; ++y) { -
101 *d++ = src[y * sstride + x]; -
102 } -
103 } -
104 -
105} -
106 -
107template <class T> -
108Q_STATIC_TEMPLATE_FUNCTION -
109inline void qt_memrotate270_cachedWrite(const T *src, int w, int h, int sstride, T *dest, -
110 int dstride) -
111{ -
112 for (int x = 0; x < w; ++x) { -
113 T *d = dest + x * dstride; -
114 for (int y = h - 1; y >= 0; --y) { -
115 *d++ = src[y * sstride + x]; -
116 } -
117 } -
118} -
119 -
120#endif // QT_ROTATION_CACHEDWRITE -
121 -
122#if QT_ROTATION_ALGORITHM == QT_ROTATION_PACKING -
123 -
124// TODO: packing algorithms should probably be modified on 64-bit architectures -
125 -
126template <class T> -
127Q_STATIC_TEMPLATE_FUNCTION -
128inline void qt_memrotate90_packing(const T *src, int w, int h, int sstride, T *dest, int dstride) -
129{ -
130 sstride /= sizeof(T); -
131 dstride /= sizeof(T); -
132 -
133 const int pack = sizeof(quint32) / sizeof(T); -
134 const int unaligned = int((long(dest) & (sizeof(quint32)-1))) / sizeof(T); -
135 -
136 for (int x = w - 1; x >= 0; --x) { -
137 int y = 0; -
138 -
139 for (int i = 0; i < unaligned; ++i) { -
140 dest[(w - x - 1) * dstride + y] = src[y * sstride + x]; -
141 ++y; -
142 } -
143 -
144 quint32 *d = reinterpret_cast<quint32*>(dest + (w - x - 1) * dstride -
145 + unaligned); -
146 const int rest = (h - unaligned) % pack; -
147 while (y < h - rest) { -
148 quint32 c = src[y * sstride + x]; -
149 for (int i = 1; i < pack; ++i) { -
150 c |= src[(y + i) * sstride + x] << (sizeof(int) * 8 / pack * i); -
151 } -
152 *d++ = c; -
153 y += pack; -
154 } -
155 -
156 while (y < h) { -
157 dest[(w - x - 1) * dstride + y] = src[y * sstride + x]; -
158 ++y; -
159 } -
160 } -
161} -
162 -
163template <class T> -
164Q_STATIC_TEMPLATE_FUNCTION -
165inline void qt_memrotate270_packing(const T *src, int w, int h, int sstride, T *dest, int dstride) -
166{ -
167 sstride /= sizeof(T); -
168 dstride /= sizeof(T); -
169 -
170 const int pack = sizeof(quint32) / sizeof(T); -
171 const int unaligned = int((long(dest) & (sizeof(quint32)-1))) / sizeof(T); -
172 -
173 for (int x = 0; x < w; ++x) { -
174 int y = h - 1; -
175 -
176 for (int i = 0; i < unaligned; ++i) { -
177 dest[x * dstride + h - y - 1] = src[y * sstride + x]; -
178 --y; -
179 } -
180 -
181 quint32 *d = reinterpret_cast<quint32*>(dest + x * dstride -
182 + unaligned); -
183 const int rest = (h - unaligned) % pack; -
184 while (y > rest) { -
185 quint32 c = src[y * sstride + x]; -
186 for (int i = 1; i < pack; ++i) { -
187 c |= src[(y - i) * sstride + x] << (sizeof(int) * 8 / pack * i); -
188 } -
189 *d++ = c; -
190 y -= pack; -
191 } -
192 while (y >= 0) { -
193 dest[x * dstride + h - y - 1] = src[y * sstride + x]; -
194 --y; -
195 } -
196 } -
197} -
198 -
199#endif // QT_ROTATION_PACKING -
200 -
201#if QT_ROTATION_ALGORITHM == QT_ROTATION_TILED -
202template <class T> -
203Q_STATIC_TEMPLATE_FUNCTION -
204inline void qt_memrotate90_tiled(const T *src, int w, int h, int sstride, T *dest, int dstride) -
205{ -
206 sstride /= sizeof(T);
executed (the execution status of this line is deduced): sstride /= sizeof(T);
-
207 dstride /= sizeof(T);
executed (the execution status of this line is deduced): dstride /= sizeof(T);
-
208 -
209 const int pack = sizeof(quint32) / sizeof(T);
executed (the execution status of this line is deduced): const int pack = sizeof(quint32) / sizeof(T);
-
210 const int unaligned =
executed (the execution status of this line is deduced): const int unaligned =
-
211 qMin(uint((quintptr(dest) & (sizeof(quint32)-1)) / sizeof(T)), uint(h));
executed (the execution status of this line is deduced): qMin(uint((quintptr(dest) & (sizeof(quint32)-1)) / sizeof(T)), uint(h));
-
212 const int restX = w % tileSize;
executed (the execution status of this line is deduced): const int restX = w % tileSize;
-
213 const int restY = (h - unaligned) % tileSize;
executed (the execution status of this line is deduced): const int restY = (h - unaligned) % tileSize;
-
214 const int unoptimizedY = restY % pack;
executed (the execution status of this line is deduced): const int unoptimizedY = restY % pack;
-
215 const int numTilesX = w / tileSize + (restX > 0);
executed (the execution status of this line is deduced): const int numTilesX = w / tileSize + (restX > 0);
-
216 const int numTilesY = (h - unaligned) / tileSize + (restY >= pack);
executed (the execution status of this line is deduced): const int numTilesY = (h - unaligned) / tileSize + (restY >= pack);
-
217 -
218 for (int tx = 0; tx < numTilesX; ++tx) {
evaluated: tx < numTilesX
TRUEFALSE
yes
Evaluation Count:127
yes
Evaluation Count:36
36-127
219 const int startx = w - tx * tileSize - 1;
executed (the execution status of this line is deduced): const int startx = w - tx * tileSize - 1;
-
220 const int stopx = qMax(startx - tileSize, 0);
executed (the execution status of this line is deduced): const int stopx = qMax(startx - tileSize, 0);
-
221 -
222 if (unaligned) {
partially evaluated: unaligned
TRUEFALSE
no
Evaluation Count:0
yes
Evaluation Count:127
0-127
223 for (int x = startx; x >= stopx; --x) {
never evaluated: x >= stopx
0
224 T *d = dest + (w - x - 1) * dstride;
never executed (the execution status of this line is deduced): T *d = dest + (w - x - 1) * dstride;
-
225 for (int y = 0; y < unaligned; ++y) {
never evaluated: y < unaligned
0
226 *d++ = src[y * sstride + x];
never executed (the execution status of this line is deduced): *d++ = src[y * sstride + x];
-
227 }
never executed: }
0
228 }
never executed: }
0
229 }
never executed: }
0
230 -
231 for (int ty = 0; ty < numTilesY; ++ty) {
evaluated: ty < numTilesY
TRUEFALSE
yes
Evaluation Count:547
yes
Evaluation Count:127
127-547
232 const int starty = ty * tileSize + unaligned;
executed (the execution status of this line is deduced): const int starty = ty * tileSize + unaligned;
-
233 const int stopy = qMin(starty + tileSize, h - unoptimizedY);
executed (the execution status of this line is deduced): const int stopy = qMin(starty + tileSize, h - unoptimizedY);
-
234 -
235 for (int x = startx; x >= stopx; --x) {
evaluated: x >= stopx
TRUEFALSE
yes
Evaluation Count:16678
yes
Evaluation Count:547
547-16678
236 quint32 *d = reinterpret_cast<quint32*>(dest + (w - x - 1) * dstride + starty);
executed (the execution status of this line is deduced): quint32 *d = reinterpret_cast<quint32*>(dest + (w - x - 1) * dstride + starty);
-
237 for (int y = starty; y < stopy; y += pack) {
evaluated: y < stopy
TRUEFALSE
yes
Evaluation Count:478676
yes
Evaluation Count:16678
16678-478676
238 quint32 c = src[y * sstride + x];
executed (the execution status of this line is deduced): quint32 c = src[y * sstride + x];
-
239 for (int i = 1; i < pack; ++i) {
evaluated: i < pack
TRUEFALSE
yes
Evaluation Count:5112
yes
Evaluation Count:478676
5112-478676
240 const int shift = (sizeof(int) * 8 / pack * i);
executed (the execution status of this line is deduced): const int shift = (sizeof(int) * 8 / pack * i);
-
241 const T color = src[(y + i) * sstride + x];
executed (the execution status of this line is deduced): const T color = src[(y + i) * sstride + x];
-
242 c |= color << shift;
executed (the execution status of this line is deduced): c |= color << shift;
-
243 }
executed: }
Execution Count:5112
5112
244 *d++ = c;
executed (the execution status of this line is deduced): *d++ = c;
-
245 }
executed: }
Execution Count:478676
478676
246 }
executed: }
Execution Count:16678
16678
247 }
executed: }
Execution Count:547
547
248 -
249 if (unoptimizedY) {
evaluated: unoptimizedY
TRUEFALSE
yes
Evaluation Count:14
yes
Evaluation Count:113
14-113
250 const int starty = h - unoptimizedY;
executed (the execution status of this line is deduced): const int starty = h - unoptimizedY;
-
251 for (int x = startx; x >= stopx; --x) {
evaluated: x >= stopx
TRUEFALSE
yes
Evaluation Count:356
yes
Evaluation Count:14
14-356
252 T *d = dest + (w - x - 1) * dstride + starty;
executed (the execution status of this line is deduced): T *d = dest + (w - x - 1) * dstride + starty;
-
253 for (int y = starty; y < h; ++y) {
evaluated: y < h
TRUEFALSE
yes
Evaluation Count:382
yes
Evaluation Count:356
356-382
254 *d++ = src[y * sstride + x];
executed (the execution status of this line is deduced): *d++ = src[y * sstride + x];
-
255 }
executed: }
Execution Count:382
382
256 }
executed: }
Execution Count:356
356
257 }
executed: }
Execution Count:14
14
258 }
executed: }
Execution Count:127
127
259}
executed: }
Execution Count:36
36
260 -
261template <class T> -
262Q_STATIC_TEMPLATE_FUNCTION -
263inline void qt_memrotate90_tiled_unpacked(const T *src, int w, int h, int sstride, T *dest, -
264 int dstride) -
265{ -
266 const int numTilesX = (w + tileSize - 1) / tileSize;
executed (the execution status of this line is deduced): const int numTilesX = (w + tileSize - 1) / tileSize;
-
267 const int numTilesY = (h + tileSize - 1) / tileSize;
executed (the execution status of this line is deduced): const int numTilesY = (h + tileSize - 1) / tileSize;
-
268 -
269 for (int tx = 0; tx < numTilesX; ++tx) {
evaluated: tx < numTilesX
TRUEFALSE
yes
Evaluation Count:24
yes
Evaluation Count:16
16-24
270 const int startx = w - tx * tileSize - 1;
executed (the execution status of this line is deduced): const int startx = w - tx * tileSize - 1;
-
271 const int stopx = qMax(startx - tileSize, 0);
executed (the execution status of this line is deduced): const int stopx = qMax(startx - tileSize, 0);
-
272 -
273 for (int ty = 0; ty < numTilesY; ++ty) {
evaluated: ty < numTilesY
TRUEFALSE
yes
Evaluation Count:32
yes
Evaluation Count:24
24-32
274 const int starty = ty * tileSize;
executed (the execution status of this line is deduced): const int starty = ty * tileSize;
-
275 const int stopy = qMin(starty + tileSize, h);
executed (the execution status of this line is deduced): const int stopy = qMin(starty + tileSize, h);
-
276 -
277 for (int x = startx; x >= stopx; --x) {
evaluated: x >= stopx
TRUEFALSE
yes
Evaluation Count:648
yes
Evaluation Count:32
32-648
278 T *d = (T *)((char*)dest + (w - x - 1) * dstride) + starty;
executed (the execution status of this line is deduced): T *d = (T *)((char*)dest + (w - x - 1) * dstride) + starty;
-
279 const char *s = (const char*)(src + x) + starty * sstride;
executed (the execution status of this line is deduced): const char *s = (const char*)(src + x) + starty * sstride;
-
280 for (int y = starty; y < stopy; ++y) {
evaluated: y < stopy
TRUEFALSE
yes
Evaluation Count:11336
yes
Evaluation Count:648
648-11336
281 *d++ = *(const T *)(s);
executed (the execution status of this line is deduced): *d++ = *(const T *)(s);
-
282 s += sstride;
executed (the execution status of this line is deduced): s += sstride;
-
283 }
executed: }
Execution Count:11336
11336
284 }
executed: }
Execution Count:648
648
285 }
executed: }
Execution Count:32
32
286 }
executed: }
Execution Count:24
24
287}
executed: }
Execution Count:16
16
288 -
289template <class T> -
290Q_STATIC_TEMPLATE_FUNCTION -
291inline void qt_memrotate270_tiled(const T *src, int w, int h, int sstride, T *dest, int dstride) -
292{ -
293 sstride /= sizeof(T);
never executed (the execution status of this line is deduced): sstride /= sizeof(T);
-
294 dstride /= sizeof(T);
never executed (the execution status of this line is deduced): dstride /= sizeof(T);
-
295 -
296 const int pack = sizeof(quint32) / sizeof(T);
never executed (the execution status of this line is deduced): const int pack = sizeof(quint32) / sizeof(T);
-
297 const int unaligned =
never executed (the execution status of this line is deduced): const int unaligned =
-
298 qMin(uint((long(dest) & (sizeof(quint32)-1)) / sizeof(T)), uint(h));
never executed (the execution status of this line is deduced): qMin(uint((long(dest) & (sizeof(quint32)-1)) / sizeof(T)), uint(h));
-
299 const int restX = w % tileSize;
never executed (the execution status of this line is deduced): const int restX = w % tileSize;
-
300 const int restY = (h - unaligned) % tileSize;
never executed (the execution status of this line is deduced): const int restY = (h - unaligned) % tileSize;
-
301 const int unoptimizedY = restY % pack;
never executed (the execution status of this line is deduced): const int unoptimizedY = restY % pack;
-
302 const int numTilesX = w / tileSize + (restX > 0);
never executed (the execution status of this line is deduced): const int numTilesX = w / tileSize + (restX > 0);
-
303 const int numTilesY = (h - unaligned) / tileSize + (restY >= pack);
never executed (the execution status of this line is deduced): const int numTilesY = (h - unaligned) / tileSize + (restY >= pack);
-
304 -
305 for (int tx = 0; tx < numTilesX; ++tx) {
never evaluated: tx < numTilesX
0
306 const int startx = tx * tileSize;
never executed (the execution status of this line is deduced): const int startx = tx * tileSize;
-
307 const int stopx = qMin(startx + tileSize, w);
never executed (the execution status of this line is deduced): const int stopx = qMin(startx + tileSize, w);
-
308 -
309 if (unaligned) {
never evaluated: unaligned
0
310 for (int x = startx; x < stopx; ++x) {
never evaluated: x < stopx
0
311 T *d = dest + x * dstride;
never executed (the execution status of this line is deduced): T *d = dest + x * dstride;
-
312 for (int y = h - 1; y >= h - unaligned; --y) {
never evaluated: y >= h - unaligned
0
313 *d++ = src[y * sstride + x];
never executed (the execution status of this line is deduced): *d++ = src[y * sstride + x];
-
314 }
never executed: }
0
315 }
never executed: }
0
316 }
never executed: }
0
317 -
318 for (int ty = 0; ty < numTilesY; ++ty) {
never evaluated: ty < numTilesY
0
319 const int starty = h - 1 - unaligned - ty * tileSize;
never executed (the execution status of this line is deduced): const int starty = h - 1 - unaligned - ty * tileSize;
-
320 const int stopy = qMax(starty - tileSize, unoptimizedY);
never executed (the execution status of this line is deduced): const int stopy = qMax(starty - tileSize, unoptimizedY);
-
321 -
322 for (int x = startx; x < stopx; ++x) {
never evaluated: x < stopx
0
323 quint32 *d = reinterpret_cast<quint32*>(dest + x * dstride
never executed (the execution status of this line is deduced): quint32 *d = reinterpret_cast<quint32*>(dest + x * dstride
-
324 + h - 1 - starty);
never executed (the execution status of this line is deduced): + h - 1 - starty);
-
325 for (int y = starty; y > stopy; y -= pack) {
never evaluated: y > stopy
0
326 quint32 c = src[y * sstride + x];
never executed (the execution status of this line is deduced): quint32 c = src[y * sstride + x];
-
327 for (int i = 1; i < pack; ++i) {
never evaluated: i < pack
0
328 const int shift = (sizeof(int) * 8 / pack * i);
never executed (the execution status of this line is deduced): const int shift = (sizeof(int) * 8 / pack * i);
-
329 const T color = src[(y - i) * sstride + x];
never executed (the execution status of this line is deduced): const T color = src[(y - i) * sstride + x];
-
330 c |= color << shift;
never executed (the execution status of this line is deduced): c |= color << shift;
-
331 }
never executed: }
0
332 *d++ = c;
never executed (the execution status of this line is deduced): *d++ = c;
-
333 }
never executed: }
0
334 }
never executed: }
0
335 }
never executed: }
0
336 if (unoptimizedY) {
never evaluated: unoptimizedY
0
337 const int starty = unoptimizedY - 1;
never executed (the execution status of this line is deduced): const int starty = unoptimizedY - 1;
-
338 for (int x = startx; x < stopx; ++x) {
never evaluated: x < stopx
0
339 T *d = dest + x * dstride + h - 1 - starty;
never executed (the execution status of this line is deduced): T *d = dest + x * dstride + h - 1 - starty;
-
340 for (int y = starty; y >= 0; --y) {
never evaluated: y >= 0
0
341 *d++ = src[y * sstride + x];
never executed (the execution status of this line is deduced): *d++ = src[y * sstride + x];
-
342 }
never executed: }
0
343 }
never executed: }
0
344 }
never executed: }
0
345 }
never executed: }
0
346}
never executed: }
0
347 -
348template <class T> -
349Q_STATIC_TEMPLATE_FUNCTION -
350inline void qt_memrotate270_tiled_unpacked(const T *src, int w, int h, int sstride, T *dest, -
351 int dstride) -
352{ -
353 const int numTilesX = (w + tileSize - 1) / tileSize;
executed (the execution status of this line is deduced): const int numTilesX = (w + tileSize - 1) / tileSize;
-
354 const int numTilesY = (h + tileSize - 1) / tileSize;
executed (the execution status of this line is deduced): const int numTilesY = (h + tileSize - 1) / tileSize;
-
355 -
356 for (int tx = 0; tx < numTilesX; ++tx) {
evaluated: tx < numTilesX
TRUEFALSE
yes
Evaluation Count:121
yes
Evaluation Count:53
53-121
357 const int startx = tx * tileSize;
executed (the execution status of this line is deduced): const int startx = tx * tileSize;
-
358 const int stopx = qMin(startx + tileSize, w);
executed (the execution status of this line is deduced): const int stopx = qMin(startx + tileSize, w);
-
359 -
360 for (int ty = 0; ty < numTilesY; ++ty) {
evaluated: ty < numTilesY
TRUEFALSE
yes
Evaluation Count:580
yes
Evaluation Count:121
121-580
361 const int starty = h - 1 - ty * tileSize;
executed (the execution status of this line is deduced): const int starty = h - 1 - ty * tileSize;
-
362 const int stopy = qMax(starty - tileSize, 0);
executed (the execution status of this line is deduced): const int stopy = qMax(starty - tileSize, 0);
-
363 -
364 for (int x = startx; x < stopx; ++x) {
evaluated: x < stopx
TRUEFALSE
yes
Evaluation Count:16466
yes
Evaluation Count:580
580-16466
365 T *d = (T*)((char*)dest + x * dstride) + h - 1 - starty;
executed (the execution status of this line is deduced): T *d = (T*)((char*)dest + x * dstride) + h - 1 - starty;
-
366 const char *s = (const char*)(src + x) + starty * sstride;
executed (the execution status of this line is deduced): const char *s = (const char*)(src + x) + starty * sstride;
-
367 for (int y = starty; y >= stopy; --y) {
evaluated: y >= stopy
TRUEFALSE
yes
Evaluation Count:496018
yes
Evaluation Count:16466
16466-496018
368 *d++ = *(const T*)s;
executed (the execution status of this line is deduced): *d++ = *(const T*)s;
-
369 s -= sstride;
executed (the execution status of this line is deduced): s -= sstride;
-
370 }
executed: }
Execution Count:496018
496018
371 }
executed: }
Execution Count:16466
16466
372 }
executed: }
Execution Count:580
580
373 }
executed: }
Execution Count:121
121
374}
executed: }
Execution Count:53
53
375 -
376#endif // QT_ROTATION_ALGORITHM -
377 -
378template <class T> -
379Q_STATIC_TEMPLATE_FUNCTION -
380inline void qt_memrotate90_template(const T *src, int srcWidth, int srcHeight, int srcStride, -
381 T *dest, int dstStride) -
382{ -
383#if QT_ROTATION_ALGORITHM == QT_ROTATION_CACHEDREAD -
384 qt_memrotate90_cachedRead<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride); -
385#elif QT_ROTATION_ALGORITHM == QT_ROTATION_CACHEDWRITE -
386 qt_memrotate90_cachedWrite<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride); -
387#elif QT_ROTATION_ALGORITHM == QT_ROTATION_PACKING -
388 qt_memrotate90_packing<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride); -
389#elif QT_ROTATION_ALGORITHM == QT_ROTATION_TILED -
390 qt_memrotate90_tiled<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride);
executed (the execution status of this line is deduced): qt_memrotate90_tiled<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride);
-
391#endif -
392}
executed: }
Execution Count:36
36
393 -
394template <class T> -
395Q_STATIC_TEMPLATE_FUNCTION -
396inline void qt_memrotate180_template(const T *src, int w, int h, int sstride, T *dest, int dstride) -
397{ -
398 const char *s = (const char*)(src) + (h - 1) * sstride;
executed (the execution status of this line is deduced): const char *s = (const char*)(src) + (h - 1) * sstride;
-
399 for (int y = h - 1; y >= 0; --y) {
evaluated: y >= 0
TRUEFALSE
yes
Evaluation Count:26
yes
Evaluation Count:2
2-26
400 T *d = reinterpret_cast<T*>((char *)(dest) + (h - y - 1) * dstride);
executed (the execution status of this line is deduced): T *d = reinterpret_cast<T*>((char *)(dest) + (h - y - 1) * dstride);
-
401 src = reinterpret_cast<const T*>(s);
executed (the execution status of this line is deduced): src = reinterpret_cast<const T*>(s);
-
402 for (int x = w - 1; x >= 0; --x) {
evaluated: x >= 0
TRUEFALSE
yes
Evaluation Count:456
yes
Evaluation Count:26
26-456
403 d[w - x - 1] = src[x];
executed (the execution status of this line is deduced): d[w - x - 1] = src[x];
-
404 }
executed: }
Execution Count:456
456
405 s -= sstride;
executed (the execution status of this line is deduced): s -= sstride;
-
406 }
executed: }
Execution Count:26
26
407}
executed: }
Execution Count:2
2
408 -
409template <class T> -
410Q_STATIC_TEMPLATE_FUNCTION -
411inline void qt_memrotate270_template(const T *src, int srcWidth, int srcHeight, int srcStride, -
412 T *dest, int dstStride) -
413{ -
414#if QT_ROTATION_ALGORITHM == QT_ROTATION_CACHEDREAD -
415 qt_memrotate270_cachedRead<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride); -
416#elif QT_ROTATION_ALGORITHM == QT_ROTATION_CACHEDWRITE -
417 qt_memrotate270_cachedWrite<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride); -
418#elif QT_ROTATION_ALGORITHM == QT_ROTATION_PACKING -
419 qt_memrotate270_packing<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride); -
420#elif QT_ROTATION_ALGORITHM == QT_ROTATION_TILED -
421 qt_memrotate270_tiled_unpacked<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride);
executed (the execution status of this line is deduced): qt_memrotate270_tiled_unpacked<T>(src, srcWidth, srcHeight, srcStride, dest, dstStride);
-
422#endif -
423}
executed: }
Execution Count:53
53
424 -
425template <> -
426inline void qt_memrotate90_template<quint24>(const quint24 *src, int srcWidth, int srcHeight, -
427 int srcStride, quint24 *dest, int dstStride) -
428{ -
429#if QT_ROTATION_ALGORITHM == QT_ROTATION_CACHEDREAD -
430 qt_memrotate90_cachedRead<quint24>(src, srcWidth, srcHeight, srcStride, dest, dstStride); -
431#elif QT_ROTATION_ALGORITHM == QT_ROTATION_CACHEDWRITE -
432 qt_memrotate90_cachedWrite<quint24>(src, srcWidth, srcHeight, srcStride, dest, dstStride); -
433#elif QT_ROTATION_ALGORITHM == QT_ROTATION_PACKING -
434 // packed algorithm not implemented -
435 qt_memrotate90_cachedRead<quint24>(src, srcWidth, srcHeight, srcStride, dest, dstStride); -
436#elif QT_ROTATION_ALGORITHM == QT_ROTATION_TILED -
437 // packed algorithm not implemented -
438 qt_memrotate90_tiled_unpacked<quint24>(src, srcWidth, srcHeight, srcStride, dest, dstStride);
executed (the execution status of this line is deduced): qt_memrotate90_tiled_unpacked<quint24>(src, srcWidth, srcHeight, srcStride, dest, dstStride);
-
439#endif -
440}
executed: }
Execution Count:16
16
441 -
442#define QT_IMPL_MEMROTATE(type) \ -
443Q_GUI_EXPORT void qt_memrotate90(const type *src, int w, int h, int sstride, \ -
444 type *dest, int dstride) \ -
445{ \ -
446 qt_memrotate90_template(src, w, h, sstride, dest, dstride); \ -
447} \ -
448Q_GUI_EXPORT void qt_memrotate180(const type *src, int w, int h, int sstride, \ -
449 type *dest, int dstride) \ -
450{ \ -
451 qt_memrotate180_template(src, w, h, sstride, dest, dstride); \ -
452} \ -
453Q_GUI_EXPORT void qt_memrotate270(const type *src, int w, int h, int sstride, \ -
454 type *dest, int dstride) \ -
455{ \ -
456 qt_memrotate270_template(src, w, h, sstride, dest, dstride); \ -
457} -
458 -
459#define QT_IMPL_SIMPLE_MEMROTATE(type) \ -
460Q_GUI_EXPORT void qt_memrotate90(const type *src, int w, int h, int sstride, \ -
461 type *dest, int dstride) \ -
462{ \ -
463 qt_memrotate90_tiled_unpacked<type>(src, w, h, sstride, dest, dstride); \ -
464} \ -
465Q_GUI_EXPORT void qt_memrotate180(const type *src, int w, int h, int sstride, \ -
466 type *dest, int dstride) \ -
467{ \ -
468 qt_memrotate180_template(src, w, h, sstride, dest, dstride); \ -
469} \ -
470Q_GUI_EXPORT void qt_memrotate270(const type *src, int w, int h, int sstride, \ -
471 type *dest, int dstride) \ -
472{ \ -
473 qt_memrotate270_tiled_unpacked<type>(src, w, h, sstride, dest, dstride); \ -
474} -
475 -
476 -
477 -
478 -
479QT_IMPL_MEMROTATE(quint32)
executed: }
Execution Count:23
executed: }
Execution Count:2
executed: }
Execution Count:23
2-23
480QT_IMPL_MEMROTATE(quint16)
executed: }
Execution Count:8
never executed: }
executed: }
Execution Count:8
0-8
481QT_IMPL_MEMROTATE(quint24)
executed: }
Execution Count:16
never executed: }
executed: }
Execution Count:16
0-16
482QT_IMPL_MEMROTATE(quint8)
executed: }
Execution Count:5
never executed: }
executed: }
Execution Count:6
0-6
483 -
484void qt_memrotate90_16(const uchar *srcPixels, int w, int h, int sbpl, uchar *destPixels, int dbpl) -
485{ -
486 qt_memrotate90((const ushort *)srcPixels, w, h, sbpl, (ushort *)destPixels, dbpl);
never executed (the execution status of this line is deduced): qt_memrotate90((const ushort *)srcPixels, w, h, sbpl, (ushort *)destPixels, dbpl);
-
487}
never executed: }
0
488 -
489void qt_memrotate180_16(const uchar *srcPixels, int w, int h, int sbpl, uchar *destPixels, int dbpl) -
490{ -
491 qt_memrotate180((const ushort *)srcPixels, w, h, sbpl, (ushort *)destPixels, dbpl);
never executed (the execution status of this line is deduced): qt_memrotate180((const ushort *)srcPixels, w, h, sbpl, (ushort *)destPixels, dbpl);
-
492}
never executed: }
0
493 -
494void qt_memrotate270_16(const uchar *srcPixels, int w, int h, int sbpl, uchar *destPixels, int dbpl) -
495{ -
496 qt_memrotate270((const ushort *)srcPixels, w, h, sbpl, (ushort *)destPixels, dbpl);
never executed (the execution status of this line is deduced): qt_memrotate270((const ushort *)srcPixels, w, h, sbpl, (ushort *)destPixels, dbpl);
-
497}
never executed: }
0
498 -
499void qt_memrotate90_32(const uchar *srcPixels, int w, int h, int sbpl, uchar *destPixels, int dbpl) -
500{ -
501 qt_memrotate90((const uint *)srcPixels, w, h, sbpl, (uint *)destPixels, dbpl);
executed (the execution status of this line is deduced): qt_memrotate90((const uint *)srcPixels, w, h, sbpl, (uint *)destPixels, dbpl);
-
502}
executed: }
Execution Count:1
1
503 -
504void qt_memrotate180_32(const uchar *srcPixels, int w, int h, int sbpl, uchar *destPixels, int dbpl) -
505{ -
506 qt_memrotate180((const uint *)srcPixels, w, h, sbpl, (uint *)destPixels, dbpl);
executed (the execution status of this line is deduced): qt_memrotate180((const uint *)srcPixels, w, h, sbpl, (uint *)destPixels, dbpl);
-
507}
executed: }
Execution Count:2
2
508 -
509void qt_memrotate270_32(const uchar *srcPixels, int w, int h, int sbpl, uchar *destPixels, int dbpl) -
510{ -
511 qt_memrotate270((const uint *)srcPixels, w, h, sbpl, (uint *)destPixels, dbpl);
executed (the execution status of this line is deduced): qt_memrotate270((const uint *)srcPixels, w, h, sbpl, (uint *)destPixels, dbpl);
-
512}
executed: }
Execution Count:1
1
513 -
514MemRotateFunc qMemRotateFunctions[QImage::NImageFormats][3] = -
515// 90, 180, 270 -
516{ -
517 { 0, 0, 0 }, // Format_Invalid, -
518 { 0, 0, 0 }, // Format_Mono, -
519 { 0, 0, 0 }, // Format_MonoLSB, -
520 { 0, 0, 0 }, // Format_Indexed8, -
521 { qt_memrotate90_32, qt_memrotate180_32, qt_memrotate270_32 }, // Format_RGB32, -
522 { qt_memrotate90_32, qt_memrotate180_32, qt_memrotate270_32 }, // Format_ARGB32, -
523 { qt_memrotate90_32, qt_memrotate180_32, qt_memrotate270_32 }, // Format_ARGB32_Premultiplied, -
524 { qt_memrotate90_16, qt_memrotate180_16, qt_memrotate270_16 }, // Format_RGB16, -
525 { 0, 0, 0 }, // Format_ARGB8565_Premultiplied, -
526 { 0, 0, 0 }, // Format_RGB666, -
527 { 0, 0, 0 }, // Format_ARGB6666_Premultiplied, -
528 { 0, 0, 0 }, // Format_RGB555, -
529 { 0, 0, 0 }, // Format_ARGB8555_Premultiplied, -
530 { 0, 0, 0 }, // Format_RGB888, -
531 { 0, 0, 0 }, // Format_RGB444, -
532 { 0, 0, 0 } // Format_ARGB4444_Premultiplied, -
533}; -
534 -
535QT_END_NAMESPACE -
536 -
Source codeSwitch to Preprocessed file
Generated by Squish Coco Non-Commercial