1 /*
2 * Escape 124 Video Decoder
3 * Copyright (C) 2008 Eli Friedman (eli.friedman@gmail.com)
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
24
25 #define BITSTREAM_READER_LE
27
32
37
43
46
48
51
54 }
55
56 /**
57 * Initialize the decoder
58 * @param avctx decoder context
59 * @return 0 success, negative on error
60 */
62 {
64
67
69 ((unsigned)avctx->
height / 8);
70
71 return 0;
72 }
73
75 {
76 unsigned i;
78
79 for (i = 0; i < 3; i++)
81
83
84 return 0;
85 }
86
89 {
90 unsigned i, j;
92
95
101
104 for (i = 0; i <
size; i++) {
105 unsigned mask_bits =
get_bits(gb, 4);
108
109 for (j = 0; j < 4; j++) {
110 if (mask_bits & (1 << j))
112 else
114 }
115 }
117 }
118
120 {
122 // This function reads a maximum of 23 bits,
123 // which is within the padding space
125 return -1;
127 if (!value)
129
131 if (value != (1 + ((1 << 3) - 1)))
133
135 if (value != (1 + ((1 << 3) - 1)) + ((1 << 7) - 1))
137
139 }
140
142 int* codebook_index, int superblock_index)
143 {
144 // This function reads a maximum of 22 bits; the callers
145 // guard this function appropriately
146 unsigned block_index,
depth;
147
149 static const char transitions[3][2] = { {2, 1}, {0, 2}, {1, 0} };
150 *codebook_index = transitions[*codebook_index][
get_bits1(gb)];
151 }
152
154
155 // depth = 0 means that this shouldn't read any bits;
156 // in theory, this is the same as get_bits(gb, 0), but
157 // that doesn't actually work.
158 block_index = depth ?
get_bits(gb, depth) : 0;
159
160 if (*codebook_index == 1) {
162 }
163
164 // This condition can occur with invalid bitstreams and
165 // *codebook_index == 2
168
170 }
171
173 // Formula: ((index / 4) * 16 + (index % 4) * 2) / 2
174 uint32_t *dst = sb->
pixels32 + index + (index & -4);
175
176 // This technically violates C99 aliasing rules, but it should be safe.
179 }
180
182 uint16_t*
src,
unsigned src_stride)
183 {
185 if (src)
186 for (y = 0; y < 8; y++)
187 memcpy(dest + y * dest_stride, src + y * src_stride,
188 sizeof(uint16_t) * 8);
189 else
190 for (y = 0; y < 8; y++)
191 memset(dest + y * dest_stride, 0, sizeof(uint16_t) * 8);
192 }
193
195 0x4, 0x8, 0x40, 0x80,
196 0x100, 0x200, 0x1000, 0x2000,
197 0x400, 0x800, 0x4000, 0x8000};
198
200 void *
data,
int *got_frame,
202 {
203 int buf_size = avpkt->
size;
206
209 unsigned i;
210
211 unsigned superblock_index, cb_index = 1,
212 superblock_col_index = 0,
213 superblocks_per_row = avctx->
width / 8, skip = -1;
214
215 uint16_t* old_frame_data, *new_frame_data;
216 unsigned old_stride, new_stride;
217
219
222
223 // This call also guards the potential depth reads for the
224 // codebook unpacking.
226 return -1;
227
230
231 // Leave last frame unchanged
232 // FIXME: Is this necessary? I haven't seen it in any real samples
233 if (!(frame_flags & 0x114) || !(frame_flags & 0x7800000)) {
236
238
239 *got_frame = 1;
242
244 }
245
246 for (i = 0; i < 3; i++) {
247 if (frame_flags & (1 << (17 + i))) {
248 unsigned cb_depth, cb_size;
249 if (i == 2) {
250 // This codebook can be cut off at places other than
251 // powers of 2, leaving some of the entries undefined.
253 cb_depth =
av_log2(cb_size - 1) + 1;
254 } else {
256 if (i == 0) {
257 // This is the most basic codebook: pow(2,depth) entries
258 // for a depth-length key
259 cb_size = 1 << cb_depth;
260 } else {
261 // This codebook varies per superblock
262 // FIXME: I don't think this handles integer overflow
263 // properly
265 }
266 }
270 return -1;
271 }
272 }
273
276
277 new_frame_data = (uint16_t*)frame->
data[0];
278 new_stride = frame->
linesize[0] / 2;
279 old_frame_data = (uint16_t*)s->
frame.
data[0];
281
283 superblock_index++) {
286 unsigned multi_mask = 0;
287
288 if (skip == -1) {
289 // Note that this call will make us skip the rest of the blocks
290 // if the frame prematurely ends
292 }
293
294 if (skip) {
296 old_frame_data, old_stride);
297 } else {
299 old_frame_data, old_stride);
300
306 for (i = 0; i < 16; i++) {
309 }
310 }
311 }
312
314 unsigned inv_mask =
get_bits(&gb, 4);
315 for (i = 0; i < 4; i++) {
316 if (inv_mask & (1 << i)) {
317 multi_mask ^= 0xF << i*4;
318 } else {
319 multi_mask ^=
get_bits(&gb, 4) << i*4;
320 }
321 }
322
323 for (i = 0; i < 16; i++) {
326 break;
328 superblock_index);
330 }
331 }
332 } else if (frame_flags & (1 << 16)) {
336 }
337 }
338
340 }
341
342 superblock_col_index++;
343 new_frame_data += 8;
344 if (old_frame_data)
345 old_frame_data += 8;
346 if (superblock_col_index == superblocks_per_row) {
347 new_frame_data += new_stride * 8 - superblocks_per_row * 8;
348 if (old_frame_data)
349 old_frame_data += old_stride * 8 - superblocks_per_row * 8;
350 superblock_col_index = 0;
351 }
352 skip--;
353 }
354
356 "Escape sizes: %i, %i, %i\n",
358
362
363 *got_frame = 1;
364
366 }
367
368
379 };