Go to the documentation of this file. 1 /*
2 * QuickDraw (qdrw) codec
3 * Copyright (c) 2004 Konstantin Shishkov
4 * Copyright (c) 2015 Vittorio Giovara
5 *
6 * This file is part of FFmpeg.
7 *
8 * FFmpeg is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
12 *
13 * FFmpeg is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with FFmpeg; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 */
22
23 /**
24 * @file
25 * Apple QuickDraw codec.
26 * https://developer.apple.com/legacy/library/documentation/mac/QuickDraw/QuickDraw-461.html
27 */
28
35
44
46 };
47
49 uint32_t *pal, int colors, int pixmap)
50 {
52
53 for (
i = 0;
i <= colors;
i++) {
55 unsigned int idx = bytestream2_get_be16(gbc); /* color index */
56 if (idx > 255 && !pixmap) {
58 "Palette index out of range: %u\n", idx);
60 continue;
61 }
64 r = bytestream2_get_byte(gbc);
66 g = bytestream2_get_byte(gbc);
68 b = bytestream2_get_byte(gbc);
70 pal[pixmap ?
i : idx] = (0xFF
U << 24) | (
r << 16) | (
g << 8) |
b;
71 }
72 return 0;
73 }
74
76 {
78 uint8_t *outdata = p->
data[0];
80
83 uint8_t *
out = outdata;
85
86 /* size of packed line */
88 size =
left = bytestream2_get_be16(gbc);
89 else
90 size =
left = bytestream2_get_byte(gbc);
93
94 /* decode line */
96 code = bytestream2_get_byte(gbc);
97 if (
code & 0x80 ) {
/* run */
98 pix = bytestream2_get_byte(gbc);
99 for (j = 0; j < 257 -
code; j++) {
101 out[
pos++] = (pix & 0xC0) >> 6;
103 out[
pos++] = (pix & 0x30) >> 4;
105 out[
pos++] = (pix & 0x0C) >> 2;
107 out[
pos++] = (pix & 0x03);
108 }
110 } else { /* copy */
111 for (j = 0; j <
code + 1; j++) {
112 pix = bytestream2_get_byte(gbc);
114 out[
pos++] = (pix & 0xC0) >> 6;
116 out[
pos++] = (pix & 0x30) >> 4;
118 out[
pos++] = (pix & 0x0C) >> 2;
120 out[
pos++] = (pix & 0x03);
121 }
123 }
124 }
126 }
127 return 0;
128 }
129
131 {
133 uint8_t *outdata = p->
data[0];
135
138 uint8_t *
out = outdata;
140
141 /* size of packed line */
142 size =
left = bytestream2_get_be16(gbc);
145
146 /* decode line */
148 code = bytestream2_get_byte(gbc);
149 if (
code & 0x80 ) {
/* run */
150 pix = bytestream2_get_byte(gbc);
151 for (j = 0; j < 257 -
code; j++) {
153 out[
pos++] = (pix & 0xF0) >> 4;
156 }
158 } else { /* copy */
159 for (j = 0; j <
code + 1; j++) {
160 pix = bytestream2_get_byte(gbc);
162 out[
pos++] = (pix & 0xF0) >> 4;
165 }
167 }
168 }
170 }
171 return 0;
172 }
173
175 {
177 uint8_t *outdata = p->
data[0];
179
182 uint16_t *
out = (uint16_t *)outdata;
184
185 /* size of packed line */
186 size =
left = bytestream2_get_be16(gbc);
189
190 /* decode line */
192 code = bytestream2_get_byte(gbc);
193 if (
code & 0x80 ) {
/* run */
194 pix = bytestream2_get_be16(gbc);
195 for (j = 0; j < 257 -
code; j++) {
198 }
199 }
201 } else { /* copy */
202 for (j = 0; j <
code + 1; j++) {
204 out[
pos++] = bytestream2_get_be16(gbc);
205 } else {
207 }
208 }
210 }
211 }
213 }
214 return 0;
215 }
216
219 {
222 uint8_t *outdata = p->
data[0];
223
226 uint8_t *
out = outdata;
228
229 /* size of packed line */
230 size =
left = bytestream2_get_be16(gbc);
233
234 /* decode line */
236 code = bytestream2_get_byte(gbc);
237 if (
code & 0x80 ) {
/* run */
238 pix = bytestream2_get_byte(gbc);
239 for (j = 0; j < 257 -
code; j++) {
246 }
247 }
249 } else { /* copy */
250 for (j = 0; j <
code + 1; j++) {
251 pix = bytestream2_get_byte(gbc);
258 }
259 }
261 }
262 }
264 }
265 return 0;
266 }
267
269 {
270 unsigned w,
h,
v0, v1;
271
272 if (buf_size < 40)
273 return 0;
274
279
281 return 0;
282
284 return 1;
285 if (
v0 == 0x0011 && v1 == 0x02FF)
286 return 2;
287 return 0;
288 }
289
290
293 {
295 int colors;
297 int ver;
298
302 )
304
306
307 /* smallest PICT header */
312 }
313
315 h = bytestream2_get_be16(&gbc);
316 w = bytestream2_get_be16(&gbc);
317
321
322 /* version 1 is identified by 0x1101
323 * it uses byte-aligned opcodes rather than word-aligned */
324 if (ver == 1) {
327 } else if (ver != 2) {
330 }
331
333
335 int bppcnt, bpp;
336 int rowbytes, pack_type;
338 int opcode = bytestream2_get_be16(&gbc);
339
340 switch(opcode) {
343 break;
347
348 flags = bytestream2_get_be16(&gbc) & 0xC000;
350 bppcnt = bytestream2_get_be16(&gbc); /* cmpCount */
351 bpp = bytestream2_get_be16(&gbc); /* cmpSize */
352
354 if (bppcnt == 1 && bpp == 8) {
356 } else if (bppcnt == 1 && (bpp == 4 || bpp == 2)) {
358 } else if (bppcnt == 3 && bpp == 5) {
360 } else {
362 "Invalid pixel format (bppcnt %d bpp %d) in Packbit\n",
363 bppcnt, bpp);
365 }
366
367 /* jump to palette */
369 colors = bytestream2_get_be16(&gbc);
370
371 if (colors < 0 || colors > 255) {
373 "Error color count - %i(0x%X)\n", colors, colors);
375 }
380 }
383
388
389 /* jump to image data */
391
395 }
396
399 else if (bpp == 2)
401 else if (bpp == 4)
403 else
407 *got_frame = 1;
408 break;
412
414 rowbytes = bytestream2_get_be16(&gbc) & 0x3FFF;
415 if (rowbytes <= 250) {
418 }
419
421 h = bytestream2_get_be16(&gbc);
422 w = bytestream2_get_be16(&gbc);
424
428
429 pack_type = bytestream2_get_be16(&gbc);
430
432 bppcnt = bytestream2_get_be16(&gbc); /* cmpCount */
433 bpp = bytestream2_get_be16(&gbc); /* cmpSize */
434
436 if (bppcnt == 3 && bpp == 8) {
438 } else if (bppcnt == 3 && bpp == 5 || bppcnt == 2 && bpp == 8) {
440 } else if (bppcnt == 4 && bpp == 8) {
442 } else {
444 "Invalid pixel format (bppcnt %d bpp %d) in Directbit\n",
445 bppcnt, bpp);
447 }
448
449 /* set packing when default is selected */
450 if (pack_type == 0)
451 pack_type = bppcnt;
452
453 if (pack_type != 3 && pack_type != 4) {
456 }
461
462 /* jump to data */
464
468 }
469
472 else
476 *got_frame = 1;
477 break;
479 bytestream2_get_be16(&gbc);
481 break;
482 default:
484 break;
485 }
486 /* exit the loop when a known pixel block has been found */
487 if (*got_frame) {
488 int eop, trail;
489
490 /* re-align to a word */
492
493 eop = bytestream2_get_be16(&gbc);
497 "Missing end of picture opcode (found 0x%04X)\n", eop);
498 if (trail)
500 break;
501 }
502 }
503
504 if (*got_frame) {
507
509 } else {
511
513 }
514 }
515
523 };
Tag MUST be and< 10hcoeff half pel interpolation filter coefficients, hcoeff[0] are the 2 middle coefficients[1] are the next outer ones and so on, resulting in a filter like:...eff[2], hcoeff[1], hcoeff[0], hcoeff[0], hcoeff[1], hcoeff[2] ... the sign of the coefficients is not explicitly stored but alternates after each coeff and coeff[0] is positive, so ...,+,-,+,-,+,+,-,+,-,+,... hcoeff[0] is not explicitly stored but found by subtracting the sum of all stored coefficients with signs from 32 hcoeff[0]=32 - hcoeff[1] - hcoeff[2] - ... a good choice for hcoeff and htaps is htaps=6 hcoeff={40,-10, 2} an alternative which requires more computations at both encoder and decoder side and may or may not be better is htaps=8 hcoeff={42,-14, 6,-2}ref_frames minimum of the number of available reference frames and max_ref_frames for example the first frame after a key frame always has ref_frames=1spatial_decomposition_type wavelet type 0 is a 9/7 symmetric compact integer wavelet 1 is a 5/3 symmetric compact integer wavelet others are reserved stored as delta from last, last is reset to 0 if always_reset||keyframeqlog quality(logarithmic quantizer scale) stored as delta from last, last is reset to 0 if always_reset||keyframemv_scale stored as delta from last, last is reset to 0 if always_reset||keyframe FIXME check that everything works fine if this changes between framesqbias dequantization bias stored as delta from last, last is reset to 0 if always_reset||keyframeblock_max_depth maximum depth of the block tree stored as delta from last, last is reset to 0 if always_reset||keyframequant_table quantization tableHighlevel bitstream structure:==============================--------------------------------------------|Header|--------------------------------------------|------------------------------------|||Block0||||split?||||yes no||||......... intra?||||:Block01 :yes no||||:Block02 :....... ..........||||:Block03 ::y DC ::ref index:||||:Block04 ::cb DC ::motion x :||||......... :cr DC ::motion y :||||....... ..........|||------------------------------------||------------------------------------|||Block1|||...|--------------------------------------------|------------ ------------ ------------|||Y subbands||Cb subbands||Cr subbands||||--- ---||--- ---||--- ---|||||LL0||HL0||||LL0||HL0||||LL0||HL0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||LH0||HH0||||LH0||HH0||||LH0||HH0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HL1||LH1||||HL1||LH1||||HL1||LH1|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HH1||HL2||||HH1||HL2||||HH1||HL2|||||...||...||...|||------------ ------------ ------------|--------------------------------------------Decoding process:=================------------|||Subbands|------------||||------------|Intra DC||||LL0 subband prediction ------------|\ Dequantization ------------------- \||Reference frames|\ IDWT|------- -------|Motion \|||Frame 0||Frame 1||Compensation . OBMC v -------|------- -------|--------------. \------> Frame n output Frame Frame<----------------------------------/|...|------------------- Range Coder:============Binary Range Coder:------------------- The implemented range coder is an adapted version based upon "Range encoding: an algorithm for removing redundancy from a digitised message." by G. N. N. Martin. The symbols encoded by the Snow range coder are bits(0|1). The associated probabilities are not fix but change depending on the symbol mix seen so far. bit seen|new state ---------+----------------------------------------------- 0|256 - state_transition_table[256 - old_state];1|state_transition_table[old_state];state_transition_table={ 0, 0, 0, 0, 0, 0, 0, 0, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 190, 191, 192, 194, 194, 195, 196, 197, 198, 199, 200, 201, 202, 202, 204, 205, 206, 207, 208, 209, 209, 210, 211, 212, 213, 215, 215, 216, 217, 218, 219, 220, 220, 222, 223, 224, 225, 226, 227, 227, 229, 229, 230, 231, 232, 234, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 248, 0, 0, 0, 0, 0, 0, 0};FIXME Range Coding of integers:------------------------- FIXME Neighboring Blocks:===================left and top are set to the respective blocks unless they are outside of the image in which case they are set to the Null block top-left is set to the top left block unless it is outside of the image in which case it is set to the left block if this block has no larger parent block or it is at the left side of its parent block and the top right block is not outside of the image then the top right block is used for top-right else the top-left block is used Null block y, cb, cr are 128 level, ref, mx and my are 0 Motion Vector Prediction:=========================1. the motion vectors of all the neighboring blocks are scaled to compensate for the difference of reference frames scaled_mv=(mv *(256 *(current_reference+1)/(mv.reference+1))+128)> the median of the scaled left