1 /*
2 * TechSmith Screen Codec 2 (aka Dora) decoder
3 * Copyright (c) 2012 Konstantin Shishkov
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 /**
23 * @file
24 * TechSmith Screen Codec 2 decoder
25 */
26
27 #define BITSTREAM_READER_LE
33
42
46
48 {
49 int i;
50
55 }
56 }
57
59 {
61
66 if (ret)
68
74 if (ret) {
77 }
82 if (ret) {
85 }
86 }
87
88 return 0;
89 }
90
91 #define DEQUANT(val, q) ((q * val + 0x80) >> 8)
92 #define DCT1D(d0, d1, d2, d3, s0, s1, s2, s3, OP) \
93 OP(d0, 5 * ((s0) + (s1) + (s2)) + 2 * (s3)); \
94 OP(d1, 5 * ((s0) - (s2) - (s3)) + 2 * (s1)); \
95 OP(d2, 5 * ((s0) - (s2) + (s3)) - 2 * (s1)); \
96 OP(d3, 5 * ((s0) - (s1) + (s2)) - 2 * (s3)); \
97
98 #define COL_OP(a, b) a = b
99 #define ROW_OP(a, b) a = ((b) + 0x20) >> 6
100
102 {
103 int i;
104 int tblk[4 * 4];
106
107 for (i = 0; i < 4; i++) {
108 t0 =
DEQUANT(q[0 + (i & 1)], in[0 * 4 + i]);
109 t1 =
DEQUANT(q[1 + (i & 1)], in[1 * 4 + i]);
110 t2 =
DEQUANT(q[0 + (i & 1)], in[2 * 4 + i]);
111 t3 =
DEQUANT(q[1 + (i & 1)], in[3 * 4 + i]);
112 DCT1D(tblk[0 * 4 + i], tblk[1 * 4 + i],
113 tblk[2 * 4 + i], tblk[3 * 4 + i],
115 }
116 for (i = 0; i < 4; i++) {
117 DCT1D(dst[0], dst[1], dst[2], dst[3],
118 tblk[i * 4 + 0], tblk[i * 4 + 1],
119 tblk[i * 4 + 2], tblk[i * 4 + 3],
ROW_OP);
121 }
122 }
123
126 {
128 int prev_dc,
dc, nc, ac, bpos,
val;
129 int i, j, k, l;
130
134 for (i = 0; i < 8; i++, dst +=
stride)
135 memset(dst, val, 16);
136 } else {
139 for (i = 0; i < 8; i++) {
140 for (j = 0; j < 16; j++)
143 }
144 }
145 return 0;
146 }
147
148 prev_dc = 0;
149 for (j = 0; j < 2; j++) {
150 for (k = 0; k < 4; k++) {
151 if (!(j | k)) {
153 } else {
155 if (dc == -1)
157 if (dc == 0x100)
159 }
160 dc = (dc + prev_dc) & 0xFF;
163
165 if (nc == -1)
167
168 bpos = 1;
169 memset(c->
block + 1, 0, 15 *
sizeof(*c->
block));
170 for (l = 0; l < nc; l++) {
172 if (ac == -1)
174 if (ac == 0x1000)
176 bpos += ac & 0xF;
177 if (bpos >= 16)
181 }
183 }
185 }
186 return 0;
187 }
188
191 {
194
196
197 for (mb_x = 0; mb_x < c->
mb_width; mb_x++) {
199
200 if (q == 0 || q == 3) // skip block
201 continue;
202 for (i = 0; i < 3; i++) {
206 if (ret)
208 }
209 }
210
211 return 0;
212 }
213
216 {
218 int buf_size = avpkt->
size;
221 uint32_t frame_type,
size;
225
227 frame_type = bytestream2_get_byte(&gb);
228 if (frame_type > 1) {
231 }
232
235 }
236
237 if (frame_type == 0) {
238 *got_frame = 1;
241
242 return buf_size;
243 }
244
248 }
249
250 c->
quant[0] = bytestream2_get_byte(&gb);
251 c->
quant[1] = bytestream2_get_byte(&gb);
257 }
258
259 for (i = 0; i < 3; i++) {
262 }
263
265
266 size = bytestream2_get_le32(&gb);
270 }
271
272 for (i = 0; i <
size; i++) {
273 val = bytestream2_get_byte(&gb);
274 len = val & 0x3F;
275 val >>= 6;
276 if (pos + len > num_mb) {
279 }
282 }
283 if (pos < num_mb) {
285 pos, num_mb);
287 }
288
290 size = bytestream2_peek_byte(&gb);
291 if (size & 1) {
292 size = bytestream2_get_byte(&gb) - 1;
293 } else {
294 size = bytestream2_get_le32(&gb) >> 1;
295 }
296 if (!size) {
301 skip_row = 0;
302 break;
303 }
304 }
305 if (!skip_row) {
308 }
309 }
314 }
316 if (ret) {
319 }
321 }
322
323 *got_frame = 1;
326
327 /* always report that the buffer was completely consumed */
328 return buf_size;
329 }
330
332 {
334
338
339 return 0;
340 }
341
343 {
346
348
350
354 }
355
363 }
364
369 }
370
371 return 0;
372 }
373
384 };