/src/ghostpdl/base/gxsamplp.h
Line | Count | Source |
1 | | /* Copyright (C) 2001-2023 Artifex Software, Inc. |
2 | | All Rights Reserved. |
3 | | |
4 | | This software is provided AS-IS with no warranty, either express or |
5 | | implied. |
6 | | |
7 | | This software is distributed under license and may not be copied, |
8 | | modified or distributed except as expressly authorized under the terms |
9 | | of the license contained in the file LICENSE in this distribution. |
10 | | |
11 | | Refer to licensing information at http://www.artifex.com or contact |
12 | | Artifex Software, Inc., 39 Mesa Street, Suite 108A, San Francisco, |
13 | | CA 94129, USA, for further information. |
14 | | */ |
15 | | |
16 | | |
17 | | /* Templates for sample lookup and expansion */ |
18 | | |
19 | | /* This module is allowed to include several times into a single .c file. |
20 | | The following macros to be defined in advance : |
21 | | MULTIPLE_MAPS - 1 if num_components_per_plane > 0 and |
22 | | components use different maps, 0 otherwise. |
23 | | TEMPLATE_sample_unpack_1 - a name for the function |
24 | | TEMPLATE_sample_unpack_2 - a name for the function |
25 | | TEMPLATE_sample_unpack_4 - a name for the function |
26 | | TEMPLATE_sample_unpack_8 - a name for the function |
27 | | */ |
28 | | |
29 | | #if defined(TEMPLATE_sample_unpack_1) && defined(TEMPLATE_sample_unpack_2) && defined(TEMPLATE_sample_unpack_4) && defined(TEMPLATE_sample_unpack_8) |
30 | | |
31 | | #include "valgrind.h" |
32 | | |
33 | | #if MULTIPLE_MAPS |
34 | 1.25k | # define NEXT_MAP map = smap[++smap_index % num_components_per_plane].table.lookup4x1to32 |
35 | 312k | # define NEXT_MAP8 map = smap[++smap_index % num_components_per_plane].table.lookup8 |
36 | 872 | # define DEFINE_SMAP_INDEX int smap_index = 0; |
37 | | #else |
38 | | # define NEXT_MAP |
39 | | # define NEXT_MAP8 |
40 | | # define DEFINE_SMAP_INDEX |
41 | | #endif |
42 | | |
43 | | const byte * |
44 | | TEMPLATE_sample_unpack_1(byte * bptr, int *pdata_x, const byte * data, int data_x, |
45 | | uint dsize, const sample_map *smap, int spread, |
46 | | int num_components_per_plane) |
47 | 3.49M | { |
48 | 3.49M | const sample_lookup_t * ptab = &smap->table; |
49 | 3.49M | const byte *psrc = data + (data_x >> 3); |
50 | 3.49M | int left = dsize - (data_x >> 3); |
51 | 3.49M | DEFINE_SMAP_INDEX |
52 | | |
53 | 3.49M | #ifdef PACIFY_VALGRIND |
54 | 3.49M | byte *bend = bptr + left*spread; |
55 | 3.49M | byte vbits = 0; |
56 | | |
57 | | /* Allow for undefined bits at the end */ |
58 | 3.49M | VALGRIND_GET_VBITS(&psrc[left-1], &vbits, 1); |
59 | | /* At least the top bit must be defined. If not, |
60 | | * don't change anything, and let valgrind complain. */ |
61 | 3.49M | if ((vbits & 0x80) == 0) { |
62 | 3.49M | byte zero = 0; |
63 | 3.49M | VALGRIND_SET_VBITS(&psrc[left-1], &zero, 1); |
64 | 3.49M | } |
65 | 3.49M | #endif |
66 | | |
67 | 3.49M | if (spread == 1) { |
68 | 3.49M | bits32 *bufp = (bits32 *) bptr; |
69 | 3.49M | const bits32 *map = &ptab->lookup4x1to32[0]; |
70 | 3.49M | uint b; |
71 | | |
72 | 3.49M | if (left & 1) { |
73 | 359k | b = psrc[0]; |
74 | 359k | bufp[0] = map[b >> 4]; |
75 | 359k | NEXT_MAP; |
76 | 359k | bufp[1] = map[b & 0xf]; |
77 | 359k | NEXT_MAP; |
78 | 359k | psrc++, bufp += 2; |
79 | 359k | } |
80 | 3.49M | left >>= 1; |
81 | 14.9M | while (left--) { |
82 | 11.4M | b = psrc[0]; |
83 | 11.4M | bufp[0] = map[b >> 4]; |
84 | 11.4M | NEXT_MAP; |
85 | 11.4M | bufp[1] = map[b & 0xf]; |
86 | 11.4M | NEXT_MAP; |
87 | 11.4M | b = psrc[1]; |
88 | 11.4M | bufp[2] = map[b >> 4]; |
89 | 11.4M | NEXT_MAP; |
90 | 11.4M | bufp[3] = map[b & 0xf]; |
91 | 11.4M | NEXT_MAP; |
92 | 11.4M | psrc += 2, bufp += 4; |
93 | 11.4M | } |
94 | 3.49M | } else { |
95 | 0 | byte *bufp = bptr; |
96 | 0 | const byte *map = &ptab->lookup8[0]; |
97 | |
|
98 | 0 | while (left--) { |
99 | 0 | uint b = *psrc++; |
100 | |
|
101 | 0 | *bufp = map[b >> 7]; |
102 | 0 | NEXT_MAP8; |
103 | 0 | bufp += spread; |
104 | 0 | *bufp = map[(b >> 6) & 1]; |
105 | 0 | NEXT_MAP8; |
106 | 0 | bufp += spread; |
107 | 0 | *bufp = map[(b >> 5) & 1]; |
108 | 0 | NEXT_MAP8; |
109 | 0 | bufp += spread; |
110 | 0 | *bufp = map[(b >> 4) & 1]; |
111 | 0 | NEXT_MAP8; |
112 | 0 | bufp += spread; |
113 | 0 | *bufp = map[(b >> 3) & 1]; |
114 | 0 | NEXT_MAP8; |
115 | 0 | bufp += spread; |
116 | 0 | *bufp = map[(b >> 2) & 1]; |
117 | 0 | NEXT_MAP8; |
118 | 0 | bufp += spread; |
119 | 0 | *bufp = map[(b >> 1) & 1]; |
120 | 0 | NEXT_MAP8; |
121 | 0 | bufp += spread; |
122 | 0 | *bufp = map[b & 1]; |
123 | 0 | NEXT_MAP8; |
124 | 0 | bufp += spread; |
125 | 0 | } |
126 | 0 | } |
127 | 3.49M | #ifdef PACIFY_VALGRIND |
128 | | /* Put any undefinedness back, and carry it over to the output. */ |
129 | 3.49M | VALGRIND_SET_VBITS(psrc-1, &vbits, 1); |
130 | 3.49M | { |
131 | 3.49M | byte ones = 0xff; |
132 | 3.49M | if (vbits & 0x40) |
133 | 3.49M | VALGRIND_SET_VBITS(bend - spread*7, &ones, 1); |
134 | 3.49M | if (vbits & 0x20) |
135 | 3.49M | VALGRIND_SET_VBITS(bend - spread*6, &ones, 1); |
136 | 3.49M | if (vbits & 0x10) |
137 | 3.49M | VALGRIND_SET_VBITS(bend - spread*5, &ones, 1); |
138 | 3.49M | if (vbits & 0x08) |
139 | 3.49M | VALGRIND_SET_VBITS(bend - spread*4, &ones, 1); |
140 | 3.49M | if (vbits & 0x04) |
141 | 3.49M | VALGRIND_SET_VBITS(bend - spread*3, &ones, 1); |
142 | 3.49M | if (vbits & 0x02) |
143 | 3.49M | VALGRIND_SET_VBITS(bend - spread*2, &ones, 1); |
144 | 3.49M | if (vbits & 0x01) |
145 | 3.49M | VALGRIND_SET_VBITS(bend - spread*1, &ones, 1); |
146 | 3.49M | } |
147 | 3.49M | #endif |
148 | 3.49M | *pdata_x = data_x & 7; |
149 | 3.49M | return bptr; |
150 | 3.49M | } Line | Count | Source | 47 | 3.49M | { | 48 | 3.49M | const sample_lookup_t * ptab = &smap->table; | 49 | 3.49M | const byte *psrc = data + (data_x >> 3); | 50 | 3.49M | int left = dsize - (data_x >> 3); | 51 | 3.49M | DEFINE_SMAP_INDEX | 52 | | | 53 | 3.49M | #ifdef PACIFY_VALGRIND | 54 | 3.49M | byte *bend = bptr + left*spread; | 55 | 3.49M | byte vbits = 0; | 56 | | | 57 | | /* Allow for undefined bits at the end */ | 58 | 3.49M | VALGRIND_GET_VBITS(&psrc[left-1], &vbits, 1); | 59 | | /* At least the top bit must be defined. If not, | 60 | | * don't change anything, and let valgrind complain. */ | 61 | 3.49M | if ((vbits & 0x80) == 0) { | 62 | 3.49M | byte zero = 0; | 63 | 3.49M | VALGRIND_SET_VBITS(&psrc[left-1], &zero, 1); | 64 | 3.49M | } | 65 | 3.49M | #endif | 66 | | | 67 | 3.49M | if (spread == 1) { | 68 | 3.49M | bits32 *bufp = (bits32 *) bptr; | 69 | 3.49M | const bits32 *map = &ptab->lookup4x1to32[0]; | 70 | 3.49M | uint b; | 71 | | | 72 | 3.49M | if (left & 1) { | 73 | 359k | b = psrc[0]; | 74 | 359k | bufp[0] = map[b >> 4]; | 75 | 359k | NEXT_MAP; | 76 | 359k | bufp[1] = map[b & 0xf]; | 77 | 359k | NEXT_MAP; | 78 | 359k | psrc++, bufp += 2; | 79 | 359k | } | 80 | 3.49M | left >>= 1; | 81 | 14.9M | while (left--) { | 82 | 11.4M | b = psrc[0]; | 83 | 11.4M | bufp[0] = map[b >> 4]; | 84 | 11.4M | NEXT_MAP; | 85 | 11.4M | bufp[1] = map[b & 0xf]; | 86 | 11.4M | NEXT_MAP; | 87 | 11.4M | b = psrc[1]; | 88 | 11.4M | bufp[2] = map[b >> 4]; | 89 | 11.4M | NEXT_MAP; | 90 | 11.4M | bufp[3] = map[b & 0xf]; | 91 | 11.4M | NEXT_MAP; | 92 | 11.4M | psrc += 2, bufp += 4; | 93 | 11.4M | } | 94 | 3.49M | } else { | 95 | 0 | byte *bufp = bptr; | 96 | 0 | const byte *map = &ptab->lookup8[0]; | 97 | |
| 98 | 0 | while (left--) { | 99 | 0 | uint b = *psrc++; | 100 | |
| 101 | 0 | *bufp = map[b >> 7]; | 102 | 0 | NEXT_MAP8; | 103 | 0 | bufp += spread; | 104 | 0 | *bufp = map[(b >> 6) & 1]; | 105 | 0 | NEXT_MAP8; | 106 | 0 | bufp += spread; | 107 | 0 | *bufp = map[(b >> 5) & 1]; | 108 | 0 | NEXT_MAP8; | 109 | 0 | bufp += spread; | 110 | 0 | *bufp = map[(b >> 4) & 1]; | 111 | 0 | NEXT_MAP8; | 112 | 0 | bufp += spread; | 113 | 0 | *bufp = map[(b >> 3) & 1]; | 114 | 0 | NEXT_MAP8; | 115 | 0 | bufp += spread; | 116 | 0 | *bufp = map[(b >> 2) & 1]; | 117 | 0 | NEXT_MAP8; | 118 | 0 | bufp += spread; | 119 | 0 | *bufp = map[(b >> 1) & 1]; | 120 | 0 | NEXT_MAP8; | 121 | 0 | bufp += spread; | 122 | 0 | *bufp = map[b & 1]; | 123 | 0 | NEXT_MAP8; | 124 | 0 | bufp += spread; | 125 | 0 | } | 126 | 0 | } | 127 | 3.49M | #ifdef PACIFY_VALGRIND | 128 | | /* Put any undefinedness back, and carry it over to the output. */ | 129 | 3.49M | VALGRIND_SET_VBITS(psrc-1, &vbits, 1); | 130 | 3.49M | { | 131 | 3.49M | byte ones = 0xff; | 132 | 3.49M | if (vbits & 0x40) | 133 | 3.49M | VALGRIND_SET_VBITS(bend - spread*7, &ones, 1); | 134 | 3.49M | if (vbits & 0x20) | 135 | 3.49M | VALGRIND_SET_VBITS(bend - spread*6, &ones, 1); | 136 | 3.49M | if (vbits & 0x10) | 137 | 3.49M | VALGRIND_SET_VBITS(bend - spread*5, &ones, 1); | 138 | 3.49M | if (vbits & 0x08) | 139 | 3.49M | VALGRIND_SET_VBITS(bend - spread*4, &ones, 1); | 140 | 3.49M | if (vbits & 0x04) | 141 | 3.49M | VALGRIND_SET_VBITS(bend - spread*3, &ones, 1); | 142 | 3.49M | if (vbits & 0x02) | 143 | 3.49M | VALGRIND_SET_VBITS(bend - spread*2, &ones, 1); | 144 | 3.49M | if (vbits & 0x01) | 145 | 3.49M | VALGRIND_SET_VBITS(bend - spread*1, &ones, 1); | 146 | 3.49M | } | 147 | 3.49M | #endif | 148 | 3.49M | *pdata_x = data_x & 7; | 149 | 3.49M | return bptr; | 150 | 3.49M | } |
sample_unpack_1_interleaved Line | Count | Source | 47 | 56 | { | 48 | 56 | const sample_lookup_t * ptab = &smap->table; | 49 | 56 | const byte *psrc = data + (data_x >> 3); | 50 | 56 | int left = dsize - (data_x >> 3); | 51 | 56 | DEFINE_SMAP_INDEX | 52 | | | 53 | 56 | #ifdef PACIFY_VALGRIND | 54 | 56 | byte *bend = bptr + left*spread; | 55 | 56 | byte vbits = 0; | 56 | | | 57 | | /* Allow for undefined bits at the end */ | 58 | 56 | VALGRIND_GET_VBITS(&psrc[left-1], &vbits, 1); | 59 | | /* At least the top bit must be defined. If not, | 60 | | * don't change anything, and let valgrind complain. */ | 61 | 56 | if ((vbits & 0x80) == 0) { | 62 | 56 | byte zero = 0; | 63 | 56 | VALGRIND_SET_VBITS(&psrc[left-1], &zero, 1); | 64 | 56 | } | 65 | 56 | #endif | 66 | | | 67 | 56 | if (spread == 1) { | 68 | 56 | bits32 *bufp = (bits32 *) bptr; | 69 | 56 | const bits32 *map = &ptab->lookup4x1to32[0]; | 70 | 56 | uint b; | 71 | | | 72 | 56 | if (left & 1) { | 73 | 56 | b = psrc[0]; | 74 | 56 | bufp[0] = map[b >> 4]; | 75 | 56 | NEXT_MAP; | 76 | 56 | bufp[1] = map[b & 0xf]; | 77 | 56 | NEXT_MAP; | 78 | 56 | psrc++, bufp += 2; | 79 | 56 | } | 80 | 56 | left >>= 1; | 81 | 342 | while (left--) { | 82 | 286 | b = psrc[0]; | 83 | 286 | bufp[0] = map[b >> 4]; | 84 | 286 | NEXT_MAP; | 85 | 286 | bufp[1] = map[b & 0xf]; | 86 | 286 | NEXT_MAP; | 87 | 286 | b = psrc[1]; | 88 | 286 | bufp[2] = map[b >> 4]; | 89 | 286 | NEXT_MAP; | 90 | 286 | bufp[3] = map[b & 0xf]; | 91 | 286 | NEXT_MAP; | 92 | 286 | psrc += 2, bufp += 4; | 93 | 286 | } | 94 | 56 | } else { | 95 | 0 | byte *bufp = bptr; | 96 | 0 | const byte *map = &ptab->lookup8[0]; | 97 | |
| 98 | 0 | while (left--) { | 99 | 0 | uint b = *psrc++; | 100 | |
| 101 | 0 | *bufp = map[b >> 7]; | 102 | 0 | NEXT_MAP8; | 103 | 0 | bufp += spread; | 104 | 0 | *bufp = map[(b >> 6) & 1]; | 105 | 0 | NEXT_MAP8; | 106 | 0 | bufp += spread; | 107 | 0 | *bufp = map[(b >> 5) & 1]; | 108 | 0 | NEXT_MAP8; | 109 | 0 | bufp += spread; | 110 | 0 | *bufp = map[(b >> 4) & 1]; | 111 | 0 | NEXT_MAP8; | 112 | 0 | bufp += spread; | 113 | 0 | *bufp = map[(b >> 3) & 1]; | 114 | 0 | NEXT_MAP8; | 115 | 0 | bufp += spread; | 116 | 0 | *bufp = map[(b >> 2) & 1]; | 117 | 0 | NEXT_MAP8; | 118 | 0 | bufp += spread; | 119 | 0 | *bufp = map[(b >> 1) & 1]; | 120 | 0 | NEXT_MAP8; | 121 | 0 | bufp += spread; | 122 | 0 | *bufp = map[b & 1]; | 123 | 0 | NEXT_MAP8; | 124 | 0 | bufp += spread; | 125 | 0 | } | 126 | 0 | } | 127 | 56 | #ifdef PACIFY_VALGRIND | 128 | | /* Put any undefinedness back, and carry it over to the output. */ | 129 | 56 | VALGRIND_SET_VBITS(psrc-1, &vbits, 1); | 130 | 56 | { | 131 | 56 | byte ones = 0xff; | 132 | 56 | if (vbits & 0x40) | 133 | 56 | VALGRIND_SET_VBITS(bend - spread*7, &ones, 1); | 134 | 56 | if (vbits & 0x20) | 135 | 56 | VALGRIND_SET_VBITS(bend - spread*6, &ones, 1); | 136 | 56 | if (vbits & 0x10) | 137 | 56 | VALGRIND_SET_VBITS(bend - spread*5, &ones, 1); | 138 | 56 | if (vbits & 0x08) | 139 | 56 | VALGRIND_SET_VBITS(bend - spread*4, &ones, 1); | 140 | 56 | if (vbits & 0x04) | 141 | 56 | VALGRIND_SET_VBITS(bend - spread*3, &ones, 1); | 142 | 56 | if (vbits & 0x02) | 143 | 56 | VALGRIND_SET_VBITS(bend - spread*2, &ones, 1); | 144 | 56 | if (vbits & 0x01) | 145 | 56 | VALGRIND_SET_VBITS(bend - spread*1, &ones, 1); | 146 | 56 | } | 147 | 56 | #endif | 148 | 56 | *pdata_x = data_x & 7; | 149 | 56 | return bptr; | 150 | 56 | } |
|
151 | | |
152 | | #undef NEXT_MAP |
153 | | |
154 | | #if MULTIPLE_MAPS |
155 | 48 | # define NEXT_MAP map = smap[++smap_index % num_components_per_plane].table.lookup2x2to16 |
156 | | #else |
157 | | # define NEXT_MAP |
158 | | #endif |
159 | | |
160 | | const byte * |
161 | | TEMPLATE_sample_unpack_2(byte * bptr, int *pdata_x, const byte * data, int data_x, |
162 | | uint dsize, const sample_map *smap, int spread, |
163 | | int num_components_per_plane) |
164 | 34.8k | { |
165 | 34.8k | const sample_lookup_t * ptab = &smap->table; |
166 | 34.8k | const byte *psrc = data + (data_x >> 2); |
167 | 34.8k | int left = dsize - (data_x >> 2); |
168 | 34.8k | DEFINE_SMAP_INDEX |
169 | | |
170 | 34.8k | #ifdef PACIFY_VALGRIND |
171 | 34.8k | byte *bend = bptr + left*spread; |
172 | 34.8k | byte vbits = 0; |
173 | | |
174 | | /* Allow for undefined bits at the end */ |
175 | 34.8k | VALGRIND_GET_VBITS(&psrc[left-1], &vbits, 1); |
176 | | /* At least the top 2 bits must be defined. If not, |
177 | | * don't change anything, and let valgrind complain. */ |
178 | 34.8k | if ((vbits & 0xC0) == 0) { |
179 | 34.8k | byte zero = 0; |
180 | 34.8k | VALGRIND_SET_VBITS(&psrc[left-1], &zero, 1); |
181 | 34.8k | } |
182 | 34.8k | #endif |
183 | | |
184 | 34.8k | if (spread == 1) { |
185 | 34.8k | bits16 *bufp = (bits16 *) bptr; |
186 | 34.8k | const bits16 *map = &ptab->lookup2x2to16[0]; |
187 | | |
188 | 997k | while (left--) { |
189 | 962k | uint b = *psrc++; |
190 | | |
191 | 962k | *bufp++ = map[b >> 4]; |
192 | 962k | NEXT_MAP; |
193 | 962k | *bufp++ = map[b & 0xf]; |
194 | 962k | NEXT_MAP; |
195 | 962k | } |
196 | 34.8k | } else { |
197 | 0 | byte *bufp = bptr; |
198 | 0 | const byte *map = &ptab->lookup8[0]; |
199 | |
|
200 | 0 | while (left--) { |
201 | 0 | unsigned b = *psrc++; |
202 | |
|
203 | 0 | *bufp = map[b >> 6]; |
204 | 0 | NEXT_MAP8; |
205 | 0 | bufp += spread; |
206 | 0 | *bufp = map[(b >> 4) & 3]; |
207 | 0 | NEXT_MAP8; |
208 | 0 | bufp += spread; |
209 | 0 | *bufp = map[(b >> 2) & 3]; |
210 | 0 | NEXT_MAP8; |
211 | 0 | bufp += spread; |
212 | 0 | *bufp = map[b & 3]; |
213 | 0 | NEXT_MAP8; |
214 | 0 | bufp += spread; |
215 | 0 | } |
216 | 0 | } |
217 | 34.8k | *pdata_x = data_x & 3; |
218 | 34.8k | #ifdef PACIFY_VALGRIND |
219 | | /* Put any undefinedness back, and carry it over to the output. */ |
220 | 34.8k | VALGRIND_SET_VBITS(psrc-1, &vbits, 1); |
221 | 34.8k | { |
222 | 34.8k | byte ones = 0xff; |
223 | 34.8k | if (vbits & 0x30) |
224 | 34.8k | VALGRIND_SET_VBITS(bend - spread*3, &ones, 1); |
225 | 34.8k | if (vbits & 0x0C) |
226 | 34.8k | VALGRIND_SET_VBITS(bend - spread*2, &ones, 1); |
227 | 34.8k | if (vbits & 0x03) |
228 | 34.8k | VALGRIND_SET_VBITS(bend - spread*1, &ones, 1); |
229 | 34.8k | } |
230 | 34.8k | #endif |
231 | 34.8k | return bptr; |
232 | 34.8k | } Line | Count | Source | 164 | 34.8k | { | 165 | 34.8k | const sample_lookup_t * ptab = &smap->table; | 166 | 34.8k | const byte *psrc = data + (data_x >> 2); | 167 | 34.8k | int left = dsize - (data_x >> 2); | 168 | 34.8k | DEFINE_SMAP_INDEX | 169 | | | 170 | 34.8k | #ifdef PACIFY_VALGRIND | 171 | 34.8k | byte *bend = bptr + left*spread; | 172 | 34.8k | byte vbits = 0; | 173 | | | 174 | | /* Allow for undefined bits at the end */ | 175 | 34.8k | VALGRIND_GET_VBITS(&psrc[left-1], &vbits, 1); | 176 | | /* At least the top 2 bits must be defined. If not, | 177 | | * don't change anything, and let valgrind complain. */ | 178 | 34.8k | if ((vbits & 0xC0) == 0) { | 179 | 34.8k | byte zero = 0; | 180 | 34.8k | VALGRIND_SET_VBITS(&psrc[left-1], &zero, 1); | 181 | 34.8k | } | 182 | 34.8k | #endif | 183 | | | 184 | 34.8k | if (spread == 1) { | 185 | 34.8k | bits16 *bufp = (bits16 *) bptr; | 186 | 34.8k | const bits16 *map = &ptab->lookup2x2to16[0]; | 187 | | | 188 | 997k | while (left--) { | 189 | 962k | uint b = *psrc++; | 190 | | | 191 | 962k | *bufp++ = map[b >> 4]; | 192 | 962k | NEXT_MAP; | 193 | 962k | *bufp++ = map[b & 0xf]; | 194 | 962k | NEXT_MAP; | 195 | 962k | } | 196 | 34.8k | } else { | 197 | 0 | byte *bufp = bptr; | 198 | 0 | const byte *map = &ptab->lookup8[0]; | 199 | |
| 200 | 0 | while (left--) { | 201 | 0 | unsigned b = *psrc++; | 202 | |
| 203 | 0 | *bufp = map[b >> 6]; | 204 | 0 | NEXT_MAP8; | 205 | 0 | bufp += spread; | 206 | 0 | *bufp = map[(b >> 4) & 3]; | 207 | 0 | NEXT_MAP8; | 208 | 0 | bufp += spread; | 209 | 0 | *bufp = map[(b >> 2) & 3]; | 210 | 0 | NEXT_MAP8; | 211 | 0 | bufp += spread; | 212 | 0 | *bufp = map[b & 3]; | 213 | 0 | NEXT_MAP8; | 214 | 0 | bufp += spread; | 215 | 0 | } | 216 | 0 | } | 217 | 34.8k | *pdata_x = data_x & 3; | 218 | 34.8k | #ifdef PACIFY_VALGRIND | 219 | | /* Put any undefinedness back, and carry it over to the output. */ | 220 | 34.8k | VALGRIND_SET_VBITS(psrc-1, &vbits, 1); | 221 | 34.8k | { | 222 | 34.8k | byte ones = 0xff; | 223 | 34.8k | if (vbits & 0x30) | 224 | 34.8k | VALGRIND_SET_VBITS(bend - spread*3, &ones, 1); | 225 | 34.8k | if (vbits & 0x0C) | 226 | 34.8k | VALGRIND_SET_VBITS(bend - spread*2, &ones, 1); | 227 | 34.8k | if (vbits & 0x03) | 228 | 34.8k | VALGRIND_SET_VBITS(bend - spread*1, &ones, 1); | 229 | 34.8k | } | 230 | 34.8k | #endif | 231 | 34.8k | return bptr; | 232 | 34.8k | } |
sample_unpack_2_interleaved Line | Count | Source | 164 | 1 | { | 165 | 1 | const sample_lookup_t * ptab = &smap->table; | 166 | 1 | const byte *psrc = data + (data_x >> 2); | 167 | 1 | int left = dsize - (data_x >> 2); | 168 | 1 | DEFINE_SMAP_INDEX | 169 | | | 170 | 1 | #ifdef PACIFY_VALGRIND | 171 | 1 | byte *bend = bptr + left*spread; | 172 | 1 | byte vbits = 0; | 173 | | | 174 | | /* Allow for undefined bits at the end */ | 175 | 1 | VALGRIND_GET_VBITS(&psrc[left-1], &vbits, 1); | 176 | | /* At least the top 2 bits must be defined. If not, | 177 | | * don't change anything, and let valgrind complain. */ | 178 | 1 | if ((vbits & 0xC0) == 0) { | 179 | 1 | byte zero = 0; | 180 | 1 | VALGRIND_SET_VBITS(&psrc[left-1], &zero, 1); | 181 | 1 | } | 182 | 1 | #endif | 183 | | | 184 | 1 | if (spread == 1) { | 185 | 1 | bits16 *bufp = (bits16 *) bptr; | 186 | 1 | const bits16 *map = &ptab->lookup2x2to16[0]; | 187 | | | 188 | 25 | while (left--) { | 189 | 24 | uint b = *psrc++; | 190 | | | 191 | 24 | *bufp++ = map[b >> 4]; | 192 | 24 | NEXT_MAP; | 193 | 24 | *bufp++ = map[b & 0xf]; | 194 | 24 | NEXT_MAP; | 195 | 24 | } | 196 | 1 | } else { | 197 | 0 | byte *bufp = bptr; | 198 | 0 | const byte *map = &ptab->lookup8[0]; | 199 | |
| 200 | 0 | while (left--) { | 201 | 0 | unsigned b = *psrc++; | 202 | |
| 203 | 0 | *bufp = map[b >> 6]; | 204 | 0 | NEXT_MAP8; | 205 | 0 | bufp += spread; | 206 | 0 | *bufp = map[(b >> 4) & 3]; | 207 | 0 | NEXT_MAP8; | 208 | 0 | bufp += spread; | 209 | 0 | *bufp = map[(b >> 2) & 3]; | 210 | 0 | NEXT_MAP8; | 211 | 0 | bufp += spread; | 212 | 0 | *bufp = map[b & 3]; | 213 | 0 | NEXT_MAP8; | 214 | 0 | bufp += spread; | 215 | 0 | } | 216 | 0 | } | 217 | 1 | *pdata_x = data_x & 3; | 218 | 1 | #ifdef PACIFY_VALGRIND | 219 | | /* Put any undefinedness back, and carry it over to the output. */ | 220 | 1 | VALGRIND_SET_VBITS(psrc-1, &vbits, 1); | 221 | 1 | { | 222 | 1 | byte ones = 0xff; | 223 | 1 | if (vbits & 0x30) | 224 | 1 | VALGRIND_SET_VBITS(bend - spread*3, &ones, 1); | 225 | 1 | if (vbits & 0x0C) | 226 | 1 | VALGRIND_SET_VBITS(bend - spread*2, &ones, 1); | 227 | 1 | if (vbits & 0x03) | 228 | 1 | VALGRIND_SET_VBITS(bend - spread*1, &ones, 1); | 229 | 1 | } | 230 | 1 | #endif | 231 | 1 | return bptr; | 232 | 1 | } |
|
233 | | |
234 | | #undef NEXT_MAP |
235 | | |
236 | | const byte * |
237 | | TEMPLATE_sample_unpack_4(byte * bptr, int *pdata_x, const byte * data, int data_x, |
238 | | uint dsize, const sample_map *smap, int spread, |
239 | | int num_components_per_plane) |
240 | 61.9k | { |
241 | 61.9k | const sample_lookup_t * ptab = &smap->table; |
242 | 61.9k | byte *bufp = bptr; |
243 | 61.9k | const byte *psrc = data + (data_x >> 1); |
244 | 61.9k | int left = dsize - (data_x >> 1); |
245 | 61.9k | const byte *map = &ptab->lookup8[0]; |
246 | 61.9k | DEFINE_SMAP_INDEX |
247 | | |
248 | 61.9k | #ifdef PACIFY_VALGRIND |
249 | 61.9k | byte vbits = 0; |
250 | | |
251 | | /* Allow for undefined bits at the end */ |
252 | 61.9k | VALGRIND_GET_VBITS(&psrc[left-1], &vbits, 1); |
253 | | /* At least the top 4 bits must be defined. If not, |
254 | | * don't change anything, and let valgrind complain. */ |
255 | 61.9k | if ((vbits & 0xf0) == 0) { |
256 | 61.9k | byte zero = 0; |
257 | 61.9k | VALGRIND_SET_VBITS(&psrc[left-1], &zero, 1); |
258 | 61.9k | } |
259 | 61.9k | #endif |
260 | | |
261 | 2.78M | while (left--) { |
262 | 2.71M | uint b = *psrc++; |
263 | | |
264 | 2.71M | *bufp = map[b >> 4]; |
265 | 2.71M | NEXT_MAP8; |
266 | 2.71M | bufp += spread; |
267 | 2.71M | *bufp = map[b & 0xf]; |
268 | 2.71M | NEXT_MAP8; |
269 | 2.71M | bufp += spread; |
270 | 2.71M | } |
271 | 61.9k | #ifdef PACIFY_VALGRIND |
272 | | /* Put any undefinedness back, and carry it over to the output. */ |
273 | 61.9k | VALGRIND_SET_VBITS(psrc-1, &vbits, 1); |
274 | 61.9k | if ((vbits & 0x0f) != 0) { |
275 | 0 | byte ones = 0xFF; |
276 | 0 | VALGRIND_SET_VBITS(bufp-spread, &ones, 1); |
277 | 0 | } |
278 | 61.9k | #endif |
279 | 61.9k | *pdata_x = data_x & 1; |
280 | 61.9k | return bptr; |
281 | 61.9k | } Line | Count | Source | 240 | 61.9k | { | 241 | 61.9k | const sample_lookup_t * ptab = &smap->table; | 242 | 61.9k | byte *bufp = bptr; | 243 | 61.9k | const byte *psrc = data + (data_x >> 1); | 244 | 61.9k | int left = dsize - (data_x >> 1); | 245 | 61.9k | const byte *map = &ptab->lookup8[0]; | 246 | 61.9k | DEFINE_SMAP_INDEX | 247 | | | 248 | 61.9k | #ifdef PACIFY_VALGRIND | 249 | 61.9k | byte vbits = 0; | 250 | | | 251 | | /* Allow for undefined bits at the end */ | 252 | 61.9k | VALGRIND_GET_VBITS(&psrc[left-1], &vbits, 1); | 253 | | /* At least the top 4 bits must be defined. If not, | 254 | | * don't change anything, and let valgrind complain. */ | 255 | 61.9k | if ((vbits & 0xf0) == 0) { | 256 | 61.9k | byte zero = 0; | 257 | 61.9k | VALGRIND_SET_VBITS(&psrc[left-1], &zero, 1); | 258 | 61.9k | } | 259 | 61.9k | #endif | 260 | | | 261 | 2.78M | while (left--) { | 262 | 2.71M | uint b = *psrc++; | 263 | | | 264 | 2.71M | *bufp = map[b >> 4]; | 265 | 2.71M | NEXT_MAP8; | 266 | 2.71M | bufp += spread; | 267 | 2.71M | *bufp = map[b & 0xf]; | 268 | 2.71M | NEXT_MAP8; | 269 | 2.71M | bufp += spread; | 270 | 2.71M | } | 271 | 61.9k | #ifdef PACIFY_VALGRIND | 272 | | /* Put any undefinedness back, and carry it over to the output. */ | 273 | 61.9k | VALGRIND_SET_VBITS(psrc-1, &vbits, 1); | 274 | 61.9k | if ((vbits & 0x0f) != 0) { | 275 | 0 | byte ones = 0xFF; | 276 | 0 | VALGRIND_SET_VBITS(bufp-spread, &ones, 1); | 277 | 0 | } | 278 | 61.9k | #endif | 279 | 61.9k | *pdata_x = data_x & 1; | 280 | 61.9k | return bptr; | 281 | 61.9k | } |
Unexecuted instantiation: sample_unpack_4_interleaved |
282 | | |
283 | | const byte * |
284 | | TEMPLATE_sample_unpack_8(byte * bptr, int *pdata_x, const byte * data, int data_x, |
285 | | uint dsize, const sample_map *smap, int spread, |
286 | | int num_components_per_plane) |
287 | 14.5M | { |
288 | 14.5M | const sample_lookup_t * ptab = &smap->table; |
289 | 14.5M | byte *bufp = bptr; |
290 | 14.5M | const byte *psrc = data + data_x; |
291 | 14.5M | DEFINE_SMAP_INDEX |
292 | | |
293 | 14.5M | *pdata_x = 0; |
294 | 14.5M | if (spread == 1) { |
295 | 13.6M | if (MULTIPLE_MAPS || |
296 | 13.6M | ptab->lookup8[0] != 0 || |
297 | 13.6M | ptab->lookup8[255] != 255 |
298 | 13.6M | ) { |
299 | 24.2k | uint left = dsize - data_x; |
300 | 24.2k | const byte *map = &ptab->lookup8[0]; |
301 | | |
302 | 16.6M | while (left--) { |
303 | 16.6M | *bufp++ = map[*psrc++]; |
304 | 16.6M | NEXT_MAP8; |
305 | 16.6M | } |
306 | 13.6M | } else { /* No copying needed, and we'll use the data right away. */ |
307 | 13.6M | return psrc; |
308 | 13.6M | } |
309 | 13.6M | } else { |
310 | 937k | int left = dsize - data_x; |
311 | 937k | const byte *map = &ptab->lookup8[0]; |
312 | | |
313 | 793M | for (; left--; psrc++, bufp += spread) { |
314 | 792M | *bufp = map[*psrc]; |
315 | 792M | NEXT_MAP8; |
316 | 792M | } |
317 | 937k | } |
318 | 962k | return bptr; |
319 | 14.5M | } Line | Count | Source | 287 | 14.5M | { | 288 | 14.5M | const sample_lookup_t * ptab = &smap->table; | 289 | 14.5M | byte *bufp = bptr; | 290 | 14.5M | const byte *psrc = data + data_x; | 291 | 14.5M | DEFINE_SMAP_INDEX | 292 | | | 293 | 14.5M | *pdata_x = 0; | 294 | 14.5M | if (spread == 1) { | 295 | 13.6M | if (MULTIPLE_MAPS || | 296 | 13.6M | ptab->lookup8[0] != 0 || | 297 | 13.6M | ptab->lookup8[255] != 255 | 298 | 13.6M | ) { | 299 | 23.4k | uint left = dsize - data_x; | 300 | 23.4k | const byte *map = &ptab->lookup8[0]; | 301 | | | 302 | 16.3M | while (left--) { | 303 | 16.3M | *bufp++ = map[*psrc++]; | 304 | 16.3M | NEXT_MAP8; | 305 | 16.3M | } | 306 | 13.6M | } else { /* No copying needed, and we'll use the data right away. */ | 307 | 13.6M | return psrc; | 308 | 13.6M | } | 309 | 13.6M | } else { | 310 | 937k | int left = dsize - data_x; | 311 | 937k | const byte *map = &ptab->lookup8[0]; | 312 | | | 313 | 793M | for (; left--; psrc++, bufp += spread) { | 314 | 792M | *bufp = map[*psrc]; | 315 | 792M | NEXT_MAP8; | 316 | 792M | } | 317 | 937k | } | 318 | 961k | return bptr; | 319 | 14.5M | } |
sample_unpack_8_interleaved Line | Count | Source | 287 | 815 | { | 288 | 815 | const sample_lookup_t * ptab = &smap->table; | 289 | 815 | byte *bufp = bptr; | 290 | 815 | const byte *psrc = data + data_x; | 291 | 815 | DEFINE_SMAP_INDEX | 292 | | | 293 | 815 | *pdata_x = 0; | 294 | 815 | if (spread == 1) { | 295 | 815 | if (MULTIPLE_MAPS || | 296 | 0 | ptab->lookup8[0] != 0 || | 297 | 0 | ptab->lookup8[255] != 255 | 298 | 815 | ) { | 299 | 815 | uint left = dsize - data_x; | 300 | 815 | const byte *map = &ptab->lookup8[0]; | 301 | | | 302 | 313k | while (left--) { | 303 | 312k | *bufp++ = map[*psrc++]; | 304 | 312k | NEXT_MAP8; | 305 | 312k | } | 306 | 815 | } else { /* No copying needed, and we'll use the data right away. */ | 307 | 0 | return psrc; | 308 | 0 | } | 309 | 815 | } else { | 310 | 0 | int left = dsize - data_x; | 311 | 0 | const byte *map = &ptab->lookup8[0]; | 312 | |
| 313 | 0 | for (; left--; psrc++, bufp += spread) { | 314 | 0 | *bufp = map[*psrc]; | 315 | 0 | NEXT_MAP8; | 316 | 0 | } | 317 | 0 | } | 318 | 815 | return bptr; | 319 | 815 | } |
|
320 | | |
321 | | #undef NEXT_MAP |
322 | | #undef NEXT_MAP8 |
323 | | #undef DEFINE_SMAP_INDEX |
324 | | |
325 | | #else |
326 | | int dummy; |
327 | | #endif |